!7

sclass MatchInput > DynPrintLogWithInput {
  start {
    dm_requireModule("#1016073/MechLists");
    useLocalMechListCopies(true);
    set serverMechList_raw_fresh_verbose;
  }
  
  void update(S s) {
    print("\n> " + s);
    L<S> pats = mL("English sentence patterns");
    L<S> tok = javaTokWithAngleBracketsC(s);
    printStruct(tok);
    PlanInMotion<S> plan = new(pats);
    //L<Pair<S, L<Pair<S>>>> results = new L; // pattern + match
    PriorityQueue<Pair<S, L<Pair<S>>>> results = new PriorityQueue<Pair<S, L<Pair<S>>>>(new Comparator<Pair<S, L<Pair<S>>>>() {
      public int compare(Pair<S, L<Pair<S>>> a, Pair<S, L<Pair<S>>> b) {
        //print("cmp " + l(a.b) + " " + l(b.b));
        ret cmp(l(a.b), l(b.b));
      }
    });
    for (S pat : plan.master()) {
      L<S> tokPat;
      tokPat = javaTokWithAngleBracketsC(pat);
      L<Pair<S>> match = uniquify(dropTwinPairsIC(zipTwoListsToPairs_ifSameLength(tokPat, tok)));
      if (match != null) {
        print("  Result: Choose pattern " + quote(pat) + " for input "  + quote(s) + " if match: " + sfu(match));
        results.add(pair(pat, match));
        for (Pair<S> p : match)
          if (isAngleBracketed(p.a)) {
            Set<S> entries = mechSetCI(plural_mech(deAngleBracket(p.a)));
            //print("Found " + n2(entries, "entry", "entries") + " for " + p.a);
            if (contains(entries, p.b))
              print("  Match!!");
          }
      }
    }
    pnlStruct(mapPairB(f l, priorityQueueToList(results));
  }
}