KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I've been coding in c++ and java entirety of my life but on C#, I feel like it's a totally different animal. In case of hash collision in Dictionary container in c#, what does it do? or does it even detect the collision? In case of collisions in similar containers in SDL, some would make a key value section link data to key value section like linked list, or some would attempt to find different hash method. [Update 10:56 A.M. 6/4/2010] I am trying to make a counter per user. And set user # is not defined, it can both increase or decrease. And I'm expecting the size of data to be over 1000. So, I want : fast Access preferably not O(n), It important that I have close to O(1) due to requirement, I need to make sure I can force log off people before they are able to execute something silly. Dynamic growth and shrink. unique data. Hashmap was my solution, and it seems Dictionary is what is similar to hashmap in c#...
Tags (comma-separated)
Save Edits
Cancel