HashSet versus Dictionary w.r.t searching time to find if an item exists

by

HashSet vs List vs Dictionary performance test, taken from here.

Add 1000000 objects (without checking duplicates)

Contains check for half the objects of a collection of 10000

Remove half the objects of a collection of 10000

More Related Contents:

  1. Which method performs better: .Any() vs .Count() > 0?
  2. Why are multi-dimensional arrays in .NET slower than normal arrays?
  3. Performance of Arrays vs. Lists
  4. Is it better to call ToList() or ToArray() in LINQ queries?
  5. What’s so wrong about using GC.Collect()?
  6. Why is LINQ JOIN so much faster than linking with WHERE?
  7. String.Join vs. StringBuilder: which is faster?
  8. Using the field of an object as a generic Dictionary key
  9. IDictionary in .NET 4 not covariant
  10. Why isn’t there an XML-serializable dictionary in .NET?
  11. How to measure code performance in .NET?
  12. Does HashSet preserve insertion order?
  13. .NET – Dictionary locking vs. ConcurrentDictionary
  14. What is the difference between HashSet and List?
  15. Why seal a class?
  16. .NET LINQ query syntax vs method chain
  17. Why is the first WCF client call slow?
  18. Do sealed classes really offer performance Benefits?
  19. Anatomy of a “Memory Leak”
  20. Can you get a Func (or similar) from a MethodInfo object?
  21. Entity Framework is Too Slow. What are my options? [closed]
  22. Horrible redraw performance of the DataGridView on one of my two screens
  23. System.IO.FileSystemWatcher to monitor a network-server folder – Performance considerations
  24. How to iterate through Dictionary and change values?
  25. How do I store a dictionary object in my web.config file?
  26. Does .NET assembly size affect performance?
  27. Entity Framework Find vs. Where
  28. Performance: XDocument versus XmlDocument
  29. WPF slow to start on x64 in .NET Framework 4.0
  30. How to implement ConcurrentHashSet in .Net

Leave a Comment