Package | Description |
---|---|
com.hp.hpl.jena.graph |
This package defines the Graph and Node family of classes, which
form the underlying datatypes of the Jena system.
|
com.hp.hpl.jena.graph.compose |
This package defines simple composite graphs - union, intersection,
difference, and update-tracking.
|
com.hp.hpl.jena.rdf.model |
A package for creating and manipulating RDF graphs.
|
com.hp.hpl.jena.reasoner |
The Jena2 reasoner subsystem is designed to allow a range of inference
engines to be plugged into Jena.
|
com.hp.hpl.jena.reasoner.rulesys |
Provides a selection of simple rule engines for Jena inference models.
|
com.hp.hpl.jena.reasoner.transitiveReasoner |
This package contains a reasoner which supports transitive-reflexive closure
of subPropertyOf and subClassOf relations.
|
com.hp.hpl.jena.shared |
This package defines some classes common to the Jena API
and SPI levels, in particular the JenaException class from which
all Jena-specific exceptions hang, and the interface PrefixMapping
for translation to and from QNames.
|
com.hp.hpl.jena.util |
Miscellaneous collection of utility classes.
|
Modifier and Type | Field and Description |
---|---|
static Triple |
Triple.ANY
A Triple that is wildcarded in all fields.
|
Modifier and Type | Field and Description |
---|---|
static com.hp.hpl.jena.util.iterator.Map1<Triple,Node> |
Triple.getObject |
static com.hp.hpl.jena.util.iterator.Map1<Triple,Node> |
Triple.getPredicate |
static com.hp.hpl.jena.util.iterator.Map1<Triple,Node> |
Triple.getSubject |
static com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
Triple.None
A triple-iterator with no elements.
|
Modifier and Type | Method and Description |
---|---|
Triple |
Triple.asTriple() |
Triple |
TripleMatch.asTriple()
Answer a Triple capturing this match.
|
Triple |
FrontsTriple.asTriple() |
static Triple |
Triple.create(Node s,
Node p,
Node o) |
static Triple |
Triple.createMatch(Node s,
Node p,
Node o) |
Triple |
GraphEvents.getTriple()
A fluid triple relevant to the event, or null if not applicable.
|
Triple |
GetTriple.getTriple(Node n)
Answer the triple associated with the node
n . |
Triple |
TripleIterator.nextTriple()
Answer the next() element cast to Triple.
|
Modifier and Type | Method and Description |
---|---|
abstract com.hp.hpl.jena.util.iterator.Filter<Triple> |
Triple.Field.filterOn(Node n) |
com.hp.hpl.jena.util.iterator.Filter<Triple> |
Triple.Field.filterOn(Triple t) |
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
Graph.find(Node s,
Node p,
Node o)
Returns an iterator over Triple.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
Graph.find(TripleMatch m)
Returns an iterator over all the Triples that match the triple pattern.
|
static com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
GraphUtil.findAll(Graph g)
Answer an iterator covering all the triples in the specified graph.
|
Modifier and Type | Method and Description |
---|---|
boolean |
TripleMatchFilter.accept(Triple t)
The object is wanted.
|
static void |
GraphUtil.add(Graph graph,
Triple[] triples) |
void |
Graph.add(Triple t)
Add the triple t (if possible) to the set belonging to this graph
|
void |
GraphAdd.add(Triple t)
Add the triple t (if possible) to the set belonging to this graph
|
void |
BulkUpdateHandler.add(Triple[] triples)
Deprecated.
See GraphUtil for helper functions for migration.
|
boolean |
Graph.contains(Triple t)
Answer true iff the graph contains a triple that t matches; t may be
fluid.
|
static void |
GraphUtil.delete(Graph graph,
Triple[] triples) |
void |
Graph.delete(Triple t)
Delete the triple t (if possible) from the set belonging to this graph
|
void |
BulkUpdateHandler.delete(Triple[] triples)
Deprecated.
See GraphUtil for helper functions for migration.
|
com.hp.hpl.jena.util.iterator.Filter<Triple> |
Triple.Field.filterOn(Triple t) |
abstract Node |
Triple.Field.getField(Triple t) |
boolean |
Triple.matches(Triple other) |
void |
GraphListener.notifyAddArray(Graph g,
Triple[] triples)
Method called when an array of triples has been added to the graph.
|
void |
GraphListener.notifyAddTriple(Graph g,
Triple t)
Method called when a single triple has been added to the graph.
|
void |
GraphListener.notifyDeleteArray(Graph g,
Triple[] triples)
Method called when an array of triples has been deleted from the graph.
|
void |
GraphListener.notifyDeleteTriple(Graph g,
Triple t)
Method called when a single triple has been deleted from the graph.
|
boolean |
TripleBoundary.stopAt(Triple t)
Answer true if this triple is a stopping triple, and whatever search is using
this interface should proceed no further.
|
Modifier and Type | Method and Description |
---|---|
static void |
GraphUtil.add(Graph graph,
Iterator<Triple> it) |
static void |
GraphUtil.add(Graph graph,
List<Triple> triples) |
void |
BulkUpdateHandler.add(Iterator<Triple> it)
Deprecated.
See GraphUtil for helper functions for migration.
|
void |
BulkUpdateHandler.add(List<Triple> triples)
Deprecated.
See GraphUtil for helper functions for migration.
|
static void |
GraphUtil.delete(Graph graph,
Iterator<Triple> it) |
static void |
GraphUtil.delete(Graph graph,
List<Triple> triples) |
void |
BulkUpdateHandler.delete(Iterator<Triple> it)
Deprecated.
See GraphUtil for helper functions for migration.
|
void |
BulkUpdateHandler.delete(List<Triple> triples)
Deprecated.
See GraphUtil for helper functions for migration.
|
void |
GraphListener.notifyAddIterator(Graph g,
Iterator<Triple> it)
Method called when an iterator [of triples] has been added to the graph
|
void |
GraphEventManager.notifyAddIterator(Graph g,
List<Triple> triples)
Notify all attached listeners that an iterator [of triples] has been added to
the graph; its content has been captured in the list
triples . |
void |
GraphListener.notifyAddList(Graph g,
List<Triple> triples)
Method called when a list [of triples] has been added to the graph.
|
void |
GraphListener.notifyDeleteIterator(Graph g,
Iterator<Triple> it)
Method called when an iterator [of triples] has been deleted from the graph.
|
void |
GraphEventManager.notifyDeleteIterator(Graph g,
List<Triple> triples)
Notify all attached listeners that an iterator [of triples] has been removed from
the graph; its content has been captured in the list
triples . |
void |
GraphListener.notifyDeleteList(Graph g,
List<Triple> L)
Method called when a list [of triples] has been deleted from the graph.
|
Constructor and Description |
---|
TripleMatchFilter(Triple tMatch)
Creates new TripleMatchFilter
|
TripleMatchIterator(Triple m,
Iterator<Triple> iter) |
Constructor and Description |
---|
TripleMatchIterator(Triple m,
Iterator<Triple> iter) |
Modifier and Type | Method and Description |
---|---|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
Difference._graphBaseFind(TripleMatch t)
Deprecated.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
MultiUnion.graphBaseFind(TripleMatch t)
Answer an iterator over the triples in the union of the graphs in this composition.
|
static com.hp.hpl.jena.util.iterator.Filter<Triple> |
CompositionBase.ifIn(Graph g)
Answer a
Filter that will accept any triple that is an edge of
graph g. |
static com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
CompositionBase.rejecting(com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> i,
Graph seen)
Answer an iterator over the elements of
i that are not in
the graph seen . |
static com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
CompositionBase.rejecting(com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> i,
Set<Triple> seen)
Answer an iterator over the elements of iterator i that are not in the set
seen . |
Modifier and Type | Method and Description |
---|---|
boolean |
MultiUnion.graphBaseContains(Triple t)
Answer true if at least one of the graphs in this union contain the given triple.
|
boolean |
DisjointUnion.graphBaseContains(Triple t) |
boolean |
Union.graphBaseContains(Triple t) |
void |
MultiUnion.performAdd(Triple t)
Add the given triple to the union model; the actual component model to
be updated will be the designated (or default) updateable graph.
|
void |
DisjointUnion.performAdd(Triple t) |
void |
Union.performAdd(Triple t)
To add a triple to the union, add it to the left operand; this is asymmetric.
|
void |
Difference.performAdd(Triple t)
Deprecated.
Add a triple to the difference: add it to the left operand, and remove it from the
right operand.
|
void |
Intersection.performAdd(Triple t)
Deprecated.
|
void |
Delta.performAdd(Triple t)
Deprecated.
Add the triple to the graph, ie add it to the additions, remove it from
the removals.
|
void |
MultiUnion.performDelete(Triple t)
Delete the given triple from the union model; the actual component model to
be updated will be the designated (or default) updateable graph.
|
void |
DisjointUnion.performDelete(Triple t) |
void |
Union.performDelete(Triple t)
To remove a triple, remove it from both operands.
|
void |
Difference.performDelete(Triple t)
Deprecated.
Remove a triple from the difference: remove it from the left operand.
|
void |
Intersection.performDelete(Triple t)
Deprecated.
|
void |
Delta.performDelete(Triple t)
Deprecated.
Remove the triple, ie, remove it from the adds, add it to the removals.
|
Modifier and Type | Method and Description |
---|---|
static com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
CompositionBase.rejecting(com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> i,
Graph seen)
Answer an iterator over the elements of
i that are not in
the graph seen . |
static com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
CompositionBase.rejecting(com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> i,
Set<Triple> seen)
Answer an iterator over the elements of iterator i that are not in the set
seen . |
static com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
CompositionBase.rejecting(com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> i,
Set<Triple> seen)
Answer an iterator over the elements of iterator i that are not in the set
seen . |
Modifier and Type | Method and Description |
---|---|
Statement |
ModelGraphInterface.asStatement(Triple t)
Answer a Statement in this Model who's SPO is that of the triple
t . |
Modifier and Type | Method and Description |
---|---|
Triple |
TriplePattern.asTriple()
Return the triple pattern as a triple
|
Modifier and Type | Method and Description |
---|---|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
BaseInfGraph.find(Node subject,
Node property,
Node object,
Graph param)
An extension of the Graph.find interface which allows the caller to
encode complex expressions in RDF and then refer to those expressions
within the query triple.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
InfGraph.find(Node subject,
Node property,
Node object,
Graph param)
An extension of the Graph.find interface which allows the caller to
encode complex expressions in RDF and then refer to those expressions
within the query triple.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
FGraph.find(TriplePattern pattern)
Basic pattern lookup interface.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
Finder.find(TriplePattern pattern)
Basic pattern lookup interface.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
BaseInfGraph.find(TriplePattern pattern)
Basic pattern lookup interface.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
FGraph.findWithContinuation(TriplePattern pattern,
Finder continuation)
Extended find interface used in situations where the implementator
may or may not be able to answer the complete query.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
Finder.findWithContinuation(TriplePattern pattern,
Finder continuation)
Extended find interface used in situations where the implementator
may or may not be able to answer the complete query.
|
abstract com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
BaseInfGraph.findWithContinuation(TriplePattern pattern,
Finder continuation)
Extended find interface used in situations where the implementator
may or may not be able to answer the complete query.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
BaseInfGraph.graphBaseFind(Node subject,
Node property,
Node object)
Returns an iterator over Triples.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
BaseInfGraph.graphBaseFind(TripleMatch m)
Returns an iterator over Triples.
|
Modifier and Type | Method and Description |
---|---|
Iterator<Derivation> |
BaseInfGraph.getDerivation(Triple triple)
Return the derivation of the given triple (which is the result of
some previous find operation).
|
Iterator<Derivation> |
InfGraph.getDerivation(Triple triple)
Return the derivation of the given triple (which is the result of
some previous find operation).
|
void |
BaseInfGraph.performAdd(Triple t)
Add one triple to the data graph, run any rules triggered by
the new data item, recursively adding any generated triples.
|
void |
BaseInfGraph.performDelete(Triple t)
Removes the triple t (if possible) from the set belonging to this graph.
|
static String |
TriplePattern.simplePrintString(Triple t)
Simplified printable name for a triple
|
Constructor and Description |
---|
TriplePattern(Triple match)
Constructor - builds a dgenerate pattern from a simple triple.
|
Modifier and Type | Field and Description |
---|---|
static com.hp.hpl.jena.util.iterator.Filter<Triple> |
Functor.acceptFilter
A static Filter instance that detects triples with Functor objects
|
Modifier and Type | Method and Description |
---|---|
Triple |
RuleDerivation.getConclusion() |
Triple |
BindingEnvironment.instantiate(TriplePattern pattern)
Instantiate a triple pattern against the current environment.
|
Modifier and Type | Method and Description |
---|---|
com.hp.hpl.jena.util.iterator.ClosableIterator<Triple> |
RuleContext.find(Node s,
Node p,
Node o)
In some formulations the context includes deductions that are not yet
visible to the underlying graph but need to be checked for.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
LPBackwardRuleInfGraph.find(TriplePattern pattern)
Basic pattern lookup interface.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
FBRuleInfGraph.find(TriplePattern pattern)
Basic pattern lookup interface.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
BasicForwardRuleInfGraph.find(TriplePattern pattern)
Basic pattern lookup interface.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
FBRuleInfGraph.findDataMatches(Node subject,
Node predicate,
Node object)
Search the combination of data and deductions graphs for the given triple pattern.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
BasicForwardRuleInfGraph.findDataMatches(Node subject,
Node predicate,
Node object)
Search the combination of data and deductions graphs for the given triple pattern.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
ForwardRuleInfGraphI.findDataMatches(Node subject,
Node predicate,
Node object)
Search the combination of data and deductions graphs for the given triple pattern.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
BackwardRuleInfGraphI.findDataMatches(TriplePattern pattern)
Match a pattern just against the stored data (raw data, schema,
axioms) but no backchaining derivation.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
LPBackwardRuleInfGraph.findDataMatches(TriplePattern pattern)
Match a pattern just against the stored data (raw data, schema,
axioms) but no derivation.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
FBRuleInfGraph.findDataMatches(TriplePattern pattern)
Search the combination of data and deductions graphs for the given triple pattern.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
FBRuleInfGraph.findFull(TriplePattern pattern)
Internal variant of find which omits the filters which block illegal RDF data.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
LPBackwardRuleInfGraph.findWithContinuation(TriplePattern pattern,
Finder continuation)
Extended find interface used in situations where the implementator
may or may not be able to answer the complete query.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
FBRuleInfGraph.findWithContinuation(TriplePattern pattern,
Finder continuation)
Extended find interface used in situations where the implementator
may or may not be able to answer the complete query.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
BasicForwardRuleInfGraph.findWithContinuation(TriplePattern pattern,
Finder continuation)
Extended find interface used in situations where the implementator
may or may not be able to answer the complete query.
|
List<Triple> |
RuleDerivation.getMatches() |
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
LPBackwardRuleInfGraph.graphBaseFind(Node subject,
Node property,
Node object)
Returns an iterator over Triples.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
FBRuleInfGraph.graphBaseFind(Node subject,
Node property,
Node object)
Returns an iterator over Triples.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
BasicForwardRuleInfGraph.graphBaseFind(Node subject,
Node property,
Node object)
Returns an iterator over Triples.
|
Modifier and Type | Method and Description |
---|---|
void |
RuleContext.add(Triple t)
Assert a new triple in the deduction graph, triggering any consequent processing as appropriate.
|
void |
FBRuleInfGraph.addDeduction(Triple t)
Add a new deduction to the deductions graph.
|
void |
BasicForwardRuleInfGraph.addDeduction(Triple t)
Add a new deduction to the deductions graph.
|
void |
ForwardRuleInfGraphI.addDeduction(Triple t)
Add a new deduction to the deductions graph.
|
ValidityReport.Report |
FBRuleInfGraph.checkLiteral(Node prop,
Triple triple)
Check a given literal value for a property against the set of
known range constraints for it.
|
boolean |
RuleContext.contains(Triple t)
Return true if the triple is already in either the graph or the stack.
|
Iterator<Derivation> |
LPBackwardRuleInfGraph.getDerivation(Triple t)
Return the derivation of at triple.
|
Iterator<Derivation> |
BasicForwardRuleInfGraph.getDerivation(Triple t)
Return the derivation of at triple.
|
void |
BackwardRuleInfGraphI.logDerivation(Triple t,
Derivation derivation)
Logger a dervivation record against the given triple.
|
void |
LPBackwardRuleInfGraph.logDerivation(Triple t,
Derivation derivation)
Log a dervivation record against the given triple.
|
void |
BasicForwardRuleInfGraph.logDerivation(Triple t,
Derivation derivation)
Log a dervivation record against the given triple.
|
void |
ForwardRuleInfGraphI.logDerivation(Triple t,
Derivation derivation)
Logger a dervivation record against the given triple.
|
boolean |
RulePreprocessHook.needsRerun(FBRuleInfGraph infGraph,
Triple t)
Validate a triple add to see if it should reinvoke the hook.
|
void |
LPBackwardRuleInfGraph.performAdd(Triple t)
Add one triple to the data graph, run any rules triggered by
the new data item, recursively adding any generated triples.
|
void |
FBRuleInfGraph.performAdd(Triple t)
Add one triple to the data graph, run any rules triggered by
the new data item, recursively adding any generated triples.
|
void |
RETERuleInfGraph.performAdd(Triple t)
Add one triple to the data graph, run any rules triggered by
the new data item, recursively adding any generated triples.
|
void |
BasicForwardRuleInfGraph.performAdd(Triple t)
Add one triple to the data graph, run any rules triggered by
the new data item, recursively adding any generated triples.
|
void |
LPBackwardRuleInfGraph.performDelete(Triple t)
Removes the triple t (if possible) from the set belonging to this graph.
|
void |
FBRuleInfGraph.performDelete(Triple t)
Removes the triple t (if possible) from the set belonging to this graph.
|
void |
RETERuleInfGraph.performDelete(Triple t)
Removes the triple t (if possible) from the set belonging to this graph.
|
void |
BasicForwardRuleInfGraph.performDelete(Triple t)
Removes the triple t (if possible) from the set belonging to this graph.
|
void |
RuleContext.remove(Triple t)
Remove a triple from the deduction graph (and the original graph if relevant).
|
void |
LPBackwardRuleInfGraph.silentAdd(Triple t)
Assert a new triple in the deduction graph, bypassing any processing machinery.
|
void |
RuleContext.silentAdd(Triple t)
Assert a new triple in the deduction graph, bypassing any processing machinery.
|
void |
SilentAddI.silentAdd(Triple t)
Assert a new triple in the deduction graph, bypassing any processing machinery.
|
void |
BasicForwardRuleInfGraph.silentAdd(Triple t)
Assert a new triple in the deduction graph, bypassing any processing machinery.
|
Constructor and Description |
---|
RuleDerivation(Rule rule,
Triple conclusion,
List<Triple> matches,
InfGraph infGraph)
Constructor
|
Constructor and Description |
---|
RuleDerivation(Rule rule,
Triple conclusion,
List<Triple> matches,
InfGraph infGraph)
Constructor
|
Modifier and Type | Method and Description |
---|---|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
TransitiveInfGraph.find(TriplePattern pattern)
Basic pattern lookup interface.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
TransitiveGraphCache.find(TriplePattern pattern)
Basic pattern lookup interface.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
TransitiveInfGraph.findWithContinuation(TriplePattern pattern,
Finder continuation)
Extended find interface used in situations where the implementator
may or may not be able to answer the complete query.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
TransitiveGraphCache.findWithContinuation(TriplePattern pattern,
Finder continuation)
Extended find interface used in situations where the implementator
may or may not be able to answer the complete query.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
TransitiveInfGraph.graphBaseFind(Node subject,
Node property,
Node object)
Returns an iterator over Triples.
|
Modifier and Type | Method and Description |
---|---|
boolean |
TransitiveEngine.add(Triple t)
Add one triple to caches if it is relevant.
|
void |
TransitiveGraphCache.addRelation(Triple t)
Register a new relation instance in the cache
|
boolean |
TransitiveEngine.delete(Triple t)
Removes the triple t (if relevant) from the caches.
|
void |
TransitiveInfGraph.performAdd(Triple t)
Add one triple to the data graph, run any rules triggered by
the new data item, recursively adding any generated triples.
|
void |
TransitiveInfGraph.performDelete(Triple t)
Removes the triple t (if possible) from the set belonging to this graph.
|
void |
TransitiveGraphCache.removeRelation(Triple t)
Remove an instance of a relation from the cache.
|
Modifier and Type | Method and Description |
---|---|
Triple |
UpdateDeniedException.getTriple() |
Modifier and Type | Method and Description |
---|---|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
RandomOrderGraph.find(Node s,
Node p,
Node o) |
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
RandomOrderGraph.find(TripleMatch m) |
Constructor and Description |
---|
AddDeniedException(String message,
Triple triple) |
DeleteDeniedException(String message,
Triple triple) |
UpdateDeniedException(String message,
Triple triple) |
Modifier and Type | Method and Description |
---|---|
static String |
PrintUtil.print(Triple triple)
Return a simplified print string for a Triple
|
Modifier and Type | Method and Description |
---|---|
void |
MonitorGraph.snapshot(List<Triple> additions,
List<Triple> deletions)
Compute the differences between the current monitored graph and the last
snapshot.
|
void |
MonitorGraph.snapshot(List<Triple> additions,
List<Triple> deletions)
Compute the differences between the current monitored graph and the last
snapshot.
|
Licenced under the Apache License, Version 2.0