| Technical Specification | ||||
| Filesystem library(filesystem TS) | ||||
| Library fundamentals(library fundamentals TS) | ||||
| Library fundamentals 2(library fundamentals TS v2) | ||||
| Library fundamentals 3(library fundamentals TS v3) | ||||
| Extensions for parallelism(parallelism TS) | ||||
| Extensions for parallelism 2(parallelism TS v2) | ||||
| Extensions for concurrency(concurrency TS) | ||||
| Extensions for concurrency 2(concurrency TS v2) | ||||
| Concepts(concepts TS) | ||||
| Ranges(ranges TS) | ||||
| Reflection(reflection TS) | ||||
| Mathematical special functions(special functions TR) | ||||
| Experimental Non-TS | ||||
| Pattern Matching | ||||
| Linear Algebra | ||||
| std::execution | ||||
| Contracts | ||||
| 2D Graphics |
| Iterator concepts | ||||||||||||
| Indirect callable concepts | ||||||||||||
| Common algorithm requirements | ||||||||||||
| Concept utilities | ||||||||||||
| Iterator utilities and operations | ||||||||||||
| ||||||||||||
| Iterator traits | ||||||||||||
| Iterator adaptors | ||||||||||||
| Stream iterators | ||||||||||||
Defined in header <experimental/ranges/iterator> | ||
namespace{ constexpr/* unspecified */ prev=/* unspecified */; | (ranges TS) (customization point object) | |
Call signature | ||
template< Iterator I> constexpr I prev( I i); | (1) | |
template< Iterator I> constexpr I prev( I i, ranges::difference_type_t<I> n); | (2) | |
template< Iterator I> constexpr I prev( I i, ranges::difference_type_t<I> n, I bound); | (3) | |
Decrements the iteratorin times, or untilbound is reached, whichever comes first, and returns the decremented iterator.
Contents |
The nameranges::prev denotes acustomization point object, which is afunction object of aliteralSemiregular class type (denoted, for exposition purposes, asPrevT). All instances ofPrevT are equal. Thus,ranges::prev can be copied freely and its copies can be used interchangeably.
Given a set of typesArgs..., ifstd::declval<Args>()... meet the requirements for arguments toranges::prev above,PrevT will satisfyranges::Invocable<const PrevT, Args...>. Otherwise, no function call operator ofPrevT participates in overload resolution.
In every translation unit in whichranges::prev is defined, it refers to the same instance of the customization point object. (This means that it can be used freely in things like inline functions and function templates without violating theone-definition rule.)
The decremented iterator.
| This section is incomplete Reason: no example |
(C++11) | decrement an iterator (function template)[edit] |
| advances an iterator by given distance (function template)[edit] | |
| increment an iterator (function template)[edit] | |
| returns the distance between an iterator and a sentinel, or between the beginning and the end of a range (function template)[edit] |
