STL之unordered_set

源于https://en.cppreference.com/w/cpp/container/unordered_set的说明

Search, insertion, and removal have average constant-time complexity.

Internally, the elements are not sorted in any particular order, but organized into buckets. Which bucket an element is placed into depends entirely on the hash of its value. This allows fast access to individual elements, since once a hash is computed, it refers to the exact bucket the element is placed into。

总结而言，底层基于哈希，搜索、插入基本都是O(1)的时间。除非出现rehash

C++ 11

#include <iostream>
#include <unordered_set>
 
int main()
{  
// simple comparison demo
    std::unordered_set<int> example = {1, 2, 3, 4};
 
    auto search = example.find(5);
    if (search != example.end()) {
        std::cout << "Found " << (*search) << '\n';
    } else {
        std::cout << "Not found\n";
    }
 
 
}

set，自然没有重复元素，也没有排序。

size()

empty()

count(key)  -- {0,1}

find(key)

clear()

insert(element)

erase(iter)  /erase(element)

#include <unordered_set>
#include <iostream>
int main()
{
    std::unordered_set<int> c = {1, 2, 3, 4, 5, 6, 7, 8, 9};
 
    // erase all odd numbers from c
    for(auto it = c.begin(); it != c.end(); ) {
        if(*it % 2 == 1)
            it = c.erase(it);
        else
            ++it;
    }
 
    for(int n : c) {
        std::cout << n << ' ';
    }
}

更新：unordered_set在默认的情况下是不能插入pair<>作为key的，因为其底层没有实现针对pair的hash函数。当然set是可以使用pair的