New libraries
five new libraries add streams, hash objects, named parameters, polymorphic containers, and a C99/C++ preprocessor.
five new libraries add streams, hash objects, named parameters, polymorphic containers, and a C99/C++ preprocessor.
graph algorithms and signals run faster; dijkstra now O(V log V) with relaxed heap.
regex gains optional Unicode via ICU; Boost.Python now supports Embedded VC++ 4 and GCC‑3.3 on macOS.
serialization of variants and shared pointers hardened; any_cast now directly accesses held values.
ref_list_of, cref_list_of, bind comparisons, front(), back(), operator[] and enhanced option parsing improve ergonomics.
| Platform | File | SHA256 Hash |
|---|---|---|
|
Unix
|
boost_1_33_0.tar.bz2 |
|
| boost_1_33_0.tar.gz |
|
|
|
Windows
|
boost_1_33_0.zip |
|
August 11th, 2005 12:00 GMT
any_cast has been enhanced to allow direct
access to any's held value.
ref_list_of() and cref_list_of() for generating anonymous ranges.
bind(&X::name, _1) < bind(&X::name, _2).
floyd warshall
all pairs
shortest paths,
from Lauren Foutz and Scott Hill.
astar search,
from Kristopher Beevers and Jufeng Peng.
fruchterman reingold
force directed
layout, from Doug
Gregor and Indiana University.
biconnected components
and articulation points, from Jeremy Siek,
Janusz Piwowarski, and Doug Gregor.
sequential vertex
coloring has been
updated, tested, and documented.
gursoy atun
layout, from Jeremiah
Willcock and Doug Gregor of Indiana University.
king ordering,
from D. Kevin McGrath of Indiana University.
cuthill mckee
ordering has been
recast as an invocation of breadth
first search
and now supports graphs with multiple components.
dijkstra shortest
paths now uses
a relaxed heap [61]
as its priority queue, improving its complexity to O(V log V) and
improving real-world performance for larger graphs.
read graphviz
now has a new, Spirit-based parser that works for all graph types
and supports arbitrary properties on the graph, from Ron Garcia.
The old, Bison-based GraphViz reader has been deprecated and will
be removed in a future Boost release. write graphviz
also supports dynamic properties.
subgraph: get_property now refers to the
subgraph property, not the root graph's property.
dynamic properties
class, which provides dynamically-typed access to a set of property maps.
init<optional<> >
and XXX_FUNCTION_OVERLOADS() for only the last overload.
vector<T*> with the indexing suite.
Random Number
Library:
Improved initialization for mersenne_twister,
algorithm by Makoto Matsumoto and Takuji Nishimura, implemented for Boost
by Jens Maurer.
Note: All test vectors for mersenne_twisters
constructed or seeded without parameters or with a single unsigned int
parameter become invalid.
iterator
range like front(), back() and operator[]().
Boost is tested on a wide range of compilers and platforms. Since Boost libraries rely on modern C++ features not available in all compilers, not all Boost libraries will work with every compiler. The following compilers and platforms have been extensively tested with Boost, although many other compilers and platforms will work as well. For more information, see the regression test results.
Douglas Gregor
managed this release.
A great number of people contributed their time and expertise to make this release possible. Special thanks go to Aleksey Gurtovoy and Misha Bergal, who managed to keep the regression testing system working throughout the release process; David Abrahams, Beman Dawes, Aleksey Gurtovoy, Rene Rivera and Jonathan Turkanis for greatly improving the quality of this release; Rene Rivera for the new Boost web page design; and Zoltan "cad" Juhasz for the new Boost logo.
Boost is publicly released three times a year in April, August, and December. Each release has updates to existing libraries, and any new libraries that have passed the rigorous acceptance process.