Get flash to fully experience Pearltrees
Reference of the C++ Language Library, with detailed descriptions of its elements and examples on how to use its functions The standard C++ library is a collection of functions, constants, classes, objects and templates that extends the C++ language providing basic functionality to perform several tasks, like classes to interact with the operating system, data containers, manipulators to operate with them and algorithms commonly needed. It can be divided into: C Library The elements of the C language library are also included as a subset of the C++ Standard library. These cover many aspects, from general utility functions and macros to input/output functions and dynamic memory management functions:
Accumulators Framework for incremental calculation, and collection of statistical accumulators. Author(s) Eric Niebler First Release
Description Synopsis Definitions Examples Rationale Header Files Template Parameters Concepts modeled Type requirements Public base classes Nested type names Public data members Constructors Destructor Member functions Non-member functions Exception guarantees Changes from previous version(s) See also Acknowledgements Description The dynamic_bitset class represents a set of bits.
“ Make simple things easy. ” -- Larry Wall What is BOOST_FOREACH ? In C++, writing a loop that iterates over a sequence is tedious. We can either use iterators, which requires a considerable amount of boiler-plate, or we can use the std :: for_each () algorithm and move our loop body into a predicate, which requires no less boiler-plate and forces us to move our logic far from where it will be used.
Random numbers are useful in a variety of applications. The Boost Random Number Library (Boost.Random for short) provides a variety of generators and distributions to produce random numbers having useful properties, such as uniform distribution. You should read the concepts documentation for an introduction and the definition of the basic concepts. For a quick start, it may be sufficient to have a look at random_demo.cpp . For a very quick start, here's an example:
Boost Test Library Gennadiy Rozental < boost-test =at= emailaccount =dot= com > Copyright © 2001-2007 Gennadiy Rozental
For accessing data based on key lookup, the C++ standard library offers std :: set , std :: map , std :: multiset and std :: multimap . These are generally implemented using balanced binary trees so that lookup time has logarithmic complexity. That is generally okay, but in many cases a hash table can perform better, as accessing data has constant complexity, on average. The worst case complexity is linear, but that occurs rarely and with some care, can be avoided. Also, the existing containers require a 'less than' comparison object to order their elements.