std::ranges::random_access_range
从 zh.cppreference.net 获取
| 定义于头文件 <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
的范围
(概念) |