@Override public int hashCode() { return hashMod ^ (int)min ^ (int)max ^ getSubPath().hashCode() ; }
@Override public int hashCode() { return hashMod ^ (int)min ^ (int)max ^ getSubPath().hashCode() ; }
@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( ! ( path2 instanceof P_Mod ) ) return false ; P_Mod other = (P_Mod)path2 ; return other.min == min && other.max == max && getSubPath().equalTo(other.getSubPath(), isoMap) ; }
@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( ! ( path2 instanceof P_Mod ) ) return false ; P_Mod other = (P_Mod)path2 ; return other.min == min && other.max == max && getSubPath().equalTo(other.getSubPath(), isoMap) ; }
@Override public void visit(P_Mod pathMod) { // do..Or.. need to take a visited set. if ( pathMod.isZeroOrMore() ) { // :p{0,} engine.doOneOrMoreN(pathMod.getSubPath(), node, output) ; return ; } if ( pathMod.isOneOrMore() ) { engine.doOneOrMoreN(pathMod.getSubPath(), node, output) ; return ; } if ( pathMod.isFixedLength() ) engine.doFixedLengthPath(pathMod.getSubPath(), node, pathMod.getFixedLength(), output) ; else engine.doMultiLengthPath(pathMod.getSubPath(), node, pathMod.getMin(), pathMod.getMax(), output) ; }
doZeroOrMore(pathMod.getSubPath()) ; return ; doOneOrMore(pathMod.getSubPath()) ; return ; Iterator<Node> iter = eval(graph, node, pathMod.getSubPath(), forwardMode) ; P_Mod nextPath = new P_Mod(pathMod.getSubPath(), min2, max2) ;
@Override public void visit(P_Mod pathMod) { if ( pathMod.getMin() > pathMod.getMax() ) throw new ARQException("Bad path: "+pathMod) ; Op op = null ; for ( long i = pathMod.getMin() ; i <= pathMod.getMax() ; i++ ) { Path p = PathFactory.pathFixedLength(pathMod.getSubPath(), i) ; Op sub = transformPath(null, subject, p, object) ; op = union(op, sub) ; } result = op ; }
if ( DEBUG ) IndentedWriter.stdout.println("ZeroOrMore: "+output) ; doZeroOrMore(pathMod.getSubPath()) ; if ( DEBUG ) IndentedWriter.stdout.println("ZeroOrMore: "+output) ; return ; long max2 = dec(max1) ; Path p1 = pathMod.getSubPath() ; Path p2 = new P_Mod(pathMod.getSubPath(), min2, max2) ;
public void visit(P_Mod pathMod) { out.print("(") ; out.print(Tags.tagPathMod) ; out.print(" ") ; out.print(modInt(pathMod.getMin())) ; out.print(" ") ; out.print(modInt(pathMod.getMax())) ; writeOneLiner(pathMod.getSubPath()) ; out.print(")") ; }
if ( alwaysInnerParens ) out.print("(") ; pathMod.getSubPath().visit(this) ; if ( alwaysInnerParens ) out.print(")") ;
if ( alwaysInnerParens ) out.print("(") ; pathMod.getSubPath().visit(this) ; if ( alwaysInnerParens ) out.print(")") ;
@Override public void visit(P_Mod pathMod) { out.print("(") ; out.print(Tags.tagPathMod) ; out.print(" ") ; out.print(modInt(pathMod.getMin())) ; out.print(" ") ; out.print(modInt(pathMod.getMax())) ; writeOneLiner(pathMod.getSubPath()) ; out.print(")") ; }
reduce(x, varAlloc, stepStart, pMod.getSubPath(), v) ; stepStart = v ; reduce(x, varAlloc, stepStart, pMod.getSubPath(), endNode) ; return ; Path p1 = PathFactory.pathFixedLength(pMod.getSubPath(), pMod.getMin()) ; Path p2 ; p2 = PathFactory.pathZeroOrMore(pMod.getSubPath()) ; else p2 = PathFactory.pathMod(pMod.getSubPath(),0, len2) ;
reduce(x, varAlloc, stepStart, pMod.getSubPath(), v) ; stepStart = v ; reduce(x, varAlloc, stepStart, pMod.getSubPath(), endNode) ; return ; Path p1 = PathFactory.pathFixedLength(pMod.getSubPath(), pMod.getMin()) ; Path p2 ; p2 = PathFactory.pathZeroOrMoreN(pMod.getSubPath()) ; else p2 = PathFactory.pathMod(pMod.getSubPath(),0, len2) ;