CategoricalDomain

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def ++=(xs: Traversable[C]): Unit

def +:[B >: variable.CategoricalValue[C], That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[C]], B, That]): That

def +=(x: C): Unit

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

def :+[B >: variable.CategoricalValue[C], That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[C]], B, That]): That

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def _append(elem: Int): CategoricalDomain.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

lazy val _dimensionDomain: CategoricalDomain[C]

def _elements: ArrayBuffer[Value]

final def _ensureCapacity(cap: Int): Unit

def _fill(elt: Int): Unit

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

var _frozen: Boolean

If true, do not allow this domain to change.

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 _indices: Map[C, Value]

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

def andThen[C](k: (variable.CategoricalValue[C]) ⇒ C): PartialFunction[Int, C]

def apply(i: Int): Value

def applyOrElse[A1 <: Int, B1 >: variable.CategoricalValue[C]](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def categories: Seq[C]

def category(i: Int): C

def clear(): Unit

Wipe the domain and its indices clean

def clone(): AnyRef

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

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

def combinations(n: Int): Iterator[IndexedSeq[variable.CategoricalValue[C]]]

def companion: GenericCompanion[IndexedSeq]

def compose[A](g: (A) ⇒ Int): (A) ⇒ variable.CategoricalValue[C]

def contains(elem: Any): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

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

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

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

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

def corresponds[B](that: GenSeq[B])(p: (variable.CategoricalValue[C], B) ⇒ Boolean): Boolean

def count(category: C): Int

def count(i: Int): Int

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

def counts: IntSeq

def countsTotal: Int

def diff[B >: variable.CategoricalValue[C]](that: GenSeq[B]): IndexedSeq[variable.CategoricalValue[C]]

def dimensionDomain: CategoricalDomain[C]

def dimensionName(i: Int): String

def dimensionSize: Int

A convenience method to get the size of the dimensionDomain.

def distinct: IndexedSeq[variable.CategoricalValue[C]]

def drop(n: Int): IndexedSeq[variable.CategoricalValue[C]]

def dropRight(n: Int): IndexedSeq[variable.CategoricalValue[C]]

def dropWhile(p: (variable.CategoricalValue[C]) ⇒ Boolean): IndexedSeq[variable.CategoricalValue[C]]

def endsWith[B](that: GenSeq[B]): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (variable.CategoricalValue[C]) ⇒ Boolean): Boolean

def filter(p: (variable.CategoricalValue[C]) ⇒ Boolean): IndexedSeq[variable.CategoricalValue[C]]

def filterNot(p: (variable.CategoricalValue[C]) ⇒ Boolean): IndexedSeq[variable.CategoricalValue[C]]

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (variable.CategoricalValue[C]) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

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

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

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

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

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

def freeze(): Unit

def frozen: Boolean

Can new category values be added to this Domain?

var gatherCounts: Boolean

If true, then each call to CategoricalDomain.

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

def getAll(c: Set[Int]): Set[Value]

def getAll(c: Array[Int]): ArraySeq[Value]

def getAll(c: List[Int]): List[Value]

def getAll(c: Iterator[Int]): Iterator[Value]

final def getClass(): Class[_]

def getIndex(category: C): Int

Like index, but throw an exception if the category is not already there.

def groupBy[K](f: (variable.CategoricalValue[C]) ⇒ K): Map[K, IndexedSeq[variable.CategoricalValue[C]]]

def grouped(size: Int): Iterator[IndexedSeq[variable.CategoricalValue[C]]]

var growPastMaxSize: Boolean

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: variable.CategoricalValue[C]

def headOption: Option[variable.CategoricalValue[C]]

def incrementCount(category: C): Unit

def incrementCount(i: Int): Unit

def index(category: C): Int

Return the integer associated with the category, and also, if gatherCounts is true, also increment the count of category.

def indexAll(c: Set[C]): Set[Int]

def indexAll(c: Array[C]): Array[Int]

def indexAll(c: List[C]): List[Int]

def indexAll(c: Iterator[C]): Iterator[Int]

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

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

def indexOfSlice[B >: variable.CategoricalValue[C]](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: variable.CategoricalValue[C]](that: GenSeq[B]): Int

def indexOnly(category: C): Int

Return the integer associated with the category, do not increment the count of category, even if gatherCounts is true.

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

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

def indices: Range

def init: IndexedSeq[variable.CategoricalValue[C]]

def inits: Iterator[IndexedSeq[variable.CategoricalValue[C]]]

def intersect[B >: variable.CategoricalValue[C]](that: GenSeq[B]): IndexedSeq[variable.CategoricalValue[C]]

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Value]

def last: variable.CategoricalValue[C]

def lastIndexOf[B >: variable.CategoricalValue[C]](elem: B, end: Int): Int

def lastIndexOf[B >: variable.CategoricalValue[C]](elem: B): Int

def lastIndexOfSlice[B >: variable.CategoricalValue[C]](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: variable.CategoricalValue[C]](that: GenSeq[B]): Int

def lastIndexWhere(p: (variable.CategoricalValue[C]) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: (variable.CategoricalValue[C]) ⇒ Boolean): Int

def lastOption: Option[variable.CategoricalValue[C]]

final def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[variable.CategoricalValue[C]]

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

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

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

var maxRequestedInt: Int

var maxSize: Int

If positive, throw error if size tries to grow larger than it.

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

def minBy[B](f: (variable.CategoricalValue[C]) ⇒ B)(implicit cmp: Ordering[B]): variable.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[variable.CategoricalValue[C], IndexedSeq[variable.CategoricalValue[C]]]

def newCategoricalValue(i: Int, e: C): CategoricalValue

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: Int, B1 >: variable.CategoricalValue[C]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def padTo[B >: variable.CategoricalValue[C], That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[C]], B, That]): That

def par: ParSeq[variable.CategoricalValue[C]]

def parCombiner: Combiner[variable.CategoricalValue[C], ParSeq[variable.CategoricalValue[C]]]

def partition(p: (variable.CategoricalValue[C]) ⇒ Boolean): (IndexedSeq[variable.CategoricalValue[C]], IndexedSeq[variable.CategoricalValue[C]])

def patch[B >: variable.CategoricalValue[C], That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[C]], B, That]): That

def permutations: Iterator[IndexedSeq[variable.CategoricalValue[C]]]

def prefixLength(p: (variable.CategoricalValue[C]) ⇒ Boolean): Int

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

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

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

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

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

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

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

def repr: IndexedSeq[variable.CategoricalValue[C]]

def reverse: IndexedSeq[variable.CategoricalValue[C]]

def reverseIterator: Iterator[variable.CategoricalValue[C]]

def reverseMap[B, That](f: (variable.CategoricalValue[C]) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[C]], B, That]): That

def reversed: List[variable.CategoricalValue[C]]

def runWith[U](action: (variable.CategoricalValue[C]) ⇒ U): (Int) ⇒ Boolean

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

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

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

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

def segmentLength(p: (variable.CategoricalValue[C]) ⇒ Boolean, from: Int): Int

def seq: IndexedSeq[variable.CategoricalValue[C]]

def size: Int

def sizeAtCount(c: Int): Int

Return the number of unique entries with count equal to 'c'.

def sizeAtOrAboveCount(threshold: Int): Int

Return the number of unique entries with count greater than or equal to 'threshold'.

def sizeBelowCount(threshold: Int): Int

Return the number of unique entries with count below 'threshold'.

def slice(from: Int, until: Int): IndexedSeq[variable.CategoricalValue[C]]

def sliding(size: Int, step: Int): Iterator[IndexedSeq[variable.CategoricalValue[C]]]

def sliding(size: Int): Iterator[IndexedSeq[variable.CategoricalValue[C]]]

def sortBy[B](f: (variable.CategoricalValue[C]) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[variable.CategoricalValue[C]]

def sortWith(lt: (variable.CategoricalValue[C], variable.CategoricalValue[C]) ⇒ Boolean): IndexedSeq[variable.CategoricalValue[C]]

def sorted[B >: variable.CategoricalValue[C]](implicit ord: Ordering[B]): IndexedSeq[variable.CategoricalValue[C]]

def span(p: (variable.CategoricalValue[C]) ⇒ Boolean): (IndexedSeq[variable.CategoricalValue[C]], IndexedSeq[variable.CategoricalValue[C]])

def splitAt(n: Int): (IndexedSeq[variable.CategoricalValue[C]], IndexedSeq[variable.CategoricalValue[C]])

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

def startsWith[B](that: GenSeq[B]): Boolean

def stringPrefix: String

def stringToCategory(s: String): C

If type T is not string, this should be overridden to provide de-serialization

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

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

def tail: IndexedSeq[variable.CategoricalValue[C]]

def tails: Iterator[IndexedSeq[variable.CategoricalValue[C]]]

def take(n: Int): IndexedSeq[variable.CategoricalValue[C]]

def takeRight(n: Int): IndexedSeq[variable.CategoricalValue[C]]

def takeWhile(p: (variable.CategoricalValue[C]) ⇒ Boolean): IndexedSeq[variable.CategoricalValue[C]]

def thisCollection: IndexedSeq[variable.CategoricalValue[C]]

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

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

def toBuffer[A1 >: variable.CategoricalValue[C]]: Buffer[A1]

def toCollection(repr: IndexedSeq[variable.CategoricalValue[C]]): IndexedSeq[variable.CategoricalValue[C]]

def toIndexedSeq: IndexedSeq[variable.CategoricalValue[C]]

def toIterable: Iterable[variable.CategoricalValue[C]]

def toIterator: Iterator[variable.CategoricalValue[C]]

def toList: List[variable.CategoricalValue[C]]

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

def toSeq: Seq[variable.CategoricalValue[C]]

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

def toStream: Stream[variable.CategoricalValue[C]]

def toString(): String

def toTraversable: Traversable[variable.CategoricalValue[C]]

def toVector: Vector[variable.CategoricalValue[C]]

def transpose[B](implicit asTraversable: (variable.CategoricalValue[C]) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

def trimBelowCount(threshold: Int): Int

Returns the number of unique entries trimmed

def trimBelowSize(target: Int): Int

Returns the count threshold below which entries were discarded.

def unapply(value: Value): Option[Int]

def unfreeze(): Unit

def union[B >: variable.CategoricalValue[C], That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[C]], B, That]): That

def unzip[A1, A2](implicit asPair: (variable.CategoricalValue[C]) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

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

def updated[B >: variable.CategoricalValue[C], That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[C]], B, That]): That

def value(category: C): Value

def view(from: Int, until: Int): SeqView[variable.CategoricalValue[C], IndexedSeq[variable.CategoricalValue[C]]]

def view: SeqView[variable.CategoricalValue[C], IndexedSeq[variable.CategoricalValue[C]]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (variable.CategoricalValue[C]) ⇒ Boolean): FilterMonadic[variable.CategoricalValue[C], IndexedSeq[variable.CategoricalValue[C]]]

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

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

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

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