std::hive — unordered container with stable iterators and O(1) insert/erase.
1#include <hive>23std::hive<int> h;45// O(1) insert6auto it1 = h.insert(1);7auto it2 = h.insert(2);8auto it3 = h.insert(3);910// O(1) erase — iterators stay valid11h.erase(it2);12std::cout << *it1; // Still valid!1314// Iteration (skips erased elements)15for (int x : h) {16 std::cout << x << " ";17}1819// Sorted order (by insertion or by predicate)20std::hive<int, std::less<int>> sorted_hive;21sorted_hive.insert(3);22sorted_hive.insert(1);23sorted_hive.insert(2);24// Iteration: 1, 2, 32526// Reserve27h.reserve(1000);2829// Size30std::cout << h.size();
Advantages: