@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( !(path2 instanceof P_ZeroOrMore1) ) return false ; P_ZeroOrMore1 other = (P_ZeroOrMore1)path2 ; return getSubPath().equalTo(other.getSubPath(), isoMap) ; }
@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( !(path2 instanceof P_Distinct) ) return false; P_Distinct other = (P_Distinct)path2; return getSubPath().equalTo(other.getSubPath(), isoMap); }
@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( !(path2 instanceof P_OneOrMoreN) ) return false ; P_OneOrMoreN other = (P_OneOrMoreN)path2 ; return getSubPath().equalTo(other.getSubPath(), isoMap) ; }
@Override public void visit(P_NegPropSet path) { P_NegPropSet tmp = new P_NegPropSet(); for(Node node : path.getFwdNodes()) { tmp.add(new P_ReverseLink(node)); } for(Node node : path.getBwdNodes()) { tmp.add(new P_Link(node)); } result = tmp; }
public static P_NegPropSet createNegPropSet(List<Node> fwdNodes, List<Node> bwdNodes) { P_NegPropSet result = new P_NegPropSet(); for(Node node : fwdNodes) { result.add(new P_Link(node)); } for(Node node : bwdNodes) { result.add(new P_ReverseLink(node)); } return result; }
@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 transform(P_Shortest path, Path subPath) { Path result = new P_Shortest(new P_Inverse(subPath)); return result; }
@Override public Path transform(P_Distinct path, Path subPath) { Path result = new P_Distinct(new P_Inverse(subPath)); return result; }
@Override public Path transform(P_ZeroOrOne path, Path subPath) { Path result = new P_ZeroOrOne(new P_Inverse(subPath)); return result; }
@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( !(path2 instanceof P_OneOrMore1) ) return false ; P_OneOrMore1 other = (P_OneOrMore1)path2 ; return getSubPath().equalTo(other.getSubPath(), isoMap) ; }
@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( !(path2 instanceof P_ZeroOrOne) ) return false ; P_ZeroOrOne other = (P_ZeroOrOne)path2 ; return 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 boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( !(path2 instanceof P_Shortest) ) return false ; P_Shortest other = (P_Shortest)path2 ; return 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); }
@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( !(path2 instanceof P_Multi) ) return false; P_Multi other = (P_Multi)path2; return getSubPath().equalTo(other.getSubPath(), isoMap); }
@Override public boolean equalTo(Path path2, NodeIsomorphismMap isoMap) { if ( !(path2 instanceof P_ZeroOrMoreN) ) return false ; P_ZeroOrMoreN other = (P_ZeroOrMoreN)path2 ; return getSubPath().equalTo(other.getSubPath(), isoMap) ; }
@Override public void visit(P_ZeroOrMoreN path) { printPathMod("{*}", path.getSubPath()) ; }
@Override public Path transform(P_NegPropSet path, List<Node> fwdNodes, List<Node> bwdNodes) { P_NegPropSet result = new P_NegPropSet(); for(Node node : fwdNodes) { result.add(new P_ReverseLink(node)); } for(Node node : bwdNodes) { result.add(new P_Link(node)); } return result; }