CategoricalSeqVariable

abstract def domain: CategoricalSeqDomain[C]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

def !==(other: Var): Boolean

final def ##(): Int

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

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

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

def ++=(es: Iterable[CategoricalValue[C]]): Unit

def +=(e: CategoricalValue[C]): Unit

def /:[B](z: B)(op: (B, CategoricalValue[C]) ⇒ B): B

final def :=(newValue: Value): Unit

def :\[B](z: B)(op: (CategoricalValue[C], B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def ===(other: Var): Boolean

Value comparisons (as distinct from variable pointer equality)

final def _append(elem: Int): CategoricalSeqVariable.this.type

def _appendAll(elts: TraversableOnce[Int]): Unit

def _appendAll(elts: Array[Int]): Unit

final def _apply(index: Int): Int

def _array: Array[Int]

final def _asArray: Array[Int]

def _asIntSeq: IntSeq

def _asSeq: IndexedSeq[Int]

def _capacityGrowthFactor: Double

def _clear(): Unit

def _considerShrinkingCapacity(): Unit

def _containsSorted(x: Int): Boolean

def _copyToArray(a: Array[Int]): Unit

final def _ensureCapacity(cap: Int): Unit

def _fill(elt: Int): Unit

def _foreach[U](f: (Int) ⇒ U): Unit

final def _increment(index: Int, incr: Int): Unit

def _indexForInsertSorted(i: Int): Int

Return the index at which value i should be inserted in order to maintain sorted order.

def _indexForInsertSortedLinear(i: Int): Int

def _indexOf(i: Int): Int

Return the index containing the value i, or -1 if i is not found.

def _indexOfSorted(i: Int): Int

Return the index containing the value i, or -1 if i is not found.

def _initialCapacity: Int

def _insert(index: Int, elt: Int): Unit

def _insertAll(index: Int, seq: Traversable[Int]): Unit

def _insertAllSorted(seq: Traversable[Int]): Unit

def _insertSorted(elt: Int): Unit

def _insertSortedNoDuplicates(elt: Int): Unit

final def _length: Int

def _mapToArray[A](a: Array[A], f: (Int) ⇒ A): Unit

def _prepend(elt: Int): Unit

def _prependAll(elts: TraversableOnce[Int]): Unit

def _reduceToSize(newSize: Int): Unit

def _remove(index: Int): Unit

def _remove(index: Int, count: Int): Unit

def _set(elts: Seq[Int]): Unit

def _set(elts: Array[Int]): Unit

final def _setCapacity(cap: Int): Unit

def _sizeHint(len: Int): Unit

def _sum: Int

def _takeAsIntSeq(len: Int): IntSeq

def _toArray: Array[Int]

def _toSeq: IndexedSeq[Int]

def _trimCapacity(): Unit

final def _update(index: Int, value: Int): Unit

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, CategoricalValue[C]) ⇒ B, combop: (B, B) ⇒ B): B

def appendCategories(xs: Iterable[C]): Unit

def appendCategory(x: C): Unit

def appendInt(i: Int): Unit

def appendInts(xs: Array[Int]): Unit

def appendInts(xs: Iterable[Int]): Unit

def apply(index: Int): CategoricalValue[C]

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def categoryValue(seqIndex: Int): C

def categoryValues: Seq[C]

def clear(): Unit

def clone(): AnyRef

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

def collectFirst[B](pf: PartialFunction[CategoricalValue[C], B]): Option[B]

def companion: GenericCompanion[Iterable]

def contains(elem: Any): Boolean

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

def copyToArray[B >: CategoricalValue[C]](xs: Array[B]): Unit

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

def copyToBuffer[B >: CategoricalValue[C]](dest: Buffer[B]): Unit

def count(p: (CategoricalValue[C]) ⇒ Boolean): Int

def discreteValues: IndexedSeq[DiscreteValue]

def drop(n: Int): Iterable[CategoricalValue[C]]

def dropRight(n: Int): Iterable[CategoricalValue[C]]

def dropWhile(p: (CategoricalValue[C]) ⇒ Boolean): Iterable[CategoricalValue[C]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(f: (CategoricalValue[C]) ⇒ Boolean): Boolean

def fill(newValue: Int): Unit

def filter(p: (CategoricalValue[C]) ⇒ Boolean): Iterable[CategoricalValue[C]]

def filterNot(p: (CategoricalValue[C]) ⇒ Boolean): Iterable[CategoricalValue[C]]

def finalize(): Unit

def find(p: (CategoricalValue[C]) ⇒ Boolean): Option[CategoricalValue[C]]

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

def flatten[B](implicit asTraversable: (CategoricalValue[C]) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: CategoricalValue[C]](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, CategoricalValue[C]) ⇒ B): B

def foldRight[B](z: B)(op: (CategoricalValue[C], B) ⇒ B): B

def forall(p: (CategoricalValue[C]) ⇒ Boolean): Boolean

def foreach[U](f: (CategoricalValue[C]) ⇒ U): Unit

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

final def getClass(): Class[_]

def groupBy[K](f: (CategoricalValue[C]) ⇒ K): Map[K, Iterable[CategoricalValue[C]]]

def grouped(size: Int): Iterator[Iterable[CategoricalValue[C]]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: CategoricalValue[C]

def headOption: Option[CategoricalValue[C]]

def indexOf[B >: CategoricalValue[C]](elem: B, from: Int): Int

def indexOf[B >: CategoricalValue[C]](elem: B): Int

def indexWhere(p: (CategoricalValue[C]) ⇒ Boolean): Int

def indexWhere(p: (CategoricalValue[C]) ⇒ Boolean, from: Int): Int

def init: Iterable[CategoricalValue[C]]

def inits: Iterator[Iterable[CategoricalValue[C]]]

def intValue(seqIndex: Int): Int

def intValues: Array[Int]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[CategoricalValue[C]]

def last: CategoricalValue[C]

def lastOption: Option[CategoricalValue[C]]

def length: Int

def map[B](f: (CategoricalValue[C]) ⇒ B): IndexedSeq[B]

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

def max[B >: CategoricalValue[C]](implicit cmp: Ordering[B]): CategoricalValue[C]

def maxBy[B](f: (CategoricalValue[C]) ⇒ B)(implicit cmp: Ordering[B]): CategoricalValue[C]

def min[B >: CategoricalValue[C]](implicit cmp: Ordering[B]): CategoricalValue[C]

def minBy[B](f: (CategoricalValue[C]) ⇒ B)(implicit cmp: Ordering[B]): CategoricalValue[C]

def mkString: String

def mkString(sep: String): String

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

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[CategoricalValue[C], Iterable[CategoricalValue[C]]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[CategoricalValue[C]]

def parCombiner: Combiner[CategoricalValue[C], ParIterable[CategoricalValue[C]]]

def partition(p: (CategoricalValue[C]) ⇒ Boolean): (Iterable[CategoricalValue[C]], Iterable[CategoricalValue[C]])

def printName: String

def product[B >: CategoricalValue[C]](implicit num: Numeric[B]): B

def reduce[A1 >: CategoricalValue[C]](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: CategoricalValue[C]](op: (B, CategoricalValue[C]) ⇒ B): B

def reduceLeftOption[B >: CategoricalValue[C]](op: (B, CategoricalValue[C]) ⇒ B): Option[B]

def reduceOption[A1 >: CategoricalValue[C]](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: CategoricalValue[C]](op: (CategoricalValue[C], B) ⇒ B): B

def reduceRightOption[B >: CategoricalValue[C]](op: (CategoricalValue[C], B) ⇒ B): Option[B]

def repr: Iterable[CategoricalValue[C]]

def reversed: List[CategoricalValue[C]]

def sameElements[B >: CategoricalValue[C]](that: GenIterable[B]): Boolean

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

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

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

def seq: Iterable[CategoricalValue[C]]

def set(seqIndex: Int, newValue: Int)(implicit d: DiffList): Unit

def set(newValue: Value)(implicit d: DiffList): Unit

Assign a new value to this variable

def size: Int

def skipNonCategories: Boolean

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

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

def sliding(size: Int): Iterator[Iterable[CategoricalValue[C]]]

def span(p: (CategoricalValue[C]) ⇒ Boolean): (Iterable[CategoricalValue[C]], Iterable[CategoricalValue[C]])

def splitAt(n: Int): (Iterable[CategoricalValue[C]], Iterable[CategoricalValue[C]])

def stringPrefix: String

def sum[B >: CategoricalValue[C]](implicit num: Numeric[B]): B

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

def tail: Iterable[CategoricalValue[C]]

def tails: Iterator[Iterable[CategoricalValue[C]]]

def take(n: Int): Iterable[CategoricalValue[C]]

def takeRight(n: Int): Iterable[CategoricalValue[C]]

def takeWhile(p: (CategoricalValue[C]) ⇒ Boolean): Iterable[CategoricalValue[C]]

def thisCollection: Iterable[CategoricalValue[C]]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, CategoricalValue[C], Col[CategoricalValue[C]]]): Col[CategoricalValue[C]]

def toArray[B >: CategoricalValue[C]](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: CategoricalValue[C]]: Buffer[B]

def toCollection(repr: Iterable[CategoricalValue[C]]): Iterable[CategoricalValue[C]]

def toIndexedSeq: IndexedSeq[CategoricalValue[C]]

def toIterable: Iterable[CategoricalValue[C]]

def toIterator: Iterator[CategoricalValue[C]]

def toList: List[CategoricalValue[C]]

def toMap[T, U](implicit ev: <:<[CategoricalValue[C], (T, U)]): Map[T, U]

def toSeq: IndexedSeq[CategoricalValue[C]]

def toSet[B >: CategoricalValue[C]]: Set[B]

def toStream: Stream[CategoricalValue[C]]

def toString(): String

def toTraversable: Traversable[CategoricalValue[C]]

def toVector: Vector[CategoricalValue[C]]

def transpose[B](implicit asTraversable: (CategoricalValue[C]) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def trimCapacity(): Unit

def uniqueIntValues: Array[Int]

def unzip[A1, A2](implicit asPair: (CategoricalValue[C]) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (CategoricalValue[C]) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def value: Value

Abstract method to return the value of this variable.

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

def view: IterableView[CategoricalValue[C], Iterable[CategoricalValue[C]]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (CategoricalValue[C]) ⇒ Boolean): FilterMonadic[CategoricalValue[C], Iterable[CategoricalValue[C]]]

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

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

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

def /:\[A1 >: CategoricalValue[C]](z: A1)(op: (A1, A1) ⇒ A1): A1