Matt Austern ： Defining Iterators and Const Iterators

Matt Austern ： Defining Iterators and Const Iterators

ign=center>The Standard Librarian: Defining Iterators and Const Iterators

Matt Austern

Writing an iterator isn’t hard, and it’s a natural way to extend the C++ Standard library. But if you want to do it right, there are a few wrinkles you ought to know about.

The Standard C++ library is extensible by design: standard algorithms such as reverse and partition operate on the predefined containers like vector and list , and they can also operate on any user-defined data structure that supplies the appropriate iterators. Using the library effectively involves extending it.

By now, iterators are familiar to most C++ programmers. Iterators abstract the most basic properties of pointers: a forward iterator points to some object in a sequence, and it can be incremented so that it points to the next element in the sequence. (Stronger iterator categories, bidirectional iterators and random access iterators, provide additional means of traversing sequences. Weaker iterator categories are inappropriate for most data structures.)

【我对这篇文章有话说?】

第一页上一页1234567下一页尾页