int i = 0; for(int j = 0; j < other.pos; j++) { if(i == pos) return true; if(components[i].equals(WILDCARD)) {
int i = 0, j = 0; for( ; j < other.pos; j++) { if(i == pos) { if(includeDescendants) return true; return j == other.pos ? true : false; } if(components[i] == WILDCARD) {
    public final boolean match(NodePath other) {        boolean skip = false;        int i = 0;        for(int j = 0; j < other.pos; j++) {            if(i == pos)                return true;            if(components[i].equals(WILDCARD)) {                ++i;                skip = true;            }            if(other.components[j].equals(components[i])) {                ++i;                skip = false;            } else if(skip) {                continue;            } else                return false;        }        return i == pos;    }