bidirectionaltraversal.rst
来自「Boost provides free peer-reviewed portab」· RST 代码 · 共 42 行
RST
42 行
.. Copyright David Abrahams 2006. Distributed under the Boost.. Software License, Version 1.0. (See accompanying.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)Bidirectional Traversal Concept...............................A class or built-in type ``X`` models the *Bidirectional Traversal*concept if, in addition to ``X`` meeting the requirements of ForwardTraversal Iterator, the following expressions are valid and respectthe stated semantics.+--------------------------------------------------------------------------------------+|Bidirectional Traversal Iterator Requirements (in addition to Forward Traversal ||Iterator) |+--------------------------------+-------------------------------+---------------------+|Expression |Return Type |Assertion/Semantics /|| | |Pre-/Post-condition |+================================+===============================+=====================+|``--r`` |``X&`` |pre: there exists || | |``s`` such that ``r || | |== ++s``. post: || | |``s`` is || | |dereferenceable. || | |``--(++r) == r``. || | |``--r == --s`` || | |implies ``r == || | |s``. ``&r == &--r``. |+--------------------------------+-------------------------------+---------------------+|``r--`` |convertible to ``const X&`` |:: || | | || | | { || | | X tmp = r; || | | --r; || | | return tmp; || | | } |+--------------------------------+-------------------------------+---------------------+|``iterator_traversal<X>::type`` |Convertible to | || |``bidirectional_traversal_tag``| || | | |+--------------------------------+-------------------------------+---------------------+
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?