public static Path pathInverse(Path path) { return new P_Inverse(path) ; } public static Path pathMod(Path path, long min, long max) { return new P_Mod(path, min, max) ; }
@Override public int hashCode() { return getSubPath().hashCode() ^ hashInverse ; }
@Override public int hashCode() { return getSubPath().hashCode() ^ hashInverse ; }
public static Path pathInverse(Path path) { return new P_Inverse(path) ; } public static Path pathMod(Path path, long min, long max) { return new P_Mod(path, min, max) ; }
@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( ! ( path2 instanceof P_Inverse ) ) return false ; P_Inverse other = (P_Inverse)path2 ; return getSubPath().equalTo(other.getSubPath(), isoMap) ; }
public Path make(ItemList list) { BuilderLib.checkLength(2, 2, list, "path reverse: wanted 1 argument") ; Path path = build(list, 1) ; return new P_Inverse(path) ; } };
@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( ! ( path2 instanceof P_Inverse ) ) return false ; P_Inverse other = (P_Inverse)path2 ; return getSubPath().equalTo(other.getSubPath(), isoMap) ; }
@Override public Path make(ItemList list) { BuilderLib.checkLength(2, 2, list, "path reverse: wanted 1 argument") ; Path path = build(list, 1) ; return new P_Inverse(path) ; } };
public void visit(P_Inverse inversePath) { //boolean b = forwardMode ; // Flip direction and evaluate forwardMode = ! forwardMode ; inversePath.getSubPath().visit(this) ; forwardMode = ! forwardMode ; }
@Override public Var evaluate(NodeSelector nodeSelector, ElementGroup elementGroup, Var var, LDPathEvaluatorConfiguration evaluatorConfiguration) { ReversePropertySelector reversePropertySelector = (ReversePropertySelector) nodeSelector; Var id = Var.alloc(VarIDGenerator.createID()); ElementPathBlock epb = new ElementPathBlock(); epb.addTriple(new TriplePath(var.asNode(), new P_Inverse(new P_Link(NodeFactory.createURI(reversePropertySelector.getProperty().toString()))), id.asNode())); ElementGroup group = new ElementGroup(); group.addElement(epb); elementGroup.addElement(group); return id; } }
public void visit(P_Inverse inversePath) { //boolean b = forwardMode ; // Flip direction and evaluate forwardMode = ! forwardMode ; inversePath.getSubPath().visit(this) ; forwardMode = ! forwardMode ; }
jj_consume_token(CARAT); p2 = PathElt(); p1 = PathFactory.pathSeq(p1, new P_Inverse(p2)) ; break; default:
public void visit(P_Inverse inversePath) { out.print("^") ; Path p = inversePath.getSubPath() ; boolean parens = true ; if ( p instanceof P_Link ) parens = false ; visitPath(p, parens) ; } }
jj_consume_token(CARAT); p2 = PathElt(); p1 = PathFactory.pathSeq(p1, new P_Inverse(p2)) ; break; default:
@Override public void visit(P_Inverse inversePath) { out.print("^") ; Path p = inversePath.getSubPath() ; boolean parens = true ; if ( p instanceof P_Link ) parens = false ; visitPath(p, parens) ; } }
@Override public void visit(P_Inverse p) { TriplePath newtp = new TriplePath(object, p.getSubPath(), subject); boolean[] resHasPropertyPaths = new boolean[]{false}; result = transform(newtp, bestEffort, vargen, resHasPropertyPaths); if (!resultHasPropertyPaths) { resultHasPropertyPaths = resHasPropertyPaths[0]; } }
@Override public void visit(P_Inverse inversePath) { PathTransform pt = new PathTransform(object, subject) ; inversePath.getSubPath().visit(pt) ; result = pt.getResult() ; }
@Override public void visit(P_Inverse inversePath) { //boolean b = forwardMode ; // Flip direction and evaluate engine.flipDirection() ; engine.eval(graph, inversePath.getSubPath(), node, output) ; engine.flipDirection() ; }
public void visit(P_Inverse reversePath) { out.print("(") ; out.print(Tags.tagPathReverse) ; nl(out) ; out.incIndent() ; Path p = reversePath.getSubPath() ; output(p) ; out.decIndent() ; nl(out, false) ; out.print(")") ; }
@Override public void visit(P_Inverse reversePath) { out.print("(") ; out.print(Tags.tagPathReverse) ; nl(out) ; out.incIndent() ; Path p = reversePath.getSubPath() ; output(p) ; out.decIndent() ; nl(out, false) ; out.print(")") ; }