kb.hierarchy

Class POSet

Object

kb.hierarchy.POSet

Direct Known Subclasses:

TypeHierarchy

public class POSet
extends Object

Implements a partially ordered set. Maintains an index of the nodes so that a given object can be found quickly. NO value may appear twice anywhere in the POSet. Has a root node which is the "largest" value, which allows navigation to all of its member nodes.

Author:

Harry Delugach

See Also:

POSetNode

Field Summary

Fields

Modifier and Type	Field and Description
protected HashMap<Object,POSetNode>	allnodes

Constructor Summary

Constructors

Constructor and Description
POSet()

Method Summary

Modifier and Type	Method and Description
boolean	addNode(POSetNode node) Add a node to the poset without regard for position or order.
void	clear()
boolean	deleteNode(POSetNode node) Deletes a node from the poset.
int	getCardinality()
POSetNode	getNodeByKey(Object posetKey) Searches for the given value in the partially ordered set.

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

allnodes

protected HashMap<Object,POSetNode> allnodes

Constructor Detail

POSet

public POSet()

Method Detail

getNodeByKey

public POSetNode getNodeByKey(Object posetKey)

Searches for the given value in the partially ordered set. If found, returns a node in which it appears.

Parameters:

posetKey - the key for the node we're looking for

Returns:

The node that nodeContains the value; null otherwise.

addNode

public boolean addNode(POSetNode node)

Add a node to the poset without regard for position or order.

Returns:

true if the node was simply added successfully (regardless of order); false otherwise.

deleteNode

public boolean deleteNode(POSetNode node)

Deletes a node from the poset. Detach all of its parent and child links. * @return true if the node was simply deleted successfully (regardless of order); false otherwise.

getCardinality

public int getCardinality()

clear

public void clear()