OK gurus ;)
We are in need of a class that acts like a bucket. That is, something like a hash table, but does NOT get overwritten if another object with the same key is added. The same key must allow multiple values.
And here is the catch, it has to be 1.1 compatible. But don't worry about that too much. Can anybody help me out with a data structure like this?
Thanks in advance.
Jay Baker
