Date: Sun, 25 Sep 2022 07:54:40 -0700
On Sunday, 25 September 2022 06:15:33 PDT Gergely Nagy via Std-Proposals
wrote:
> This would be a really basic and quite useful feature. min() and max() for
> enums would make it possible to create generic enum sets using std::bitset,
You can already do it on the underlying type
https://en.cppreference.com/w/cpp/types/underlying_type
> Additionally there could be an is_sparse() member that would tell if there
> is any gap, or even some gap statistics, so one could statically use
> std::unordered_set for very sparse enums and something more lightweight
> (like bitset) for dense ones.
That's reflection, not numeric_limits.
wrote:
> This would be a really basic and quite useful feature. min() and max() for
> enums would make it possible to create generic enum sets using std::bitset,
You can already do it on the underlying type
https://en.cppreference.com/w/cpp/types/underlying_type
> Additionally there could be an is_sparse() member that would tell if there
> is any gap, or even some gap statistics, so one could statically use
> std::unordered_set for very sparse enums and something more lightweight
> (like bitset) for dense ones.
That's reflection, not numeric_limits.
-- Thiago Macieira - thiago (AT) macieira.info - thiago (AT) kde.org Software Architect - Intel DCAI Cloud Engineering
Received on 2022-09-25 14:54:42