I have zero experience with the normal use cases for intrusive containers. FWIW very typical use cases are algorithms which need to compute the iterator to an element from the element itself. Whenever I've used intrusive containers so far, I used them because of their ability to do
What I would like to know is if typically all objects is inside intrusive containers; also for the use of 2,3, or 4 simultaneous containers. I wouldn't say so. In fact, at least one triangulation algorithm needs to maintain and iterate over a list of all concave vertices of a polygon again and again (the list becomes smaller during the triangulation
Hi,
Thorsten Ottosen wrote:
that computation in constant time and to detect if they are in a
particular container respectively. I think, that constant-time
detection, whether a given element is in a container and constant-time
computation of an iterator are outstanding abilites of intrusive
containers.
process). But usually in a typical polygon there are much more convex
vertices. Thus just marking the vertices with a flag was no option,
because you'd have to iterate over the whole set of vertices just to
(re)find the concave ones. A "std::list