Trait/Object

org.isarnproject.sketches.tdmap

TDigestMap

Related Docs: object TDigestMap | package tdmap

Permalink

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[A] with Set[A] with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    MapLike

  2. class DefaultKeySortedSet extends scala.collection.SortedMapLike.DefaultKeySet with SortedSet[A]

    Permalink
    Attributes
    protected
    Definition Classes
    SortedMapLike

  3. class DefaultValuesIterable extends AbstractIterable[B] with Iterable[B] with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    MapLike

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

    Permalink
    Attributes
    protected
    Definition Classes
    MapLike

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

    Permalink
    Attributes
    protected
    Definition Classes
    MapLike

  6. type Self = TDigestMap

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  7. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def iNode(color: Color, d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  2. abstract def keyOrdering: Numeric[Double]

    Permalink
    Definition Classes
    NodeNear → Node

  3. abstract def node(k: Double): Option[INode[Double]]

    Permalink
    Definition Classes
    Node

  4. abstract def nodeMax: Option[INode[Double]]

    Permalink
    Definition Classes
    Node

  5. abstract def nodeMin: Option[INode[Double]]

    Permalink
    Definition Classes
    Node

  6. abstract def pfs: Double

    Permalink
    Definition Classes
    NodePS

  7. abstract def prefixAggregator: AggregatorAPI[Double, Double]

    Permalink
    Definition Classes
    NodePS

  8. abstract def valueMonoid: MonoidAPI[Double]

    Permalink
    Definition Classes
    NodeInc

Concrete Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    OrderedMapLike → SortedMapLike → MapLike → GenMapLike

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

    Permalink
    Definition Classes
    SortedMapLike → MapLike

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

    Permalink
    Definition Classes
    SortedMapLike → MapLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike

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

    Permalink
    Definition Classes
    TraversableLike

  9. def -(k: Double): TDigestMap

    Permalink
    Definition Classes
    OrderedMapLike → MapLike → Subtractable → GenMapLike

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

    Permalink
    Definition Classes
    Subtractable

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

    Permalink
    Definition Classes
    Subtractable

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    MapLike → TraversableOnce

  16. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    PartialFunction → Function1

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

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  21. def apply(key: Double): Double

    Permalink
    Definition Classes
    MapLike → GenMapLike → Function1

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

    Permalink
    Definition Classes
    PartialFunction

  23. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

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

    Permalink
    Attributes
    protected
    Definition Classes
    Node

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

    Permalink
    Attributes
    protected
    Definition Classes
    Node

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

    Permalink
    Attributes
    protected
    Definition Classes
    Node

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

    Permalink
    Attributes
    protected
    Definition Classes
    Node

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

    Permalink
    Attributes
    protected
    Definition Classes
    Node

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

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  30. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    IterableLike → Equals

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

    Permalink

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

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

    Permalink

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

    Permalink

  34. def cdfInverse[N](qq: N)(implicit num: Numeric[N]): Double

    Permalink

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

  35. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableOnce

  38. def companion: GenericCompanion[Iterable]

    Permalink
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

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

    Permalink
    Definition Classes
    Sorted

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

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()

  41. def contains(k: Double): Boolean

    Permalink
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    NearestMapLike

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

    Permalink
    Definition Classes
    NearestLike

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

    Permalink
    Definition Classes
    NearestMapLike

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

    Permalink
    Definition Classes
    NearestLike

  51. def default(key: Double): Double

    Permalink
    Definition Classes
    MapLike → GenMapLike

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

    Permalink
    Attributes
    protected
    Definition Classes
    Node

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

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  54. def drop(n: Int): TDigestMap

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  55. def dropRight(n: Int): TDigestMap

    Permalink
    Definition Classes
    IterableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  57. def empty: TDigestMap

    Permalink
    Definition Classes
    TDigestMap → OrderedMapLike → SortedMap → Map → MapLike

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

    Permalink
    Definition Classes
    AnyRef

  59. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    OrderedMapLike → GenMapLike → Equals → AnyRef → Any

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    SortedMapLike → MapLike → GenMapLike

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

    Permalink
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  64. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  66. def firstKey: Double

    Permalink
    Definition Classes
    SortedMapLike → Sorted

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Permalink
    Definition Classes
    GenericTraversableTemplate

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

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

  74. def from(from: Double): TDigestMap

    Permalink
    Definition Classes
    Sorted

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

    Permalink
    Definition Classes
    GenericTraversableTemplate

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

    Permalink
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    OrderedLike

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

    Permalink
    Definition Classes
    MapLike → GenMapLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    IterableLike

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

    Permalink
    Attributes
    protected
    Definition Classes
    Sorted

  83. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  84. def hashCode(): Int

    Permalink
    Definition Classes
    OrderedMapLike → GenMapLike → AnyRef → Any

  85. def head: (Double, Double)

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    IncrementMapLike

  88. def init: TDigestMap

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  89. def inits: Iterator[TDigestMap]

    Permalink
    Definition Classes
    TraversableLike

  90. def isDefinedAt(key: Double): Boolean

    Permalink
    Definition Classes
    MapLike → GenMapLike → PartialFunction

  91. def isEmpty: Boolean

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

  92. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  93. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

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

    Permalink
    Definition Classes
    OrderedMapLike → MapLike → IterableLike → GenIterableLike

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

    Permalink
    Definition Classes
    OrderedMapLike → SortedMapLike

  96. def keyMax: Option[Double]

    Permalink
    Definition Classes
    NearestLike

  97. def keyMin: Option[Double]

    Permalink
    Definition Classes
    NearestLike

  98. def keySet: SortedSet[Double]

    Permalink
    Definition Classes
    SortedMapLike → MapLike → GenMapLike → Sorted

  99. def keys: Iterable[Double]

    Permalink
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

  100. def keysIterator: Iterator[Double]

    Permalink
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

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

    Permalink
    Definition Classes
    OrderedMapLike → Sorted

  102. def last: (Double, Double)

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  103. def lastKey: Double

    Permalink
    Definition Classes
    SortedMapLike → Sorted

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    PartialFunction

  106. final def mCover(m: Double): Cover[INodeTD]

    Permalink

    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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Permalink
    Definition Classes
    SortedMapLike → MapLike → GenMapLike

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  113. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  114. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    NearestMapLike

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

    Permalink
    Definition Classes
    NearestLike

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

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

  120. def nodes: Iterable[INodeTD]

    Permalink
    Definition Classes
    OrderedLike

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

    Permalink
    Definition Classes
    OrderedLike

  122. def nodesIterator: Iterator[INodeTD]

    Permalink
    Definition Classes
    OrderedLike

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

    Permalink
    Definition Classes
    OrderedLike

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

    Permalink
    Definition Classes
    OrderedLike

  125. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  126. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  127. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    PartialFunction

  129. def ordering: Ordering[Double]

    Permalink
    Definition Classes
    OrderedMapLike → SortedMapLike → Sorted

  130. def par: ParMap[Double, Double]

    Permalink
    Definition Classes
    Parallelizable

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    NodePS

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

    Permalink
    Definition Classes
    PrefixSumMapLike

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

    Permalink
    Definition Classes
    PrefixSumMapLike

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Attributes
    protected
    Definition Classes
    Node

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

    Permalink
    Definition Classes
    Sorted

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

    Permalink
    Definition Classes
    OrderedMapLike → SortedMapLike → Sorted

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

    Permalink
    Attributes
    protected
    Definition Classes
    Node

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  147. def repr: TDigestMap

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    PartialFunction

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    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

    Permalink
    Definition Classes
    OrderedMapLike → GenMapLike → Parallelizable → TraversableOnce → GenTraversableOnce

  155. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    IterableLike

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

    Permalink
    Definition Classes
    IterableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  161. def stringPrefix: String

    Permalink
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  162. def sum: Double

    Permalink
    Definition Classes
    PrefixSumMapLike

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef

  165. def tail: TDigestMap

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  166. def tails: Iterator[TDigestMap]

    Permalink
    Definition Classes
    TraversableLike

  167. def take(n: Int): TDigestMap

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  168. def takeRight(n: Int): TDigestMap

    Permalink
    Definition Classes
    IterableLike

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  171. def to(to: Double): TDigestMap

    Permalink
    Definition Classes
    Sorted

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

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  184. def toString(): String

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

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

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  187. def transpose[B](implicit asTraversable: ((Double, Double)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  188. def until(until: Double): TDigestMap

    Permalink
    Definition Classes
    Sorted

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

    Permalink
    Definition Classes
    GenericTraversableTemplate

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

    Permalink
    Definition Classes
    GenericTraversableTemplate

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

    Permalink
    Definition Classes
    SortedMapLike → MapLike

  192. def values: Iterable[Double]

    Permalink
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

  193. def valuesIterator: Iterator[Double]

    Permalink
    Definition Classes
    OrderedMapLike → MapLike → GenMapLike

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

    Permalink
    Definition Classes
    OrderedMapLike → SortedMapLike

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike

  197. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

  202. def zipAll[B, A1 >: (Double, Double), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[TDigestMap, (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

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

    Permalink
    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