3 #include <unordered_set>
15 template<
class Key,
class Hash = std::hash<Key>,
class Pred = std::equal_to<Key> >
19 using iterator =
typename std::unordered_set< Key, Hash, Pred >::iterator;
21 void insert( Key
const & val );
22 void erase( Key
const & val );
24 int count( Key
const & val );
26 void foreach( std::function<
void( Key
const & ) >
const & fun );
38 std::unordered_set< Key, Hash, Pred > items;
39 std::unordered_set< Key, Hash, Pred > toinsert;
40 std::deque<
typename decltype( items )::
iterator > iterators;