public static Path pathFixedLength(Path path, long count) { return new P_FixedLength(path, count) ; } public static Path pathDistinct(Path path) { return new P_Distinct(path) ; }
public static Path pathFixedLength(Path path, long count) { return new P_FixedLength(path, count) ; }
@Override protected void doFixedLengthPath(Path pathStep, Node node, long fixedLength, Collection<Node> output) { if ( fixedLength == 0 ) { output.add(node) ; return ; } // P_Mod(path, count, count) // One step. Iterator<Node> iter = eval(graph, pathStep, node) ; // Build a path for all remaining steps. long count2 = dec(fixedLength) ; P_FixedLength nextPath = new P_FixedLength(pathStep, count2) ; // For each element in the first step, do remaining step // Accumulate across everything from first step. for ( ; iter.hasNext() ; ) { Node n2 = iter.next() ; Iterator<Node> iter2 = eval(graph, nextPath, n2) ; fill(iter2, output) ; } }
public void visit(P_FixedLength pFixedLength) { // P_Mod(path, count, count) // One step. Iterator<Node> iter = eval(graph, node, pFixedLength.getSubPath(), forwardMode) ; long count2 = dec(pFixedLength.getCount()) ; P_FixedLength nextPath = new P_FixedLength(pFixedLength.getSubPath(), count2) ; for ( ; iter.hasNext() ; ) { Node n2 = iter.next() ; Iterator<Node> iter2 = eval(graph, n2, nextPath, forwardMode) ; fill(iter2) ; } }
@Override protected void doFixedLengthPath(Path pathStep, Node node, long fixedLength, Collection<Node> output) { // Not SPARQL if ( fixedLength == 0 ) { output.add(node) ; return ; } // P_Mod(path, count, count) // One step. Iterator<Node> iter = eval(graph, pathStep, node) ; // Build a path for all remaining steps. long count2 = dec(fixedLength) ; P_FixedLength nextPath = new P_FixedLength(pathStep, count2) ; // For each element in the first step, do remaining step // Accumulate across everything from first step. for ( ; iter.hasNext() ; ) { Node n2 = iter.next() ; Iterator<Node> iter2 = eval(graph, nextPath, n2) ; fill(iter2, output) ; } }
public void visit(P_FixedLength pFixedLength) { if ( pFixedLength.getCount() == 0 ) { output.add(node) ; return ; } // P_Mod(path, count, count) // One step. Iterator<Node> iter = eval(graph, node, pFixedLength.getSubPath(), forwardMode) ; long count2 = dec(pFixedLength.getCount()) ; P_FixedLength nextPath = new P_FixedLength(pFixedLength.getSubPath(), count2) ; for ( ; iter.hasNext() ; ) { Node n2 = iter.next() ; Iterator<Node> iter2 = eval(graph, n2, nextPath, forwardMode) ; fill(iter2) ; } }
public Path make(ItemList list) { BuilderLib.checkLength(3, 3, list, "path fixed repeat: wanted 2 arguments") ; long count = modInt(list.get(1)) ; Path path = build(list, 2) ; return new P_FixedLength(path, count) ; } } ;
@Override public Path make(ItemList list) { BuilderLib.checkLength(3, 3, list, "path fixed repeat: wanted 2 arguments") ; long count = modInt(list.get(1)) ; Path path = build(list, 2) ; return new P_FixedLength(path, count) ; } } ;