sort-keys

What's wrong with a depth-limited function reorders an object it should have left alone — anything nested inside an array element is processed one level too early. Using the exact path the docs document — lists as depth : / are unaffected (they never use ). The bug only shows with the depth-based function form, and only for objects nested inside arrays. Why it happens should equal the key's nesting level — — which documents ( → ). An array element sits at , so: a nested array recurses at — adds its own for its elements; a nested object must recurse at — its keys are one level deeper than the element, and reports keys at exactly the depth it's given. The bug recursed the object at (the element's own depth), collapsing the element's keys onto it. Fix Snapshot the element depth once () and recurse with for arrays and for objects. Reading this local snapshot — rather than — keeps recursion independent of the user's callback, which is handed the same object and could otherwise mutate . (With the fix, holds for every reported path.) Tests Added an assertion that a key inside an array element is one level deeper than the element. Full suite (41 tests) passes, and the new assertion fails without the fix.