Glossary: Data Structures and Algorithms in C++
Hash set
Also written: std::unordered_set, unordered_set
A hash map with keys and no values. contains(x) and insert(x) are O(1) on average, so a `seen` set can find duplicates in one pass.
Glossary: Data Structures and Algorithms in C++
Also written: std::unordered_set, unordered_set
A hash map with keys and no values. contains(x) and insert(x) are O(1) on average, so a `seen` set can find duplicates in one pass.