Lists

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. object Implicits extends Implicits

   

5. def aggregate[T, K, A](list: Iterable[T])(getKey: (T) ⇒ K)(agg: (Option[A], T) ⇒ A): Map[K, A]

   

   Build a map with a custom function for aggregating collisions

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. def map1[A, B, C](t: (A, B))(f: (A) ⇒ C): (C, B)

    

15. def map12[A, B, C, D](t: (A, B))(f1: (A) ⇒ C, f2: (B) ⇒ D): (C, D)

    

16. def map2[A, B, C](t: (A, B))(f: (B) ⇒ C): (A, C)

    

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

    

    Definition Classes

    AnyRef

18. final def notify(): Unit

    

    Definition Classes

    AnyRef

19. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

20. def nth[T](seq: Seq[T], target: Int)(implicit ord: Ordering[T]): Option[T]

    

    Finds the nth smallest value in an unsorted list in O(n) time and O(n) space E.g., nth(List(3,2,4,1), 0) => 1 and nth(List(3,2,4,1), 2) => 3

21. def powerset[T](xs: List[T]): List[List[T]]

    

    Returns the powerset of a List

    Returns the powerset of a List

    If you don't care about ordering use Set(1,2,3).subsets.

22. def product[T](lists: List[T]*): List[List[T]]

    

    Cartesian product of an arbitrary number of lists Iterating starts from the first list to the last list e.g.

    Cartesian product of an arbitrary number of lists Iterating starts from the first list to the last list e.g. List(1,2), List(3,4) returns List(1,3), List(2,3), List(1,4), List(2,4)

23. def productReverse[T](lists: List[T]*): List[List[T]]

    

    Cartesian product of an arbitrary number of lists Iterating starts from the last list to the first list e.g.

    Cartesian product of an arbitrary number of lists Iterating starts from the last list to the first list e.g. List(1,2), List(3,4) returns List(1,3), List(1,4), List(2,3), List(2,4)

24. def removeAll[T, Repr, R <: Traversable[T]](left: TraversableLike[T, Repr], right: R): Repr

    

    Remove all elements from left that are in right

25. def removeAllBy[T, K, Repr, R <: Traversable[T]](left: TraversableLike[T, Repr], right: R)(f: (T) ⇒ K): Repr

    

    Like removeAll, but uses a key function to determine equality.

    Like removeAll, but uses a key function to determine equality. Useful for using IDs to determine equality

26. def sequence1[A, B](t: (Option[A], B)): Option[(A, B)]

    

    Functions so simple their type signature determines their implementation

27. def sequence2[A, B](t: (A, Option[B])): Option[(A, B)]

    

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

    

    Definition Classes

    AnyRef

29. def toString(): String

    

    Definition Classes

    AnyRef → Any

30. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

33. def zipWith[A, B, C](as: Seq[A], bs: Seq[B])(f: (A, B) ⇒ C): Seq[C]

    

    Zips with a binary operation