public N step(N node) { return getFollowingNode(node, anchor); } }
public N step(N node) { return getFollowingNode(node, anchor); } }
public N step(N node) { do { node = getFollowingNode(node, anchor); } while (node != null && !test.matchesNode(node)); return node; } }
public N step(N node) { do { node = getFollowingNode(node, anchor); } while (node != null && node.getFingerprint() != fingerprint); return node; } }
public N step(N node) { do { node = getFollowingNode(node, anchor); } while (node != null && node.getFingerprint() != fingerprint); return node; } }
public N step(N node) { do { node = getFollowingNode(node, anchor); } while (node != null && !test.matchesNode(node)); return node; } }