Input Iterator is, in fact, a rather weak concept: that is, it imposes very few requirements. An Input Iterator must support a subset of pointer arithmetic (it must be possible to increment an Input Iterator using prefix and postfix operator++), but need not support all operations of pointer arithmetic. This is sufficient for find, but some other algorithms require that their arguments satisfy additional requirements. Reverse, for example, must be able to decrement its arguments as well as increment them; it uses the expression --last. In terms of concepts, we say that reverse's arguments must be models of Bidirectional Iterator rather than Input Iterator.
Input_Iterator事实上是一个相当弱的概念:即,它只提出了相当少的要求.一个Input_Iterator必须支持指针算运算的一个子集(必须可以使用前缀和后缀操作符++来增加一个Input_Iterator),但是无需支持指针运算的所有操作.这对于find已经足够了,但是其它一些算法还需要它们的参数满足一些额外的要求.例如,reverse,必须能够对它的参数进行增加和减少操作,它使用表达式--last.从概念来说,我们说reverse的参数必须是Bidirectional_Iterator而不是Input_Iterator的模型.<?xml:namespace prefix = o ns = "urn:schemas-microsoft-com:office:office" />
The Bidirectional Iterator concept is very similar to the Input Iterator concept: it simply imposes some additional requirements. The types that are models of Bidirectional Iterator are a subset of the types that are models of Input Iterator: every type that is a model of Bidirectional Iterator is also a model of Input Iterator. Int*, for example, is both a model of Bidirectional Iterator and a model of Input Iterator, but istream_iterator, is only a model of Input Iterator: it does not conform to the more stringent Bidirectional Iterator requirements.
We describe the relationship between Input Iterator and Bidirectional Iterator by saying that Bidirectional Iterator is a refinement of Input Iterator. Refinement of concepts is very much like inheritance of C++ classes; the main reason we use a different word, instead of just calling it "inheritance", is to emphasize that refinement applies to concepts rather than to actual types.
There are actually three more iterator concepts in addition to the two that we have already discussed: the five iterator concepts are Output Iterator, Input Iterator, Forward Iterator, Bidirectional Iterator, and Random Access Iterator; Forward Iterator is a refinement of Input Iterator, Bidirectional Iterator is a refinement of Forward Iterator, and Random Access Iterator is a refinement of Bidirectional Iterator. (Output Iterator is related to the other four concepts, but it is not part of the hierarchy of refinement: it is not a refinement of any of the other iterator concepts, and none of the other iterator concepts are refinements of it.) The Iterator Overview has more information about iterators in general.
除了我们已经讨论过的两个迭代器概念之外事实上还有另外三个迭代器概念:这五个迭代器概念(iterator concept)是:Output_Iterator,Input_Iterator,Forward_Iterator,Bidirectional_Iterator和Random_Acess_Iterator;Forward_Iterator是Input_Iterator的一个提炼, Bidirectional_Iterator是Forward_Iterator的一个提炼而Random_Acess_Iterator是Bidirectional_Iterator的一个提炼(Output_Iterator与其它四个概念相关联,但是它不是提炼体系的一部分:它不是其它任何迭代器概念的一个提炼,而且其它迭代器概念也不是它的一个提炼).迭代器概览中有关于迭代器的更多信息.
Container classes, like iterators, are organized into a hierarchy of concepts. All containers are models of the concept Container; more refined concepts, such as Sequence and Associative Container, describe specific types of containers.
Other parts of the STL
If you understand algorithms, iterators, and containers, then you understand almost everything there is to know about the STL. The STL does, however, include several other types of components.
First, the STL includes several utilities: very basic concepts and functions that are used in many different parts of the library. The concept Assignable, for example, describes types that have assignment operators and copy constructors; almost all STL classes are models of Assignable, and almost all STL algorithms require their arguments to be models of Assignable.
Second, the STL includes some low-level mechanisms for allocating and deallocating memory. Allocators are very specialized, and you can safely ignore them for almost all purposes.
Finally, the STL includes a large collection of function objects, also known as functors. Just as iterators are a generalization of pointers, function objects are a generalization of functions: a function object is anything that you can call using the ordinary function call syntax. There are several different concepts relating to function objects, including Unary Function (a function object that takes a single argument, i.e. one that is called as f(x)) and Binary Function (a function object that takes two arguments, i.e. one that is called as f(x, y)). Function objects are an important part of generic programming because they allow abstraction not only over the types of objects, but also over the operations that are being performed.
最后,STL包含了许多function objects,也叫functor/就如iterator是指针的泛化一样,function objects是函数的泛化:一个function object是你可以用通常的函数调用语法调用的任何东西.有几种与function objects相关联的不同概念,包括Unary Function(接受单一参数的function object,例如f(x))以及Binary Function(接受两个参数的function object,例如f(x,y)).Function objects是泛型编程的一个重要部分,因为它们允许不仅对对象的类型进行抽象,而且对所执行的操作进行抽象.