|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
basic interface to databases and other things that store nodes and edges for us
| Method Summary | |
void |
addEdge(Edge e)
|
void |
addField(Field f)
add a new field to the database |
void |
addNode(Node node)
|
boolean |
containsEdge(Edge e)
|
boolean |
containsEdge(Edge e,
String st)
|
boolean |
containsNode(Node n)
|
boolean |
containsNode(Node n,
String st)
|
int |
createDirectedEdge(Node source,
Node dest)
adds a new edge to the database and return its ID. |
int |
createDirectedEdge(Node source,
Node dest,
int id)
adds a new edge to the database and return its ID. |
void |
createEmpty()
|
int |
createUndirectedEdge(Node source,
Node dest)
adds a new edge to the database and return its ID. |
int |
createUndirectedEdge(Node source,
Node dest,
int id)
adds a new edge to the database and return its ID. |
void |
exportGDF(String filename)
|
void |
fillSchema(EdgeSchema ns,
Graph g)
This usually gets called once to add the fields alrady present for nodes that the database knows about. |
void |
fillSchema(NodeSchema ns,
Graph g)
This usually gets called once to add the fields alrady present for nodes that the database knows about. |
void |
findMatchingEdges(Query q)
find all matching edges for query q, q will be modified to hold the results |
void |
findMatchingNodes(Query q)
find all matching nodes for query q, q will be modified to hold the results |
Object |
getColumn(Edge e,
Field f)
returns the value of Field f in for Edge n |
Object |
getColumn(Edge e,
Field f,
int state)
returns the value of Field f in for Edge n |
Object |
getColumn(Edge e,
Field f,
String state)
returns the value of Field f in for Edge n |
Object |
getColumn(Node n,
Field f)
returns the value of Field f in for Node n |
Object |
getColumn(Node n,
Field f,
int state)
returns the value of Field f in for Node n |
Object |
getColumn(Node n,
Field f,
String state)
returns the value of Field f in for Node n |
Object[] |
getColumns(Edge e,
Field[] f)
returns the value of Field[] f in for Edge n |
Object[] |
getColumns(Edge e,
Field[] f,
int state)
returns the value of Field[] f in for Edge n |
Object[] |
getColumns(Edge e,
Field[] f,
String state)
returns the value of Field[] f in for Edge n |
Object[] |
getColumns(Node n,
Field[] f)
returns the value of Field[] f in for Node n |
Object[] |
getColumns(Node n,
Field[] f,
int state)
returns the value of Field[] f in for Node n |
Object[] |
getColumns(Node n,
Field[] f,
String state)
returns the value of Field[] f in for Node n |
Vector |
getEdgesNotInCurrent(Graph g,
int statenum)
|
Vector |
getEdgesNotInCurrent(Graph g,
String statenum)
|
AbstractTableModel |
getEdgeTable()
|
Vector |
getNodesNotInCurrent(Graph g,
int statenum)
|
Vector |
getNodesNotInCurrent(Graph g,
String statenum)
|
AbstractTableModel |
getNodeTable()
|
Set |
getStates()
|
Object |
getStatistic(Field f,
String statType)
|
void |
loadFromFile(String file)
|
void |
loadFromText(String text)
|
void |
loadState(Graph g,
int state)
|
void |
loadState(Graph g,
String state)
|
void |
loadState(int state)
|
void |
loadState(String state)
|
void |
refresh(Graph g)
call this to load up all the nodes/edges from the database into the graph. |
void |
remove(Edge edge)
|
void |
remove(Node node)
|
void |
removeComplete(Edge edge)
|
void |
removeComplete(Node node)
|
void |
saveState(int state)
|
void |
saveState(String state)
|
void |
shutdown()
shutdown operator, once you call this don't assume you can do anything with the StorageListener |
void |
undelete(Edge edge)
|
void |
undelete(Node node)
|
void |
updateColumn(Edge e,
Field f,
Object value)
call this to update the value for field f for Edge n. |
void |
updateColumn(Node n,
Field f,
Object value)
call this to update the value for field f for Node n. |
| Method Detail |
public void findMatchingNodes(Query q)
q - the query to evaluatepublic void findMatchingEdges(Query q)
q - the query to evaluate
public void fillSchema(NodeSchema ns,
Graph g)
com.hp.hpl.Schema#addFieldToSL(Field),
#addFieldToSL(Field);
public void fillSchema(EdgeSchema ns,
Graph g)
com.hp.hpl.Schema#addFieldToSL(Field),
#addFieldToSL(Field);
public void updateColumn(Node n,
Field f,
Object value)
n - the node that is being modifiedf - the field that you want changed (e.g. column)value - the new value
public void updateColumn(Edge e,
Field f,
Object value)
e - the edge that is being modifiedf - the field that you want changed (e.g. column)value - the new valuepublic void refresh(Graph g)
g - the graph to load the results intopublic void addField(Field f)
f - the field to addpublic void shutdown()
public Object getColumn(Node n,
Field f)
n - the node you want the result forf - the field
public Object getColumn(Edge e,
Field f)
f - the field
public Object getColumn(Node n,
Field f,
String state)
n - the node you want the result forf - the fieldstate - the state to retrieve from
public Object getColumn(Edge e,
Field f,
String state)
f - the fieldstate - the state to retrieve from
public Object getColumn(Node n,
Field f,
int state)
n - the node you want the result forf - the fieldstate - the state to retrieve from
public Object getColumn(Edge e,
Field f,
int state)
f - the fieldstate - the state to retrieve from
public Object[] getColumns(Node n,
Field[] f)
n - the node you want the result forf - the field
public Object[] getColumns(Edge e,
Field[] f)
f - the field
public Object[] getColumns(Node n,
Field[] f,
String state)
n - the node you want the result forf - the fieldstate - the state to retrieve from
public Object[] getColumns(Edge e,
Field[] f,
String state)
f - the fieldstate - the state to retrieve from
public Object[] getColumns(Node n,
Field[] f,
int state)
n - the node you want the result forf - the fieldstate - the state to retrieve from
public Object[] getColumns(Edge e,
Field[] f,
int state)
f - the fieldstate - the state to retrieve from
public int createDirectedEdge(Node source,
Node dest)
public int createUndirectedEdge(Node source,
Node dest)
public int createDirectedEdge(Node source,
Node dest,
int id)
public int createUndirectedEdge(Node source,
Node dest,
int id)
public void addNode(Node node)
public void undelete(Node node)
public void undelete(Edge edge)
public void remove(Node node)
public void remove(Edge edge)
public void removeComplete(Node node)
public void removeComplete(Edge edge)
public void loadState(Graph g,
int state)
public void loadState(Graph g,
String state)
public void loadState(String state)
public void loadState(int state)
public void saveState(int state)
public void saveState(String state)
public Object getStatistic(Field f,
String statType)
public void loadFromText(String text)
public void loadFromFile(String file)
public void createEmpty()
public Set getStates()
public Vector getEdgesNotInCurrent(Graph g,
int statenum)
public Vector getEdgesNotInCurrent(Graph g,
String statenum)
public Vector getNodesNotInCurrent(Graph g,
int statenum)
public Vector getNodesNotInCurrent(Graph g,
String statenum)
public AbstractTableModel getNodeTable()
public AbstractTableModel getEdgeTable()
public boolean containsEdge(Edge e,
String st)
public boolean containsEdge(Edge e)
public boolean containsNode(Node n,
String st)
public boolean containsNode(Node n)
public void addEdge(Edge e)
public void exportGDF(String filename)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||