I\'m trying to figure out what data structure to quickly support the following operations: Add a string (if it\'s not there, add it, if it is there, increment a counter for the word)
public class FontType { ... public String Name { get { return _name; } } public String DisplayName { get { return _displayName; } }
How do I decid开发者_如何学运维e when should I do rehashing of entire hash table?This depends a great deal on how you\'re resolving collisions. If you user linear probing, performance usually starts t
How do I make a derived class from Hashtable, objects of which can be added, 开发者_C百科but cannot be removed or replaced?
加载中,请稍侯......