The last three lookup functions require find_next and find_prev primitives, similar to find_front and find_back but from a general offset, rather than 0 from the beginning or the end.
Splicing
Document parts of std::set<int> which don't make sense to implement because int_set<N> is not node-based:
Modifiers
emplaceemplace_hintinsert(fix return types)erase(fix return types)Lookup
findcountlower_boundupper_boundequal_rangeThe last three lookup functions require
find_nextandfind_prevprimitives, similar tofind_frontandfind_backbut from a general offset, rather than0from the beginning or the end.Splicing
Document parts of
std::set<int>which don't make sense to implement becauseint_set<N>is not node-based:node_typeextractmerge