i really, really wish liss comprehensions had some form of sorting claus because at that point you're almost to like, in memory data base type of behavioris. I mean, it would be easy to implement. Just transform it to a sorted and pass out as the key, or something like that. And once you have it as a lis comprehension, then it unlocks the ability to do some other interesting stuff, which you didn't cover and yours, cause it didn't really matter. But if you have square brackets there, and those brackets are turning a large data collect n into a list,. If you put rounded brackets, all of a sudden you have a much more efficient