Re: [boost] Formal Review Requst: String Algorithm Library

From: Phil Nash (phil.nash.lists_at_[hidden])
Date: 2003-03-03 17:28:16

This request seems to have been left up in the air. I know that many are
busy with the release schedule, and there is an identified shortage of
review managers, but it would have been nice to have at least acknowledged
this request (unless it has been done offlist).
Personally I am very keen to see a library like this included - Although
generally quite simple I have to rewrite many of these algorithms for each
project I work on (or copy from one to the other when I can get round IPR
issues).
Having said that I haven't looked at Pavol's submission in depth yet - but
would certainly make a point of doing so for a review.

Regards,

[)o
IhIL..

----- Original Message -----
From: "Pavol Droba" <droba_at_[hidden]>
To: "Boost mailing list" <boost_at_[hidden]>
Sent: Wednesday, February 26, 2003 5:39 PM
Subject: [boost] Formal Review Requst: String Algorithm Library

> Hi Boosters,
>
> I'd like to ask for scheduling a formal review for the string algorithm
library.
>
> It is mostly finished ( only some final polishing of the documentation is
in progress ).
>
> Its implementation can be found in the boost sandbox.
> ( Is it required to upload it to yahoo groups before the review is
scheduled? )
>
> Overview:
>    "The String Algorithm Library provides a generic implementation of
various string-related
>     algorithms which are missing in STL. It is an extension to the
algorithms library of STL.
>     Algorithms in this library include 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. "
>
> Regards,
>
> Pavol
> _______________________________________________
> Unsubscribe & other changes:
http://lists.boost.org/mailman/listinfo.cgi/boost
>