Hi there! I'm currently writing an application where I have, at one point, to iterate recursively through a LOT of directories (let's say something around 100k). Problem is, I also have to follow symbolic links, which some of them may point to directories already visited by the algorithm. But due …

A BTreeSet can do it in a logarithmic number of operations.

Search optimization in a very (100k+) large paths history

Topic		Replies	Views
What's the fastest way to store 300 million unique values in a HashSet? help	41	4310	March 16, 2025
Naive trie implementation is slow and fails with large inputs, it uses std::collections::HashMap help	7	1300	March 28, 2017
Reading 2gb file into memory, and fast lookups help	8	386	August 16, 2024
WalkDir performance - a small experiment	6	4159	January 12, 2019
Recursive directory traversal announcements	0	3555	September 27, 2015