|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectcom.hp.hpl.guess.storage.DumbStorage
| Constructor Summary | |
DumbStorage()
|
|
| 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 graph)
This usually gets called once to add the fields alrady present for nodes that the database knows about. |
void |
fillSchema(NodeSchema ns,
Graph graph)
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 s)
returns the value of Field f in for Edge n |
Object |
getColumn(Edge e,
Field f,
String s)
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 s)
returns the value of Field f in for Node n |
Object |
getColumn(Node n,
Field f,
String s)
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 s)
returns the value of Field[] f in for Edge n |
Object[] |
getColumns(Edge e,
Field[] f,
String s)
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 s)
returns the value of Field[] f in for Node n |
Object[] |
getColumns(Node n,
Field[] f,
String s)
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. |
| Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public DumbStorage()
| Method Detail |
public void findMatchingNodes(Query q)
StorageListener
findMatchingNodes in interface StorageListenerq - the query to evaluatepublic void findMatchingEdges(Query q)
StorageListener
findMatchingEdges in interface StorageListenerq - the query to evaluate
public void fillSchema(NodeSchema ns,
Graph graph)
StorageListener
fillSchema in interface StorageListenercom.hp.hpl.Schema#addFieldToSL(Field),
#addFieldToSL(Field);
public void fillSchema(EdgeSchema ns,
Graph graph)
StorageListener
fillSchema in interface StorageListenercom.hp.hpl.Schema#addFieldToSL(Field),
#addFieldToSL(Field);
public void updateColumn(Node n,
Field f,
Object value)
StorageListener
updateColumn in interface StorageListenern - 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)
StorageListener
updateColumn in interface StorageListenere - the edge that is being modifiedf - the field that you want changed (e.g. column)value - the new value
public Object getColumn(Node n,
Field f)
StorageListener
getColumn in interface StorageListenern - the node you want the result forf - the field
public Object getColumn(Edge e,
Field f)
StorageListener
getColumn in interface StorageListenerf - the field
public Object getColumn(Node n,
Field f,
String s)
StorageListener
getColumn in interface StorageListenern - the node you want the result forf - the fields - the state to retrieve from
public Object getColumn(Edge e,
Field f,
String s)
StorageListener
getColumn in interface StorageListenerf - the fields - the state to retrieve from
public Object getColumn(Node n,
Field f,
int s)
StorageListener
getColumn in interface StorageListenern - the node you want the result forf - the fields - the state to retrieve from
public Object getColumn(Edge e,
Field f,
int s)
StorageListener
getColumn in interface StorageListenerf - the fields - the state to retrieve from
public Object[] getColumns(Node n,
Field[] f)
StorageListener
getColumns in interface StorageListenern - the node you want the result forf - the field
public Object[] getColumns(Edge e,
Field[] f)
StorageListener
getColumns in interface StorageListenerf - the field
public Object[] getColumns(Node n,
Field[] f,
String s)
StorageListener
getColumns in interface StorageListenern - the node you want the result forf - the fields - the state to retrieve from
public Object[] getColumns(Edge e,
Field[] f,
String s)
StorageListener
getColumns in interface StorageListenerf - the fields - the state to retrieve from
public Object[] getColumns(Node n,
Field[] f,
int s)
StorageListener
getColumns in interface StorageListenern - the node you want the result forf - the fields - the state to retrieve from
public Object[] getColumns(Edge e,
Field[] f,
int s)
StorageListener
getColumns in interface StorageListenerf - the fields - the state to retrieve frompublic void refresh(Graph g)
StorageListener
refresh in interface StorageListenerg - the graph to load the results intopublic void shutdown()
StorageListener
shutdown in interface StorageListenerpublic void addField(Field f)
StorageListener
addField in interface StorageListenerf - the field to add
public int createDirectedEdge(Node source,
Node dest)
StorageListener
createDirectedEdge in interface StorageListener
public int createUndirectedEdge(Node source,
Node dest)
StorageListener
createUndirectedEdge in interface StorageListener
public int createDirectedEdge(Node source,
Node dest,
int id)
StorageListener
createDirectedEdge in interface StorageListener
public int createUndirectedEdge(Node source,
Node dest,
int id)
StorageListener
createUndirectedEdge in interface StorageListenerpublic void addNode(Node node)
addNode in interface StorageListenerpublic void remove(Edge edge)
remove in interface StorageListenerpublic void remove(Node node)
remove in interface StorageListenerpublic void removeComplete(Edge edge)
removeComplete in interface StorageListenerpublic void removeComplete(Node node)
removeComplete in interface StorageListenerpublic void undelete(Node node)
undelete in interface StorageListenerpublic void undelete(Edge edge)
undelete in interface StorageListener
public void loadState(Graph g,
int state)
loadState in interface StorageListener
public void loadState(Graph g,
String state)
loadState in interface StorageListenerpublic void loadState(int state)
loadState in interface StorageListenerpublic void loadState(String state)
loadState in interface StorageListenerpublic void saveState(int state)
saveState in interface StorageListenerpublic void saveState(String state)
saveState in interface StorageListener
public Vector getEdgesNotInCurrent(Graph g,
int statenum)
getEdgesNotInCurrent in interface StorageListener
public Vector getEdgesNotInCurrent(Graph g,
String statenum)
getEdgesNotInCurrent in interface StorageListener
public Vector getNodesNotInCurrent(Graph g,
int statenum)
getNodesNotInCurrent in interface StorageListener
public Vector getNodesNotInCurrent(Graph g,
String statenum)
getNodesNotInCurrent in interface StorageListenerpublic AbstractTableModel getNodeTable()
getNodeTable in interface StorageListenerpublic AbstractTableModel getEdgeTable()
getEdgeTable in interface StorageListener
public Object getStatistic(Field f,
String statType)
getStatistic in interface StorageListenerpublic void loadFromText(String text)
loadFromText in interface StorageListenerpublic void loadFromFile(String file)
loadFromFile in interface StorageListenerpublic void createEmpty()
createEmpty in interface StorageListenerpublic Set getStates()
getStates in interface StorageListenerpublic boolean containsEdge(Edge e)
containsEdge in interface StorageListener
public boolean containsEdge(Edge e,
String st)
containsEdge in interface StorageListener
public boolean containsNode(Node n,
String st)
containsNode in interface StorageListenerpublic boolean containsNode(Node n)
containsNode in interface StorageListenerpublic void addEdge(Edge e)
addEdge in interface StorageListenerpublic void exportGDF(String filename)
exportGDF in interface StorageListener
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||