| com.hp.hpl.jena.graph.test.GraphTestBase com.hp.hpl.jena.db.test.AbstractTestQuery1
All known Subclasses: com.hp.hpl.jena.db.test.TestQuery1,
AbstractTestQuery1 | abstract public class AbstractTestQuery1 extends GraphTestBase (Code) | | Abstract tests for graph query, parameterised on getGraph().
author: kers |
longPrefix | final protected String longPrefix(Code) | | The lots-of-dots prefix to use to make things long
|
stmtCnt | static int stmtCnt(Code) | | |
AbstractTestQuery1 | public AbstractTestQuery1(String name)(Code) | | |
queryResultCount | protected int queryResultCount(ExtendedIterator it)(Code) | | Answer the number of elements in the iterator; each such element should be
a List (and we make sure size() works on it, don't know why).
Parameters: it - the iterator to run down the number of elements in that iterator |
suite | public static TestSuite suite()(Code) | | |
test0 | public void test0()(Code) | | |
test1 | public void test1()(Code) | | Q1: get names of managers of female grunts; this has a joining variable.
|
test2 | public void test2()(Code) | | Q2: get names of female grunts with female managers
|
test3a | public void test3a()(Code) | | Q3.0: get all properties of the bigboss
|
test3b | public void test3b()(Code) | | Q3: get all properties of female grunts with male managers
this has a predicate variable. for standard reification, it
requires a multi-stage query. for convenient, minimal, it can
be done as a single stage (since reification is not queried).
|
test4 | public void test4()(Code) | | Q4: get all single-valued, required, literal properties of the bigboss
similar to Q3 in terms of stages.
|
test5 | public void test5()(Code) | | Q5: list the name and gender of martin's boss, where the pmgr property
is determined by a query).
similar to Q3 in terms of stages.
|
test6 | public void test6()(Code) | | Q6: list the reified subjects, predicates and objects.
should return nothing for minimal, convenient reification.
|
test7 | public void test7()(Code) | | Q7: list the reified predicates about the bigboss.
should return nothing for minimal, convenient reification.
|
test8 | public void test8()(Code) | | Q8: list the reification quads for the bigboss.
should return nothing for minimal, convenient reification.
|
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)
|
|
|