On Tuesday, 13 January 2026 06:47:38 Pacific Standard Time Alejandro Colomar
via Std-Proposals wrote:
> > It is probably too complicated to do by hand. By contrast, recursive
> > templates can halve the words until there is hardware support, the latter
> > of which can be implemented by specializing an inline function.
> Why would templates be able to be faster than _BitInt()? Is there any
> inherent issue in _BitInt() that doesn't allow compilers to implement it
> efficiently?

I'll just ask differently:

assuming all operations have negligible / unmeasurable run time, what's the
advantage of what you're proposing?

-- 
Thiago Macieira - thiago (AT) macieira.info - thiago (AT) kde.org
  Principal Engineer - Intel Data Center - Platform & Sys. Eng.