Deduce iterator type in function template?
推导了函数模板的迭代器类型？
With enough contortions, you can get an item for every type of sequence/iterator.
对于每种序列/迭代器类型，只要费一番功夫，总能够获得其中的特定条目。
Without any type of counter variable (or Iterator), you're simply out of luck here.
在这里，没有任何类型的计数器变量（或者Iterator），也不存在任何侥幸。
You can use a compound iterator that wraps the iterators that loop through each type of address like the one listed in Listing 3.
您可以使用一个混合迭代器，它封装了遍历清单3中列出的每种地址的迭代器。
These requirements are sufficiently important that we give them a name: we call such a set of type requirements a concept, and we call this particular concept Input Iterator.
这些条件足够重要以至于我们给它取个名字：我们称这些需求为概念，也为这个特殊的概念为InputInterator。
You can use the table below to find the right types based on the type of your iterator.
你可以用下表基于你的迭代器类型来找到正确的类型。
We refer to a type as an iterator if it supports a certain set of actions. Those actions let us navigate among the elements of a container and let us access the value of those elements.
若一种类型支持一组确定的操作(这些操作可用来遍历容器内的元素，并访问这些元素的值)，我们就称这种类型为迭代器。
A type playing the role of iterator-type in the BidirectionalIterator concept.
在双向迭代器概念中担任迭代器类型角色的类型。
You can limit the scope of the search by providing a more specific type to the iterator.
为迭代器提供更为明确的类型即可限制搜索范围。
You can limit the scope of the search by providing a more specific type to the iterator.
为迭代器提供更为明确的类型即可限制搜索范围。
应用推荐