| java.lang.Object
 com.hp.hpl.jena.graph.impl.SimpleEventManager
| SimpleEventManager | | public class SimpleEventManager implements GraphEventManager(Code) | | Simple implementation of GraphEventManager for GraphBase to use.
The listeners are held as an [Array]List.
The code duplication is a right pain. The most natural removal tactic, a
meta-method that took the notification method as an argument, is not
available in Java, and I can't off-hand think of a clean alternative.
This class also holds the utility method notifyingRemove, which wraps
iterators so that their .remove() operation notifies the specified graph of
the removal.
author:
hedgehog |
| Method Summary | |
| public boolean | listening()
| | public void | notifyAddArray(Graph g, Triple[] ts)
| | public void | notifyAddGraph(Graph g, Graph added)
| | public void | notifyAddIterator(Graph g, List it)
| | public void | notifyAddIterator(Graph g, Iterator it)
| | public void | notifyAddList(Graph g, List L)
| | public void | notifyAddTriple(Graph g, Triple t)
| | public void | notifyDeleteArray(Graph g, Triple[] ts)
| | public void | notifyDeleteGraph(Graph g, Graph removed)
| | public void | notifyDeleteIterator(Graph g, List L)
| | public void | notifyDeleteIterator(Graph g, Iterator it)
| | public void | notifyDeleteList(Graph g, List L)
| | public void | notifyDeleteTriple(Graph g, Triple t)
| | public void | notifyEvent(Graph source, Object event)
| | public static ExtendedIterator | notifyingRemove(Graph g, Iterator i)
Answer an iterator which wraps i to ensure that if a .remove()
is executed on it, the graph g will be notified. | | public GraphEventManager | register(GraphListener listener)
| | public GraphEventManager | unregister(GraphListener listener)
|
| SimpleEventManager | | public SimpleEventManager(Graph graph)(Code) | | |
| listening | | public boolean listening()(Code) | | |
| notifyDeleteIterator | | public void notifyDeleteIterator(Graph g, List L)(Code) | | |
| notifyingRemove | | public static ExtendedIterator notifyingRemove(Graph g, Iterator i)(Code) | | Answer an iterator which wraps i to ensure that if a .remove()
is executed on it, the graph g will be notified.
|
|
|