exsorted 1.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Ink01101011
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,91 @@
+# exsorted
+
+[![npm version](https://img.shields.io/npm/v/exsorted.svg)](https://www.npmjs.com/package/exsorted)
+[![npm downloads](https://img.shields.io/npm/dm/exsorted.svg)](https://www.npmjs.com/package/exsorted)
+[![CI](https://github.com/Ink01101011/exsorted/actions/workflows/ci.yml/badge.svg)](https://github.com/Ink01101011/exsorted/actions/workflows/ci.yml)
+[![TypeScript](https://img.shields.io/badge/TypeScript-Ready-3178C6?logo=typescript&logoColor=white)](https://www.typescriptlang.org/)
+[![Bundle size](https://img.shields.io/bundlephobia/minzip/exsorted)](https://bundlephobia.com/package/exsorted)
+[![Node.js](https://img.shields.io/node/v/exsorted)](https://www.npmjs.com/package/exsorted)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](LICENSE)
+
+A lightweight, fully-typed TypeScript library of sorting algorithms — ready to use in any TypeScript or JavaScript project.
+
+## Algorithms
+
+| Algorithm      | Average Time | Worst Time | Space    | Stable | In-place |
+| -------------- | ------------ | ---------- | -------- | ------ | -------- |
+| Bubble Sort    | O(n²)        | O(n²)      | O(1)     | ✅     | ✅       |
+| Insertion Sort | O(n²)        | O(n²)      | O(1)     | ✅     | ✅       |
+| Selection Sort | O(n²)        | O(n²)      | O(1)     | ❌     | ✅       |
+| Merge Sort     | O(n log n)   | O(n log n) | O(n)     | ✅     | ❌       |
+| Quick Sort     | O(n log n)   | O(n²)      | O(log n) | ❌     | ✅       |
+| Heap Sort      | O(n log n)   | O(n log n) | O(1)     | ❌     | ✅       |
+
+## Installation
+
+```bash
+npm install exsorted
+```
+
+## Usage
+
+```typescript
+import { bubbleSort, insertionSort, selectionSort, mergeSort, quickSort, heapSort, compareBy } from 'exsorted';
+
+// Sort numbers ascending (default)
+bubbleSort([5, 3, 8, 1, 2]); // [1, 2, 3, 5, 8]
+mergeSort([5, 3, 8, 1, 2]); // [1, 2, 3, 5, 8]
+
+// Sort numbers descending (custom comparator)
+quickSort([5, 3, 8, 1, 2], (a, b) => b - a); // [8, 5, 3, 2, 1]
+
+// Sort strings
+insertionSort(['banana', 'apple', 'cherry']); // ['apple', 'banana', 'cherry']
+
+// Sort objects
+interface Person {
+  name: string;
+  age: number;
+}
+const people: Person[] = [
+  { name: 'Alice', age: 30 },
+  { name: 'Bob', age: 25 },
+  { name: 'Charlie', age: 35 },
+];
+heapSort(people, (a, b) => a.age - b.age);
+// [{ name: 'Bob', age: 25 }, { name: 'Alice', age: 30 }, { name: 'Charlie', age: 35 }]
+
+// Or use compareBy helper for cleaner typed comparators
+quickSort(
+  people,
+  compareBy((p) => p.age),
+);
+
+// Subpath import (new namespace structure)
+import { selectionSort as baseSelectionSort } from 'exsorted/selection';
+baseSelectionSort([3, 1, 2]); // [1, 2, 3]
+```
+
+### API
+
+Every function shares the same signature:
+
+```typescript
+function algorithmName<T>(arr: T[], compareFn?: (a: T, b: T) => number): T[];
+```
+
+- **`arr`** — the array to sort.  
+  _Most algorithms sort in-place (mutate `arr`). `mergeSort` is the exception — it returns a new array and leaves the original untouched._
+- **`compareFn`** _(optional)_ — behaves like the native `Array.prototype.sort` comparator:
+  - return **negative** if `a` should come before `b`
+  - return **positive** if `a` should come after `b`
+  - return **0** if order does not matter  
+    Defaults to a dynamic deterministic comparator:
+    supports `number`, `string`, `bigint`, `boolean`, `Date`, arrays, and objects.
+    For domain-specific object ordering, passing an explicit `compareFn` is still recommended.
+
+  `compareBy(selector, compareFn?)` helper is exported to build typed object comparators.
+
+## License
+
+[MIT](LICENSE)

package/dist/base/bubble.cjs

@@ -0,0 +1 @@
+'use strict';function N(e,n){let i=p(e),o=p(n);if(i!==o)return i-o;if(typeof e=="number"&&typeof n=="number")return Number.isNaN(e)&&Number.isNaN(n)?0:Number.isNaN(e)?1:Number.isNaN(n)?-1:e-n;if(typeof e=="bigint"&&typeof n=="bigint")return e<n?-1:e>n?1:0;if(typeof e=="boolean"&&typeof n=="boolean")return Number(e)-Number(n);if(e instanceof Date&&n instanceof Date){let t=e.getTime(),f=n.getTime();return Number.isNaN(t)&&Number.isNaN(f)?0:Number.isNaN(t)?1:Number.isNaN(f)?-1:t-f}let u=b(e),r=b(n);return u<r?-1:u>r?1:0}function p(e){return e===void 0?0:e===null?1:typeof e=="boolean"?2:typeof e=="number"?3:typeof e=="bigint"?4:typeof e=="string"?5:e instanceof Date?6:Array.isArray(e)?7:typeof e=="object"?8:typeof e=="symbol"?9:10}function b(e){return e===void 0?"undefined":e===null?"null":typeof e=="symbol"?e.toString():typeof e=="function"?e.name||"anonymous":d(e)}function d(e){let n=new Set,i=new WeakMap,o=1;function u(t){let f=i.get(t);if(f!==void 0)return f;let s=o++;return i.set(t,s),s}function r(t){if(t===null)return "null";if(typeof t!="object")return String(t);let f=u(t);if(n.has(t))return `[Circular#${f}]`;n.add(t);let s;return Array.isArray(t)?s=`[${t.map(r).join(",")}]`:t instanceof Date?s=`Date:${t.toISOString()}`:s=`{${Object.entries(t).sort(([m],[c])=>m<c?-1:m>c?1:0).map(([m,c])=>`${m}:${r(c)}`).join(",")}}`,n.delete(t),s}return r(e)}function y(e,n=N){let i=e.length;for(let o=0;o<i-1;o++){let u=false;for(let r=0;r<i-1-o;r++)n(e[r],e[r+1])>0&&([e[r],e[r+1]]=[e[r+1],e[r]],u=true);if(!u)break}return e}exports.bubbleSort=y;

package/dist/base/bubble.d.mts

@@ -0,0 +1,18 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.mjs';
+
+/**
+ * Bubble Sort
+ *
+ * Repeatedly steps through the list, compares adjacent elements, and swaps
+ * them if they are in the wrong order.
+ *
+ * Time complexity:  O(n²) average and worst case, O(n) best case
+ * Space complexity: O(1)
+ *
+ * @param arr - The array to sort (mutated in place)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns The sorted array
+ */
+declare function bubbleSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { bubbleSort };

package/dist/base/bubble.d.ts

@@ -0,0 +1,18 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.js';
+
+/**
+ * Bubble Sort
+ *
+ * Repeatedly steps through the list, compares adjacent elements, and swaps
+ * them if they are in the wrong order.
+ *
+ * Time complexity:  O(n²) average and worst case, O(n) best case
+ * Space complexity: O(1)
+ *
+ * @param arr - The array to sort (mutated in place)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns The sorted array
+ */
+declare function bubbleSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { bubbleSort };

package/dist/base/bubble.mjs

@@ -0,0 +1 @@
+export{a as bubbleSort}from'../chunk-6OACJ5NV.mjs';import'../chunk-J5DRKNXL.mjs';

package/dist/base/heap.cjs

@@ -0,0 +1 @@
+'use strict';function b(n,e){let i=y(n),r=y(e);if(i!==r)return i-r;if(typeof n=="number"&&typeof e=="number")return Number.isNaN(n)&&Number.isNaN(e)?0:Number.isNaN(n)?1:Number.isNaN(e)?-1:n-e;if(typeof n=="bigint"&&typeof e=="bigint")return n<e?-1:n>e?1:0;if(typeof n=="boolean"&&typeof e=="boolean")return Number(n)-Number(e);if(n instanceof Date&&e instanceof Date){let t=n.getTime(),u=e.getTime();return Number.isNaN(t)&&Number.isNaN(u)?0:Number.isNaN(t)?1:Number.isNaN(u)?-1:t-u}let o=N(n),f=N(e);return o<f?-1:o>f?1:0}function y(n){return n===void 0?0:n===null?1:typeof n=="boolean"?2:typeof n=="number"?3:typeof n=="bigint"?4:typeof n=="string"?5:n instanceof Date?6:Array.isArray(n)?7:typeof n=="object"?8:typeof n=="symbol"?9:10}function N(n){return n===void 0?"undefined":n===null?"null":typeof n=="symbol"?n.toString():typeof n=="function"?n.name||"anonymous":d(n)}function d(n){let e=new Set,i=new WeakMap,r=1;function o(t){let u=i.get(t);if(u!==void 0)return u;let s=r++;return i.set(t,s),s}function f(t){if(t===null)return "null";if(typeof t!="object")return String(t);let u=o(t);if(e.has(t))return `[Circular#${u}]`;e.add(t);let s;return Array.isArray(t)?s=`[${t.map(f).join(",")}]`:t instanceof Date?s=`Date:${t.toISOString()}`:s=`{${Object.entries(t).sort(([m],[c])=>m<c?-1:m>c?1:0).map(([m,c])=>`${m}:${f(c)}`).join(",")}}`,e.delete(t),s}return f(n)}function g(n,e=b){let i=n.length;for(let r=Math.floor(i/2)-1;r>=0;r--)p(n,i,r,e);for(let r=i-1;r>0;r--)[n[0],n[r]]=[n[r],n[0]],p(n,r,0,e);return n}function p(n,e,i,r){let o=i,f=2*i+1,t=2*i+2;f<e&&r(n[f],n[o])>0&&(o=f),t<e&&r(n[t],n[o])>0&&(o=t),o!==i&&([n[i],n[o]]=[n[o],n[i]],p(n,e,o,r));}exports.heapSort=g;

package/dist/base/heap.d.mts

@@ -0,0 +1,18 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.mjs';
+
+/**
+ * Heap Sort
+ *
+ * Builds a max-heap from the array and then repeatedly extracts the maximum
+ * element, placing it at the end of the array.
+ *
+ * Time complexity:  O(n log n) in all cases
+ * Space complexity: O(1)
+ *
+ * @param arr - The array to sort (mutated in place)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns The sorted array
+ */
+declare function heapSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { heapSort };

package/dist/base/heap.d.ts

@@ -0,0 +1,18 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.js';
+
+/**
+ * Heap Sort
+ *
+ * Builds a max-heap from the array and then repeatedly extracts the maximum
+ * element, placing it at the end of the array.
+ *
+ * Time complexity:  O(n log n) in all cases
+ * Space complexity: O(1)
+ *
+ * @param arr - The array to sort (mutated in place)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns The sorted array
+ */
+declare function heapSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { heapSort };

package/dist/base/heap.mjs

@@ -0,0 +1 @@
+export{a as heapSort}from'../chunk-FZMEZVLG.mjs';import'../chunk-J5DRKNXL.mjs';

package/dist/base/index.cjs

@@ -0,0 +1 @@
+'use strict';function m(t,e){let n=y(t),o=y(e);if(n!==o)return n-o;if(typeof t=="number"&&typeof e=="number")return Number.isNaN(t)&&Number.isNaN(e)?0:Number.isNaN(t)?1:Number.isNaN(e)?-1:t-e;if(typeof t=="bigint"&&typeof e=="bigint")return t<e?-1:t>e?1:0;if(typeof t=="boolean"&&typeof e=="boolean")return Number(t)-Number(e);if(t instanceof Date&&e instanceof Date){let f=t.getTime(),u=e.getTime();return Number.isNaN(f)&&Number.isNaN(u)?0:Number.isNaN(f)?1:Number.isNaN(u)?-1:f-u}let i=S(t),r=S(e);return i<r?-1:i>r?1:0}function y(t){return t===void 0?0:t===null?1:typeof t=="boolean"?2:typeof t=="number"?3:typeof t=="bigint"?4:typeof t=="string"?5:t instanceof Date?6:Array.isArray(t)?7:typeof t=="object"?8:typeof t=="symbol"?9:10}function S(t){return t===void 0?"undefined":t===null?"null":typeof t=="symbol"?t.toString():typeof t=="function"?t.name||"anonymous":b(t)}function b(t){let e=new Set,n=new WeakMap,o=1;function i(f){let u=n.get(f);if(u!==void 0)return u;let s=o++;return n.set(f,s),s}function r(f){if(f===null)return "null";if(typeof f!="object")return String(f);let u=i(f);if(e.has(f))return `[Circular#${u}]`;e.add(f);let s;return Array.isArray(f)?s=`[${f.map(r).join(",")}]`:f instanceof Date?s=`Date:${f.toISOString()}`:s=`{${Object.entries(f).sort(([p],[c])=>p<c?-1:p>c?1:0).map(([p,c])=>`${p}:${r(c)}`).join(",")}}`,e.delete(f),s}return r(t)}function N(t,e=m){let n=t.length;for(let o=0;o<n-1;o++){let i=false;for(let r=0;r<n-1-o;r++)e(t[r],t[r+1])>0&&([t[r],t[r+1]]=[t[r+1],t[r]],i=true);if(!i)break}return t}function C(t,e=m){let n=t.length;for(let o=Math.floor(n/2)-1;o>=0;o--)l(t,n,o,e);for(let o=n-1;o>0;o--)[t[0],t[o]]=[t[o],t[0]],l(t,o,0,e);return t}function l(t,e,n,o){let i=n,r=2*n+1,f=2*n+2;r<e&&o(t[r],t[i])>0&&(i=r),f<e&&o(t[f],t[i])>0&&(i=f),i!==n&&([t[n],t[i]]=[t[i],t[n]],l(t,e,i,o));}function x(t,e=m){for(let n=1;n<t.length;n++){let o=t[n],i=n-1;for(;i>=0&&e(t[i],o)>0;)t[i+1]=t[i],i--;t[i+1]=o;}return t}function d(t,e=m){if(t.length<=1)return t.slice();let n=Math.floor(t.length/2),o=d(t.slice(0,n),e),i=d(t.slice(n),e);return A(o,i,e)}function A(t,e,n){let o=[],i=0,r=0;for(;i<t.length&&r<e.length;)n(t[i],e[r])<=0?o.push(t[i++]):o.push(e[r++]);for(;i<t.length;)o.push(t[i++]);for(;r<e.length;)o.push(e[r++]);return o}function g(t,e=m){return T(t,0,t.length-1,e),t}function T(t,e,n,o){if(e<n){let i=k(t,e,n,o);T(t,e,i-1,o),T(t,i+1,n,o);}}function k(t,e,n,o){let i=Math.floor((e+n)/2);o(t[i],t[e])<0&&([t[e],t[i]]=[t[i],t[e]]),o(t[n],t[e])<0&&([t[e],t[n]]=[t[n],t[e]]),o(t[i],t[n])>0&&([t[i],t[n]]=[t[n],t[i]]),[t[i],t[n]]=[t[n],t[i]];let r=t[n],f=e-1;for(let u=e;u<n;u++)o(t[u],r)<=0&&(f++,[t[f],t[u]]=[t[u],t[f]]);return [t[f+1],t[n]]=[t[n],t[f+1]],f+1}function j(t,e=m){let n=t.length;for(let o=0;o<n-1;o++){let i=o;for(let r=o+1;r<n;r++)e(t[r],t[i])<0&&(i=r);i!==o&&([t[o],t[i]]=[t[i],t[o]]);}return t}exports.bubbleSort=N;exports.heapSort=C;exports.insertionSort=x;exports.mergeSort=d;exports.quickSort=g;exports.selectionSort=j;

package/dist/base/index.d.mts

@@ -0,0 +1,7 @@
+export { bubbleSort } from './bubble.mjs';
+export { heapSort } from './heap.mjs';
+export { insertionSort } from './insertion.mjs';
+export { mergeSort } from './merge.mjs';
+export { quickSort } from './quick.mjs';
+export { selectionSort } from './selection.mjs';
+import '../function-type-BAHbNN5P.mjs';

package/dist/base/index.d.ts

@@ -0,0 +1,7 @@
+export { bubbleSort } from './bubble.js';
+export { heapSort } from './heap.js';
+export { insertionSort } from './insertion.js';
+export { mergeSort } from './merge.js';
+export { quickSort } from './quick.js';
+export { selectionSort } from './selection.js';
+import '../function-type-BAHbNN5P.js';

package/dist/base/index.mjs

@@ -0,0 +1 @@
+export{a as bubbleSort}from'../chunk-6OACJ5NV.mjs';export{a as heapSort}from'../chunk-FZMEZVLG.mjs';export{a as insertionSort}from'../chunk-YWVRJOGW.mjs';export{a as mergeSort}from'../chunk-3JE3MTR3.mjs';export{a as quickSort}from'../chunk-F7APGQXB.mjs';export{a as selectionSort}from'../chunk-KESA4OWP.mjs';import'../chunk-J5DRKNXL.mjs';

package/dist/base/insertion.cjs

@@ -0,0 +1 @@
+'use strict';function N(n,e){let i=p(n),f=p(e);if(i!==f)return i-f;if(typeof n=="number"&&typeof e=="number")return Number.isNaN(n)&&Number.isNaN(e)?0:Number.isNaN(n)?1:Number.isNaN(e)?-1:n-e;if(typeof n=="bigint"&&typeof e=="bigint")return n<e?-1:n>e?1:0;if(typeof n=="boolean"&&typeof e=="boolean")return Number(n)-Number(e);if(n instanceof Date&&e instanceof Date){let t=n.getTime(),o=e.getTime();return Number.isNaN(t)&&Number.isNaN(o)?0:Number.isNaN(t)?1:Number.isNaN(o)?-1:t-o}let r=y(n),s=y(e);return r<s?-1:r>s?1:0}function p(n){return n===void 0?0:n===null?1:typeof n=="boolean"?2:typeof n=="number"?3:typeof n=="bigint"?4:typeof n=="string"?5:n instanceof Date?6:Array.isArray(n)?7:typeof n=="object"?8:typeof n=="symbol"?9:10}function y(n){return n===void 0?"undefined":n===null?"null":typeof n=="symbol"?n.toString():typeof n=="function"?n.name||"anonymous":d(n)}function d(n){let e=new Set,i=new WeakMap,f=1;function r(t){let o=i.get(t);if(o!==void 0)return o;let u=f++;return i.set(t,u),u}function s(t){if(t===null)return "null";if(typeof t!="object")return String(t);let o=r(t);if(e.has(t))return `[Circular#${o}]`;e.add(t);let u;return Array.isArray(t)?u=`[${t.map(s).join(",")}]`:t instanceof Date?u=`Date:${t.toISOString()}`:u=`{${Object.entries(t).sort(([m],[c])=>m<c?-1:m>c?1:0).map(([m,c])=>`${m}:${s(c)}`).join(",")}}`,e.delete(t),u}return s(n)}function b(n,e=N){for(let i=1;i<n.length;i++){let f=n[i],r=i-1;for(;r>=0&&e(n[r],f)>0;)n[r+1]=n[r],r--;n[r+1]=f;}return n}exports.insertionSort=b;

package/dist/base/insertion.d.mts

@@ -0,0 +1,18 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.mjs';
+
+/**
+ * Insertion Sort
+ *
+ * Builds the sorted array one element at a time by inserting each new element
+ * into its correct position among the already-sorted elements.
+ *
+ * Time complexity:  O(n²) average and worst case, O(n) best case
+ * Space complexity: O(1)
+ *
+ * @param arr - The array to sort (mutated in place)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns The sorted array
+ */
+declare function insertionSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { insertionSort };

package/dist/base/insertion.d.ts

@@ -0,0 +1,18 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.js';
+
+/**
+ * Insertion Sort
+ *
+ * Builds the sorted array one element at a time by inserting each new element
+ * into its correct position among the already-sorted elements.
+ *
+ * Time complexity:  O(n²) average and worst case, O(n) best case
+ * Space complexity: O(1)
+ *
+ * @param arr - The array to sort (mutated in place)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns The sorted array
+ */
+declare function insertionSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { insertionSort };

package/dist/base/insertion.mjs

@@ -0,0 +1 @@
+export{a as insertionSort}from'../chunk-YWVRJOGW.mjs';import'../chunk-J5DRKNXL.mjs';

package/dist/base/merge.cjs

@@ -0,0 +1 @@
+'use strict';function y(e,n){let u=N(e),r=N(n);if(u!==r)return u-r;if(typeof e=="number"&&typeof n=="number")return Number.isNaN(e)&&Number.isNaN(n)?0:Number.isNaN(e)?1:Number.isNaN(n)?-1:e-n;if(typeof e=="bigint"&&typeof n=="bigint")return e<n?-1:e>n?1:0;if(typeof e=="boolean"&&typeof n=="boolean")return Number(e)-Number(n);if(e instanceof Date&&n instanceof Date){let t=e.getTime(),f=n.getTime();return Number.isNaN(t)&&Number.isNaN(f)?0:Number.isNaN(t)?1:Number.isNaN(f)?-1:t-f}let i=d(e),o=d(n);return i<o?-1:i>o?1:0}function N(e){return e===void 0?0:e===null?1:typeof e=="boolean"?2:typeof e=="number"?3:typeof e=="bigint"?4:typeof e=="string"?5:e instanceof Date?6:Array.isArray(e)?7:typeof e=="object"?8:typeof e=="symbol"?9:10}function d(e){return e===void 0?"undefined":e===null?"null":typeof e=="symbol"?e.toString():typeof e=="function"?e.name||"anonymous":g(e)}function g(e){let n=new Set,u=new WeakMap,r=1;function i(t){let f=u.get(t);if(f!==void 0)return f;let s=r++;return u.set(t,s),s}function o(t){if(t===null)return "null";if(typeof t!="object")return String(t);let f=i(t);if(n.has(t))return `[Circular#${f}]`;n.add(t);let s;return Array.isArray(t)?s=`[${t.map(o).join(",")}]`:t instanceof Date?s=`Date:${t.toISOString()}`:s=`{${Object.entries(t).sort(([m],[c])=>m<c?-1:m>c?1:0).map(([m,c])=>`${m}:${o(c)}`).join(",")}}`,n.delete(t),s}return o(e)}function p(e,n=y){if(e.length<=1)return e.slice();let u=Math.floor(e.length/2),r=p(e.slice(0,u),n),i=p(e.slice(u),n);return l(r,i,n)}function l(e,n,u){let r=[],i=0,o=0;for(;i<e.length&&o<n.length;)u(e[i],n[o])<=0?r.push(e[i++]):r.push(n[o++]);for(;i<e.length;)r.push(e[i++]);for(;o<n.length;)r.push(n[o++]);return r}exports.mergeSort=p;

package/dist/base/merge.d.mts

@@ -0,0 +1,18 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.mjs';
+
+/**
+ * Merge Sort
+ *
+ * Divides the array into halves, recursively sorts each half, then merges the
+ * sorted halves back together.
+ *
+ * Time complexity:  O(n log n) in all cases
+ * Space complexity: O(n)
+ *
+ * @param arr - The array to sort (a new sorted array is returned)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns A new sorted array
+ */
+declare function mergeSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { mergeSort };

package/dist/base/merge.d.ts

@@ -0,0 +1,18 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.js';
+
+/**
+ * Merge Sort
+ *
+ * Divides the array into halves, recursively sorts each half, then merges the
+ * sorted halves back together.
+ *
+ * Time complexity:  O(n log n) in all cases
+ * Space complexity: O(n)
+ *
+ * @param arr - The array to sort (a new sorted array is returned)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns A new sorted array
+ */
+declare function mergeSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { mergeSort };

package/dist/base/merge.mjs

@@ -0,0 +1 @@
+export{a as mergeSort}from'../chunk-3JE3MTR3.mjs';import'../chunk-J5DRKNXL.mjs';

package/dist/base/quick.cjs

@@ -0,0 +1 @@
+'use strict';function y(n,t){let i=d(n),f=d(t);if(i!==f)return i-f;if(typeof n=="number"&&typeof t=="number")return Number.isNaN(n)&&Number.isNaN(t)?0:Number.isNaN(n)?1:Number.isNaN(t)?-1:n-t;if(typeof n=="bigint"&&typeof t=="bigint")return n<t?-1:n>t?1:0;if(typeof n=="boolean"&&typeof t=="boolean")return Number(n)-Number(t);if(n instanceof Date&&t instanceof Date){let e=n.getTime(),r=t.getTime();return Number.isNaN(e)&&Number.isNaN(r)?0:Number.isNaN(e)?1:Number.isNaN(r)?-1:e-r}let o=N(n),u=N(t);return o<u?-1:o>u?1:0}function d(n){return n===void 0?0:n===null?1:typeof n=="boolean"?2:typeof n=="number"?3:typeof n=="bigint"?4:typeof n=="string"?5:n instanceof Date?6:Array.isArray(n)?7:typeof n=="object"?8:typeof n=="symbol"?9:10}function N(n){return n===void 0?"undefined":n===null?"null":typeof n=="symbol"?n.toString():typeof n=="function"?n.name||"anonymous":b(n)}function b(n){let t=new Set,i=new WeakMap,f=1;function o(e){let r=i.get(e);if(r!==void 0)return r;let s=f++;return i.set(e,s),s}function u(e){if(e===null)return "null";if(typeof e!="object")return String(e);let r=o(e);if(t.has(e))return `[Circular#${r}]`;t.add(e);let s;return Array.isArray(e)?s=`[${e.map(u).join(",")}]`:e instanceof Date?s=`Date:${e.toISOString()}`:s=`{${Object.entries(e).sort(([m],[c])=>m<c?-1:m>c?1:0).map(([m,c])=>`${m}:${u(c)}`).join(",")}}`,t.delete(e),s}return u(n)}function T(n,t=y){return p(n,0,n.length-1,t),n}function p(n,t,i,f){if(t<i){let o=k(n,t,i,f);p(n,t,o-1,f),p(n,o+1,i,f);}}function k(n,t,i,f){let o=Math.floor((t+i)/2);f(n[o],n[t])<0&&([n[t],n[o]]=[n[o],n[t]]),f(n[i],n[t])<0&&([n[t],n[i]]=[n[i],n[t]]),f(n[o],n[i])>0&&([n[o],n[i]]=[n[i],n[o]]),[n[o],n[i]]=[n[i],n[o]];let u=n[i],e=t-1;for(let r=t;r<i;r++)f(n[r],u)<=0&&(e++,[n[e],n[r]]=[n[r],n[e]]);return [n[e+1],n[i]]=[n[i],n[e+1]],e+1}exports.quickSort=T;

package/dist/base/quick.d.mts

@@ -0,0 +1,19 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.mjs';
+
+/**
+ * Quick Sort
+ *
+ * Selects a pivot element and partitions the array around it so that elements
+ * less than the pivot come before it and elements greater come after, then
+ * recursively sorts the sub-arrays.
+ *
+ * Time complexity:  O(n log n) average, O(n²) worst case
+ * Space complexity: O(log n) average (call stack)
+ *
+ * @param arr - The array to sort (mutated in place)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns The sorted array
+ */
+declare function quickSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { quickSort };

package/dist/base/quick.d.ts

@@ -0,0 +1,19 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.js';
+
+/**
+ * Quick Sort
+ *
+ * Selects a pivot element and partitions the array around it so that elements
+ * less than the pivot come before it and elements greater come after, then
+ * recursively sorts the sub-arrays.
+ *
+ * Time complexity:  O(n log n) average, O(n²) worst case
+ * Space complexity: O(log n) average (call stack)
+ *
+ * @param arr - The array to sort (mutated in place)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns The sorted array
+ */
+declare function quickSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { quickSort };

package/dist/base/quick.mjs

@@ -0,0 +1 @@
+export{a as quickSort}from'../chunk-F7APGQXB.mjs';import'../chunk-J5DRKNXL.mjs';

package/dist/base/selection.cjs

@@ -0,0 +1 @@
+'use strict';function d(n,e){let f=p(n),r=p(e);if(f!==r)return f-r;if(typeof n=="number"&&typeof e=="number")return Number.isNaN(n)&&Number.isNaN(e)?0:Number.isNaN(n)?1:Number.isNaN(e)?-1:n-e;if(typeof n=="bigint"&&typeof e=="bigint")return n<e?-1:n>e?1:0;if(typeof n=="boolean"&&typeof e=="boolean")return Number(n)-Number(e);if(n instanceof Date&&e instanceof Date){let t=n.getTime(),u=e.getTime();return Number.isNaN(t)&&Number.isNaN(u)?0:Number.isNaN(t)?1:Number.isNaN(u)?-1:t-u}let o=N(n),i=N(e);return o<i?-1:o>i?1:0}function p(n){return n===void 0?0:n===null?1:typeof n=="boolean"?2:typeof n=="number"?3:typeof n=="bigint"?4:typeof n=="string"?5:n instanceof Date?6:Array.isArray(n)?7:typeof n=="object"?8:typeof n=="symbol"?9:10}function N(n){return n===void 0?"undefined":n===null?"null":typeof n=="symbol"?n.toString():typeof n=="function"?n.name||"anonymous":y(n)}function y(n){let e=new Set,f=new WeakMap,r=1;function o(t){let u=f.get(t);if(u!==void 0)return u;let s=r++;return f.set(t,s),s}function i(t){if(t===null)return "null";if(typeof t!="object")return String(t);let u=o(t);if(e.has(t))return `[Circular#${u}]`;e.add(t);let s;return Array.isArray(t)?s=`[${t.map(i).join(",")}]`:t instanceof Date?s=`Date:${t.toISOString()}`:s=`{${Object.entries(t).sort(([m],[c])=>m<c?-1:m>c?1:0).map(([m,c])=>`${m}:${i(c)}`).join(",")}}`,e.delete(t),s}return i(n)}function b(n,e=d){let f=n.length;for(let r=0;r<f-1;r++){let o=r;for(let i=r+1;i<f;i++)e(n[i],n[o])<0&&(o=i);o!==r&&([n[r],n[o]]=[n[o],n[r]]);}return n}exports.selectionSort=b;

package/dist/base/selection.d.mts

@@ -0,0 +1,19 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.mjs';
+
+/**
+ * Selection Sort
+ *
+ * Divides the array into a sorted and an unsorted region, repeatedly selecting
+ * the minimum element from the unsorted region and moving it to the end of the
+ * sorted region.
+ *
+ * Time complexity:  O(n²) in all cases
+ * Space complexity: O(1)
+ *
+ * @param arr - The array to sort (mutated in place)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns The sorted array
+ */
+declare function selectionSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { selectionSort };

package/dist/base/selection.d.ts

@@ -0,0 +1,19 @@
+import { C as CompareFn, a as SortedArray } from '../function-type-BAHbNN5P.js';
+
+/**
+ * Selection Sort
+ *
+ * Divides the array into a sorted and an unsorted region, repeatedly selecting
+ * the minimum element from the unsorted region and moving it to the end of the
+ * sorted region.
+ *
+ * Time complexity:  O(n²) in all cases
+ * Space complexity: O(1)
+ *
+ * @param arr - The array to sort (mutated in place)
+ * @param compareFn - Optional comparator; defaults to ascending numeric/lexicographic order
+ * @returns The sorted array
+ */
+declare function selectionSort<T>(arr: T[], compareFn?: CompareFn<T>): SortedArray<T>;
+
+export { selectionSort };

package/dist/base/selection.mjs

@@ -0,0 +1 @@
+export{a as selectionSort}from'../chunk-KESA4OWP.mjs';import'../chunk-J5DRKNXL.mjs';

package/dist/chunk-3JE3MTR3.mjs

@@ -0,0 +1 @@
+import {a}from'./chunk-J5DRKNXL.mjs';function s(e,t=a){if(e.length<=1)return e.slice();let l=Math.floor(e.length/2),o=s(e.slice(0,l),t),r=s(e.slice(l),t);return u(o,r,t)}function u(e,t,l){let o=[],r=0,n=0;for(;r<e.length&&n<t.length;)l(e[r],t[n])<=0?o.push(e[r++]):o.push(t[n++]);for(;r<e.length;)o.push(e[r++]);for(;n<t.length;)o.push(t[n++]);return o}export{s as a};

package/dist/chunk-6OACJ5NV.mjs

@@ -0,0 +1 @@
+import {a}from'./chunk-J5DRKNXL.mjs';function p(e,l=a){let r=e.length;for(let t=0;t<r-1;t++){let f=false;for(let o=0;o<r-1-t;o++)l(e[o],e[o+1])>0&&([e[o],e[o+1]]=[e[o+1],e[o]],f=true);if(!f)break}return e}export{p as a};

package/dist/chunk-F7APGQXB.mjs

@@ -0,0 +1 @@
+import {a}from'./chunk-J5DRKNXL.mjs';function i(t,o=a){return T(t,0,t.length-1,o),t}function T(t,o,n,f){if(o<n){let e=S(t,o,n,f);T(t,o,e-1,f),T(t,e+1,n,f);}}function S(t,o,n,f){let e=Math.floor((o+n)/2);f(t[e],t[o])<0&&([t[o],t[e]]=[t[e],t[o]]),f(t[n],t[o])<0&&([t[o],t[n]]=[t[n],t[o]]),f(t[e],t[n])>0&&([t[e],t[n]]=[t[n],t[e]]),[t[e],t[n]]=[t[n],t[e]];let d=t[n],u=o-1;for(let m=o;m<n;m++)f(t[m],d)<=0&&(u++,[t[u],t[m]]=[t[m],t[u]]);return [t[u+1],t[n]]=[t[n],t[u+1]],u+1}export{i as a};

package/dist/chunk-FZMEZVLG.mjs

@@ -0,0 +1 @@
+import {a}from'./chunk-J5DRKNXL.mjs';function h(e,i=a){let f=e.length;for(let t=Math.floor(f/2)-1;t>=0;t--)l(e,f,t,i);for(let t=f-1;t>0;t--)[e[0],e[t]]=[e[t],e[0]],l(e,t,0,i);return e}function l(e,i,f,t){let o=f,n=2*f+1,p=2*f+2;n<i&&t(e[n],e[o])>0&&(o=n),p<i&&t(e[p],e[o])>0&&(o=p),o!==f&&([e[f],e[o]]=[e[o],e[f]],l(e,i,o,t));}export{h as a};

package/dist/chunk-J5DRKNXL.mjs

@@ -0,0 +1 @@
+function b(n,r){let f=N(n),u=N(r);if(f!==u)return f-u;if(typeof n=="number"&&typeof r=="number")return Number.isNaN(n)&&Number.isNaN(r)?0:Number.isNaN(n)?1:Number.isNaN(r)?-1:n-r;if(typeof n=="bigint"&&typeof r=="bigint")return n<r?-1:n>r?1:0;if(typeof n=="boolean"&&typeof r=="boolean")return Number(n)-Number(r);if(n instanceof Date&&r instanceof Date){let e=n.getTime(),t=r.getTime();return Number.isNaN(e)&&Number.isNaN(t)?0:Number.isNaN(e)?1:Number.isNaN(t)?-1:e-t}let s=y(n),o=y(r);return s<o?-1:s>o?1:0}function N(n){return n===void 0?0:n===null?1:typeof n=="boolean"?2:typeof n=="number"?3:typeof n=="bigint"?4:typeof n=="string"?5:n instanceof Date?6:Array.isArray(n)?7:typeof n=="object"?8:typeof n=="symbol"?9:10}function y(n){return n===void 0?"undefined":n===null?"null":typeof n=="symbol"?n.toString():typeof n=="function"?n.name||"anonymous":p(n)}function p(n){let r=new Set,f=new WeakMap,u=1;function s(e){let t=f.get(e);if(t!==void 0)return t;let i=u++;return f.set(e,i),i}function o(e){if(e===null)return "null";if(typeof e!="object")return String(e);let t=s(e);if(r.has(e))return `[Circular#${t}]`;r.add(e);let i;return Array.isArray(e)?i=`[${e.map(o).join(",")}]`:e instanceof Date?i=`Date:${e.toISOString()}`:i=`{${Object.entries(e).sort(([c],[m])=>c<m?-1:c>m?1:0).map(([c,m])=>`${c}:${o(m)}`).join(",")}}`,r.delete(e),i}return o(n)}export{b as a};

package/dist/chunk-KESA4OWP.mjs

@@ -0,0 +1 @@
+import {a}from'./chunk-J5DRKNXL.mjs';function m(o,i=a){let f=o.length;for(let t=0;t<f-1;t++){let e=t;for(let n=t+1;n<f;n++)i(o[n],o[e])<0&&(e=n);e!==t&&([o[t],o[e]]=[o[e],o[t]]);}return o}export{m as a};

package/dist/chunk-YWVRJOGW.mjs

@@ -0,0 +1 @@
+import {a}from'./chunk-J5DRKNXL.mjs';function m(o,i=a){for(let e=1;e<o.length;e++){let r=o[e],t=e-1;for(;t>=0&&i(o[t],r)>0;)o[t+1]=o[t],t--;o[t+1]=r;}return o}export{m as a};

package/dist/function-type-BAHbNN5P.d.mts

@@ -0,0 +1,5 @@
+type CompareFn<T> = (a: T, b: T) => number;
+type SortedArray<T> = T[];
+type SelectorFn<T, K> = (item: T) => K;
+
+export type { CompareFn as C, SelectorFn as S, SortedArray as a };

package/dist/function-type-BAHbNN5P.d.ts

@@ -0,0 +1,5 @@
+type CompareFn<T> = (a: T, b: T) => number;
+type SortedArray<T> = T[];
+type SelectorFn<T, K> = (item: T) => K;
+
+export type { CompareFn as C, SelectorFn as S, SortedArray as a };

package/dist/index.cjs

@@ -0,0 +1 @@
+'use strict';function u(t,e){let n=y(t),o=y(e);if(n!==o)return n-o;if(typeof t=="number"&&typeof e=="number")return Number.isNaN(t)&&Number.isNaN(e)?0:Number.isNaN(t)?1:Number.isNaN(e)?-1:t-e;if(typeof t=="bigint"&&typeof e=="bigint")return t<e?-1:t>e?1:0;if(typeof t=="boolean"&&typeof e=="boolean")return Number(t)-Number(e);if(t instanceof Date&&e instanceof Date){let f=t.getTime(),m=e.getTime();return Number.isNaN(f)&&Number.isNaN(m)?0:Number.isNaN(f)?1:Number.isNaN(m)?-1:f-m}let r=S(t),i=S(e);return r<i?-1:r>i?1:0}function y(t){return t===void 0?0:t===null?1:typeof t=="boolean"?2:typeof t=="number"?3:typeof t=="bigint"?4:typeof t=="string"?5:t instanceof Date?6:Array.isArray(t)?7:typeof t=="object"?8:typeof t=="symbol"?9:10}function S(t){return t===void 0?"undefined":t===null?"null":typeof t=="symbol"?t.toString():typeof t=="function"?t.name||"anonymous":b(t)}function b(t){let e=new Set,n=new WeakMap,o=1;function r(f){let m=n.get(f);if(m!==void 0)return m;let p=o++;return n.set(f,p),p}function i(f){if(f===null)return "null";if(typeof f!="object")return String(f);let m=r(f);if(e.has(f))return `[Circular#${m}]`;e.add(f);let p;return Array.isArray(f)?p=`[${f.map(i).join(",")}]`:f instanceof Date?p=`Date:${f.toISOString()}`:p=`{${Object.entries(f).sort(([s],[c])=>s<c?-1:s>c?1:0).map(([s,c])=>`${s}:${i(c)}`).join(",")}}`,e.delete(f),p}return i(t)}function C(t,e=u){let n=t.length;for(let o=0;o<n-1;o++){let r=false;for(let i=0;i<n-1-o;i++)e(t[i],t[i+1])>0&&([t[i],t[i+1]]=[t[i+1],t[i]],r=true);if(!r)break}return t}function x(t,e=u){let n=t.length;for(let o=Math.floor(n/2)-1;o>=0;o--)l(t,n,o,e);for(let o=n-1;o>0;o--)[t[0],t[o]]=[t[o],t[0]],l(t,o,0,e);return t}function l(t,e,n,o){let r=n,i=2*n+1,f=2*n+2;i<e&&o(t[i],t[r])>0&&(r=i),f<e&&o(t[f],t[r])>0&&(r=f),r!==n&&([t[n],t[r]]=[t[r],t[n]],l(t,e,r,o));}function N(t,e=u){for(let n=1;n<t.length;n++){let o=t[n],r=n-1;for(;r>=0&&e(t[r],o)>0;)t[r+1]=t[r],r--;t[r+1]=o;}return t}function T(t,e=u){if(t.length<=1)return t.slice();let n=Math.floor(t.length/2),o=T(t.slice(0,n),e),r=T(t.slice(n),e);return A(o,r,e)}function A(t,e,n){let o=[],r=0,i=0;for(;r<t.length&&i<e.length;)n(t[r],e[i])<=0?o.push(t[r++]):o.push(e[i++]);for(;r<t.length;)o.push(t[r++]);for(;i<e.length;)o.push(e[i++]);return o}function g(t,e=u){return d(t,0,t.length-1,e),t}function d(t,e,n,o){if(e<n){let r=k(t,e,n,o);d(t,e,r-1,o),d(t,r+1,n,o);}}function k(t,e,n,o){let r=Math.floor((e+n)/2);o(t[r],t[e])<0&&([t[e],t[r]]=[t[r],t[e]]),o(t[n],t[e])<0&&([t[e],t[n]]=[t[n],t[e]]),o(t[r],t[n])>0&&([t[r],t[n]]=[t[n],t[r]]),[t[r],t[n]]=[t[n],t[r]];let i=t[n],f=e-1;for(let m=e;m<n;m++)o(t[m],i)<=0&&(f++,[t[f],t[m]]=[t[m],t[f]]);return [t[f+1],t[n]]=[t[n],t[f+1]],f+1}function F(t,e=u){let n=t.length;for(let o=0;o<n-1;o++){let r=o;for(let i=o+1;i<n;i++)e(t[i],t[r])<0&&(r=i);r!==o&&([t[o],t[r]]=[t[r],t[o]]);}return t}function j(t,e){let n=e!=null?e:u;return function(o,r){return n(t(o),t(r))}}exports.bubbleSort=C;exports.compareBy=j;exports.defaultCompareFn=u;exports.heapSort=x;exports.insertionSort=N;exports.mergeSort=T;exports.quickSort=g;exports.selectionSort=F;

package/dist/index.d.mts

@@ -0,0 +1,14 @@
+export { bubbleSort } from './base/bubble.mjs';
+export { heapSort } from './base/heap.mjs';
+export { insertionSort } from './base/insertion.mjs';
+export { mergeSort } from './base/merge.mjs';
+export { quickSort } from './base/quick.mjs';
+export { selectionSort } from './base/selection.mjs';
+import { S as SelectorFn, C as CompareFn } from './function-type-BAHbNN5P.mjs';
+export { a as SortedArray } from './function-type-BAHbNN5P.mjs';
+
+declare function compareBy<T, K>(selector: SelectorFn<T, K>, compareFn?: CompareFn<K>): CompareFn<T>;
+
+declare function defaultCompareFn<T>(a: T, b: T): number;
+
+export { CompareFn, SelectorFn, compareBy, defaultCompareFn };

package/dist/index.d.ts

@@ -0,0 +1,14 @@
+export { bubbleSort } from './base/bubble.js';
+export { heapSort } from './base/heap.js';
+export { insertionSort } from './base/insertion.js';
+export { mergeSort } from './base/merge.js';
+export { quickSort } from './base/quick.js';
+export { selectionSort } from './base/selection.js';
+import { S as SelectorFn, C as CompareFn } from './function-type-BAHbNN5P.js';
+export { a as SortedArray } from './function-type-BAHbNN5P.js';
+
+declare function compareBy<T, K>(selector: SelectorFn<T, K>, compareFn?: CompareFn<K>): CompareFn<T>;
+
+declare function defaultCompareFn<T>(a: T, b: T): number;
+
+export { CompareFn, SelectorFn, compareBy, defaultCompareFn };

package/dist/index.mjs

@@ -0,0 +1 @@
+export{a as bubbleSort}from'./chunk-6OACJ5NV.mjs';export{a as heapSort}from'./chunk-FZMEZVLG.mjs';export{a as insertionSort}from'./chunk-YWVRJOGW.mjs';export{a as mergeSort}from'./chunk-3JE3MTR3.mjs';export{a as quickSort}from'./chunk-F7APGQXB.mjs';export{a as selectionSort}from'./chunk-KESA4OWP.mjs';import {a}from'./chunk-J5DRKNXL.mjs';export{a as defaultCompareFn}from'./chunk-J5DRKNXL.mjs';function f(t,r){let e=r!=null?r:a;return function(m,p){return e(t(m),t(p))}}export{f as compareBy};

package/dist/meme/index.cjs

@@ -0,0 +1 @@
+'use strict';

package/dist/meme/index.d.mts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/meme/index.d.ts

@@ -0,0 +1,2 @@
+
+export {  }

package/package.json

@@ -0,0 +1,114 @@
+{
+  "name": "exsorted",
+  "version": "1.0.0",
+  "description": "A TypeScript sorting algorithms library",
+  "main": "dist/index.cjs",
+  "module": "dist/index.mjs",
+  "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.mjs",
+      "require": "./dist/index.cjs"
+    },
+    "./base": {
+      "types": "./dist/base/index.d.ts",
+      "import": "./dist/base/index.mjs",
+      "require": "./dist/base/index.cjs"
+    },
+    "./bubble": {
+      "types": "./dist/base/bubble.d.ts",
+      "import": "./dist/base/bubble.mjs",
+      "require": "./dist/base/bubble.cjs"
+    },
+    "./insertion": {
+      "types": "./dist/base/insertion.d.ts",
+      "import": "./dist/base/insertion.mjs",
+      "require": "./dist/base/insertion.cjs"
+    },
+    "./selection": {
+      "types": "./dist/base/selection.d.ts",
+      "import": "./dist/base/selection.mjs",
+      "require": "./dist/base/selection.cjs"
+    },
+    "./merge": {
+      "types": "./dist/base/merge.d.ts",
+      "import": "./dist/base/merge.mjs",
+      "require": "./dist/base/merge.cjs"
+    },
+    "./quick": {
+      "types": "./dist/base/quick.d.ts",
+      "import": "./dist/base/quick.mjs",
+      "require": "./dist/base/quick.cjs"
+    },
+    "./heap": {
+      "types": "./dist/base/heap.d.ts",
+      "import": "./dist/base/heap.mjs",
+      "require": "./dist/base/heap.cjs"
+    },
+    "./meme": {
+      "types": "./dist/meme/index.d.ts",
+      "import": "./dist/meme/index.mjs",
+      "require": "./dist/meme/index.cjs"
+    }
+  },
+  "sideEffects": false,
+  "files": [
+    "dist"
+  ],
+  "scripts": {
+    "build": "tsup --config tsup.config.ts",
+    "minify": "tsup --config tsup.config.ts --minify",
+    "test": "jest",
+    "lint": "oxlint . --deny-warnings",
+    "lint:fix": "oxlint . --fix",
+    "typecheck": "tsc --noEmit",
+    "format": "prettier . --write",
+    "format:check": "prettier . --check",
+    "prepare": "husky",
+    "prepublishOnly": "pnpm run minify"
+  },
+  "lint-staged": {
+    "*.{ts,tsx,js,mjs,cjs,json,md,yml,yaml}": [
+      "prettier --write"
+    ],
+    "*.{ts,tsx,js,mjs,cjs}": [
+      "oxlint --fix"
+    ]
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/Ink01101011/exsorted.git"
+  },
+  "keywords": [
+    "sort",
+    "sorting",
+    "algorithms",
+    "typescript",
+    "bubble-sort",
+    "merge-sort",
+    "quick-sort",
+    "heap-sort",
+    "insertion-sort",
+    "selection-sort"
+  ],
+  "author": "Ink01101011",
+  "license": "MIT",
+  "type": "commonjs",
+  "bugs": {
+    "url": "https://github.com/Ink01101011/exsorted/issues"
+  },
+  "homepage": "https://github.com/Ink01101011/exsorted#readme",
+  "devDependencies": {
+    "@types/jest": "^29.5.14",
+    "@types/node": "^25.5.0",
+    "husky": "^9.1.7",
+    "jest": "^29.7.0",
+    "lint-staged": "^16.4.0",
+    "oxlint": "^1.58.0",
+    "prettier": "^3.8.1",
+    "ts-jest": "^29.4.8",
+    "tsup": "^8.5.1",
+    "typescript": "^6.0.2"
+  }
+}