Docjar: A Java Source and Docuemnt Enginecom.*    java.*    javax.*    org.*    all    new    plug-in

Quick Search    Search Deep

com.hp.hpl.jena.graph
Interface Capabilities  view Capabilities download Capabilities.java


public interface Capabilities

Interface for expressing capabilities.


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 sued safely by the pretty-printer (we'll tighten up that definition).
 boolean iteratorRemoveAllowed()
          Answer true iff the iterators returned from find support the .remove() operation.
 boolean sizeAccurate()
          Answer true iff Graph::size() is accurate.
 

Method Detail

sizeAccurate

public boolean sizeAccurate()
Answer true iff Graph::size() is accurate.


addAllowed

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


addAllowed

public boolean addAllowed(boolean everyTriple)
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).


deleteAllowed

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


deleteAllowed

public boolean deleteAllowed(boolean everyTriple)
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.


iteratorRemoveAllowed

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


canBeEmpty

public boolean canBeEmpty()
Answer true iff the graph can be completely empty.


findContractSafe

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