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
Am Dienstag, den 21.11.2006, 19:45 +0100 schrieb Benjamin Kosnik:
> > 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?
If you need 8bits for the algorithm to work, wouldnt you want to check
CHAR_BIT too, or did I miss anything?