object Collections extends Collections

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Collections
  2. Collections
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. final def collectFirst[A, B](as: List[A])(pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    Collections
  7. final def collectMap2[A, B, C](xs1: List[A], xs2: List[B])(p: (A, B) ⇒ Boolean): Map[A, B]
    Definition Classes
    Collections
  8. final def compareLengths(xs1: List[_], xs2: List[_]): Int
    Definition Classes
    Collections
    Annotations
    @tailrec()
  9. final def corresponds3[A, B, C](xs1: List[A], xs2: List[B], xs3: List[C])(f: (A, B, C) ⇒ Boolean): Boolean

    True if all three arguments have the same number of elements and the function is true for all the triples.

    True if all three arguments have the same number of elements and the function is true for all the triples.

    Definition Classes
    Collections
    Annotations
    @tailrec()
  10. final def distinctBy[A, B](xs: List[A])(f: (A) ⇒ B): List[A]
    Definition Classes
    Collections
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. final def exists2[A, B](xs1: List[A], xs2: List[B])(f: (A, B) ⇒ Boolean): Boolean
    Definition Classes
    Collections
  14. final def exists3[A, B, C](xs1: List[A], xs2: List[B], xs3: List[C])(f: (A, B, C) ⇒ Boolean): Boolean
    Definition Classes
    Collections
  15. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def findOrElse[A](xs: TraversableOnce[A])(p: (A) ⇒ Boolean)(orElse: ⇒ A): A
    Definition Classes
    Collections
  17. final def flatCollect[A, B](elems: List[A])(pf: PartialFunction[A, Traversable[B]]): List[B]
    Definition Classes
    Collections
  18. final def flatMap2[A, B, C](xs1: List[A], xs2: List[B])(f: (A, B) ⇒ List[C]): List[C]
    Definition Classes
    Collections
  19. final def flattensToEmpty(xss: Seq[Seq[_]]): Boolean
    Definition Classes
    Collections
    Annotations
    @tailrec()
  20. final def forall3[A, B, C](xs1: List[A], xs2: List[B], xs3: List[C])(f: (A, B, C) ⇒ Boolean): Boolean
    Definition Classes
    Collections
  21. final def foreach2[A, B](xs1: List[A], xs2: List[B])(f: (A, B) ⇒ Unit): Unit
    Definition Classes
    Collections
  22. final def foreach3[A, B, C](xs1: List[A], xs2: List[B], xs3: List[C])(f: (A, B, C) ⇒ Unit): Unit
    Definition Classes
    Collections
  23. final def foreachWithIndex[A, B](xs: List[A])(f: (A, Int) ⇒ Unit): Unit
    Definition Classes
    Collections
  24. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  25. final def hasLength(xs: List[_], len: Int): Boolean

    Again avoiding calling length, but the lengthCompare interface is clunky.

    Again avoiding calling length, but the lengthCompare interface is clunky.

    Definition Classes
    Collections
  26. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  27. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  28. final def linkedMapFrom[A, A1 >: A, B](xs: List[A])(f: (A) ⇒ B): LinkedHashMap[A1, B]
    Definition Classes
    Collections
  29. final def map2[A, B, C](xs1: List[A], xs2: List[B])(f: (A, B) ⇒ C): List[C]
    Definition Classes
    Collections
  30. final def map2Conserve[A <: AnyRef, B](xs: List[A], ys: List[B])(f: (A, B) ⇒ A): List[A]

    like map2, but returns list xs itself - instead of a copy - if function f maps all elements to themselves.

    like map2, but returns list xs itself - instead of a copy - if function f maps all elements to themselves.

    Definition Classes
    Collections
  31. final def map3[A, B, C, D](xs1: List[A], xs2: List[B], xs3: List[C])(f: (A, B, C) ⇒ D): List[D]
    Definition Classes
    Collections
  32. final def mapFrom[A, A1 >: A, B](xs: List[A])(f: (A) ⇒ B): Map[A1, B]
    Definition Classes
    Collections
  33. final def mapList[A, B](as: List[A])(f: (A) ⇒ B): List[B]

    A version of List#map, specialized for List, and optimized to avoid allocation if as is empty

    A version of List#map, specialized for List, and optimized to avoid allocation if as is empty

    Definition Classes
    Collections
  34. final def mapWithIndex[A, B](xs: List[A])(f: (A, Int) ⇒ B): List[B]
    Definition Classes
    Collections
  35. final def mexists[A](xss: List[List[A]])(p: (A) ⇒ Boolean): Boolean

    All these mm methods are "deep map" style methods for mapping etc.

    All these mm methods are "deep map" style methods for mapping etc. on a list of lists while avoiding unnecessary intermediate structures like those created via flatten.

    Definition Classes
    Collections
  36. final def mfind[A](xss: List[List[A]])(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    Collections
  37. final def mforall[A](xss: List[List[A]])(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    Collections
  38. final def mforeach[A](xss: Traversable[Traversable[A]])(f: (A) ⇒ Unit): Unit
    Definition Classes
    Collections
  39. final def mforeach[A](xss: List[List[A]])(f: (A) ⇒ Unit): Unit

    These are all written in terms of List because we're trying to wring all the performance we can and List is used almost exclusively in the compiler, but people are branching out in their collections so here's an overload.

    These are all written in terms of List because we're trying to wring all the performance we can and List is used almost exclusively in the compiler, but people are branching out in their collections so here's an overload.

    Definition Classes
    Collections
  40. final def mmap[A, B](xss: List[List[A]])(f: (A) ⇒ B): collection.immutable.List[collection.immutable.List[B]]
    Definition Classes
    Collections
  41. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  42. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  43. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  44. final def sameElementsEquals(thiss: List[AnyRef], that: List[AnyRef]): Boolean
    Definition Classes
    Collections
  45. final def sameLength(xs1: List[_], xs2: List[_]): Boolean

    True if two lists have the same length.

    True if two lists have the same length. Since calling length on linear sequences is O(n), it is an inadvisable way to test length equality.

    Definition Classes
    Collections
  46. final def sequenceOpt[A](as: List[Option[A]]): Option[List[A]]
    Definition Classes
    Collections
  47. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  48. def toString(): String
    Definition Classes
    AnyRef → Any
  49. final def transposeSafe[A](ass: List[List[A]]): Option[List[List[A]]]
    Definition Classes
    Collections
  50. final def traverseOpt[A, B](as: List[A])(f: (A) ⇒ Option[B]): Option[List[B]]
    Definition Classes
    Collections
  51. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  52. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  53. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from Collections

Inherited from AnyRef

Inherited from Any

Ungrouped