@vinicunca/perkakas 1.7.1 → 1.9.0

package/dist/chunk-WAYI2SEB.js

@@ -1 +0,0 @@
-import{a as e}from"./chunk-J6WPJH72.js";function a(...n){return e(t,n)}function t(n,r){return r>0?n.slice(0,Math.max(0,n.length-r)):[...n]}export{a};

package/dist/chunk-WFR3HBYR.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function a(e,n){if(n===void 0){let t=new Set(e);return r=>t.has(r)}return n.includes(e)}exports.a = a;

package/dist/chunk-WKNGQQYL.js

@@ -1 +0,0 @@
-import{a as e}from"./chunk-J6WPJH72.js";function i(...n){return e(t,n)}function t(n,o){return n.join(o)}export{i as a};

package/dist/chunk-WLNQOMKL.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function r(n){return()=>n}exports.a = r;

package/dist/chunk-WM4KSO6C.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function e(i){return i instanceof Promise}exports.a = e;

package/dist/chunk-WVTQN2AI.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk7GAGU65Ucjs = require('./chunk-7GAGU65U.cjs');function i(e,a){return _chunk7GAGU65Ucjs.a.call(void 0, e,{delimiter:"_",...a})}exports.a = i;

package/dist/chunk-WYRK6YJU.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function t(){return n}function n(...o){}exports.a = t;

package/dist/chunk-X7EK7EDZ.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk7GAGU65Ucjs = require('./chunk-7GAGU65U.cjs');function r(e,i){return _chunk7GAGU65Ucjs.a.call(void 0, e,{delimiter:"-",...i})}exports.a = r;

package/dist/chunk-X7PFDZGQ.js

@@ -1 +0,0 @@
-import{a as r}from"./chunk-LSODZ3GY.js";import{a as n}from"./chunk-EPU4K3DD.js";function i(...e){return r(a,e)}function a(){let e=new Set;return t=>e.has(t)?n:(e.add(t),{done:!1,hasNext:!0,next:t})}export{i as a};

package/dist/chunk-XCG2UC6T.js

@@ -1 +0,0 @@
-import{a as u}from"./chunk-J6WPJH72.js";function s(...n){return u(d,n)}function d(n,t){let r=n.entries(),e=r.next();if("done"in e&&e.done)return 0;let{value:[,i]}=e,a=t(i,0,n);for(let[o,m]of r){let b=t(m,o,n);a+=b}return a}export{s as a};

package/dist/chunk-XJFQUA2U.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function l(...n){return _chunkXR72I63Wcjs.a.call(void 0, d,n)}function d(n,o){let e={};for(let[a,t]of n.entries()){let[y,u]=o(t,a,n);e[y]=u}return e}exports.a = l;

package/dist/chunk-XKFU3EHP.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function y(...n){return _chunkXR72I63Wcjs.a.call(void 0, e,n)}function e(n,o){return o.some(r=>r(n))}exports.a = y;

package/dist/chunk-XR2MB57Z.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function u(...e){return _chunkXR72I63Wcjs.a.call(void 0, o,e)}function o(e,a){let n=[];for(let[i,r]of e.entries()){if(!a(r,i,e))break;n.push(r)}return n}exports.a = u;

package/dist/chunk-XR72I63W.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkGZJMERDJcjs = require('./chunk-GZJMERDJ.cjs');function u(r,n,o){let a=r.length-n.length;if(a===0)return r(...n);if(a===1)return _chunkGZJMERDJcjs.a.call(void 0, r,n,o);throw new Error("Wrong number of arguments")}exports.a = u;

package/dist/chunk-XROZFTOX.js

@@ -1 +0,0 @@
-import{a as t}from"./chunk-J6WPJH72.js";function i(...e){return t(o,e)}function o(e,r){let a={};for(let[n,u]of Object.entries(e)){let l=r(u,n,e);a[n]=l}return a}export{i as a};

package/dist/chunk-XSIE5W4C.js

@@ -1 +0,0 @@
-import{a as o}from"./chunk-PEJ74NWA.js";import{a as r}from"./chunk-J6WPJH72.js";function i(...n){return r(o(Math.floor),n)}export{i as a};

package/dist/chunk-XSSRBOMF.js

@@ -1 +0,0 @@
-function r(e){return e.normalize("NFD").replace(/[\u0300-\u036F]/g,"").toLowerCase().replace(/[^a-z0-9]/g," ").trim().replace(/\s+/g,"-")}export{r as a};

package/dist/chunk-XWQ3IM2J.js

@@ -1 +0,0 @@
-import{a as u}from"./chunk-J6WPJH72.js";function a(...r){return u(o,r)}function o(r,t){let e=[];for(let n=r;n<t;n++)e.push(n);return e}export{a};

package/dist/chunk-XY7YER5N.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function a(...n){return _chunkXR72I63Wcjs.a.call(void 0, o,n)}function o(n){let e=typeof n[0]=="bigint"?1n:1;for(let r of n)e*=r;return e}exports.a = a;

package/dist/chunk-Y5LDV42I.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function o(...e){return _chunkXR72I63Wcjs.a.call(void 0, t,e)}function t(e,n){return n>0?e.slice(Math.max(0,e.length-n)):[]}exports.a = o;

package/dist/chunk-Y7RFTHSR.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function e(i,n=1e3){if(i<n)return`${i} B`;let t=n===1024?["Ki","Mi","Gi"]:["k","M","G"],r=-1;for(;Math.abs(i)>=n&&r<t.length-1;)i/=n,++r;return`${i.toFixed(1)} ${t[r]}B`}exports.a = e;

package/dist/chunk-YBJMFRB6.js

@@ -1 +0,0 @@
-function r(o){return typeof o=="symbol"}export{r as a};

package/dist/chunk-YCSQX2SY.js

@@ -1 +0,0 @@
-import{a as n,c as a}from"./chunk-EPU4K3DD.js";import{a as t}from"./chunk-J6WPJH72.js";function s(...e){return t(p,e,o)}function p(e,r){return r<0?[...e]:e.slice(r)}function o(e){if(e<=0)return a;let r=e;return i=>r>0?(r-=1,n):{done:!1,hasNext:!0,next:i}}export{s as a};

package/dist/chunk-YHDBKFF6.js

@@ -1 +0,0 @@
-import{a as e}from"./chunk-J6WPJH72.js";function i(...n){return e(o,n)}function o(n,t){return{[t]:n}}export{i as a};

package/dist/chunk-YJDSLML5.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function a(...e){return _chunkXR72I63Wcjs.a.call(void 0, r,e)}function r(e,t){return[...e,...t]}exports.a = a;

package/dist/chunk-YJEN2CYE.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function p(...e){return _chunkXR72I63Wcjs.a.call(void 0, y,e)}function y(e){let r={};for(let[n,o]of Object.entries(e))r[o]=n;return r}exports.a = p;

package/dist/chunk-YJWH5VIJ.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkBO34ARLYcjs = require('./chunk-BO34ARLY.cjs');function y(t,i){let a=i.length-t.length;if(a===1){let[n,...r]=i;return _chunkBO34ARLYcjs.a.call(void 0, n,{lazy:t,lazyArgs:r})}if(a===0){let n={lazy:t,lazyArgs:i};return Object.assign(e=>_chunkBO34ARLYcjs.a.call(void 0, e,n),n)}throw new Error("Wrong number of arguments")}exports.a = y;

package/dist/chunk-YN6OVP7D.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkYJWH5VIJcjs = require('./chunk-YJWH5VIJ.cjs');var _chunkN5JE6642cjs = require('./chunk-N5JE6642.cjs');function p(...e){return _chunkYJWH5VIJcjs.a.call(void 0, d,e)}function d(e){let n=new Set;return(t,u,i)=>{let r=e(t,u,i);return n.has(r)?_chunkN5JE6642cjs.a:(n.add(r),{done:!1,hasNext:!0,next:t})}}exports.a = p;

package/dist/chunk-YQNLUCDL.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkM22GUUVYcjs = require('./chunk-M22GUUVY.cjs');var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function u(...e){return _chunkXR72I63Wcjs.a.call(void 0, _chunkM22GUUVYcjs.a.call(void 0, Math.ceil),e)}exports.a = u;

package/dist/chunk-YRVN4PYH.js

@@ -1 +0,0 @@
-import{a as y,b as a}from"./chunk-JI5FJX2E.js";import{b as o}from"./chunk-7KBK2RWQ.js";function s(...r){return o(m,r)}function m(r,t,e){if(e<=0)return[];if(e>=r.length)return[...r];let n=r.slice(0,e);y(n,t);let i=r.slice(e);for(let u of i)a(n,t,u);return n}export{s as a};

package/dist/chunk-YSTUBBOJ.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function n(e){return e!==void 0}exports.a = n;

package/dist/chunk-YWIXN5BR.js

@@ -1 +0,0 @@
-var R=Symbol("funnel/voidReducer"),T=()=>R;function A(l,{triggerAt:f="end",minQuietPeriodMs:u,maxBurstDurationMs:r,minGapMs:o,reducer:p=T}){let e,n,d,i;function a(){let t=d;t!==void 0&&(d=void 0,t===R?l():l(t),o!==void 0&&(n=setTimeout(m,o)))}function m(){clearTimeout(n),n=void 0,e===void 0&&a()}function y(){clearTimeout(e),e=void 0,i=void 0,n===void 0&&a()}return{call:(...t)=>{let s=e===void 0&&n===void 0;if((f!=="start"||s)&&(d=p(d,...t)),!(e===void 0&&!s)){if(u!==void 0||r!==void 0||o===void 0){clearTimeout(e);let c=Date.now();i??=c;let g=r===void 0?u??0:Math.min(u??r,r-(c-i));e=setTimeout(y,g)}f!=="end"&&s&&a()}},cancel:()=>{clearTimeout(e),e=void 0,i=void 0,clearTimeout(n),n=void 0,d=void 0},flush:()=>{y(),m()},get isIdle(){return e===void 0&&n===void 0}}}export{A as a};

package/dist/chunk-YWTY4X2R.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function e(r){return typeof r=="number"&&!Number.isNaN(r)}exports.a = e;

package/dist/chunk-YXKPCISK.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function n(r){return Array.isArray(r)}exports.a = n;

package/dist/chunk-YXVTDTHY.js

@@ -1 +0,0 @@
-import{a as r}from"./chunk-J6WPJH72.js";function i(...e){return r(o,e)}function o(e,t){for(let n=e.length-1;n>=0;n--)if(!t(e[n],n,e))return e.slice(0,n+1);return[]}export{i as a};

package/dist/chunk-YYEJOSR3.js

@@ -1 +0,0 @@
-function o(n,r,e){[n[r],n[e]]=[n[e],n[r]]}export{o as a};

package/dist/chunk-Z33G2D3N.js

@@ -1 +0,0 @@
-import{a}from"./chunk-J6WPJH72.js";function y(...n){return a(e,n)}function e(n,o){return o.some(r=>r(n))}export{y as a};

package/dist/chunk-Z3F6RC7S.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function o(...t){return _chunkXR72I63Wcjs.a.call(void 0, r,t)}function r(t,e){return t===e||Object.is(t,e)}exports.a = o;

package/dist/chunk-Z5EOW435.js

@@ -1 +0,0 @@
-import{a as n}from"./chunk-J6WPJH72.js";function i(...e){return n(a,e)}function a(e,r){for(let[t,o]of Object.entries(e))r(o,t,e);return e}export{i as a};

package/dist/chunk-Z5YZYBC2.js

@@ -1 +0,0 @@
-import{a as t}from"./chunk-NHTBBY2L.js";import{a as e}from"./chunk-J6WPJH72.js";function s(...n){return e(r,n,t(a))}function r([n]){return n}function a(){return o}function o(n){return{hasNext:!0,next:n,done:!0}}export{s as a};

package/dist/chunk-Z5Z4ADBO.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkN5JE6642cjs = require('./chunk-N5JE6642.cjs');var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function l(...r){return _chunkXR72I63Wcjs.a.call(void 0, o,r,u)}function o(r,e){return e<0?[]:r.slice(0,e)}function u(r){if(r<=0)return _chunkN5JE6642cjs.b;let e=r;return a=>(e-=1,{done:e<=0,hasNext:!0,next:a})}exports.a = l;

package/dist/chunk-Z6K5VISM.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function d(...e){return _chunkXR72I63Wcjs.a.call(void 0, p,e)}function p(e,n,o){let{[n]:K,[o]:s}=e;return{...e,[n]:s,[o]:K}}exports.a = d;

package/dist/chunk-Z6OOXW67.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function o(n,r,e){[n[r],n[e]]=[n[e],n[r]]}exports.a = o;

package/dist/chunk-Z7DYKN6W.js

@@ -1 +0,0 @@
-import{a as l}from"./chunk-KGPDVVVV.js";function T(e,n,r){return typeof e=="function"?(t,a)=>o(t,a,e):typeof n=="function"?l(o,[e,n],u):o(e,n,r)}function o(e,n,r){let t=[e,n];return e.length<n.length?e.map((a,i)=>r(a,n[i],i,t)):n.map((a,i)=>r(e[i],a,i,t))}function u(e,n){return(r,t,a)=>({next:n(r,e[t],t,[a,e]),hasNext:!0,done:t>=e.length-1})}export{T as a};

package/dist/chunk-ZAZDS3SB.js

@@ -1 +0,0 @@
-import{a as t,b as s,c as i}from"./chunk-MZEHWQF3.js";function c(n,r){let[o,f,m]=t(n,r),p=r?.mergeAmbiguousCharacters?s():i();return o+f.map((e,a)=>a===0?e.toLowerCase():p(e,a)).join(r?.delimiter??"")+m}export{c as a};

package/dist/chunk-ZCCHYKDG.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function t(n){return typeof n=="function"}exports.a = t;

package/dist/chunk-ZH3SGWIA.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function t(...a){return _chunkXR72I63Wcjs.a.call(void 0, e,a)}function e(a,o){return o.every(r=>r(a))}exports.a = t;

package/dist/chunk-ZIGQWNCG.js

@@ -1 +0,0 @@
-import{a,b as s,c as e}from"./chunk-MZEHWQF3.js";function c(t,r){let[i,n,o]=a(t,r),f=r?.mergeAmbiguousCharacters?s():e();return i+n.map(f).join(r?.delimiter??"")+o}export{c as a};

package/dist/chunk-ZIGQZNHP.js

@@ -1 +0,0 @@
-import{a as o}from"./chunk-LSODZ3GY.js";import{a as n}from"./chunk-EPU4K3DD.js";function T(...r){return o(i,r)}function i(r,t){return e=>r.every(a=>!t(e,a))?{done:!1,hasNext:!0,next:e}:n}export{T as a};

package/dist/chunk-ZITGCTSW.js

@@ -1 +0,0 @@
-import{a as r}from"./chunk-EPU4K3DD.js";import{a as t}from"./chunk-J6WPJH72.js";function m(...e){return t(o,e,i)}function o(e,n){return e.filter(n)}function i(e){return(n,a,d)=>e(n,a,d)?{done:!1,hasNext:!0,next:n}:r}export{m as a};

package/dist/chunk-ZLNSRDW7.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkEROXO3T4cjs = require('./chunk-EROXO3T4.cjs');function u(...r){return _chunkEROXO3T4cjs.b.call(void 0, y,r)}function y(r,t,o){let n=0;for(let a of r)t(o,a)>0&&(n+=1);return n}exports.a = u;

package/dist/chunk-ZMG3NQDL.js

@@ -1 +0,0 @@
-var d=/^(?:0|[1-9]\d*)$/u;function s(i){let t=[],a=/\.{0,4096}(?<propName>[^.[\]]+)|\['(?<quoted>.{0,4096}?)'\]|\["(?<doubleQuoted>.{0,4096}?)"\]|\[(?<unquoted>.{0,4096}?)\]/uy,n;for(;(n=a.exec(i))!==null;){let{propName:e,quoted:o,doubleQuoted:u,unquoted:r}=n.groups;if(r!==void 0){t.push(...s(r));continue}t.push(e===void 0?o??u:d.test(e)?Number(e):e)}return t}export{s as a};

package/dist/chunk-ZSKQIU2G.js

@@ -1 +0,0 @@
-import{a as o}from"./chunk-J6WPJH72.js";function i(...r){return o(l,r)}function l(r){let n=[...r];for(let e=0;e<r.length;e++){let t=e+Math.floor(Math.random()*(r.length-e)),a=n[t];n[t]=n[e],n[e]=a}return n}export{i as a};

package/dist/chunk-ZX5QTVEJ.js

@@ -1 +0,0 @@
-import{a}from"./chunk-J6WPJH72.js";function u(...e){return a(o,e,i)}function o(e,r){return e.forEach(r),e}function i(e){return(r,n,t)=>(e(r,n,t),{done:!1,hasNext:!0,next:r})}export{u as a};

package/dist/clamped-integer-subtract-DZ7rsJE4.d.cts

@@ -1,15 +0,0 @@
-/**
- * We built our own version of Subtract instead of using type-fest's one
- * because we needed a simpler implementation that isn't as prone to excessive
- * recursion issues and that is clamped at 0 so that we don't need to handle
- * negative values using even more utilities.
- */
-type ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag extends Array<unknown> = [], ResultBag extends Array<unknown> = []> = [...SubtrahendBag, ...ResultBag]['length'] extends Minuend ? ResultBag['length'] : SubtrahendBag['length'] extends Subtrahend ? ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag, [
-    ...ResultBag,
-    unknown
-]> : ClampedIntegerSubtract<Minuend, Subtrahend, [
-    ...SubtrahendBag,
-    unknown
-], ResultBag>;
-
-export type { ClampedIntegerSubtract as C };

package/dist/clamped-integer-subtract-DZ7rsJE4.d.ts

@@ -1,15 +0,0 @@
-/**
- * We built our own version of Subtract instead of using type-fest's one
- * because we needed a simpler implementation that isn't as prone to excessive
- * recursion issues and that is clamped at 0 so that we don't need to handle
- * negative values using even more utilities.
- */
-type ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag extends Array<unknown> = [], ResultBag extends Array<unknown> = []> = [...SubtrahendBag, ...ResultBag]['length'] extends Minuend ? ResultBag['length'] : SubtrahendBag['length'] extends Subtrahend ? ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag, [
-    ...ResultBag,
-    unknown
-]> : ClampedIntegerSubtract<Minuend, Subtrahend, [
-    ...SubtrahendBag,
-    unknown
-], ResultBag>;
-
-export type { ClampedIntegerSubtract as C };

package/dist/coerced-array-DRz3tqda.d.cts

@@ -1,14 +0,0 @@
-import { IfNever } from 'type-fest';
-
-/**
- * `never[]` and `[]` are not the same type, and in some cases they aren't
- * interchangeable.
- *
- * This type makes it easier to use the result of TupleParts when the input is a
- * fixed-length tuple but we still want to spread the rest of the array. e.g.
- * `[...CoercedArray<TupleParts<T>["item"]>, ...TupleParts<T>["suffix"]]`.
- *
- */
-type CoercedArray<T> = IfNever<T, [], Array<T>>;
-
-export type { CoercedArray as C };

package/dist/coerced-array-DRz3tqda.d.ts

@@ -1,14 +0,0 @@
-import { IfNever } from 'type-fest';
-
-/**
- * `never[]` and `[]` are not the same type, and in some cases they aren't
- * interchangeable.
- *
- * This type makes it easier to use the result of TupleParts when the input is a
- * fixed-length tuple but we still want to spread the rest of the array. e.g.
- * `[...CoercedArray<TupleParts<T>["item"]>, ...TupleParts<T>["suffix"]]`.
- *
- */
-type CoercedArray<T> = IfNever<T, [], Array<T>>;
-
-export type { CoercedArray as C };

package/dist/curry-order-rules-BKXCPBNx.d.cts

@@ -1,37 +0,0 @@
-declare const COMPARATORS: {
-    readonly asc: <T>(x: T, y: T) => boolean;
-    readonly desc: <T>(x: T, y: T) => boolean;
-};
-/**
- * An order rule defines a projection/extractor that returns a comparable from
- * the data being compared. It would be run on each item being compared, and a
- * comparator would then be used on the results to determine the order.
- *
- * There are 2 forms of the order rule, a simple one which only provides the
- * projection function and assumes ordering is ascending, and a 2-tuple where
- * the first element is the projection function and the second is the direction;
- * this allows changing the direction without defining a more complex projection
- * to simply negate the value (e.g. `(x) => -x`).
- *
- * We rely on the javascript implementation of `<` and `>` for comparison, which
- * will attempt to transform both operands into a primitive comparable value via
- * the built in `valueOf` function (and then `toString`). It's up to the caller
- * to make sure that the projection is returning a value that makes sense for
- * this logic.
- *
- * It's important to note that there is no built-in caching/memoization of
- * projection function and therefore no guarantee that it would only be called
- * once.
- */
-type OrderRule<T> = Projection<T> | readonly [projection: Projection<T>, direction: keyof typeof COMPARATORS];
-type Projection<T> = (x: T) => Comparable;
-type Comparable = ComparablePrimitive | {
-    [Symbol.toPrimitive]: (hint: string) => ComparablePrimitive;
-} | {
-    toString: () => string;
-} | {
-    valueOf: () => ComparablePrimitive;
-};
-type ComparablePrimitive = bigint | boolean | number | string;
-
-export type { OrderRule as O };

package/dist/curry-order-rules-BKXCPBNx.d.ts

@@ -1,37 +0,0 @@
-declare const COMPARATORS: {
-    readonly asc: <T>(x: T, y: T) => boolean;
-    readonly desc: <T>(x: T, y: T) => boolean;
-};
-/**
- * An order rule defines a projection/extractor that returns a comparable from
- * the data being compared. It would be run on each item being compared, and a
- * comparator would then be used on the results to determine the order.
- *
- * There are 2 forms of the order rule, a simple one which only provides the
- * projection function and assumes ordering is ascending, and a 2-tuple where
- * the first element is the projection function and the second is the direction;
- * this allows changing the direction without defining a more complex projection
- * to simply negate the value (e.g. `(x) => -x`).
- *
- * We rely on the javascript implementation of `<` and `>` for comparison, which
- * will attempt to transform both operands into a primitive comparable value via
- * the built in `valueOf` function (and then `toString`). It's up to the caller
- * to make sure that the projection is returning a value that makes sense for
- * this logic.
- *
- * It's important to note that there is no built-in caching/memoization of
- * projection function and therefore no guarantee that it would only be called
- * once.
- */
-type OrderRule<T> = Projection<T> | readonly [projection: Projection<T>, direction: keyof typeof COMPARATORS];
-type Projection<T> = (x: T) => Comparable;
-type Comparable = ComparablePrimitive | {
-    [Symbol.toPrimitive]: (hint: string) => ComparablePrimitive;
-} | {
-    toString: () => string;
-} | {
-    valueOf: () => ComparablePrimitive;
-};
-type ComparablePrimitive = bigint | boolean | number | string;
-
-export type { OrderRule as O };

package/dist/deduped-CagGlWg1.d.cts

@@ -1,23 +0,0 @@
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
-import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.cjs';
-
-/**
- * The result of running a function that would dedupe an array (`unique`,
- * `uniqueBy`, and `uniqueWith`).
- *
- * There are certain traits of the output which are unique to a deduped array
- * that allow us to create a better type; see comments inline.
- *
- * !Note: We can build better types for each of the unique functions
- * _separately_ by taking advantage of _other_ characteristics that are unique
- * to each one (e.g. in `unique` we know that each item that has a disjoint type
- * to all previous items would be part of the output, even when it isn't the
- * first), but to make this utility the most useful we kept it simple and
- * generic for now.
- */
-type Deduped<T extends IterableContainer> = T extends readonly [] ? [] : T extends readonly [infer Head, ...infer Rest] ? [
-    Head,
-    ...Array<Rest[number]>
-] : T extends readonly [...Array<unknown>, unknown] ? NonEmptyArray<T[number]> : Array<T[number]>;
-
-export type { Deduped as D };

package/dist/deduped-DWYYywHn.d.ts

@@ -1,23 +0,0 @@
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
-import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.js';
-
-/**
- * The result of running a function that would dedupe an array (`unique`,
- * `uniqueBy`, and `uniqueWith`).
- *
- * There are certain traits of the output which are unique to a deduped array
- * that allow us to create a better type; see comments inline.
- *
- * !Note: We can build better types for each of the unique functions
- * _separately_ by taking advantage of _other_ characteristics that are unique
- * to each one (e.g. in `unique` we know that each item that has a disjoint type
- * to all previous items would be part of the output, even when it isn't the
- * first), but to make this utility the most useful we kept it simple and
- * generic for now.
- */
-type Deduped<T extends IterableContainer> = T extends readonly [] ? [] : T extends readonly [infer Head, ...infer Rest] ? [
-    Head,
-    ...Array<Rest[number]>
-] : T extends readonly [...Array<unknown>, unknown] ? NonEmptyArray<T[number]> : Array<T[number]>;
-
-export type { Deduped as D };

package/dist/enumerable-string-key-of-C4gsorXe.d.ts

@@ -1,14 +0,0 @@
-import { T as ToString } from './to-string-DO8zw6jS.js';
-
-/**
- * A union of all keys of T which are not symbols, and where number keys are
- * converted to strings, following the definition of `Object.keys` and
- * `Object.entries`.
- *
- * Inspired and largely copied from [`sindresorhus/ts-extras`](https://github.com/sindresorhus/ts-extras/blob/44f57392c5f027268330771996c4fdf9260b22d6/source/object-keys.ts).
- *
- * @see EnumerableStringKeyedValueOf
- */
-type EnumerableStringKeyOf<T> = Required<T> extends Record<infer K, unknown> ? ToString<K> : never;
-
-export type { EnumerableStringKeyOf as E };

package/dist/enumerable-string-key-of-D8w_3Yg8.d.cts

@@ -1,14 +0,0 @@
-import { T as ToString } from './to-string-DO8zw6jS.cjs';
-
-/**
- * A union of all keys of T which are not symbols, and where number keys are
- * converted to strings, following the definition of `Object.keys` and
- * `Object.entries`.
- *
- * Inspired and largely copied from [`sindresorhus/ts-extras`](https://github.com/sindresorhus/ts-extras/blob/44f57392c5f027268330771996c4fdf9260b22d6/source/object-keys.ts).
- *
- * @see EnumerableStringKeyedValueOf
- */
-type EnumerableStringKeyOf<T> = Required<T> extends Record<infer K, unknown> ? ToString<K> : never;
-
-export type { EnumerableStringKeyOf as E };

package/dist/enumerable-string-keyed-value-of-BU9R_cEk.d.cts

@@ -1,9 +0,0 @@
-import { IfNever } from 'type-fest';
-
-/**
- * A union of all values of properties in T which are not keyed by a symbol,
- * following the definition of `Object.values` and `Object.entries`.
- */
-type EnumerableStringKeyedValueOf<T> = T extends unknown ? IfNever<Exclude<keyof T, symbol>, never, Required<T>[Exclude<keyof T, symbol>]> : never;
-
-export type { EnumerableStringKeyedValueOf as E };

package/dist/enumerable-string-keyed-value-of-BU9R_cEk.d.ts

@@ -1,9 +0,0 @@
-import { IfNever } from 'type-fest';
-
-/**
- * A union of all values of properties in T which are not keyed by a symbol,
- * following the definition of `Object.values` and `Object.entries`.
- */
-type EnumerableStringKeyedValueOf<T> = T extends unknown ? IfNever<Exclude<keyof T, symbol>, never, Required<T>[Exclude<keyof T, symbol>]> : never;
-
-export type { EnumerableStringKeyedValueOf as E };

package/dist/filtered-array-BCjySbC6.d.cts

@@ -1,18 +0,0 @@
-import { C as CoercedArray } from './coerced-array-DRz3tqda.cjs';
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
-import { T as TupleParts } from './tuple-parts-v6av7LMU.cjs';
-
-type FilteredArray<T extends IterableContainer, Condition> = T extends unknown ? [
-    ...FilteredFixedTuple<TupleParts<T>['required'], Condition>,
-    ...FilteredFixedTuple<TupleParts<T>['optional'], Condition>,
-    ...CoercedArray<SymmetricRefine<TupleParts<T>['item'], Condition>>,
-    ...FilteredFixedTuple<TupleParts<T>['suffix'], Condition>
-] : never;
-type FilteredFixedTuple<T, Condition, Output extends Array<unknown> = []> = T extends readonly [infer Head, ...infer Rest] ? FilteredFixedTuple<Rest, Condition, Head extends Condition ? [
-    ...Output,
-    Head
-] : Head | Condition extends object ? Output : Condition extends Head ? // But for any other type (mostly primitives), if the condition
-Output | [...Output, Condition] : Output> : Output;
-type SymmetricRefine<Item, Condition> = Item extends Condition ? Item : Condition extends Item ? Condition : never;
-
-export type { FilteredArray as F };

package/dist/filtered-array-JKATL39M.d.ts

@@ -1,18 +0,0 @@
-import { C as CoercedArray } from './coerced-array-DRz3tqda.js';
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
-import { T as TupleParts } from './tuple-parts-BTivqbtT.js';
-
-type FilteredArray<T extends IterableContainer, Condition> = T extends unknown ? [
-    ...FilteredFixedTuple<TupleParts<T>['required'], Condition>,
-    ...FilteredFixedTuple<TupleParts<T>['optional'], Condition>,
-    ...CoercedArray<SymmetricRefine<TupleParts<T>['item'], Condition>>,
-    ...FilteredFixedTuple<TupleParts<T>['suffix'], Condition>
-] : never;
-type FilteredFixedTuple<T, Condition, Output extends Array<unknown> = []> = T extends readonly [infer Head, ...infer Rest] ? FilteredFixedTuple<Rest, Condition, Head extends Condition ? [
-    ...Output,
-    Head
-] : Head | Condition extends object ? Output : Condition extends Head ? // But for any other type (mostly primitives), if the condition
-Output | [...Output, Condition] : Output> : Output;
-type SymmetricRefine<Item, Condition> = Item extends Condition ? Item : Condition extends Item ? Condition : never;
-
-export type { FilteredArray as F };

package/dist/int-range-inclusive-Cn-qsrAN.d.cts

@@ -1,12 +0,0 @@
-import { IntRange } from 'type-fest';
-
-/**
- * Type fest offers IntClosedRange which is a similar offering, but is
- * implemented in a way which makes it inefficient when the Step size is '1'
- * (as in our case). Their implementation can cause ts(2589) errors ('Type
- * instantiation is excessively deep and possibly infinite') errors when the
- * integers are large (even when the range itself is not).
- */
-type IntRangeInclusive<From extends number, To extends number> = IntRange<From, To> | To;
-
-export type { IntRangeInclusive as I };

package/dist/int-range-inclusive-Cn-qsrAN.d.ts

@@ -1,12 +0,0 @@
-import { IntRange } from 'type-fest';
-
-/**
- * Type fest offers IntClosedRange which is a similar offering, but is
- * implemented in a way which makes it inefficient when the Step size is '1'
- * (as in our case). Their implementation can cause ts(2589) errors ('Type
- * instantiation is excessively deep and possibly infinite') errors when the
- * integers are large (even when the range itself is not).
- */
-type IntRangeInclusive<From extends number, To extends number> = IntRange<From, To> | To;
-
-export type { IntRangeInclusive as I };

package/dist/is-bounded-record-C9WAwfA8.d.cts

@@ -1,30 +0,0 @@
-import { Or, IsStringLiteral, Split, IsNumericLiteral, IsSymbolLiteral, KeysOfUnion } from 'type-fest';
-
-/**
- * Checks if a type is a bounded key: a union of bounded strings, numeric
- * literals, or symbol literals.
- *
- * [For an interactive deeper dive and explanation see the following playground](https://www.typescriptlang.org/play/?noUncheckedIndexedAccess=true#code/PTAEBUAsEsGdQE4FMDGB7BATUdQCIAjNAVwDtMlM8AaHAF1EgEN4nQAzaU6OpUWJAzTtQAayQBPWADpQASQZMANrDSIkAR2LRk8HgHJYAKBCg0BAFaoGdNcwBufZUrMi6kJAFtpRuhIAOfABCJOSUoAC8oABKqBiYADwABv7InAAeAPoAJADeeB5KSmh4oAA++ADuGEpUAL5JtHiqnoIwpADmeAB8ANxGJmBQuMjoWDjweGREZBRUtDyMLKBMpDiknNy8-IKuoP5osLDQBEp84lKyCoaDZpbWoOjEtY9opHRMXKCkb3zCoO4vAC0GgfH5AqAAKqkGZhbBRWJjRIpNLQLJ5WB0BBcDoNJotNo4nr9W4AMQwK1IEggAC4IKAkOleOR4AAFJgIOjQZQJcDdUAEakUTZct60AjEGwedaOBACCbfNCKJSVJhSW5Y4hIWQAdQ8a0WuE1fEqfBQq34aoBzAY4AV0E8-iU0BQPCU1P8HK5ylAAApDcZTJptPZlEh3sDQOzOdylLzugBKXwBPhyWByR3O110d3R71xvmRKNe2PxhlM8OYeB2gD8+AkpTpeFIeBJpj14ZWKBQSCOOJW+wQaH8e0BAtCczuVhQtpTAGUUNj-AxzWtw7BiMhrUwGKlh7dGXA6Ho1mPzNPFOQGaQN1uePBwdqjBQUEoOWa3pjQEEAPKQgByAAiACigF0iEsyUP06A3gwsKTlEv4ASBgEANp4KkSAZJkhTFHgAC6-SmKAJEAHo1gM7b6l2PZ9p0A57iO-xjtME7hOe1i0JU1H6D80IoB4KDiJgchhOklAAILdr2sBJLcuDhkwpzhOA86LtAy6PBabzutet4mjaAIpvQoAAFSeNAHSQHQpkCkg4qSisKhoLcMHHBQCDWmaLAGUgd4MJgaC9qQ+gMIeX5fGe9wzrQqgmU8LzKHFBBILcSSQZslBJD4L5vlubkMABSFAaBdLQvBUFGAVoCsZB8JQv+xUoehmHYbhJSEbcJGgORlFDDAegPggWocBSpmmasEjjYOw57EVf4lYBvSgNxLqQKArSrA+hnODN-jwMItzzchoErFueDDqKpDKDQK0wAJCqMkwM66dxO6gEkealo+-zHYt3RyaYm03jsnirFy5pFBIy1xaa+jYIygQztaRpqMgdCbms+gSPoDkMIs6OY-AvH6AAhMmEJpuVbEiZmLpuhIX0+lEaYZk69M5ozJY8tTdV9F1PUUbcervbt7i4MDg3bvjaxg1SWkCLAtC9kjsa6e4hx8O4726MwEKrLcHHI6aG2WdZ3xIOEthLOQZzjnVlLYLVcLqEi8ACJ6CA7u6tCrJgrmrKF6i6W8OB09mrx+a6n7K44azcZ2gLUmD4g7De2rSD4QA).
- */
-type IsBounded<T> = (T extends unknown ? Or<IsBoundedString<T>, Or<IsNumericLiteral<T>, IsSymbolLiteral<T>>> : never) extends true ? true : false;
-/**
- * Literal strings can be unbounded when they are a template literal which
- * contains non-literal components (e.g. `prefix_${string}`), this is because
- * there are an infinite number of possible values that satisfy it.
- */
-type IsBoundedString<T> = T extends string ? IsStringLiteral<T> extends true ? Split<T, ''>[number] extends infer U ? [`${number}`] extends [U] ? false : [string] extends [U] ? false : true : false : false : false;
-
-/**
- * Check if a type is guaranteed to be a bounded record: a record with a finite
- * set of keys.
- *
- * See the docs for `IsBounded` to understand more.
- *
- * @example
- *   IsBoundedRecord<{ a: 1, 1: "a" }>; //=> true
- *   IsBoundedRecord<Record<string | number, unknown>>; //=> false
- *   IsBoundedRecord<Record<`prefix_${number}`, unknown>>; //=> false
- */
-type IsBoundedRecord<T> = IsBounded<KeysOfUnion<T>>;
-
-export type { IsBoundedRecord as I, IsBounded as a };

package/dist/is-bounded-record-C9WAwfA8.d.ts

@@ -1,30 +0,0 @@
-import { Or, IsStringLiteral, Split, IsNumericLiteral, IsSymbolLiteral, KeysOfUnion } from 'type-fest';
-
-/**
- * Checks if a type is a bounded key: a union of bounded strings, numeric
- * literals, or symbol literals.
- *
- * [For an interactive deeper dive and explanation see the following playground](https://www.typescriptlang.org/play/?noUncheckedIndexedAccess=true#code/PTAEBUAsEsGdQE4FMDGB7BATUdQCIAjNAVwDtMlM8AaHAF1EgEN4nQAzaU6OpUWJAzTtQAayQBPWADpQASQZMANrDSIkAR2LRk8HgHJYAKBCg0BAFaoGdNcwBufZUrMi6kJAFtpRuhIAOfABCJOSUoAC8oABKqBiYADwABv7InAAeAPoAJADeeB5KSmh4oAA++ADuGEpUAL5JtHiqnoIwpADmeAB8ANxGJmBQuMjoWDjweGREZBRUtDyMLKBMpDiknNy8-IKuoP5osLDQBEp84lKyCoaDZpbWoOjEtY9opHRMXKCkb3zCoO4vAC0GgfH5AqAAKqkGZhbBRWJjRIpNLQLJ5WB0BBcDoNJotNo4nr9W4AMQwK1IEggAC4IKAkOleOR4AAFJgIOjQZQJcDdUAEakUTZct60AjEGwedaOBACCbfNCKJSVJhSW5Y4hIWQAdQ8a0WuE1fEqfBQq34aoBzAY4AV0E8-iU0BQPCU1P8HK5ylAAApDcZTJptPZlEh3sDQOzOdylLzugBKXwBPhyWByR3O110d3R71xvmRKNe2PxhlM8OYeB2gD8+AkpTpeFIeBJpj14ZWKBQSCOOJW+wQaH8e0BAtCczuVhQtpTAGUUNj-AxzWtw7BiMhrUwGKlh7dGXA6Ho1mPzNPFOQGaQN1uePBwdqjBQUEoOWa3pjQEEAPKQgByAAiACigF0iEsyUP06A3gwsKTlEv4ASBgEANp4KkSAZJkhTFHgAC6-SmKAJEAHo1gM7b6l2PZ9p0A57iO-xjtME7hOe1i0JU1H6D80IoB4KDiJgchhOklAAILdr2sBJLcuDhkwpzhOA86LtAy6PBabzutet4mjaAIpvQoAAFSeNAHSQHQpkCkg4qSisKhoLcMHHBQCDWmaLAGUgd4MJgaC9qQ+gMIeX5fGe9wzrQqgmU8LzKHFBBILcSSQZslBJD4L5vlubkMABSFAaBdLQvBUFGAVoCsZB8JQv+xUoehmHYbhJSEbcJGgORlFDDAegPggWocBSpmmasEjjYOw57EVf4lYBvSgNxLqQKArSrA+hnODN-jwMItzzchoErFueDDqKpDKDQK0wAJCqMkwM66dxO6gEkealo+-zHYt3RyaYm03jsnirFy5pFBIy1xaa+jYIygQztaRpqMgdCbms+gSPoDkMIs6OY-AvH6AAhMmEJpuVbEiZmLpuhIX0+lEaYZk69M5ozJY8tTdV9F1PUUbcervbt7i4MDg3bvjaxg1SWkCLAtC9kjsa6e4hx8O4726MwEKrLcHHI6aG2WdZ3xIOEthLOQZzjnVlLYLVcLqEi8ACJ6CA7u6tCrJgrmrKF6i6W8OB09mrx+a6n7K44azcZ2gLUmD4g7De2rSD4QA).
- */
-type IsBounded<T> = (T extends unknown ? Or<IsBoundedString<T>, Or<IsNumericLiteral<T>, IsSymbolLiteral<T>>> : never) extends true ? true : false;
-/**
- * Literal strings can be unbounded when they are a template literal which
- * contains non-literal components (e.g. `prefix_${string}`), this is because
- * there are an infinite number of possible values that satisfy it.
- */
-type IsBoundedString<T> = T extends string ? IsStringLiteral<T> extends true ? Split<T, ''>[number] extends infer U ? [`${number}`] extends [U] ? false : [string] extends [U] ? false : true : false : false : false;
-
-/**
- * Check if a type is guaranteed to be a bounded record: a record with a finite
- * set of keys.
- *
- * See the docs for `IsBounded` to understand more.
- *
- * @example
- *   IsBoundedRecord<{ a: 1, 1: "a" }>; //=> true
- *   IsBoundedRecord<Record<string | number, unknown>>; //=> false
- *   IsBoundedRecord<Record<`prefix_${number}`, unknown>>; //=> false
- */
-type IsBoundedRecord<T> = IsBounded<KeysOfUnion<T>>;
-
-export type { IsBoundedRecord as I, IsBounded as a };

package/dist/is-union-Bx34mF34.d.cts

@@ -1,6 +0,0 @@
-import { IsNever } from 'type-fest';
-
-type IsUnion<T> = InternalIsUnion<T>;
-type InternalIsUnion<T, U = T> = (IsNever<T> extends true ? false : T extends any ? [U] extends [T] ? false : true : never) extends infer Result ? boolean extends Result ? true : Result : never;
-
-export type { IsUnion as I };

package/dist/is-union-Bx34mF34.d.ts

@@ -1,6 +0,0 @@
-import { IsNever } from 'type-fest';
-
-type IsUnion<T> = InternalIsUnion<T>;
-type InternalIsUnion<T, U = T> = (IsNever<T> extends true ? false : T extends any ? [U] extends [T] ? false : true : never) extends infer Result ? boolean extends Result ? true : Result : never;
-
-export type { IsUnion as I };

package/dist/iterable-container-BTpDVdNc.d.cts

@@ -1,15 +0,0 @@
-/**
- * This should only be used for defining generics which extend any kind of JS
- * array under the hood, this includes arrays *AND* tuples (of the form [x, y],
- * and of the form [x, ...y[]], etc...), and their readonly equivalent. This
- * allows us to be more inclusive to what functions can process.
- *
- * @example
- *   function map<T extends IterableContainer>(items: T) { ... }
- *
- * We would've named this `ArrayLike`, but that's already used by typescript...
- * @see This was inspired by the type-definition of Promise.all (https://github.com/microsoft/TypeScript/blob/1df5717b120cddd325deab8b0f2b2c3eecaf2b01/src/lib/es2015.promise.d.ts#L21)
- */
-type IterableContainer<T = unknown> = readonly [] | ReadonlyArray<T>;
-
-export type { IterableContainer as I };