Date: Tue, 13 Jan 2026 09:45:45 -0600
> Is there any inherent issue in _BitInt() that doesn't allow compilers to implement it efficiently?
Not to my knowledge
Jeremy
On Tue, Jan 13, 2026 at 8:48 AM Alejandro Colomar via Std-Proposals
<std-proposals_at_[hidden]> wrote:
>
> 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
>
> --
> <https://www.alejandro-colomar.es>
> --
> Std-Proposals mailing list
> Std-Proposals_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/std-proposals
Not to my knowledge
Jeremy
On Tue, Jan 13, 2026 at 8:48 AM Alejandro Colomar via Std-Proposals
<std-proposals_at_[hidden]> wrote:
>
> 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
>
> --
> <https://www.alejandro-colomar.es>
> --
> Std-Proposals mailing list
> Std-Proposals_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/std-proposals
Received on 2026-01-13 15:45:59
