opt.length.set(slen, slen); } else { int max; opt.length.set(slen, max); int min = enc.minLength(); int max = enc.maxLength(); opt.length.set(min, max); } else { for (int i=0; i<BitSet.SINGLE_BYTE_SIZE; i++) { opt.length.set(1, 1); opt.length.set(min, max); break; opt.length.set(enc.minLength(), enc.maxLength()); break; opt.length.set(0, MinMaxLen.INFINITE_DISTANCE); break; opt.length.set(min, max); break; CallNode cn = (CallNode)node; if (cn.isRecursion()) { opt.length.set(0, MinMaxLen.INFINITE_DISTANCE);
opt.length.set(slen, slen); } else { int max; opt.length.set(slen, max); int min = enc.minLength(); int max = enc.maxLength(); opt.length.set(min, max); } else { for (int i=0; i<BitSet.SINGLE_BYTE_SIZE; i++) { opt.length.set(1, 1); opt.length.set(min, max); break; opt.length.set(enc.minLength(), enc.maxLength()); break; opt.length.set(0, MinMaxLen.INFINITE_DISTANCE); break; opt.length.set(min, max); break; CallNode cn = (CallNode)node; if (cn.isRecursion()) { opt.length.set(0, MinMaxLen.INFINITE_DISTANCE);