If you need to reorder an array containing very large data elements it is difficult to achieve it in a speed and memory efficient way.
PinguX did a good job doing so in a malleable VI and the in-place structure in this thread, but the most efficient solution ended up being based on Rust...
So my suggestion would be that NI adds a Reorder Array primitive to LabVIEW that matches (or outperforms! 🙂 ) the Rust-based one. Perhaps it could even support more than 1 dimension. The inputs would just be any type of array and an array of indexes.
