sclass LinkedTreeMap_simple<A, B> {
  Map<A, B> map;
  new L<A> list;

  *() { map = new TreeMap; }
  *(Map<A, B> *map) {}

  public B get(Object key) {
    ret map.get(key);
  }
  
  public B put(A key, B value) {
    if (!map.containsKey(key))
      list.add(key);
    return map.put(key, value);
  }
  
  public bool containsKey(O key) {
    ret map.containsKey(key);
  }
  
  public ItIt<A> keyIterator() {
    ret iterator(list);
  }
  
  public ItIt<A> entryIterator() {
    ret mapI(keyIterator(), a -> new Map.Entry<A, B>() {
      public A getKey() { ret a; }
      public B getValue() { ret map.get(a); }
    });
  }
}