Here is a hash table example I wrote for you. Please remember hash tables perform best when they are approx 75 % full.

In Java (and J#), please use the .GetHashCode() method to return the hash key for the objects.

If you want to allocate more space in runtime, please use the rehash() method on the hash table.

Sorry I can't give more advice on the arcitecture, as I don't have the details.

public class hello
{
   public int number = 0;

   public hello( int numb )
   {
       this.number = numb;
    }

   int retnumb( )
   {
       return this.number;
   }
}

public class Class1
{
   public Class1()
   {
       System.out.println("Start");
       java.util.Hashtable hash = new java.util.Hashtable(100);

       hello one = new hello(1);
       hello two = new hello(2);

       // key object
       hash.put( new Integer( one.GetHashCode()), (Object)one );
       hash.put( new Integer( two.GetHashCode()), (Object)two );

       // key
       hello got = (hello)hash.get( new Integer( one.GetHashCode()) );
       System.out.println("Got :"+got.retnumb() );
       System.out.println("End");
   }

   /** @attribute System.STAThread() */
   public static void main(String[] args)
   {
       new Class1();
   }
}

Regards,
Lars-Inge T?nnessen
www.larsinge.com