<br />
<b>Warning</b>:  session_start(): open(/var/lib/php/sessions/sess_ornkasrkl4b00dk30cg6ue10f1, O_RDWR) failed: No space left on device (28) in <b>/var/www/tb-usercake/models/config.php</b> on line <b>51</b><br />
<br />
<b>Warning</b>:  session_start(): Failed to read session data: files (path: /var/lib/php/sessions) in <b>/var/www/tb-usercake/models/config.php</b> on line <b>51</b><br />
!7

concept Example {
  S text;
  bool pos;
}

concept Theory {
  S pattern;
  Cl<Example> solvedExamples;

  transient simplyCached int complexityClass() { ret numberOfWords2(pattern); }
}

cmodule PatternMaker {
  switchable bool enabled = true;
  switchable S caseID = aGlobalID();
  S examplesText, counterexamplesText;
  transient JTable theoriesTable;
  transient Concepts cc;

  start {
    //cc = dm_handleCaseIDField();
    cc = new Concepts;
    indexConceptFieldCI(cc, Example, 'text);
    indexConceptFieldCI(cc, Theory, 'pattern);
    if (enabled) thread { think(); }
  }

  S _modifyStructForDuplication(S struct) {
    ret jreplace_first(struct, "caseID=*", "caseID=" + quote(aGlobalID()));
  }
  
  visual
    withCenteredButtons(jvsplit(
      jhgrid(
        jCenteredSection("Examples", dm_textArea examplesText()),
        jCenteredSection("Counterexamples", dm_textArea counterexamplesText())),
      jhsplit(
        jCenteredSection("Theories", theoriesTable = sexyTable()),
        dm_printLogComponent())),
      jThreadedButton("Think", rEnter think),
      dm_checkBox enabled());

  void think enter {
    Set<S> l1 = asLinkedHashSet(tlftj(examplesText));
    Set<S> l2 = asLinkedHashSet(tlftj(counterexamplesText));
    Set<S> intersection = setIntersection(l1, l2);
    if (nempty(intersection))
      ret with infoBox("Error: Examples appear in both lists, e.g. " + first(intersection));

    deleteConcepts(cc, Example);
    for (S s : l1) uniqCI(cc, Example, text := s, pos := true);
    for (S s : l2) uniqCI(cc, Example, text := s, pos := false);
    print("Have " + nExamples(countConcepts(cc, Example)));

    for (S s : l1)
      addPatterns(ai_inputExampleToPossibleMMOPatterns1(s));

    print("Have " + nTheories(countConcepts(cc, Theory)));

    dataToTable_uneditable_ifHasTable(theoriesTable, map(list(cc, Theory), t ->
      litorderedmap(
        "Pattern" := t.pattern,
        "Complexity class" := t.complexityClass());
  }

  void addPatterns(Iterable<S> l) { fOr (S s : l) addPattern(s); }
  void addPattern(S pattern) {
    uniqCI(cc, Theory, +pattern);
  }
}