Packages

sealed trait TDigestMap extends SortedMap[Double, Double] with NodeTD with IncrementMapLike[Double, Double, INodeTD, TDigestMap] with PrefixSumMapLike[Double, Double, Double, INodeTD, TDigestMap] with NearestMapLike[Double, Double, INodeTD, TDigestMap]

The tree-backed map object a TDigest uses to store and update its clusters. TDigestMap inherits functionality for value increment, prefix-sum and nearest-neighbor queries.

Linear Supertypes
NearestMapLike[Double, Double, INodeTD, TDigestMap], NearestLike[Double, INodeTD, TDigestMap], PrefixSumMapLike[Double, Double, Double, INodeTD, TDigestMap], IncrementMapLike[Double, Double, INodeTD, TDigestMap], OrderedMapLike[Double, Double, INodeTD, TDigestMap], OrderedLike[Double, INodeTD, TDigestMap], NodeTD, NodeNearMap[Double, Double], NodeNear[Double], NodeInc[Double, Double], NodePS[Double, Double, Double], NodeMap[Double, Double], Node[Double], Serializable, Serializable, SortedMap[Double, Double], SortedMapLike[Double, Double, TDigestMap], Sorted[Double, TDigestMap], Map[Double, Double], MapLike[Double, Double, TDigestMap], Subtractable[Double, TDigestMap], PartialFunction[Double, Double], (Double) ⇒ Double, GenMap[Double, Double], GenMapLike[Double, Double, TDigestMap], Iterable[(Double, Double)], IterableLike[(Double, Double), TDigestMap], Equals, GenIterable[(Double, Double)], GenIterableLike[(Double, Double), TDigestMap], Traversable[(Double, Double)], GenTraversable[(Double, Double)], GenericTraversableTemplate[(Double, Double), Iterable], TraversableLike[(Double, Double), TDigestMap], GenTraversableLike[(Double, Double), TDigestMap], Parallelizable[(Double, Double), ParMap[Double, Double]], TraversableOnce[(Double, Double)], GenTraversableOnce[(Double, Double)], FilterMonadic[(Double, Double), TDigestMap], HasNewBuilder[(Double, Double), TDigestMap], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TDigestMap
  2. NearestMapLike
  3. NearestLike
  4. PrefixSumMapLike
  5. IncrementMapLike
  6. OrderedMapLike
  7. OrderedLike
  8. NodeTD
  9. NodeNearMap
  10. NodeNear
  11. NodeInc
  12. NodePS
  13. NodeMap
  14. Node
  15. Serializable
  16. Serializable
  17. SortedMap
  18. SortedMapLike
  19. Sorted
  20. Map
  21. MapLike
  22. Subtractable
  23. PartialFunction
  24. Function1
  25. GenMap
  26. GenMapLike
  27. Iterable
  28. IterableLike
  29. Equals
  30. GenIterable
  31. GenIterableLike
  32. Traversable
  33. GenTraversable
  34. GenericTraversableTemplate
  35. TraversableLike
  36. GenTraversableLike
  37. Parallelizable
  38. TraversableOnce
  39. GenTraversableOnce
  40. FilterMonadic
  41. HasNewBuilder
  42. AnyRef
  43. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class DefaultKeySet extends AbstractSet[K] with Set[K] with Serializable
    Attributes
    protected
    Definition Classes
    MapLike
  2. class DefaultKeySortedSet extends scala.collection.SortedMapLike.DefaultKeySet with SortedSet[A]
    Attributes
    protected
    Definition Classes
    SortedMapLike
  3. class DefaultValuesIterable extends AbstractIterable[V] with Iterable[V] with Serializable
    Attributes
    protected
    Definition Classes
    MapLike
  4. class FilteredKeys extends AbstractMap[K, V] with DefaultMap[K, V]
    Attributes
    protected
    Definition Classes
    MapLike
  5. class MappedValues[W] extends AbstractMap[K, W] with DefaultMap[K, W]
    Attributes
    protected
    Definition Classes
    MapLike
  6. type Self = TDigestMap
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  7. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def iNode(color: Color, d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  2. abstract def keyOrdering: Numeric[Double]
    Definition Classes
    NodeNear → Node
  3. abstract def node(k: Double): Option[INode[Double]]
    Definition Classes
    Node
  4. abstract def nodeMax: Option[INode[Double]]
    Definition Classes
    Node
  5. abstract def nodeMin: Option[INode[Double]]
    Definition Classes
    Node
  6. abstract def pfs: Double
    Definition Classes
    NodePS
  7. abstract def prefixAggregator: AggregatorAPI[Double, Double]
    Definition Classes
    NodePS
  8. abstract def valueMonoid: MonoidAPI[Double]
    Definition Classes
    NodeInc

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +[V2 >: Double](kv2: (Double, V2)): TDigestMap
    Definition Classes
    OrderedMapLike → SortedMapLike → MapLike → GenMapLike
  4. def +[B1 >: Double](elem1: (Double, B1), elem2: (Double, B1), elems: (Double, B1)*): SortedMap[Double, B1]
    Definition Classes
    SortedMapLike → MapLike
  5. def ++[B1 >: Double](xs: GenTraversableOnce[(Double, B1)]): SortedMap[Double, B1]
    Definition Classes
    SortedMapLike → MapLike
  6. def ++[B >: (Double, Double), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[TDigestMap, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  7. def ++:[B >: (Double, Double), That](that: Traversable[B])(implicit bf: CanBuildFrom[TDigestMap, B, That]): That
    Definition Classes
    TraversableLike
  8. def ++:[B >: (Double, Double), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[TDigestMap, B, That]): That
    Definition Classes
    TraversableLike
  9. def -(k: Double): TDigestMap
    Definition Classes
    OrderedMapLike → MapLike → Subtractable → GenMapLike
  10. def -(elem1: Double, elem2: Double, elems: Double*): TDigestMap
    Definition Classes
    Subtractable
  11. def --(xs: GenTraversableOnce[Double]): TDigestMap
    Definition Classes
    Subtractable
  12. def /:[B](z: B)(op: (B, (Double, Double)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  13. def :\[B](z: B)(op: ((Double, Double), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    MapLike → TraversableOnce
  16. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  17. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  18. def aggregate[B](z: ⇒ B)(seqop: (B, (Double, Double)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  19. def andThen[C](k: (Double) ⇒ C): PartialFunction[Double, C]
    Definition Classes
    PartialFunction → Function1
  20. final def append(tl: Node[Double], tr: Node[Double]): Node[Double]
    Attributes
    protected
    Definition Classes
    Node
  21. def apply(key: Double): Double
    Definition Classes
    MapLike → GenMapLike → Function1
  22. def applyOrElse[K1 <: Double, V1 >: Double](x: K1, default: (K1) ⇒ V1): V1
    Definition Classes
    MapLike → PartialFunction
  23. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  24. final def bNode(d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  25. final def balance(node: Node[Double]): Node[Double]
    Attributes
    protected
    Definition Classes
    Node
  26. final def balanceDel(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  27. final def balanceLeft(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  28. final def balanceRight(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  29. final def blacken(node: Node[Double]): Node[Double]
    Attributes
    protected
    Definition Classes
    Node
  30. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  31. def cdf[N](xx: N)(implicit num: Numeric[N]): Double

    Compute the CDF for a value, using piece-wise linear between clusters

  32. def cdfDiscrete[N](xx: N)(implicit num: Numeric[N]): Double
  33. def cdfDiscreteInverse[N](qq: N)(implicit num: Numeric[N]): Double
  34. def cdfInverse[N](qq: N)(implicit num: Numeric[N]): Double

    Compute the inverse-CDF from a given quantile on interval [0, 1], using piecewise linear interpolation between clusters

  35. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  36. def collect[B, That](pf: PartialFunction[(Double, Double), B])(implicit bf: CanBuildFrom[TDigestMap, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  37. def collectFirst[B](pf: PartialFunction[(Double, Double), B]): Option[B]
    Definition Classes
    TraversableOnce
  38. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  39. def compare(k0: Double, k1: Double): Int
    Definition Classes
    Sorted
  40. def compose[A](g: (A) ⇒ Double): (A) ⇒ Double
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  41. def contains(k: Double): Boolean
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  42. def copyToArray[B >: (Double, Double)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def copyToArray[B >: (Double, Double)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def copyToArray[B >: (Double, Double)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def copyToBuffer[B >: (Double, Double)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  46. def count(p: ((Double, Double)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def coverL(k: Double): Cover[(Double, Double)]
    Definition Classes
    NearestMapLike
  48. def coverLNodes(k: Double): Cover[INodeTD]
    Definition Classes
    NearestLike
  49. def coverR(k: Double): Cover[(Double, Double)]
    Definition Classes
    NearestMapLike
  50. def coverRNodes(k: Double): Cover[INodeTD]
    Definition Classes
    NearestLike
  51. def default(key: Double): Double
    Definition Classes
    MapLike → GenMapLike
  52. final def delLeft(node: INode[Double], k: Double): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  53. final def delRight(node: INode[Double], k: Double): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  54. def drop(n: Int): TDigestMap
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  55. def dropRight(n: Int): TDigestMap
    Definition Classes
    IterableLike
  56. def dropWhile(p: ((Double, Double)) ⇒ Boolean): TDigestMap
    Definition Classes
    TraversableLike → GenTraversableLike
  57. def empty: TDigestMap
    Definition Classes
    TDigestMap → OrderedMapLike → SortedMap → Map → MapLike
  58. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  59. def equals(that: Any): Boolean
    Definition Classes
    OrderedMapLike → GenMapLike → Equals → AnyRef → Any
  60. def exists(p: ((Double, Double)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def filter(p: ((Double, Double)) ⇒ Boolean): TDigestMap
    Definition Classes
    TraversableLike → GenTraversableLike
  62. def filterKeys(p: (Double) ⇒ Boolean): SortedMap[Double, Double]
    Definition Classes
    SortedMapLike → MapLike → GenMapLike
  63. def filterNot(p: ((Double, Double)) ⇒ Boolean): TDigestMap
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  64. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  65. def find(p: ((Double, Double)) ⇒ Boolean): Option[(Double, Double)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  66. def firstKey: Double
    Definition Classes
    SortedMapLike → Sorted
  67. def flatMap[B, That](f: ((Double, Double)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[TDigestMap, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  68. def flatten[B](implicit asTraversable: ((Double, Double)) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  69. def fold[A1 >: (Double, Double)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  70. def foldLeft[B](z: B)(op: (B, (Double, Double)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def foldRight[B](z: B)(op: ((Double, Double), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  72. def forall(p: ((Double, Double)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  73. def foreach[U](f: ((Double, Double)) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  74. def from(from: Double): TDigestMap
    Definition Classes
    Sorted
  75. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  76. def get(k: Double): Option[Double]
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  77. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  78. def getNode(k: Double): Option[INodeTD]
    Definition Classes
    OrderedLike
  79. def getOrElse[V1 >: Double](key: Double, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  80. def groupBy[K](f: ((Double, Double)) ⇒ K): Map[K, TDigestMap]
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def grouped(size: Int): Iterator[TDigestMap]
    Definition Classes
    IterableLike
  82. def hasAll(j: Iterator[Double]): Boolean
    Attributes
    protected
    Definition Classes
    Sorted
  83. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  84. def hashCode(): Int
    Definition Classes
    OrderedMapLike → GenMapLike → AnyRef → Any
  85. def head: (Double, Double)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  86. def headOption: Option[(Double, Double)]
    Definition Classes
    TraversableLike → GenTraversableLike
  87. def increment(k: Double, iv: Double): TDigestMap
    Definition Classes
    IncrementMapLike
  88. def init: TDigestMap
    Definition Classes
    TraversableLike → GenTraversableLike
  89. def inits: Iterator[TDigestMap]
    Definition Classes
    TraversableLike
  90. def isDefinedAt(key: Double): Boolean
    Definition Classes
    MapLike → GenMapLike → PartialFunction
  91. def isEmpty: Boolean
    Definition Classes
    OrderedMapLike → MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  92. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  93. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  94. def iterator: Iterator[(Double, Double)]
    Definition Classes
    OrderedMapLike → MapLike → IterableLike → GenIterableLike
  95. def iteratorFrom(k: Double): Iterator[(Double, Double)]
    Definition Classes
    OrderedMapLike → SortedMapLike
  96. def keyMax: Option[Double]
    Definition Classes
    NearestLike
  97. def keyMin: Option[Double]
    Definition Classes
    NearestLike
  98. def keySet: SortedSet[Double]
    Definition Classes
    SortedMapLike → MapLike → GenMapLike → Sorted
  99. def keys: Iterable[Double]
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  100. def keysIterator: Iterator[Double]
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  101. def keysIteratorFrom(k: Double): Iterator[Double]
    Definition Classes
    OrderedMapLike → Sorted
  102. def last: (Double, Double)
    Definition Classes
    TraversableLike → GenTraversableLike
  103. def lastKey: Double
    Definition Classes
    SortedMapLike → Sorted
  104. def lastOption: Option[(Double, Double)]
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def lift: (Double) ⇒ Option[Double]
    Definition Classes
    PartialFunction
  106. final def mCover(m: Double): Cover[INodeTD]

    Obtain a "mass cover": two adjacent nodes in the tree such that the cumulative mass of the left node is <= (m) and the cumulative mass of the right node is > (m)

    Obtain a "mass cover": two adjacent nodes in the tree such that the cumulative mass of the left node is <= (m) and the cumulative mass of the right node is > (m)

    m

    The target mass to cover between two adjacent nodes

    returns

    a Cover instance with the left and right covering tree nodes. If the (m) was < the mass of the left-most tree node, the left cover value will be None. Similarly if the mass was >= the cumulative mass of the right-most node (equivalent to sum of all node masses in the tree), then the right cover value will be None.

    Definition Classes
    NodeTD
  107. def map[B, That](f: ((Double, Double)) ⇒ B)(implicit bf: CanBuildFrom[TDigestMap, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  108. def mapValues[C](f: (Double) ⇒ C): SortedMap[Double, C]
    Definition Classes
    SortedMapLike → MapLike → GenMapLike
  109. def max[B >: (Double, Double)](implicit cmp: Ordering[B]): (Double, Double)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def maxBy[B](f: ((Double, Double)) ⇒ B)(implicit cmp: Ordering[B]): (Double, Double)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def min[B >: (Double, Double)](implicit cmp: Ordering[B]): (Double, Double)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def minBy[B](f: ((Double, Double)) ⇒ B)(implicit cmp: Ordering[B]): (Double, Double)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  117. def nearest(k: Double): Seq[(Double, Double)]
    Definition Classes
    NearestMapLike
  118. def nearestNodes(k: Double): Seq[INodeTD]
    Definition Classes
    NearestLike
  119. def newBuilder: Builder[(Double, Double), TDigestMap]
    Attributes
    protected[this]
    Definition Classes
    OrderedMapLike → MapLike → TraversableLike → HasNewBuilder
  120. def nodes: Iterable[INodeTD]
    Definition Classes
    OrderedLike
  121. def nodesFrom(k: Double): Iterable[INodeTD]
    Definition Classes
    OrderedLike
  122. def nodesIterator: Iterator[INodeTD]
    Definition Classes
    OrderedLike
  123. def nodesIteratorFrom(k: Double): Iterator[INodeTD]
    Definition Classes
    OrderedLike
  124. def nodesIteratorRange(from: Option[Double], until: Option[Double]): Iterator[INodeTD]
    Definition Classes
    OrderedLike
  125. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  127. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  128. def orElse[A1 <: Double, B1 >: Double](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  129. def ordering: Ordering[Double]
    Definition Classes
    OrderedMapLike → SortedMapLike → Sorted
  130. def par: ParMap[Double, Double]
    Definition Classes
    Parallelizable
  131. def parCombiner: Combiner[(Double, Double), ParMap[Double, Double]]
    Attributes
    protected[this]
    Definition Classes
    MapLike → TraversableLike → Parallelizable
  132. def partition(p: ((Double, Double)) ⇒ Boolean): (TDigestMap, TDigestMap)
    Definition Classes
    TraversableLike → GenTraversableLike
  133. final def prefixSum(k: Double, open: Boolean): Double
    Definition Classes
    NodePS
  134. def prefixSums(open: Boolean): Iterable[Double]
    Definition Classes
    PrefixSumMapLike
  135. def prefixSumsIterator(open: Boolean): Iterator[Double]
    Definition Classes
    PrefixSumMapLike
  136. def product[B >: (Double, Double)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. final def rNode(d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  138. def range(from: Double, until: Double): TDigestMap
    Definition Classes
    Sorted
  139. def rangeImpl(from: Option[Double], until: Option[Double]): TDigestMap
    Definition Classes
    OrderedMapLike → SortedMapLike → Sorted
  140. final def redden(node: Node[Double]): Node[Double]
    Attributes
    protected
    Definition Classes
    Node
  141. def reduce[A1 >: (Double, Double)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def reduceLeft[B >: (Double, Double)](op: (B, (Double, Double)) ⇒ B): B
    Definition Classes
    TraversableOnce
  143. def reduceLeftOption[B >: (Double, Double)](op: (B, (Double, Double)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def reduceOption[A1 >: (Double, Double)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def reduceRight[B >: (Double, Double)](op: ((Double, Double), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  146. def reduceRightOption[B >: (Double, Double)](op: ((Double, Double), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. def repr: TDigestMap
    Definition Classes
    TraversableLike → GenTraversableLike
  148. def reversed: List[(Double, Double)]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  149. def runWith[U](action: (Double) ⇒ U): (Double) ⇒ Boolean
    Definition Classes
    PartialFunction
  150. def sameElements[B >: (Double, Double)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  151. def scan[B >: (Double, Double), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[TDigestMap, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  152. def scanLeft[B, That](z: B)(op: (B, (Double, Double)) ⇒ B)(implicit bf: CanBuildFrom[TDigestMap, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  153. def scanRight[B, That](z: B)(op: ((Double, Double), B) ⇒ B)(implicit bf: CanBuildFrom[TDigestMap, 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.

  154. def seq: TDigestMap
    Definition Classes
    OrderedMapLike → GenMapLike → Parallelizable → TraversableOnce → GenTraversableOnce
  155. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  157. def slice(from: Int, until: Int): TDigestMap
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  158. def sliding(size: Int, step: Int): Iterator[TDigestMap]
    Definition Classes
    IterableLike
  159. def sliding(size: Int): Iterator[TDigestMap]
    Definition Classes
    IterableLike
  160. def span(p: ((Double, Double)) ⇒ Boolean): (TDigestMap, TDigestMap)
    Definition Classes
    TraversableLike → GenTraversableLike
  161. def splitAt(n: Int): (TDigestMap, TDigestMap)
    Definition Classes
    TraversableLike → GenTraversableLike
  162. def stringPrefix: String
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  163. def sum: Double
    Definition Classes
    PrefixSumMapLike
  164. def sum[B >: (Double, Double)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  165. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  166. def tail: TDigestMap
    Definition Classes
    TraversableLike → GenTraversableLike
  167. def tails: Iterator[TDigestMap]
    Definition Classes
    TraversableLike
  168. def take(n: Int): TDigestMap
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  169. def takeRight(n: Int): TDigestMap
    Definition Classes
    IterableLike
  170. def takeWhile(p: ((Double, Double)) ⇒ Boolean): TDigestMap
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  171. def thisCollection: Iterable[(Double, Double)]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  172. def to(to: Double): TDigestMap
    Definition Classes
    Sorted
  173. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (Double, Double), Col[(Double, Double)]]): Col[(Double, Double)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  174. def toArray[B >: (Double, Double)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. def toBuffer[E >: (Double, Double)]: Buffer[E]
    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  176. def toCollection(repr: TDigestMap): Iterable[(Double, Double)]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  177. def toIndexedSeq: IndexedSeq[(Double, Double)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  178. def toIterable: Iterable[(Double, Double)]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  179. def toIterator: Iterator[(Double, Double)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  180. def toList: List[(Double, Double)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  181. def toMap[T, U](implicit ev: <:<[(Double, Double), (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  182. def toSeq: Seq[(Double, Double)]
    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  183. def toSet[B >: (Double, Double)]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def toStream: Stream[(Double, Double)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  185. def toString(): String
    Definition Classes
    TDigestMap → MapLike → Function1 → TraversableLike → AnyRef → Any
  186. def toTraversable: Traversable[(Double, Double)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  187. def toVector: Vector[(Double, Double)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  188. def transpose[B](implicit asTraversable: ((Double, Double)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  189. def until(until: Double): TDigestMap
    Definition Classes
    Sorted
  190. def unzip[A1, A2](implicit asPair: ((Double, Double)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  191. def unzip3[A1, A2, A3](implicit asTriple: ((Double, Double)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  192. def updated[B1 >: Double](key: Double, value: B1): SortedMap[Double, B1]
    Definition Classes
    SortedMapLike → MapLike
  193. def values: Iterable[Double]
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  194. def valuesIterator: Iterator[Double]
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  195. def valuesIteratorFrom(k: Double): Iterator[Double]
    Definition Classes
    OrderedMapLike → SortedMapLike
  196. def view(from: Int, until: Int): IterableView[(Double, Double), TDigestMap]
    Definition Classes
    IterableLike → TraversableLike
  197. def view: IterableView[(Double, Double), TDigestMap]
    Definition Classes
    IterableLike → TraversableLike
  198. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  199. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  200. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  201. def withFilter(p: ((Double, Double)) ⇒ Boolean): FilterMonadic[(Double, Double), TDigestMap]
    Definition Classes
    TraversableLike → FilterMonadic
  202. def zip[A1 >: (Double, Double), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[TDigestMap, (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  203. def zipAll[B, A1 >: (Double, Double), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[TDigestMap, (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  204. def zipWithIndex[A1 >: (Double, Double), That](implicit bf: CanBuildFrom[TDigestMap, (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Inherited from NearestMapLike[Double, Double, INodeTD, TDigestMap]

Inherited from NearestLike[Double, INodeTD, TDigestMap]

Inherited from PrefixSumMapLike[Double, Double, Double, INodeTD, TDigestMap]

Inherited from IncrementMapLike[Double, Double, INodeTD, TDigestMap]

Inherited from OrderedMapLike[Double, Double, INodeTD, TDigestMap]

Inherited from OrderedLike[Double, INodeTD, TDigestMap]

Inherited from NodeTD

Inherited from NodeNearMap[Double, Double]

Inherited from NodeNear[Double]

Inherited from NodeInc[Double, Double]

Inherited from NodePS[Double, Double, Double]

Inherited from NodeMap[Double, Double]

Inherited from Node[Double]

Inherited from Serializable

Inherited from Serializable

Inherited from SortedMap[Double, Double]

Inherited from SortedMapLike[Double, Double, TDigestMap]

Inherited from Sorted[Double, TDigestMap]

Inherited from Map[Double, Double]

Inherited from MapLike[Double, Double, TDigestMap]

Inherited from Subtractable[Double, TDigestMap]

Inherited from PartialFunction[Double, Double]

Inherited from (Double) ⇒ Double

Inherited from GenMap[Double, Double]

Inherited from GenMapLike[Double, Double, TDigestMap]

Inherited from Iterable[(Double, Double)]

Inherited from IterableLike[(Double, Double), TDigestMap]

Inherited from Equals

Inherited from GenIterable[(Double, Double)]

Inherited from GenIterableLike[(Double, Double), TDigestMap]

Inherited from Traversable[(Double, Double)]

Inherited from GenTraversable[(Double, Double)]

Inherited from GenericTraversableTemplate[(Double, Double), Iterable]

Inherited from TraversableLike[(Double, Double), TDigestMap]

Inherited from GenTraversableLike[(Double, Double), TDigestMap]

Inherited from Parallelizable[(Double, Double), ParMap[Double, Double]]

Inherited from TraversableOnce[(Double, Double)]

Inherited from GenTraversableOnce[(Double, Double)]

Inherited from FilterMonadic[(Double, Double), TDigestMap]

Inherited from HasNewBuilder[(Double, Double), TDigestMap]

Inherited from AnyRef

Inherited from Any

Ungrouped