If you're diligent about rewriting code so that it's always at what seems the limit of elegance, you sometimes see patterns in it that you can embody in new operators that push the limit outward. But unless you're near the limit you may never know those operators are possible.
-
What is the limit of elegance?
When things can be made no simpler. With code you can approximate this roughly as: when the code can be made no shorter (except by gimmicks). And by short I mean the parse tree is small, not few characters or loc.
-
-
How might the parse tree be measured, a la LOC? Depth-wise? Width-wise? Number of nodes?
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.