More refactoring

Author: AndreasArvidsson

packages/cursorless-engine/src/processTargets/modifiers/scopeHandlers/SurroundingPairScopeHandler/RangeLookupList.ts

@@ -10,7 +10,11 @@ export class RangeLookupList<T extends { range: Range }> {
   /**
    * @param items The items to search in. Must be sorted in document order.
    */
-  constructor(public items: T[]) {}
+  constructor(private items: T[]) {}
+
+  add(item: T) {
+    this.items.push(item);
+  }
 
   contains(searchItem: Range): boolean {
     return this.advance(searchItem);

packages/cursorless-engine/src/processTargets/modifiers/scopeHandlers/SurroundingPairScopeHandler/RangeLookupTree.ts

@@ -42,7 +42,7 @@ function createNodes<T extends { range: Range }>(
     const parent = parents[parents.length - 1];
 
     if (parent != null) {
-      parent.children.items.push(node);
+      parent.addChildNode(node);
     } else {
       results.push(node);
     }

packages/cursorless-engine/src/processTargets/modifiers/scopeHandlers/SurroundingPairScopeHandler/RangeTreeNode.ts

@@ -2,7 +2,7 @@ import type { Range } from "@cursorless/common";
 import { RangeLookupList } from "./RangeLookupList";
 
 export class RangeTreeNode<T extends { range: Range }> {
-  children: RangeLookupList<RangeTreeNode<T>>;
+  private children: RangeLookupList<RangeTreeNode<T>>;
 
   constructor(private item: T) {
     this.children = new RangeLookupList([]);
@@ -12,6 +12,10 @@ export class RangeTreeNode<T extends { range: Range }> {
     return this.item.range;
   }
 
+  addChildNode(node: RangeTreeNode<T>) {
+    this.children.add(node);
+  }
+
   getSmallLestContaining(range: Range): T {
     const child = this.children
       .getContaining(range)