Searching

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def minimalElements[A](as: Iterable[A])(implicit ev: PartialOrder[A]): Seq[A]

Computes the minimal elements of a partially ordered set.
Computes the minimal elements of a partially ordered set. If the poset contains multiple copies of a minimal element, the function will only return a single copy of it.
Works by constructing the set of minimal elements for the first k elements of the poset, for k = 1 .. length.
With n is the size of the poset and w <= n its width, the algorithm requires O(w) space and O(w*n) time.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def search[A](as: IndexedSeq[A], item: A, lower: Int, upper: Int)(implicit arg0: Order[A]): Int

Performs a binary search, returns an index using the same convention as java.util.Arrays.binarySearch.
final def search[A](as: IndexedSeq[A], item: A)(implicit arg0: Order[A]): Int

Performs a binary search, returns an index using the same convention as java.util.Arrays.binarySearch.
final def search[A](as: Array[A], item: A, lower: Int, upper: Int)(implicit arg0: Order[A]): Int

Performs a binary search, returns an index using the same convention as java.util.Arrays.binarySearch.
final def search[A](as: Array[A], item: A)(implicit arg0: Order[A]): Int

Performs a binary search, returns an index using the same convention as java.util.Arrays.binarySearch.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package math

object Searching

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def minimalElements[A](as: Iterable[A])(implicit ev: PartialOrder[A]): Seq[A]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def search[A](as: IndexedSeq[A], item: A, lower: Int, upper: Int)(implicit arg0: Order[A]): Int

final def search[A](as: IndexedSeq[A], item: A)(implicit arg0: Order[A]): Int

final def search[A](as: Array[A], item: A, lower: Int, upper: Int)(implicit arg0: Order[A]): Int

final def search[A](as: Array[A], item: A)(implicit arg0: Order[A]): Int

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped