org.apache.jena.graph.impl

Class AllCapabilities

java.lang.Object

org.apache.jena.graph.impl.AllCapabilities

All Implemented Interfaces:

Capabilities

Direct Known Subclasses:

BaseInfGraph.InfCapabilities

public class AllCapabilities
extends Object
implements Capabilities

A default implementation of capabilities, in which everything is allowed, size is accurate, and graphs may be completely empty.

Constructor Summary

Constructors

Constructor and Description
AllCapabilities()

Method Summary

Modifier and Type	Method and Description
boolean	addAllowed() Answer true if Graph::add() can be used to add at least some triples to the graph.
boolean	addAllowed(boolean every) Answer true if Graph::add() can be used to add at least some triples to the graph.
boolean	canBeEmpty() Answer true iff the graph can be completely empty.
boolean	deleteAllowed() Answer true iff Graph::delete() can be used to remove at least some triples from the graph.
boolean	deleteAllowed(boolean every) Answer true if Graph::delete() can be used to remove at least some triples from the graph.
boolean	findContractSafe() Answer true if the find() contract on the associated graph is "safe", ie, can be used safely by the pretty-printer (we'll tighten up that definition).
boolean	handlesLiteralTyping() Answer true iff this graph compares literals for equality by value in find() operations, rather just applying RDFTerm equality.
boolean	iteratorRemoveAllowed() Answer true iff the iterators returned from find support the .remove() operation.
boolean	sizeAccurate() Answer true iff Graph::size() is accurate.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

AllCapabilities

public AllCapabilities()

Method Detail

sizeAccurate

public boolean sizeAccurate()

Description copied from interface: Capabilities

Answer true iff Graph::size() is accurate.

Specified by:

sizeAccurate in interface Capabilities

addAllowed

public boolean addAllowed()

Description copied from interface: Capabilities

Answer true if Graph::add() can be used to add at least some triples to the graph.

Specified by:

addAllowed in interface Capabilities

addAllowed

public boolean addAllowed(boolean every)

Description copied from interface: Capabilities

Answer true if Graph::add() can be used to add at least some triples to the graph. If everyTriple is true, answer true iff *any* triple can be added (ie the graph places no special restrictions on triples).

Specified by:

addAllowed in interface Capabilities

deleteAllowed

public boolean deleteAllowed()

Description copied from interface: Capabilities

Answer true iff Graph::delete() can be used to remove at least some triples from the graph.

Specified by:

deleteAllowed in interface Capabilities

deleteAllowed

public boolean deleteAllowed(boolean every)

Description copied from interface: Capabilities

Answer true if Graph::delete() can be used to remove at least some triples from the graph. If everyTriple is true, any such triple may be removed.

Specified by:

deleteAllowed in interface Capabilities

canBeEmpty

public boolean canBeEmpty()

Description copied from interface: Capabilities

Answer true iff the graph can be completely empty.

Specified by:

canBeEmpty in interface Capabilities

iteratorRemoveAllowed

public boolean iteratorRemoveAllowed()

Description copied from interface: Capabilities

Answer true iff the iterators returned from find support the .remove() operation.

Specified by:

iteratorRemoveAllowed in interface Capabilities

findContractSafe

public boolean findContractSafe()

Description copied from interface: Capabilities

Answer true if the find() contract on the associated graph is "safe", ie, can be used safely by the pretty-printer (we'll tighten up that definition).

Specified by:

findContractSafe in interface Capabilities

handlesLiteralTyping

public boolean handlesLiteralTyping()

Description copied from interface: Capabilities

Answer true iff this graph compares literals for equality by value in find() operations, rather just applying RDFTerm equality. Only applies to GraphMem. TDB models have this effect because of canonicalization for certain datatypes and ranges, SDB models don't.

Specified by:

handlesLiteralTyping in interface Capabilities