Revert sort en performance critical areas

Author: AndreasArvidsson

packages/lib-engine/src/processTargets/modifiers/scopeHandlers/SurroundingPairScopeHandler/SurroundingPairScopeHandler.ts

@@ -73,7 +73,8 @@ export class SurroundingPairScopeHandler extends BaseScopeHandler {
           this.scopeType.requireStrongContainment ?? false,
         ),
       )
-      .toSorted((a, b) => compareTargetScopes(direction, position, a, b));
+      // oxlint-disable-next-line unicorn/no-array-sort
+      .sort((a, b) => compareTargetScopes(direction, position, a, b));
   }
 }
 

packages/lib-engine/src/processTargets/modifiers/scopeHandlers/TreeSitterScopeHandler/BaseTreeSitterScopeHandler.ts

@@ -46,7 +46,8 @@ export abstract class BaseTreeSitterScopeHandler extends BaseScopeHandler {
       .matches(document, start, end)
       .map((match) => this.matchToScope(editor, match, isEveryScope))
       .filter((scope): scope is ExtendedTargetScope => scope != null)
-      .toSorted((a, b) => compareTargetScopes(direction, position, a, b));
+      // oxlint-disable-next-line unicorn/no-array-sort
+      .sort((a, b) => compareTargetScopes(direction, position, a, b));
 
     // Merge scopes that have the same domain into a single scope with multiple
     // targets

packages/lib-engine/src/util/allocateHats/getRankedTokens.ts

@@ -52,21 +52,21 @@ export function getRankedTokens(
     return tokens;
   });
 
-  return moveForcedHatsToFront(forcedHatMap, tokens).map((token, index) => ({
+  if (forcedHatMap != null) {
+    moveForcedHatsToFront(forcedHatMap, tokens);
+  }
+
+  return tokens.map((token, index) => ({
     token,
     rank: -index,
   }));
 }
 
 function moveForcedHatsToFront(
-  forcedHatMap: CompositeKeyMap<Token, TokenHat> | undefined,
+  forcedHatMap: CompositeKeyMap<Token, TokenHat>,
   tokens: Token[],
-) {
-  if (forcedHatMap == null) {
-    return tokens;
-  }
-
-  return tokens.toSorted((a, b) => {
+): void {
+  tokens.sort((a, b) => {
     const aIsForced = forcedHatMap.has(a);
     const bIsForced = forcedHatMap.has(b);
     if (aIsForced && !bIsForced) {