|
|||||||||
| Home >> All >> com >> hp >> hpl >> jena >> graph >> [ test overview ] | PREV CLASS NEXT CLASS | ||||||||
SUMMARY: JAVADOC | SOURCE | DOWNLOAD | NESTED | FIELD | CONSTR | METHOD |
DETAIL: FIELD | CONSTR | METHOD | ||||||||
com.hp.hpl.jena.graph.test
Class TestCapabilities.AllFalse

java.lang.Objectcom.hp.hpl.jena.graph.test.TestCapabilities.AllFalse
- All Implemented Interfaces:
- com.hp.hpl.jena.graph.Capabilities
- Enclosing class:
- TestCapabilities
- protected final class TestCapabilities.AllFalse
- extends java.lang.Object
- implements com.hp.hpl.jena.graph.Capabilities
- extends java.lang.Object
| Constructor Summary | |
protected |
TestCapabilities.AllFalse()
|
| 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. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
TestCapabilities.AllFalse
protected TestCapabilities.AllFalse()
| Method Detail |
sizeAccurate
public boolean sizeAccurate()
- Description copied from interface:
com.hp.hpl.jena.graph.Capabilities - Answer true iff Graph::size() is accurate.
- Specified by:
sizeAccuratein interfacecom.hp.hpl.jena.graph.Capabilities
addAllowed
public boolean addAllowed()
- Description copied from interface:
com.hp.hpl.jena.graph.Capabilities - Answer true if Graph::add() can be used to add at least some triples to
the graph.
- Specified by:
addAllowedin interfacecom.hp.hpl.jena.graph.Capabilities
addAllowed
public boolean addAllowed(boolean everyTriple)
- Description copied from interface:
com.hp.hpl.jena.graph.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:
addAllowedin interfacecom.hp.hpl.jena.graph.Capabilities
deleteAllowed
public boolean deleteAllowed()
- Description copied from interface:
com.hp.hpl.jena.graph.Capabilities - Answer true iff Graph::delete() can be used to remove at least some triples
from the graph.
- Specified by:
deleteAllowedin interfacecom.hp.hpl.jena.graph.Capabilities
deleteAllowed
public boolean deleteAllowed(boolean everyTriple)
- Description copied from interface:
com.hp.hpl.jena.graph.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:
deleteAllowedin interfacecom.hp.hpl.jena.graph.Capabilities
iteratorRemoveAllowed
public boolean iteratorRemoveAllowed()
- Description copied from interface:
com.hp.hpl.jena.graph.Capabilities - Answer true iff the iterators returned from find support the .remove()
operation.
- Specified by:
iteratorRemoveAllowedin interfacecom.hp.hpl.jena.graph.Capabilities
canBeEmpty
public boolean canBeEmpty()
- Description copied from interface:
com.hp.hpl.jena.graph.Capabilities - Answer true iff the graph can be completely empty.
- Specified by:
canBeEmptyin interfacecom.hp.hpl.jena.graph.Capabilities
findContractSafe
public boolean findContractSafe()
- Description copied from interface:
com.hp.hpl.jena.graph.Capabilities - 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).
- Specified by:
findContractSafein interfacecom.hp.hpl.jena.graph.Capabilities
|
|||||||||
| Home >> All >> com >> hp >> hpl >> jena >> graph >> [ test overview ] | PREV CLASS NEXT CLASS | ||||||||
SUMMARY: JAVADOC | SOURCE | DOWNLOAD | NESTED | FIELD | CONSTR | METHOD |
DETAIL: FIELD | CONSTR | METHOD | ||||||||
JAVADOC
com.hp.hpl.jena.graph.test.TestCapabilities.AllFalse