Collections

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (Collections, B)

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def collectMap2[A, B, C](xs1: List[A], xs2: List[B])(p: (A, B) ⇒ Boolean): Map[A, B]

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.

final def distinctBy[A, B](xs: List[A])(f: (A) ⇒ B): List[A]

def ensuring(cond: (Collections) ⇒ Boolean, msg: ⇒ Any): Collections

def ensuring(cond: (Collections) ⇒ Boolean): Collections

def ensuring(cond: Boolean, msg: ⇒ Any): Collections

def ensuring(cond: Boolean): Collections

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def exists2[A, B](xs1: List[A], xs2: List[B])(f: (A, B) ⇒ Boolean): Boolean

def finalize(): Unit

final def findOrElse[A](xs: TraversableOnce[A])(p: (A) ⇒ Boolean)(orElse: ⇒ A): A

final def flatCollect[A, B](elems: List[A])(pf: PartialFunction[A, Traversable[B]]): List[B]

final def flatMap2[A, B, C](xs1: List[A], xs2: List[B])(f: (A, B) ⇒ List[C]): List[C]

final def flattensToEmpty(xss: Seq[Seq[_]]): Boolean

final def forall2[A, B](xs1: List[A], xs2: List[B])(f: (A, B) ⇒ Boolean): Boolean

final def forall3[A, B, C](xs1: List[A], xs2: List[B], xs3: List[C])(f: (A, B, C) ⇒ Boolean): Boolean

final def foreach2[A, B](xs1: List[A], xs2: List[B])(f: (A, B) ⇒ Unit): Unit

final def foreach3[A, B, C](xs1: List[A], xs2: List[B], xs3: List[C])(f: (A, B, C) ⇒ Unit): Unit

final def foreachWithIndex[A, B](xs: List[A])(f: (A, Int) ⇒ Unit): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def map2[A, B, C](xs1: List[A], xs2: List[B])(f: (A, B) ⇒ C): List[C]

final def map3[A, B, C, D](xs1: List[A], xs2: List[B], xs3: List[C])(f: (A, B, C) ⇒ D): List[D]

final def mapFrom[A, A1 >: A, B](xs: List[A])(f: (A) ⇒ B): Map[A1, B]

final def mapWithIndex[A, B](xs: List[A])(f: (A, Int) ⇒ B): List[B]

final def mexists[A](xss: List[List[A]])(p: (A) ⇒ Boolean): Boolean

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

final def mfilter[A](xss: List[List[A]])(p: (A) ⇒ Boolean): List[A]

final def mfind[A](xss: List[List[A]])(p: (A) ⇒ Boolean): Option[A]

final def mforall[A](xss: List[List[A]])(p: (A) ⇒ Boolean): Boolean

final def mforeach[A](xss: List[List[A]])(f: (A) ⇒ Unit): Unit

final def mmap[A, B](xss: List[List[A]])(f: (A) ⇒ B): List[List[B]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val self: Any

val self: Any

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

def →[B](y: B): (Collections, B)

def x: Collections

def x: Collections