private ResIterator listSubjectsFor( RDFNode p, RDFNode o ) { ClosableIterator<Node> xit = GraphUtil.listSubjects( graph, asNode( p ), asNode( o ) ); return IteratorFactory.asResIterator( xit, this ); }
protected Set<Node> listSubjects( Graph g ) { return GraphUtil.listSubjects( g, Node.ANY, Node.ANY ).toSet(); }
private ResIterator listSubjectsFor( RDFNode p, RDFNode o ) { ClosableIterator<Node> xit = GraphUtil.listSubjects( graph, asNode( p ), asNode( o ) ); return IteratorFactory.asResIterator( xit, this ); }
protected Set<Node> listSubjects( Graph g ) { return GraphUtil.listSubjects( g, Node.ANY, Node.ANY ).toSet(); }
protected void testSubjects( Graph g, Collection<Node> exclude, Node p, Node o, Node... expected ) { List<Node> R = GraphUtil.listSubjects( g, p, o ).toList(); R.removeAll(exclude) ; assertSameUnordered(R, exclude, expected) ; }
protected void testSubjects( Graph g, Collection<Node> exclude, Node p, Node o, Node... expected ) { List<Node> R = GraphUtil.listSubjects( g, p, o ).toList(); R.removeAll(exclude) ; assertSameUnordered(R, exclude, expected) ; }
public void testListSubjectsNoRemove() { Graph g = getGraphWith( "a P b; b Q c; c R a" ); Iterator<Node> it = GraphUtil.listSubjects( g, Node.ANY, Node.ANY ); it.next(); try { it.remove(); fail( "listSubjects for " + g.getClass() + " should not support .remove()" ); } catch (UnsupportedOperationException e) { pass(); } }
public void testListSubjectsNoRemove() { Graph g = getGraphWith( "a P b; b Q c; c R a" ); Iterator<Node> it = GraphUtil.listSubjects( g, Node.ANY, Node.ANY ); it.next(); try { it.remove(); fail( "listSubjects for " + g.getClass() + " should not support .remove()" ); } catch (UnsupportedOperationException e) { pass(); } }
out.startObject(); ExtendedIterator<Node> subjects = GraphUtil.listSubjects(graph, Node.ANY, Node.ANY) ; try { Map<Node, Set<Node>> predicates = new HashMap<>() ;
public void testSubjectsFor() { // First get the answer from the empty graph (not empty for an inf graph) Graph b = getGraphWith( "" ); Set<Node> B = GraphUtil.listSubjects( b, Node.ANY, Node.ANY ).toSet(); Graph g = getGraphWith( "a P b; a Q c; a P d; b P x; c Q y" ); testSubjects( g, B, Node.ANY, Node.ANY, node("a"), node("b"), node("c") ); testSubjects( g, B, node( "P" ), Node.ANY, node("a"), node("b")); testSubjects( g, B, node( "Q" ), node( "c" ), node("a") ); testSubjects( g, B, node( "Q" ), node( "y" ), node("c") ); testSubjects( g, B, node( "Q" ), node( "a" )); testSubjects( g, B, node( "Q" ), node( "z" )); }
public void testSubjectsFor() { // First get the answer from the empty graph (not empty for an inf graph) Graph b = getGraphWith( "" ); Set<Node> B = GraphUtil.listSubjects( b, Node.ANY, Node.ANY ).toSet(); Graph g = getGraphWith( "a P b; a Q c; a P d; b P x; c Q y" ); testSubjects( g, B, Node.ANY, Node.ANY, node("a"), node("b"), node("c") ); testSubjects( g, B, node( "P" ), Node.ANY, node("a"), node("b")); testSubjects( g, B, node( "Q" ), node( "c" ), node("a") ); testSubjects( g, B, node( "Q" ), node( "y" ), node("c") ); testSubjects( g, B, node( "Q" ), node( "a" )); testSubjects( g, B, node( "Q" ), node( "z" )); }