// always keeps a dynamically updated list of the n most probable
// results

// not synchronized
srecord noeq PSCollectMostProbable<A>(
  int maxResults,
  IVF1<IVF1<A>> action) implements IF0<Set<WithProbability<A>>> {
  
  new ProbabilisticScheduler ps;
  TreeSetWithDuplicates<WithProbability<A>> results = new(reverseComparator());
  
  *(int *maxResults, IVF2<IProbabilisticScheduler, IVF1<A>> action) {
    this.action = out -> action.get(ps, out);
  }
  
  void add(WithProbability<A> result) {
    if (result == null) ret;
    results.add(result);
    truncateTreeSetWithDuplicates(results, maxResults);
  }
  
  selfType run() {
    action.get(result -> add(WithProbability(ps.currentProbability(), result));
    this;
  }
  
  // results sorted by probability. instant
  public Set<WithProbability<A>> results aka get() {
    ret results;
  }
}