org.isarnproject.sketches.tdmap

TDigestMap

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
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. class DefaultKeySet extends AbstractSet[A] with Set[A] 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[B] with Iterable[B] with Serializable

    Attributes
    protected
    Definition Classes
    MapLike

  4. class FilteredKeys extends AbstractMap[A, B] with DefaultMap[A, B]

    Attributes
    protected
    Definition Classes
    MapLike

  5. class MappedValues[C] extends AbstractMap[A, C] with DefaultMap[A, C]

    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: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def +[V2 >: Double](kv2: (Double, V2)): TDigestMap

    Definition Classes
    OrderedMapLike → SortedMapLike → MapLike → GenMapLike

  5. def +[B1 >: Double](elem1: (Double, B1), elem2: (Double, B1), elems: (Double, B1)*): SortedMap[Double, B1]

    Definition Classes
    SortedMapLike → MapLike

  6. def ++[B1 >: Double](xs: GenTraversableOnce[(Double, B1)]): SortedMap[Double, B1]

    Definition Classes
    SortedMapLike → MapLike

  7. def ++[B >: (Double, Double), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[TDigestMap, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  8. def ++:[B >: (Double, Double), That](that: Traversable[B])(implicit bf: CanBuildFrom[TDigestMap, B, That]): That

    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike

  10. def -(k: Double): TDigestMap

    Definition Classes
    OrderedMapLike → MapLike → Subtractable → GenMapLike

  11. def -(elem1: Double, elem2: Double, elems: Double*): TDigestMap

    Definition Classes
    Subtractable

  12. def --(xs: GenTraversableOnce[Double]): TDigestMap

    Definition Classes
    Subtractable

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  14. def :\[B](z: B)(op: ((Double, Double), B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  15. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  16. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  17. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    MapLike → TraversableOnce

  18. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

  19. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce

  20. def aggregate[B](z: B)(seqop: (B, (Double, Double)) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    PartialFunction → Function1

  22. final def append(tl: Node[Double], tr: Node[Double]): Node[Double]

    Attributes
    protected
    Definition Classes
    Node

  23. def apply(key: Double): Double

    Definition Classes
    MapLike → GenMapLike → Function1

  24. def applyOrElse[A1 <: Double, B1 >: Double](x: A1, default: (A1) ⇒ B1): B1

    Definition Classes
    PartialFunction

  25. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  26. final def bNode(d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]

    Attributes
    protected
    Definition Classes
    Node

  27. final def balance(node: Node[Double]): Node[Double]

    Attributes
    protected
    Definition Classes
    Node

  28. final def balanceDel(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]

    Attributes
    protected
    Definition Classes
    Node

  29. final def balanceLeft(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]

    Attributes
    protected
    Definition Classes
    Node

  30. final def balanceRight(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]

    Attributes
    protected
    Definition Classes
    Node

  31. final def blacken(node: Node[Double]): Node[Double]

    Attributes
    protected
    Definition Classes
    Node

  32. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike → Equals

  33. def cdf[N](xx: N)(implicit num: Numeric[N]): Double

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

  34. def cdfDiscrete[N](xx: N)(implicit num: Numeric[N]): Double

  35. def cdfDiscreteInverse[N](qq: N)(implicit num: Numeric[N]): Double

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

  37. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    TraversableLike → GenTraversableLike

  39. def collectFirst[B](pf: PartialFunction[(Double, Double), B]): Option[B]

    Definition Classes
    TraversableOnce

  40. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

  41. def compare(k0: Double, k1: Double): Int

    Definition Classes
    Sorted

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

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  43. def contains(k: Double): Boolean

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  49. def coverL(k: Double): Cover[(Double, Double)]

    Definition Classes
    NearestMapLike

  50. def coverLNodes(k: Double): Cover[INodeTD]

    Definition Classes
    NearestLike

  51. def coverR(k: Double): Cover[(Double, Double)]

    Definition Classes
    NearestMapLike

  52. def coverRNodes(k: Double): Cover[INodeTD]

    Definition Classes
    NearestLike

  53. def default(key: Double): Double

    Definition Classes
    MapLike → GenMapLike

  54. final def delLeft(node: INode[Double], k: Double): INode[Double]

    Attributes
    protected
    Definition Classes
    Node

  55. final def delRight(node: INode[Double], k: Double): INode[Double]

    Attributes
    protected
    Definition Classes
    Node

  56. def drop(n: Int): TDigestMap

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  57. def dropRight(n: Int): TDigestMap

    Definition Classes
    IterableLike

  58. def dropWhile(p: ((Double, Double)) ⇒ Boolean): TDigestMap

    Definition Classes
    TraversableLike → GenTraversableLike

  59. def empty: TDigestMap

    Definition Classes
    TDigestMap → OrderedMapLike → SortedMap → Map → MapLike

  60. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  61. def equals(that: Any): Boolean

    Definition Classes
    OrderedMapLike → GenMapLike → Equals → AnyRef → Any

  62. def exists(p: ((Double, Double)) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  63. def filter(p: ((Double, Double)) ⇒ Boolean): TDigestMap

    Definition Classes
    TraversableLike → GenTraversableLike

  64. def filterKeys(p: (Double) ⇒ Boolean): SortedMap[Double, Double]

    Definition Classes
    SortedMapLike → MapLike → GenMapLike

  65. def filterNot(p: ((Double, Double)) ⇒ Boolean): TDigestMap

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  66. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  68. def firstKey: Double

    Definition Classes
    SortedMapLike → Sorted

  69. def flatMap[B, That](f: ((Double, Double)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[TDigestMap, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  70. def flatten[B](implicit asTraversable: ((Double, Double)) ⇒ GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate

  71. def fold[A1 >: (Double, Double)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  74. def forall(p: ((Double, Double)) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  76. def from(from: Double): TDigestMap

    Definition Classes
    Sorted

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

    Definition Classes
    GenericTraversableTemplate

  78. def get(k: Double): Option[Double]

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

  79. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  80. def getNode(k: Double): Option[INodeTD]

    Definition Classes
    OrderedLike

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

    Definition Classes
    MapLike → GenMapLike

  82. def groupBy[K](f: ((Double, Double)) ⇒ K): Map[K, TDigestMap]

    Definition Classes
    TraversableLike → GenTraversableLike

  83. def grouped(size: Int): Iterator[TDigestMap]

    Definition Classes
    IterableLike

  84. def hasAll(j: Iterator[Double]): Boolean

    Attributes
    protected
    Definition Classes
    Sorted

  85. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  86. def hashCode(): Int

    Definition Classes
    OrderedMapLike → GenMapLike → AnyRef → Any

  87. def head: (Double, Double)

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  88. def headOption: Option[(Double, Double)]

    Definition Classes
    TraversableLike → GenTraversableLike

  89. def increment(k: Double, iv: Double): TDigestMap

    Definition Classes
    IncrementMapLike

  90. def init: TDigestMap

    Definition Classes
    TraversableLike → GenTraversableLike

  91. def inits: Iterator[TDigestMap]

    Definition Classes
    TraversableLike

  92. def isDefinedAt(key: Double): Boolean

    Definition Classes
    MapLike → GenMapLike → PartialFunction

  93. def isEmpty: Boolean

    Definition Classes
    OrderedMapLike → MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  94. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  95. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  96. def iterator: Iterator[(Double, Double)]

    Definition Classes
    OrderedMapLike → MapLike → IterableLike → GenIterableLike

  97. def iteratorFrom(k: Double): Iterator[(Double, Double)]

    Definition Classes
    OrderedMapLike

  98. def keyMax: Option[Double]

    Definition Classes
    NearestLike

  99. def keyMin: Option[Double]

    Definition Classes
    NearestLike

  100. def keySet: SortedSet[Double]

    Definition Classes
    SortedMapLike → MapLike → GenMapLike → Sorted

  101. def keys: Iterable[Double]

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

  102. def keysIterator: Iterator[Double]

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

  103. def keysIteratorFrom(k: Double): Iterator[Double]

    Definition Classes
    OrderedMapLike

  104. def last: (Double, Double)

    Definition Classes
    TraversableLike → GenTraversableLike

  105. def lastKey: Double

    Definition Classes
    SortedMapLike → Sorted

  106. def lastOption: Option[(Double, Double)]

    Definition Classes
    TraversableLike → GenTraversableLike

  107. def lift: (Double) ⇒ Option[Double]

    Definition Classes
    PartialFunction

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

  109. def map[B, That](f: ((Double, Double)) ⇒ B)(implicit bf: CanBuildFrom[TDigestMap, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  110. def mapValues[C](f: (Double) ⇒ C): SortedMap[Double, C]

    Definition Classes
    SortedMapLike → MapLike → GenMapLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  112. def maxBy[B](f: ((Double, Double)) ⇒ B)(implicit cmp: Ordering[B]): (Double, Double)

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  114. def minBy[B](f: ((Double, Double)) ⇒ B)(implicit cmp: Ordering[B]): (Double, Double)

    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  116. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  118. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  119. def nearest(k: Double): Seq[(Double, Double)]

    Definition Classes
    NearestMapLike

  120. def nearestNodes(k: Double): Seq[INodeTD]

    Definition Classes
    NearestLike

  121. def newBuilder: Builder[(Double, Double), TDigestMap]

    Attributes
    protected[this]
    Definition Classes
    OrderedMapLike → MapLike → TraversableLike → HasNewBuilder

  122. def nodes: Iterable[INodeTD]

    Definition Classes
    OrderedLike

  123. def nodesFrom(k: Double): Iterable[INodeTD]

    Definition Classes
    OrderedLike

  124. def nodesIterator: Iterator[INodeTD]

    Definition Classes
    OrderedLike

  125. def nodesIteratorFrom(k: Double): Iterator[INodeTD]

    Definition Classes
    OrderedLike

  126. def nodesIteratorRange(from: Option[Double], until: Option[Double]): Iterator[INodeTD]

    Definition Classes
    OrderedLike

  127. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  128. final def notify(): Unit

    Definition Classes
    AnyRef

  129. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    PartialFunction

  131. def ordering: Ordering[Double]

    Definition Classes
    OrderedMapLike → SortedMapLike → Sorted

  132. def par: ParMap[Double, Double]

    Definition Classes
    Parallelizable

  133. def parCombiner: Combiner[(Double, Double), ParMap[Double, Double]]

    Attributes
    protected[this]
    Definition Classes
    MapLike → TraversableLike → Parallelizable

  134. def partition(p: ((Double, Double)) ⇒ Boolean): (TDigestMap, TDigestMap)

    Definition Classes
    TraversableLike → GenTraversableLike

  135. final def prefixSum(k: Double, open: Boolean): Double

    Definition Classes
    NodePS

  136. def prefixSums(open: Boolean): Iterable[Double]

    Definition Classes
    PrefixSumMapLike

  137. def prefixSumsIterator(open: Boolean): Iterator[Double]

    Definition Classes
    PrefixSumMapLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  139. final def rNode(d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]

    Attributes
    protected
    Definition Classes
    Node

  140. def range(from: Double, until: Double): TDigestMap

    Definition Classes
    Sorted

  141. def rangeImpl(from: Option[Double], until: Option[Double]): TDigestMap

    Definition Classes
    OrderedMapLike → SortedMapLike → Sorted

  142. final def redden(node: Node[Double]): Node[Double]

    Attributes
    protected
    Definition Classes
    Node

  143. def reduce[A1 >: (Double, Double)](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  146. def reduceOption[A1 >: (Double, Double)](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  149. def repr: TDigestMap

    Definition Classes
    TraversableLike → GenTraversableLike

  150. def reversed: List[(Double, Double)]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  151. def runWith[U](action: (Double) ⇒ U): (Double) ⇒ Boolean

    Definition Classes
    PartialFunction

  152. def sameElements[B >: (Double, Double)](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike

  153. def scan[B >: (Double, Double), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[TDigestMap, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  154. def scanLeft[B, That](z: B)(op: (B, (Double, Double)) ⇒ B)(implicit bf: CanBuildFrom[TDigestMap, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

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

  156. def seq: TDigestMap

    Definition Classes
    OrderedMapLike → GenMapLike → Parallelizable → TraversableOnce → GenTraversableOnce

  157. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  158. def slice(from: Int, until: Int): TDigestMap

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  159. def sliding(size: Int, step: Int): Iterator[TDigestMap]

    Definition Classes
    IterableLike

  160. def sliding(size: Int): Iterator[TDigestMap]

    Definition Classes
    IterableLike

  161. def span(p: ((Double, Double)) ⇒ Boolean): (TDigestMap, TDigestMap)

    Definition Classes
    TraversableLike → GenTraversableLike

  162. def splitAt(n: Int): (TDigestMap, TDigestMap)

    Definition Classes
    TraversableLike → GenTraversableLike

  163. def stringPrefix: String

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  164. def sum: Double

    Definition Classes
    PrefixSumMapLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  167. def tail: TDigestMap

    Definition Classes
    TraversableLike → GenTraversableLike

  168. def tails: Iterator[TDigestMap]

    Definition Classes
    TraversableLike

  169. def take(n: Int): TDigestMap

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  170. def takeRight(n: Int): TDigestMap

    Definition Classes
    IterableLike

  171. def takeWhile(p: ((Double, Double)) ⇒ Boolean): TDigestMap

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  172. def thisCollection: Iterable[(Double, Double)]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  173. def to(to: Double): TDigestMap

    Definition Classes
    Sorted

  174. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (Double, Double), Col[(Double, Double)]]): Col[(Double, Double)]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  175. def toArray[B >: (Double, Double)](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  176. def toBuffer[C >: (Double, Double)]: Buffer[C]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

  177. def toCollection(repr: TDigestMap): Iterable[(Double, Double)]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  178. def toIndexedSeq: IndexedSeq[(Double, Double)]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  179. def toIterable: Iterable[(Double, Double)]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  180. def toIterator: Iterator[(Double, Double)]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  181. def toList: List[(Double, Double)]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  183. def toSeq: Seq[(Double, Double)]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  185. def toStream: Stream[(Double, Double)]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  186. def toString(): String

    Definition Classes
    TDigestMap → MapLike → Function1 → TraversableLike → AnyRef → Any

  187. def toTraversable: Traversable[(Double, Double)]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  188. def toVector: Vector[(Double, Double)]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

  190. def until(until: Double): TDigestMap

    Definition Classes
    Sorted

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

    Definition Classes
    GenericTraversableTemplate

  192. def unzip3[A1, A2, A3](implicit asTriple: ((Double, Double)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Definition Classes
    GenericTraversableTemplate

  193. def updated[B1 >: Double](key: Double, value: B1): SortedMap[Double, B1]

    Definition Classes
    SortedMapLike → MapLike

  194. def values: Iterable[Double]

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

  195. def valuesIterator: Iterator[Double]

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

  196. def valuesIteratorFrom(k: Double): Iterator[Double]

    Definition Classes
    OrderedMapLike

  197. def view(from: Int, until: Int): IterableView[(Double, Double), TDigestMap]

    Definition Classes
    IterableLike → TraversableLike

  198. def view: IterableView[(Double, Double), TDigestMap]

    Definition Classes
    IterableLike → TraversableLike

  199. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  201. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  202. def withFilter(p: ((Double, Double)) ⇒ Boolean): FilterMonadic[(Double, Double), TDigestMap]

    Definition Classes
    TraversableLike → FilterMonadic

  203. def zip[A1 >: (Double, Double), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[TDigestMap, (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

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

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

    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def /:\[A1 >: (Double, Double)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

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