|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use IStateBinaryTree.Node | |
---|---|
choco.kernel.memory | A package devoted to backtrackable data structures. |
choco.kernel.memory.trailing | |
choco.kernel.memory.trailing.trail |
Uses of IStateBinaryTree.Node in choco.kernel.memory |
---|
Fields in choco.kernel.memory declared as IStateBinaryTree.Node | |
---|---|
IStateBinaryTree.Node |
IStateBinaryTree.Node.father
the father of this node in the tree |
IStateBinaryTree.Node |
IStateBinaryTree.Node.leftNode
the left son of this node in the tree |
IStateBinaryTree.Node |
IStateBinaryTree.Node.rightNode
the right son of this node in the tree |
Methods in choco.kernel.memory that return IStateBinaryTree.Node | |
---|---|
IStateBinaryTree.Node |
IStateBinaryTree.find(int value)
finds the node which contains the given value |
IStateBinaryTree.Node |
IStateBinaryTree.getFirstNode()
Gets the node containing the lowest value in the tree |
IStateBinaryTree.Node |
IStateBinaryTree.getLastNode()
Gets the node containing the greatest value in the tree |
IStateBinaryTree.Node |
IStateBinaryTree.getRoot()
Gets the root of the tree |
IStateBinaryTree.Node |
IStateBinaryTree.nextNode(int value)
gets the node that contains the next integer in the tree |
IStateBinaryTree.Node |
IStateBinaryTree.nextNode(IStateBinaryTree.Node n)
gets the next node of the given one |
IStateBinaryTree.Node |
IStateBinaryTree.prevNode(int value)
gets the node that contains the previous integer in the tree |
IStateBinaryTree.Node |
IStateBinaryTree.prevNode(IStateBinaryTree.Node n)
gets the previous node of the given one |
Methods in choco.kernel.memory with parameters of type IStateBinaryTree.Node | |
---|---|
void |
IStateBinaryTree.add(IStateBinaryTree.Node n)
Add a node in the tree |
void |
IStateBinaryTree.add(IStateBinaryTree.Node n,
boolean save)
Add a node in the tree and save the operation if requested |
IStateBinaryTree.Node |
IStateBinaryTree.nextNode(IStateBinaryTree.Node n)
gets the next node of the given one |
IStateBinaryTree.Node |
IStateBinaryTree.prevNode(IStateBinaryTree.Node n)
gets the previous node of the given one |
void |
IStateBinaryTree.remove(IStateBinaryTree.Node n)
Remove a node from the tree |
void |
IStateBinaryTree.remove(IStateBinaryTree.Node n,
boolean save)
Remove a node from the tree, and save the operation if requested |
Uses of IStateBinaryTree.Node in choco.kernel.memory.trailing |
---|
Methods in choco.kernel.memory.trailing that return IStateBinaryTree.Node | |
---|---|
IStateBinaryTree.Node |
StoredBinaryTree.find(int value)
|
IStateBinaryTree.Node |
StoredBinaryTree.getFirstNode()
|
IStateBinaryTree.Node |
StoredBinaryTree.getLastNode()
|
IStateBinaryTree.Node |
StoredBinaryTree.getRoot()
|
IStateBinaryTree.Node |
StoredBinaryTree.nextNode(int value)
|
IStateBinaryTree.Node |
StoredBinaryTree.nextNode(IStateBinaryTree.Node n)
|
IStateBinaryTree.Node |
StoredBinaryTree.prevNode(int value)
|
IStateBinaryTree.Node |
StoredBinaryTree.prevNode(IStateBinaryTree.Node n)
|
Methods in choco.kernel.memory.trailing that return types with arguments of type IStateBinaryTree.Node | |
---|---|
List<IStateBinaryTree.Node> |
StoredBinaryTree.toList()
|
Methods in choco.kernel.memory.trailing with parameters of type IStateBinaryTree.Node | |
---|---|
void |
StoredBinaryTree.add(IStateBinaryTree.Node n)
|
void |
StoredBinaryTree.add(IStateBinaryTree.Node n,
boolean save)
|
IStateBinaryTree.Node |
StoredBinaryTree.nextNode(IStateBinaryTree.Node n)
|
IStateBinaryTree.Node |
StoredBinaryTree.prevNode(IStateBinaryTree.Node n)
|
void |
StoredBinaryTree.remove(IStateBinaryTree.Node n)
|
void |
StoredBinaryTree.remove(IStateBinaryTree.Node n,
boolean save)
|
String |
StoredBinaryTree.toDotty(IStateBinaryTree.Node n)
|
Uses of IStateBinaryTree.Node in choco.kernel.memory.trailing.trail |
---|
Methods in choco.kernel.memory.trailing.trail with parameters of type IStateBinaryTree.Node | |
---|---|
void |
StoredBinaryTreeTrail.stack(IStateBinaryTree b,
IStateBinaryTree.Node n,
int operation)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |