data-structure-typed 1.52.0 → 1.52.2

package/test/unit/data-structures/queue/deque.test.ts

@@ -204,8 +204,7 @@ describe('Deque - Complex Operations', () => {
     expect([...deque]).toEqual([1, 2, 3]);
   });
 
-  test('shrinkToFit should reduce the memory footprint', () => {
-  });
+  test('shrinkToFit should reduce the memory footprint', () => {});
 });
 describe('Deque - Utility Operations', () => {
   let deque: Deque<number>;
@@ -260,6 +259,24 @@ describe('Deque - Utility Operations', () => {
     // deque.print();
     // expect(consoleSpy).toHaveBeenCalledWith([1, 2]);
   });
+
+  test('should maxLen work well', () => {
+    const dequeMaxLen = new Deque([3, 4, 5, 6, 7], { maxLen: 3 });
+    expect(dequeMaxLen.size).toBe(3);
+    expect(dequeMaxLen.toArray()).toEqual([5, 6, 7]);
+    dequeMaxLen.unshift(4);
+    dequeMaxLen.unshift(3);
+    expect(dequeMaxLen.size).toBe(3);
+    expect(dequeMaxLen.toArray()).toEqual([3, 4, 5]);
+
+    const dequeNoMaxLen = new Deque([3, 4, 5, 6, 7]);
+    expect(dequeNoMaxLen.size).toBe(5);
+    expect(dequeNoMaxLen.toArray()).toEqual([3, 4, 5, 6, 7]);
+    dequeNoMaxLen.unshift(4);
+    dequeNoMaxLen.unshift(3);
+    expect(dequeNoMaxLen.size).toBe(7);
+    expect(dequeNoMaxLen.toArray()).toEqual([3, 4, 3, 4, 5, 6, 7]);
+  });
 });
 
 describe('Deque - Additional Operations', () => {
@@ -325,7 +342,9 @@ describe('Deque - push Method', () => {
   const bucketSize = 10;
 
   beforeEach(() => {
-    deque = new Deque<number>([], { bucketSize });
+    deque = new Deque<number>([], {
+      bucketSize
+    });
   });
 
   test('push should add an element when deque is empty', () => {
@@ -367,7 +386,9 @@ describe('Deque - pop Method', () => {
   const bucketSize = 10;
 
   beforeEach(() => {
-    deque = new Deque<number>([], { bucketSize });
+    deque = new Deque<number>([], {
+      bucketSize
+    });
   });
 
   test('pop should remove and return the last element', () => {
@@ -398,7 +419,9 @@ describe('Deque - unshift Method', () => {
   const bucketSize = 10;
 
   beforeEach(() => {
-    deque = new Deque<number>([], { bucketSize });
+    deque = new Deque<number>([], {
+      bucketSize
+    });
   });
 
   test('unshift should add an element to the beginning when deque is empty', () => {
@@ -430,7 +453,9 @@ describe('Deque - shift Method', () => {
   const bucketSize = 10;
 
   beforeEach(() => {
-    deque = new Deque<number>([], { bucketSize });
+    deque = new Deque<number>([], {
+      bucketSize
+    });
   });
 
   test('shift should remove and return the first element', () => {

package/test/unit/data-structures/queue/queue.test.ts

@@ -90,6 +90,16 @@ describe('Queue', () => {
     expect(queue.isEmpty()).toBeTruthy();
   });
 
+  test('compact method should work well', () => {
+    for (let i = 0; i < 1000; i++) queue.push(i);
+
+    for (let i = 0; i < 499; i++) queue.shift();
+
+    expect(queue.elements.length).toBe(1000);
+    queue.compact();
+    expect(queue.elements.length).toBe(501);
+  });
+
   test('should at after shifting', () => {
     for (let i = 0; i < 100; i++) {
       queue.push(i);
@@ -116,7 +126,10 @@ describe('Queue', () => {
   });
 
   it('should object queue map & filter', function () {
-    const queue = new Queue<{ a: string; key: number }>([
+    const queue = new Queue<{
+      a: string;
+      key: number;
+    }>([
       { key: 1, a: 'a1' },
       { key: 6, a: 'a6' },
       { key: 5, a: 'a5' },

package/test/unit/data-structures/trie/trie.test.ts

@@ -795,7 +795,9 @@ describe('Trie operations', () => {
   });
 
   it('Case Sensitivity', () => {
-    const caseInsensitiveTrie = new Trie(['apple', 'Banana'], { caseSensitive: false });
+    const caseInsensitiveTrie = new Trie(['apple', 'Banana'], {
+      caseSensitive: false
+    });
     expect(caseInsensitiveTrie.has('APPLE')).toBe(true);
     expect(caseInsensitiveTrie.has('banana')).toBe(true);
     expect(caseInsensitiveTrie.has('Cherry')).toBe(false);

package/test/unit/unrestricted-interconversion.test.ts

@@ -245,7 +245,9 @@ describe('conversions', () => {
     const trie = new Trie(orgStrArr);
     expect(trie.size).toBe(10);
     isDebug && trie.print();
-    const heap = new Heap<string>(trie, { comparator: (a, b) => Number(a) - Number(b) });
+    const heap = new Heap<string>(trie, {
+      comparator: (a, b) => Number(a) - Number(b)
+    });
     expect(heap.size).toBe(10);
     isDebug && heap.print();
     expect([...heap]).toEqual([

package/test/utils/big-o.ts

@@ -32,7 +32,9 @@ export const bigO = {
 
 function findPotentialN(input: any): number {
   let longestArray: any[] = [];
-  let mostProperties: { [key: string]: any } = {};
+  let mostProperties: {
+    [key: string]: any;
+  } = {};
 
   function recurse(obj: any) {
     if (Array.isArray(obj)) {

package/test/utils/json2html.ts

@@ -14,13 +14,9 @@ function makeLabelDiv(options: any, level: number, keyName: string | number, dat
     return `<div class='index'><span class='json-to-html-label'>${keyName}&nbsp;</span></div>`;
   } else if (typeof keyName === 'string') {
     if (datatype === 'array') {
-      return `<div class='collapsible level${level}' ${toggleJS(
-        options
-      )}><span class='json-to-html-label'>${keyName}</span></div>`;
+      return `<div class='collapsible level${level}' ${toggleJS(options)}><span class='json-to-html-label'>${keyName}</span></div>`;
     } else if (datatype === 'object') {
-      return `<div class='attribute collapsible level${level}' ${toggleJS(
-        options
-      )}><span class='json-to-html-label'>${keyName}:</span></div>`;
+      return `<div class='attribute collapsible level${level}' ${toggleJS(options)}><span class='json-to-html-label'>${keyName}:</span></div>`;
     } else {
       return `<div class='leaf level${level}'><span class='json-to-html-label'>${keyName}:</span></div>`;
     }