public class SimpleUnion
extends com.hp.hpl.jena.graph.compose.Polyadic
| Constructor and Description |
|---|
SimpleUnion(Iterable<com.hp.hpl.jena.graph.Graph> graphs) |
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
graphBaseContains(com.hp.hpl.jena.graph.Triple t) |
protected com.hp.hpl.jena.util.iterator.ExtendedIterator<com.hp.hpl.jena.graph.Triple> |
graphBaseFind(com.hp.hpl.jena.graph.TripleMatch m) |
boolean |
isEmpty() |
addGraph, close, dependsOn, getBaseGraph, getBulkUpdateHandler, getCapabilities, getPrefixMapping, getRequiredBaseGraph, getSubGraphs, getTransactionHandler, removeGraph, setBaseGraphbutNot, ifIn, ifIn, recording, reject, rejecting, rejectingadd, checkOpen, constructReifier, contains, contains, containsByFind, createStatisticsHandler, delete, find, find, forTestingOnly_graphBaseFind, getEventManager, getReifier, getStatisticsHandler, graphBaseFind, graphBaseSize, isClosed, isIsomorphicWith, notifyAdd, notifyDelete, performAdd, performDelete, queryHandler, reifierContains, reifierSize, reifierTriples, size, toString, toStringpublic SimpleUnion(Iterable<com.hp.hpl.jena.graph.Graph> graphs)
graphs - protected com.hp.hpl.jena.util.iterator.ExtendedIterator<com.hp.hpl.jena.graph.Triple> graphBaseFind(com.hp.hpl.jena.graph.TripleMatch m)
graphBaseFind in class com.hp.hpl.jena.graph.impl.GraphBaseprotected boolean graphBaseContains(com.hp.hpl.jena.graph.Triple t)
graphBaseContains in class com.hp.hpl.jena.graph.impl.GraphBasepublic boolean isEmpty()
isEmpty in interface com.hp.hpl.jena.graph.GraphisEmpty in class com.hp.hpl.jena.graph.impl.GraphBaseCopyright © 2013. All Rights Reserved.