data-structure-typed 1.49.3 → 1.49.5

package/dist/mjs/data-structures/queue/deque.js

@@ -1,5 +1,5 @@
-import { IterableElementBase } from "../base";
-import { calcMinUnitsRequired, rangeCheck } from "../../utils";
+import { IterableElementBase } from '../base';
+import { calcMinUnitsRequired, rangeCheck } from '../../utils';
 /**
  * 1. Operations at Both Ends: Supports adding and removing elements at both the front and back of the queue. This allows it to be used as a stack (last in, first out) and a queue (first in, first out).
  * 2. Efficient Random Access: Being based on an array, it offers fast random access capability, allowing constant time access to any element.
@@ -23,7 +23,7 @@ export class Deque extends IterableElementBase {
      * @param bucketSize - The `bucketSize` parameter is the maximum number of elements that can be
      * stored in each bucket. It determines the size of each bucket in the data structure.
      */
-    constructor(elements = [], bucketSize = (1 << 12)) {
+    constructor(elements = [], bucketSize = 1 << 12) {
         super();
         let _size;
         if ('length' in elements) {
@@ -45,7 +45,7 @@ export class Deque extends IterableElementBase {
         }
         const needBucketNum = calcMinUnitsRequired(_size, this._bucketSize);
         this._bucketFirst = this._bucketLast = (this._bucketCount >> 1) - (needBucketNum >> 1);
-        this._firstInBucket = this._lastInBucket = (this._bucketSize - _size % this._bucketSize) >> 1;
+        this._firstInBucket = this._lastInBucket = (this._bucketSize - (_size % this._bucketSize)) >> 1;
         for (const element of elements) {
             this.push(element);
         }
@@ -99,8 +99,7 @@ export class Deque extends IterableElementBase {
                 this._bucketLast = 0;
                 this._lastInBucket = 0;
             }
-            if (this._bucketLast === this._bucketFirst &&
-                this._lastInBucket === this._firstInBucket)
+            if (this._bucketLast === this._bucketFirst && this._lastInBucket === this._firstInBucket)
                 this._reallocate();
         }
         this._size += 1;
@@ -166,8 +165,7 @@ export class Deque extends IterableElementBase {
                 this._bucketFirst = this._bucketCount - 1;
                 this._firstInBucket = this._bucketSize - 1;
             }
-            if (this._bucketFirst === this._bucketLast &&
-                this._firstInBucket === this._lastInBucket)
+            if (this._bucketFirst === this._bucketLast && this._firstInBucket === this._lastInBucket)
                 this._reallocate();
         }
         this._size += 1;
@@ -766,7 +764,7 @@ export class Deque extends IterableElementBase {
         if (bucketIndex >= this._bucketCount) {
             bucketIndex -= this._bucketCount;
         }
-        indexInBucket = (overallIndex + 1) % this._bucketSize - 1;
+        indexInBucket = ((overallIndex + 1) % this._bucketSize) - 1;
         if (indexInBucket < 0) {
             indexInBucket = this._bucketSize - 1;
         }

package/dist/mjs/data-structures/queue/queue.d.ts

@@ -4,7 +4,7 @@
  * @class
  */
 import type { ElementCallback } from '../../types';
-import { IterableElementBase } from "../base";
+import { IterableElementBase } from '../base';
 import { SinglyLinkedList } from '../linked-list';
 /**
  * 1. First In, First Out (FIFO): The core feature of a queue is its first in, first out nature. The element added to the queue first will be the one to be removed first.

package/dist/mjs/data-structures/queue/queue.js

@@ -1,4 +1,4 @@
-import { IterableElementBase } from "../base";
+import { IterableElementBase } from '../base';
 import { SinglyLinkedList } from '../linked-list';
 /**
  * 1. First In, First Out (FIFO): The core feature of a queue is its first in, first out nature. The element added to the queue first will be the one to be removed first.

package/dist/mjs/types/data-structures/base/base.d.ts

@@ -1,4 +1,4 @@
-import { IterableElementBase, IterableEntryBase } from "../../../data-structures";
+import { IterableElementBase, IterableEntryBase } from '../../../data-structures';
 export type EntryCallback<K, V, R> = (value: V, key: K, index: number, container: IterableEntryBase<K, V>) => R;
 export type ElementCallback<V, R> = (element: V, index: number, container: IterableElementBase<V>) => R;
 export type ReduceEntryCallback<K, V, R> = (accumulator: R, value: V, key: K, index: number, container: IterableEntryBase<K, V>) => R;

package/dist/mjs/types/data-structures/heap/heap.d.ts

@@ -1,4 +1,4 @@
-import { Comparator } from "../../common";
+import { Comparator } from '../../common';
 export type HeapOptions<T> = {
     comparator: Comparator<T>;
 };

package/dist/mjs/types/data-structures/priority-queue/priority-queue.d.ts

@@ -1,2 +1,2 @@
-import { HeapOptions } from "../heap";
+import { HeapOptions } from '../heap';
 export type PriorityQueueOptions<T> = HeapOptions<T> & {};

package/dist/mjs/utils/utils.d.ts

@@ -22,3 +22,4 @@ export declare const rangeCheck: (index: number, min: number, max: number, messa
 export declare const throwRangeError: (message?: string) => void;
 export declare const isWeakKey: (input: unknown) => input is object;
 export declare const calcMinUnitsRequired: (totalQuantity: number, unitSize: number) => number;
+export declare const roundFixed: (num: number, digit?: number) => number;

package/dist/mjs/utils/utils.js

@@ -64,3 +64,7 @@ export const isWeakKey = (input) => {
     return (inputType === 'object' && input !== null) || inputType === 'function';
 };
 export const calcMinUnitsRequired = (totalQuantity, unitSize) => Math.floor((totalQuantity + unitSize - 1) / unitSize);
+export const roundFixed = (num, digit = 10) => {
+    const multiplier = Math.pow(10, digit);
+    return Math.round(num * multiplier) / multiplier;
+};