net.sf.phiweave.common

DefaultObservation

object DefaultObservation extends CompressedVector with Product

Inherited
  1. Hide All
  2. Show all
  1. Product
  2. CompressedVector
  3. CompressedVectorAdapter
  4. JObjectView
  5. JText
  6. JEntity
  7. CompressedMap
  8. SparseVector
  9. Map
  10. MapLike
  11. Cloneable
  12. Shrinkable
  13. Builder
  14. Growable
  15. Map
  16. MapLike
  17. Subtractable
  18. PartialFunction
  19. Function1
  20. Iterable
  21. Iterable
  22. IterableLike
  23. Equals
  24. Traversable
  25. Mutable
  26. Traversable
  27. GenericTraversableTemplate
  28. TraversableLike
  29. TraversableOnce
  30. FilterMonadic
  31. HasNewBuilder
  32. AnyRef
  33. Any
Visibility
  1. Public
  2. All

Type Members

  1. type Self = Repr

    attributes: protected
    definition classes: TraversableLike

Value Members

  1. def !=(arg0: AnyRef): Boolean

    attributes: final
    definition classes: AnyRef
  2. def !=(arg0: Any): Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality.

    returns

    false if the receiver object is equivalent to the argument; true otherwise.

    attributes: final
    definition classes: Any
  3. def ##(): Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf[T0](): T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf[T0](): Boolean

    attributes: final
    definition classes: AnyRef
  6. def +[B1 >: B](elem1: (A, B1), elem2: (A, B1), elems: (A, B1)*): Map[A, B1]

    definition classes: MapLike → MapLike
  7. def +[B1 >: B](kv: (A, B1)): Map[A, B1]

    definition classes: MapLike → MapLike
  8. def ++[B1 >: B](xs: TraversableOnce[(A, B1)]): Map[A, B1]

    definition classes: MapLike → MapLike
  9. def ++[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That

    definition classes: TraversableLike
  10. def ++=(xs: TraversableOnce[A]): Growable[A]

    definition classes: Growable
  11. def +=(kv: (Int, Double)): CompressedMap

    definition classes: CompressedMap → MapLike → Builder → Growable
  12. def +=(elem1: A, elem2: A, elems: A*): Growable[A]

    definition classes: Growable
  13. def -(elem1: A, elem2: A, elems: A*): This

    definition classes: MapLike → Subtractable
  14. def -(key: A): This

    definition classes: MapLike → MapLike → Subtractable
  15. def --(xs: TraversableOnce[A]): This

    definition classes: MapLike → Subtractable
  16. def --=(xs: TraversableOnce[A]): Shrinkable[A]

    definition classes: Shrinkable
  17. def -=(k: Int): CompressedMap

    definition classes: CompressedMap → MapLike → Shrinkable
  18. def -=(elem1: A, elem2: A, elems: A*): Shrinkable[A]

    definition classes: Shrinkable
  19. def /:[B](z: B)(op: (B, A) ⇒ B): B

    definition classes: TraversableOnce
  20. def :\[B](z: B)(op: (A, B) ⇒ B): B

    definition classes: TraversableOnce
  21. def ==(arg0: AnyRef): Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: AnyRef
  22. def ==(arg0: Any): Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: Any
  23. def add(v: SparseVector): Unit

    Component-wise vector addition; a new entry will be allocated for any component occuring in vector v that is currently unsupported in this vector

    Component-wise vector addition; a new entry will be allocated for any component occuring in vector v that is currently unsupported in this vector

    v

    the sparse vector that shall be added to this vector

    definition classes: CompressedVectorSparseVector
  24. def addScaled(v: CompressedVector, alpha: Double): Unit

    definition classes: CompressedVector
  25. def addScaled(v: SparseVector, alpha: Double): Unit

    Similar to < href="#add">add, except that all components of v are scaled by alpha before they are added

    Similar to < href="#add">add, except that all components of v are scaled by alpha before they are added

    v

    the sparse vector that shall be added to this vector

    alpha

    the scaling factor for components of v

    definition classes: CompressedVectorSparseVector
  26. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    definition classes: MapLike → TraversableOnce
  27. def addString(b: StringBuilder): StringBuilder

    definition classes: TraversableOnce
  28. def addString(b: StringBuilder, sep: String): StringBuilder

    definition classes: TraversableOnce
  29. def addSupported(v: SparseVector): Unit

    Component-wise vector addition; only those indices that actually occur in both sparse vectors are updated

    Component-wise vector addition; only those indices that actually occur in both sparse vectors are updated

    v

    the sparse vector that shall be added to this vector

    definition classes: CompressedVectorSparseVector
  30. def addSupportedScaled(v: Iterator[Double], alpha: Double): Unit

    definition classes: CompressedVector
  31. def addSupportedScaled(v: CompressedVector, alpha: Double): Unit

    definition classes: CompressedVector
  32. def addSupportedScaled(v: SparseVector, alpha: Double): Unit

    Similar to addSupported, except that all components of v are scaled by alpha before they are added

    Similar to addSupported, except that all components of v are scaled by alpha before they are added

    v

    the sparse vector that shall be added to this vector

    alpha

    scaling factor for components of v

    definition classes: CompressedVectorSparseVector
  33. def andThen[C](k: (B) ⇒ C): PartialFunction[A, C]

    definition classes: PartialFunction → Function1
  34. def apply(key: A): B

    definition classes: MapLike → Function1
  35. def asInstanceOf[T0]: T0

    This method is used to cast the receiver object to be of type T0.

    This method is used to cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  36. def canEqual(that: Any): Boolean

    definition classes: IterableLike → Equals
  37. def cardinalities(v: CompressedVector): (Int, Int)

    attributes: protected
    definition classes: CompressedVector
  38. def clear(): Unit

    definition classes: MapLike → Builder → Growable
  39. def clone(): CompressedVector

    This method creates and returns a copy of the receiver object.

    This method creates and returns a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    definition classes: CompressedVector → MapLike → Cloneable → AnyRef
  40. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Repr, B, That]): That

    definition classes: TraversableLike
  41. def companion: GenericCompanion[Iterable[A][A]]

    definition classes: Iterable → Iterable → Traversable → Traversable → GenericTraversableTemplate
  42. def compose[A](g: (A) ⇒ T1): (A) ⇒ R

    definition classes: Function1
  43. def contains(key: A): Boolean

    definition classes: MapLike
  44. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

    definition classes: IterableLike → TraversableLike → TraversableOnce
  45. def copyToArray[B >: A](xs: Array[B]): Unit

    definition classes: TraversableOnce
  46. def copyToArray[B >: A](xs: Array[B], start: Int): Unit

    definition classes: TraversableOnce
  47. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    definition classes: TraversableOnce
  48. def count(p: (A) ⇒ Boolean): Int

    definition classes: TraversableOnce
  49. def default(key: A): B

    definition classes: MapLike
  50. def denseArray(n: Int): Array[Double]

    definition classes: CompressedVector
  51. def denseValues: Array[Double]

    definition classes: CompressedVector
  52. def dotProduct(v: CompressedVector): Double

    definition classes: CompressedVector
  53. def dotProduct(v: SparseVector): Double

    Computes the dot product of this vector and another sparse vector

    Computes the dot product of this vector and another sparse vector

    v

    a sparse vector

    returns

    the dot product

    definition classes: CompressedVectorSparseVector
  54. def drop(n: Int): Repr

    definition classes: TraversableLike
  55. def dropRight(n: Int): Repr

    definition classes: IterableLike
  56. def dropWhile(p: (A) ⇒ Boolean): Repr

    definition classes: TraversableLike
  57. def elements: Iterator[A]

    definition classes: IterableLike
      deprecated:
    1. use iterator' instead

  58. def empty: CompressedMap

    definition classes: CompressedMap → Map → Map → MapLike
  59. def eq(arg0: AnyRef): Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.

    Additionally, the eq method has three other properties. * It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false. * For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false. * null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    arg0

    the object to compare against this object for reference equality.

    returns

    true if the argument is a reference to the receiver object; false otherwise.

    attributes: final
    definition classes: AnyRef
  60. def equals(that: Any): Boolean

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation]: * It is reflexive: for any instance x of type Any, x.equals(x) should return true. * It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true. * It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

    If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects that are "equal" (o1.equals(o2) returns true) hash to the same scala.Int (o1.hashCode.equals(o2.hashCode)).

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    definition classes: MapLike → Equals → AnyRef → Any
  61. def exists(p: (A) ⇒ Boolean): Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  62. def filter(p: (A) ⇒ Boolean): Repr

    definition classes: TraversableLike
  63. def filterKeys(p: (A) ⇒ Boolean): Map[A, B]

    definition classes: MapLike
  64. def filterNot(p: ((A, B)) ⇒ Boolean): This

    definition classes: MapLike → TraversableLike
  65. def finalize(): Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    The details of when and if the finalize method are invoked, as well as the interaction between finalizeand non-local returns and exceptions, are all platform dependent.

    attributes: protected
    definition classes: AnyRef
  66. def find(p: (A) ⇒ Boolean): Option[A]

    definition classes: IterableLike → TraversableLike → TraversableOnce
  67. def first: A

    definition classes: IterableLike
      deprecated:
    1. use head' instead

  68. def firstOption: Option[A]

    definition classes: IterableLike
      deprecated:
    1. use headOption' instead

  69. def flatMap[B, That](f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[Repr, B, That]): That

    definition classes: TraversableLike → FilterMonadic
  70. def flatten[B](implicit asTraversable: (A) ⇒ Traversable[B]): CC[B]

    definition classes: GenericTraversableTemplate
  71. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

    definition classes: TraversableOnce
  72. def foldRight[B](z: B)(op: (A, B) ⇒ B): B

    definition classes: IterableLike → TraversableOnce
  73. def forall(p: (A) ⇒ Boolean): Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  74. def foreach[U](f: (A) ⇒ U): Unit

    definition classes: IterableLike → TraversableLike → TraversableOnce → FilterMonadic
  75. def genericBuilder[B]: Builder[B, CC[B]]

    definition classes: GenericTraversableTemplate
  76. def get(k: Int): Option[Double]

    definition classes: CompressedMap → MapLike
  77. def getClass(): java.lang.Class[_]

    Returns a representation that corresponds to the dynamic class of the receiver object.

    Returns a representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    attributes: final
    definition classes: AnyRef
  78. def getOrElse[B1 >: B](key: A, default: ⇒ B1): B1

    definition classes: MapLike
  79. def getOrElseUpdate(key: A, op: ⇒ B): B

    definition classes: MapLike
  80. def groupBy[K](f: (A) ⇒ K): Map[K, Repr]

    definition classes: TraversableLike
  81. def grouped(size: Int): Iterator[Repr]

    definition classes: IterableLike
  82. def hasDefiniteSize: Boolean

    definition classes: TraversableLike → TraversableOnce
  83. def hashCode(): Int

    Returns a hash code value for the object.

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    returns

    the hash code value for the object.

    definition classes: MapLike → AnyRef → Any
  84. def head: A

    definition classes: IterableLike → TraversableLike
  85. def headOption: Option[A]

    definition classes: TraversableLike
  86. var index: Array[Int]

  87. def init: Repr

    definition classes: TraversableLike
  88. def initialize(sv: SparseVector): Unit

    attributes: protected
    definition classes: CompressedMap
  89. def initialize(sm: SortedMap[Int, Double]): Unit

    attributes: protected
    definition classes: CompressedMap
  90. def initializedAs(alpha: Double): CompressedVector

    Returns a clone of this vector, with all supported components set to alpha

    Returns a clone of this vector, with all supported components set to alpha

    alpha

    all supported components of the new vector will be set to this scalar

    definition classes: CompressedVectorSparseVector
  91. def isDefinedAt(key: A): Boolean

    definition classes: MapLike → PartialFunction
  92. def isEmpty: Boolean

    definition classes: MapLike → IterableLike → TraversableLike → TraversableOnce
  93. def isInstanceOf[T0]: Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

    This method is used to test whether the dynamic type of the receiver object is T0.

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    attributes: final
    definition classes: Any
  94. def isTraversableAgain: Boolean

    attributes: final
    definition classes: TraversableLike → TraversableOnce
  95. def iterator: Iterator[(Int, Double)]

    definition classes: CompressedMap → MapLike → IterableLike
  96. def jderror(unexpected: JEntity, expected: String, id: String): Nothing

    definition classes: JEntity
  97. def jelements: Iterator[(JString, JEntity)]

    definition classes: CompressedVectorAdapterJObjectView
  98. def jserror(unserializable: String, id: String): Nothing

    definition classes: JEntity
  99. def keySet: Set[A]

    definition classes: MapLike
  100. def keys: Iterable[A]

    definition classes: MapLike
  101. def keysIterator: Iterator[A]

    definition classes: MapLike
  102. def last: A

    definition classes: TraversableLike
  103. def lastOption: Option[A]

    definition classes: TraversableLike
  104. def lift: (A) ⇒ Option[B]

    definition classes: PartialFunction
  105. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That

    definition classes: TraversableLike → FilterMonadic
  106. def mapElements[C](f: (B) ⇒ C): Map[A, C]

    definition classes: MapLike
      deprecated:
    1. use mapValues' instead

  107. def mapResult[NewTo](f: (To) ⇒ NewTo): Builder[Elem, NewTo]

    definition classes: Builder
  108. def mapValues[C](f: (B) ⇒ C): Map[A, C]

    definition classes: MapLike
  109. def max[B >: A](implicit cmp: Ordering[B]): A

    definition classes: TraversableOnce
  110. def min[B >: A](implicit cmp: Ordering[B]): A

    definition classes: TraversableOnce
  111. def mkString: String

    definition classes: TraversableOnce
  112. def mkString(sep: String): String

    definition classes: TraversableOnce
  113. def mkString(start: String, sep: String, end: String): String

    definition classes: TraversableOnce
  114. def ne(arg0: AnyRef): Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality.

    returns

    false if the argument is not a reference to the receiver object; true otherwise.

    attributes: final
    definition classes: AnyRef
  115. def newBuilder: Builder[(A, B), This]

    attributes: protected[this]
    definition classes: MapLike → MapLike → TraversableLike → HasNewBuilder
  116. def nonEmpty: Boolean

    definition classes: TraversableOnce
  117. def notify(): Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  118. def notifyAll(): Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  119. def orElse[A1 <: A, B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    definition classes: PartialFunction
  120. def partition(p: (A) ⇒ Boolean): (Repr, Repr)

    definition classes: TraversableLike
  121. def print(buf: OutputBuffer, path: List[String], verbose: (JEntity, List[String]) ⇒ Boolean): Unit

    definition classes: JObjectViewJEntity
  122. def product[B >: A](implicit num: Numeric[B]): B

    definition classes: TraversableOnce
  123. def productArity: Int

    definition classes: DefaultObservation → Product
  124. def productElement(arg0: Int): Any

    definition classes: DefaultObservation → Product
  125. def productElements: Iterator[Any]

    definition classes: Product
      deprecated:
    1. use productIterator instead

  126. def productIterator: Iterator[Any]

    definition classes: Product
  127. def productPrefix: String

    definition classes: DefaultObservation → Product
  128. def projection: IterableView[A, Repr]

    definition classes: IterableLike
      deprecated:
    1. use view' instead

  129. def put(key: A, value: B): Option[B]

    definition classes: MapLike
  130. def readResolve(): AnyRef

    attributes: protected
  131. def reduceLeft[B >: A](op: (B, A) ⇒ B): B

    definition classes: TraversableOnce
  132. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

    definition classes: TraversableOnce
  133. def reduceRight[B >: A](op: (A, B) ⇒ B): B

    definition classes: IterableLike → TraversableOnce
  134. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

    definition classes: TraversableOnce
  135. def remove(key: A): Option[B]

    definition classes: MapLike
  136. def removeKey(key: A): Option[B]

    definition classes: MapLike
      deprecated:
    1. Use remove' instead

  137. def repr: Repr

    definition classes: TraversableLike
  138. def result(): This

    definition classes: MapLike → Builder
  139. def retain(p: (A, B) ⇒ Boolean): MapLike[A, B, This]

    definition classes: MapLike
  140. def reversed: List[A]

    attributes: protected[this]
    definition classes: TraversableOnce
  141. def sameElements[B >: A](that: Iterable[B]): Boolean

    definition classes: IterableLike
  142. def scale(alpha: Double): Unit

    Scales each component of the sparse vector

    Scales each component of the sparse vector

    alpha

    the scaling factor

    definition classes: CompressedVectorSparseVector
  143. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That

    definition classes: TraversableLike
  144. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That

    definition classes: TraversableLike
  145. def set(idx: Int, alpha: Double): Unit

    Sets the given component to the given scalar value; a new entry will be allocated if required

    Sets the given component to the given scalar value; a new entry will be allocated if required

    idx

    the index of the vector component

    alpha

    the scalar value

    definition classes: SparseVector
  146. def setSupported(alpha: Double): Unit

    Sets all supported, i.

    Sets all supported, i.e. non-zero components of this vector to the given scalar value

    alpha

    the scalar value

    definition classes: CompressedVectorSparseVector
  147. var size: Int

    definition classes: CompressedVectorCompressedVectorAdapterCompressedMap → TraversableOnce
  148. def sizeHint(coll: scala.collection.TraversableLike[_, _], delta: Int): Unit

    definition classes: Builder
  149. def sizeHint(size: Int): Unit

    definition classes: Builder
  150. def sizeHintBounded(size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

    definition classes: Builder
  151. def slice(from: Int, until: Int): Repr

    definition classes: IterableLike → TraversableLike
  152. def sliding[B >: A](size: Int, step: Int): Iterator[Repr]

    definition classes: IterableLike
  153. def sliding[B >: A](size: Int): Iterator[Repr]

    definition classes: IterableLike
  154. def span(p: (A) ⇒ Boolean): (Repr, Repr)

    definition classes: TraversableLike
  155. def splitAt(n: Int): (Repr, Repr)

    definition classes: TraversableLike
  156. def stringPrefix: String

    definition classes: SparseVector → MapLike → TraversableLike
  157. def sum[B >: A](implicit num: Numeric[B]): B

    definition classes: TraversableOnce
  158. def synchronized[T0](arg0: T0): T0

    attributes: final
    definition classes: AnyRef
  159. def tail: Repr

    definition classes: TraversableLike
  160. def take(n: Int): Repr

    definition classes: IterableLike → TraversableLike
  161. def takeRight(n: Int): Repr

    definition classes: IterableLike
  162. def takeWhile(p: (A) ⇒ Boolean): Repr

    definition classes: IterableLike → TraversableLike
  163. def thisCollection: Iterable[A]

    attributes: protected[this]
    definition classes: IterableLike → TraversableLike
  164. def toArray[B >: A](implicit arg0: ClassManifest[B]): Array[B]

    definition classes: TraversableOnce
  165. def toBuffer[B >: A]: Buffer[B]

    definition classes: TraversableOnce
  166. def toCollection(repr: Repr): Iterable[A]

    attributes: protected[this]
    definition classes: IterableLike → TraversableLike
  167. def toIndexedSeq[B >: A]: IndexedSeq[B]

    definition classes: TraversableOnce
  168. def toIterable: Iterable[A]

    definition classes: IterableLike → TraversableOnce
  169. def toIterator: Iterator[A]

    definition classes: TraversableLike → TraversableOnce
  170. def toList: List[A]

    definition classes: TraversableOnce
  171. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]

    definition classes: TraversableOnce
  172. def toSeq: Seq[A]

    definition classes: IterableLike → TraversableOnce
  173. def toSet[B >: A]: Set[B]

    definition classes: TraversableOnce
  174. def toStream: Stream[A]

    definition classes: IterableLike → TraversableLike → TraversableOnce
  175. def toString(): String

    Returns a string representation of the object.

    Returns a string representation of the object.

    The default representation is platform dependent.

    returns

    a string representation of the object.

    definition classes: JObjectView → AnyRef → Any
  176. def toTraversable: Traversable[A]

    definition classes: TraversableLike → TraversableOnce
  177. def transform(f: (A, B) ⇒ B): MapLike[A, B, This]

    definition classes: MapLike
  178. def transpose[B](implicit asTraversable: (A) ⇒ Traversable[B]): CC[CC[B] @scala.annotation.unchecked.uncheckedVariance]

    definition classes: GenericTraversableTemplate
  179. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (CC[A1], CC[A2])

    definition classes: GenericTraversableTemplate
  180. def update(key: A, value: B): Unit

    definition classes: MapLike
  181. def updated[B1 >: B](key: A, value: B1): Map[A, B1]

    definition classes: MapLike → MapLike
  182. var value: Array[Double]

  183. def values: Iterable[B]

    definition classes: MapLike
  184. def valuesIterator: Iterator[B]

    definition classes: MapLike
  185. def view(from: Int, until: Int): IterableView[A, Repr]

    definition classes: IterableLike → TraversableLike
  186. def view: IterableView[A, Repr]

    definition classes: IterableLike → TraversableLike
  187. def wait(): Unit

    attributes: final
    definition classes: AnyRef
  188. def wait(arg0: Long, arg1: Int): Unit

    attributes: final
    definition classes: AnyRef
  189. def wait(arg0: Long): Unit

    attributes: final
    definition classes: AnyRef
  190. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, Repr]

    definition classes: TraversableLike → FilterMonadic
  191. def zip[A1 >: A, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That

    definition classes: IterableLike
  192. def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That

    definition classes: IterableLike
  193. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Repr, (A1, Int), That]): That

    definition classes: IterableLike