Date: Wed, 21 May 2025 22:35:35 +0200
Ah, great! I missed that one. Thanks!
If you do go for member functions like find_next_one, I think it would be
nice to have a find_first_one as well (like libstdc++ does). It would make
iterating code look simpler than the example in the paper. As for the "A
possible issue is that this operation is extremely specialized towards
iteration." comment, I don't see that as a problem, but that's just
my opinion.
Cheers,
Anders
On Wed, May 21, 2025 at 10:13 PM Jan Schultke <janschultke_at_[hidden]>
wrote:
> Hi Anders,
>
> What you're proposing is already part of
> https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2024/p3103r2.html
>
> The interface is still a bit up-for-debate, but you would be able to
> efficiently traverse a bitset with the proposed functions.
>
If you do go for member functions like find_next_one, I think it would be
nice to have a find_first_one as well (like libstdc++ does). It would make
iterating code look simpler than the example in the paper. As for the "A
possible issue is that this operation is extremely specialized towards
iteration." comment, I don't see that as a problem, but that's just
my opinion.
Cheers,
Anders
On Wed, May 21, 2025 at 10:13 PM Jan Schultke <janschultke_at_[hidden]>
wrote:
> Hi Anders,
>
> What you're proposing is already part of
> https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2024/p3103r2.html
>
> The interface is still a bit up-for-debate, but you would be able to
> efficiently traverse a bitset with the proposed functions.
>
Received on 2025-05-21 20:35:53