Searching

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

11. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

12. def hashCode(): Int

    Definition Classes

    AnyRef → Any

13. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

14. 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.

15. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

16. final def notify(): Unit

    Definition Classes

    AnyRef

17. final def notifyAll(): Unit

    Definition Classes

    AnyRef

18. 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.

    Performs a binary search, returns an index using the same convention as java.util.Arrays.binarySearch.

19. 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.

    Performs a binary search, returns an index using the same convention as java.util.Arrays.binarySearch.

20. 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.

    Performs a binary search, returns an index using the same convention as java.util.Arrays.binarySearch.

21. 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.

    Performs a binary search, returns an index using the same convention as java.util.Arrays.binarySearch.

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

    Definition Classes

    AnyRef

23. def toString(): String

    Definition Classes

    AnyRef → Any

24. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )