pt.ist.fenixframework.adt.bplustree
Class InnerNode

java.lang.Object
  pt.ist.fenixframework.core.AbstractDomainObject
      pt.ist.fenixframework.adt.bplustree.AbstractNode_Base
          pt.ist.fenixframework.adt.bplustree.AbstractNode
              pt.ist.fenixframework.adt.bplustree.InnerNode_Base
                  pt.ist.fenixframework.adt.bplustree.InnerNode

All Implemented Interfaces:

Serializable, Iterable, DomainObject

public class InnerNode
extends InnerNode_Base

Inner node of a B+-Tree. These nodes do not contain elements. They only contain M keys (ordered) and M+1 sub-nodes (M > 0). The n-th sub-node will contain elements whose keys are all less than the n-th key, except for the last sub-node (L) which will contain elements whose keys will be greater than or equal to the M-th key.

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class pt.ist.fenixframework.core.AbstractDomainObject

AbstractDomainObject.SerializedForm

Field Summary

Fields inherited from class pt.ist.fenixframework.adt.bplustree.AbstractNode_Base

AdtNodeHasParent, role$$parent

Method Summary

boolean	containsKey(Comparable key) Returns true if this map contains a mapping for the specified key.
String	dump(int level, boolean dumpKeysOnly, boolean dumpNodeIds)
Serializable	get(Comparable key) Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
Serializable	getIndex(int index) Returns the value at the given index
AbstractNode	insert(Comparable key, Serializable value) Inserts the given key-value pair and returns the (possibly new) root node
Iterator	iterator()
AbstractNode	remove(Comparable key) Removes the element with the given key
AbstractNode	removeIndex(int index) Returns the value that was removed from the given index
int	size() Returns the number os key-value mappings in this map

Methods inherited from class pt.ist.fenixframework.adt.bplustree.InnerNode_Base

getSubNodes, setSubNodes

Methods inherited from class pt.ist.fenixframework.adt.bplustree.AbstractNode

externalizeTreeMap, internalizeTreeMap

Methods inherited from class pt.ist.fenixframework.adt.bplustree.AbstractNode_Base

getParent, hasParent, removeParent, setParent

Methods inherited from class pt.ist.fenixframework.core.AbstractDomainObject

ensureOid, equals, getExternalId, getOid, hashCode, makeSerializedForm, toString, writeReplace

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Method Detail

insert

public AbstractNode insert(Comparable key,
                           Serializable value)

Description copied from class: AbstractNode

Inserts the given key-value pair and returns the (possibly new) root node

remove

public AbstractNode remove(Comparable key)

Description copied from class: AbstractNode

Removes the element with the given key

get

public Serializable get(Comparable key)

Description copied from class: AbstractNode

Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.

getIndex

public Serializable getIndex(int index)

Description copied from class: AbstractNode

Returns the value at the given index

removeIndex

public AbstractNode removeIndex(int index)

Description copied from class: AbstractNode

Returns the value that was removed from the given index

containsKey

public boolean containsKey(Comparable key)

Description copied from class: AbstractNode

Returns true if this map contains a mapping for the specified key.

size

public int size()

Description copied from class: AbstractNode

Returns the number os key-value mappings in this map

iterator

public Iterator iterator()

dump

public String dump(int level,
                   boolean dumpKeysOnly,
                   boolean dumpNodeIds)