View set of items in a container as a recursively divisible range.
A Container Range is a Range with the further requirements listed in below.
Pseudo-Signature |
Semantics |
---|---|
R::value_type |
Item type |
R::reference |
Item reference type |
R::const_reference |
Item const reference type |
R::difference_type |
Type for difference of two iterators |
R::iterator |
Iterator type for range |
R::iterator R::begin() |
First item in range |
R::iterator R::end() |
One past last item in range |
R::size_type R::grainsize() const |
Grain size |
Classes concurrent_hash_map and concurrent_vector both have member types range_type and const_range_type that model a Container Range.
Use the range types in conjunction with parallel_for, parallel_reduce, and parallel_scan to iterate over items in a container.