Hi,
This message is mostly for people who are interested in the string algorithm library.
New version is in the sandbox.
I have redesigned major part of the library, and I think that now its structure is
in quite stable state. I want to start writing the documentation, but first I'd like
to be su
Hi,
According to the discussion, I have changed the naming scheme so it is more conformant
with the standard.
I changed all mutable variants to be plain without any suffix and prefix like "trim(s)"
and non-mutable variants have suffix _copy like "trim_copy(s)".
I have also expanded the names of t
On Sun, Nov 17, 2002 at 11:20:16AM -0500, Beman Dawes wrote:
> At 04:00 AM 11/17/2002, Pavol Droba wrote:
>
> >> Have you taken a look at Darin Adler's string algorithms? See
> >> http://groups.yahoo.com/group/boost/files/string_algorithm/
> >>
> >> Do any of these have a place in your librar
At 04:00 AM 11/17/2002, Pavol Droba wrote:
>> Have you taken a look at Darin Adler's string algorithms? See
>> http://groups.yahoo.com/group/boost/files/string_algorithm/
>>
>> Do any of these have a place in your library?
>
>except for regex variant which are in some way all part of the regex li
On Sun, Nov 17, 2002 at 02:46:31PM +0100, Thorsten Ottosen wrote:
> - Original Message -
> From: "Pavol Droba" <[EMAIL PROTECTED]>
>
> > > Your example would become
> > >
> > > if ( lower_cased( trimmed( s ) ) = "ok" )
> > >
> >
> > This naming sounds good enough, just I'm not sure if such
- Original Message -
From: "Pavol Droba" <[EMAIL PROTECTED]>
> > Your example would become
> >
> > if ( lower_cased( trimmed( s ) ) = "ok" )
> >
>
> This naming sounds good enough, just I'm not sure if such a difference
>between
> two variants would not make the code less readable. Alfter
On Sat, Nov 16, 2002 at 04:43:53PM -0500, Beman Dawes wrote:
> At 11:58 AM 11/15/2002, Pavol Droba wrote:
> >Hi Boosters,
> >
> >I have developed a set of various string manipulating functions into a
> >string_algo lib.
>
> Pavol,
>
> Have you taken a look at Darin Adler's string algorithms?
At 11:58 AM 11/15/2002, Pavol Droba wrote:
>Hi Boosters,
>
>I have developed a set of various string manipulating functions into a
>string_algo lib.
Pavol,
Have you taken a look at Darin Adler's string algorithms? See
http://groups.yahoo.com/group/boost/files/string_algorithm/
Do any of these
> Perhaps one could use these names then:
>
> Seq trimmed(...);
> void trim(...);
> >Seq trim( const Seq& Input, const std::locale& Loc=std::locale() )
> >Seq& trim_in( Seq& Input, const std::locale& Loc=std::locale() )
>
> and
>
> Seq lower_cased(...);
> void to_lower_case(...);
>
>
- Original Message -
From: "Pavol Droba" <[EMAIL PROTECTED]>
> On Fri, Nov 15, 2002 at 06:47:35PM +0100, Thorsten Ottosen wrote:
> > I would find it more naturally to say
> >
> > string s = ...;
> > trim( s );
> >
> > than to use 'trim_in()'.
[snip]
> Well I have reasons to put it in the
> > 1. I would prefer explisit names: trim_left, trim_right,...
> I'm open for discussion about this. You are probably right. More peaole
> were asking for more readable names. I will probably rename them soon.
I think these names are better as well. The clearer the name the better.
Jeff
_
On Fri, Nov 15, 2002 at 01:12:59PM -0500, Rozental, Gennadiy wrote:
> > Trimming:
> >
> >Iterator trim_begin( Iterator InBegin, Iterator InEnd,
> > const std::locale& Loc=std::locale() )
> >Seq ltrim( const Seq& Input, const std::locale& Loc=std::locale() )
> >Seq& ltrim_in( Seq& Inpu
On Fri, Nov 15, 2002 at 06:57:47PM +0100, Thorsten Ottosen wrote:
> - Original Message -
> From: "Pavol Droba" <[EMAIL PROTECTED]>
>
> > bool contains( const Seq1& Input, const Seq2& Prefix, BinaryPredicate
> Comp )
>
> BTW, contains is one of the new proposed algorithms. It would be doub
On Fri, Nov 15, 2002 at 06:47:35PM +0100, Thorsten Ottosen wrote:
> >Seq rtrim( const Seq& Input, const std::locale& Loc=std::locale() )
> >Seq& rtrim_in( Seq& Input, const std::locale& Loc=std::locale() )
> >Seq trim( const Seq& Input, const std::locale& Loc=std::locale() )
> >Seq&
> Trimming:
>
>Iterator trim_begin( Iterator InBegin, Iterator InEnd,
> const std::locale& Loc=std::locale() )
>Seq ltrim( const Seq& Input, const std::locale& Loc=std::locale() )
>Seq& ltrim_in( Seq& Input, const std::locale& Loc=std::locale() )
>Seq rtrim( const Seq& Input, cons
- Original Message -
From: "Pavol Droba" <[EMAIL PROTECTED]>
> bool contains( const Seq1& Input, const Seq2& Prefix, BinaryPredicate
Comp )
BTW, contains is one of the new proposed algorithms. It would be double work
to provide
it here.
regards
Thorsten Ottosen, AAU
__
- Original Message -
From: "Pavol Droba" <[EMAIL PROTECTED]>
> As there has been an interest I'd like to ask you if such a library should
become a part of boots
> in the future. I'd be happy to hear any opinions and suggestions.
I would always like prefer a library function to writing my o
17 matches
Mail list logo
