I understand there are guarantees about iterator validity in the
STL portion of the standard library.  Are there any guarantees about
container elements being shuffled (moved in memory) around?
By guaranteed, I mean that any other behavior is considered
non-standard and wrong.

Specifically, am I guaranteed that in any current or future
implementation of deque<> that existing elements will not be shuffled
on a push_back() or push_front()?

Where does one get this information in general?

--
Eric
---
[ comp.std.c++ is moderated.  To submit articles: try just posting with      ]
[ your news-reader.  If that fails, use mailto:std-c++@ncar.ucar.edu         ]
[ FAQ:      http://reality.sgi.com/employees/austern_mti/std-c++/faq.html    ]
[ Policy:   http://reality.sgi.com/employees/austern_mti/std-c++/policy.html ]
[ Comments? mailto:std-c++-request@ncar.ucar.edu                             ]