[Home]LibrariesUnderConstruction-New

BOOST WIKI | RecentChanges | Preferences | Page List | Links List

Difference (from prior major revision) (no other diffs)

Removed: 7,10d6
* Xpressive - Description: advanced regular expression template library that allows regexes to be written as expression templates (statically bound) or as strings (dynamically bound) and allows regexes to nest and call each other recursively (like perl6) and bind to semantic actions (like Spirit). Author: Eric Niebler eric@boost-consulting.com>; Review Manager: needed; Download: http://boost-sandbox.sf.net/vault/index.php?directory=eric_niebler; Docs: http://boost-sandbox.sf.net/libs/xpressive; Review Date: September 8, 2005.

* TR1? -Description: The TR1 library provides an implementation of the C++ Technical Report on Standard Library Extensions. This library does not itself implement the TR1 components, rather it's a thin wrapper that will include your standard library's TR1 implementation (if it has one), otherwise it will include the Boost Library equivalents, and import them into namespace std::tr1. Functionality supported includes: Reference Wrappers, Smart Pointers, Class template result_of.,Function template mem_fn., Function Object Binders, Polymorphic function wrappers, Type Traits, Random Number Generators and Distributions, Tuples, Tuple Interface to std::pair, Fixed Size Array, Hash Function Objects, Regular Expressions, Complex Number Algorithm Overloads, Complex Number Additional Algorithms, Functionality in TR1 but not yet available in this implementation: Mathematical Special Functions, Unordered Associative Set (Hash Table), Unordered Associative Map (Hash Table), C99 C language additions. This library also makes changes to Boost.Config, and adds some new functionality to Boost.Math, reviewers should start with the readme.html in the root directory of the zip file. Author - John Maddock john@johnmaddock.co.uk, Review Manager - needed, Download - http://boost-sandbox.sourceforge.net/vault/index.php?&direction=0&order=&directory=tr1 Docs - in download file, Review Date: September 20, 2005.


Changed: 13c9
* [Fixed Strings]? - Description: The fixed string library provides buffer overrun protection for static sized strings (char s[ n ]). It provides a C-style string interface for compatibility with C code (for example, porting a C program to C++). There is also a std::string-style interface using a class based on flex_string by Andre Alexandrescu with a few limitations due to the non-resizable nature of the class. Author - Reece Dunn msclrhd@hotmail.com; Review Manager - Beman Dawes bdawes@acm.org; Download: boosts-sandbox/boost/fixed_string; Docs: boosts-sandbox/boost/fixed_string; Review Date: needed.
* [Fixed Strings]? - Description: The fixed string library provides buffer overrun protection for static sized strings (char s[ n ]). It provides a C-style string interface for compatibility with C code (for example, porting a C program to C++). There is also a std::string-style interface using a class based on flex_string by Andre Alexandrescu with a few limitations due to the non-resizable nature of the class. Author - Reece Dunn msclrhd@hotmail.com; Review Manager - Beman Dawes bdawes@acm.org; Download: boosts-sandbox/boost/fixed_string; Docs: boosts-sandbox/boost/fixed_string; Review Date: in progress or past.

Changed: 39c35
* [/any iterator]? --Description: provides any_iterator<T, IteratorCategory?> class template that is able to hold an arbitrary iterator to T (basically it's like boost::any in application to iterators; the concept is also known as "polymorphic iterator", the name I don't like very much :)
* [/any iterator]? --Description: provides any_iterator<T, IteratorCategory?> class template that is able to hold an arbitrary iterator to T (basically it's like boost::any in application to iterators; the concept is also known as "polymorphic iterator", the name I don't like very much :). You can find an implementation of any_iterator in the Adobe Open Source Library.

Prototype (that means this is a preliminary page!) of a new underconstruction page which will link to a page for each library. The idea is to keep the information on this page small so that it can be rapidly scanned. Details will go on the page associated with each individual library. The page will have categories of development status.

-- see http://www.boost.org/more/formal_review_schedule.html for details

Review Pending

Preliminary

On Hold

Abandoned


BOOST WIKI | RecentChanges | Preferences | Page List | Links List
Edit text of this page | View other revisions
Last edited January 20, 2006 8:29 am (diff)
Search:
Disclaimer: This site not officially maintained by Boost Developers