---

Cache.java

package gov.nasa.arc.ase.util;

//#ifdef JDK11






//#else JDK11
import java.util.*;
//#endif JDK11

public class Cache {
  public interface Listener {
    public void elementRemoved(Object o);
  }
  
  private class EntryComparator implements Comparator {
    public int compare(Object o1, Object o2) {
//#ifdef JDK11


//#else JDK11
      Map.Entry e1 = (Map.Entry)o1;
      Map.Entry e2 = (Map.Entry)o2;
//#endif JDK11
      Index c1 = (Index)e1.getValue();
      Index c2 = (Index)e2.getValue();

      return c1.cnt - c2.cnt;
    }
  }

  private class Index {
    int cnt;

    public Index() {
      cnt = 0;
    }

    public Index(int value) {
      cnt = value;
    }

    public Object clone() {
      return new Index(cnt);
    }

    public boolean equals(Object o) {
      return ((Index)o).cnt == cnt;
    }

    public String toString() {
      return new Integer(cnt).toString();
    }
  }

  private Hashtable ht = new Hashtable();
  private Index     lowest = new Index(0);
  private Index     highest = new Index(0);
  private int       count = 0;
  private int       size;
  private Listener  listener;

  public Cache(int s) {
    size = s;
    listener = null;
  }  
  public Cache(int s, Listener l) {
    size = s;
    listener = l;
  }  
  private Object getKey(Index c) {
    for(Enumeration e = ht.keys(); e.hasMoreElements(); ) {
      Object k = e.nextElement();
      Object v = ht.get(k);
      if(v.equals(c)) return k;
    }
    return null;
  }  
  private Index getValue(Index c) {
    for(Enumeration e = ht.keys(); e.hasMoreElements(); ) {
      Object k = e.nextElement();
      Object v = ht.get(k);
      if(v.equals(c)) return (Index)v;
    }
    return null;
  }  
  private int lowestValue() {
    int min = 0;
    boolean found = false;

    for(Enumeration e = ht.elements(); e.hasMoreElements(); ) {
      Index v = (Index)e.nextElement();

      if(!found || v.cnt < min) {
    found = true;
    min = v.cnt;
      }
    }

    return min;
  }  
  private void next() {
    highest.cnt++;
    if(highest.cnt < 0) {
//#ifdef JDK11















//#else JDK11
      ArrayList entries = new ArrayList(ht.entrySet());
      Collections.sort(entries, new EntryComparator());
//#endif JDK11
      int idx = 0;

      ht = new Hashtable();
      for(Iterator i = entries.iterator(); i.hasNext(); idx++) {
//#ifdef JDK11

//#else JDK11
    Map.Entry e = (Map.Entry)i.next();
//#endif JDK11
    ht.put(e.getKey(), new Index(idx));
      }

      lowest.cnt = 0;
      highest.cnt = entries.size();
    }
  }  
  public boolean put(Object o) {
    if(ht.containsKey(o)) {
      Index c = (Index)ht.get(o);

      if(c.cnt != highest.cnt-1) {
    int old = c.cnt;

    c.cnt = highest.cnt;
    if(old == lowest.cnt)
      lowest.cnt = lowestValue();
    next();
      }

      return false;
    }

    if(count == size)
      removeLowest();
    else
      count++;

    ht.put(o, new Index(highest.cnt));
    next();

    return true;
  }  
  private void removeLowest() {
    Object key = getKey(lowest);

    ht.remove(key);
    lowest.cnt = lowestValue();
    if(count == 1) highest.cnt = 0;

    if(listener != null) listener.elementRemoved(key);
  }  
  public void setSize(int s) {
    if(s > count) {
      size = s;
    } else {
      while(count > s) {
    removeLowest();
    count--;
      }
      size = s;
    }
  }  
  public String toString() {
    return ht.toString();
  }  
}

---