Click here to Skip to main content
15,892,809 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
Hi,

I need to create a method which will return a list of duplicate values.

Now the method is like,
C#
public static Dictionary<string, List<FileInfo>> GetDuplicateSelectors(Dictionary<FileInfo, List<string>> dictSelectors)

The method is ok with small numbers of input. But for a large set of inputs, the performance will be degraded. So I wanted to use the HashKey<> for searching purpose. So how can I use HashKey in that?

Can anybody please help me doing this?

Thanks
Posted
Updated 11-Jun-12 2:45am
v2
Comments
Zoltán Zörgő 11-Jun-12 8:36am    
What is the code you have tried, and what problem have you encountered?
Sergey Alexandrovich Kryukov 11-Jun-12 13:29pm    
Search where, in the dictionary by key, or in the list? Dictionary does not degrade performance with volume (that's why we use them), they provide nearly O(1) complexity.
You are probably doing something wrong. Can you make a code sample? If so, use "Improve question" above.
--SA

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900