Didn't get: Iterator invalidation..
One minute response: Iterator invalidation is like locating books on a shelf by their distance from one end: it only works successfully if somebody doesn't add or remove books..
Didn't get: Where to use iterators, hard to decide..
One minute response: They're best used in conjunction with generic algorithms, which we haven't covered completely yet..
Didn't get: Exceptions.
One minute response: Exceptions are an out-of-band way of sending data and control from one place (the thrower) to another place (the catcher) in a program..
Didn't get: Most difficult is the dangling pointer problem..
One minute response: It's like having the number of a disconnected phone, except you usually don't get a specific error message when you try to use it..
Didn't get: Implementing it seems a bit confusing..
One minute response: Wait until we get to iterator adaptors, then it will seem magical..
Didn't get: Iterator were a little complex to understand..
One minute response: They get easier when thought of in combination with generic algorithms..
Didn't get: Iterator invalidation..
One minute response: Iterator invalidation is like treasure maps: if anything's changed since the time the iterator or treasure map was created, you won't be able to use the iterator or treasure map to find anything..
This page last modified on 25 February 2003.