Combinatorics

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def cartesianProduct[A](seqs: List[Seq[A]]): Iterator[List[A]]

Compute the elements of the Cartesian product of the given sequences.

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def genCoveredVectors(nums: List[Int]): Iterator[List[Int]]

Generate all vectors that are <= nums.

def genSubMultisets[A](seq: Seq[A]): Iterator[List[A]]

Compute the sub-multisets of the given multi-set.

def genSubsequences[A](seqs: Seq[Seq[A]], nums: Seq[Int]): Iterator[List[A]]

def genSubsequences[A](seq: Seq[A], num: Int): Iterator[List[A]]

Compute all sub-sequences of the given sequence with exactly num elements.

def genSubsequencesWithDups[A](seqs: Seq[Seq[A]], nums: Seq[Int]): Iterator[List[A]]

def genSubsequencesWithDups[A](seq: Seq[A], num: Int): Iterator[List[A]]

Compute all sub-sequences of the given sequence with exactly num elements, allowing elements to occur repeatedly.

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit