September 2022
Intermediate to advanced
320 pages
10h 10m
English
The strongest arguments prove nothing so long as the conclusions are not verified by experience.
– Roger Bacon
The standard-library offers algorithms both constrained using concepts (Chapter 8) and unconstrained (for compatibility). The constrained (concept) versions are in <ranges> in namespace ranges. Naurally, I prefer the versions using concepts. A range is a generalization of the C++98 sequences defined by {begin(),end()} pairs; it specifies what it takes to be a sequence of elements. A range can be defined by
A {begin,end} pair of iterators
A {begin,n} pair, where begin is an iterator and n
Read now
Unlock full access