Namespaces
Variants
Views
Actions

std::ranges::bidirectional_range

From cppreference.com
< cpp‎ | ranges
 
 
Ranges library
Range access
Range conversions
(C++23)
Range primitives



Dangling iterator handling
Range concepts
Views

Factories




Adaptors
Range adaptor objects
Range adaptor closure objects
Helper items
 
Defined in header <ranges>
template< class T >

  concept bidirectional_range =

    ranges::forward_range<T> && std::bidirectional_iterator<ranges::iterator_t<T>>;
(since C++20)

The bidirectional_range concept is a refinement of range for which ranges::begin returns a model of bidirectional_iterator.

[edit] Example

#include <ranges>
#include <list>
#include <forward_list>
#include <set>
#include <unordered_set>
 
int main()
{
    static_assert(
            std::ranges::bidirectional_range<std::set<int>> and
        not std::ranges::bidirectional_range<std::unordered_set<int>> and
            std::ranges::bidirectional_range<std::list<int>> and
        not std::ranges::bidirectional_range<std::forward_list<int>>
    );
}

[edit] See also

specifies a range whose iterator type satisfies forward_iterator
(concept) [edit]
specifies a range whose iterator type satisfies random_access_iterator
(concept) [edit]