net.sf.phiweave.collection

MappedVector

class MappedVector extends SparseVector with TrieMap with MappedVectorAdapter

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

Type Members

  1. type Self = TrieMap

    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 >: Double](elem1: (Int, B1), elem2: (Int, B1), elems: (Int, B1)*): Map[Int, B1]

    definition classes: MapLike → MapLike

  7. def +[B1 >: Double](kv: (Int, B1)): Map[Int, B1]

    definition classes: MapLike → MapLike

  8. def ++[B1 >: Double](xs: TraversableOnce[(Int, B1)]): Map[Int, B1]

    definition classes: MapLike → MapLike

  9. def ++[B >: (Int, Double), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[TrieMap, B, That]): That

    definition classes: TraversableLike

  10. def ++=(xs: TraversableOnce[(Int, Double)]): Growable[(Int, Double)]

    definition classes: Growable

  11. def +=(kv: (Int, Double)): TrieMap

    definition classes: TrieMap → MapLike → Builder → Growable

  12. def +=(elem1: (Int, Double), elem2: (Int, Double), elems: (Int, Double)*): Growable[(Int, Double)]

    definition classes: Growable

  13. def -(elem1: Int, elem2: Int, elems: Int*): TrieMap

    definition classes: MapLike → Subtractable

  14. def -(key: Int): TrieMap

    definition classes: MapLike → MapLike → Subtractable

  15. def --(xs: TraversableOnce[Int]): TrieMap

    definition classes: MapLike → Subtractable

  16. def --=(xs: TraversableOnce[Int]): Shrinkable[Int]

    definition classes: Shrinkable

  17. def -=(k: Int): TrieMap

    definition classes: TrieMap → MapLike → Shrinkable

  18. def -=(elem1: Int, elem2: Int, elems: Int*): Shrinkable[Int]

    definition classes: Shrinkable

  19. def /:[B](z: B)(op: (B, (Int, Double)) ⇒ B): B

    definition classes: TraversableOnce

  20. def :\[B](z: B)(op: ((Int, Double), 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. var N: Int

    attributes: protected
    definition classes: TrieMap

  24. 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: MappedVector → SparseVector

  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: MappedVector → SparseVector

  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: MappedVector → SparseVector

  30. def addSupportedScaled(w: Iterator[Double], alpha: Double): Unit

  31. 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: MappedVector → SparseVector

  32. def andThen[C](k: (Double) ⇒ C): PartialFunction[Int, C]

    definition classes: PartialFunction → Function1

  33. def apply(key: Int): Double

    definition classes: MapLike → Function1

  34. 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

  35. def canEqual(that: Any): Boolean

    definition classes: IterableLike → Equals

  36. def clear(): Unit

    definition classes: MapLike → Builder → Growable

  37. def clone(): MappedVector

    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: MappedVector → MapLike → Cloneable → AnyRef

  38. def collect[B, That](pf: PartialFunction[(Int, Double), B])(implicit bf: CanBuildFrom[TrieMap, B, That]): That

    definition classes: TraversableLike

  39. def companion: GenericCompanion[Iterable[A][A]]

    definition classes: Iterable → Iterable → Traversable → Traversable → GenericTraversableTemplate

  40. def compose[A](g: (A) ⇒ Int): (A) ⇒ Double

    definition classes: Function1

  41. def contains(key: Int): Boolean

    definition classes: MapLike

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

    definition classes: IterableLike → TraversableLike → TraversableOnce

  43. def copyToArray[B >: (Int, Double)](xs: Array[B]): Unit

    definition classes: TraversableOnce

  44. def copyToArray[B >: (Int, Double)](xs: Array[B], start: Int): Unit

    definition classes: TraversableOnce

  45. def copyToBuffer[B >: (Int, Double)](dest: Buffer[B]): Unit

    definition classes: TraversableOnce

  46. def count(p: ((Int, Double)) ⇒ Boolean): Int

    definition classes: TraversableOnce

  47. def default(key: Int): Double

    definition classes: MapLike

  48. def denseValues(): Array[Double]

  49. 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: MappedVector → SparseVector

  50. def drop(n: Int): TrieMap

    definition classes: TraversableLike

  51. def dropRight(n: Int): TrieMap

    definition classes: IterableLike

  52. def dropWhile(p: ((Int, Double)) ⇒ Boolean): TrieMap

    definition classes: TraversableLike

  53. def elements: Iterator[(Int, Double)]

    definition classes: IterableLike
      deprecated:

    1. use iterator' instead

  54. def empty: TrieMap

    definition classes: TrieMap → Map → Map → MapLike

  55. def entries: Iterator[Int] {...}

    attributes: protected
    definition classes: TrieMap

  56. 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

  57. 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

  58. def exists(p: ((Int, Double)) ⇒ Boolean): Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce

  59. def filter(p: ((Int, Double)) ⇒ Boolean): TrieMap

    definition classes: TraversableLike

  60. def filterKeys(p: (Int) ⇒ Boolean): Map[Int, Double]

    definition classes: MapLike

  61. def filterNot(p: ((Int, Double)) ⇒ Boolean): TrieMap

    definition classes: MapLike → TraversableLike

  62. 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

  63. def find(k: Int): Int

    attributes: protected
    definition classes: TrieMap

  64. def find(p: ((Int, Double)) ⇒ Boolean): Option[(Int, Double)]

    definition classes: IterableLike → TraversableLike → TraversableOnce

  65. def findOrCreate(k: Int): Int

    attributes: protected
    definition classes: TrieMap

  66. def first: (Int, Double)

    definition classes: IterableLike
      deprecated:

    1. use head' instead

  67. def firstOption: Option[(Int, Double)]

    definition classes: IterableLike
      deprecated:

    1. use headOption' instead

  68. def flatMap[B, That](f: ((Int, Double)) ⇒ Traversable[B])(implicit bf: CanBuildFrom[TrieMap, B, That]): That

    definition classes: TraversableLike → FilterMonadic

  69. def flatten[B](implicit asTraversable: ((Int, Double)) ⇒ Traversable[B]): Iterable[B]

    definition classes: GenericTraversableTemplate

  70. def foldLeft[B](z: B)(op: (B, (Int, Double)) ⇒ B): B

    definition classes: TraversableOnce

  71. def foldRight[B](z: B)(op: ((Int, Double), B) ⇒ B): B

    definition classes: IterableLike → TraversableOnce

  72. def forall(p: ((Int, Double)) ⇒ Boolean): Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce

  73. def foreach[U](f: ((Int, Double)) ⇒ U): Unit

    definition classes: IterableLike → TraversableLike → TraversableOnce → FilterMonadic

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

    definition classes: GenericTraversableTemplate

  75. def get(k: Int): Option[Double]

    definition classes: TrieMap → MapLike

  76. 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

  77. def getOrElse[B1 >: Double](key: Int, default: ⇒ B1): B1

    definition classes: MapLike

  78. def getOrElseUpdate(key: Int, op: ⇒ Double): Double

    definition classes: MapLike

  79. def groupBy[K](f: ((Int, Double)) ⇒ K): Map[K, TrieMap]

    definition classes: TraversableLike

  80. def grouped(size: Int): Iterator[TrieMap]

    definition classes: IterableLike

  81. def hasDefiniteSize: Boolean

    definition classes: TraversableLike → TraversableOnce

  82. 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

  83. def head: (Int, Double)

    definition classes: IterableLike → TraversableLike

  84. def headOption: Option[(Int, Double)]

    definition classes: TraversableLike

  85. def init: TrieMap

    definition classes: TraversableLike

  86. def initializedAs(alpha: Double): MappedVector

    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: MappedVector → SparseVector

  87. def isDefinedAt(key: Int): Boolean

    definition classes: MapLike → PartialFunction

  88. def isEmpty: Boolean

    definition classes: MapLike → IterableLike → TraversableLike → TraversableOnce

  89. 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

  90. def isTraversableAgain: Boolean

    attributes: final
    definition classes: TraversableLike → TraversableOnce

  91. def iterator: Iterator[(Int, Double)]

    definition classes: TrieMap → MapLike → IterableLike

  92. def jadd(key: JString, value: JEntity): Unit

    definition classes: MappedVectorAdapter → JObjectMutable

  93. def jderror(unexpected: JEntity, expected: String, id: String): Nothing

    definition classes: JEntity

  94. def jnew(key: JString): JEntity

    definition classes: MappedVectorAdapter → JObjectMutable

  95. def jserror(unserializable: String, id: String): Nothing

    definition classes: JEntity

  96. var key: Array[Int]

    attributes: protected
    definition classes: TrieMap

  97. def keySet: Set[Int]

    definition classes: MapLike

  98. def keys: Iterable[Int]

    definition classes: MapLike

  99. def keysIterator: Iterator[Int]

    definition classes: MapLike

  100. def last: (Int, Double)

    definition classes: TraversableLike

  101. def lastOption: Option[(Int, Double)]

    definition classes: TraversableLike

  102. def lift: (Int) ⇒ Option[Double]

    definition classes: PartialFunction

  103. def map[B, That](f: ((Int, Double)) ⇒ B)(implicit bf: CanBuildFrom[TrieMap, B, That]): That

    definition classes: TraversableLike → FilterMonadic

  104. def mapElements[C](f: (Double) ⇒ C): Map[Int, C]

    definition classes: MapLike
      deprecated:

    1. use mapValues' instead

  105. def mapResult[NewTo](f: (TrieMap) ⇒ NewTo): Builder[(Int, Double), NewTo]

    definition classes: Builder

  106. def mapValues[C](f: (Double) ⇒ C): Map[Int, C]

    definition classes: MapLike

  107. def max[B >: (Int, Double)](implicit cmp: Ordering[B]): (Int, Double)

    definition classes: TraversableOnce

  108. def min[B >: (Int, Double)](implicit cmp: Ordering[B]): (Int, Double)

    definition classes: TraversableOnce

  109. def mkString: String

    definition classes: TraversableOnce

  110. def mkString(sep: String): String

    definition classes: TraversableOnce

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

    definition classes: TraversableOnce

  112. var n: Int

    attributes: protected
    definition classes: TrieMap

  113. 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

  114. def newBuilder: Builder[(Int, Double), TrieMap]

    attributes: protected[this]
    definition classes: MapLike → MapLike → TraversableLike → HasNewBuilder

  115. def nonEmpty: Boolean

    definition classes: TraversableOnce

  116. 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

  117. 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

  118. var one: Array[Int]

    attributes: protected
    definition classes: TrieMap

  119. def orElse[A1 <: Int, B1 >: Double](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    definition classes: PartialFunction

  120. def partition(p: ((Int, Double)) ⇒ Boolean): (TrieMap, TrieMap)

    definition classes: TraversableLike

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

    definition classes: JObjectMutable → JEntity

  122. def product[B >: (Int, Double)](implicit num: Numeric[B]): B

    definition classes: TraversableOnce

  123. def projection: IterableView[(Int, Double), TrieMap]

    definition classes: IterableLike
      deprecated:

    1. use view' instead

  124. def put(key: Int, value: Double): Option[Double]

    definition classes: MapLike

  125. def reduceLeft[B >: (Int, Double)](op: (B, (Int, Double)) ⇒ B): B

    definition classes: TraversableOnce

  126. def reduceLeftOption[B >: (Int, Double)](op: (B, (Int, Double)) ⇒ B): Option[B]

    definition classes: TraversableOnce

  127. def reduceRight[B >: (Int, Double)](op: ((Int, Double), B) ⇒ B): B

    definition classes: IterableLike → TraversableOnce

  128. def reduceRightOption[B >: (Int, Double)](op: ((Int, Double), B) ⇒ B): Option[B]

    definition classes: TraversableOnce

  129. def remove(key: Int): Option[Double]

    definition classes: MapLike

  130. def removeKey(key: Int): Option[Double]

    definition classes: MapLike
      deprecated:

    1. Use remove' instead

  131. def repr: TrieMap

    definition classes: TraversableLike

  132. def result(): TrieMap

    definition classes: MapLike → Builder

  133. def retain(p: (Int, Double) ⇒ Boolean): MapLike[Int, Double, TrieMap]

    definition classes: MapLike

  134. def reversed: List[(Int, Double)]

    attributes: protected[this]
    definition classes: TraversableOnce

  135. val root: Int

    definition classes: TrieMap

  136. var s: Int

    attributes: protected
    definition classes: TrieMap

  137. def sameElements[B >: (Int, Double)](that: Iterable[B]): Boolean

    definition classes: IterableLike

  138. 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: MappedVector → SparseVector

  139. def scanLeft[B, That](z: B)(op: (B, (Int, Double)) ⇒ B)(implicit bf: CanBuildFrom[TrieMap, B, That]): That

    definition classes: TraversableLike

  140. def scanRight[B, That](z: B)(op: ((Int, Double), B) ⇒ B)(implicit bf: CanBuildFrom[TrieMap, B, That]): That

    definition classes: TraversableLike

  141. 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

  142. 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: MappedVector → SparseVector

  143. def size: Int

    definition classes: TrieMap → TraversableOnce

  144. def sizeHint(coll: scala.collection.TraversableLike[_, _], delta: Int): Unit

    definition classes: Builder

  145. def sizeHint(size: Int): Unit

    definition classes: Builder

  146. def sizeHintBounded(size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

    definition classes: Builder

  147. def slice(from: Int, until: Int): TrieMap

    definition classes: IterableLike → TraversableLike

  148. def sliding[B >: (Int, Double)](size: Int, step: Int): Iterator[TrieMap]

    definition classes: IterableLike

  149. def sliding[B >: (Int, Double)](size: Int): Iterator[TrieMap]

    definition classes: IterableLike

  150. def span(p: ((Int, Double)) ⇒ Boolean): (TrieMap, TrieMap)

    definition classes: TraversableLike

  151. def splitAt(n: Int): (TrieMap, TrieMap)

    definition classes: TraversableLike

  152. def stringPrefix: String

    definition classes: SparseVector → MapLike → TraversableLike

  153. def sum[B >: (Int, Double)](implicit num: Numeric[B]): B

    definition classes: TraversableOnce

  154. def synchronized[T0](arg0: T0): T0

    attributes: final
    definition classes: AnyRef

  155. def tail: TrieMap

    definition classes: TraversableLike

  156. def take(n: Int): TrieMap

    definition classes: IterableLike → TraversableLike

  157. def takeRight(n: Int): TrieMap

    definition classes: IterableLike

  158. def takeWhile(p: ((Int, Double)) ⇒ Boolean): TrieMap

    definition classes: IterableLike → TraversableLike

  159. def thisCollection: Iterable[(Int, Double)]

    attributes: protected[this]
    definition classes: IterableLike → TraversableLike

  160. def toArray[B >: (Int, Double)](implicit arg0: ClassManifest[B]): Array[B]

    definition classes: TraversableOnce

  161. def toBuffer[B >: (Int, Double)]: Buffer[B]

    definition classes: TraversableOnce

  162. def toCollection(repr: TrieMap): Iterable[(Int, Double)]

    attributes: protected[this]
    definition classes: IterableLike → TraversableLike

  163. def toIndexedSeq[B >: (Int, Double)]: IndexedSeq[B]

    definition classes: TraversableOnce

  164. def toIterable: Iterable[(Int, Double)]

    definition classes: IterableLike → TraversableOnce

  165. def toIterator: Iterator[(Int, Double)]

    definition classes: TraversableLike → TraversableOnce

  166. def toList: List[(Int, Double)]

    definition classes: TraversableOnce

  167. def toMap[T, U](implicit ev: <:<[(Int, Double), (T, U)]): Map[T, U]

    definition classes: TraversableOnce

  168. def toSeq: Seq[(Int, Double)]

    definition classes: IterableLike → TraversableOnce

  169. def toSet[B >: (Int, Double)]: Set[B]

    definition classes: TraversableOnce

  170. def toStream: Stream[(Int, Double)]

    definition classes: IterableLike → TraversableLike → TraversableOnce

  171. 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: MapLike → TraversableLike → Function1 → AnyRef → Any

  172. def toTraversable: Traversable[(Int, Double)]

    definition classes: TraversableLike → TraversableOnce

  173. def transform(f: (Int, Double) ⇒ Double): MapLike[Int, Double, TrieMap]

    definition classes: MapLike

  174. def transpose[B](implicit asTraversable: ((Int, Double)) ⇒ Traversable[B]): Iterable[Iterable[B]]

    definition classes: GenericTraversableTemplate

  175. def unzip[A1, A2](implicit asPair: ((Int, Double)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    definition classes: GenericTraversableTemplate

  176. def update(key: Int, value: Double): Unit

    definition classes: MapLike

  177. def updated[B1 >: Double](key: Int, value: B1): Map[Int, B1]

    definition classes: MapLike → MapLike

  178. var value: Array[Double]

    attributes: protected
    definition classes: TrieMap

  179. def values: Iterable[Double]

    definition classes: MapLike

  180. def valuesIterator: Iterator[Double]

    definition classes: MapLike

  181. def view(from: Int, until: Int): IterableView[(Int, Double), TrieMap]

    definition classes: IterableLike → TraversableLike

  182. def view: IterableView[(Int, Double), TrieMap]

    definition classes: IterableLike → TraversableLike

  183. def wait(): Unit

    attributes: final
    definition classes: AnyRef

  184. def wait(arg0: Long, arg1: Int): Unit

    attributes: final
    definition classes: AnyRef

  185. def wait(arg0: Long): Unit

    attributes: final
    definition classes: AnyRef

  186. def withFilter(p: ((Int, Double)) ⇒ Boolean): FilterMonadic[(Int, Double), TrieMap]

    definition classes: TraversableLike → FilterMonadic

  187. var zero: Array[Int]

    attributes: protected
    definition classes: TrieMap

  188. def zip[A1 >: (Int, Double), B, That](that: Iterable[B])(implicit bf: CanBuildFrom[TrieMap, (A1, B), That]): That

    definition classes: IterableLike

  189. def zipAll[B, A1 >: (Int, Double), That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[TrieMap, (A1, B), That]): That

    definition classes: IterableLike

  190. def zipWithIndex[A1 >: (Int, Double), That](implicit bf: CanBuildFrom[TrieMap, (A1, Int), That]): That

    definition classes: IterableLike