org.mindswap.pellet.jena
Class DisjointMultiUnion
java.lang.Object
com.hp.hpl.jena.graph.impl.GraphBase
com.hp.hpl.jena.graph.compose.CompositionBase
com.hp.hpl.jena.graph.compose.Polyadic
com.hp.hpl.jena.graph.compose.MultiUnion
org.mindswap.pellet.jena.DisjointMultiUnion
- All Implemented Interfaces:
- com.hp.hpl.jena.graph.Graph, com.hp.hpl.jena.graph.GraphAdd, com.hp.hpl.jena.graph.GraphListener, com.hp.hpl.jena.graph.impl.GraphWithPerform
public class DisjointMultiUnion
- extends com.hp.hpl.jena.graph.compose.MultiUnion
- implements com.hp.hpl.jena.graph.GraphListener
An extension to MultiUnion graph that may return repeated triples from find function. When
big composite graphs are being loaded to Pellet, filtering results to return unique triples
is slowing things down whereas having triples repeated has less impact on the performance.
- Author:
- Evren Sirin
Fields inherited from interface com.hp.hpl.jena.graph.Graph |
emptyGraph |
Method Summary |
void |
addGraph(com.hp.hpl.jena.graph.Graph graph)
|
com.hp.hpl.jena.util.iterator.ExtendedIterator |
graphBaseFind(com.hp.hpl.jena.graph.TripleMatch t)
|
boolean |
isEmpty()
|
boolean |
isStatementDeleted()
|
DisjointMultiUnion |
minus(DisjointMultiUnion other)
|
void |
notifyAddArray(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Triple[] triples)
|
void |
notifyAddGraph(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Graph added)
|
void |
notifyAddIterator(com.hp.hpl.jena.graph.Graph g,
java.util.Iterator it)
|
void |
notifyAddList(com.hp.hpl.jena.graph.Graph g,
java.util.List triples)
|
void |
notifyAddTriple(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Triple t)
|
void |
notifyDeleteArray(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Triple[] triples)
|
void |
notifyDeleteGraph(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Graph removed)
|
void |
notifyDeleteIterator(com.hp.hpl.jena.graph.Graph g,
java.util.Iterator it)
|
void |
notifyDeleteList(com.hp.hpl.jena.graph.Graph g,
java.util.List L)
|
void |
notifyDeleteTriple(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Triple t)
|
void |
notifyEvent(com.hp.hpl.jena.graph.Graph source,
java.lang.Object value)
|
void |
releaseListeners()
|
void |
resetChanged()
|
Methods inherited from class com.hp.hpl.jena.graph.compose.MultiUnion |
getReifier, graphBaseContains, performAdd, performDelete |
Methods inherited from class com.hp.hpl.jena.graph.compose.Polyadic |
close, dependsOn, getBaseGraph, getBulkUpdateHandler, getCapabilities, getPrefixMapping, getRequiredBaseGraph, getSubGraphs, getTransactionHandler, removeGraph, setBaseGraph |
Methods inherited from class com.hp.hpl.jena.graph.compose.CompositionBase |
butNot, countIterator, graphBaseSize, ifIn, ifIn, recording, reject, rejecting, rejecting |
Methods inherited from class com.hp.hpl.jena.graph.impl.GraphBase |
add, contains, contains, delete, find, find, forTestingOnly_graphBaseFind, getEventManager, isIsomorphicWith, notifyAdd, notifyDelete, queryHandler, size, toString, toString |
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
DisjointMultiUnion
public DisjointMultiUnion()
DisjointMultiUnion
public DisjointMultiUnion(boolean listenChanges)
DisjointMultiUnion
public DisjointMultiUnion(com.hp.hpl.jena.graph.Graph graph)
isEmpty
public boolean isEmpty()
- Specified by:
isEmpty
in interface com.hp.hpl.jena.graph.Graph
- Overrides:
isEmpty
in class com.hp.hpl.jena.graph.impl.GraphBase
graphBaseFind
public com.hp.hpl.jena.util.iterator.ExtendedIterator graphBaseFind(com.hp.hpl.jena.graph.TripleMatch t)
- Overrides:
graphBaseFind
in class com.hp.hpl.jena.graph.compose.MultiUnion
addGraph
public void addGraph(com.hp.hpl.jena.graph.Graph graph)
- Overrides:
addGraph
in class com.hp.hpl.jena.graph.compose.MultiUnion
releaseListeners
public void releaseListeners()
notifyAddTriple
public void notifyAddTriple(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Triple t)
- Specified by:
notifyAddTriple
in interface com.hp.hpl.jena.graph.GraphListener
notifyAddArray
public void notifyAddArray(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Triple[] triples)
- Specified by:
notifyAddArray
in interface com.hp.hpl.jena.graph.GraphListener
notifyAddList
public void notifyAddList(com.hp.hpl.jena.graph.Graph g,
java.util.List triples)
- Specified by:
notifyAddList
in interface com.hp.hpl.jena.graph.GraphListener
notifyAddIterator
public void notifyAddIterator(com.hp.hpl.jena.graph.Graph g,
java.util.Iterator it)
- Specified by:
notifyAddIterator
in interface com.hp.hpl.jena.graph.GraphListener
notifyAddGraph
public void notifyAddGraph(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Graph added)
- Specified by:
notifyAddGraph
in interface com.hp.hpl.jena.graph.GraphListener
notifyDeleteTriple
public void notifyDeleteTriple(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Triple t)
- Specified by:
notifyDeleteTriple
in interface com.hp.hpl.jena.graph.GraphListener
notifyDeleteList
public void notifyDeleteList(com.hp.hpl.jena.graph.Graph g,
java.util.List L)
- Specified by:
notifyDeleteList
in interface com.hp.hpl.jena.graph.GraphListener
notifyDeleteArray
public void notifyDeleteArray(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Triple[] triples)
- Specified by:
notifyDeleteArray
in interface com.hp.hpl.jena.graph.GraphListener
notifyDeleteIterator
public void notifyDeleteIterator(com.hp.hpl.jena.graph.Graph g,
java.util.Iterator it)
- Specified by:
notifyDeleteIterator
in interface com.hp.hpl.jena.graph.GraphListener
notifyDeleteGraph
public void notifyDeleteGraph(com.hp.hpl.jena.graph.Graph g,
com.hp.hpl.jena.graph.Graph removed)
- Specified by:
notifyDeleteGraph
in interface com.hp.hpl.jena.graph.GraphListener
notifyEvent
public void notifyEvent(com.hp.hpl.jena.graph.Graph source,
java.lang.Object value)
- Specified by:
notifyEvent
in interface com.hp.hpl.jena.graph.GraphListener
isStatementDeleted
public boolean isStatementDeleted()
resetChanged
public void resetChanged()
minus
public DisjointMultiUnion minus(DisjointMultiUnion other)
Copyright © 2007-2009 Natalya Keberle. All Rights Reserved.