public boolean checkEquals(ComplexKeyHashMap.Entry e,
    Object key1,
    Object key2) 
{
        Entry ee = (Entry) e;
        return ee.key1.get() == key1 && ee.key2.get() == key2;
}

 public WeakDoubleKeyHashMap.Entry createEntry() 
{
      return new Entry ();
}

 public final Object get(Object key1,
    Object key2) 
{
//    expungeStaleEntries();
    int h = hash (31*key1.hashCode()+key2.hashCode());
    ComplexKeyHashMap.Entry e = table [h & (table.length-1)];
    for (; e != null; e = e.next)
      if (e.hash == h && checkEquals((Entry) e, key1, key2))
        return e;
    return null;
}

 public WeakDoubleKeyHashMap.Entry getOrPut(Object key1,
    Object key2) 
{
//    expungeStaleEntries();
    int h = hash (31*key1.hashCode()+key2.hashCode());
      final ComplexKeyHashMap.Entry[] t = table;
      final int index = h & (t.length - 1);
    ComplexKeyHashMap.Entry e = t[index];
    for (; e != null; e = e.next)
      if (e.hash == h && checkEquals( e, key1, key2))
        return (Entry) e;
    ComplexKeyHashMap.Entry entry = createEntry(key1, key2, h, index);
    t[index] = entry;
    if ( ++size == threshold )
      resize(2* t.length);
    return (Entry) entry;
}

 public final ComplexKeyHashMap.Entry remove(Object key1,
    Object key2) 
{
    expungeStaleEntries();
    int h = hash (31*key1.hashCode()+key2.hashCode());
    int index = h & (table.length -1);
    for (ComplexKeyHashMap.Entry e = table [index], prev = null; e != null; prev = e, e = e.next ) {
      if (e.hash == h && checkEquals((Entry) e, key1, key2)) {
        if (prev == null)
          table [index] = e.next;
        else
          prev.next = e.next;
        size--;
        e.next = null;
        return e;
      }
    }
    return null;
}

 public int size() 
{
        expungeStaleEntries();
        return super.size();
}