Run prettier on the code

Author: Tyler Rockwood

src/index.ts

@@ -50,7 +50,7 @@ class Trie<T> {
    *
    * @param target the key and distinct to remove.
    */
-  remove(target: Pick<Item<never>, 'key'|'distinct'>) {
+  remove(target: Pick<Item<never>, 'key' | 'distinct'>) {
     this.root.remove(target, 0);
   }
 

src/node.ts

@@ -138,11 +138,12 @@ class Node<T> {
     this.sorted = false;
   }
 
-  remove(target: Pick<Item<never>, 'key'|'distinct'>, index: number) {
+  remove(target: Pick<Item<never>, 'key' | 'distinct'>, index: number) {
     if (this.leaf) {
       let max = 0;
       filterInPlace(this.values as Item<T>[], item => {
-        const keep = item.key !== target.key || item.distinct !== target.distinct;
+        const keep =
+          item.key !== target.key || item.distinct !== target.distinct;
         if (keep) {
           max = Math.max(item.score, max);
         }
@@ -192,11 +193,7 @@ class Node<T> {
    * We use the passed in pqueue which has a limit and unique flag to
    * configure the search.
    */
-  getSortedResults(
-    prefix: string,
-    results: Array<T>,
-    opts: SearchOptions,
-  ) {
+  getSortedResults(prefix: string, results: Array<T>, opts: SearchOptions) {
     const seenKeys = new Set<string>();
 
     if (this.leaf) {

test/randomized.test.ts

@@ -157,7 +157,7 @@ describe('Trie Choas Monkey', () => {
         }
         case 'remove': {
           s.remove(op.key);
-          t.remove({key: op.key});
+          t.remove({ key: op.key });
           t.validateInvariants();
           break;
         }

test/trie.test.ts

@@ -257,11 +257,11 @@ describe('Trie', () => {
     });
 
     expect(t.prefixSearch('')).toEqual(['a', 'b']);
-    t.remove({key: 'a'});
+    t.remove({ key: 'a' });
     expect(t.prefixSearch('')).toEqual(['b']);
     expect(t.prefixSearch('b')).toEqual(['b']);
     expect(t.prefixSearch('a')).toEqual([]);
-    t.remove({key: 'b'});
+    t.remove({ key: 'b' });
     expect(t.prefixSearch('')).toEqual([]);
     expect(t.prefixSearch('b')).toEqual([]);
     expect(t.prefixSearch('a')).toEqual([]);
@@ -283,19 +283,19 @@ describe('Trie', () => {
     });
 
     expect(t.prefixSearch('')).toEqual(['b', 'a']);
-    t.remove({key: 'a'});
+    t.remove({ key: 'a' });
     expect(t.prefixSearch('')).toEqual(['b']);
     t.add({
       key: 'a',
       score: 3,
       value: 'a',
     });
     expect(t.prefixSearch('')).toEqual(['a', 'b']);
-    t.remove({key: 'a'});
+    t.remove({ key: 'a' });
   });
 
   it('distinct limit bug', () => {
-    const t = new StrictTrie({maxWidth: 1});
+    const t = new StrictTrie({ maxWidth: 1 });
     t.add({
       key: 'a',
       score: 1,
@@ -314,24 +314,24 @@ describe('Trie', () => {
       value: 'c',
       distinct: '2',
     });
-    expect(t.prefixSearch("", {limit: 2, unique: true})).toEqual(['a', 'c']);
+    expect(t.prefixSearch('', { limit: 2, unique: true })).toEqual(['a', 'c']);
   });
 
   it('removes exact distinct matches', () => {
-    const t = new StrictTrie({maxWidth: 1});
+    const t = new StrictTrie({ maxWidth: 1 });
     t.add({
       key: 'a',
       score: 1,
       value: 'a',
       distinct: '1',
     });
-    t.remove({key: 'a'})
-    expect(t.prefixSearch("")).toEqual(['a']);
-    t.remove({key: 'a', distinct: '2'})
-    expect(t.prefixSearch("")).toEqual(['a']);
-    t.remove({key: 'b', distinct: '1'})
-    expect(t.prefixSearch("")).toEqual(['a']);
-    t.remove({key: 'a', distinct: '1'})
-    expect(t.prefixSearch("")).toEqual([]);
+    t.remove({ key: 'a' });
+    expect(t.prefixSearch('')).toEqual(['a']);
+    t.remove({ key: 'a', distinct: '2' });
+    expect(t.prefixSearch('')).toEqual(['a']);
+    t.remove({ key: 'b', distinct: '1' });
+    expect(t.prefixSearch('')).toEqual(['a']);
+    t.remove({ key: 'a', distinct: '1' });
+    expect(t.prefixSearch('')).toEqual([]);
   });
 });