!7

sclass Google extends DynModule {
  S query;
  L<SS> result;
  
  transient Q q;
  transient int maxInputLength = 120;
  transient NotTooOften notTooOften = onlyEvery10Secs();
  transient WaitForStableValue<S> waitForStableValue = new(5.0);
  transient volatile bool calculating;
  transient JTable table;
  transient SimpleLiveValue<S> lvQuery = stringLiveValue();
  
  JComponent visualize() {
    ret jLiveValueSection(lvQuery, dataToTable_uneditable(result, table = sexyTable()));
  }
  
  void unvisualize() { table = null; }  
  
  void start {
    lvQuery.set(query);
    q = startQ();
    ownTimer(doEvery(1000, r update));
  }
  
  void update {
    lock programLock();
    S s = dm_getInterestingString();
    if (nempty(s) && l(s) <= maxInputLength) { // TODO: more quality checks?
      waitForStableValue.set(s);
    }
    
    fS q = waitForStableValue!;
    if (nempty(q) && neq(q, query) && allowedToGoogleSomething())
      this.q.add(r { calc(q) });
  }
  
  void calc(S q) {
    if (eq(query, q)) ret;
    query = q; result = null;
    lvQuery.set(q);
    calculating = true;
    try {
      L<T3<S>> l = quickGoogle2(q);
      result = map(l, func(T3<S> t) -> SS {
        litorderedmap("Result" := second(t), "Desc" := third(t), "Link" := first(t))
      });
      JTable t = table;
      if (t != null)
        dataToTable_uneditable(result, t);
    } finally {
      calculating = false;
    }
  }
  
  bool allowedToGoogleSomething() {
    ret notTooOften.canDoAgain_willDoIfTrue();
  }
}