std::ranges::random_access_range
来自cppreference.com
<tbody>
</tbody>
| 在标头 <ranges> 定义
|
||
template< class T > concept random_access_range = ranges::bidirectional_range<T> && std::random_access_iterator<ranges::iterator_t<T>>; |
(C++20 起) | |
random_access_range 概念是 range 的精化,对于实现它的类型,ranges::begin 返回 random_access_iterator 的实现。
示例
运行此代码
#include <array>
#include <deque>
#include <list>
#include <ranges>
#include <set>
#include <valarray>
#include <vector>
template<typename T> concept RAR = std::ranges::random_access_range<T>;
int main()
{
int a[4];
static_assert(
RAR<std::vector<int>> and
RAR<std::vector<bool>> and
RAR<std::deque<int>> and
RAR<std::valarray<int>> and
RAR<decltype(a)> and
not RAR<std::list<int>> and
not RAR<std::set<int>> and
RAR<std::array<std::list<int>,42>>
);
}
参阅
(C++20) |
指定范围可以常数时间计算大小 (概念) |
(C++20) |
指定范围的迭代器类型满足 contiguous_iterator (概念) |