Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/named req/ReversibleContainer"

From cppreference.com
< cpp‎ | named req
m (link to ja)
m (+inplace_vector.)
 
(5 intermediate revisions by 3 users not shown)
Line 5: Line 5:
  
 
===Requirements===
 
===Requirements===
−
 
+
A type satisfies {{named req/core|ReversibleContainer}} if it satisfies {{named req|Container}}, its iterator type belongs to the bidirectional or random access [[cpp/iterator|iterator categories]] and, given the following types and values, the semantic and complexity requirements in the tables below are satisfied:
 
{{dsc begin}}
 
{{dsc begin}}
−
{{dsc|{{ttb|X}}|Container type}}
+
{{dsc hitem|Type|Definition}}
−
{{dsc|{{ttb|T}}|Element type}}
+
{{dsc|{{tt|X}}|an {{named req/core|ReversibleContainer}} type}}
−
{{dsc|{{ttb|a}}|Objects of type {{ttb|X}}}}
+
{{dsc|{{tt|T}}|the {{tt|value_type}} of {{tt|X}}}}
 +
{{dsc hitem|Value|Definition}}
 +
{{dsc|{{c|a}}|a value of type {{tt|X}}}}
 
{{dsc end}}
 
{{dsc end}}
  
 
====Types====
 
====Types====
−
 
 
{|class=wikitable
 
{|class=wikitable
−
!expression||return type||conditions||complexity
+
!Name
 +
!Type
 +
!Requirements
 
|-
 
|-
−
|{{c|X::reverse_iterator}}|| iterator type whose value type is {{tt|T}} || {{c|reverse_iterator<iterator> }} || compile time
+
|{{c/core|typename X::reverse_iterator}}
−
|-
+
|{{c/core|std::reverse_iterator<X::iterator>}}
−
|{{c|X::const_reverse_iterator}}|| constant iterator type whose value type is {{tt|T}} || {{c|reverse_iterator<const_iterator> }} || compile time
+
|an iterator type whose [[cpp/iterator|value type]] is {{tt|T}}
 
|-
 
|-
 +
|{{c/core|typename X::const_reverse_iterator}}{{nbsp}}
 +
|{{c/core|std::reverse_iterator<X::const_iterator>}}{{nbsp}}
 +
|a constant iterator type whose [[cpp/iterator|value type]] is {{tt|T}}
 
|}
 
|}
  
−
====Methods====
+
====Expressions====
 +
The types {{tt|reverse_iterator}} and {{tt|const_reverse_iterator}} in the following table denote {{c/core|typename X::reverse_iterator}} and {{c/core|typename X::const_reverse_iterator}} respectively.
  
 
{|class=wikitable
 
{|class=wikitable
−
!expression||return type||conditions||complexity
+
!Expression
 +
!Type
 +
!Semantics
 +
!{{nbsp}}Complexity{{nbsp}}
 
|-
 
|-
−
|{{c|a.rbegin()}}|| {{c|reverse_iterator}}; {{c|const_reverse_iterator}} for constant {{tt|a}} || {{c|reverse_iterator(end())}} || constant
+
|{{c|a.rbegin()}}
 +
|{{tt|reverse_iterator}}<br>{{tt|const_reverse_iterator}} for constant {{c|a}}
 +
|{{c|reverse_iterator(a.end())}}
 +
|Constant
 
|-
 
|-
−
|{{c|a.rend()}}|| {{c|reverse_iterator}}; {{c|const_reverse_iterator}} for constant {{tt|a}} || {{c|reverse_iterator(begin())}} || constant
+
|{{c|a.rend()}}
 +
|{{tt|reverse_iterator}}<br>{{tt|const_reverse_iterator}} for constant {{c|a}}
 +
|{{c|reverse_iterator(a.begin())}}
 +
|Constant
 
|-
 
|-
−
|{{c|a.crbegin()}}|| {{c|const_reverse_iterator}} || {{c|const_cast<X const&>(a).rbegin()}} || constant
+
|{{c|a.crbegin()}}
 +
|{{tt|const_reverse_iterator}}
 +
|{{c|const_cast<const X&>(a).rbegin()}}
 +
|Constant
 
|-
 
|-
−
|{{c|a.crend()}}|| {{c|const_reverse_iterator}} || {{c|const_cast<X const&>(a).rend()}} || constant
+
|{{c|a.crend()}}
 +
|{{tt|const_reverse_iterator}}
 +
|{{c|const_cast<const X&>(a).rend()}}
 +
|Constant
 
|}
 
|}
  
 +
===Standard library===
 +
* {{lc|std::array}}
 +
* {{lc|std::deque}}
 +
* {{lc|std::list}}
 +
* {{lc|std::vector}}
 +
* {{lc|std::inplace_vector}}
 +
* {{lc|std::map}}
 +
* {{lc|std::multimap}}
 +
* {{lc|std::set}}
 +
* {{lc|std::multiset}}
  
 
===Example===
 
===Example===
 
{{example
 
{{example
−
| The following example iterates over a vector (which has random-access iterators) in reverse.
+
|The following example iterates over a {{lc|std::vector|vector}} (which has [[cpp/container/vector#Member types|random-access iterators]]) in reverse.
−
| code=
+
|code=
−
#include <vector>
+
 
#include <iostream>
 
#include <iostream>
 +
#include <vector>
  
 
int main()
 
int main()
 
{
 
{
 
     std::vector<int> v = {3, 1, 4, 1, 5, 9};
 
     std::vector<int> v = {3, 1, 4, 1, 5, 9};
−
 
+
   
−
     for(std::vector<int>::reverse_iterator i = v.rbegin(); i != v.rend(); ++i) {
+
     for (std::vector<int>::const_reverse_iterator i{v.crbegin()}; i != v.crend(); ++i)
−
         std::cout << *i << '\n';
+
         std::cout << *i << ' ';
−
     }
+
     std::cout << '\n';
 
}
 
}
−
| output=
+
|output=
−
9
+
9 5 1 4 1 3
−
5
+
−
1
+
−
4
+
−
1
+
−
3
+
 
}}
 
}}
  
 +
===Defect reports===
 +
{{dr list begin}}
 +
{{dr list item|wg=lwg|dr=2105|std=C++98|before={{c/core|typename X::const_reverse_iterator}} was<br>required to be an iterator type of value type {{c/core|const T}}|after=required to be a constant<br>iterator type of value type {{tt|T}}}}
 +
{{dr list end}}
  
−
===Standard library===
+
{{langlinks|de|es|fr|it|ja|pt|ru|zh}}
−
* {{lc|std::array}}
+
−
* {{lc|std::deque}}
+
−
* {{lc|std::list}}
+
−
* {{lc|std::vector}}
+
−
* {{lc|std::map}}
+
−
* {{lc|std::multimap}}
+
−
* {{lc|std::set}}
+
−
* {{lc|std::multiset}}
+
−
 
+
−
{{langlinks|ja|zh}}
+

Latest revision as of 03:22, 5 September 2024

 
C++
 
C++ named requirements
 

A ReversibleContainer is a Container that has iterators that meet the requirements of either LegacyBidirectionalIterator or LegacyRandomAccessIterator. Such iterators allow a ReversibleContainer to be iterated over in reverse.

Contents

[edit] Requirements

A type satisfies ReversibleContainer if it satisfies Container, its iterator type belongs to the bidirectional or random access iterator categories and, given the following types and values, the semantic and complexity requirements in the tables below are satisfied:

Type Definition
X an ReversibleContainer type
T the value_type of X
Value Definition
a a value of type X

[edit] Types

Name Type Requirements
typename X::reverse_iterator std::reverse_iterator<X::iterator> an iterator type whose value type is T
typename X::const_reverse_iterator  std::reverse_iterator<X::const_iterator>  a constant iterator type whose value type is T

[edit] Expressions

The types reverse_iterator and const_reverse_iterator in the following table denote typename X::reverse_iterator and typename X::const_reverse_iterator respectively.

Expression Type Semantics  Complexity 
a.rbegin() reverse_iterator
const_reverse_iterator for constant a 		reverse_iterator(a.end()) Constant
a.rend() reverse_iterator
const_reverse_iterator for constant a 		reverse_iterator(a.begin()) Constant
a.crbegin() const_reverse_iterator const_cast<const X&>(a).rbegin() Constant
a.crend() const_reverse_iterator const_cast<const X&>(a).rend() Constant

[edit] Standard library

[edit] Example

The following example iterates over a vector (which has random-access iterators) in reverse.

Run this code
#include <iostream>
#include <vector>
 
int main()
{
    std::vector<int> v = {3, 1, 4, 1, 5, 9};
 
    for (std::vector<int>::const_reverse_iterator i{v.crbegin()}; i != v.crend(); ++i)
        std::cout << *i << ' ';
    std::cout << '\n';
}

Output: 

9 5 1 4 1 3

[edit] Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

DR Applied to Behavior as published Correct behavior
LWG 2105 C++98 typename X::const_reverse_iterator was
required to be an iterator type of value type const T 		required to be a constant
iterator type of value type T
Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/named_req/ReversibleContainer&oldid=175747"