@Override public int hashCode() { return hashFixedLength ^ (int)count ^ getSubPath().hashCode() ; }
@Override public int hashCode() { return hashFixedLength ^ (int)count ^ getSubPath().hashCode() ; }
@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 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) ; }
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 public void visit(P_FixedLength pFixedLength) { engine.doFixedLengthPath(pFixedLength.getSubPath(), node, pFixedLength.getCount(), 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) ; } }
@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 ; }
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 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(")") ; }
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 public void visit(P_FixedLength path) { out.print("(") ; out.print(Tags.tagPathFixedLength) ; out.print(" ") ; out.print(modInt(path.getCount())) ; writeOneLiner(path.getSubPath()) ; out.print(")") ; }
reduce(x, varAlloc, stepStart, pFixed.getSubPath(), v) ; stepStart = v ; reduce(x, varAlloc, stepStart, pFixed.getSubPath(), endNode) ; return ;
reduce(x, varAlloc, stepStart, pFixed.getSubPath(), v) ; stepStart = v ; reduce(x, varAlloc, stepStart, pFixed.getSubPath(), endNode) ; return ;