Boost mailing page: Re: [boost] [proposal] Sequence container with O(log n) random access _and

Date view	Thread view	Subject view	Author view

From: Jason Hise (0xchaos_at_[hidden])
Date: 2006-10-26 12:32:31

Next message: Peter Dimov: "Re: [boost] A fast-pathed rw-mutex algorithm for Boost..."
Previous message: Andy Little: "Re: [boost] GIL Review"
In reply to: Martin Knoblauch Revuelta: "Re: [boost] [proposal] Sequence container with O(log n) random access _and_ O(log n) insertion/removal (wherever)"
Next in thread: Martin Knoblauch Revuelta: "Re: [boost] [proposal] Sequence container with O(log n) random access _and_ O(log n) insertion/removal (wherever)"
Reply: Martin Knoblauch Revuelta: "Re: [boost] [proposal] Sequence container with O(log n) random access _and_ O(log n) insertion/removal (wherever)"

This does look like a valuable addition to the currently available
sequence containers, and I would love to see it developed into a boost
library.

Out of curiosity, since I didn't see it mentioned in previous posts
(maybe I'm blind and missed it)... What operations on the container
cause existing iterators to be invalidated?

Date view	Thread view	Subject view	Author view