🚀 go-pugleaf

Thanks John, I'll take a look at this approach.  It looks pretty good.

Kevin

John C. Sinues <sinues@prc.prc.mrms.navy.mil> wrote in article
<352B3794.CA9396DD@prc.prc.mrms.navy.mil>...
> It sound likes you could use a Hashtable (java.util.Hashtable) which
> is like a lookup array.  Visually, your data structure would look
> something like this:
>     Hashtable:  myObject2
>     key1->myObjects1, myObjects2
>     key2->myObjects3, myObjects4, myObjects5
>     key3->myObjects6
>     key4->myObjects7, myObjects8
> 
> "myObject2" would be defined as a hashtable with its keys (key1, key2,
> key3, and key4)  being the "pointers" to the objects defined in your
> myObjects2 array.  The data in your myObjects array are the lookup
> value(s) for the keys.
> 
> Hope this helps.