The random_access_range
concept is a refinement of range
for which ranges::begin returns a model of 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>> ); }[edit] See also
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4