fix: sort-keys autofix fully sorts keys in a single pass

[crimsonjay0]

Prerequisites checklist

• I have read the contributing guidelines.

AI acknowledgment

• I did not use AI to generate this PR.
• (If the above is not checked) I have reviewed the AI-generated content before submitting.

What is the purpose of this pull request?

The sort-keys autofix previously used a pairwise swap strategy, where each --fix pass only swapped two adjacent out-of-order members. For a fully reversed object with N keys, this required up to N-1 passes of eslint --fix to reach a fully sorted state.

What changes did you make? (Give an overview)

I replaced the pairwise swap fixer with a segment-based sorting approach that fully sorts all keys in a single pass.

Related Issues

Fixes #222

Is there anything you'd like reviewers to focus on?

[github-actions]

Hi everyone, it looks like we lost track of this pull request. Please review and see what the next steps are. This pull request will auto-close in 7 days without an update.

[crimsonjay0]

Not stale. I just forgot this was a draft.

[DMartens]

This PR has too many unnecessary unrelated changes to making the fix sort in a single pass.
Can you please limit the changes to the context.fix method as there is no need to precompute the fixes if there are none (which should be vast majority of cases)?
You can just use break after reporting to only report once.

Note that @humanwhocodes/momoa doesn't include comments in the object.members tree, so we can't just see if a member is preceded by a comment
You can use sourceCode.getTokenBefore(property, { includeComents: true }) for this.