class BpTreeMap[K, V] extends AbstractMap[K, V] with SortedMap[K, V] with DefaultSerializable
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
docs.scala-lang.org/overviews/collections/concrete-mutable-collection-classes.html
www.scala-lang.org/api/current/#scala.collection.mutable.MapLike ------------------------------------------------------------------------------
- Alphabetic
- By Inheritance
- BpTreeMap
- DefaultSerializable
- Serializable
- SortedMap
- SortedMapOps
- SortedMap
- SortedMapFactoryDefaults
- SortedMapOps
- SortedOps
- AbstractMap
- Map
- MapOps
- Shrinkable
- Builder
- Growable
- Clearable
- Cloneable
- Cloneable
- Iterable
- AbstractMap
- Map
- Equals
- MapFactoryDefaults
- MapOps
- PartialFunction
- Function1
- AbstractIterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new BpTreeMap(half: Int = 2)(implicit arg0: ClassTag[K], ord: Ordering[K])
- half
the number of keys per node range from 'half' to '2 * half'
Type Members
- trait GenKeySet extends AnyRef
- Attributes
- protected
- Definition Classes
- MapOps
- trait GenKeySortedSet extends scala.collection.SortedMapOps.GenKeySet
- Attributes
- protected
- Definition Classes
- SortedMapOps
- class KeySet extends AbstractSet[K] with GenKeySet with DefaultSerializable
- Attributes
- protected
- Definition Classes
- MapOps
- class KeySortedSet extends SortedSet[K] with scala.collection.SortedMapOps.GenKeySet with GenKeySortedSet
- Attributes
- protected
- Definition Classes
- SortedMapOps
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ++[V2 >: V](xs: IterableOnce[(K, V2)]): SortedMap[K, V2]
- Definition Classes
- SortedMapOps → MapOps
- Annotations
- @inline()
- final def ++[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def ++=(xs: IterableOnce[(K, V)]): BpTreeMap.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def +=(elem: (K, V)): BpTreeMap.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def --=(xs: IterableOnce[K]): BpTreeMap.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- final def -=(elem: K): BpTreeMap.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def addAll(xs: IterableOnce[(K, V)]): BpTreeMap.this.type
- Definition Classes
- Growable
- def addOne(elem: (K, V)): BpTreeMap.this.type
- Definition Classes
- BpTreeMap → Growable
- def addString(sb: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- MapOps → IterableOnceOps
- final def addString(b: StringBuilder): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def andThen[C](k: PartialFunction[V, C]): PartialFunction[K, C]
- Definition Classes
- PartialFunction
- def andThen[C](k: (V) => C): PartialFunction[K, C]
- Definition Classes
- PartialFunction → Function1
- def apply(key: K): V
- Definition Classes
- MapOps → Function1
- Annotations
- @throws(scala.this.throws.<init>$default$1[NoSuchElementException])
- def applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) => V1): V1
- Definition Classes
- MapOps → PartialFunction
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def canEqual(that: Any): Boolean
- Definition Classes
- Map → Equals
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clear(): Unit
- Definition Classes
- MapOps → Builder → Clearable
- def clone(): SortedMap[K, V]
- Definition Classes
- MapOps → Cloneable → AnyRef
- final def coll: BpTreeMap.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)])(implicit ordering: Ordering[K2]): SortedMap[K2, V2]
- Definition Classes
- SortedMapOps
- def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)]): Map[K2, V2]
- Definition Classes
- MapOps
- def collect[B](pf: PartialFunction[(K, V), B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]
- Definition Classes
- IterableOnceOps
- def compose[R](k: PartialFunction[R, K]): PartialFunction[R, V]
- Definition Classes
- PartialFunction
- def compose[A](g: (A) => K): (A) => V
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def concat[V2 >: V](suffix: IterableOnce[(K, V2)]): SortedMap[K, V2]
- Definition Classes
- SortedMapOps → MapOps
- def concat[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- def contains(key: K): Boolean
- Definition Classes
- MapOps
- def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: (K, V)](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: IterableOnce[B])(p: ((K, V), B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count: Int
Return the total number of nodes accessed.
- def count(p: ((K, V)) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def default(key: K): V
- Definition Classes
- MapOps
- Annotations
- @throws(scala.this.throws.<init>$default$1[NoSuchElementException])
- def drop(n: Int): SortedMap[K, V]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): SortedMap[K, V]
- Definition Classes
- IterableOps
- def dropWhile(p: ((K, V)) => Boolean): SortedMap[K, V]
- Definition Classes
- IterableOps → IterableOnceOps
- def elementWise: ElementWiseExtractor[K, V]
- Definition Classes
- PartialFunction
- def empty: BpTreeMap[K, V]
Return an empty B+Tree map.
Return an empty B+Tree map.
- Definition Classes
- BpTreeMap → SortedMapFactoryDefaults → MapFactoryDefaults → IterableFactoryDefaults → IterableOps
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- SortedMap → Map → Equals → AnyRef → Any
- def exists(p: ((K, V)) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: ((K, V)) => Boolean): SortedMap[K, V]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterInPlace(p: (K, V) => Boolean): BpTreeMap.this.type
- Definition Classes
- MapOps
- def filterNot(pred: ((K, V)) => Boolean): SortedMap[K, V]
- Definition Classes
- IterableOps → IterableOnceOps
- def find(p: ((K, V)) => Boolean): Option[(K, V)]
- Definition Classes
- IterableOnceOps
- def firstKey: K
- Definition Classes
- SortedMapOps → SortedOps
- def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)])(implicit ordering: Ordering[K2]): SortedMap[K2, V2]
- Definition Classes
- SortedMapOps
- def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)]): Map[K2, V2]
- Definition Classes
- MapOps
- def flatMap[B](f: ((K, V)) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: ((K, V)) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, (K, V)) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: ((K, V), B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: ((K, V)) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- 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 → IterableOnceOps
- def foreachEntry[U](f: (K, V) => U): Unit
- Definition Classes
- MapOps
- def fromSpecific(coll: IterableOnce[(K, V)]): SortedMap[K, V]
- Attributes
- protected
- Definition Classes
- SortedMapFactoryDefaults → IterableOps
- 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 → MapOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def getOrElse[V1 >: V](key: K, default: => V1): V1
- Definition Classes
- MapOps
- def getOrElseUpdate(key: K, op: => V): V
- Definition Classes
- MapOps
- def groupBy[K](f: ((K, V)) => K): Map[K, SortedMap[K, V]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: ((K, V)) => K)(f: ((K, V)) => B): Map[K, Iterable[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: ((K, V)) => K)(f: ((K, V)) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[SortedMap[K, V]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- Definition Classes
- Map → AnyRef → Any
- def head: (K, V)
- Definition Classes
- IterableOps
- def headOption: Option[(K, V)]
- Definition Classes
- IterableOps
- def init: SortedMap[K, V]
- Definition Classes
- IterableOps
- def inits: Iterator[SortedMap[K, V]]
- Definition Classes
- IterableOps
- def isDefinedAt(key: K): Boolean
- Definition Classes
- MapOps → PartialFunction
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: IterableFactory[Iterable]
- Definition Classes
- Iterable → Iterable → IterableOps
- 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 → IterableOnce
- def iteratorFrom(start: K): Iterator[(K, V)]
- Definition Classes
- BpTreeMap → SortedMapOps
- def keySet: SortedSet[K]
- Definition Classes
- SortedMapOps → MapOps
- def keyStepper[S <: Stepper[_]](implicit shape: StepperShape[K, S]): S
- Definition Classes
- MapOps
- def keys: Iterable[K]
- Definition Classes
- MapOps
- def keysIterator: Iterator[K]
- Definition Classes
- MapOps
- def keysIteratorFrom(start: K): Iterator[K]
- Definition Classes
- BpTreeMap → SortedMapOps
- def knownSize: Int
- Definition Classes
- MapOps → Growable → IterableOnce
- def last: (K, V)
- Definition Classes
- IterableOps
- def lastKey: K
- Definition Classes
- SortedMapOps → SortedOps
- def lastOption: Option[(K, V)]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[(K, V), B, BpTreeMap.this.type]
- Definition Classes
- Iterable
- def lift: (K) => Option[V]
- Definition Classes
- PartialFunction
- def map[K2, V2](f: ((K, V)) => (K2, V2))(implicit ordering: Ordering[K2]): SortedMap[K2, V2]
- Definition Classes
- SortedMapOps
- def map[K2, V2](f: ((K, V)) => (K2, V2)): Map[K2, V2]
- Definition Classes
- MapOps
- def map[B](f: ((K, V)) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def mapFactory: MapFactory[Map]
- Definition Classes
- Map → Map → MapOps
- final def mapFromIterable[K2, V2](it: Iterable[(K2, V2)]): Map[K2, V2]
- Attributes
- protected
- Definition Classes
- MapOps
- Annotations
- @inline()
- def mapResult[NewTo](f: (SortedMap[K, V]) => NewTo): Builder[(K, V), NewTo]
- Definition Classes
- Builder
- def mapValuesInPlace(f: (K, V) => V): BpTreeMap.this.type
- Definition Classes
- MapOps
- def max[B >: (K, V)](implicit ord: Ordering[B]): (K, V)
- Definition Classes
- IterableOnceOps
- def maxBefore(key: K): Option[(K, V)]
- Definition Classes
- SortedMapOps
- def maxBy[B](f: ((K, V)) => B)(implicit cmp: Ordering[B]): (K, V)
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: ((K, V)) => B)(implicit cmp: Ordering[B]): Option[(K, V)]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: (K, V)](implicit ord: Ordering[B]): Option[(K, V)]
- Definition Classes
- IterableOnceOps
- def min[B >: (K, V)](implicit ord: Ordering[B]): (K, V)
- Definition Classes
- IterableOnceOps
- def minAfter(key: K): Option[(K, V)]
- Definition Classes
- SortedMapOps
- def minBy[B](f: ((K, V)) => B)(implicit cmp: Ordering[B]): (K, V)
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: ((K, V)) => B)(implicit cmp: Ordering[B]): Option[(K, V)]
- Definition Classes
- IterableOnceOps
- def minOption[B >: (K, V)](implicit ord: Ordering[B]): Option[(K, V)]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[(K, V), SortedMap[K, V]]
- Attributes
- protected
- Definition Classes
- SortedMapFactoryDefaults → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
- implicit val ord: Ordering[K]
- def ordering: Ordering[K]
- Definition Classes
- BpTreeMap → SortedOps
- def partition(p: ((K, V)) => Boolean): (SortedMap[K, V], SortedMap[K, V])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: ((K, V)) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def printTree(): Unit
Print the keys in 'this' B+Tree map.
- def printTreetoFile(file: String): Unit
Print the keys in 'this' B+Tree map to file.
Print the keys in 'this' B+Tree map to file.
- file
the file to be used for output
- def product[B >: (K, V)](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def put(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
- def put(key: K, value: V): Option[V]
- Definition Classes
- MapOps
- def range(from: K, until: K): SortedMap[K, V]
- Definition Classes
- SortedOps
- def rangeFrom(from: K): SortedMap[K, V]
- Definition Classes
- SortedOps
- def rangeImpl(from: Option[K], until: Option[K]): SortedMap[K, V]
- Definition Classes
- BpTreeMap → SortedOps
- def rangeTo(to: K): SortedMap[K, V]
- Definition Classes
- SortedMapOps → SortedOps
- def rangeUntil(until: K): SortedMap[K, V]
- Definition Classes
- SortedOps
- def reduce[B >: (K, V)](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: (K, V)](op: (B, (K, V)) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: (K, V)](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: (K, V)](op: ((K, V), B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: (K, V)](op: ((K, V), B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def remove(key: K): Option[V]
- Definition Classes
- MapOps
- def result(): SortedMap[K, V]
- Definition Classes
- MapOps → Builder
- def reversed: Iterable[(K, V)]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def runWith[U](action: (V) => U): (K) => Boolean
- Definition Classes
- PartialFunction
- def scan[B >: (K, V)](z: B)(op: (B, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, (K, V)) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: ((K, V), B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def size: Int
Return the size of 'this' B+Tree map.
Return the size of 'this' B+Tree map.
- Definition Classes
- BpTreeMap → IterableOnceOps
- def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
- Definition Classes
- IterableOps
- final def sizeHint(coll: IterableOnce[_], delta: Int): Unit
- Definition Classes
- Builder
- def sizeHint(size: Int): Unit
- Definition Classes
- Builder
- final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit
- Definition Classes
- Builder
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): SortedMap[K, V]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[SortedMap[K, V]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[SortedMap[K, V]]
- Definition Classes
- IterableOps
- def sortedMapFactory: SortedMapFactory[SortedMap]
- Definition Classes
- SortedMap → SortedMap → SortedMapOps
- final def sortedMapFromIterable[K2, V2](it: Iterable[(K2, V2)])(implicit ordering: Ordering[K2]): SortedMap[K2, V2]
- Attributes
- protected
- Definition Classes
- SortedMapOps
- Annotations
- @inline()
- def span(p: ((K, V)) => Boolean): (SortedMap[K, V], SortedMap[K, V])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (SortedMap[K, V], SortedMap[K, V])
- Definition Classes
- IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[(K, V), S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- SortedMap → Map → Iterable
- def subtractAll(xs: IterableOnce[K]): BpTreeMap.this.type
- Definition Classes
- Shrinkable
- def subtractOne(elem: K): BpTreeMap.this.type
- Definition Classes
- BpTreeMap → Shrinkable
- def sum[B >: (K, V)](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: SortedMap[K, V]
- Definition Classes
- IterableOps
- def tails: Iterator[SortedMap[K, V]]
- Definition Classes
- IterableOps
- def take(n: Int): SortedMap[K, V]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): SortedMap[K, V]
- Definition Classes
- IterableOps
- def takeWhile(p: ((K, V)) => Boolean): SortedMap[K, V]
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: ((K, V)) => U): SortedMap[K, V]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[(K, V), C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: (K, V)]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[(K, V)]
- Definition Classes
- IterableOnceOps
- final def toIterable: BpTreeMap.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: List[(K, V)]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[(K, V)]
- Definition Classes
- IterableOnceOps
- def toSet[B >: (K, V)]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- Map → Function1 → Iterable → AnyRef → Any
- def toVector: Vector[(K, V)]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: ((K, V)) => Iterable[B]): Iterable[Iterable[B]]
- Definition Classes
- IterableOps
- def unapply(a: K): Option[V]
- Definition Classes
- PartialFunction
- def unsorted: Map[K, V]
- Definition Classes
- SortedMap → SortedMapOps → SortedMap → SortedMapOps
- def unzip[A1, A2](implicit asPair: ((K, V)) => (A1, A2)): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- IterableOps
- def update(key: K, value: V): Unit
- Definition Classes
- MapOps
- def updateWith(key: K)(remappingFunction: (Option[V]) => Option[V]): Option[V]
- Definition Classes
- MapOps
- def valueStepper[S <: Stepper[_]](implicit shape: StepperShape[V, S]): S
- Definition Classes
- MapOps
- def values: Iterable[V]
- Definition Classes
- MapOps
- def valuesIterator: Iterator[V]
- Definition Classes
- MapOps
- def valuesIteratorFrom(start: K): Iterator[V]
- Definition Classes
- SortedMapOps
- def view: MapView[K, V]
- Definition Classes
- MapOps → IterableOps
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withDefault(d: (K) => V): SortedMap[K, V]
- Definition Classes
- SortedMap → Map
- def withDefaultValue(d: V): SortedMap[K, V]
- Definition Classes
- SortedMap → Map
- def withFilter(p: ((K, V)) => Boolean): WithFilter[K, V, [x]Iterable[x], [x, y]Map[x, y], [x, y]SortedMap[x, y]]
- Definition Classes
- SortedMapFactoryDefaults → IterableOps
- def writeReplace(): AnyRef
- Attributes
- protected[this]
- Definition Classes
- DefaultSerializable
- def zip[B](that: IterableOnce[B]): Iterable[((K, V), B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: (K, V), B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Iterable[((K, V), Int)]
- Definition Classes
- IterableOps → IterableOnceOps
Deprecated Value Members
- def +[V1 >: V](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): SortedMap[K, V1]
- Definition Classes
- SortedMapOps → MapOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
- def +[V1 >: V](kv: (K, V1)): SortedMap[K, V1]
- Definition Classes
- SortedMapOps → MapOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Map or fall back to Map.concat
- def ++:[V1 >: V](that: IterableOnce[(K, V1)]): Map[K, V1]
- Definition Classes
- MapOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- def ++:[B >: (K, V)](that: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- final def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): BpTreeMap.this.type
- Definition Classes
- Growable
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
++=
akaaddAll
instead of varargs+=
; infix operations with an operand of multiple args will be deprecated
- final def -(key1: K, key2: K, keys: K*): SortedMap[K, V]
- Definition Classes
- MapOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use -- or removeAll on an immutable Map
- final def -(key: K): SortedMap[K, V]
- Definition Classes
- MapOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use - or remove on an immutable Map
- def --(keys: IterableOnce[K]): SortedMap[K, V]
- Definition Classes
- MapOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Map.
- def -=(elem1: K, elem2: K, elems: K*): BpTreeMap.this.type
- Definition Classes
- Shrinkable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.3) Use
--=
akasubtractAll
instead of varargs-=
; infix operations with an operand of multiple args will be deprecated
- final def /:[B](z: B)(op: (B, (K, V)) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: ((K, V), B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, (K, V)) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is not relevant for sequential collections. UsefoldLeft(z)(seqop)
instead.
- def companion: IterableFactory[[_]Iterable[_]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- def compare(k0: K, k1: K): Int
- Definition Classes
- SortedOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use ordering.compare instead
- final def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def filterKeys(p: (K) => Boolean): MapView[K, V]
- Definition Classes
- MapOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.filterKeys(f). A future version will include a strict version of this method (for now, .view.filterKeys(p).toMap).
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- final def from(from: K): SortedMap[K, V]
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeFrom
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- def mapValues[W](f: (V) => W): MapView[K, W]
- Definition Classes
- MapOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.mapValues(f). A future version will include a strict version of this method (for now, .view.mapValues(f).toMap).
- final def repr: SortedMap[K, V]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- final def retain(p: (K, V) => Boolean): BpTreeMap.this.type
- Definition Classes
- MapOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use filterInPlace instead
- def seq: BpTreeMap.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def to(to: K): SortedMap[K, V]
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeTo
- final def toIterator: Iterator[(K, V)]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[(K, V)]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[(K, V)]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- final def transform(f: (K, V) => V): BpTreeMap.this.type
- Definition Classes
- MapOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use mapValuesInPlace instead
- final def until(until: K): SortedMap[K, V]
- Definition Classes
- SortedOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use rangeUntil
- def updated[V1 >: V](key: K, value: V1): SortedMap[K, V1]
- Definition Classes
- SortedMapOps → MapOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use m.clone().addOne((k,v)) instead of m.updated(k, v)
- def view(from: Int, until: Int): View[(K, V)]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)