Think of the bounds of a histogram which can be represented by LinRange(minval, maxval, n_bins+1). There's no good way to do this in DD at the moment that is not Explicit, which loses the idea that you don't need to duplicate the lookup values. Specifically, the "bounds" of the interval at index i are given by (range[i], range[i+1]). This is a pretty standard strategy (perhaps the most standard) and has the advantage of allowing a natural way to reproject intervals lookups - as this kind of explicit lookup where we still know it's continuous.
Spherical cellarea is still too slow for my tastes so I want to optimize it by chunking where possible. Would some
Think of the bounds of a histogram which can be represented by
LinRange(minval, maxval, n_bins+1). There's no good way to do this in DD at the moment that is notExplicit, which loses the idea that you don't need to duplicate the lookup values. Specifically, the "bounds" of the interval at indexiare given by(range[i], range[i+1]). This is a pretty standard strategy (perhaps the most standard) and has the advantage of allowing a natural way to reproject intervals lookups - as this kind of explicit lookup where we still know it's continuous.Spherical cellarea is still too slow for my tastes so I want to optimize it by chunking where possible. Would some