I’m doing distinct values when like looping through a list of values or fields.
Dictionary<string, int> _ddistinctValues = new Dictionary<string, int>();
foreach(string _word in _words) {
if(!_ddistinctValues.ContainsKey(_word)) {
_ddistinctValues.Add(_word, 1);
}
}
Is there a better ways to do this without saving the “1” integer value to save space? I’m using hashtable to get distinct values faster. Maybe hash the wordname without the value, just distinct keys? Is there a class in C# that can do this?
It is not a big issue. Just wondering.
Thanks.
Just use LINQ and call
Distinct()on the list. You might want to throw the results into another list.This would internally use a
HashSet<T>to determine uniqueness which would be the collection you’d be interested in.