Date: Tue, 13 Jan 2026 15:47:38 +0100
Hi Hans,
On Tue, Jan 13, 2026 at 03:36:37PM +0100, Hans Åberg 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?
Have a lovely day!
Alex
On Tue, Jan 13, 2026 at 03:36:37PM +0100, Hans Åberg 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?
Have a lovely day!
Alex
-- <https://www.alejandro-colomar.es>
Received on 2026-01-13 14:47:58