Boost Announcement :
From: Thorsten Ottosen (nesotto_at_[hidden])
Date: 2003-10-17 20:34:01
The review of Pavol Droba's string algorithms library starts today and runs
until the 30th of October.
>From the introduction:
"The String Algorithm Library provides a generic implementation of
string-related algorithms which are missing in STL. It is an extension to
the algorithms library of STL and it includes trimming, case conversion,
predicates and find/replace functions. All of them come in different
variants so it is easier to choose the best fit for a particular need.
The implementation is not restricted to work with a particular container
(like a std::basic_string), rather it is as generic as possible. This
generalization is not compromising the performance since algorithms are
using container specific features when it means a performance gain."
When reviewing the library, please remember to go through this list:
A part of the library interacts with the regular expressions
(http://www.boost.org/libs/regex/index.htm) and requires one
to build that first.
The library has so far been tested with these compilers:
a.. Microsoft Visual C++ 7.0
a.. Microsoft Visual C++ 7.1
a.. GCC 3.2
a.. GCC 3.3.1
Please refer to the portability section of the accompanying documentation
for more information.
If you try to review the
library using a challenged compiler, please try to focus on the most useful
subset of the library, that is,
simply try if the library works with std::string; just having this
functionality might be a great benefit for many users.
If you have the time and know how to make something work on your compiler,
please work with Pavol to
solve those issues. If the change is very small, it might be appropriate to
update the review source code; otherwise
it will help Pavol's porting efforts when the time comes for a new release.
The library and its documentation can be downloaded on the sandbox-webspace:
Please note that both zips should be unziped to a current cvs snapshot.
Thorsten - review manager
Boost-announce list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk