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 WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

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

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

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

  4. def ++[B >: (K, V), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  7. def ++=(xs: TraversableOnce[(K, V)]): BpTreeMap.this.type
    Definition Classes
    Growable
  8. 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
  9. def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): BpTreeMap.this.type
    Definition Classes
    Growable
  10. 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.

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

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

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

    Compare two keys.

    Compare two keys.

    key1

    the first key

    key2

    the second key

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

    Return the total number of nodes accessed.

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

    Return an empty B+Tree map.

    Return an empty B+Tree map.

    Definition Classes
    BpTreeMap → Map → Map → MapLike
  45. def equals(that: Any): Boolean
    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  46. def exists(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  47. def filter(p: ((K, V)) ⇒ Boolean): BpTreeMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def filterKeys(p: (K) ⇒ Boolean): Map[K, V]
    Definition Classes
    MapLike → GenMapLike
  49. def filterNot(p: ((K, V)) ⇒ Boolean): BpTreeMap[K, V]
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  50. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  51. def flatMap[B, That](f: ((K, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  52. def flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  53. def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  56. def forall(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. 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
  58. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  59. 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
  60. def getOrElse[V1 >: V](key: K, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  61. def getOrElseUpdate(key: K, op: ⇒ V): V
    Definition Classes
    MapLike
  62. def groupBy[K](f: ((K, V)) ⇒ K): Map[K, BpTreeMap[K, V]]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def grouped(size: Int): Iterator[BpTreeMap[K, V]]
    Definition Classes
    IterableLike
  64. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  65. def hashCode(): Int
    Definition Classes
    GenMapLike → AnyRef → Any
  66. def head: (K, V)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  67. def headOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  68. def init: BpTreeMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def inits: Iterator[BpTreeMap[K, V]]
    Definition Classes
    TraversableLike
  70. def isDefinedAt(key: K): Boolean
    Definition Classes
    MapLike → GenMapLike → PartialFunction
  71. def isEmpty: Boolean
    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  72. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  73. 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
  74. def keySet: Set[K]
    Definition Classes
    MapLike → GenMapLike
  75. 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].

  76. def keysIterator: Iterator[K]
    Definition Classes
    MapLike → GenMapLike
  77. def last: (K, V)
    Definition Classes
    TraversableLike → GenTraversableLike
  78. def lastOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  79. def lift: (K) ⇒ Option[V]
    Definition Classes
    PartialFunction
  80. def map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  81. def mapResult[NewTo](f: (BpTreeMap[K, V]) ⇒ NewTo): Builder[(K, V), NewTo]
    Definition Classes
    Builder
  82. def mapValues[W](f: (V) ⇒ W): Map[K, W]
    Definition Classes
    MapLike → GenMapLike
  83. def max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  92. def par: ParMap[K, V]
    Definition Classes
    Parallelizable
  93. def partition(p: ((K, V)) ⇒ Boolean): (BpTreeMap[K, V], BpTreeMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def printTree(): Unit

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

  95. def product[B >: (K, V)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def put(key: K, value: V): Option[V]
    Definition Classes
    MapLike
  97. def reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce
  99. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  102. def reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def remove(key: K): Option[V]
    Definition Classes
    MapLike
  104. def repr: BpTreeMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def result(): BpTreeMap[K, V]
    Definition Classes
    MapLike → Builder
  106. def retain(p: (K, V) ⇒ Boolean): BpTreeMap.this.type
    Definition Classes
    MapLike
  107. def runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean
    Definition Classes
    PartialFunction
  108. def sameElements[B >: (K, V)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  109. 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
  110. def scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[BpTreeMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  111. 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.

  112. def seq: Map[K, V]
    Definition Classes
    Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  113. 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
  114. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  115. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  116. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  117. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  118. def slice(from: Int, until: Int): BpTreeMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  119. def sliding(size: Int, step: Int): Iterator[BpTreeMap[K, V]]
    Definition Classes
    IterableLike
  120. def sliding(size: Int): Iterator[BpTreeMap[K, V]]
    Definition Classes
    IterableLike
  121. def span(p: ((K, V)) ⇒ Boolean): (BpTreeMap[K, V], BpTreeMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def splitAt(n: Int): (BpTreeMap[K, V], BpTreeMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  123. def stringPrefix: String
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  124. def sum[B >: (K, V)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def tail: BpTreeMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def tails: Iterator[BpTreeMap[K, V]]
    Definition Classes
    TraversableLike
  127. def take(n: Int): BpTreeMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  128. def takeRight(n: Int): BpTreeMap[K, V]
    Definition Classes
    IterableLike
  129. def takeWhile(p: ((K, V)) ⇒ Boolean): BpTreeMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  130. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  131. def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def toBuffer[E >: (K, V)]: Buffer[E]
    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  133. def toIndexedSeq: IndexedSeq[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def toIterable: Iterable[(K, V)]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  135. def toIterator: Iterator[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  136. def toList: List[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def toMap[T, U](implicit ev: <:<[(K, V), (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toSeq: Seq[(K, V)]
    Definition Classes
    MapLike → MapLike → TraversableOnce → GenTraversableOnce
  139. def toSet[B >: (K, V)]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def toStream: Stream[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  141. def toString(): String
    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any
  142. def toTraversable: Traversable[(K, V)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  143. def toVector: Vector[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def transform(f: (K, V) ⇒ V): BpTreeMap.this.type
    Definition Classes
    MapLike
  145. 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.

  146. def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  147. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  148. def update(key: K, value: V): Unit
    Definition Classes
    MapLike
  149. def updated[V1 >: V](key: K, value: V1): Map[K, V1]
    Definition Classes
    MapLike → MapLike
  150. 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].

  151. def valuesIterator: Iterator[V]
    Definition Classes
    MapLike → GenMapLike
  152. def view(from: Int, until: Int): IterableView[(K, V), BpTreeMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  153. def view: IterableView[(K, V), BpTreeMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  154. def withDefault(d: (K) ⇒ V): Map[K, V]
    Definition Classes
    Map
  155. def withDefaultValue(d: V): Map[K, V]
    Definition Classes
    Map
  156. def withFilter(p: ((K, V)) ⇒ Boolean): FilterMonadic[(K, V), BpTreeMap[K, V]]
    Definition Classes
    TraversableLike → FilterMonadic
  157. def zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[BpTreeMap[K, V], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  158. 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
  159. def zipWithIndex[A1 >: (K, V), That](implicit bf: CanBuildFrom[BpTreeMap[K, V], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike