-
final
def
!=(arg0: AnyRef ): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
++[B >: variable.CategoricalValue[String], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: variable.CategoricalValue[String], That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: variable.CategoricalValue[String], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- TraversableLike
-
def
++=(xs: Traversable[String]): Unit
-
- Definition Classes
- SeqLike → GenSeqLike
-
def
+=(x: String): Unit
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- SeqLike → GenSeqLike
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: AnyRef ): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
Value: Int
-
final
def
_append(elem: Int): UniversalPosDomain.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[String]
-
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.
If true, do not allow this domain to change.
- Attributes
- protected
- Definition Classes
- DiscreteDomain
-
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.
Return the index at which value i should be inserted in order to maintain sorted order.
This assumes that the existing elements already already sorted. If value i is already present, return its index.
- Attributes
- protected
- Definition Classes
- ProtectedIntArrayBuffer
-
def
_indexForInsertSortedLinear(i: Int): Int
-
def
_indexOf(i: Int): Int
Return the index containing the value i, or -1 if i is not found.
Return the index containing the value i, or -1 if i is not found.
- Attributes
- protected
- Definition Classes
- ProtectedIntArrayBuffer
-
def
_indexOfSorted(i: Int): Int
Return the index containing the value i, or -1 if i is not found.
Return the index containing the value i, or -1 if i is not found. Do so more efficiently by assuming that the contents are sorted in ascending order.
Look by starting near the last index as which a search was successful.
- Attributes
- protected
- Definition Classes
- ProtectedIntArrayBuffer
-
def
_indices: Map[String, 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
-
- Definition Classes
- TraversableOnce
-
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder , start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: B)(seqop: (B, variable.CategoricalValue[String]) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[C](k: (variable.CategoricalValue[String]) ⇒ C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
-
def
apply(i: Int): Value
-
def
applyOrElse[A1 <: Int, B1 >: variable.CategoricalValue[String]](x: A1, default: (A1) ⇒ B1): B1
- Definition Classes
- PartialFunction
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
categories: Seq[String]
-
def
category(i: Int): String
-
def
categoryFromPenn(PennPosCategory: String): String
-
def
clear(): Unit
Wipe the domain and its indices clean
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
-
@throws(
...
)
-
def
collect[B, That](pf: PartialFunction[variable.CategoricalValue[String], B])(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[variable.CategoricalValue[String], B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
combinations(n: Int): Iterator[IndexedSeq[variable.CategoricalValue[String]]]
- Definition Classes
- SeqLike
-
def
companion: GenericCompanion[IndexedSeq]
- Definition Classes
- IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
-
- Definition Classes
- Function1
- Annotations
-
@unspecialized()
-
def
contains(elem: Any): Boolean
- Definition Classes
- SeqLike
-
def
containsSlice[B](that: GenSeq[B]): Boolean
- Definition Classes
- SeqLike
-
def
copyToArray[B >: variable.CategoricalValue[String]](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: variable.CategoricalValue[String]](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: variable.CategoricalValue[String]](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
corresponds[B](that: GenSeq[B])(p: (variable.CategoricalValue[String], B) ⇒ Boolean): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
def
count(category: String): Int
-
def
count(i: Int): Int
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
-
def
countsTotal: Int
-
- Definition Classes
- SeqLike → GenSeqLike
-
-
def
dimensionName(i: Int): String
-
def
dimensionSize: Int
A convenience method to get the size of the dimensionDomain.
A convenience method to get the size of the dimensionDomain.
This method is often used to determine the dimensions of parameter Weights Tensors to allocate.
- Definition Classes
- VectorDomain
-
- Definition Classes
- SeqLike → GenSeqLike
-
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
- Definition Classes
- IterableLike
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
endsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
final
def
eq(arg0: AnyRef ): Boolean
-
def
equals(that: Any): Boolean
- Definition Classes
- GenSeqLike → Equals → Any
-
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
-
@throws(
classOf[java.lang.Throwable]
)
-
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: (variable.CategoricalValue[String]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (variable.CategoricalValue[String]) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: variable.CategoricalValue[String]](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
freeze(): Unit
-
def
frozen: Boolean
Can new category values be added to this Domain?
Can new category values be added to this Domain?
- Definition Classes
- DiscreteDomain
-
var
gatherCounts: Boolean
If true, then each call to CategoricalDomain.
If true, then each call to CategoricalDomain.index will increment a count associated with value in the domain.
This count can then later be used to trim the set of domain values by various thresholds.
- Definition Classes
- CategoricalDomain
-
def
genericBuilder[B]: Builder[B, IndexedSeq[B]]
- Definition Classes
- GenericTraversableTemplate
-
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[_]
- Definition Classes
- AnyRef → Any
-
def
getIndex(category: String): Int
Like index, but throw an exception if the category is not already there.
Like index, but throw an exception if the category is not already there.
- Definition Classes
- CategoricalDomain
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[IndexedSeq[variable.CategoricalValue[String]]]
- Definition Classes
- IterableLike
-
var
growPastMaxSize: Boolean
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- IndexedSeqLike → GenSeqLike → Any
-
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
incrementCount(category: String): Unit
-
def
incrementCount(i: Int): Unit
-
def
index(category: String): Int
Return the integer associated with the category, and also, if gatherCounts is true, also increment the count of category.
Return the integer associated with the category, and also, if gatherCounts is true, also increment the count of category.
- Definition Classes
- CategoricalDomain
-
def
indexAll(c: Set[String]): Set[Int]
-
def
indexAll(c: Array[String]): Array[Int]
-
def
indexAll(c: List[String]): List[Int]
-
def
indexAll(c: Iterator[String]): Iterator[Int]
-
def
indexOf[B >: variable.CategoricalValue[String]](elem: B, from: Int): Int
- Definition Classes
- GenSeqLike
-
- Definition Classes
- GenSeqLike
-
def
indexOfSlice[B >: variable.CategoricalValue[String]](that: GenSeq[B], from: Int): Int
- Definition Classes
- SeqLike
-
def
indexOfSlice[B >: variable.CategoricalValue[String]](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
indexOnly(category: String): Int
Return the integer associated with the category, do not increment the count of category, even if gatherCounts is true.
Return the integer associated with the category, do not increment the count of category, even if gatherCounts is true.
- Definition Classes
- CategoricalDomain
-
def
indexWhere(p: (variable.CategoricalValue[String]) ⇒ Boolean, from: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
- Definition Classes
- GenSeqLike
-
def
indices: Range
- Definition Classes
- SeqLike
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
- Definition Classes
- TraversableLike
-
- Definition Classes
- SeqLike → GenSeqLike
-
def
isDefinedAt(idx: Int): Boolean
- Definition Classes
- GenSeqLike
-
def
isEmpty: Boolean
- Definition Classes
- SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
- Definition Classes
- DiscreteDomain → IndexedSeqLike → IterableLike → GenIterableLike
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastIndexOf[B >: variable.CategoricalValue[String]](elem: B, end: Int): Int
- Definition Classes
- GenSeqLike
-
- Definition Classes
- GenSeqLike
-
def
lastIndexOfSlice[B >: variable.CategoricalValue[String]](that: GenSeq[B], end: Int): Int
- Definition Classes
- SeqLike
-
def
lastIndexOfSlice[B >: variable.CategoricalValue[String]](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
lastIndexWhere(p: (variable.CategoricalValue[String]) ⇒ Boolean, end: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
- Definition Classes
- GenSeqLike
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
final
def
length: Int
-
def
lengthCompare(len: Int): Int
- Definition Classes
- SeqLike
-
- Definition Classes
- PartialFunction
-
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
var
maxRequestedInt: Int
-
var
maxSize: Int
If positive, throw error if size tries to grow larger than it.
If positive, throw error if size tries to grow larger than it. Use for growable multi-dim Factor weightsSet;
override this method with the largest you think your growable domain will get.
- Definition Classes
- CategoricalDomain
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
ne(arg0: AnyRef ): Boolean
-
- Attributes
- protected[this]
- Definition Classes
- GenericTraversableTemplate → HasNewBuilder
-
def
newCategoricalValue(i: Int, e: String): CategoricalValue
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
orElse[A1 <: Int, B1 >: variable.CategoricalValue[String]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
-
def
padTo[B >: variable.CategoricalValue[String], That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
- Definition Classes
- Parallelizable
-
- Attributes
- protected[this]
- Definition Classes
- SeqLike → TraversableLike → Parallelizable
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
patch[B >: variable.CategoricalValue[String], That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
- Definition Classes
- SeqLike
-
- Definition Classes
- GenSeqLike
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- TraversableOnce
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: variable.CategoricalValue[String]](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
- Definition Classes
- SeqLike → GenSeqLike
-
- Definition Classes
- SeqLike
-
def
reverseMap[B, That](f: (variable.CategoricalValue[String]) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
runWith[U](action: (variable.CategoricalValue[String]) ⇒ U): (Int) ⇒ Boolean
- Definition Classes
- PartialFunction
-
def
sameElements[B >: variable.CategoricalValue[String]](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: variable.CategoricalValue[String], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, variable.CategoricalValue[String]) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (variable.CategoricalValue[String], B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
-
@migration
- Migration
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
segmentLength(p: (variable.CategoricalValue[String]) ⇒ Boolean, from: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
- Definition Classes
- IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeAtCount(c: Int): Int
Return the number of unique entries with count equal to 'c'.
Return the number of unique entries with count equal to 'c'.
- Definition Classes
- CategoricalDomain
-
def
sizeAtOrAboveCount(threshold: Int): Int
Return the number of unique entries with count greater than or equal to 'threshold'.
Return the number of unique entries with count greater than or equal to 'threshold'.
This returned value will be the size of the Domain after a call to trimBelowCount(threshold).
- Definition Classes
- CategoricalDomain
-
def
sizeBelowCount(threshold: Int): Int
Return the number of unique entries with count below 'threshold'.
Return the number of unique entries with count below 'threshold'.
- Definition Classes
- CategoricalDomain
-
def
slice(from: Int, until: Int): IndexedSeq[variable.CategoricalValue[String]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[IndexedSeq[variable.CategoricalValue[String]]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[IndexedSeq[variable.CategoricalValue[String]]]
- Definition Classes
- IterableLike
-
- Definition Classes
- SeqLike
-
- Definition Classes
- SeqLike
-
- Definition Classes
- SeqLike
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
def
startsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- GenSeqLike
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringToCategory(s: String): String
If type T is not string, this should be overridden to provide de-serialization
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
- Definition Classes
- TraversableLike → GenTraversableLike
-
- Definition Classes
- TraversableLike
-
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
- Definition Classes
- IterableLike
-
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
- Attributes
- protected[this]
- Definition Classes
- IndexedSeqLike → SeqLike → IterableLike → TraversableLike
-
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: variable.CategoricalValue[String]](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- IndexedSeqLike → TraversableOnce → GenTraversableOnce
-
- Attributes
- protected[this]
- Definition Classes
- IndexedSeqLike → SeqLike → IterableLike → TraversableLike
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[variable.CategoricalValue[String], (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- CategoricalDomain → SeqLike → TraversableLike → Function1 → AnyRef → Any
-
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose[B](implicit asTraversable: (variable.CategoricalValue[String]) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
-
@migration
- Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
-
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.
Returns the count threshold below which entries were discarded.
- Definition Classes
- CategoricalDomain
-
def
unapply(value: Value ): Option[Int]
-
def
unfreeze(): Unit
-
def
union[B >: variable.CategoricalValue[String], That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
unzip[A1, A2](implicit asPair: (variable.CategoricalValue[String]) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (variable.CategoricalValue[String]) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
updated[B >: variable.CategoricalValue[String], That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
value(category: String): Value
-
- Definition Classes
- SeqLike → IterableLike → TraversableLike
-
- Definition Classes
- SeqLike → IterableLike → TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
-
@throws(
...
)
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
-
@throws(
...
)
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
-
@throws(
...
)
-
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zip[A1 >: variable.CategoricalValue[String], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipAll[B, A1 >: variable.CategoricalValue[String], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: variable.CategoricalValue[String], That](implicit bf: CanBuildFrom[IndexedSeq[variable.CategoricalValue[String]], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike