org.isarnproject.collections.mixmaps.prefixsum

PrefixSumMap

sealed trait PrefixSumMap[K, V, P] extends SortedMap[K, V] with PrefixSumMapLike[K, V, P, INodePS[K, V, P], PrefixSumMap[K, V, P]]

Linear Supertypes
PrefixSumMapLike[K, V, P, INodePS[K, V, P], PrefixSumMap[K, V, P]], OrderedMapLike[K, V, INodePS[K, V, P], PrefixSumMap[K, V, P]], OrderedLike[K, INodePS[K, V, P], PrefixSumMap[K, V, P]], NodePS[K, V, P], NodeMap[K, V], Node[K], Serializable, Serializable, SortedMap[K, V], SortedMapLike[K, V, PrefixSumMap[K, V, P]], Sorted[K, PrefixSumMap[K, V, P]], Map[K, V], MapLike[K, V, PrefixSumMap[K, V, P]], Subtractable[K, PrefixSumMap[K, V, P]], PartialFunction[K, V], (K) ⇒ V, GenMap[K, V], GenMapLike[K, V, PrefixSumMap[K, V, P]], Iterable[(K, V)], IterableLike[(K, V), PrefixSumMap[K, V, P]], Equals, GenIterable[(K, V)], GenIterableLike[(K, V), PrefixSumMap[K, V, P]], Traversable[(K, V)], GenTraversable[(K, V)], GenericTraversableTemplate[(K, V), Iterable], TraversableLike[(K, V), PrefixSumMap[K, V, P]], GenTraversableLike[(K, V), PrefixSumMap[K, V, P]], Parallelizable[(K, V), ParMap[K, V]], TraversableOnce[(K, V)], GenTraversableOnce[(K, V)], FilterMonadic[(K, V), PrefixSumMap[K, V, P]], HasNewBuilder[(K, V), PrefixSumMap[K, V, P]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. PrefixSumMap
  2. PrefixSumMapLike
  3. OrderedMapLike
  4. OrderedLike
  5. NodePS
  6. NodeMap
  7. Node
  8. Serializable
  9. Serializable
  10. SortedMap
  11. SortedMapLike
  12. Sorted
  13. Map
  14. MapLike
  15. Subtractable
  16. PartialFunction
  17. Function1
  18. GenMap
  19. GenMapLike
  20. Iterable
  21. IterableLike
  22. Equals
  23. GenIterable
  24. GenIterableLike
  25. Traversable
  26. GenTraversable
  27. GenericTraversableTemplate
  28. TraversableLike
  29. GenTraversableLike
  30. Parallelizable
  31. TraversableOnce
  32. GenTraversableOnce
  33. FilterMonadic
  34. HasNewBuilder
  35. AnyRef
  36. 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 = PrefixSumMap[K, V, P]

    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[K], lsub: Node[K], rsub: Node[K]): INode[K]

    Instantiate an internal node.

    Instantiate an internal node.

    Attributes
    protected
    Definition Classes
    Node
  2. abstract def keyOrdering: Ordering[K]

    The ordering that is applied to key values

    The ordering that is applied to key values

    Definition Classes
    Node
  3. abstract def node(k: K): Option[INode[K]]

    Obtain the node stored at a given key if it exists, None otherwise

    Obtain the node stored at a given key if it exists, None otherwise

    Definition Classes
    Node
  4. abstract def nodeMax: Option[INode[K]]

    Definition Classes
    Node
  5. abstract def nodeMin: Option[INode[K]]

    Definition Classes
    Node
  6. abstract def pfs: P

    Definition Classes
    NodePS
  7. abstract def prefixAggregator: AggregatorAPI[P, V]

    Aggregator that defines semantics of prefix sum

    Aggregator that defines semantics of prefix sum

    Definition Classes
    NodePS

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 >: V](kv2: (K, V2)): PrefixSumMap[K, V, P]

    Definition Classes
    OrderedMapLike → SortedMapLike → MapLike → GenMapLike
  5. def +[B1 >: V](elem1: (K, B1), elem2: (K, B1), elems: (K, B1)*): SortedMap[K, B1]

    Definition Classes
    SortedMapLike → MapLike
  6. def ++[B1 >: V](xs: GenTraversableOnce[(K, B1)]): SortedMap[K, B1]

    Definition Classes
    SortedMapLike → MapLike
  7. def ++[B >: (K, V), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[PrefixSumMap[K, V, P], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  8. def ++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[PrefixSumMap[K, V, P], B, That]): That

    Definition Classes
    TraversableLike
  9. def ++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[PrefixSumMap[K, V, P], B, That]): That

    Definition Classes
    TraversableLike
  10. def -(k: K): PrefixSumMap[K, V, P]

    Obtain a new container with key removed

    Obtain a new container with key removed

    Definition Classes
    OrderedMapLike → MapLike → Subtractable → GenMapLike
  11. def -(elem1: K, elem2: K, elems: K*): PrefixSumMap[K, V, P]

    Definition Classes
    Subtractable
  12. def --(xs: GenTraversableOnce[K]): PrefixSumMap[K, V, P]

    Definition Classes
    Subtractable
  13. def /:[B](z: B)(op: (B, (K, V)) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. def :\[B](z: B)(op: ((K, V), 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, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. def andThen[C](k: (V) ⇒ C): PartialFunction[K, C]

    Definition Classes
    PartialFunction → Function1
  22. final def append(tl: Node[K], tr: Node[K]): Node[K]

    Attributes
    protected
    Definition Classes
    Node
  23. def apply(key: K): V

    Definition Classes
    MapLike → GenMapLike → Function1
  24. def applyOrElse[A1 <: K, B1 >: V](x: A1, default: (A1) ⇒ B1): B1

    Definition Classes
    PartialFunction
  25. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  26. final def bNode(d: Data[K], lsub: Node[K], rsub: Node[K]): INode[K]

    create a new Black node from a key, value, left subtree and right subtree

    create a new Black node from a key, value, left subtree and right subtree

    Attributes
    protected
    Definition Classes
    Node
  27. final def balance(node: Node[K]): Node[K]

    Attributes
    protected
    Definition Classes
    Node
  28. final def balanceDel(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

    Attributes
    protected
    Definition Classes
    Node
  29. final def balanceLeft(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

    Attributes
    protected
    Definition Classes
    Node
  30. final def balanceRight(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

    Attributes
    protected
    Definition Classes
    Node
  31. final def blacken(node: Node[K]): Node[K]

    Attributes
    protected
    Definition Classes
    Node
  32. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike → Equals
  33. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. def collect[B, That](pf: PartialFunction[(K, V), B])(implicit bf: CanBuildFrom[PrefixSumMap[K, V, P], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  35. def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]

    Definition Classes
    TraversableOnce
  36. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  37. def compare(k0: K, k1: K): Int

    Definition Classes
    Sorted
  38. def compose[A](g: (A) ⇒ K): (A) ⇒ V

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  39. def contains(k: K): Boolean

    Returns true if key is present in the container, false otherwise

    Returns true if key is present in the container, false otherwise

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  40. def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  41. def copyToArray[B >: (K, V)](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce
  44. def count(p: ((K, V)) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def default(key: K): V

    Definition Classes
    MapLike → GenMapLike
  46. final def delLeft(node: INode[K], k: K): INode[K]

    Attributes
    protected
    Definition Classes
    Node
  47. final def delRight(node: INode[K], k: K): INode[K]

    Attributes
    protected
    Definition Classes
    Node
  48. def drop(n: Int): PrefixSumMap[K, V, P]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  49. def dropRight(n: Int): PrefixSumMap[K, V, P]

    Definition Classes
    IterableLike
  50. def dropWhile(p: ((K, V)) ⇒ Boolean): PrefixSumMap[K, V, P]

    Definition Classes
    TraversableLike → GenTraversableLike
  51. def empty: PrefixSumMap[K, V, P]

    Definition Classes
    PrefixSumMapOrderedMapLike → SortedMap → Map → MapLike
  52. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  53. def equals(that: Any): Boolean

    Definition Classes
    OrderedMapLike → GenMapLike → Equals → AnyRef → Any
  54. def exists(p: ((K, V)) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  55. def filter(p: ((K, V)) ⇒ Boolean): PrefixSumMap[K, V, P]

    Definition Classes
    TraversableLike → GenTraversableLike
  56. def filterKeys(p: (K) ⇒ Boolean): SortedMap[K, V]

    Definition Classes
    SortedMapLike → MapLike → GenMapLike
  57. def filterNot(p: ((K, V)) ⇒ Boolean): PrefixSumMap[K, V, P]

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  58. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  59. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  60. def firstKey: K

    Definition Classes
    SortedMapLike → Sorted
  61. def flatMap[B, That](f: ((K, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[PrefixSumMap[K, V, P], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  62. def flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate
  63. def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  64. def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  65. def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  66. def forall(p: ((K, V)) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  67. def foreach[U](f: ((K, V)) ⇒ U): Unit

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  68. def from(from: K): PrefixSumMap[K, V, P]

    Definition Classes
    Sorted
  69. def genericBuilder[B]: Builder[B, Iterable[B]]

    Definition Classes
    GenericTraversableTemplate
  70. def get(k: K): Option[V]

    Get the value stored at a key, or None if key is not present

    Get the value stored at a key, or None if key is not present

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  71. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  72. def getNode(k: K): Option[INodePS[K, V, P]]

    Get the internal node stored at at key, or None if key is not present

    Get the internal node stored at at key, or None if key is not present

    Definition Classes
    OrderedLike
  73. def getOrElse[B1 >: V](key: K, default: ⇒ B1): B1

    Definition Classes
    MapLike → GenMapLike
  74. def groupBy[K](f: ((K, V)) ⇒ K): Map[K, PrefixSumMap[K, V, P]]

    Definition Classes
    TraversableLike → GenTraversableLike
  75. def grouped(size: Int): Iterator[PrefixSumMap[K, V, P]]

    Definition Classes
    IterableLike
  76. def hasAll(j: Iterator[K]): Boolean

    Attributes
    protected
    Definition Classes
    Sorted
  77. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  78. def hashCode(): Int

    Definition Classes
    OrderedMapLike → GenMapLike → AnyRef → Any
  79. def head: (K, V)

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  80. def headOption: Option[(K, V)]

    Definition Classes
    TraversableLike → GenTraversableLike
  81. def init: PrefixSumMap[K, V, P]

    Definition Classes
    TraversableLike → GenTraversableLike
  82. def inits: Iterator[PrefixSumMap[K, V, P]]

    Definition Classes
    TraversableLike
  83. def isDefinedAt(key: K): Boolean

    Definition Classes
    MapLike → GenMapLike → PartialFunction
  84. def isEmpty: Boolean

    Definition Classes
    OrderedMapLike → MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  85. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  86. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  87. def iterator: Iterator[(K, V)]

    Iterator over (key,val) pairs, in key order

    Iterator over (key,val) pairs, in key order

    Definition Classes
    OrderedMapLike → MapLike → IterableLike → GenIterableLike
  88. def iteratorFrom(k: K): Iterator[(K, V)]

    Definition Classes
    OrderedMapLike
  89. def keySet: SortedSet[K]

    Definition Classes
    SortedMapLike → MapLike → GenMapLike → Sorted
  90. def keys: Iterable[K]

    A container of keys, in key order

    A container of keys, in key order

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  91. def keysIterator: Iterator[K]

    Iterator over keys, in key order

    Iterator over keys, in key order

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  92. def keysIteratorFrom(k: K): Iterator[K]

    Definition Classes
    OrderedMapLike
  93. def last: (K, V)

    Definition Classes
    TraversableLike → GenTraversableLike
  94. def lastKey: K

    Definition Classes
    SortedMapLike → Sorted
  95. def lastOption: Option[(K, V)]

    Definition Classes
    TraversableLike → GenTraversableLike
  96. def lift: (K) ⇒ Option[V]

    Definition Classes
    PartialFunction
  97. def map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[PrefixSumMap[K, V, P], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  98. def mapValues[C](f: (V) ⇒ C): SortedMap[K, C]

    Definition Classes
    SortedMapLike → MapLike → GenMapLike
  99. def max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)

    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)

    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)

    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)

    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  107. def newBuilder: Builder[(K, V), PrefixSumMap[K, V, P]]

    Attributes
    protected[this]
    Definition Classes
    OrderedMapLike → MapLike → TraversableLike → HasNewBuilder
  108. def nodes: Iterable[INodePS[K, V, P]]

    A container of underlying nodes, in key order

    A container of underlying nodes, in key order

    Definition Classes
    OrderedLike
  109. def nodesFrom(k: K): Iterable[INodePS[K, V, P]]

    A container of nodes, in key order, having key >= k

    A container of nodes, in key order, having key >= k

    Definition Classes
    OrderedLike
  110. def nodesIterator: Iterator[INodePS[K, V, P]]

    Iterator over nodes, in key order

    Iterator over nodes, in key order

    Definition Classes
    OrderedLike
  111. def nodesIteratorFrom(k: K): Iterator[INodePS[K, V, P]]

    Iterator over nodes, in key order, having key >= k

    Iterator over nodes, in key order, having key >= k

    Definition Classes
    OrderedLike
  112. def nodesIteratorRange(from: Option[K], until: Option[K]): Iterator[INodePS[K, V, P]]

    Definition Classes
    OrderedLike
  113. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. final def notify(): Unit

    Definition Classes
    AnyRef
  115. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  116. def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Definition Classes
    PartialFunction
  117. def ordering: Ordering[K]

    Definition Classes
    OrderedMapLike → SortedMapLike → Sorted
  118. def par: ParMap[K, V]

    Definition Classes
    Parallelizable
  119. def parCombiner: Combiner[(K, V), ParMap[K, V]]

    Attributes
    protected[this]
    Definition Classes
    MapLike → TraversableLike → Parallelizable
  120. def partition(p: ((K, V)) ⇒ Boolean): (PrefixSumMap[K, V, P], PrefixSumMap[K, V, P])

    Definition Classes
    TraversableLike → GenTraversableLike
  121. final def prefixSum(k: K, open: Boolean = false): P

    Obtain the prefix (cumulative) sum of values <= a given key 'k'.

    Obtain the prefix (cumulative) sum of values <= a given key 'k'. If 'open' is true, sums the open interval for keys strictly < k. If 'k' is not present in the map, then the sum for keys < k is returned.

    Definition Classes
    NodePS
  122. def prefixSums(open: Boolean = false): Iterable[P]

    A container of all prefix sums over the stored values.

    A container of all prefix sums over the stored values. If 'open' is true, the sums will be for strictly < each key.

    Definition Classes
    PrefixSumMapLike
  123. def prefixSumsIterator(open: Boolean = false): Iterator[P]

    Iterate over prefix sums for stored values.

    Iterate over prefix sums for stored values. If 'open' is true, the sums will be for strictly < each key.

    Definition Classes
    PrefixSumMapLike
  124. def product[B >: (K, V)](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. final def rNode(d: Data[K], lsub: Node[K], rsub: Node[K]): INode[K]

    create a new Red node from a key, value, left subtree and right subtree

    create a new Red node from a key, value, left subtree and right subtree

    Attributes
    protected
    Definition Classes
    Node
  126. def range(from: K, until: K): PrefixSumMap[K, V, P]

    Definition Classes
    Sorted
  127. def rangeImpl(from: Option[K], until: Option[K]): PrefixSumMap[K, V, P]

    Definition Classes
    OrderedMapLike → SortedMapLike → Sorted
  128. final def redden(node: Node[K]): Node[K]

    Attributes
    protected
    Definition Classes
    Node
  129. def reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B

    Definition Classes
    TraversableOnce
  131. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  134. def reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def repr: PrefixSumMap[K, V, P]

    Definition Classes
    TraversableLike → GenTraversableLike
  136. def reversed: List[(K, V)]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  137. def runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean

    Definition Classes
    PartialFunction
  138. def sameElements[B >: (K, V)](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike
  139. def scan[B >: (K, V), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[PrefixSumMap[K, V, P], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  140. def scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[PrefixSumMap[K, V, P], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  141. def scanRight[B, That](z: B)(op: ((K, V), B) ⇒ B)(implicit bf: CanBuildFrom[PrefixSumMap[K, V, P], 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.

  142. def seq: PrefixSumMap[K, V, P]

    Definition Classes
    OrderedMapLike → GenMapLike → Parallelizable → TraversableOnce → GenTraversableOnce
  143. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def slice(from: Int, until: Int): PrefixSumMap[K, V, P]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  145. def sliding(size: Int, step: Int): Iterator[PrefixSumMap[K, V, P]]

    Definition Classes
    IterableLike
  146. def sliding(size: Int): Iterator[PrefixSumMap[K, V, P]]

    Definition Classes
    IterableLike
  147. def span(p: ((K, V)) ⇒ Boolean): (PrefixSumMap[K, V, P], PrefixSumMap[K, V, P])

    Definition Classes
    TraversableLike → GenTraversableLike
  148. def splitAt(n: Int): (PrefixSumMap[K, V, P], PrefixSumMap[K, V, P])

    Definition Classes
    TraversableLike → GenTraversableLike
  149. def stringPrefix: String

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  150. def sum: P

    equivalent to prefixSum of the right-most key

    equivalent to prefixSum of the right-most key

    Definition Classes
    PrefixSumMapLike
  151. def sum[B >: (K, V)](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  153. def tail: PrefixSumMap[K, V, P]

    Definition Classes
    TraversableLike → GenTraversableLike
  154. def tails: Iterator[PrefixSumMap[K, V, P]]

    Definition Classes
    TraversableLike
  155. def take(n: Int): PrefixSumMap[K, V, P]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  156. def takeRight(n: Int): PrefixSumMap[K, V, P]

    Definition Classes
    IterableLike
  157. def takeWhile(p: ((K, V)) ⇒ Boolean): PrefixSumMap[K, V, P]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  158. def thisCollection: Iterable[(K, V)]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  159. def to(to: K): PrefixSumMap[K, V, P]

    Definition Classes
    Sorted
  160. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  161. def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  162. def toBuffer[C >: (K, V)]: Buffer[C]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  163. def toCollection(repr: PrefixSumMap[K, V, P]): Iterable[(K, V)]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  164. def toIndexedSeq: IndexedSeq[(K, V)]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  165. def toIterable: Iterable[(K, V)]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  166. def toIterator: Iterator[(K, V)]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  167. def toList: List[(K, V)]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  168. def toMap[T, U](implicit ev: <:<[(K, V), (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. def toSeq: Seq[(K, V)]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  170. def toSet[B >: (K, V)]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  171. def toStream: Stream[(K, V)]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  172. def toString(): String

    Definition Classes
    PrefixSumMap → MapLike → Function1 → TraversableLike → AnyRef → Any
  173. def toTraversable: Traversable[(K, V)]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  174. def toVector: Vector[(K, V)]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. def transpose[B](implicit asTraversable: ((K, V)) ⇒ 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.

  176. def until(until: K): PrefixSumMap[K, V, P]

    Definition Classes
    Sorted
  177. def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Definition Classes
    GenericTraversableTemplate
  178. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Definition Classes
    GenericTraversableTemplate
  179. def updated[B1 >: V](key: K, value: B1): SortedMap[K, B1]

    Definition Classes
    SortedMapLike → MapLike
  180. def values: Iterable[V]

    Container of values, in key order

    Container of values, in key order

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  181. def valuesIterator: Iterator[V]

    Iterator over values, in key order

    Iterator over values, in key order

    Definition Classes
    OrderedMapLike → MapLike → GenMapLike
  182. def valuesIteratorFrom(k: K): Iterator[V]

    Definition Classes
    OrderedMapLike
  183. def view(from: Int, until: Int): IterableView[(K, V), PrefixSumMap[K, V, P]]

    Definition Classes
    IterableLike → TraversableLike
  184. def view: IterableView[(K, V), PrefixSumMap[K, V, P]]

    Definition Classes
    IterableLike → TraversableLike
  185. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  186. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  187. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  188. def withFilter(p: ((K, V)) ⇒ Boolean): FilterMonadic[(K, V), PrefixSumMap[K, V, P]]

    Definition Classes
    TraversableLike → FilterMonadic
  189. def zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[PrefixSumMap[K, V, P], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  190. def zipAll[B, A1 >: (K, V), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[PrefixSumMap[K, V, P], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  191. def zipWithIndex[A1 >: (K, V), That](implicit bf: CanBuildFrom[PrefixSumMap[K, V, P], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

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

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

Inherited from PrefixSumMapLike[K, V, P, INodePS[K, V, P], PrefixSumMap[K, V, P]]

Inherited from OrderedMapLike[K, V, INodePS[K, V, P], PrefixSumMap[K, V, P]]

Inherited from OrderedLike[K, INodePS[K, V, P], PrefixSumMap[K, V, P]]

Inherited from NodePS[K, V, P]

Inherited from NodeMap[K, V]

Inherited from Node[K]

Inherited from Serializable

Inherited from Serializable

Inherited from SortedMap[K, V]

Inherited from SortedMapLike[K, V, PrefixSumMap[K, V, P]]

Inherited from Sorted[K, PrefixSumMap[K, V, P]]

Inherited from Map[K, V]

Inherited from MapLike[K, V, PrefixSumMap[K, V, P]]

Inherited from Subtractable[K, PrefixSumMap[K, V, P]]

Inherited from PartialFunction[K, V]

Inherited from (K) ⇒ V

Inherited from GenMap[K, V]

Inherited from GenMapLike[K, V, PrefixSumMap[K, V, P]]

Inherited from Iterable[(K, V)]

Inherited from IterableLike[(K, V), PrefixSumMap[K, V, P]]

Inherited from Equals

Inherited from GenIterable[(K, V)]

Inherited from GenIterableLike[(K, V), PrefixSumMap[K, V, P]]

Inherited from Traversable[(K, V)]

Inherited from GenTraversable[(K, V)]

Inherited from GenericTraversableTemplate[(K, V), Iterable]

Inherited from TraversableLike[(K, V), PrefixSumMap[K, V, P]]

Inherited from GenTraversableLike[(K, V), PrefixSumMap[K, V, P]]

Inherited from Parallelizable[(K, V), ParMap[K, V]]

Inherited from TraversableOnce[(K, V)]

Inherited from GenTraversableOnce[(K, V)]

Inherited from FilterMonadic[(K, V), PrefixSumMap[K, V, P]]

Inherited from HasNewBuilder[(K, V), PrefixSumMap[K, V, P]]

Inherited from AnyRef

Inherited from Any

Ungrouped