Uses of Class
de.folt.fuzzy.FuzzyNode

Packages that use FuzzyNode

de.folt.fuzzy

Uses of FuzzyNode in de.folt.fuzzy

Subclasses of FuzzyNode in de.folt.fuzzy

class	MonoLingualFuzzyNode This class implements a StringFuzzyNode and uses a MonoLingualObject MonoLingualObject as the reference value.
class	SQLMonoLingualFuzzyNode This class implements a StringFuzzyNode and uses a SQLMonoLingualObject SQLMonoLingualObject as the reference value.
class	StringFuzzyNode<T> This class implements a FuzzyNode and uses a String as the reference value for the key.

Methods in de.folt.fuzzy that return FuzzyNode

FuzzyNode<K,T>	FuzzyNodeSearchResult.getFuzzyNode()
FuzzyNode<K,T>	FuzzyNode.getLeftSon() Get the left son of the FuzzyNode
FuzzyNode<K,T>	FuzzyNode.getRightSon() Set the right son of the FuzzyNode
FuzzyNode<K,T>	FuzzyNodeTree.getRoot()

Methods in de.folt.fuzzy that return types with arguments of type FuzzyNode

java.util.Vector<FuzzyNode<java.lang.String,T>>	StringFuzzyNode.search(java.lang.Object value)
java.util.Vector<FuzzyNode<java.lang.String,SQLMonoLingualObject>>	SQLMonoLingualFuzzyNode.search(java.lang.Object value)
java.util.Vector<FuzzyNode<K,T>>	FuzzyNode.search(java.lang.Object value) search search for a fuzzy node based on the value of a node

Methods in de.folt.fuzzy with parameters of type FuzzyNode

int	FuzzyNode.computeKeyDistance(FuzzyNode<K,T> fuzzyNode) computeKeyDistance computes the distance between two fuzzy nodes based on its keys For the implementation see FuzzyNodeKey
boolean	PartitionedFuzzyNodeTree.insertFuzzyNode(FuzzyNode<K,T> fuzzyNodeToAdd) insertFuzzyNode inserts a Fuzzy node into a partitioned fuzzy node tree;
boolean	FuzzyNodeTree.insertFuzzyNode(FuzzyNode<K,T> fuzzyNodeToAdd)
boolean	FuzzyNode.insertFuzzyNode(FuzzyNode<K,T> fuzzyNodeToAdd) insertFuzzyNode inserts a new FuzzyNode in the current FuzzyNode - which is actually a tree
boolean	FuzzyNode.insertFuzzyNode(FuzzyNode<K,T> fuzzyNodeToAdd, boolean bInsertMode) insertFuzzyNode insert a Fuzzy Node at a specific position in the tree applying a KDTREE insert algorithm.
boolean	StringPartitionedFuzzyNodeTree.insertFuzzyNode(FuzzyNode<java.lang.String,T> fuzzyNodeToAdd)
boolean	LanguagePartitionedFuzzyNodeTree.pushToFuzzyNodeSearchThread(FuzzyNode<java.lang.String,T> searchNode, FuzzyNode<java.lang.String,T> fuzzyCompareKey, int similarity) pushToFuzzyNodeSearchThread if there a threads given the processor number available runs a search in a new thread
boolean	LanguagePartitionedFuzzyNodeTree.pushToFuzzyNodeSearchThread(FuzzyNode<java.lang.String,T> searchNode, FuzzyNode<java.lang.String,T> fuzzyCompareKey, int similarity) pushToFuzzyNodeSearchThread if there a threads given the processor number available runs a search in a new thread
boolean	PartitionedFuzzyNodeTree.removeValue(FuzzyNode<K,T> fuzzyCompareKey) removeValue removes a value from the value list of the values of the node based on a key.
boolean	FuzzyNodeTree.removeValue(FuzzyNode<K,T> fuzzyCompareKey) removeValue removes a value from the value list of the values of the tree based on a key.
boolean	FuzzyNode.removeValue(FuzzyNode<K,T> fuzzyCompareKey) removeValue removes a value from the value list of the values of the node based on a key.
boolean	StringPartitionedFuzzyNodeTree.removeValue(FuzzyNode<java.lang.String,T> fuzzyCompareKey) removeValue removes a value from the value list of the values of the node based on a key.
java.util.Vector<FuzzyNodeSearchResult<K,T>>	PartitionedFuzzyNodeTree.search(FuzzyNode<K,T> fuzzyCompareKey, int similarity) search returns all a FuzzyNodeSearchResult of all matching FuzzyNodes
java.util.Vector<FuzzyNodeSearchResult<K,T>>	FuzzyNodeTree.search(FuzzyNode<K,T> fuzzyCompareKey, int similarity)
java.util.Vector<FuzzyNodeSearchResult<K,T>>	FuzzyNode.search(FuzzyNode<K,T> fuzzyCompareKey, int similarity) search searches FuzzyNode and its sons with a given similarity and returns a Vector of matching keys.
java.util.Vector<FuzzyNodeSearchResult<java.lang.String,MonoLingualObject>>	MonoLingualFuzzyNode.search(FuzzyNode<java.lang.String,MonoLingualObject> fuzzyCompareKey, int similarity)
java.util.Vector<FuzzyNodeSearchResult<java.lang.String,SQLMonoLingualObject>>	SQLMonoLingualFuzzyNode.search(FuzzyNode<java.lang.String,SQLMonoLingualObject> fuzzyCompareKey, int similarity)
java.util.Vector<FuzzyNodeSearchResult<java.lang.String,T>>	StringPartitionedFuzzyNodeTree.search(FuzzyNode<java.lang.String,T> fuzzyCompareKey, int similarity)
java.util.Vector<FuzzyNodeSearchResult<java.lang.String,T>>	StringFuzzyNode.search(FuzzyNode<java.lang.String,T> fuzzyCompareKey, int similarity)
void	FuzzyNodeSearchResult.setFuzzyNode(FuzzyNode<K,T> fuzzyNode)
void	FuzzyNode.setLeftSon(FuzzyNode<K,T> leftSon) Set the left son of the FuzzyNode
void	FuzzyNode.setRightSon(FuzzyNode<K,T> rightSon) Set the left son of the FuzzyNode
boolean	FuzzyNode.updateFuzzyNode(FuzzyNode<K,T> fuzzyNodeToAdd, boolean bInsertMode) updateFuzzyNode updates an existing fuzzy node with the value of the fuzzyNodeToAdd.

Constructors in de.folt.fuzzy with parameters of type FuzzyNode

FuzzyNodeSearchResult(float distance, FuzzyNode<K,T> fuzzyNode)
Create a FuzzyNodeSearchResult for a given distance (fuzzy node key distance) and the matching fuzzy node

FuzzyNodeSearchResult(float distance, FuzzyNode<K,T> fuzzyNode, int nodessearched, int nodesmatched, int nodespushed)
Create a FuzzyNodeSearchResult for a given distance (fuzzy node key distance) and the matching fuzzy node

FuzzyNodeSearchResult(float distance, int similarity, float dist, int difference, FuzzyNode<K,T> fuzzyNode, int nodessearched, int nodesmatched, int nodespushed)
Create a FuzzyNodeSearchResult for a given distance (fuzzy node key distance) and the matching fuzzy node

FuzzyNodeSearchThread(FuzzyNode<K,T> searchNode, FuzzyNode<K,T> fuzzyCompareKey, int similarity)

FuzzyNodeSearchThread(FuzzyNode<K,T> searchNode, FuzzyNode<K,T> fuzzyCompareKey, int similarity)