Post #3038238
2026-05-04 14:35 UTC
@scruss@xoxo.zone My dictionary has all 26 one-letter entries as words, and since A and I don't pair up, I just filter them all out. It stops iterating after M, since all pairs have already been made at that point. But it's still n-squared and stupidly slow; I'm sure there's a better approach. Will see if doing rot13 on the whole dictionary at once is faster.
Replies (1)
-
@scruss@xoxo.zone 2026-05-04 14:45
@_the_cloud@mastodon.social that's a much prettier way of doing it than mine, and much more logical. Every time I use comm, I forget if it's 'comm -12' or 'comm -23' for the use case I want. Every time. It's also really sensitive to list order