lexx.trie
Interface Trie

All Known Implementing Classes:
MultiTrie, TrieNode

public interface Trie

Specialed Trie data structure

This trie can store multiple objects with the same key value

Since:
19/03/2003
Version:
1.0
Author:
Mohammed Imran

Method Summary
 java.lang.Object clone()
           
 java.util.Vector getAllNodes()
          Returns all the objects node and all its sub-nodes
 java.util.List getCurrentObjects()
          As Trie can have multiple objects with the same key, instead of returning an object, it returns a list of objects
 Trie getNode(java.lang.String key)
          Returns a specific sub-tree
 java.lang.Object getObject()
           
 boolean isLeaf()
           
 boolean isSingleLeaf()
           
 

Method Detail

getNode

public Trie getNode(java.lang.String key)
Returns a specific sub-tree

Parameters:
key - sub-tree that has that specific key value
Returns:
Returns a specific sub-tree

clone

public java.lang.Object clone()

getObject

public java.lang.Object getObject()

isLeaf

public boolean isLeaf()

isSingleLeaf

public boolean isSingleLeaf()

getAllNodes

public java.util.Vector getAllNodes()
Returns all the objects node and all its sub-nodes

Returns:
Returns all the objects node and all its sub-nodes

getCurrentObjects

public java.util.List getCurrentObjects()
As Trie can have multiple objects with the same key, instead of returning an object, it returns a list of objects

Returns:
list of objects