> One traversal mechanism I'd love to see but I've never seen implemented coherently is... given my relationship to ancestor X, iterate through all my anteceden

> One traversal mechanism I'd love to see but I've never seen implemented coherently is... given my relationship to ancestor X, iterate through all my antecedent peers under x. This would make processing some kinds of structured data far simpler. That sounds really simple to achieve with with a (lazy) function that returns a list containing all ancestors of a tree, and then a "until" or "up to" function that returns everything from that list until a certain condition is met. Those are things that should be included alongside Map and Reduce :) > How is it possible that ({k: 1} === {k: 1}) is false? I find this to be maddening. Thank goodness for lodash. Oh, I strongly agree. And lodash should be the standard library of the language. Not only of Javascript, but most languages out there. > End really is one of those hats-off bits of magic, and it's one of the first things that come to mind when any of the frothing haters pen statements that preclude anything good coming from method chaining. About End (and point free style in general), I understand why people might dislike it, but then again, I think it comes down to familiarity. After ten years of exposure to LINQ, Haskell, underscore/lodash and FP in general I also find it super hard to follow code that uses for/do/while in overly clever ways (my own C code comes to mind). I think I find it easier to see code as a "graph" rather than assigning something to a temporary variable, and that's what End allows me to.