|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Index<T>
Method Summary | |
---|---|
void |
add(T... node)
Adds a triple to a single index. |
void |
clear()
Removes all triples from this index. |
void |
close()
|
boolean |
contains(T first)
Returns true if the value given exists in the index. |
long |
getSize()
Returns the number of triples in the index. |
Map<T,Set<T>> |
getSubIndex(T first)
Returns the map of long to set of longs for the given entry of the index. |
Iterator<Map.Entry<T,Map<T,Set<T>>>> |
iterator()
Returns an iterator which contains all the elements in the graph as a collections of distinct longs, contains a map of longs to other longs. |
void |
remove(T... node)
Removes a triple from a single index. |
boolean |
removeSubIndex(T first)
Removes the given entry of long to set of longs with the given entry. |
Method Detail |
---|
void add(T... node) throws GraphException
node
- The nodes to add.
GraphException
- If there was an error adding the statement.void remove(T... node) throws GraphException
node
- the nodes to remove.
GraphException
- If there was an error revoking the statement, for example if it didn't exist.void clear()
Iterator<Map.Entry<T,Map<T,Set<T>>>> iterator()
Map<T,Set<T>> getSubIndex(T first)
first
- the entry set to find.
boolean contains(T first)
first
- the key to search for.
boolean removeSubIndex(T first)
first
- the entry set to remove.
long getSize()
void close()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |