Kevin, hello. On 25 Feb 2021, at 17:07, Kevin Forchione wrote:
As you can see each element of the sublist corresponds to the list-ref of the modulo n (length sublist) as n proceeds from 0 to some maximum value. I’ve created a function that does exactly this, but … I’ve no idea what this process might be called. As they say, the naming of cats, and all that.Does this sort of mapping have a formal name?
I think this is called 'zip', or a convolution [1]. The variant you describe is (effectively) with circular lists, but seems to be the same principle.
...and I see that, with that name in hand, SRFI/1 does indeed have a zip procedure, which works with circular lists.
[1] https://en.wikipedia.org/wiki/Convolution_(computer_science) Best wishes, Norman -- Norman Gray : https://nxg.me.uk SUPA School of Physics and Astronomy, University of Glasgow, UK -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/7F1C9263-EA6A-4B5F-A0CF-15A5725E1EAE%40glasgow.ac.uk.
