Packages

  • package root
    Definition Classes
    root
  • class BpTreeMap2[K <: Comparable[K], V] extends AbstractMap[K, V] with Serializable with Cloneable with SortedMap[K, V]

    ********************************************************************************** The BpTreeMap2 class provides B+Tree maps.

    ********************************************************************************** The BpTreeMap2 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. All keys will be at the leaf level with leaf nodes linked by references. Internal nodes will contain divider keys such that each divider key corresponds to the largest key in its left subtree (largest left). Keys in left subtree are "<=", while keys in right substree are ">".

    Definition Classes
    root
c

BpTreeMap2

class BpTreeMap2[K <: Comparable[K], V] extends AbstractMap[K, V] with Serializable with Cloneable with SortedMap[K, V]

********************************************************************************** The BpTreeMap2 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. All keys will be at the leaf level with leaf nodes linked by references. Internal nodes will contain divider keys such that each divider key corresponds to the largest key in its left subtree (largest left). Keys in left subtree are "<=", while keys in right substree are ">".

Linear Supertypes
SortedMap[K, V], Cloneable, Cloneable, Serializable, Serializable, AbstractMap[K, V], Map[K, V], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BpTreeMap2
  2. SortedMap
  3. Cloneable
  4. Cloneable
  5. Serializable
  6. Serializable
  7. AbstractMap
  8. Map
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BpTreeMap2()(implicit arg0: ClassTag[K], arg1: ClassTag[V])

Type Members

  1. class Node extends AnyRef

    ****************************************************************************** This inner class defines nodes that are stored in the B+tree map.

Value Members

  1. def clear(): Unit
    Definition Classes
    AbstractMap → Map
  2. def comparator(): Comparator[_ >: K]

    ****************************************************************************** Return null to use the natural order based on the key type.

    ****************************************************************************** Return null to use the natural order based on the key type. This requires the key type to implement Comparable.

    Definition Classes
    BpTreeMap2 → SortedMap
  3. def compute(arg0: K, arg1: BiFunction[_ >: K, _ >: V, _ <: V]): V
    Definition Classes
    Map
  4. def computeIfAbsent(arg0: K, arg1: Function[_ >: K, _ <: V]): V
    Definition Classes
    Map
  5. def computeIfPresent(arg0: K, arg1: BiFunction[_ >: K, _ >: V, _ <: V]): V
    Definition Classes
    Map
  6. def containsKey(arg0: Any): Boolean
    Definition Classes
    AbstractMap → Map
  7. def containsValue(arg0: Any): Boolean
    Definition Classes
    AbstractMap → Map
  8. def entrySet(): Set[Entry[K, V]]

    ****************************************************************************** Return a set containing all the entries as pairs of keys and values.

    ****************************************************************************** Return a set containing all the entries as pairs of keys and values.

    returns

    the set view of the map

    Definition Classes
    BpTreeMap2 → SortedMap → AbstractMap → Map
  9. def equals(arg0: Any): Boolean
    Definition Classes
    AbstractMap → Map → AnyRef → Any
  10. def find(key: K, n: Node): V

    ****************************************************************************** Recursive helper function for finding a key in B+trees.

    ****************************************************************************** Recursive helper function for finding a key in B+trees.

    key

    the key to find

    n

    the current node

  11. def firstKey(): K

    ****************************************************************************** Return the first (smallest) key in the B+Tree map.

    ****************************************************************************** Return the first (smallest) key in the B+Tree map.

    returns

    the first key in the B+Tree map.

    Definition Classes
    BpTreeMap2 → SortedMap
  12. def forEach(arg0: BiConsumer[_ >: K, _ >: V]): Unit
    Definition Classes
    Map
  13. def get(key: Any): V

    ****************************************************************************** Given the key, look up the value in the B+Tree map.

    ****************************************************************************** Given the key, look up the value in the B+Tree map.

    key

    the key used for look up

    returns

    the value associated with the key or null if not found

    Definition Classes
    BpTreeMap2 → AbstractMap → Map
  14. def getOrDefault(arg0: Any, arg1: V): V
    Definition Classes
    Map
  15. def hashCode(): Int
    Definition Classes
    AbstractMap → Map → AnyRef → Any
  16. def headMap(toKey: K): SortedMap[K, V]

    ****************************************************************************** Return the portion of the B+Tree map where key < toKey.

    ****************************************************************************** Return the portion of the B+Tree map where key < toKey.

    returns

    the submap with keys in the range [firstKey, toKey)

    Definition Classes
    BpTreeMap2 → SortedMap
  17. def insert(key: K, ref: V, n: Node): Node

    ****************************************************************************** Recursive helper function for inserting a key in B+trees.

    ****************************************************************************** Recursive helper function for inserting a key in B+trees.

    key

    the key to insert

    ref

    the value/node to insert

    n

    the current node

    returns

    the node inserted into/current node

  18. def isEmpty(): Boolean
    Definition Classes
    AbstractMap → Map
  19. def keySet(): Set[K]
    Definition Classes
    AbstractMap → Map
  20. def lastKey(): K

    ****************************************************************************** Return the last (largest) key in the B+Tree map.

    ****************************************************************************** Return the last (largest) key in the B+Tree map.

    returns

    the last key in the B+Tree map.

    Definition Classes
    BpTreeMap2 → SortedMap
  21. def merge(arg0: K, arg1: V, arg2: BiFunction[_ >: V, _ >: V, _ <: V]): V
    Definition Classes
    Map
  22. def printTree(): Unit
  23. def put(key: K, value: V): V

    ****************************************************************************** Put the key-value pair in the B+Tree map.

    ****************************************************************************** Put the key-value pair in the B+Tree map.

    key

    the key to insert

    value

    the value to insert

    returns

    null, not the previous value for this key

    Definition Classes
    BpTreeMap2 → AbstractMap → Map
  24. def putAll(arg0: Map[_ <: K, _ <: V]): Unit
    Definition Classes
    AbstractMap → Map
  25. def putIfAbsent(arg0: K, arg1: V): V
    Definition Classes
    Map
  26. def remove(arg0: Any): V
    Definition Classes
    AbstractMap → Map
  27. def remove(arg0: Any, arg1: Any): Boolean
    Definition Classes
    Map
  28. def replace(arg0: K, arg1: V): V
    Definition Classes
    Map
  29. def replace(arg0: K, arg1: V, arg2: V): Boolean
    Definition Classes
    Map
  30. def replaceAll(arg0: BiFunction[_ >: K, _ >: V, _ <: V]): Unit
    Definition Classes
    Map
  31. def size(): Int

    ****************************************************************************** Return the size (number of keys) in the B+Tree.

    ****************************************************************************** Return the size (number of keys) in the B+Tree.

    returns

    the size of the B+Tree

    Definition Classes
    BpTreeMap2 → AbstractMap → Map
  32. def stats: (Int, Int, Double)
  33. def subMap(fromKey: K, toKey: K): SortedMap[K, V]

    ****************************************************************************** Return the portion of the B+Tree map whose keys are between fromKey and toKey, i.e., fromKey <= key < toKey.

    ****************************************************************************** Return the portion of the B+Tree map whose keys are between fromKey and toKey, i.e., fromKey <= key < toKey.

    returns

    the submap with keys in the range [fromKey, toKey)

    Definition Classes
    BpTreeMap2 → SortedMap
  34. def tailMap(fromKey: K): SortedMap[K, V]

    ****************************************************************************** Return the portion of the B+Tree map where fromKey <= key.

    ****************************************************************************** Return the portion of the B+Tree map where fromKey <= key.

    returns

    the submap with keys in the range [fromKey, lastKey]

    Definition Classes
    BpTreeMap2 → SortedMap
  35. def toString(): String
    Definition Classes
    AbstractMap → AnyRef → Any
  36. def values(): Collection[V]
    Definition Classes
    AbstractMap → Map