Uses of Interface
org.mulgara.mrg.Graph

Packages that use Graph

org.mulgara.mrg
org.mulgara.mrg.writer

Uses of Graph in org.mulgara.mrg

Subinterfaces of Graph in org.mulgara.mrg

interface	AppendableGraph An RDF graph that triples can be added to.
interface	WritableGraph An RDF graph that triples can be modified on.

Classes in org.mulgara.mrg that implement Graph

class	AbstractGraph An RDF graph.
class	AbstractGraphExt This class groups all the overloaded methods for Graph together, and keeps them out of the way of the Graph implementation.
class	GraphImpl A hashmap based RDF graph.
class	IndexedGraph A graph with three indexes for complete searchability.
class	PackedGraphImpl A graph that uses tree sets and maps to keep the memory footprint smaller.
class	PackedIndexedGraph A fully indexed graph with tree indexes.

Methods in org.mulgara.mrg that return Graph

Graph	Graph.matchSubgraph(SubjectNode s, PredicateNode p, ObjectNode o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraph.matchSubgraph(SubjectNode s, PredicateNode p, ObjectNode o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	GraphExt.matchSubgraphX(String s, PredicateNode p, ObjectNode o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(String s, PredicateNode p, ObjectNode o)
Graph	GraphExt.matchSubgraphX(String s, PredicateNode p, String o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(String s, PredicateNode p, String o)
Graph	GraphExt.matchSubgraphX(String s, PredicateNode p, URI o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(String s, PredicateNode p, URI o)
Graph	GraphExt.matchSubgraphX(String s, String p, ObjectNode o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(String s, String p, ObjectNode o)
Graph	GraphExt.matchSubgraphX(String s, String p, String o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(String s, String p, String o)
Graph	GraphExt.matchSubgraphX(String s, String p, URI o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(String s, String p, URI o)
Graph	GraphExt.matchSubgraphX(String s, URI p, ObjectNode o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(String s, URI p, ObjectNode o)
Graph	GraphExt.matchSubgraphX(String s, URI p, String o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(String s, URI p, String o)
Graph	GraphExt.matchSubgraphX(String s, URI p, URI o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(String s, URI p, URI o)
Graph	GraphExt.matchSubgraphX(SubjectNode s, PredicateNode p, String o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(SubjectNode s, PredicateNode p, String o)
Graph	GraphExt.matchSubgraphX(SubjectNode s, PredicateNode p, URI o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(SubjectNode s, PredicateNode p, URI o)
Graph	GraphExt.matchSubgraphX(SubjectNode s, String p, ObjectNode o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(SubjectNode s, String p, ObjectNode o)
Graph	GraphExt.matchSubgraphX(SubjectNode s, String p, String o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(SubjectNode s, String p, String o)
Graph	GraphExt.matchSubgraphX(SubjectNode s, String p, URI o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(SubjectNode s, String p, URI o)
Graph	GraphExt.matchSubgraphX(SubjectNode s, URI p, ObjectNode o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(SubjectNode s, URI p, ObjectNode o)
Graph	GraphExt.matchSubgraphX(SubjectNode s, URI p, String o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(SubjectNode s, URI p, String o)
Graph	GraphExt.matchSubgraphX(SubjectNode s, URI p, URI o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(SubjectNode s, URI p, URI o)
Graph	GraphExt.matchSubgraphX(URI s, PredicateNode p, ObjectNode o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(URI s, PredicateNode p, ObjectNode o)
Graph	GraphExt.matchSubgraphX(URI s, PredicateNode p, String o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(URI s, PredicateNode p, String o)
Graph	GraphExt.matchSubgraphX(URI s, PredicateNode p, URI o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(URI s, PredicateNode p, URI o)
Graph	GraphExt.matchSubgraphX(URI s, String p, ObjectNode o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(URI s, String p, ObjectNode o)
Graph	GraphExt.matchSubgraphX(URI s, String p, String o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(URI s, String p, String o)
Graph	GraphExt.matchSubgraphX(URI s, String p, URI o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(URI s, String p, URI o)
Graph	GraphExt.matchSubgraphX(URI s, URI p, ObjectNode o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(URI s, URI p, ObjectNode o)
Graph	GraphExt.matchSubgraphX(URI s, URI p, String o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(URI s, URI p, String o)
Graph	GraphExt.matchSubgraphX(URI s, URI p, URI o) Returns a subgraph of this graph that only contains the triples that match a given pattern.
Graph	AbstractGraphExt.matchSubgraphX(URI s, URI p, URI o)
Graph	AppendableGraph.mergeInto(Graph g) Adds the contents of another graph to this one, creating new blank nodes as required (not re-using the blank nodes from the original graph).
Graph	AbstractGraph.mergeInto(Graph g) Adds the contents of another graph to this one, creating new blank nodes as required (not re-using the blank nodes from the original graph).
Graph	AppendableGraph.unionInto(Graph g) Adds the contents of another graph to this one, re-using all the blank nodes from the new graph.
Graph	AbstractGraph.unionInto(Graph g) Adds the contents of another graph to this one, re-using all the blank nodes from the new graph.

Methods in org.mulgara.mrg with parameters of type Graph

Graph	AppendableGraph.mergeInto(Graph g) Adds the contents of another graph to this one, creating new blank nodes as required (not re-using the blank nodes from the original graph).
Graph	AbstractGraph.mergeInto(Graph g) Adds the contents of another graph to this one, creating new blank nodes as required (not re-using the blank nodes from the original graph).
Graph	AppendableGraph.unionInto(Graph g) Adds the contents of another graph to this one, re-using all the blank nodes from the new graph.
Graph	AbstractGraph.unionInto(Graph g) Adds the contents of another graph to this one, re-using all the blank nodes from the new graph.

Uses of Graph in org.mulgara.mrg.writer

Fields in org.mulgara.mrg.writer declared as Graph

protected Graph

AbstractGraphWriter.graph The graph to be emitted.

Constructors in org.mulgara.mrg.writer with parameters of type Graph

AbstractGraphWriter(Graph graph, URI base)
Create a graph writer with an empty namespace map.

AbstractGraphWriter(Graph graph, URI base, Map<String,URI> ns)
Create a graph writer with a specified namespace map.

N3Writer(Graph graph, URI base)
Creates a graph writer.

N3Writer(Graph graph, URI base, Map<String,URI> ns)
Creates a graph writer.

XMLWriter(Graph graph, URI base)
Creates a graph writer.

XMLWriter(Graph graph, URI base, Map<String,URI> ns)
Creates a graph writer.