22 Apr
2019
22 Apr
'19
5:47 p.m.
Hello Barry, On Mon, Apr 22, 2019 at 04:25:47PM -0500, Barry DeZonia wrote:
In Haskell, how would you represent a 5 dimensional data structure of numeric values? Imagine a dataset with axes x, y, z, channel, and time. Is there an easy way to represent this in the data that doesn't run into all kinds of memory limits? How would you map the data to a new state such that the new state had pixel (1000, 2000, 100, 1, 20) set to 53?
Maybe a HashMap[1] or similar structure? [1] http://hackage.haskell.org/package/unordered-containers-0.2.10.0