Store an object using a key in Hashtable

That is the way that hash tables typically work. If you do not want that then do not use a hash table. Hash tables were first used when computer memory and disk drive storage was expensive. They used to be exremely expensive compared to now. Typically, when creating a hash table (adding items), you would first check to see if the hash currently exists and you have a way to store multiple items for a hash value. If the hash already exists with a different item, then you would add the new item to the list of items for that hash value. When doing a lookup, if there is more than one item for a hash, then you would do a sequential search for the item. Using current technology, it is usually more efficient for you and the computer to use a different collection type.

Hi Vikas,

Agreed with @vulpes.


The existing object will be overwritten and thus it will be lost.


Thanks