| com.hp.hpl.jena.graph.test.GraphTestBase
 com.hp.hpl.jena.graph.test.AbstractTestGraphMaker
All known Subclasses: com.hp.hpl.jena.db.test.TestGraphRDBMaker, com.hp.hpl.jena.graph.test.TestFileGraphMaker, com.hp.hpl.jena.graph.test.TestSimpleGraphMaker,
| AbstractTestGraphMaker | | abstract public class AbstractTestGraphMaker extends GraphTestBase (Code) | | Abstract base class for testing graph factories. Subclasses define the
method getGraphFactory() which supplies a new graph
factory to be tested: ATGF invokes that during setUp
and closes it in tearDown.
This bunch of tests is not remotely exhaustive, but it was sufficent to
drive the development of the first full graph factory. (Although at the time
it wasn't abstract.)
author:
hedgehog |
| AbstractTestGraphMaker | | public AbstractTestGraphMaker(String name)(Code) | | |
| setUp | | public void setUp()(Code) | | |
| tearDown | | public void tearDown()(Code) | | |
| testAnyName | | public void testAnyName()(Code) | | |
| testCanCreateTwice | | public void testCanCreateTwice()(Code) | | |
| testCanFindCreatedGraph | | public void testCanFindCreatedGraph()(Code) | | Test that we can find a graph once its been created. We need to know
if two graphs are "the same" here, which is tricky, because the RDB
factory produces non-== graphs that are "the same": we have a temporary
work-around but it is not sound.
|
| testCanOpenUncreated | | public void testCanOpenUncreated()(Code) | | Test that we *can* open a graph that hasn't been created
|
| testCanRemoveGraph | | public void testCanRemoveGraph()(Code) | | Test that we can remove a graph from the factory without disturbing
another graph's binding.
|
| testCannotCreateTwice | | public void testCannotCreateTwice()(Code) | | Test that we can't create a graph with the same name twice.
|
| testCannotOpenUncreated | | public void testCannotOpenUncreated()(Code) | | Test that we cannot open a graph that does not exist.
|
| testCarefulClose | | public void testCarefulClose()(Code) | | |
| testCreateGraph | | public void testCreateGraph()(Code) | | |
| testGetGraph | | public void testGetGraph()(Code) | | A trivial test that getGraph delivers a proper graph, not cheating with null, and that
getGraph() "always" delivers the same Graph.
|
| testHasnt | | public void testHasnt()(Code) | | |
| testListAfterDelete | | public void testListAfterDelete()(Code) | | Test that a maker with some things put in and then some removed gets the right
things listed.
|
| testListNoGraphs | | public void testListNoGraphs()(Code) | | Test that a maker with no graphs lists no names.
|
| testListThreeGraphs | | public void testListThreeGraphs()(Code) | | Test that a maker with three graphs inserted lists those three grapsh; we don't
mind what order they appear in. We also use funny names to ensure that the spelling
that goes in is the one that comes out [should really be in a separate test].
|
| Fields inherited from com.hp.hpl.jena.graph.test.GraphTestBase | protected static int bnc(Code)(Java Doc)
|
| Methods inherited from com.hp.hpl.jena.graph.test.GraphTestBase | protected static void appendNode(StringBuffer b, Map bnodes, Node n)(Code)(Java Doc)
public Set arrayToSet(Object[] A)(Code)(Java Doc)
public static void assertContains(String name, String s, Graph g)(Code)(Java Doc)
public static void assertContainsAll(String name, Graph g, String s)(Code)(Java Doc)
public static void assertEqualsTemplate(String title, Graph g, String template)(Code)(Java Doc)
public static void assertIsomorphic(String title, Graph expected, Graph got)(Code)(Java Doc)
public static void assertIsomorphic(Graph expected, Graph got)(Code)(Java Doc)
public static void assertOmits(String name, Graph g, String s)(Code)(Java Doc)
public static void assertOmitsAll(String name, Graph g, String s)(Code)(Java Doc)
public static boolean contains(Graph g, String fact)(Code)(Java Doc)
public static Graph getGraph(Object wrap, Class graphClass, ReificationStyle style)(Code)(Java Doc)
protected static Graph getReificationTriples(Reifier r)(Code)(Java Doc)
public static Graph graphAdd(Graph g, String s)(Code)(Java Doc)
public static Graph graphWith(String s)(Code)(Java Doc)
public static List iteratorToList(Iterator it)(Code)(Java Doc)
public static Set iteratorToSet(Iterator it)(Code)(Java Doc)
public static Graph newGraph()(Code)(Java Doc)
public static String nice(Graph g, Map bnodes)(Code)(Java Doc)
protected static String nice(Node n)(Code)(Java Doc)
protected static void niceTriple(StringBuffer b, Map bnodes, Triple t)(Code)(Java Doc)
public static Node node(String x)(Code)(Java Doc)
public static Node[] nodeArray(String items)(Code)(Java Doc)
public static List nodeList(String items)(Code)(Java Doc)
public Set nodeSet(String nodes)(Code)(Java Doc)
public void testContains(Graph g, Triple[] triples)(Code)(Java Doc)
public void testContains(Graph g, List triples)(Code)(Java Doc)
public void testContains(Graph g, Iterator it)(Code)(Java Doc)
public void testContains(Graph g, Graph other)(Code)(Java Doc)
public void testOmits(Graph g, Triple[] triples)(Code)(Java Doc)
public void testOmits(Graph g, List triples)(Code)(Java Doc)
public void testOmits(Graph g, Iterator it)(Code)(Java Doc)
public void testOmits(Graph g, Graph other)(Code)(Java Doc)
public static Triple triple(String fact)(Code)(Java Doc)
public static Triple triple(PrefixMapping pm, String fact)(Code)(Java Doc)
public static Triple[] tripleArray(String facts)(Code)(Java Doc)
public static Set tripleSet(String facts)(Code)(Java Doc)
|
|
|