root = BnM.optimize(matchRoot); if (root == matchRoot) { root = hasSupplementary ? new StartS(matchRoot) : new Start(matchRoot);
root = BnM.optimize(matchRoot); if (root == matchRoot) { root = hasSupplementary ? new StartS(matchRoot) : new Start(matchRoot);
First(Node node) { this.atom = BnM.optimize(node); } boolean match(Matcher matcher, int i, CharSequence seq) {
First(Node node) { this.atom = BnM.optimize(node); } boolean match(Matcher matcher, int i, CharSequence seq) {