📄 prior.rst
字号:
.. Iterators/Iterator Metafunctions//prior |40
prior
=====
Synopsis
--------
.. parsed-literal::
template<
typename Iterator
>
struct prior
{
typedef |unspecified| type;
};
Description
-----------
Returns the previous iterator in the sequence. |Note:| ``prior`` has a number of
overloaded meanings, depending on the type of its argument. For instance,
if ``X`` is an |Integral Constant|, ``prior<X>`` returns an decremented
|Integral Constant| of the same type. The following specification is
iterator-specific. Please refer to the corresponding concept's
documentation for the details of the alternative semantics |-- end note|.
Header
------
.. parsed-literal::
#include <boost/mpl/next_prior.hpp>
Parameters
----------
+---------------+---------------------------+-----------------------------------+
| Parameter | Requirement | Description |
+===============+===========================+===================================+
| ``Iterator`` | |Forward Iterator|. | An iterator to decrement. |
+---------------+---------------------------+-----------------------------------+
Expression semantics
--------------------
For any |Forward Iterator|\ s ``iter``:
.. parsed-literal::
typedef prior<iter>::type j;
:Return type:
|Forward Iterator|.
:Precondition:
``iter`` is decrementable.
:Semantics:
``j`` is an iterator pointing to the previous element in the sequence.
If ``iter`` is a user-defined iterator, the library-provided default
implementation is equivalent to
.. parsed-literal::
typedef iter::prior j;
Complexity
----------
Amortized constant time.
Example
-------
.. parsed-literal::
typedef vector_c<int,1> v;
typedef begin<v>::type first;
typedef end<v>::type last;
BOOST_MPL_ASSERT(( is_same< prior<last>::type, first > ));
See also
--------
|Iterators|, |begin| / |end|, |next|, |deref|
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -