Doumler Friday, September 18 • 12:00Ranges11 Ranges  What’s a range?  An object referring to a sequence/range of elements  Similar to a begin/end iterator pair, but does not replace them  Why ranges non-owning, non- mutating  Range factories: construct views to produce values on demand  E.g. sequence of integers  Pipelining: Views can be chained using pipes  |13 Ranges  Example of chaining std::latch instance is single-use43 The C++20 Synchronization Library  Barriers   A sequence of phases  In each phase  a number of threads block until the requested number of threads arrive

Features  Garbage Collection Support44  Defined in  New adaptors on top of basic sequence containers  Associative container interface (similar to std::map)  unique keys (flat_map)  retrieval of values based on a key  Keys are sorted  Keys and values are stored in separate sequence containers, e.g. vectors or deques std::flat_map / std::flat_multimap45  Defined in

Collection occurs. // obj now “free”. // 0x9200 -> 0x7200 Sys_Done(hnd); hnd This is only one possible sequence.Memory model – Non-Reference Counted Common ways of facilitating interop scenarios with a Garbage