C++面向对象程序设计（第7版）之课件13（第十三章）.pptVIP

Chapter 13 Standard Template Library Overview 13.1 Iterators 13.2 Containers 13.3 Generic Algorithms 13.1 Iterators Iterators STL has containers, algorithms and Iterators Containers hold objects, all of a specified type Generic algorithms act on objects in containers Iterators provide access to objects in the containers yet hide the internal structure of the container  Using Declarations Using declarations allow use of a function or name defined in a namespace: using ns::fun( ); using ns::iterator; using std::vectorint ::iterator; Iterator Basics An iterator is a generalization of pointer Not a pointer but usually implemented using pointers The pointer operations may be overloaded for behavior appropriate for the container internals Treating iterators as pointers typically is OK. Each container defines an appropriate iterator type. Operations are consistent across all iterator types. Basic Iterator Operations Basic operations shared by all iterator types ++ (pre- and postfix) to advance to the next data item = = and != operators to test whether two iterators point to the same data item * dereferencing operator provides data item access c.begin( ) returns an iterator pointing to the first element of container c c.end( ) returns an iterator pointing past the last element of container c. Analogous to the null pointer. Unlike the null pointer, you can apply -- to the iterator returned by c.end( ) to get an iterator pointing to last element in the container. More Iterator Operations -- (pre- and postfix) moves to previous data item Available to some kinds of iterators. *p access may be read-only or read-write depending on the container and the definition of the iterator p. STL containers define iterator types appropriate to the container internals. Some containers provide read-only iterators Kinds of Iterators Forward iterators provide the basic operations Bidirectional iterators provide the basic operations and the -- operators (pre- and postfix) t