| com.hp.hpl.jena.graph.query.test.QueryTestBase com.hp.hpl.jena.graph.query.test.AbstractTestQuery
All known Subclasses: com.hp.hpl.jena.db.test.TestQueryRDB, com.hp.hpl.jena.mem.faster.test.TestFasterQuery,
AbstractTestQuery | abstract public class AbstractTestQuery extends QueryTestBase (Code) | | Abstract tests for graph query, parameterised on getGraph().
author: kers |
Inner Class :protected static class BangException extends JenaException | |
Inner Class :static class CountingGraph extends WrappedGraph | |
Method Summary | |
protected void | addAnswer(Map result, List bindings, int limit) | public void | assertCount(int expected, String query) | public void | assertCount(int expected, String query, String vars) | CountingGraph | bigCountingGraph() | public Expression | createModifiedPattern(String content, String modifiers) | public Expression | createSimplePattern(String p) | protected Graph | dataGraph() | protected ExtendedIterator | eb(Graph g, Query q, Node[] nodes) Utility. | protected List | ebList(Graph g, Query q, Node[] nodes) | protected Set | ebSet(Graph g, Query q, Node[] nodes) | protected TripleSorter | fiddle(int a, int b, int c) | protected Map | getAnswer(Graph g, TripleSorter sorter) | abstract public Graph | getGraph() | public Graph | getGraphWith(String facts) | protected static Set | nodeListSet(String s) | int | queryCount(TripleSorter sort) | public void | setUp() | public static TestSuite | suite() | public void | testAtomicTreeQuery() | public void | testBindingQuery() | public void | testBoundTypedLiterals() | public void | testChainedTreeQuery() | public void | testCloseQuery() | public void | testCompositeTreeQuery() | public void | testConstraint() | public void | testConstraintFour() | public void | testConstraintThree() | public void | testDisconnected() More of an example than a test, for a query with "disconnected" triples. | public void | testEmpty() | public void | testEmptyIterator() | public void | testExtractConstraint() Test that a PatternStage extracts appropriate parts of a constraint set. | public void | testFixedTypedLiterals() | public void | testGraphConstraints(String title, Expression constraint, String wanted) | public void | testGraphConstraints() | public void | testGraphQuery() | public void | testManyThings() | public void | testMatchConstraint() Test that the MATCHES constraint works. | public void | testMismatch() | public void | testMissingVariable() this possible failure mode discovered by Andy when building a fast-path
RDQL engine over the graph.query SPI. | public void | testMultipleBindings() | public void | testMultiplePatterns() | public void | testNodeVariablesA() | public void | testNodeVariablesB() | public void | testOneMatch() | public void | testQueryConstraintUnbound() test that unbound constraint variables are handled "nicely". | public void | testQueryExceptionCleanlyExits() | public void | testQueryOptimisation() | public void | testQueryTripleOrder() Test that the default engine does not re-order triples. | public void | testRewriteContainsExpression() | public void | testRewriteEndswithExpression() | public void | testRewriteEndswithInsensitiveExpression() | public void | testRewritePreservesCharacterCases() | public void | testRewriteStartswithExpression() | public void | testRewriteStartswithInsensitiveExpression() | public void | testSingleBindings() | public void | testStringResults() | public void | testTripleSorting() Test that a variety of triple-sorters make no difference to the results of a query
over a moderately interesting graph. | public void | testTwoGraphs() | public void | testTwoPatterns() | public void | testVariableCount() test that we can correctly deduce the variable count for some queries. | public void | testXXXMatch1() | public void | testXXXMatch3() |
AbstractTestQuery | public AbstractTestQuery(String name)(Code) | | |
addAnswer | protected void addAnswer(Map result, List bindings, int limit)(Code) | | |
assertCount | public void assertCount(int expected, String query)(Code) | | |
bigCountingGraph | CountingGraph bigCountingGraph()(Code) | | |
setUp | public void setUp()(Code) | | |
suite | public static TestSuite suite()(Code) | | |
testAtomicTreeQuery | public void testAtomicTreeQuery()(Code) | | |
testBindingQuery | public void testBindingQuery()(Code) | | |
testBoundTypedLiterals | public void testBoundTypedLiterals()(Code) | | |
testChainedTreeQuery | public void testChainedTreeQuery()(Code) | | |
testCloseQuery | public void testCloseQuery()(Code) | | |
testCompositeTreeQuery | public void testCompositeTreeQuery()(Code) | | |
testConstraint | public void testConstraint()(Code) | | |
testConstraintFour | public void testConstraintFour()(Code) | | |
testConstraintThree | public void testConstraintThree()(Code) | | |
testDisconnected | public void testDisconnected()(Code) | | More of an example than a test, for a query with "disconnected" triples.
|
testEmpty | public void testEmpty()(Code) | | |
testEmptyIterator | public void testEmptyIterator()(Code) | | |
testExtractConstraint | public void testExtractConstraint()(Code) | | Test that a PatternStage extracts appropriate parts of a constraint set.
|
testFixedTypedLiterals | public void testFixedTypedLiterals()(Code) | | |
testGraphConstraints | public void testGraphConstraints()(Code) | | |
testGraphQuery | public void testGraphQuery()(Code) | | |
testManyThings | public void testManyThings()(Code) | | |
testMatchConstraint | public void testMatchConstraint()(Code) | | Test that the MATCHES constraint works.
|
testMismatch | public void testMismatch()(Code) | | |
testMissingVariable | public void testMissingVariable()(Code) | | this possible failure mode discovered by Andy when building a fast-path
RDQL engine over the graph.query SPI.
test that we get a sensible result when unbound variables are used in the
query result selector.
|
testMultipleBindings | public void testMultipleBindings()(Code) | | |
testMultiplePatterns | public void testMultiplePatterns()(Code) | | |
testNodeVariablesA | public void testNodeVariablesA()(Code) | | |
testNodeVariablesB | public void testNodeVariablesB()(Code) | | |
testOneMatch | public void testOneMatch()(Code) | | |
testQueryConstraintUnbound | public void testQueryConstraintUnbound()(Code) | | test that unbound constraint variables are handled "nicely".
|
testQueryExceptionCleanlyExits | public void testQueryExceptionCleanlyExits()(Code) | | |
testQueryOptimisation | public void testQueryOptimisation()(Code) | | |
testQueryTripleOrder | public void testQueryTripleOrder()(Code) | | Test that the default engine does not re-order triples.
|
testRewriteContainsExpression | public void testRewriteContainsExpression()(Code) | | |
testRewriteEndswithExpression | public void testRewriteEndswithExpression()(Code) | | |
testRewriteEndswithInsensitiveExpression | public void testRewriteEndswithInsensitiveExpression()(Code) | | |
testRewritePreservesCharacterCases | public void testRewritePreservesCharacterCases()(Code) | | |
testRewriteStartswithExpression | public void testRewriteStartswithExpression()(Code) | | |
testRewriteStartswithInsensitiveExpression | public void testRewriteStartswithInsensitiveExpression()(Code) | | |
testSingleBindings | public void testSingleBindings()(Code) | | |
testStringResults | public void testStringResults()(Code) | | |
testTripleSorting | public void testTripleSorting()(Code) | | Test that a variety of triple-sorters make no difference to the results of a query
over a moderately interesting graph.
|
testTwoGraphs | public void testTwoGraphs()(Code) | | |
testTwoPatterns | public void testTwoPatterns()(Code) | | |
testVariableCount | public void testVariableCount()(Code) | | test that we can correctly deduce the variable count for some queries.
|
testXXXMatch1 | public void testXXXMatch1()(Code) | | |
testXXXMatch3 | public void testXXXMatch3()(Code) | | |
|
|