IntTuplesArray

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: Seq[Int], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Seq[Int]], B, That]): That

def ++:[B >: Seq[Int], That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[Seq[Int]], B, That]): That

def ++:[B >: Seq[Int], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Seq[Int]], B, That]): That

def /:[B](z: B)(op: (B, Seq[Int]) ⇒ B): B

def :\[B](z: B)(op: (Seq[Int], B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: B)(seqop: (B, Seq[Int]) ⇒ B, combop: (B, B) ⇒ B): B

def apply(pos: Int): Seq[Int]

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Seq[Int], B])(implicit bf: CanBuildFrom[Iterable[Seq[Int]], B, That]): That

def collectFirst[B](pf: PartialFunction[Seq[Int], B]): Option[B]

def companion: GenericCompanion[Iterable]

def copyToArray[B >: Seq[Int]](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: Seq[Int]](xs: Array[B]): Unit

def copyToArray[B >: Seq[Int]](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: Seq[Int]](dest: Buffer[B]): Unit

def count(p: (Seq[Int]) ⇒ Boolean): Int

def distinctIterator: Iterator[Seq[Int]]

def drop(n: Int): Iterable[Seq[Int]]

def dropRight(n: Int): Iterable[Seq[Int]]

def dropWhile(p: (Seq[Int]) ⇒ Boolean): Iterable[Seq[Int]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (Seq[Int]) ⇒ Boolean): Boolean

def filter(p: (Seq[Int]) ⇒ Boolean): Iterable[Seq[Int]]

def filterNot(p: (Seq[Int]) ⇒ Boolean): Iterable[Seq[Int]]

def finalize(): Unit

def find(p: (Seq[Int]) ⇒ Boolean): Option[Seq[Int]]

def flatMap[B, That](f: (Seq[Int]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Seq[Int]], B, That]): That

def flatten[B](implicit asTraversable: (Seq[Int]) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: Seq[Int]](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, Seq[Int]) ⇒ B): B

def foldRight[B](z: B)(op: (Seq[Int], B) ⇒ B): B

def forall(p: (Seq[Int]) ⇒ Boolean): Boolean

def foreach[U](f: (Seq[Int]) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Iterable[B]]

final def getClass(): Class[_]

def groupBy[K](f: (Seq[Int]) ⇒ K): Map[K, Iterable[Seq[Int]]]

def grouped(size: Int): Iterator[Iterable[Seq[Int]]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Seq[Int]

def headOption: Option[Seq[Int]]

def init: Iterable[Seq[Int]]

def inits: Iterator[Iterable[Seq[Int]]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def isTupleNonEmpty(seq: Seq[Int]): Boolean

def iterator: Iterator[Seq[Int]]

Iterator over tuples stored in the table.

def last: Seq[Int]

def lastOption: Option[Seq[Int]]

def map[B, That](f: (Seq[Int]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Seq[Int]], B, That]): That

def max[B >: Seq[Int]](implicit cmp: Ordering[B]): Seq[Int]

def maxBy[B](f: (Seq[Int]) ⇒ B)(implicit cmp: Ordering[B]): Seq[Int]

def min[B >: Seq[Int]](implicit cmp: Ordering[B]): Seq[Int]

def minBy[B](f: (Seq[Int]) ⇒ B)(implicit cmp: Ordering[B]): Seq[Int]

def mkString(sep: String): String

def mkString: String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[Seq[Int], Iterable[Seq[Int]]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[Seq[Int]]

def parCombiner: Combiner[Seq[Int], ParIterable[Seq[Int]]]

def partition(p: (Seq[Int]) ⇒ Boolean): (Iterable[Seq[Int]], Iterable[Seq[Int]])

def product[B >: Seq[Int]](implicit num: Numeric[B]): B

def reduce[A1 >: Seq[Int]](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: Seq[Int]](op: (B, Seq[Int]) ⇒ B): B

def reduceLeftOption[B >: Seq[Int]](op: (B, Seq[Int]) ⇒ B): Option[B]

def reduceOption[A1 >: Seq[Int]](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: Seq[Int]](op: (Seq[Int], B) ⇒ B): B

def reduceRightOption[B >: Seq[Int]](op: (Seq[Int], B) ⇒ B): Option[B]

def repr: Iterable[Seq[Int]]

def reversed: List[Seq[Int]]

def sameElements[B >: Seq[Int]](that: GenIterable[B]): Boolean

def scan[B >: Seq[Int], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[Seq[Int]], B, That]): That

def scanLeft[B, That](z: B)(op: (B, Seq[Int]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Seq[Int]], B, That]): That

def scanRight[B, That](z: B)(op: (Seq[Int], B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Seq[Int]], B, That]): That

def seq: Iterable[Seq[Int]]

def set(pos: Int, elems: Seq[Int]): Unit

def size: Int

def slice(from: Int, until: Int): Iterable[Seq[Int]]

def sliding(size: Int, step: Int): Iterator[Iterable[Seq[Int]]]

def sliding(size: Int): Iterator[Iterable[Seq[Int]]]

def span(p: (Seq[Int]) ⇒ Boolean): (Iterable[Seq[Int]], Iterable[Seq[Int]])

def splitAt(n: Int): (Iterable[Seq[Int]], Iterable[Seq[Int]])

def stringPrefix: String

def sum[B >: Seq[Int]](implicit num: Numeric[B]): B

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

var table: Array[Int]

Tuples are stored in one table as consecutive elements.

def tail: Iterable[Seq[Int]]

def tails: Iterator[Iterable[Seq[Int]]]

def take(n: Int): Iterable[Seq[Int]]

def takeRight(n: Int): Iterable[Seq[Int]]

def takeWhile(p: (Seq[Int]) ⇒ Boolean): Iterable[Seq[Int]]

def thisCollection: Iterable[Seq[Int]]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Seq[Int], Col[Seq[Int]]]): Col[Seq[Int]]

def toArray[B >: Seq[Int]](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: Seq[Int]]: Buffer[B]

def toCollection(repr: Iterable[Seq[Int]]): Iterable[Seq[Int]]

def toIndexedSeq: IndexedSeq[Seq[Int]]

def toIterable: Iterable[Seq[Int]]

def toIterator: Iterator[Seq[Int]]

def toList: List[Seq[Int]]

def toMap[T, U](implicit ev: <:<[Seq[Int], (T, U)]): Map[T, U]

def toSeq: Seq[Seq[Int]]

def toSet[B >: Seq[Int]]: Set[B]

def toStream: Stream[Seq[Int]]

def toString(): String

def toTraversable: Traversable[Seq[Int]]

def toVector: Vector[Seq[Int]]

def transpose[B](implicit asTraversable: (Seq[Int]) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def tuplesIterator: Iterator[Seq[Int]]

def unzip[A1, A2](implicit asPair: (Seq[Int]) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Seq[Int]) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def view(from: Int, until: Int): IterableView[Seq[Int], Iterable[Seq[Int]]]

def view: IterableView[Seq[Int], Iterable[Seq[Int]]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (Seq[Int]) ⇒ Boolean): FilterMonadic[Seq[Int], Iterable[Seq[Int]]]

def zip[A1 >: Seq[Int], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[Seq[Int]], (A1, B), That]): That

def zipAll[B, A1 >: Seq[Int], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[Seq[Int]], (A1, B), That]): That

def zipWithIndex[A1 >: Seq[Int], That](implicit bf: CanBuildFrom[Iterable[Seq[Int]], (A1, Int), That]): That

def /:\[A1 >: Seq[Int]](z: A1)(op: (A1, A1) ⇒ A1): A1