Algorithms and Iterators for Multidimensional Arrays
summary
Claims a practical way to decouple algorithms from data structures for contiguous multidimensional arrays by making iteration the interface: a strided-based iterator (random-access with stride) and a multi-dimensional iterator factory that emits those strided iterators. Implements views in the Guideline Support Library, uses C++ standard algorithms for inner loops, demonstrates tensor–vector multiplication across row/column-major layouts without code changes, and notes per-element layout translation as the remaining cost.
AI-written summary · about
chapters (12)
- 0:00Intro
- 1:05Print in MATLAB
- 1:35Complex Operations
- 2:03Interpretation
- 2:34Guidelines Support Library
- 3:14Translation
- 4:07Algorithms
- 4:47Iterators
- 5:13Example
- 5:54Multidimensional Iterator
- 7:31Multi Iterators
- 8:13How to use it
related talks
55mIntroduction to C++ Containers - Know Your Data Structures
48mC++ Data Structures That Make Video Games Go Round
57mGraphBLAS: Building a C++ Matrix API for Graph Algorithms
01h 04mBack to Basics: Standard Library Containers in Cpp
33mFair intersection of seekable iterators
37mThe TileDB Array Data Storage Manager
38mPractical Fractals in Space
44mIntermediate Relational Algorithm Design