| Method Summary |
|
| boolean | addAllowed()
Answer true if Graph::add() can be used to add at least some triples to
the graph. |
| boolean | addAllowed(boolean everyTriple)
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 everyTriple)
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
rather than by lexical form (the memory-based graphs do; at present
the RDB-graphs do not). |
| boolean | iteratorRemoveAllowed()
Answer true iff the iterators returned from find support the .remove()
operation. |
| boolean | sizeAccurate()
Answer true iff Graph::size() is accurate. |