C++基础入门18.pptVIP

CIS 4930Application Development Using C++Dr. Kun Suk KimCISE Department, University of Florida Iterators Objectives Iterator Categories Auxiliary Iterator Functions Iterator Adapters Iterator Traits Ch. 7 Header Files for Iterators All containers define their own iterator types Don’t need a special header file iterator header file Special iterators, such as reverse iterators Containers include iterator to define their reverse iterator types Iterator Categories Iterators are objects that can iterate over elements of a sequence Iterators have different abilities These abilities are important because some algorithms require special iterator abilities Ex. Sorting algorithms require iterators that can perform random access Otherwise, the runtime would be poor Iterator Categories Abilities of Iterator Categories Input Iterators Can only step forward element-by-element with read access Output Iterators Can only step forward with write access Forward Iterators Have all the abilities of input iterators and most of those of output iterators Output vs. Forward Iterators For output iterators, writing data without checking for the end of a sequence is correct // OK for output iterators, but error for forward iterators while (true) { *pos = foo(); ++pos; } For forward iterators, ensure that it is correct to dereference (access the data) before you do this // OK for forward iterators, but impossible for output iterators while (pos != coll.end()) { *pos = foo(); ++pos; } Bidirectional Iterators Provide the abilities of forward interators Provide the decrement operator to step backward over the elements Random Access Iterators Provide the abilities of bidirectional interators Provide operators for “iterator arithmetic” Example – Random Access Iterators #include vector #include iostream using namespace std; int main(){ vectorint coll; for (int i=-3; i=9; ++i) coll.push_back (i); cout number/distance: coll.end()-coll.begin() endl; vectorint::it