Packages

class Node[K] extends Error

The Node class defines a splittable node type with methods for finding entries (keys and values).

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

Instance Constructors

  1. new Node(lt: Node[K], kd: K, rt: Node[K], half: Int)(implicit arg0: (K) ⇒ Ordered[K], arg1: ClassTag[K])

    Construct a new root node with one key (and two references) in it.

    Construct a new root node with one key (and two references) in it.

    lt

    the left node

    kd

    the divider key

    rt

    the right node

  2. new Node(isLeaf: Boolean = true, half: Int = 2)(implicit arg0: (K) ⇒ Ordered[K], arg1: ClassTag[K])

    isLeaf

    whether the node is a leaf (true) or internal node (false)

    half

    half the maximum number of keys allowed in a ndoe

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
    @native() @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. def find(k: K): Int

    Find the "<=" position of key 'k' in 'this' node.

    Find the "<=" position of key 'k' in 'this' node. If 'k' is larger than all keys in 'this' node, return 'nkeys'.

    k

    the key whose position is sought

  10. final def flaw(method: String, message: String): Unit

    Show the flaw by printing the error message.

    Show the flaw by printing the error message.

    method

    the method where the error occurred

    message

    the error message

    Definition Classes
    Error
  11. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. val half: Int
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. def isFull: Boolean

    Determine whether 'this' mode is currently full.

  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. val isLeaf: Boolean
  17. val key: Array[K]

    The array of keys

  18. val mx: Int

    The maximum number of keys

  19. var nKeys: Int

    The number of active keys

  20. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  22. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  23. val ref: Array[Any]

    The array of references

  24. def split(): (K, Node[K])

    Split 'this' node by creating a right sibling 'rt' and moving half the keys and references to that new node.

    Split 'this' node by creating a right sibling 'rt' and moving half the keys and references to that new node. Return the divider key and the right sibling node.

  25. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  26. def toString(): String

    Convert 'this' node to a string.

    Convert 'this' node to a string.

    Definition Classes
    Node → AnyRef → Any
  27. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  30. def wedge(k: K, v: Any, ip: Int, left: Boolean = true): Unit

    When space is available, wedge the new key 'k' and value 'v' into 'this' node at the given insertion position 'ip'.

    When space is available, wedge the new key 'k' and value 'v' into 'this' node at the given insertion position 'ip'.

    k

    the new key

    v

    the new value

    ip

    the insertion position

    left

    whether to start with from the left size of the key

Inherited from Error

Inherited from AnyRef

Inherited from Any

Ungrouped