Skip to content

Search topics & cppreference

Search all study topics, concept maps, and 6,587 C++ and C reference pages.

std::ranges::bidirectional_range

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

NotebookLM
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.

Example

example.cpp
#include <forward_list>
#include <list>
#include <ranges>
#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>>
    );
}

See also

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

Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.