This is the mail archive of the libstdc++@gcc.gnu.org mailing list for the libstdc++ project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: new extension: boyer-moore search algorithm variants

From: Paolo Carlini <pcarlini at suse dot de>
To: Dennis Lubert <plasmahh at projectiwear dot org>
Cc: libstdc++ at gcc dot gnu dot org
Date: Tue, 21 Nov 2006 21:00:39 +0100
Subject: Re: new extension: boyer-moore search algorithm variants
References: <20061121193232.5328d344.bkoz@redhat.com> <4563478C.7020206@suse.de> <20061121194506.d05fcecf.bkoz@redhat.com> <1164138928.19608.2.camel@speedy.projectiwear.org>

Dennis Lubert wrote:

If you need 8bits for the algorithm to work, wouldnt you want to check CHAR_BIT too, or did I miss anything?

No, no, you are right, of course, I wanted to say that, somewhere, but didn't want to appear picky ;) Actually we should audit the library for that, because we test *very* unfrequently on targets with CHAR_BIT != 8.

Paolo.

References:
- new extension: boyer-moore search algorithm variants
  - From: Benjamin Kosnik
- Re: new extension: boyer-moore search algorithm variants
  - From: Paolo Carlini
- Re: new extension: boyer-moore search algorithm variants
  - From: Benjamin Kosnik
- Re: new extension: boyer-moore search algorithm variants
  - From: Dennis Lubert

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]