This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: new extension: boyer-moore search algorithm variants
- From: Benjamin Kosnik <bkoz at redhat dot com>
- To: Paolo Carlini <pcarlini at suse dot de>
- Cc: dhruvbird at gmail dot com, libstdc++ at gcc dot gnu dot org
- Date: Tue, 21 Nov 2006 19:45:06 +0100
- Subject: Re: new extension: boyer-moore search algorithm variants
- References: <20061121193232.5328d344.bkoz@redhat.com> <4563478C.7020206@suse.de>
> The problem is that we don't want any char type, we want only "small"
> chars, basically 8 bits. As I said already, these requirements are
> rather special...
I guess I must have missed this in my mailer confusion. I don't mean to
be dim, so perhaps you can restate or provide a pointer to me about
where this was discussed?
Why a new trait at all then, and not just sizeof(T) == 1? Isn't there
another compile-time way to do this that would sidestep this issue
entirely?
-benjamin