I see a lot of similarities between this post and Fabien's "Data structures and invariants" https://fgiesen.wordpress.com/2010/09/27/data-structures-and-invariants/
Specifically, the SearchTreeForInterestingChain example vs the doubly-linked list one.
Do you think your idea of an "effective codepath" is similar to the concept of invariants?
I see a lot of similarities between this post and Fabien's "Data structures and invariants" https://fgiesen.wordpress.com/2010/09/27/data-structures-and-invariants/
Specifically, the SearchTreeForInterestingChain example vs the doubly-linked list one.
Do you think your idea of an "effective codepath" is similar to the concept of invariants?