Algorithms and the Concepts that enable them (Range and Iterator) are designed to work over values distributed in space (VDiS). The algorithms in std and the rangev3 proposal and the parallel algorithm are all focused on efficiently utilizing every resource assigned to them to process values distributed in space. Whenever values are distributed in space, these are the tools to use.
Values distributed in time (VDiT) require different Concepts and Algorithms. This talk will explore some of these Algorithms and the requirements that they impose on the Concepts. The result is a library that composes algorithms the same way that the rangev3 proposal does and in a way that allows knowledge of one to transfer to the other.
