Timeline for Iterating thousands of times over large collections: advices
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 24, 2012 at 18:19 | history | post merged (destination) | |||
| Aug 24, 2012 at 14:06 | history | migrated | from stackoverflow.com (revisions) | ||
| Aug 22, 2012 at 18:39 | comment | added | roland | Since I posted my question, I reading a lot about hash (see your previous comment) and list. It seems lookup are not loops, as they are has based and built to be performant. | |
| Aug 22, 2012 at 18:19 | comment | added | roland | No particular assumption. Only thought that other solutions would have brought other benefits | |
| Aug 22, 2012 at 17:31 | comment | added | Blam | @roland So you had the same code and came to the conclusion paths.ContainsKey(key) was the bottle neck? How did you determine that? | |
| Aug 22, 2012 at 16:51 | comment | added | roland | This is what I first came up with. Isn't it possible to improve performance? | |
| Aug 22, 2012 at 16:33 | comment | added | Blam | The potential problem here is duplicate FileName. But still +1 | |
| Aug 22, 2012 at 16:22 | comment | added | Daniel Hilgarth |
I guess the line in the second pass should be string key = new System.IO.FileInfo(path).FileName;.
|
|
| Aug 22, 2012 at 16:16 | history | answered | SecurityMatt | CC BY-SA 3.0 |