org.millscript.commons.util.map
Class AbstractIBinaryTreeMapNode<K,V>
java.lang.Object
org.millscript.commons.util.map.AbstractIBinaryTreeMapNode<K,V>
- All Implemented Interfaces:
- java.io.Serializable, ITreeMapNode<K,V>, Maplet<K,V>
- Direct Known Subclasses:
- AbstractUBinaryTreeMapNode, IBinaryTreeMap.Node
public abstract class AbstractIBinaryTreeMapNode<K,V>
- extends java.lang.Object
- implements ITreeMapNode<K,V>, java.io.Serializable
- See Also:
- Serialized Form
|
Method Summary |
abstract AbstractIBinaryTreeMapNode<K,V> |
deepCopy()
|
AbstractIBinaryTreeMapNode<K,V> |
find(java.util.Comparator<K> comp,
K key)
|
AbstractIBinaryTreeMapNode<K,V> |
getFirstInSequence()
|
AbstractIBinaryTreeMapNode<K,V> |
getLeft()
|
AbstractIBinaryTreeMapNode<K,V> |
getNextInSequence()
|
AbstractIBinaryTreeMapNode<K,V> |
getParent()
|
AbstractIBinaryTreeMapNode<K,V> |
getRight()
|
void |
setLeft(AbstractIBinaryTreeMapNode<K,V> l)
|
void |
setParent(AbstractIBinaryTreeMapNode<K,V> p)
|
void |
setRight(AbstractIBinaryTreeMapNode<K,V> r)
|
int |
size()
|
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
AbstractIBinaryTreeMapNode
public AbstractIBinaryTreeMapNode(AbstractIBinaryTreeMapNode<K,V> p)
- Parameters:
p -
deepCopy
public abstract AbstractIBinaryTreeMapNode<K,V> deepCopy()
- Specified by:
deepCopy in interface ITreeMapNode<K,V>
find
public AbstractIBinaryTreeMapNode<K,V> find(java.util.Comparator<K> comp,
K key)
- Specified by:
find in interface ITreeMapNode<K,V>
- See Also:
org.millscript.commons.util.ITreeMapNode#find(java.util.Comparator, K)
getFirstInSequence
public AbstractIBinaryTreeMapNode<K,V> getFirstInSequence()
- Specified by:
getFirstInSequence in interface ITreeMapNode<K,V>
- See Also:
ITreeMapNode.getFirstInSequence()
getLeft
public AbstractIBinaryTreeMapNode<K,V> getLeft()
- Returns:
- Returns the left.
getNextInSequence
public AbstractIBinaryTreeMapNode<K,V> getNextInSequence()
- Specified by:
getNextInSequence in interface ITreeMapNode<K,V>
- See Also:
ITreeMapNode.getNextInSequence()
getParent
public AbstractIBinaryTreeMapNode<K,V> getParent()
- Returns:
- Returns the parent.
getRight
public AbstractIBinaryTreeMapNode<K,V> getRight()
- Returns:
- Returns the right.
setLeft
public void setLeft(AbstractIBinaryTreeMapNode<K,V> l)
- Parameters:
l - The left to set.
setParent
public void setParent(AbstractIBinaryTreeMapNode<K,V> p)
- Parameters:
p - The parent to set.
setRight
public void setRight(AbstractIBinaryTreeMapNode<K,V> r)
- Parameters:
r - The right to set.
size
public int size()
- Specified by:
size in interface ITreeMapNode<K,V>
- See Also:
ITreeMapNode.size()
Copyright © 2005-2007 Open World Ltd. All Rights Reserved.