Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Although a DataTable is a memory hog, wouldn’t a DataTable be the best choice to implement and IdentityMap if the set of objects is very large since retrieval time is O(1)?
Update
If I decide to use IDictionary, do I sacrifice speed when retrieving my objects?
Any of
Dictionary<,>,SortedList<,>orSortedDictionary<,>would be obvious choices – but note tha sorting becomes an issue here…Dictionary<,>doesn’t guarantee any particular order; the other two order by the keys rather than insertion order.Note also that dictionary won’t play very nicely with data-binding. It might be preferable to create something like a
Collection<T>, but encapsulate aDictionary<,>for lookups. It all depends on the scenario, of course.More information on the performance etc differences between
SortedList<,>etc can be found here.