Packages

c

scalation.util

BpTreeMap

class BpTreeMap[K, V] extends AbstractMap[K, V] with Map[K, V] with MapLike[K, V, BpTreeMap[K, V]] with Serializable

The BpTreeMap class provides B+Tree maps. B+Trees are used as multi-level index structures that provide efficient access for both point queries and range queries.

See also

www.scala-lang.org/api/current/#scala.collection.mutable.MapLike ------------------------------------------------------------------------------

docs.scala-lang.org/overviews/collections/concrete-mutable-collection-classes.html

Linear Supertypes
Serializable, Serializable, AbstractMap[K, V], Map[K, V], MapLike[K, V, BpTreeMap[K, V]], Cloneable[BpTreeMap[K, V]], Cloneable, Cloneable, Shrinkable[K], Builder[(K, V), BpTreeMap[K, V]], Growable[(K, V)], Clearable, Iterable[(K, V)], Traversable[(K, V)], Mutable, AbstractMap[K, V], Map[K, V], MapLike[K, V, BpTreeMap[K, V]], Subtractable[K, BpTreeMap[K, V]], PartialFunction[K, V], (K) ⇒ V, GenMap[K, V], GenMapLike[K, V, BpTreeMap[K, V]], AbstractIterable[(K, V)], Iterable[(K, V)], IterableLike[(K, V), BpTreeMap[K, V]], Equals, GenIterable[(K, V)], GenIterableLike[(K, V), BpTreeMap[K, V]], AbstractTraversable[(K, V)], Traversable[(K, V)], GenTraversable[(K, V)], GenericTraversableTemplate[(K, V), Iterable], TraversableLike[(K, V), BpTreeMap[K, V]], GenTraversableLike[(K, V), BpTreeMap[K, V]], Parallelizable[(K, V), ParMap[K, V]], TraversableOnce[(K, V)], GenTraversableOnce[(K, V)], FilterMonadic[(K, V), BpTreeMap[K, V]], HasNewBuilder[(K, V), BpTreeMap[K, V]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BpTreeMap
  2. Serializable
  3. Serializable
  4. AbstractMap
  5. Map
  6. MapLike
  7. Cloneable
  8. Cloneable
  9. Cloneable
  10. Shrinkable
  11. Builder
  12. Growable
  13. Clearable
  14. Iterable
  15. Traversable
  16. Mutable
  17. AbstractMap
  18. Map
  19. MapLike
  20. Subtractable
  21. PartialFunction
  22. Function1
  23. GenMap
  24. GenMapLike
  25. AbstractIterable
  26. Iterable
  27. IterableLike
  28. Equals
  29. GenIterable
  30. GenIterableLike
  31. AbstractTraversable
  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

Instance Constructors

  1. new BpTreeMap(half: Int = 2)(implicit arg0: (K) ⇒ Ordered[K], arg1: ClassTag[K], arg2: ClassTag[V])

    half

    the number of keys per node range from 'half' to '2 * half'

Type Members

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +[V1 >: V](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): Map[K, V1]
    Definition Classes
    MapLike → MapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new map. Use += to add an element to this map and return that map itself.

  4. def +[V1 >: V](kv: (K, V1)): Map[K, V1]
    Definition Classes
    MapLike → MapLike → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new map. Use += to add an element to this map and return that map itself.

  5. def ++[V1 >: V](xs: GenTraversableOnce[(K, V1)]): Map[K, V1]
    Definition Classes
    MapLike → MapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new map. Use ++= to add an element to this map and return that map itself.

  6. def ++[B >: (K, V), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  7. def ++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  8. def ++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  9. def ++=(xs: TraversableOnce[(K, V)]): BpTreeMap.this.type
    Definition Classes
    Growable
  10. def +=(kv: (K, V)): BpTreeMap.this.type

    Put the key-value pair 'kv' in 'this' B+Tree map, returning a reference to the updated tree.

    Put the key-value pair 'kv' in 'this' B+Tree map, returning a reference to the updated tree.

    kv

    the key-value pair to insert

    Definition Classes
    BpTreeMap → MapLike → Builder → Growable
  11. def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): BpTreeMap.this.type
    Definition Classes
    Growable
  12. def -(elem1: K, elem2: K, elems: K*): BpTreeMap[K, V]
    Definition Classes
    MapLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new map. Use -= to remove an element from this map and return that map itself.

  13. def -(key: K): BpTreeMap[K, V]
    Definition Classes
    MapLike → MapLike → Subtractable → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new map. Use -= to remove an element from this map and return that map itself.

  14. def --(xs: GenTraversableOnce[K]): BpTreeMap[K, V]
    Definition Classes
    MapLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new map. Use --= to remove an element from this map and return that map itself.

  15. def --=(xs: TraversableOnce[K]): BpTreeMap.this.type
    Definition Classes
    Shrinkable
  16. def -=(key: K): BpTreeMap.this.type

    Remove the key-value pair with key 'key' from 'this' B+Tree map, returning a reference to the updated tree.

    Remove the key-value pair with key 'key' from 'this' B+Tree map, returning a reference to the updated tree.

    key

    the key to remove

    Definition Classes
    BpTreeMap → MapLike → Shrinkable
  17. def -=(elem1: K, elem2: K, elems: K*): BpTreeMap.this.type
    Definition Classes
    Shrinkable
  18. def /:[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  19. def :\[B](z: B)(op: ((K, V), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  21. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    MapLike → TraversableOnce
  22. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  23. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  24. def aggregate[B](z: ⇒ B)(seqop: (B, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def andThen[C](k: (V) ⇒ C): PartialFunction[K, C]
    Definition Classes
    PartialFunction → Function1
  26. def apply(key: K): V
    Definition Classes
    MapLike → GenMapLike → Function1
  27. def applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) ⇒ V1): V1
    Definition Classes
    MapLike → PartialFunction
  28. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  29. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  30. def clear(): Unit
    Definition Classes
    MapLike → Builder → Growable → Clearable
  31. def clone(): BpTreeMap[K, V]
    Definition Classes
    MapLike → Cloneable → AnyRef
  32. def collect[B, That](pf: PartialFunction[(K, V), B])(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  33. def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]
    Definition Classes
    TraversableOnce
  34. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  35. def compare(key1: K, key2: K): Int

    Compare two keys.

    Compare two keys.

    key1

    the first key

    key2

    the second key

  36. def compose[A](g: (A) ⇒ K): (A) ⇒ V
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  37. def contains(key: K): Boolean
    Definition Classes
    MapLike → GenMapLike
  38. def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  39. def copyToArray[B >: (K, V)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  40. def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  41. def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  42. def count: Int

    Return the total number of nodes accessed.

  43. def count(p: ((K, V)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def default(key: K): V
    Definition Classes
    MapLike → GenMapLike
  45. def drop(n: Int): BpTreeMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  46. def dropRight(n: Int): BpTreeMap[K, V]
    Definition Classes
    IterableLike
  47. def dropWhile(p: ((K, V)) ⇒ Boolean): BpTreeMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def empty: BpTreeMap[K, V]

    Return an empty B+Tree map.

    Return an empty B+Tree map.

    Definition Classes
    BpTreeMap → Map → Map → MapLike
  49. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  50. def equals(that: Any): Boolean
    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  51. def exists(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  52. def filter(p: ((K, V)) ⇒ Boolean): BpTreeMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  53. def filterKeys(p: (K) ⇒ Boolean): Map[K, V]
    Definition Classes
    MapLike → GenMapLike
  54. def filterNot(p: ((K, V)) ⇒ Boolean): BpTreeMap[K, V]
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  55. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  56. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def flatMap[B, That](f: ((K, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  58. def flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  59. def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  62. def forall(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  63. def foreach[U](f: ((K, V)) ⇒ U): Unit

    Apply function 'f' to each key-value pair in 'this' B+Tree map.

    Apply function 'f' to each key-value pair in 'this' B+Tree map.

    f

    the function to be applied

    Definition Classes
    BpTreeMap → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  64. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  65. def get(key: K): Option[V]

    Optionally return the value in 'this' B+Tree map associated with the key 'key'.

    Optionally return the value in 'this' B+Tree map associated with the key 'key'. Use 'apply' method to remove optional.

    key

    the key used for look up

    Definition Classes
    BpTreeMap → MapLike → GenMapLike
  66. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  67. def getOrElse[V1 >: V](key: K, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  68. def getOrElseUpdate(key: K, op: ⇒ V): V
    Definition Classes
    MapLike
  69. def groupBy[K](f: ((K, V)) ⇒ K): Map[K, BpTreeMap[K, V]]
    Definition Classes
    TraversableLike → GenTraversableLike
  70. def grouped(size: Int): Iterator[BpTreeMap[K, V]]
    Definition Classes
    IterableLike
  71. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  72. def hashCode(): Int
    Definition Classes
    GenMapLike → AnyRef → Any
  73. def head: (K, V)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  74. def headOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def init: BpTreeMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  76. def inits: Iterator[BpTreeMap[K, V]]
    Definition Classes
    TraversableLike
  77. def isDefinedAt(key: K): Boolean
    Definition Classes
    MapLike → GenMapLike → PartialFunction
  78. def isEmpty: Boolean
    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  79. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  80. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  81. def iterator: Iterator[(K, V)]

    Create an iterator over the key-value pairs in 'this' B+Tree map.

    Create an iterator over the key-value pairs in 'this' B+Tree map. The iteration proceeds over the leaf level of the tree.

    Definition Classes
    BpTreeMap → MapLike → IterableLike → GenIterableLike
  82. def keySet: Set[K]
    Definition Classes
    MapLike → GenMapLike
  83. def keys: Iterable[K]
    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) keys returns Iterable[K] rather than Iterator[K].

  84. def keysIterator: Iterator[K]
    Definition Classes
    MapLike → GenMapLike
  85. def last: (K, V)
    Definition Classes
    TraversableLike → GenTraversableLike
  86. def lastOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  87. def lift: (K) ⇒ Option[V]
    Definition Classes
    PartialFunction
  88. def map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  89. def mapResult[NewTo](f: (BpTreeMap[K, V]) ⇒ NewTo): Builder[(K, V), NewTo]
    Definition Classes
    Builder
  90. def mapValues[W](f: (V) ⇒ W): Map[K, W]
    Definition Classes
    MapLike → GenMapLike
  91. def max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  99. def newBuilder: Builder[(K, V), BpTreeMap[K, V]]
    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → HasNewBuilder
  100. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. final def notify(): Unit
    Definition Classes
    AnyRef
  102. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  103. def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  104. def par: ParMap[K, V]
    Definition Classes
    Parallelizable
  105. def parCombiner: Combiner[(K, V), ParMap[K, V]]
    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → Parallelizable
  106. def partition(p: ((K, V)) ⇒ Boolean): (BpTreeMap[K, V], BpTreeMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  107. def printTree(): Unit

    Print the keys in 'this' B+Tree map.

  108. def product[B >: (K, V)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def put(key: K, value: V): Option[V]
    Definition Classes
    MapLike
  110. def reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce
  112. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  115. def reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def remove(key: K): Option[V]
    Definition Classes
    MapLike
  117. def repr: BpTreeMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  118. def result(): BpTreeMap[K, V]
    Definition Classes
    MapLike → Builder
  119. def retain(p: (K, V) ⇒ Boolean): BpTreeMap.this.type
    Definition Classes
    MapLike
  120. def reversed: List[(K, V)]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  121. def runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean
    Definition Classes
    PartialFunction
  122. def sameElements[B >: (K, V)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  123. def scan[B >: (K, V), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  124. def scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  125. def scanRight[B, That](z: B)(op: ((K, V), B) ⇒ B)(implicit bf: CanBuildFrom[BpTreeMap[K, V], 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.

  126. def seq: Map[K, V]
    Definition Classes
    Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  127. def size: Int

    Return the size of 'this' B+Tree map.

    Return the size of 'this' B+Tree map.

    Definition Classes
    BpTreeMap → GenTraversableLike → TraversableOnce → GenTraversableOnce
  128. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  129. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  130. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  131. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  132. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  133. def slice(from: Int, until: Int): BpTreeMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  134. def sliding(size: Int, step: Int): Iterator[BpTreeMap[K, V]]
    Definition Classes
    IterableLike
  135. def sliding(size: Int): Iterator[BpTreeMap[K, V]]
    Definition Classes
    IterableLike
  136. def span(p: ((K, V)) ⇒ Boolean): (BpTreeMap[K, V], BpTreeMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  137. def splitAt(n: Int): (BpTreeMap[K, V], BpTreeMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  138. def stringPrefix: String
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  139. def sum[B >: (K, V)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  141. def tail: BpTreeMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  142. def tails: Iterator[BpTreeMap[K, V]]
    Definition Classes
    TraversableLike
  143. def take(n: Int): BpTreeMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  144. def takeRight(n: Int): BpTreeMap[K, V]
    Definition Classes
    IterableLike
  145. def takeWhile(p: ((K, V)) ⇒ Boolean): BpTreeMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  146. def thisCollection: Iterable[(K, V)]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  147. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  148. def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. def toBuffer[E >: (K, V)]: Buffer[E]
    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  150. def toCollection(repr: BpTreeMap[K, V]): Iterable[(K, V)]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  151. def toIndexedSeq: IndexedSeq[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. def toIterable: Iterable[(K, V)]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  153. def toIterator: Iterator[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  154. def toList: List[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  155. def toMap[T, U](implicit ev: <:<[(K, V), (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. def toSeq: Seq[(K, V)]
    Definition Classes
    MapLike → MapLike → TraversableOnce → GenTraversableOnce
  157. def toSet[B >: (K, V)]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  158. def toStream: Stream[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  159. def toString(): String
    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any
  160. def toTraversable: Traversable[(K, V)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  161. def toVector: Vector[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  162. def transform(f: (K, V) ⇒ V): BpTreeMap.this.type
    Definition Classes
    MapLike
  163. 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.

  164. def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  165. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  166. def update(key: K, value: V): Unit
    Definition Classes
    MapLike
  167. def updated[V1 >: V](key: K, value: V1): Map[K, V1]
    Definition Classes
    MapLike → MapLike
  168. def values: Iterable[V]
    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) values returns Iterable[V] rather than Iterator[V].

  169. def valuesIterator: Iterator[V]
    Definition Classes
    MapLike → GenMapLike
  170. def view(from: Int, until: Int): IterableView[(K, V), BpTreeMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  171. def view: IterableView[(K, V), BpTreeMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  172. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  173. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  174. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  175. def withDefault(d: (K) ⇒ V): Map[K, V]
    Definition Classes
    Map
  176. def withDefaultValue(d: V): Map[K, V]
    Definition Classes
    Map
  177. def withFilter(p: ((K, V)) ⇒ Boolean): FilterMonadic[(K, V), BpTreeMap[K, V]]
    Definition Classes
    TraversableLike → FilterMonadic
  178. def zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[BpTreeMap[K, V], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  179. def zipAll[B, A1 >: (K, V), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[BpTreeMap[K, V], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  180. def zipWithIndex[A1 >: (K, V), That](implicit bf: CanBuildFrom[BpTreeMap[K, V], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Inherited from Serializable

Inherited from Serializable

Inherited from AbstractMap[K, V]

Inherited from Map[K, V]

Inherited from MapLike[K, V, BpTreeMap[K, V]]

Inherited from Cloneable[BpTreeMap[K, V]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[K]

Inherited from Builder[(K, V), BpTreeMap[K, V]]

Inherited from Growable[(K, V)]

Inherited from Clearable

Inherited from Iterable[(K, V)]

Inherited from Traversable[(K, V)]

Inherited from Mutable

Inherited from AbstractMap[K, V]

Inherited from Map[K, V]

Inherited from MapLike[K, V, BpTreeMap[K, V]]

Inherited from Subtractable[K, BpTreeMap[K, V]]

Inherited from PartialFunction[K, V]

Inherited from (K) ⇒ V

Inherited from GenMap[K, V]

Inherited from GenMapLike[K, V, BpTreeMap[K, V]]

Inherited from AbstractIterable[(K, V)]

Inherited from Iterable[(K, V)]

Inherited from IterableLike[(K, V), BpTreeMap[K, V]]

Inherited from Equals

Inherited from GenIterable[(K, V)]

Inherited from GenIterableLike[(K, V), BpTreeMap[K, V]]

Inherited from AbstractTraversable[(K, V)]

Inherited from Traversable[(K, V)]

Inherited from GenTraversable[(K, V)]

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

Inherited from TraversableLike[(K, V), BpTreeMap[K, V]]

Inherited from GenTraversableLike[(K, V), BpTreeMap[K, V]]

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

Inherited from TraversableOnce[(K, V)]

Inherited from GenTraversableOnce[(K, V)]

Inherited from FilterMonadic[(K, V), BpTreeMap[K, V]]

Inherited from HasNewBuilder[(K, V), BpTreeMap[K, V]]

Inherited from AnyRef

Inherited from Any

Ungrouped