The C++ way to do it currently would be:
reply std::array<std::array<T, N>, M> data;
int data[M][N];
Edit:
For the stack at least. On the heap, you'd need to use a single std::vector<int> and do the indices manually, or use mdspan
I does not work fine in C++ when N and M are not compile-time constants, which is basically always the case in any interesting numerical algorithm. Also not in Rust.
replyIt works fine in C though, or FORTRAN, or Ada, or ALGOL 60, ...
Which is why std::mdspan exists, and std::linalg.
replyNVidia has pivoted to design CUDA hardware with focus on C++ back in , and seems to be doing quite well for them.
CppCon 2017: "Designing (New) C++ Hardware”
https://www.youtube.com/watch?v=86seb-iZCnI
They were also the ones sponsoring the ISO work on mdspan, while HPC research labs are pushing for linalg on top.
I would rather be using Ada today, but that isn't how the world moves.
> Even in c++ could you not just define some int [1000][1000]foo?
replyIf it fits on the stack, yes.
Typical code using MD-arrays is scientific code, and the data they manipulate generally do not fit there.
Would the compiler not allocate the memory contiguously on the heap in that case then? Seems like a reasonable thing to do.
reply