@Override public Path transform(P_FixedLength path, Path subPath, long count) { Path result = path.getSubPath() == subPath && path.getCount() == count ? path : new P_FixedLength(subPath, count) ; return result; }
@Override public void visit(P_FixedLength pFixedLength) { engine.doFixedLengthPath(pFixedLength.getSubPath(), node, pFixedLength.getCount(), output) ; }
@Override public Path transform(P_FixedLength path, Path subPath, long count) { Path result = new P_FixedLength(new P_Inverse(subPath), path.getCount()); return result; }
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) ; }
@Override public int hashCode() { return hashFixedLength ^ (int)count ^ getSubPath().hashCode(); }
@Override public void visit(P_FixedLength path) { Path subPath = stack.pop() ; Path newPath = pathTransform.transform(path, subPath, path.getCount()); stack.push(newPath); }
@Override public void visit(P_FixedLength pFixedLength) { Op op = null ; Var v1 = null ; for ( int i = 0 ; i < pFixedLength.getCount() ; i++ ) { Var v2 = varAlloc.allocVar() ; Node s = (v1 == null) ? subject : v1 ; Node o = (i == pFixedLength.getCount()-1) ? object : v2 ; Op op1 = transformPath(null, s, pFixedLength.getSubPath() , o) ; op = join(op, op1) ; v1 = v2 ; } result = op ; }
@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(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(nextPath, n2) ; fill(iter2, output) ; } }
@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( !(path2 instanceof P_FixedLength) ) return false; P_FixedLength other = (P_FixedLength)path2; return other.count == count && getSubPath().equalTo(other.getSubPath(), isoMap); }
@Override public void visit(P_FixedLength path) { Path newSubPath = apply(path.getSubPath()); result = path.getSubPath() == newSubPath ? path : new P_FixedLength(newSubPath, path.getCount()) ; }
@Override public void visit(P_FixedLength path) { out.print("(") ; out.print(Tags.tagPathFixedLength) ; out.print(" ") ; out.print(modInt(path.getCount())) ; writeOneLiner(path.getSubPath()) ; out.print(")") ; }
@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(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(nextPath, n2) ; fill(iter2, output) ; } }
@Override public void visit(P_FixedLength path) { before(path); if (path.getSubPath() != null) { path.getSubPath().visit(this); } proc.visit(path); after(path); }
@Override public void visit(P_FixedLength path) { result = new P_FixedLength(new P_Inverse(path.getSubPath()), path.getCount()); }
@Override public void visit(P_FixedLength pFixedLength) { if ( needParens ) out.print("(") ; if ( alwaysInnerParens ) out.print("(") ; pFixedLength.getSubPath().visit(this) ; if ( alwaysInnerParens ) out.print(")") ; out.print("{") ; out.print(Long.toString(pFixedLength.getCount())) ; out.print("}") ; if ( needParens ) out.print(")") ; }
@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) ; } } ;
@Override public void visit(P_FixedLength pFixedLength) { pFixedLength.getSubPath().visit(this); push(new P_FixedLength(pop(), pFixedLength.getCount())); }
long N = pFixed.getCount() ; if ( N > 0 ) reduce(x, varAlloc, stepStart, pFixed.getSubPath(), v) ; stepStart = v ; reduce(x, varAlloc, stepStart, pFixed.getSubPath(), endNode) ; return ;
@Override public void visit(P_FixedLength pFixedLength) { pFixedLength.getSubPath().visit(this); push(new P_FixedLength(pop(), pFixedLength.getCount())); }