Boost C++ Libraries

...one of the most highly regarded and expertly designed C++ library projects in the world. Herb Sutter and Andrei Alexandrescu, C++ Coding Standards

This is the documentation for an old version of Boost. Click here to view this page for the latest version.
PrevUpHomeNext

Part I. The Boost C++ Libraries (BoostBook Subset)

Table of Contents

1. Boost.Accumulators
Preface
User's Guide
Acknowledgements
Reference
2. Boost.Any
Introduction
Examples
Reference
Acknowledgements
3. Boost.Array
Introduction
Reference
Design Rationale
For more information...
Acknowledgements
4. Boost.Chrono 1.2.1
Overview
User's Guide
Reference
Appendices
5. Boost.Concept_Check
Concept reference
6. Boost.Container
Introduction
Efficient insertion
Containers of Incomplete Types
Non-standard containers
C++11 Conformance
Other features
History and reasons to use Boost.Container
Indexes
Boost.Container Header Reference
Acknowledgements, notes and links
Release Notes
7. Boost.Date_Time
Conceptual
General Usage Examples
Gregorian
Posix Time
Local Time
Date Time Input/Output
Serialization
Details
Examples
Library Reference
8. Boost.Foreach
Introduction
Extensibility
Portability
Pitfalls
History and Acknowledgements
9. Boost.Function
Introduction
History & Compatibility Notes
Tutorial
Reference
Frequently Asked Questions
Miscellaneous Notes
Testsuite
10. Boost.Functional/Hash
Introduction
Tutorial
Extending boost::hash for a custom data type
Combining hash values
Portability
Disabling The Extensions
Change Log
Rationale
Reference
Links
Acknowledgements
11. Boost.Heap
Introduction & Motivation
Concepts & Interface
Data Structures
Reference
Acknowledgements
12. Boost.Interprocess
Introduction
Quick Guide for the Impatient
Some basic explanations
Sharing memory between processes
Mapping Address Independent Pointer: offset_ptr
Synchronization mechanisms
Managed Memory Segments
Allocators, containers and memory allocation algorithms
Memory allocation algorithms
Direct iostream formatting: vectorstream and bufferstream
Ownership smart pointers
Architecture and internals
Customizing Boost.Interprocess
Acknowledgements, notes and links
Indexes
Boost.Interprocess Reference
13. Boost.Intrusive
Introduction
Intrusive and non-intrusive containers
How to use Boost.Intrusive
When to use?
Concept summary
Presenting Boost.Intrusive containers
Safe hooks
Auto-unlink hooks
Intrusive singly linked list: slist
Intrusive doubly linked list: list
Intrusive associative containers: set, multiset, rbtree
Semi-Intrusive unordered associative containers: unordered_set, unordered_multiset
Intrusive splay tree based associative containers: splay_set, splay_multiset and , splay_tree
Intrusive avl tree based associative containers: avl_set, avl_multiset and avltree
Intrusive scapegoat tree based associative containers: sg_set, sg_multiset and sgtree
Intrusive treap based associative containers: treap_set, treap_multiset and treap
Advanced lookup and insertion functions for associative containers
Erasing and disposing values from Boost.Intrusive containers
Cloning Boost.Intrusive containers
Using function hooks
Recursive Boost.Intrusive containers
Using smart pointers with Boost.Intrusive containers
Obtaining iterators from values
Any Hooks: A single hook for any Intrusive container
Concepts explained
Node algorithms with custom NodeTraits
Containers with custom ValueTraits
Thread safety guarantees
Obtaining the same types and reducing symbol length
Design Notes
Performance
Release Notes
Tested compilers
References
Acknowledgements
Indexes
Reference
14. Boost.Lambda
In a nutshell
Getting Started
Introduction
Using the library
Lambda expressions in details
Extending return type deduction system
Practical considerations
Relation to other Boost libraries
Contributors
Rationale for some of the design decisions
Bibliography
15. Boost.Lexical_Cast 1.0
Motivation
Examples
Synopsis
Frequently Asked Questions
Changes
Performance
16. Boost.Move
What is Boost.Move?
Introduction
Implementing copyable and movable classes
Composition or inheritance
Movable but Non-Copyable Types
Containers and move semantics
Constructor Forwarding
Move iterators
Move inserters
Move algorithms
Emulation limitations
How the library works
Thanks and credits
Release Notes
Reference
17. Boost.MPI
Introduction
Getting started
Tutorial
Reference
Python Bindings
Design Philosophy
Performance Evaluation
Revision History
Acknowledgments
18. Boost.Program_options
Introduction
Tutorial
Library Overview
How To
Design Discussion
Acknowledgements
Reference
19. Boost.PropertyTree
What is Property Tree?
Five Minute Tutorial
Property Tree as a Container
Property Tree Synopsis
How to Populate a Property Tree
How to Access Data in a Property Tree
Appendices
Reference
20. Boost.Proto
Preface
Users' Guide
Reference
Appendices
21. Boost.Random
Introduction
Tutorial
Reference
Performance
History and Acknowledgements
22. Boost.Ratio 1.0.1
Overview
User's Guide
Reference
Appendices
23. Boost.Ref
Introduction
Reference
Acknowledgements
24. Boost.Signals
Introduction
Tutorial
Reference
Frequently Asked Questions
Design Overview
Design Rationale
Testsuite
25. Boost.Signals2
Introduction
Tutorial
Example programs
Reference
Thread-Safety
Frequently Asked Questions
Design Rationale
Signals2 API Changes
Testsuite
26. Boost.StaticAssert
Overview and Tutorial
How it works
Test Programs
27. Boost String Algorithms Library
Introduction
Release Notes
Usage
Quick Reference
Design Topics
Concepts
Reference
Rationale
Environment
Credits
28. Thread
Overview
Changes since
Future
Thread Management
Synchronization
Thread Local Storage
Date and Time Requirements
Acknowledgments
Compliance with standard
29. Boost.TR1
Introduction
Usage
Configuration
TR1 By Subject
TR1 By Header
Implementation
Testing
30. Boost.Tribool
Introduction
Tutorial
Reference
Testsuite
31. Boost.Typeof
Motivation
Tutorial
Reference
Other considerations and tips
Contributed By:
Acknowledgements
32. Boost.Units 1.1.0
Introduction
Quick Start
Dimensional Analysis
Units
Quantities
Examples
Utilities
Reference
Installation
FAQ
Acknowledgements
Help Wanted
Version Info
Release Notes
TODO
33. Boost.Unordered
Introduction
The Data Structure
Equality Predicates and Hash Functions
Comparison with Associative Containers
C++11 Compliance
Implementation Rationale
Change Log
Reference
Bibliography
34. Boost.Variant
Introduction
Tutorial
Reference
Design Overview
Miscellaneous Notes
References
35. Boost.Xpressive
Preface
User's Guide
Reference
Acknowledgments
Appendices

PrevUpHomeNext