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. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clear(): Unit
    Definition Classes
    AbstractMap → Map
  6. def clone(): AnyRef
    Attributes
    protected[java.util]
    Definition Classes
    AbstractMap → AnyRef
    Annotations
    @throws( ... )
  7. 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
  8. def compute(arg0: K, arg1: BiFunction[_ >: K, _ >: V, _ <: V]): V
    Definition Classes
    Map
  9. def computeIfAbsent(arg0: K, arg1: Function[_ >: K, _ <: V]): V
    Definition Classes
    Map
  10. def computeIfPresent(arg0: K, arg1: BiFunction[_ >: K, _ >: V, _ <: V]): V
    Definition Classes
    Map
  11. def containsKey(arg0: Any): Boolean
    Definition Classes
    AbstractMap → Map
  12. def containsValue(arg0: Any): Boolean
    Definition Classes
    AbstractMap → Map
  13. 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
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean
    Definition Classes
    AbstractMap → Map → AnyRef → Any
  16. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. 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

  18. 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
  19. def forEach(arg0: BiConsumer[_ >: K, _ >: V]): Unit
    Definition Classes
    Map
  20. 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
  21. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  22. def getOrDefault(arg0: Any, arg1: V): V
    Definition Classes
    Map
  23. def hashCode(): Int
    Definition Classes
    AbstractMap → Map → AnyRef → Any
  24. 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
  25. 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

  26. def isEmpty(): Boolean
    Definition Classes
    AbstractMap → Map
  27. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  28. def keySet(): Set[K]
    Definition Classes
    AbstractMap → Map
  29. 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
  30. def merge(arg0: K, arg1: V, arg2: BiFunction[_ >: V, _ >: V, _ <: V]): V
    Definition Classes
    Map
  31. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  32. final def notify(): Unit
    Definition Classes
    AnyRef
  33. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  34. def printTree(): Unit
  35. 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
  36. def putAll(arg0: Map[_ <: K, _ <: V]): Unit
    Definition Classes
    AbstractMap → Map
  37. def putIfAbsent(arg0: K, arg1: V): V
    Definition Classes
    Map
  38. def remove(arg0: Any): V
    Definition Classes
    AbstractMap → Map
  39. def remove(arg0: Any, arg1: Any): Boolean
    Definition Classes
    Map
  40. def replace(arg0: K, arg1: V): V
    Definition Classes
    Map
  41. def replace(arg0: K, arg1: V, arg2: V): Boolean
    Definition Classes
    Map
  42. def replaceAll(arg0: BiFunction[_ >: K, _ >: V, _ <: V]): Unit
    Definition Classes
    Map
  43. 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
  44. def stats: (Int, Int, Double)
  45. 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
  46. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  47. 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
  48. def toString(): String
    Definition Classes
    AbstractMap → AnyRef → Any
  49. def values(): Collection[V]
    Definition Classes
    AbstractMap → Map
  50. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  52. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from SortedMap[K, V]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Serializable

Inherited from Serializable

Inherited from AbstractMap[K, V]

Inherited from Map[K, V]

Inherited from AnyRef

Inherited from Any

Ungrouped