Supercomputing Centre, Research Centre Julich, Germany (0) How to chunk a sequence? > Different range adaptors dividing a range into subranges available: std: :Views: :chunk(chunk_size) std: :Views: :chunk_by(Predicate) ,0x4,0x5 ,0Ox6 ,0Ox7 ,0Xx8 ,0x9,OxA,OxB ,0OxC ]; fmt::println('"{:::X"，range | std::views::chunk(5)); fmt::println("{:::XJ"，range | jsc::chunk_evenly(5)) 了 七 加 [[0,，1，2，3,，4]，[5，6，7，8，9] ，[A，B，O]] 忆 气 func(chunk) ; change range adaptor 二 了 (6) Number of instructions & branches 力 std: :vievs::chunkO) 30 大 jsc::chunk_evenly(O)

std::same_as; }; template concept GravitationalRange = GravitationalBodyrange_value_t>; 1 2 3 4 5 6 7 8 9 10 78910def GetForceOnBody(this_body, all_bodies): all_forces = ranges::views; } 1 2 3 18Range View Semantically: a collection of "things". Has begin and end functions. That's it. A speci�c type of range. Can be used in range adaptor pipelines. O(1) move is true. template concept range = requires(T& t) { ranges::begin(t); ranges::end(t); }; template concept view = ranges::range && movable &&

(C++98) algorithm(begin(range), end(range)) ➡ result 8C++ RANGES LIBRARY Extension and generalization of the algorithm and iterator libraries. (C++98) algorithm(begin(range), end(range)) ➡ result (C++20) (C++20) algorithm(range) ➡ result (C++20) adaptor(range) ➡ view (C++20) range | adaptor ➡ view (C++20) range | adaptor1 | adaptor2 ➡ view 8.1C++ RANGES LIBRARY Extension and generalization of the algorithm algorithm(begin(range), end(range)) ➡ result (C++20) algorithm(range) ➡ result (C++20) adaptor(range) ➡ view (C++20) range | adaptor ➡ view (C++20) range | adaptor1 | adaptor2 ➡ view (C++23) range | adaptor1

using namespace std::ranges; using namespace std::execution; template <range R> auto dot_product(R&& x, R&& y) { using T = range_value_t; auto z = views::zip(x, y) | views::transform([](auto using namespace std::ranges; using namespace std::execution; template <range R> auto dot_product(R&& x, R&& y) { using T = range_value_t; auto z = views::zip(x, y) | views::transform([](auto using namespace std::ranges; using namespace std::execution; template <range R> auto dot_product(R&& x, R&& y) { using T = range_value_t; auto z = views::zip(x, y) | views::transform([](auto

findNimSum (state) 5 for i in range(len(state)): 6 remove = nimSum^state[i] 7 if(remove < state[i]): 8 result = [state[i] - remove , i] 9 return result 10 for i in range(len(state)): 11 if(state[i] finds the nimsum of the input state. 17 def findNimSum(self , state): 18 nimSum = 0 19 for i in range(len(state)): 20 nimSum = nimSum^state[i] 21 return nimSum Listing 1: Algorithm for finding the __init__(self , startBoard): 9 self.sum = startBoard [0]+1 10 self.board = startBoard 11 for i in range (1, len(self.board)): 12 self.sum *= self.board[i]+1 13 self. listOfStates = [0] * self.sum 14

Basics: Functional Programming in C++ CppCon 2024-09-19 15Solution: Lazy composition View: A lazy range whose values are computed on demand. namespace stdv = std::views; Jonathan Müller — @foonathan Back Basics: Functional Programming in C++ CppCon 2024-09-19 16Solution: Lazy composition View: A lazy range whose values are computed on demand. namespace stdv = std::views; Composing views does nothing yet Basics: Functional Programming in C++ CppCon 2024-09-19 16Solution: Lazy composition View: A lazy range whose values are computed on demand. namespace stdv = std::views; Composing views does nothing yet

sycl::buffer bufA{dA.data(), sycl::range{dA.size()}}; sycl::buffer bufB{dB.data(), sycl::range{dB.size()}}; sycl::buffer bufO{dO.data(), sycl::range{dO.size()}}; gpuQueue.submit([&](sycl::handler sycl::read_only); sycl::accessor out(bufO, cgh, sycl::write_only); cgh.parallel_for(sycl::range{dA.size()}, [=](id<1> i){ out[i] = inA[i] + inB[i]; }); }); gpuQueue.wait_and_throw(); sycl::buffer bufA{dA.data(), sycl::range{dA.size()}}; sycl::buffer bufB{dB.data(), sycl::range{dB.size()}}; sycl::buffer bufO{dO.data(), sycl::range{dO.size()}}; gpuQueue.submit([&](sycl::handler

7talk outline talk outline range basics & concepts range algo details and survey range views details and survey adjuncts observations & futures 2 . 8Range Basics Range Basics 3 . 1ranges, algorithms algorithms, views, adaptors range: something that can be iterated over range algo: algorithm that takes range view: lazy range thats cheap (to copy) range adaptor: make a range into a view 3 . 2mechanics ranges::views {...}; //range adaptors namespace views = ranges::views; //shortcut to adaptors } namespace rng = std::ranges; //some examples in this talk 3 . 3what's a range? what's a range? iterator pair

auto& v : Values().m_vec) vector> && __range1 = Values().m_vec; auto __begin1 = __range1.begin(); auto __end1 = __range1.end(); for(; operator!=(__begin1, __end1); __begin1.operator++()) auto& v : Values().get()) const vector> & __range1 = Values().get(); auto __begin1 = __range1.begin(); auto __end1 = __range1.end(); for(; operator!=(__begin1, __end1); __begin1.operator++()) auto& v : Values().m_vec) vector> && __range1 = Values().m_vec; auto __begin1 = __range1.begin(); auto __end1 = __range1.end(); for(; operator!=(__begin1, __end1); __begin1.operator++())