umt 1.4.1 → 1.4.2

package/module/Array/index.d.ts

@@ -3,9 +3,11 @@ export * from "./checkFlagAlignment";
 export * from "./chunk";
 export * from "./getArraysCommon";
 export * from "./getArraysDiff";
+export * from "./insertionSort";
 export * from "./mergeSort";
 export * from "./quickSort";
 export * from "./range";
 export * from "./shuffle";
 export * from "./shuffle2DArray";
 export * from "./sum";
+export * from "./timSort";

package/module/Array/index.js

@@ -3,10 +3,12 @@ export * from "./checkFlagAlignment";
 export * from "./chunk";
 export * from "./getArraysCommon";
 export * from "./getArraysDiff";
+export * from "./insertionSort";
 export * from "./mergeSort";
 export * from "./quickSort";
 export * from "./range";
 export * from "./shuffle";
 export * from "./shuffle2DArray";
 export * from "./sum";
+export * from "./timSort";
 //# sourceMappingURL=index.js.map

package/module/Array/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/Array/index.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,sBAAsB,CAAC;AACrC,cAAc,SAAS,CAAC;AACxB,cAAc,mBAAmB,CAAC;AAClC,cAAc,iBAAiB,CAAC;AAChC,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC;AAC1B,cAAc,kBAAkB,CAAC;AACjC,cAAc,OAAO,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/Array/index.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,sBAAsB,CAAC;AACrC,cAAc,SAAS,CAAC;AACxB,cAAc,mBAAmB,CAAC;AAClC,cAAc,iBAAiB,CAAC;AAChC,cAAc,iBAAiB,CAAC;AAChC,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC;AAC1B,cAAc,kBAAkB,CAAC;AACjC,cAAc,OAAO,CAAC;AACtB,cAAc,WAAW,CAAC"}

package/module/Array/insertionSort.d.ts

@@ -0,0 +1,22 @@
+/**
+ * 挿入ソートを使用して配列をソート
+ *
+ * @param array ソートする配列
+ * @param compareFunction 比較関数
+ * @param start ソートを開始する配列のインデックス
+ * @param end ソートを終了する配列のインデックス
+ * @returns ソートされた配列
+ *
+ * @example
+ * const numbers = [4, 2, 7, 1, 3];
+ * insertionSort(numbers); // [1, 2, 3, 4, 7]
+ *
+ * @example
+ * const numbers = [4, 2, 7, 1, 3];
+ * insertionSort(numbers, (a, b) => a - b); // [1, 2, 3, 4, 7]
+ *
+ * @example
+ * const numbers = [4, 2, 7, 1, 3];
+ * insertionSort(numbers, undefined, 1, 3); // [4, 1, 2, 7, 3]
+ */
+export declare const insertionSort: <T>(array: T[], compareFunction?: (a: T, b: T) => number, start?: number, end?: number) => T[];

package/module/Array/insertionSort.js

@@ -0,0 +1,35 @@
+import { compareFunctionDefault } from "./compareFunctionDefault";
+/**
+ * 挿入ソートを使用して配列をソート
+ *
+ * @param array ソートする配列
+ * @param compareFunction 比較関数
+ * @param start ソートを開始する配列のインデックス
+ * @param end ソートを終了する配列のインデックス
+ * @returns ソートされた配列
+ *
+ * @example
+ * const numbers = [4, 2, 7, 1, 3];
+ * insertionSort(numbers); // [1, 2, 3, 4, 7]
+ *
+ * @example
+ * const numbers = [4, 2, 7, 1, 3];
+ * insertionSort(numbers, (a, b) => a - b); // [1, 2, 3, 4, 7]
+ *
+ * @example
+ * const numbers = [4, 2, 7, 1, 3];
+ * insertionSort(numbers, undefined, 1, 3); // [4, 1, 2, 7, 3]
+ */
+export const insertionSort = (array, compareFunction = (compareFunctionDefault), start = 0, end = array.length - 1) => {
+    for (let index = start + 1; index <= end; index++) {
+        let index_ = index;
+        const target = array[index];
+        while (index_ > start && compareFunction(array[index_ - 1], target) > 0) {
+            array[index_] = array[index_ - 1];
+            index_--;
+        }
+        array[index_] = target;
+    }
+    return array;
+};
+//# sourceMappingURL=insertionSort.js.map

package/module/Array/insertionSort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"insertionSort.js","sourceRoot":"","sources":["../../src/Array/insertionSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,KAAU,EACV,kBAA0C,CAAA,sBAAyB,CAAA,EACnE,KAAK,GAAG,CAAC,EACT,MAAc,KAAK,CAAC,MAAM,GAAG,CAAC,EACzB,EAAE;IACP,KAAK,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;QAClD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,MAAM,GAAG,KAAK,IAAI,eAAe,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YACxE,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAClC,MAAM,EAAE,CAAC;QACX,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;IACzB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}

package/module/Array/mergeSort.d.ts

@@ -1 +1,8 @@
-export declare const mergeSort: <T>(array: T[], compareFunction?: (a: T, b: T) => number, start?: number, end?: number) => T[];
+/**
+ * マージソート
+ * @param  {T[]} array 配列
+ * @param  {(a: T, b: T) => number} compareFunction 比較関数
+ * @returns T[]
+ * @example mergeSort([1, 3, 2, 4, 5], (a, b) => a - b); // [1, 2, 3, 4, 5]
+ */
+export declare function mergeSort<T>(array: T[], compareFunction?: (a: T, b: T) => number): T[];

package/module/Array/mergeSort.js

@@ -1,28 +1,39 @@
 import { compareFunctionDefault } from "./compareFunctionDefault";
-export const mergeSort = (array, compareFunction = (compareFunctionDefault), start = 0, end = array.length) => {
-    const length = end - start;
-    if (length <= 1) {
-        return array.slice(start, end);
+/**
+ * マージソート
+ * @param  {T[]} array 配列
+ * @param  {(a: T, b: T) => number} compareFunction 比較関数
+ * @returns T[]
+ * @example mergeSort([1, 3, 2, 4, 5], (a, b) => a - b); // [1, 2, 3, 4, 5]
+ */
+export function mergeSort(array, compareFunction = compareFunctionDefault) {
+    if (array.length <= 1) {
+        return array;
     }
-    const middle = start + Math.floor(length / 2);
-    const left = mergeSort(array, compareFunction, start, middle);
-    const right = mergeSort(array, compareFunction, middle, end);
-    return merge(left, right, compareFunction);
-};
+    const middle = Math.floor(array.length / 2);
+    const left = array.slice(0, middle);
+    const right = array.slice(middle);
+    return merge(mergeSort(left, compareFunction), mergeSort(right, compareFunction), compareFunction);
+}
+/**
+ * 2つの配列をマージする関数
+ * @param left - マージする左の配列
+ * @param right - マージする右の配列
+ * @param compareFunction - 比較関数
+ * @returns マージされた新しい配列
+ */
 function merge(left, right, compareFunction) {
-    const result = [];
-    let leftIndex = 0;
-    let rightIndex = 0;
-    while (leftIndex < left.length && rightIndex < right.length) {
-        if (compareFunction(left[leftIndex], right[rightIndex]) <= 0) {
-            result.push(left[leftIndex]);
-            leftIndex++;
+    const array = [];
+    let lIndex = 0;
+    let rIndex = 0;
+    while (lIndex < left.length && rIndex < right.length) {
+        if (compareFunction(left[lIndex], right[rIndex]) <= 0) {
+            array.push(left[lIndex++]);
         }
         else {
-            result.push(right[rightIndex]);
-            rightIndex++;
+            array.push(right[rIndex++]);
         }
     }
-    return result.concat(left.slice(leftIndex)).concat(right.slice(rightIndex));
+    return array.concat(left.slice(lIndex)).concat(right.slice(rIndex));
 }
 //# sourceMappingURL=mergeSort.js.map

package/module/Array/mergeSort.js.map

@@ -1 +1 @@
-{"version":3,"file":"mergeSort.js","sourceRoot":"","sources":["../../src/Array/mergeSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,KAAU,EACV,kBAA0C,CAAA,sBAAyB,CAAA,EACnE,KAAK,GAAG,CAAC,EACT,MAAc,KAAK,CAAC,MAAM,EACrB,EAAE;IACP,MAAM,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC;IAC3B,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;QAChB,OAAO,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC9C,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAC9D,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,eAAe,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IAE7D,OAAO,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;AAC7C,CAAC,CAAC;AAEF,SAAS,KAAK,CACZ,IAAS,EACT,KAAU,EACV,eAAuC;IAEvC,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,OAAO,SAAS,GAAG,IAAI,CAAC,MAAM,IAAI,UAAU,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC5D,IAAI,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7D,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YAC7B,SAAS,EAAE,CAAC;QACd,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;YAC/B,UAAU,EAAE,CAAC;QACf,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;AAC9E,CAAC"}
+{"version":3,"file":"mergeSort.js","sourceRoot":"","sources":["../../src/Array/mergeSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CACvB,KAAU,EACV,kBAA0C,sBAAsB;IAEhE,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAElC,OAAO,KAAK,CACV,SAAS,CAAC,IAAI,EAAE,eAAe,CAAC,EAChC,SAAS,CAAC,KAAK,EAAE,eAAe,CAAC,EACjC,eAAe,CAChB,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,KAAK,CACZ,IAAS,EACT,KAAU,EACV,eAAuC;IAEvC,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,OAAO,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACrD,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACtD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AACtE,CAAC"}

package/module/Array/timSort.d.ts

@@ -0,0 +1,13 @@
+/**
+ * TimSortアルゴリズムを実装した関数です。
+ * 挿入ソートとマージソートの良い特性を組み合わせたソートアルゴリズムで、
+ * 安定なソートを提供し、最悪のケースでもO(n log n)の時間複雑度を持ちます。
+ *
+ * @param {T[]} array - ソートする配列
+ * @param {(a: T, b: T) => number} [compareFunction=compareFunctionDefault<T>] -
+ *        要素比較のための関数
+ * @param {number} [start=0] - ソートを開始する配列のインデックス
+ * @param {number} [end=array.length - 1] - ソートを終了する配列のインデックス
+ * @returns {T[]} - ソートされた配列
+ */
+export declare const timSort: <T>(array: T[], compareFunction?: (a: T, b: T) => number, start?: number, end?: number) => T[];

package/module/Array/timSort.js

@@ -0,0 +1,79 @@
+import { compareFunctionDefault } from "./compareFunctionDefault";
+/**
+ * TimSortアルゴリズムを実装した関数です。
+ * 挿入ソートとマージソートの良い特性を組み合わせたソートアルゴリズムで、
+ * 安定なソートを提供し、最悪のケースでもO(n log n)の時間複雑度を持ちます。
+ *
+ * @param {T[]} array - ソートする配列
+ * @param {(a: T, b: T) => number} [compareFunction=compareFunctionDefault<T>] -
+ *        要素比較のための関数
+ * @param {number} [start=0] - ソートを開始する配列のインデックス
+ * @param {number} [end=array.length - 1] - ソートを終了する配列のインデックス
+ * @returns {T[]} - ソートされた配列
+ */
+export const timSort = (array, compareFunction = (compareFunctionDefault), start = 0, end = array.length - 1) => {
+    const MIN_RUN = 32;
+    const insertionSort = (start, end) => {
+        for (let index = start; index <= end; index++) {
+            const temporary = array[index];
+            let index_ = index - 1;
+            while (index_ >= start && compareFunction(array[index_], temporary) > 0) {
+                array[index_ + 1] = array[index_];
+                index_--;
+            }
+            array[index_ + 1] = temporary;
+        }
+    };
+    const merge = (start, mid, end) => {
+        const left = array.slice(start, mid + 1);
+        const right = array.slice(mid + 1, end + 1);
+        let index = 0;
+        let index_ = 0;
+        let k = start;
+        while (index < left.length && index_ < right.length) {
+            if (compareFunction(left[index], right[index_]) <= 0) {
+                array[k] = left[index];
+                index++;
+            }
+            else {
+                array[k] = right[index_];
+                index_++;
+            }
+            k++;
+        }
+        while (index < left.length) {
+            array[k] = left[index];
+            index++;
+            k++;
+        }
+        while (index_ < right.length) {
+            array[k] = right[index_];
+            index_++;
+            k++;
+        }
+    };
+    const getMinRunLength = (n) => {
+        let r = 0;
+        while (n >= MIN_RUN) {
+            r |= n & 1;
+            n >>= 1;
+        }
+        return n + r;
+    };
+    const n = end - start + 1;
+    const minRun = getMinRunLength(n);
+    for (let index = start; index <= end; index += minRun) {
+        insertionSort(index, Math.min(index + MIN_RUN - 1, end));
+    }
+    for (let size = minRun; size < n; size *= 2) {
+        for (let left = start; left <= end; left += 2 * size) {
+            const mid = left + size - 1;
+            const right = Math.min(left + 2 * size - 1, end);
+            if (mid < right) {
+                merge(left, mid, right);
+            }
+        }
+    }
+    return array;
+};
+//# sourceMappingURL=timSort.js.map

package/module/Array/timSort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"timSort.js","sourceRoot":"","sources":["../../src/Array/timSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,KAAU,EACV,kBAA0C,CAAA,sBAAyB,CAAA,EACnE,KAAK,GAAG,CAAC,EACT,MAAc,KAAK,CAAC,MAAM,GAAG,CAAC,EACzB,EAAE;IACP,MAAM,OAAO,GAAG,EAAE,CAAC;IAEnB,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,GAAW,EAAE,EAAE;QACnD,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;YAC9C,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;YACvB,OAAO,MAAM,IAAI,KAAK,IAAI,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBAClC,MAAM,EAAE,CAAC;YACX,CAAC;YACD,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;QAChC,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,GAAW,EAAE,GAAW,EAAE,EAAE;QACxD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QAC5C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,KAAK,CAAC;QACd,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YACpD,IAAI,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrD,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvB,KAAK,EAAE,CAAC;YACV,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBACzB,MAAM,EAAE,CAAC;YACX,CAAC;YACD,CAAC,EAAE,CAAC;QACN,CAAC;QACD,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YACvB,KAAK,EAAE,CAAC;YACR,CAAC,EAAE,CAAC;QACN,CAAC;QACD,OAAO,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YAC7B,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;YACzB,MAAM,EAAE,CAAC;YACT,CAAC,EAAE,CAAC;QACN,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,eAAe,GAAG,CAAC,CAAS,EAAE,EAAE;QACpC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,IAAI,OAAO,EAAE,CAAC;YACpB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACX,CAAC,KAAK,CAAC,CAAC;QACV,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC,CAAC;IAEF,MAAM,CAAC,GAAG,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAElC,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,GAAG,EAAE,KAAK,IAAI,MAAM,EAAE,CAAC;QACtD,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,OAAO,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,KAAK,IAAI,IAAI,GAAG,MAAM,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC5C,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;YACrD,MAAM,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAEjD,IAAI,GAAG,GAAG,KAAK,EAAE,CAAC;gBAChB,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}

package/package.json

@@ -55,5 +55,5 @@
     "format": "biome format . --write",
     "eslint": "eslint src"
   },
-  "version": "1.4.1"
+  "version": "1.4.2"
 }