sclass LevenList {
  //Set<S> set = ciSet();
  LS list;
  
  *() {}
  *(LS *list) {}
  
  // returns pair(word, distance)
  // or null when search step was not successful
  Iterator<Pair<S, Int>> findClosestWordIterator(S word) {
    if (empty(list)) ret emptyIterator();
    ret iff(new O {
      int limit = Integer.MAX_VALUE-1;
      int idx;
      
      O get() {
        if (idx >= l(list)) ret endMarker();
        S s = list.get(idx++);
        int dist = leven_limitedIC(word, s, limit);
        if (dist < limit) { limit = dist; ret s; }
        null;
      }
    });
  }
}