taking a stateful algo and "un-stating" it when it involves deeply nested data structures is a challenge lol
-
Show this thread
-
namely, a lot of algos rely on "use recursion or iteration to find appropriate node, then mutate it." Post mutation, exiting is trivial. in strict FP "navigate" to the node is easy, but rebuilding entire thing with changed node means a lot of parameter-passing + bookkeeping
1 reply 0 retweets 1 likeShow this thread -
Fun fact: bookkeeper is the only word in English with 3 consecutive same-pair letters.
2 replies 0 retweets 3 likesShow this thread
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.