From: Julien Blanc (julien.blanc_at_[hidden])
Date: 2022-06-24 11:12:01
Le vendredi 24 juin 2022 Ã 00:01 +0000, Hadriel Kaplan via Boost a
écrit :
>
> The arbitrary intervals and non-contiguous use-cases I'm less
> convinced by. It's too easy to mess up.
> And arguably it's not really a "indexed_array" at that pointÂ
> anyway - the underlying container might happen to be a std::array,
> but that's an implementation detail. From the user's perspective it's
> more like a "static_map" or some such. Except... it's not actually
> necessarily sorted, is it? All the examples show them sorted, but I'm
> not sure it really is if the user doesn't define it that way? (I'm
> trying _not_ to read the code - only the docs)
There's one example of unordered indexes in the doc, in basic usage /
Usage with integer lists (at the end of
https://julien-blanc-tgcm.github.io/indexed_array/basicusage.html ).
I don't have any use case for them. It just happens than once you
handle arbitrary integer list to be able to support holes/non
contiguous, you get unordered for free. But yes, i think it can quickly
get pretty messy.
Best regards,
Julien