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
  • Node

class Node extends AnyRef

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

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Node
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Node(p: Int, isLeaf: Boolean = true)

    p

    the order of the node (max refs)

    isLeaf

    whether the node is a leaf

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 clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def copy(n: Node, from: Int, num: Int): Unit

    ************************************************************************** Copy keys and ref from node n to this node.

    ************************************************************************** Copy keys and ref from node n to this node.

    n

    the node to copy from

    from

    where in n to start copying from

    num

    the number of keys/refs to copy

  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. def find(k: K): Int

    ************************************************************************** Find the "<=" match position in this node.

    ************************************************************************** Find the "<=" match position in this node.

    k

    the key to be matched.

    returns

    the position of match within node, where nKeys indicates no match

  11. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. val isLeaf: Boolean
  15. val key: Array[K]
  16. var nKeys: Int
  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  20. val ref: Array[Any]
  21. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  22. def toString(): String
    Definition Classes
    Node → AnyRef → Any
  23. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped