protected Term append(Term t) throws PatternSyntaxException { distance += length(t); return super.append(t); }
protected Term append(Term t) throws PatternSyntaxException { distance += length(t); return super.append(t); }
term.append(t.tOffset, t.tOutside, data, vars, flags, iterators, groupNames); switch (t.ttype) { case Pretokenizer.FLAGS: (flags[0] & IGNORE_CASE) > 0, (flags[0] & IGNORE_SPACES) > 0, (flags[0] & UNICODE) > 0, (flags[0] & XML_SCHEMA) > 0); term.append(clg); continue; case Pretokenizer.PLAIN_GROUP: vars[DEPTH]++; term.append(makeTree(t, data, vars, new int[]{t.flags(flags[0])}, new Group(), iterators, groupNames)); break; case Pretokenizer.NAMED_GROUP: term.append(makeTree(t, data, vars, flags, new Group(id), iterators, groupNames)); break; case '(': vars[DEPTH]++; term.append(makeTree(t, data, vars, flags, new Group(vars[MEMREG_COUNT]++), iterators, groupNames)); break; case Pretokenizer.POS_LOOKAHEAD: vars[DEPTH]++; term.append(makeTree(t, data, vars, flags, new Lookahead(vars[LOOKAHEAD_COUNT]++, true), iterators, groupNames)); break; case Pretokenizer.NEG_LOOKAHEAD: vars[DEPTH]++; term.append(makeTree(t, data, vars, flags, new Lookahead(vars[LOOKAHEAD_COUNT]++, false), iterators, groupNames)); break; case Pretokenizer.POS_LOOKBEHIND:
term.append(t.tOffset, t.tOutside, data, vars, flags, iterators, groupNames); switch (t.ttype) { case Pretokenizer.FLAGS: (flags[0] & IGNORE_CASE) > 0, (flags[0] & IGNORE_SPACES) > 0, (flags[0] & UNICODE) > 0, (flags[0] & XML_SCHEMA) > 0); term.append(clg); continue; case Pretokenizer.PLAIN_GROUP: vars[DEPTH]++; term.append(makeTree(t, data, vars, new int[]{t.flags(flags[0])}, new Group(), iterators, groupNames)); break; case Pretokenizer.NAMED_GROUP: term.append(makeTree(t, data, vars, flags, new Group(id), iterators, groupNames)); break; case '(': vars[DEPTH]++; term.append(makeTree(t, data, vars, flags, new Group(vars[MEMREG_COUNT]++), iterators, groupNames)); break; case Pretokenizer.POS_LOOKAHEAD: vars[DEPTH]++; term.append(makeTree(t, data, vars, flags, new Lookahead(vars[LOOKAHEAD_COUNT]++, true), iterators, groupNames)); break; case Pretokenizer.NEG_LOOKAHEAD: vars[DEPTH]++; term.append(makeTree(t, data, vars, flags, new Lookahead(vars[LOOKAHEAD_COUNT]++, false), iterators, groupNames)); break; case Pretokenizer.POS_LOOKBEHIND: