Re: [hub] on the specialized iteration over elements
Ion Gaztañaga via Boost <[email protected]>
| Newsgroups | gmane.comp.lib.boost.devel |
|---|---|
| Message-ID | <[email protected]> |
El 17/04/2026 a las 8:46, Andrzej Krzemienski via Boost escribió: > > Ok, so in the context of this review, focusing only on the API part, maybe > this concept of "iteration with the opportunity to use segmented iteration" > calls for a "generic" interface with the ability for concrete containers to > customize (specialize) for their implementation details? > > If I am implementing my own iterator-agnostic algorithm, I would like to be > able to say, "iterate over this range in the fastest possible way". > > Regards, > &rzej; The "generic interface" would be a good tool, but I think that a generic interface would not reach the optimization level that a member function that specifically targets the details of the data structure can achieve. Benchmarks will tell... I, for instance, could not beat the performance of the current member functions, using the Austerns "segmented iterator" generic interface. In some algorithms, it was even slower than the non-segmented, classic STL algorithm. Best, Ion _______________________________________________ Boost mailing list -- [email protected] To unsubscribe send an email to [email protected] https://lists.boost.org/mailman3/lists/boost.lists.boost.org/ Archived at: https://lists.boost.org/archives/list/[email protected]/message/7SAZQJ3E7CAR4JV4UWXPT6CYR7V2RQLG/