Data Structure used for C#'s Dictionary.KeyCollection
I want to hold a list of strings which performs well when searching for a specific element. As mentioned in the following cheat sheet, Dictionary scales best for this type of operation: http://courses.essex.ac.uk/ce/ce318/www/documents/references/cSharpDataStructuresCheatSheet.pdf However, I don't need a dictionary as I'm only storing strings, not key value pairs (i.e. I'm only interested in the keys). Does anyone know what data structure the dictionary uses for its keys? KeyCollection seems to only be available to Dictionary. My guess is it's using some sort of hashing algorithm, but wondered if anyone had any insight on this? Thanks in advance.
You could use a HashSet<string>.
Using one class in multiple namespaces
Call method in Parallel.Foreach and save the result into the thread safe list
How to compare item from 2 different models when using dynamic model in Razor View
Change the LayoutKind from Fixed to Sequencial for CppSharp C# bindings
Recognize unmanaged code in dll
Error 3004: No mapping specified for properties Invoice.IdEx in Set
Convert Bitmap to Array and send the Array via Networkstream
UdpClient.Receive() equivalent in .NET Core
asp .net error empy rows
Consuming deprecated soap versions in Visual Studio 2015
angular push not updating html table
Force client code to call Service classes instead of Repository classes
Run a raspberry pi discord bot written in C# on linux?
What runs .NET Framework WebApi
Membership provider email validation not working on create new user
How to get a values list from a dictionary where the key matches in a list in c#