Chapter 17. Boost.Intrusive :: The Boost C++ Libraries BoostBook Documentation Subset :: База знаний boost

:: Acknowledgements

:: Advanced lookup and insertion functions for associative containers

:: Any Hooks: A single hook for any Intrusive container

:: Auto-unlink hooks

:: Binary search tree hooks: bs_set_base_hook and bs_set_member_hook

:: Cloning Boost.Intrusive containers

:: Concepts explained

:: Concept summary

:: Containers with custom ValueTraits

:: Design Notes

:: Erasing and disposing values from Boost.Intrusive containers

:: How to use Boost.Intrusive

:: Indexes

:: Intrusive and non-intrusive containers

:: Intrusive associative containers: set, multiset, rbtree

:: Intrusive avl tree based associative containers: avl_set, avl_multiset and avltree

:: Intrusive doubly linked list: list

:: Intrusive scapegoat tree based associative containers: sg_set, sg_multiset and sgtree

:: Intrusive singly linked list: slist

:: Intrusive splay tree based associative containers: splay_set, splay_multiset and , splay_tree

:: Intrusive treap based associative containers: treap_set, treap_multiset and treap

:: Map and multimap-like interface for associative containers

:: Node algorithms with custom NodeTraits

:: Obtaining iterators from values

:: Obtaining the same types and reducing symbol length

:: Performance

:: Presenting Boost.Intrusive containers

:: Recursive Boost.Intrusive containers

:: Reference

:: References

:: Release Notes

:: Safe hooks

:: Scary Iterators

:: Semi-Intrusive unordered associative containers: unordered_set, unordered_multiset

:: Stability and insertion with hint in ordered associative containers with equivalent keys

:: Tested compilers

:: Thread safety guarantees

:: Using function hooks

:: Using smart pointers with Boost.Intrusive containers

:: When to use?

:: Главная ::