@vinicunca/perkakas 1.7.0 → 1.8.0

package/dist/has-at-least.d.cts

@@ -1,60 +1,8 @@
-import { IsNumericLiteral } from 'type-fest';
-import { A as ArrayRequiredPrefix } from './array-required-prefix-Ck4lHkbA.cjs';
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
-import './clamped-integer-subtract-DZ7rsJE4.cjs';
-import './coerced-array-DRz3tqda.cjs';
-import './perkakas-type-error-8wPb8T2y.cjs';
-import './tuple-parts-v6av7LMU.cjs';
-
-/**
- * Checks if the given array has at least the defined number of elements. When
- * the minimum used is a literal (e.g. `3`) the output is refined accordingly so
- * that those indices are defined when accessing the array even when using
- * typescript's 'noUncheckedIndexAccess'.
- *
- * @param data - The input array.
- * @param minimum - The minimum number of elements the array must have.
- * @returns True if the array's length is *at least* `minimum`. When `minimum`
- * is a literal value, the output is narrowed to ensure the first items are
- * guaranteed.
- * @signature
- *   P.hasAtLeast(data, minimum)
- * @example
- *   P.hasAtLeast([], 4); // => false
- *
- *   const data: number[] = [1,2,3,4];
- *   P.hasAtLeast(data, 1); // => true
- *   data[0]; // 1, with type `number`
- * @dataFirst
- * @category Array
- */
-declare function hasAtLeast<T extends IterableContainer, N extends number>(data: IterableContainer | T, minimum: IsNumericLiteral<N> extends true ? N : never): data is ArrayRequiredPrefix<T, N>;
-declare function hasAtLeast(data: IterableContainer, minimum: number): boolean;
-/**
- * Checks if the given array has at least the defined number of elements. When
- * the minimum used is a literal (e.g. `3`) the output is refined accordingly so
- * that those indices are defined when accessing the array even when using
- * typescript's 'noUncheckedIndexAccess'.
- *
- * @param minimum - The minimum number of elements the array must have.
- * @returns True if the array's length is *at least* `minimum`. When `minimum`
- * is a literal value, the output is narrowed to ensure the first items are
- * guaranteed.
- * @signature
- *   P.hasAtLeast(minimum)(data)
- * @example
- *   P.pipe([], P.hasAtLeast(4)); // => false
- *
- *   const data = [[1,2], [3], [4,5]];
- *   P.pipe(
- *     data,
- *     P.filter(P.hasAtLeast(2)),
- *     P.map(([, second]) => second),
- *   ); // => [2,5], with type `number[]`
- * @dataLast
- * @category Array
- */
-declare function hasAtLeast<N extends number>(minimum: IsNumericLiteral<N> extends true ? N : never): <T extends IterableContainer>(data: IterableContainer | T) => data is ArrayRequiredPrefix<T, N>;
-declare function hasAtLeast(minimum: number): (data: IterableContainer) => boolean;
-
-export { hasAtLeast };
+import "./iterable-container-V5sa0V_H.cjs";
+import "./perkakas-type-error-0tHtaPbi.cjs";
+import "./tuple-parts-BIyABPYv.cjs";
+import "./clamped-integer-subtract-DId0tRjp.cjs";
+import "./coerced-array-kVJtBrMl.cjs";
+import "./array-required-prefix-FSH3Acx8.cjs";
+import { hasAtLeast } from "./has-at-least-BbYfXc8L.cjs";
+export { hasAtLeast };

package/dist/has-at-least.d.ts

@@ -1,60 +1,8 @@
-import { IsNumericLiteral } from 'type-fest';
-import { A as ArrayRequiredPrefix } from './array-required-prefix-DXv_WnmG.js';
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
-import './clamped-integer-subtract-DZ7rsJE4.js';
-import './coerced-array-DRz3tqda.js';
-import './perkakas-type-error-8wPb8T2y.js';
-import './tuple-parts-BTivqbtT.js';
-
-/**
- * Checks if the given array has at least the defined number of elements. When
- * the minimum used is a literal (e.g. `3`) the output is refined accordingly so
- * that those indices are defined when accessing the array even when using
- * typescript's 'noUncheckedIndexAccess'.
- *
- * @param data - The input array.
- * @param minimum - The minimum number of elements the array must have.
- * @returns True if the array's length is *at least* `minimum`. When `minimum`
- * is a literal value, the output is narrowed to ensure the first items are
- * guaranteed.
- * @signature
- *   P.hasAtLeast(data, minimum)
- * @example
- *   P.hasAtLeast([], 4); // => false
- *
- *   const data: number[] = [1,2,3,4];
- *   P.hasAtLeast(data, 1); // => true
- *   data[0]; // 1, with type `number`
- * @dataFirst
- * @category Array
- */
-declare function hasAtLeast<T extends IterableContainer, N extends number>(data: IterableContainer | T, minimum: IsNumericLiteral<N> extends true ? N : never): data is ArrayRequiredPrefix<T, N>;
-declare function hasAtLeast(data: IterableContainer, minimum: number): boolean;
-/**
- * Checks if the given array has at least the defined number of elements. When
- * the minimum used is a literal (e.g. `3`) the output is refined accordingly so
- * that those indices are defined when accessing the array even when using
- * typescript's 'noUncheckedIndexAccess'.
- *
- * @param minimum - The minimum number of elements the array must have.
- * @returns True if the array's length is *at least* `minimum`. When `minimum`
- * is a literal value, the output is narrowed to ensure the first items are
- * guaranteed.
- * @signature
- *   P.hasAtLeast(minimum)(data)
- * @example
- *   P.pipe([], P.hasAtLeast(4)); // => false
- *
- *   const data = [[1,2], [3], [4,5]];
- *   P.pipe(
- *     data,
- *     P.filter(P.hasAtLeast(2)),
- *     P.map(([, second]) => second),
- *   ); // => [2,5], with type `number[]`
- * @dataLast
- * @category Array
- */
-declare function hasAtLeast<N extends number>(minimum: IsNumericLiteral<N> extends true ? N : never): <T extends IterableContainer>(data: IterableContainer | T) => data is ArrayRequiredPrefix<T, N>;
-declare function hasAtLeast(minimum: number): (data: IterableContainer) => boolean;
-
-export { hasAtLeast };
+import "./iterable-container-wtkYslN_.js";
+import "./perkakas-type-error-Da3ni385.js";
+import "./tuple-parts-BxpZLJ7r.js";
+import "./clamped-integer-subtract-CQL8aT__.js";
+import "./coerced-array-DyA0Yc12.js";
+import "./array-required-prefix-BeSNHH4G.js";
+import { hasAtLeast } from "./has-at-least-D1A8i5J3.js";
+export { hasAtLeast };

package/dist/has-at-least.js

@@ -1 +1 @@
-import{a}from"./chunk-ITDJLXHO.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as hasAtLeast};
+import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{hasAtLeast as e}from"./has-at-least-6iRvhsST.js";export{e as hasAtLeast};

package/dist/has-sub-object-C7LwzJ88.js

@@ -0,0 +1,2 @@
+import{curry as e}from"./curry-CzZjDrpv.js";import{isDeepEqual as t}from"./is-deep-equal-D7dqs3e2.js";function n(...t){return e(r,t)}function r(e,n){for(let[r,i]of Object.entries(n))if(!Object.hasOwn(e,r)||!t(i,e[r]))return!1;return!0}export{n as hasSubObject};
+//# sourceMappingURL=has-sub-object-C7LwzJ88.js.map

package/dist/has-sub-object-C7LwzJ88.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"has-sub-object-C7LwzJ88.js","names":[],"sources":["../src/has-sub-object.ts"],"sourcesContent":["import type { Simplify, Tagged } from 'type-fest';\nimport { curry } from './curry';\nimport { isDeepEqual } from './is-deep-equal';\n\n// eslint-disable-next-line ts/no-unused-vars -- We want to confine the typing to a specific symbol\ndeclare const HAS_SUB_OBJECT_BRAND: unique symbol;\n\ntype HasSubObjectGuard<T, S> = Simplify<\n  Tagged<S & T, typeof HAS_SUB_OBJECT_BRAND>\n>;\n\ntype HasSubObjectObjectValue<A, B> = Partial<{\n  [Key in keyof A & keyof B]: A[Key] & B[Key] extends never\n    ? B[Key]\n    : A[Key] | B[Key] extends object\n      ? HasSubObjectObjectValue<A[Key], B[Key]>\n      : A[Key] & B[Key] extends object\n        ? B[Key]\n        : A[Key];\n}> & {\n  [Key in\n  | Exclude<keyof A, keyof B>\n  | Exclude<keyof B, keyof A>]: Key extends keyof B ? B[Key] : never;\n};\n\ntype HasSubObjectData<\n  Data,\n  SubObject,\n  RData = Required<Data>,\n  RSubObject = Required<SubObject>,\n> = Partial<{\n  [Key in keyof RData & keyof RSubObject]: RData[Key]\n    & RSubObject[Key] extends never\n    ? RSubObject[Key]\n    : RData[Key] | RSubObject[Key] extends object\n      ? HasSubObjectObjectValue<RData[Key], RSubObject[Key]>\n      : RData[Key] & RSubObject[Key] extends object\n        ? RSubObject[Key]\n        : RData[Key];\n}> & {\n  [Key in Exclude<keyof SubObject, keyof Data>]: SubObject[Key];\n};\n\ntype HasSubObjectSubObject<\n  SubObject,\n  Data,\n  RSubObject = Required<SubObject>,\n  RData = Required<Data>,\n> = Partial<{\n  [Key in keyof RData & keyof RSubObject]: RData[Key]\n    & RSubObject[Key] extends never\n    ? RData[Key]\n    : RData[Key] | RSubObject[Key] extends object\n      ? HasSubObjectObjectValue<RSubObject[Key], RData[Key]>\n      : RData[Key] & RSubObject[Key] extends object\n        ? RData[Key]\n        : RSubObject[Key];\n}>\n& Record<Exclude<keyof SubObject, keyof Data>, never>;\n\n/**\n * Checks if `subObject` is a sub-object of `object`, which means for every\n * property and value in `subObject`, there's the same property in `object`\n * with an equal value. Equality is checked with `isDeepEqual`.\n *\n * @param data - The object to test.\n * @param subObject - The sub-object to test against.\n * @signature\n *    P.hasSubObject(data, subObject)\n * @example\n *    P.hasSubObject({ a: 1, b: 2, c: 3 }, { a: 1, c: 3 }) //=> true\n *    P.hasSubObject({ a: 1, b: 2, c: 3 }, { b: 4 }) //=> false\n *    P.hasSubObject({ a: 1, b: 2, c: 3 }, {}) //=> true\n * @dataFirst\n * @category Guard\n */\nexport function hasSubObject<\n  T extends object,\n  S extends HasSubObjectSubObject<S, T>,\n>(data: T, subObject: S): data is HasSubObjectGuard<T, S>;\n\n/**\n * Checks if `subObject` is a sub-object of `object`, which means for every\n * property and value in `subObject`, there's the same property in `object`\n * with an equal value. Equality is checked with `isDeepEqual`.\n *\n * @param subObject - The sub-object to test against.\n * @signature\n *    P.hasSubObject(subObject)(data)\n * @example\n *    P.hasSubObject({ a: 1, c: 3 })({ a: 1, b: 2, c: 3 }) //=> true\n *    P.hasSubObject({ b: 4 })({ a: 1, b: 2, c: 3 }) //=> false\n *    P.hasSubObject({})({ a: 1, b: 2, c: 3 }) //=> true\n * @dataLast\n * @category Guard\n */\nexport function hasSubObject<S extends object>(\n  subObject: S,\n): <T extends HasSubObjectData<T, S>>(\n  data: T,\n) => data is HasSubObjectGuard<T, S>;\n\nexport function hasSubObject(...args: ReadonlyArray<unknown>): unknown {\n  return curry(hasSubObjectImplementation, args);\n}\n\nfunction hasSubObjectImplementation<\n  T extends Record<PropertyKey, unknown>,\n  S extends Record<PropertyKey, unknown>,\n>(data: T, subObject: S): data is HasSubObjectGuard<T, S> {\n  for (const [key, value] of Object.entries(subObject)) {\n    if (!Object.hasOwn(data, key)) {\n      return false;\n    }\n\n    if (!isDeepEqual(value, data[key])) {\n      return false;\n    }\n  }\n\n  return true;\n}\n"],"mappings":"sGAsGA,SAAgB,EAAa,GAAG,EAAuC,CACrE,OAAO,EAAM,EAA4B,EAAK,CAGhD,SAAS,EAGP,EAAS,EAA+C,CACxD,IAAK,GAAM,CAAC,EAAK,KAAU,OAAO,QAAQ,EAAU,CAKlD,GAJI,CAAC,OAAO,OAAO,EAAM,EAAI,EAIzB,CAAC,EAAY,EAAO,EAAK,GAAK,CAChC,MAAO,GAIX,MAAO"}

package/dist/has-sub-object-DPcKaDk7.d.ts

@@ -0,0 +1,44 @@
+import { Simplify, Tagged } from "type-fest";
+
+//#region src/has-sub-object.d.ts
+declare const HAS_SUB_OBJECT_BRAND: unique symbol;
+type HasSubObjectGuard<T, S> = Simplify<Tagged<S & T, typeof HAS_SUB_OBJECT_BRAND>>;
+type HasSubObjectObjectValue<A, B> = Partial<{ [Key in keyof A & keyof B]: A[Key] & B[Key] extends never ? B[Key] : A[Key] | B[Key] extends object ? HasSubObjectObjectValue<A[Key], B[Key]> : A[Key] & B[Key] extends object ? B[Key] : A[Key] }> & { [Key in Exclude<keyof A, keyof B> | Exclude<keyof B, keyof A>]: Key extends keyof B ? B[Key] : never };
+type HasSubObjectData<Data, SubObject, RData = Required<Data>, RSubObject = Required<SubObject>> = Partial<{ [Key in keyof RData & keyof RSubObject]: RData[Key] & RSubObject[Key] extends never ? RSubObject[Key] : RData[Key] | RSubObject[Key] extends object ? HasSubObjectObjectValue<RData[Key], RSubObject[Key]> : RData[Key] & RSubObject[Key] extends object ? RSubObject[Key] : RData[Key] }> & { [Key in Exclude<keyof SubObject, keyof Data>]: SubObject[Key] };
+type HasSubObjectSubObject<SubObject, Data, RSubObject = Required<SubObject>, RData = Required<Data>> = Partial<{ [Key in keyof RData & keyof RSubObject]: RData[Key] & RSubObject[Key] extends never ? RData[Key] : RData[Key] | RSubObject[Key] extends object ? HasSubObjectObjectValue<RSubObject[Key], RData[Key]> : RData[Key] & RSubObject[Key] extends object ? RData[Key] : RSubObject[Key] }> & Record<Exclude<keyof SubObject, keyof Data>, never>;
+/**
+ * Checks if `subObject` is a sub-object of `object`, which means for every
+ * property and value in `subObject`, there's the same property in `object`
+ * with an equal value. Equality is checked with `isDeepEqual`.
+ *
+ * @param data - The object to test.
+ * @param subObject - The sub-object to test against.
+ * @signature
+ *    P.hasSubObject(data, subObject)
+ * @example
+ *    P.hasSubObject({ a: 1, b: 2, c: 3 }, { a: 1, c: 3 }) //=> true
+ *    P.hasSubObject({ a: 1, b: 2, c: 3 }, { b: 4 }) //=> false
+ *    P.hasSubObject({ a: 1, b: 2, c: 3 }, {}) //=> true
+ * @dataFirst
+ * @category Guard
+ */
+declare function hasSubObject<T extends object, S extends HasSubObjectSubObject<S, T>>(data: T, subObject: S): data is HasSubObjectGuard<T, S>;
+/**
+ * Checks if `subObject` is a sub-object of `object`, which means for every
+ * property and value in `subObject`, there's the same property in `object`
+ * with an equal value. Equality is checked with `isDeepEqual`.
+ *
+ * @param subObject - The sub-object to test against.
+ * @signature
+ *    P.hasSubObject(subObject)(data)
+ * @example
+ *    P.hasSubObject({ a: 1, c: 3 })({ a: 1, b: 2, c: 3 }) //=> true
+ *    P.hasSubObject({ b: 4 })({ a: 1, b: 2, c: 3 }) //=> false
+ *    P.hasSubObject({})({ a: 1, b: 2, c: 3 }) //=> true
+ * @dataLast
+ * @category Guard
+ */
+declare function hasSubObject<S extends object>(subObject: S): <T extends HasSubObjectData<T, S>>(data: T) => data is HasSubObjectGuard<T, S>;
+//#endregion
+export { hasSubObject };
+//# sourceMappingURL=has-sub-object-DPcKaDk7.d.ts.map

package/dist/has-sub-object-DPcKaDk7.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"has-sub-object-DPcKaDk7.d.ts","names":[],"sources":["../src/has-sub-object.ts"],"sourcesContent":[],"mappings":";;;cAKc;KAET,0BAA0B,SAC7B,OAAO,IAAI,UAAU;AAR2B,KAW7C,uBAN4C,CAAA,CAAA,EAAA,CAAA,CAAA,GAMZ,OANY,CAAA,UAE5C,MAKW,CALX,GAAA,MAKqB,CALJ,GAKQ,CALR,CAKU,GALV,CAAA,GAKiB,CALjB,CAKmB,GALnB,CAAA,SAAA,KAAA,GAMhB,CANgB,CAMd,GANc,CAAA,GAOhB,CAPgB,CAOd,GAPc,CAAA,GAOP,CAPO,CAOL,GAPK,CAAA,SAAA,MAAA,GAQd,uBARc,CAQU,CARV,CAQY,GARZ,CAAA,EAQkB,CARlB,CAQoB,GARpB,CAAA,CAAA,GASd,CATc,CASZ,GATY,CAAA,GASL,CATK,CASH,GATG,CAAA,SAAA,MAAA,GAUZ,CAVY,CAUV,GAVU,CAAA,GAWZ,CAXY,CAWV,GAXU,CAAA,EAAA,CAAA,GAAA,UAclB,OAbK,CAAA,MAaS,CAbT,EAAA,MAakB,CAblB,CAAA,GAcL,OAdK,CAAA,MAcS,CAdT,EAAA,MAckB,CAdlB,CAAA,GAcuB,GAdvB,SAAA,MAcyC,CAdzC,GAc6C,CAd7C,CAc+C,GAd/C,CAAA,GAAA,KAAA;KAiBJ,gBAjBkB,CAAA,IAAA,EAAA,SAAA,EAAA,QAoBb,QApBa,CAoBJ,IApBI,CAAA,EAAA,aAqBR,QArBQ,CAqBC,SArBD,CAAA,CAAA,GAsBnB,OAtBmB,CAAA,UAArB,MAuBc,KAvBd,GAAA,MAuB4B,UAvB5B,GAuByC,KAvBzC,CAuB+C,GAvB/C,CAAA,GAwBI,UAxBJ,CAwBe,GAxBf,CAAA,SAAA,KAAA,GAyBI,UAzBJ,CAyBe,GAzBf,CAAA,GA0BI,KA1BJ,CA0BU,GA1BV,CAAA,GA0BiB,UA1BjB,CA0B4B,GA1B5B,CAAA,SAAA,MAAA,GA2BM,uBA3BN,CA2B8B,KA3B9B,CA2BoC,GA3BpC,CAAA,EA2B0C,UA3B1C,CA2BqD,GA3BrD,CAAA,CAAA,GA4BM,KA5BN,CA4BY,GA5BZ,CAAA,GA4BmB,UA5BnB,CA4B8B,GA5B9B,CAAA,SAAA,MAAA,GA6BQ,UA7BR,CA6BmB,GA7BnB,CAAA,GA8BQ,KA9BR,CA8Bc,GA9Bd,CAAA,gBAgCQ,OAjC6B,CAAA,MAiCf,SAjCe,EAAA,MAiCE,IAjCF,CAAA,GAiCU,SAjCV,CAiCoB,GAjCpB,CAAA,EAAA;KAoClC,qBAhCuB,CAAA,SAAA,EAAA,IAAA,EAAA,aAmCb,QAnCa,CAmCJ,SAnCI,CAAA,EAAA,QAoClB,QApCkB,CAoCT,IApCS,CAAA,CAAA,GAqCxB,OArCwB,CAAA,UACZ,MAqCA,KArCA,GAAA,MAqCc,UArCd,GAqC2B,KArC3B,CAqCiC,GArCjC,CAAA,GAsCV,UAtCU,CAsCC,GAtCD,CAAA,SAAA,KAAA,GAuCV,KAvCU,CAuCJ,GAvCI,CAAA,GAwCV,KAxCU,CAwCJ,GAxCI,CAAA,GAwCG,UAxCH,CAwCc,GAxCd,CAAA,SAAA,MAAA,GAyCR,uBAzCQ,CAyCgB,UAzChB,CAyC2B,GAzC3B,CAAA,EAyCiC,KAzCjC,CAyCuC,GAzCvC,CAAA,CAAA,GA0CR,KA1CQ,CA0CF,GA1CE,CAAA,GA0CK,UA1CL,CA0CgB,GA1ChB,CAAA,SAAA,MAAA,GA2CN,KA3CM,CA2CA,GA3CA,CAAA,GA4CN,UA5CM,CA4CK,GA5CL,CAAA,MA8Cd,MA9CwB,CA8CjB,OA9CiB,CAAA,MA8CH,SA9CG,EAAA,MA8Cc,IA9Cd,CAAA,EAAA,KAAA,CAAA;;;;;;;;;;;;;;;;;AAIhB,iBA4DM,YA5DN,CAAA,UAAA,MAAA,EAAA,UA8DE,qBA9DF,CA8DwB,CA9DxB,EA8D2B,CA9D3B,CAAA,CAAA,CAAA,IAAA,EA+DF,CA/DE,EAAA,SAAA,EA+DY,CA/DZ,CAAA,EAAA,IAAA,IA+DwB,iBA/DxB,CA+D0C,CA/D1C,EA+D6C,CA/D7C,CAAA;;;;;;;;;;;;;;;;AAM4C,iBA0EtC,YA1EsC,CAAA,UAAA,MAAA,CAAA,CAAA,SAAA,EA2EzC,CA3EyC,CAAA,EAAA,CAAA,UA4ExC,gBA5EwC,CA4EvB,CA5EuB,EA4EpB,CA5EoB,CAAA,CAAA,CAAA,IAAA,EA6E9C,CA7E8C,EAAA,GAAA,IAAA,IA8EzC,iBA9EyC,CA8EvB,CA9EuB,EA8EpB,CA9EoB,CAAA"}

package/dist/has-sub-object-DjlCWSUi.cjs

@@ -0,0 +1 @@
+const e=require(`./curry-BPVIsvo3.cjs`),t=require(`./is-deep-equal-DR9xJg8D.cjs`);function n(...t){return e.curry(r,t)}function r(e,n){for(let[r,i]of Object.entries(n))if(!Object.hasOwn(e,r)||!t.isDeepEqual(i,e[r]))return!1;return!0}Object.defineProperty(exports,`hasSubObject`,{enumerable:!0,get:function(){return n}});

package/dist/has-sub-object-oUnH6b7a.d.cts

@@ -0,0 +1,44 @@
+import { Simplify, Tagged } from "type-fest";
+
+//#region src/has-sub-object.d.ts
+declare const HAS_SUB_OBJECT_BRAND: unique symbol;
+type HasSubObjectGuard<T, S> = Simplify<Tagged<S & T, typeof HAS_SUB_OBJECT_BRAND>>;
+type HasSubObjectObjectValue<A, B> = Partial<{ [Key in keyof A & keyof B]: A[Key] & B[Key] extends never ? B[Key] : A[Key] | B[Key] extends object ? HasSubObjectObjectValue<A[Key], B[Key]> : A[Key] & B[Key] extends object ? B[Key] : A[Key] }> & { [Key in Exclude<keyof A, keyof B> | Exclude<keyof B, keyof A>]: Key extends keyof B ? B[Key] : never };
+type HasSubObjectData<Data, SubObject, RData = Required<Data>, RSubObject = Required<SubObject>> = Partial<{ [Key in keyof RData & keyof RSubObject]: RData[Key] & RSubObject[Key] extends never ? RSubObject[Key] : RData[Key] | RSubObject[Key] extends object ? HasSubObjectObjectValue<RData[Key], RSubObject[Key]> : RData[Key] & RSubObject[Key] extends object ? RSubObject[Key] : RData[Key] }> & { [Key in Exclude<keyof SubObject, keyof Data>]: SubObject[Key] };
+type HasSubObjectSubObject<SubObject, Data, RSubObject = Required<SubObject>, RData = Required<Data>> = Partial<{ [Key in keyof RData & keyof RSubObject]: RData[Key] & RSubObject[Key] extends never ? RData[Key] : RData[Key] | RSubObject[Key] extends object ? HasSubObjectObjectValue<RSubObject[Key], RData[Key]> : RData[Key] & RSubObject[Key] extends object ? RData[Key] : RSubObject[Key] }> & Record<Exclude<keyof SubObject, keyof Data>, never>;
+/**
+ * Checks if `subObject` is a sub-object of `object`, which means for every
+ * property and value in `subObject`, there's the same property in `object`
+ * with an equal value. Equality is checked with `isDeepEqual`.
+ *
+ * @param data - The object to test.
+ * @param subObject - The sub-object to test against.
+ * @signature
+ *    P.hasSubObject(data, subObject)
+ * @example
+ *    P.hasSubObject({ a: 1, b: 2, c: 3 }, { a: 1, c: 3 }) //=> true
+ *    P.hasSubObject({ a: 1, b: 2, c: 3 }, { b: 4 }) //=> false
+ *    P.hasSubObject({ a: 1, b: 2, c: 3 }, {}) //=> true
+ * @dataFirst
+ * @category Guard
+ */
+declare function hasSubObject<T extends object, S extends HasSubObjectSubObject<S, T>>(data: T, subObject: S): data is HasSubObjectGuard<T, S>;
+/**
+ * Checks if `subObject` is a sub-object of `object`, which means for every
+ * property and value in `subObject`, there's the same property in `object`
+ * with an equal value. Equality is checked with `isDeepEqual`.
+ *
+ * @param subObject - The sub-object to test against.
+ * @signature
+ *    P.hasSubObject(subObject)(data)
+ * @example
+ *    P.hasSubObject({ a: 1, c: 3 })({ a: 1, b: 2, c: 3 }) //=> true
+ *    P.hasSubObject({ b: 4 })({ a: 1, b: 2, c: 3 }) //=> false
+ *    P.hasSubObject({})({ a: 1, b: 2, c: 3 }) //=> true
+ * @dataLast
+ * @category Guard
+ */
+declare function hasSubObject<S extends object>(subObject: S): <T extends HasSubObjectData<T, S>>(data: T) => data is HasSubObjectGuard<T, S>;
+//#endregion
+export { hasSubObject };
+//# sourceMappingURL=has-sub-object-oUnH6b7a.d.cts.map

package/dist/has-sub-object-oUnH6b7a.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"has-sub-object-oUnH6b7a.d.cts","names":[],"sources":["../src/has-sub-object.ts"],"sourcesContent":[],"mappings":";;;cAKc;KAET,0BAA0B,SAC7B,OAAO,IAAI,UAAU;AAR2B,KAW7C,uBAN4C,CAAA,CAAA,EAAA,CAAA,CAAA,GAMZ,OANY,CAAA,UAE5C,MAKW,CALX,GAAA,MAKqB,CALJ,GAKQ,CALR,CAKU,GALV,CAAA,GAKiB,CALjB,CAKmB,GALnB,CAAA,SAAA,KAAA,GAMhB,CANgB,CAMd,GANc,CAAA,GAOhB,CAPgB,CAOd,GAPc,CAAA,GAOP,CAPO,CAOL,GAPK,CAAA,SAAA,MAAA,GAQd,uBARc,CAQU,CARV,CAQY,GARZ,CAAA,EAQkB,CARlB,CAQoB,GARpB,CAAA,CAAA,GASd,CATc,CASZ,GATY,CAAA,GASL,CATK,CASH,GATG,CAAA,SAAA,MAAA,GAUZ,CAVY,CAUV,GAVU,CAAA,GAWZ,CAXY,CAWV,GAXU,CAAA,EAAA,CAAA,GAAA,UAclB,OAbK,CAAA,MAaS,CAbT,EAAA,MAakB,CAblB,CAAA,GAcL,OAdK,CAAA,MAcS,CAdT,EAAA,MAckB,CAdlB,CAAA,GAcuB,GAdvB,SAAA,MAcyC,CAdzC,GAc6C,CAd7C,CAc+C,GAd/C,CAAA,GAAA,KAAA;KAiBJ,gBAjBkB,CAAA,IAAA,EAAA,SAAA,EAAA,QAoBb,QApBa,CAoBJ,IApBI,CAAA,EAAA,aAqBR,QArBQ,CAqBC,SArBD,CAAA,CAAA,GAsBnB,OAtBmB,CAAA,UAArB,MAuBc,KAvBd,GAAA,MAuB4B,UAvB5B,GAuByC,KAvBzC,CAuB+C,GAvB/C,CAAA,GAwBI,UAxBJ,CAwBe,GAxBf,CAAA,SAAA,KAAA,GAyBI,UAzBJ,CAyBe,GAzBf,CAAA,GA0BI,KA1BJ,CA0BU,GA1BV,CAAA,GA0BiB,UA1BjB,CA0B4B,GA1B5B,CAAA,SAAA,MAAA,GA2BM,uBA3BN,CA2B8B,KA3B9B,CA2BoC,GA3BpC,CAAA,EA2B0C,UA3B1C,CA2BqD,GA3BrD,CAAA,CAAA,GA4BM,KA5BN,CA4BY,GA5BZ,CAAA,GA4BmB,UA5BnB,CA4B8B,GA5B9B,CAAA,SAAA,MAAA,GA6BQ,UA7BR,CA6BmB,GA7BnB,CAAA,GA8BQ,KA9BR,CA8Bc,GA9Bd,CAAA,gBAgCQ,OAjC6B,CAAA,MAiCf,SAjCe,EAAA,MAiCE,IAjCF,CAAA,GAiCU,SAjCV,CAiCoB,GAjCpB,CAAA,EAAA;KAoClC,qBAhCuB,CAAA,SAAA,EAAA,IAAA,EAAA,aAmCb,QAnCa,CAmCJ,SAnCI,CAAA,EAAA,QAoClB,QApCkB,CAoCT,IApCS,CAAA,CAAA,GAqCxB,OArCwB,CAAA,UACZ,MAqCA,KArCA,GAAA,MAqCc,UArCd,GAqC2B,KArC3B,CAqCiC,GArCjC,CAAA,GAsCV,UAtCU,CAsCC,GAtCD,CAAA,SAAA,KAAA,GAuCV,KAvCU,CAuCJ,GAvCI,CAAA,GAwCV,KAxCU,CAwCJ,GAxCI,CAAA,GAwCG,UAxCH,CAwCc,GAxCd,CAAA,SAAA,MAAA,GAyCR,uBAzCQ,CAyCgB,UAzChB,CAyC2B,GAzC3B,CAAA,EAyCiC,KAzCjC,CAyCuC,GAzCvC,CAAA,CAAA,GA0CR,KA1CQ,CA0CF,GA1CE,CAAA,GA0CK,UA1CL,CA0CgB,GA1ChB,CAAA,SAAA,MAAA,GA2CN,KA3CM,CA2CA,GA3CA,CAAA,GA4CN,UA5CM,CA4CK,GA5CL,CAAA,MA8Cd,MA9CwB,CA8CjB,OA9CiB,CAAA,MA8CH,SA9CG,EAAA,MA8Cc,IA9Cd,CAAA,EAAA,KAAA,CAAA;;;;;;;;;;;;;;;;;AAIhB,iBA4DM,YA5DN,CAAA,UAAA,MAAA,EAAA,UA8DE,qBA9DF,CA8DwB,CA9DxB,EA8D2B,CA9D3B,CAAA,CAAA,CAAA,IAAA,EA+DF,CA/DE,EAAA,SAAA,EA+DY,CA/DZ,CAAA,EAAA,IAAA,IA+DwB,iBA/DxB,CA+D0C,CA/D1C,EA+D6C,CA/D7C,CAAA;;;;;;;;;;;;;;;;AAM4C,iBA0EtC,YA1EsC,CAAA,UAAA,MAAA,CAAA,CAAA,SAAA,EA2EzC,CA3EyC,CAAA,EAAA,CAAA,UA4ExC,gBA5EwC,CA4EvB,CA5EuB,EA4EpB,CA5EoB,CAAA,CAAA,CAAA,IAAA,EA6E9C,CA7E8C,EAAA,GAAA,IAAA,IA8EzC,iBA9EyC,CA8EvB,CA9EuB,EA8EpB,CA9EoB,CAAA"}

package/dist/has-sub-object.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkL3VSMTOZcjs = require('./chunk-L3VSMTOZ.cjs');require('./chunk-HJ2H6KUH.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.hasSubObject = _chunkL3VSMTOZcjs.a;
+require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`),require(`./is-deep-equal-DR9xJg8D.cjs`);const e=require(`./has-sub-object-DjlCWSUi.cjs`);exports.hasSubObject=e.hasSubObject;

package/dist/has-sub-object.d.cts

@@ -1,52 +1,2 @@
-import { Simplify, Tagged } from 'type-fest';
-
-declare const HAS_SUB_OBJECT_BRAND: unique symbol;
-type HasSubObjectGuard<T, S> = Simplify<Tagged<S & T, typeof HAS_SUB_OBJECT_BRAND>>;
-type HasSubObjectObjectValue<A, B> = Partial<{
-    [Key in keyof A & keyof B]: A[Key] & B[Key] extends never ? B[Key] : A[Key] | B[Key] extends object ? HasSubObjectObjectValue<A[Key], B[Key]> : A[Key] & B[Key] extends object ? B[Key] : A[Key];
-}> & {
-    [Key in Exclude<keyof A, keyof B> | Exclude<keyof B, keyof A>]: Key extends keyof B ? B[Key] : never;
-};
-type HasSubObjectData<Data, SubObject, RData = Required<Data>, RSubObject = Required<SubObject>> = Partial<{
-    [Key in keyof RData & keyof RSubObject]: RData[Key] & RSubObject[Key] extends never ? RSubObject[Key] : RData[Key] | RSubObject[Key] extends object ? HasSubObjectObjectValue<RData[Key], RSubObject[Key]> : RData[Key] & RSubObject[Key] extends object ? RSubObject[Key] : RData[Key];
-}> & {
-    [Key in Exclude<keyof SubObject, keyof Data>]: SubObject[Key];
-};
-type HasSubObjectSubObject<SubObject, Data, RSubObject = Required<SubObject>, RData = Required<Data>> = Partial<{
-    [Key in keyof RData & keyof RSubObject]: RData[Key] & RSubObject[Key] extends never ? RData[Key] : RData[Key] | RSubObject[Key] extends object ? HasSubObjectObjectValue<RSubObject[Key], RData[Key]> : RData[Key] & RSubObject[Key] extends object ? RData[Key] : RSubObject[Key];
-}> & Record<Exclude<keyof SubObject, keyof Data>, never>;
-/**
- * Checks if `subObject` is a sub-object of `object`, which means for every
- * property and value in `subObject`, there's the same property in `object`
- * with an equal value. Equality is checked with `isDeepEqual`.
- *
- * @param data - The object to test.
- * @param subObject - The sub-object to test against.
- * @signature
- *    P.hasSubObject(data, subObject)
- * @example
- *    P.hasSubObject({ a: 1, b: 2, c: 3 }, { a: 1, c: 3 }) //=> true
- *    P.hasSubObject({ a: 1, b: 2, c: 3 }, { b: 4 }) //=> false
- *    P.hasSubObject({ a: 1, b: 2, c: 3 }, {}) //=> true
- * @dataFirst
- * @category Guard
- */
-declare function hasSubObject<T extends object, S extends HasSubObjectSubObject<S, T>>(data: T, subObject: S): data is HasSubObjectGuard<T, S>;
-/**
- * Checks if `subObject` is a sub-object of `object`, which means for every
- * property and value in `subObject`, there's the same property in `object`
- * with an equal value. Equality is checked with `isDeepEqual`.
- *
- * @param subObject - The sub-object to test against.
- * @signature
- *    P.hasSubObject(subObject)(data)
- * @example
- *    P.hasSubObject({ a: 1, c: 3 })({ a: 1, b: 2, c: 3 }) //=> true
- *    P.hasSubObject({ b: 4 })({ a: 1, b: 2, c: 3 }) //=> false
- *    P.hasSubObject({})({ a: 1, b: 2, c: 3 }) //=> true
- * @dataLast
- * @category Guard
- */
-declare function hasSubObject<S extends object>(subObject: S): <T extends HasSubObjectData<T, S>>(data: T) => data is HasSubObjectGuard<T, S>;
-
-export { hasSubObject };
+import { hasSubObject } from "./has-sub-object-oUnH6b7a.cjs";
+export { hasSubObject };

package/dist/has-sub-object.d.ts

@@ -1,52 +1,2 @@
-import { Simplify, Tagged } from 'type-fest';
-
-declare const HAS_SUB_OBJECT_BRAND: unique symbol;
-type HasSubObjectGuard<T, S> = Simplify<Tagged<S & T, typeof HAS_SUB_OBJECT_BRAND>>;
-type HasSubObjectObjectValue<A, B> = Partial<{
-    [Key in keyof A & keyof B]: A[Key] & B[Key] extends never ? B[Key] : A[Key] | B[Key] extends object ? HasSubObjectObjectValue<A[Key], B[Key]> : A[Key] & B[Key] extends object ? B[Key] : A[Key];
-}> & {
-    [Key in Exclude<keyof A, keyof B> | Exclude<keyof B, keyof A>]: Key extends keyof B ? B[Key] : never;
-};
-type HasSubObjectData<Data, SubObject, RData = Required<Data>, RSubObject = Required<SubObject>> = Partial<{
-    [Key in keyof RData & keyof RSubObject]: RData[Key] & RSubObject[Key] extends never ? RSubObject[Key] : RData[Key] | RSubObject[Key] extends object ? HasSubObjectObjectValue<RData[Key], RSubObject[Key]> : RData[Key] & RSubObject[Key] extends object ? RSubObject[Key] : RData[Key];
-}> & {
-    [Key in Exclude<keyof SubObject, keyof Data>]: SubObject[Key];
-};
-type HasSubObjectSubObject<SubObject, Data, RSubObject = Required<SubObject>, RData = Required<Data>> = Partial<{
-    [Key in keyof RData & keyof RSubObject]: RData[Key] & RSubObject[Key] extends never ? RData[Key] : RData[Key] | RSubObject[Key] extends object ? HasSubObjectObjectValue<RSubObject[Key], RData[Key]> : RData[Key] & RSubObject[Key] extends object ? RData[Key] : RSubObject[Key];
-}> & Record<Exclude<keyof SubObject, keyof Data>, never>;
-/**
- * Checks if `subObject` is a sub-object of `object`, which means for every
- * property and value in `subObject`, there's the same property in `object`
- * with an equal value. Equality is checked with `isDeepEqual`.
- *
- * @param data - The object to test.
- * @param subObject - The sub-object to test against.
- * @signature
- *    P.hasSubObject(data, subObject)
- * @example
- *    P.hasSubObject({ a: 1, b: 2, c: 3 }, { a: 1, c: 3 }) //=> true
- *    P.hasSubObject({ a: 1, b: 2, c: 3 }, { b: 4 }) //=> false
- *    P.hasSubObject({ a: 1, b: 2, c: 3 }, {}) //=> true
- * @dataFirst
- * @category Guard
- */
-declare function hasSubObject<T extends object, S extends HasSubObjectSubObject<S, T>>(data: T, subObject: S): data is HasSubObjectGuard<T, S>;
-/**
- * Checks if `subObject` is a sub-object of `object`, which means for every
- * property and value in `subObject`, there's the same property in `object`
- * with an equal value. Equality is checked with `isDeepEqual`.
- *
- * @param subObject - The sub-object to test against.
- * @signature
- *    P.hasSubObject(subObject)(data)
- * @example
- *    P.hasSubObject({ a: 1, c: 3 })({ a: 1, b: 2, c: 3 }) //=> true
- *    P.hasSubObject({ b: 4 })({ a: 1, b: 2, c: 3 }) //=> false
- *    P.hasSubObject({})({ a: 1, b: 2, c: 3 }) //=> true
- * @dataLast
- * @category Guard
- */
-declare function hasSubObject<S extends object>(subObject: S): <T extends HasSubObjectData<T, S>>(data: T) => data is HasSubObjectGuard<T, S>;
-
-export { hasSubObject };
+import { hasSubObject } from "./has-sub-object-DPcKaDk7.js";
+export { hasSubObject };

package/dist/has-sub-object.js

@@ -1 +1 @@
-import{a}from"./chunk-7AN7XHLU.js";import"./chunk-2IO5CTEV.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as hasSubObject};
+import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import"./is-deep-equal-D7dqs3e2.js";import{hasSubObject as e}from"./has-sub-object-C7LwzJ88.js";export{e as hasSubObject};

package/dist/heap-BrQEhV5W.js

@@ -0,0 +1,2 @@
+import{hasAtLeast as e}from"./has-at-least-6iRvhsST.js";import{swapInPlace as t}from"./swap-in-place-BBqaxzzG.js";function n(e,t){for(let n=Math.floor(e.length/2)-1;n>=0;n--)i(e,n,t)}function r(t,n,r){if(!e(t,1))return;let[a]=t;if(!(n(r,a)>=0))return t[0]=r,i(t,0,n),a}function i(e,n,r){let i=n;for(;i*2+1<e.length;){let n=i*2+1,a=r(e[i],e[n])<0?n:i,o=n+1;if(o<e.length&&r(e[a],e[o])<0&&(a=o),a===i)return;t(e,i,a),i=a}}export{r as heapMaybeInsert,n as heapify};
+//# sourceMappingURL=heap-BrQEhV5W.js.map

package/dist/heap-BrQEhV5W.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"heap-BrQEhV5W.js","names":[],"sources":["../src/internal/heap.ts"],"sourcesContent":["/**\n * Heap related utilities.\n */\n\nimport type { CompareFunction } from './types/compare-function';\n\nimport { hasAtLeast } from '../has-at-least';\nimport { swapInPlace } from './swap-in-place';\n\n/**\n * Mutates an array into a \"max\"-heap based on `compareFn` so that for any `item` in the heap, `compareFn(heap[0], item) > 0`.\n *\n * @param heap - The array to be heapified. The array would be mutated!\n * @param compareFn - The comparator used to order items in the heap. Use the\n * same function in all calls mutating the same heap otherwise you'd get\n * unexpected results.\n */\nexport function heapify<T>(\n\n  heap: Array<T>,\n  compareFn: CompareFunction<T>,\n): void {\n  for (let i = Math.floor(heap.length / 2) - 1; i >= 0; i--) {\n    heapSiftDown(heap, i, compareFn);\n  }\n}\n\n/**\n * Insert an item into a heap if it's \"smaller\" (in regards to `compareFn`) than\n * the current head of the heap (which is the \"largest\" value in the heap). If\n * the item is inserted, the previous head of the heap is returned, otherwise\n * `undefined` is returned and the heap is unchanged.\n *\n * @param heap - A *mutable* array representing a heap (see `heapify`).\n * @param compareFn - The comparator used to order items in the heap. Use the.\n * @param item - The item to be inserted into the heap.\n * @returns `undefined` if the heap is unchanged, or the previous head of the\n * heap if the item was inserted.\n */\nexport function heapMaybeInsert<T>(\n\n  heap: Array<T>,\n  compareFn: CompareFunction<T>,\n  item: T,\n): T | undefined {\n  if (!hasAtLeast(heap, 1)) {\n    return undefined;\n  }\n\n  const [head] = heap;\n\n  if (compareFn(item, head) >= 0) {\n    // The item shouldn't be inserted into the heap, the heap is unchanged.\n    return undefined;\n  }\n\n  heap[0] = item;\n  heapSiftDown(heap, 0, compareFn);\n  return head;\n}\n\n/**\n * The main heap operation. Takes a `heap` and an `index` and sifts the item\n * down the heap until it reaches the correct position based on `compareFn`,\n * swapping other items in the process.\n */\nfunction heapSiftDown<T>(\n\n  heap: Array<T>,\n  index: number,\n  compareFn: CompareFunction<T>,\n): void {\n  let currentIndex = index;\n\n  // The loop continues while the currentIndex has children in the heap.\n  while (currentIndex * 2 + 1 < heap.length) {\n    const firstChildIndex = currentIndex * 2 + 1;\n\n    let swapIndex\n      = compareFn(heap[currentIndex]!, heap[firstChildIndex]!) < 0\n        // Is the parent \"smaller\" (in regards to `compareFn`) to its child?\n        ? firstChildIndex\n        : currentIndex;\n\n    const secondChildIndex = firstChildIndex + 1;\n    if (\n      secondChildIndex < heap.length\n      && compareFn(heap[swapIndex]!, heap[secondChildIndex]!) < 0\n    ) {\n      // Is there a second child? Is it the smallest of the three?\n      swapIndex = secondChildIndex;\n    }\n\n    if (swapIndex === currentIndex) {\n      // We assume the array is a heap and the existing order of items satisfies\n      // the compareFn so we can stop here.\n      return;\n    }\n\n    swapInPlace(heap, currentIndex, swapIndex);\n\n    currentIndex = swapIndex;\n  }\n}\n"],"mappings":"kHAiBA,SAAgB,EAEd,EACA,EACM,CACN,IAAK,IAAI,EAAI,KAAK,MAAM,EAAK,OAAS,EAAE,CAAG,EAAG,GAAK,EAAG,IACpD,EAAa,EAAM,EAAG,EAAU,CAgBpC,SAAgB,EAEd,EACA,EACA,EACe,CACf,GAAI,CAAC,EAAW,EAAM,EAAE,CACtB,OAGF,GAAM,CAAC,GAAQ,EAEX,OAAU,EAAM,EAAK,EAAI,GAO7B,MAFA,GAAK,GAAK,EACV,EAAa,EAAM,EAAG,EAAU,CACzB,EAQT,SAAS,EAEP,EACA,EACA,EACM,CACN,IAAI,EAAe,EAGnB,KAAO,EAAe,EAAI,EAAI,EAAK,QAAQ,CACzC,IAAM,EAAkB,EAAe,EAAI,EAEvC,EACA,EAAU,EAAK,GAAgB,EAAK,GAAkB,CAAG,EAEvD,EACA,EAEA,EAAmB,EAAkB,EAS3C,GAPE,EAAmB,EAAK,QACrB,EAAU,EAAK,GAAa,EAAK,GAAmB,CAAG,IAG1D,EAAY,GAGV,IAAc,EAGhB,OAGF,EAAY,EAAM,EAAc,EAAU,CAE1C,EAAe"}

package/dist/heap-CpdbyWAN.cjs

@@ -0,0 +1 @@
+const e=require(`./has-at-least-D-ahiJB6.cjs`),t=require(`./swap-in-place-CJrU2n1_.cjs`);function n(e,t){for(let n=Math.floor(e.length/2)-1;n>=0;n--)i(e,n,t)}function r(t,n,r){if(!e.hasAtLeast(t,1))return;let[a]=t;if(!(n(r,a)>=0))return t[0]=r,i(t,0,n),a}function i(e,n,r){let i=n;for(;i*2+1<e.length;){let n=i*2+1,a=r(e[i],e[n])<0?n:i,o=n+1;if(o<e.length&&r(e[a],e[o])<0&&(a=o),a===i)return;t.swapInPlace(e,i,a),i=a}}Object.defineProperty(exports,`heapMaybeInsert`,{enumerable:!0,get:function(){return r}}),Object.defineProperty(exports,`heapify`,{enumerable:!0,get:function(){return n}});

package/dist/human-readable-file-size-BtprvwQj.cjs

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

package/dist/human-readable-file-size-C2gHuBVX.d.ts

@@ -0,0 +1,17 @@
+//#region src/human-readable-file-size.d.ts
+/**
+ * Returns human readable file size.
+ *
+ * @param bytes the file size in bytes
+ * @param base the base (1000 or 1024)
+ * @signature
+ *  P.humanReadableFileSize(bytes, base)
+ * @example
+ *  P.humanReadableFileSize(1000); // => '1.0 kB'
+ *  P.humanReadableFileSize(2097152, 1024); // => '2.0 Mib'
+ * @category String
+ */
+declare function humanReadableFileSize(bytes: number, base?: 1000 | 1024): string;
+//#endregion
+export { humanReadableFileSize };
+//# sourceMappingURL=human-readable-file-size-C2gHuBVX.d.ts.map

package/dist/human-readable-file-size-C2gHuBVX.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"human-readable-file-size-C2gHuBVX.d.ts","names":[],"sources":["../src/human-readable-file-size.ts"],"sourcesContent":[],"mappings":";;AAYA;;;;;;;;;;;iBAAgB,qBAAA"}

package/dist/human-readable-file-size-CPeHO1Te.js

@@ -0,0 +1,2 @@
+function e(e,t=1e3){if(e<t)return`${e} B`;let n=t===1024?[`Ki`,`Mi`,`Gi`]:[`k`,`M`,`G`],r=-1;for(;Math.abs(e)>=t&&r<n.length-1;)e/=t,++r;return`${e.toFixed(1)} ${n[r]}B`}export{e as humanReadableFileSize};
+//# sourceMappingURL=human-readable-file-size-CPeHO1Te.js.map

package/dist/human-readable-file-size-CPeHO1Te.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"human-readable-file-size-CPeHO1Te.js","names":[],"sources":["../src/human-readable-file-size.ts"],"sourcesContent":["/**\n * Returns human readable file size.\n *\n * @param bytes the file size in bytes\n * @param base the base (1000 or 1024)\n * @signature\n *  P.humanReadableFileSize(bytes, base)\n * @example\n *  P.humanReadableFileSize(1000); // => '1.0 kB'\n *  P.humanReadableFileSize(2097152, 1024); // => '2.0 Mib'\n * @category String\n */\nexport function humanReadableFileSize(bytes: number, base: 1000 | 1024 = 1000): string {\n  if (bytes < base) {\n    return `${bytes} B`;\n  }\n\n  const prefix = base === 1024 ? ['Ki', 'Mi', 'Gi'] : ['k', 'M', 'G'];\n  let unit = -1;\n\n  while (Math.abs(bytes) >= base && unit < prefix.length - 1) {\n    bytes /= base;\n    ++unit;\n  }\n\n  return `${bytes.toFixed(1)} ${prefix[unit]}B`;\n}\n"],"mappings":"AAYA,SAAgB,EAAsB,EAAe,EAAoB,IAAc,CACrF,GAAI,EAAQ,EACV,MAAO,GAAG,EAAM,IAGlB,IAAM,EAAS,IAAS,KAAO,CAAC,KAAM,KAAM,KAAK,CAAG,CAAC,IAAK,IAAK,IAAI,CAC/D,EAAO,GAEX,KAAO,KAAK,IAAI,EAAM,EAAI,GAAQ,EAAO,EAAO,OAAS,GACvD,GAAS,EACT,EAAE,EAGJ,MAAO,GAAG,EAAM,QAAQ,EAAE,CAAC,GAAG,EAAO,GAAM"}

package/dist/human-readable-file-size-DtwHNZes.d.cts

@@ -0,0 +1,17 @@
+//#region src/human-readable-file-size.d.ts
+/**
+ * Returns human readable file size.
+ *
+ * @param bytes the file size in bytes
+ * @param base the base (1000 or 1024)
+ * @signature
+ *  P.humanReadableFileSize(bytes, base)
+ * @example
+ *  P.humanReadableFileSize(1000); // => '1.0 kB'
+ *  P.humanReadableFileSize(2097152, 1024); // => '2.0 Mib'
+ * @category String
+ */
+declare function humanReadableFileSize(bytes: number, base?: 1000 | 1024): string;
+//#endregion
+export { humanReadableFileSize };
+//# sourceMappingURL=human-readable-file-size-DtwHNZes.d.cts.map

package/dist/human-readable-file-size-DtwHNZes.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"human-readable-file-size-DtwHNZes.d.cts","names":[],"sources":["../src/human-readable-file-size.ts"],"sourcesContent":[],"mappings":";;AAYA;;;;;;;;;;;iBAAgB,qBAAA"}

package/dist/human-readable-file-size.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY7RFTHSRcjs = require('./chunk-Y7RFTHSR.cjs');require('./chunk-MBGSSEZN.cjs');exports.humanReadableFileSize = _chunkY7RFTHSRcjs.a;
+const e=require(`./human-readable-file-size-BtprvwQj.cjs`);exports.humanReadableFileSize=e.humanReadableFileSize;

package/dist/human-readable-file-size.d.cts

@@ -1,15 +1,2 @@
-/**
- * Returns human readable file size.
- *
- * @param bytes the file size in bytes
- * @param base the base (1000 or 1024)
- * @signature
- *  P.humanReadableFileSize(bytes, base)
- * @example
- *  P.humanReadableFileSize(1000); // => '1.0 kB'
- *  P.humanReadableFileSize(2097152, 1024); // => '2.0 Mib'
- * @category String
- */
-declare function humanReadableFileSize(bytes: number, base?: 1000 | 1024): string;
-
-export { humanReadableFileSize };
+import { humanReadableFileSize } from "./human-readable-file-size-DtwHNZes.cjs";
+export { humanReadableFileSize };

package/dist/human-readable-file-size.d.ts

@@ -1,15 +1,2 @@
-/**
- * Returns human readable file size.
- *
- * @param bytes the file size in bytes
- * @param base the base (1000 or 1024)
- * @signature
- *  P.humanReadableFileSize(bytes, base)
- * @example
- *  P.humanReadableFileSize(1000); // => '1.0 kB'
- *  P.humanReadableFileSize(2097152, 1024); // => '2.0 Mib'
- * @category String
- */
-declare function humanReadableFileSize(bytes: number, base?: 1000 | 1024): string;
-
-export { humanReadableFileSize };
+import { humanReadableFileSize } from "./human-readable-file-size-C2gHuBVX.js";
+export { humanReadableFileSize };

package/dist/human-readable-file-size.js

@@ -1 +1 @@
-import{a}from"./chunk-4YJCXB4Y.js";import"./chunk-EK7ODJWE.js";export{a as humanReadableFileSize};
+import{humanReadableFileSize as e}from"./human-readable-file-size-CPeHO1Te.js";export{e as humanReadableFileSize};

package/dist/identity-BAryUWbs.cjs

@@ -0,0 +1 @@
+function e(){return t}function t(e,...t){return e}Object.defineProperty(exports,`identity`,{enumerable:!0,get:function(){return e}});

package/dist/identity-BwbmOFJX.d.ts

@@ -0,0 +1,22 @@
+//#region src/identity.d.ts
+/**
+ * A function that returns the first argument passed to it.
+ *
+ * Notice that this is a dataLast impl where the function needs to be invoked
+ * to get the "do nothing" function.
+ *
+ * See also:
+ * `doNothing` - A function that doesn't return anything.
+ * `constant` - A function that ignores the input arguments and returns the same value on every invocation.
+ *
+ * @signature
+ *    P.identity();
+ * @example
+ *    P.map([1,2,3], P.identity()); // => [1,2,3]
+ * @category Function
+ */
+declare function identity(): typeof identityImplementation;
+declare function identityImplementation<T, Args extends ReadonlyArray<unknown>>(value: T, ..._args: Args): T;
+//#endregion
+export { identity };
+//# sourceMappingURL=identity-BwbmOFJX.d.ts.map

package/dist/identity-BwbmOFJX.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"identity-BwbmOFJX.d.ts","names":[],"sources":["../src/identity.ts"],"sourcesContent":[],"mappings":";;AAgBA;AAQC;;;;;;;;;;;;;;iBARe,QAAA,CAAA,UAAmB;iBAU1B,uCAAuC,+BACvC,aAEG,OACT"}

package/dist/identity-CPDLj9Cq.d.cts

@@ -0,0 +1,22 @@
+//#region src/identity.d.ts
+/**
+ * A function that returns the first argument passed to it.
+ *
+ * Notice that this is a dataLast impl where the function needs to be invoked
+ * to get the "do nothing" function.
+ *
+ * See also:
+ * `doNothing` - A function that doesn't return anything.
+ * `constant` - A function that ignores the input arguments and returns the same value on every invocation.
+ *
+ * @signature
+ *    P.identity();
+ * @example
+ *    P.map([1,2,3], P.identity()); // => [1,2,3]
+ * @category Function
+ */
+declare function identity(): typeof identityImplementation;
+declare function identityImplementation<T, Args extends ReadonlyArray<unknown>>(value: T, ..._args: Args): T;
+//#endregion
+export { identity };
+//# sourceMappingURL=identity-CPDLj9Cq.d.cts.map

package/dist/identity-CPDLj9Cq.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"identity-CPDLj9Cq.d.cts","names":[],"sources":["../src/identity.ts"],"sourcesContent":[],"mappings":";;AAgBA;AAQC;;;;;;;;;;;;;;iBARe,QAAA,CAAA,UAAmB;iBAU1B,uCAAuC,+BACvC,aAEG,OACT"}

package/dist/identity-D7NWGnLw.js

@@ -0,0 +1,2 @@
+function e(){return t}function t(e,...t){return e}export{e as identity};
+//# sourceMappingURL=identity-D7NWGnLw.js.map

package/dist/identity-D7NWGnLw.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"identity-D7NWGnLw.js","names":[],"sources":["../src/identity.ts"],"sourcesContent":["/**\n * A function that returns the first argument passed to it.\n *\n * Notice that this is a dataLast impl where the function needs to be invoked\n * to get the \"do nothing\" function.\n *\n * See also:\n * `doNothing` - A function that doesn't return anything.\n * `constant` - A function that ignores the input arguments and returns the same value on every invocation.\n *\n * @signature\n *    P.identity();\n * @example\n *    P.map([1,2,3], P.identity()); // => [1,2,3]\n * @category Function\n */\nexport function identity(): typeof identityImplementation {\n  /**\n   * Notice that the exported identity function is just the \"factory\" for the\n   * function. We do it this way so that all \"Function\" utilities have a similar\n   * API where the function is called, and not just used \"headless\". e.g.\n   * `doNothing()` and not `doNothing`, just like the API for `constant(1)`.\n   */\n  return identityImplementation;\n}\n\nfunction identityImplementation<T, Args extends ReadonlyArray<unknown>>(\n  value: T,\n  // Ignore any extra arguments provided to the function call\n  ..._args: Args\n): T {\n  return value;\n};\n"],"mappings":"AAgBA,SAAgB,GAA0C,CAOxD,OAAO,EAGT,SAAS,EACP,EAEA,GAAG,EACA,CACH,OAAO"}

package/dist/identity.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkAQRYBCA3cjs = require('./chunk-AQRYBCA3.cjs');require('./chunk-MBGSSEZN.cjs');exports.identity = _chunkAQRYBCA3cjs.a;
+const e=require(`./identity-BAryUWbs.cjs`);exports.identity=e.identity;

package/dist/identity.d.cts

@@ -1,20 +1,2 @@
-/**
- * A function that returns the first argument passed to it.
- *
- * Notice that this is a dataLast impl where the function needs to be invoked
- * to get the "do nothing" function.
- *
- * See also:
- * `doNothing` - A function that doesn't return anything.
- * `constant` - A function that ignores the input arguments and returns the same value on every invocation.
- *
- * @signature
- *    P.identity();
- * @example
- *    P.map([1,2,3], P.identity()); // => [1,2,3]
- * @category Function
- */
-declare function identity(): typeof identityImplementation;
-declare function identityImplementation<T, Args extends ReadonlyArray<unknown>>(value: T, ..._args: Args): T;
-
-export { identity };
+import { identity } from "./identity-CPDLj9Cq.cjs";
+export { identity };