@vinicunca/perkakas 1.12.0 → 1.13.0

package/dist/is-emptyish-DVFGJe-T.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"is-emptyish-DVFGJe-T.d.ts","names":[],"sources":["../src/internal/types/has-writable-keys.ts","../src/is-emptyish.ts"],"sourcesContent":[],"mappings":";;;;KAGY,qBAIR,QAAQ,SAAS,IAAI;;;cCUX;ADdd,KCqBK,KDrBO,CAAA,CAAA,CAAA,GCqBI,MDrBW,CCqBJ,CDrBI,EAAA,OCqBM,cDrBN,CAAA;KCyBtB,QDrBgB,CAAA,CAAA,CAAA,GAAA,CCuBd,CDvBc,SAAA,MAAA,GAAA,EAAA,GAAA,KAAA,CAAA,GAAA,CCwBd,CDxBc,SAAA,MAAA,GCwBK,kBDxBL,CCwBwB,CDxBxB,CAAA,GAAA,KAAA,CAAA,GAAA,CCyBd,CDzBc,SAAA,IAAA,GAAA,IAAA,GAAA,KAAA,CAAA,GAAA,CC0Bd,CD1Bc,SAAA,SAAA,GAAA,SAAA,GAAA,KAAA,CAAA;KC+BhB,kBD/BO,CAAA,UAAA,MAAA,CAAA,GCgCR,CDhCQ,SCgCE,aDhCF,CAAA,OAAA,CAAA,GCiCN,aDjCM,CCiCQ,CDjCR,CAAA,GCkCN,CDlCM,SCkCI,WDlCJ,CAAA,KAAA,IAAA,EAAA,OAAA,CAAA,GCmCJ,CDnCI,SCmCM,GDnCN,CAAA,OAAA,EAAA,OAAA,CAAA,GCqCF,KDrCE,CCqCI,CDrCJ,CAAA,GCuCF,WDvCE,CCuCU,GDvCV,EAAA,KAAA,CAAA,GCwCJ,CDxCI,SCwCM,WDxCN,CAAA,OAAA,CAAA,GCyCF,CDzCE,SCyCQ,GDzCR,CAAA,OAAA,CAAA,GC2CA,KD3CA,CC2CM,CD3CN,CAAA,GC6CA,WD7CA,CAAA,KAAA,CAAA,GC8CF,cD9CE,CC8Ca,CD9Cb,CAAA;KCgDP,aDhDoB,CAAA,UCgDI,aDhDJ,CAAA,OAAA,CAAA,CAAA,GCgD8B,CDhD9B,SAAA,SAAA,EAAA,GCkDrB,CDlDqB,GCmDrB,GDnDqB,CCoDrB,ODpDqB,CCoDb,UDpDa,CCoDF,CDpDE,CAAA,CAAA,UAAA,CAAA,EAAA,EAAA,CAAA,ECqDrB,ODrDqB,CCqDb,UDrDa,CCqDF,CDrDE,CAAA,CAAA,QAAA,CAAA,EAAA,EAAA,CAAA,CAAA,SAAA,IAAA,GCuDnB,CDvDmB,SCuDT,KDvDS,CAAA,OAAA,CAAA,GCyDjB,KDzDiB,CCyDX,CDzDW,CAAA,GAAA,SAAA,EAAA,GAAA,KAAA;KCgEpB,cDhED,CAAA,UAAA,MAAA,CAAA,GCgEoC,CDhEpC,SAAA;EAAO,MAAA,EAAA,KAAA,gBAAA,MAAA;ICmEP,2BAOE,kBAAkB,GAAG,UACvB;;IAGE,kBAAkB,GAAG,QACrB,QAAQ,QAAQ,mBAGd,IACA,gBAAgB,mBAAmB,2BAIjC,gBAAgB,kBAEd,MAAM,sBA/EJ,MAiFqB,CAjFQ,GAAA,KAAA,EAAA;KAsFtC,iBA/EkB,CAAA,CAAA,EAAA,CAAA,CAAA,GAgFnB,gBAhFmB,CAgFF,CAhFE,CAAA,SAAA,IAAA,GAAA,CAAA,CAAA,CAAA,SAAA,CAiFJ,CAjFI,CAAA,GAAA,CAkFZ,CAlFY,CAAA,SAAA,CAAA,CAAA,CAAA,GAqFT,CArFS,GAwFT,KAxFS,CAwFH,CAxFG,CAAA,GAAA,KAAA,GA8FjB,KA9FiB,CA8FX,CA9FW,CAAA;KAmGlB,eAnG4B,CAAA,CAAA,CAAA,GAmGP,EAnGO,CAoG/B,EApG+B,CAoG5B,KApG4B,CAoGtB,CApGsB,CAAA,EAoGlB,SApGkB,CAoGR,CApGQ,CAAA,CAAA,EAqG/B,OArG+B,CAsG7B,CAtG6B,EAAA,CAAA,CAAA,CAAA,CAAA;;;AAAX;;;;;;;;AASd;;;;;;;;;;;;;;;;;;;;;;;AAoBgB;;;;;;;;;;;;;;;;AAkBnB,iBA8GW,UA9GG,CAAA,CAAA,CAAA,CAAA,IAAA,EA+GX,eA/GW,CA+GK,CA/GL,CAAA,SAAA,IAAA,GAAA,KAAA,GAiHb,CAjHa,GAiHT,QAjHS,CAiHA,QAjHA,CAiHS,OAjHT,CAiHiB,CAjHjB,CAAA,CAAA,CAAA,CAAA,EAAA,IAAA,IAkHR,eAlHQ,CAkHQ,CAlHR,CAAA,SAAA,IAAA,GAAA,KAAA,GAoHf,CApHe,SAAA,OAAA,GAqHb,QArHa,CAqHJ,OArHI,CAqHI,CArHJ,CAAA,CAAA,GAAA,KAAA;AAAqB,iBAuHxB,UAAA,CAvHwB,IAAA,EAAA,OAAA,CAAA,EAAA,OAAA"}

package/dist/is-emptyish.d.cts

@@ -1,2 +1,2 @@
-import { t as isEmptyish } from "./is-emptyish-oX5mpcfW.cjs";
+import { t as isEmptyish } from "./is-emptyish-9tX94IVx.cjs";
 export { isEmptyish };

package/dist/is-emptyish.d.ts

@@ -1,2 +1,2 @@
-import { t as isEmptyish } from "./is-emptyish-CIxZzxxz.js";
+import { t as isEmptyish } from "./is-emptyish-DVFGJe-T.js";
 export { isEmptyish };

package/dist/is-emptyish.js.map

@@ -1 +1 @@
-{"version":3,"file":"is-emptyish.js","names":[],"sources":["../src/is-emptyish.ts"],"sourcesContent":["import type {\n  And,\n  HasRequiredKeys,\n  IsAny,\n  IsEqual,\n  IsNever,\n  IsNumericLiteral,\n  IsUnknown,\n  OmitIndexSignature,\n  Or,\n  Tagged,\n  ValueOf,\n} from 'type-fest';\nimport type { HasWritableKeys } from './internal/types/has-writable-keys';\nimport type { NoInfer } from './internal/types/no-infer';\nimport type { TupleParts } from './internal/types/tuple-parts';\n\n// eslint-disable-next-line ts/no-unused-vars -- we use a non-exported unique symbol to prevent users from faking our return type.\ndeclare const EMPTYISH_BRAND: unique symbol;\n\n// Because our function is a type-predicate and it narrows the input based on\n// the result of our type, we sometimes need a way to \"turn off\" narrowing while\n// still returning the input type. By tagging/branding our return type we stop\n// TypeScript from narrowing it while still allowing it to be used as if it was\n// the input type (because it still extends the type).\ntype Empty<T> = Tagged<T, typeof EMPTYISH_BRAND>;\n\n// The goal of this type is to return the empty \"view\" of the input type. This\n// makes it possible for TypeScript to narrow it precisely.\ntype Emptyish<T>\n  // There are effectively 4 types that can be empty:\n  = | (T extends string ? '' : never)\n    | (T extends object ? EmptyishObjectLike<T> : never)\n    | (T extends null ? null : never)\n    | (T extends undefined ? undefined : never);\n\n// Because of TypeScript's duck-typing, a lot of sub-types of `object` can\n// extend each other so we need to cascade between the different \"kinds\" of\n// objects.\ntype EmptyishObjectLike<T extends object>\n  = T extends ReadonlyArray<unknown>\n    ? EmptyishArray<T>\n    : T extends ReadonlyMap<infer Key, unknown>\n      ? T extends Map<unknown, unknown>\n        // Mutable maps should remain mutable so we can't narrow them down.\n        ? Empty<T>\n        // But immutable maps could be rewritten to prevent any mutations.\n        : ReadonlyMap<Key, never>\n      : T extends ReadonlySet<unknown>\n        ? T extends Set<unknown>\n          // Mutable sets should remain mutable so we can't narrow them down.\n          ? Empty<T>\n          // But immutable sets could be rewritten to prevent any mutations.\n          : ReadonlySet<never>\n        : EmptyishObject<T>;\n\ntype EmptyishArray<T extends ReadonlyArray<unknown>> = T extends readonly []\n  // By returning T we effectively narrow the \"else\" branch to `never`.\n  ? T\n  : And<\n    IsEqual<TupleParts<T>['required'], []>,\n    IsEqual<TupleParts<T>['suffix'], []>\n  > extends true\n    ? T extends Array<unknown>\n      // A mutable array should remain mutable so we can't narrow it down.\n      ? Empty<T>\n      // But immutable arrays could be rewritten to prevent any mutations.\n      : readonly []\n    // An array with a required prefix or suffix would never be empty, we can\n    // use that fact to narrow the \"if\" branch to `never`.\n    : never;\n\ntype EmptyishObject<T extends object> = T extends {\n  length: infer Length extends number;\n}\n  ? T extends string\n    // When a string is tagged/branded it also extends `object` and also has\n    // a `length` prop so we need to prevent handling it because it's\n    // irrelevant here!\n    ? never\n    // Because of how the implementation works, we need to consider any object\n    // with a `length` prop as potentially \"empty\".\n    : EmptyishArbitrary<T, Length>\n  : T extends { size: infer Size extends number }\n    // Because of how the implementation works, we need to consider any object\n    // with a `size` prop as potentially \"empty\".\n    ? EmptyishArbitrary<T, Size>\n    : IsNever<ValueOf<T>> extends true\n      // This handles empty objects; by returning T we effectively narrow the\n      // \"else\" branch to `never`.\n      ? T\n      : HasRequiredKeys<OmitIndexSignature<T>> extends true\n        // If the object has required keys it can never be empty, we can use\n        // that fact to narrow the \"if\" branch to `never`.\n        ? never\n        : HasWritableKeys<T> extends true\n          // A mutable object should remain mutable so we can't narrow it down.\n          ? Empty<T>\n          // But immutable objects could be rewritten to prevent any mutations.\n          : { readonly [P in keyof T]: never };\n\n// We use certain props to check for emptiness effectively, but that means we\n// will return those values for any object that has them. Because we don't know\n// anything about those objects we need to be careful about narrowing.\ntype EmptyishArbitrary<T, N>\n  = IsNumericLiteral<N> extends true\n    ? [0] extends [N]\n        ? [N] extends [0]\n            // If the prop is a literal 0 the object is and always will be empty\n            // so we can return it to narrow the \"else\" branch as `never`.\n            ? T\n            // If it accepts 0, but might accept other values too we need to\n            // consider the object mutable and not narrow it down.\n            : Empty<T>\n        // If the prop will never be 0 we can say it will never be empty and can\n        // return `never` for the \"if\" branch.\n        : never\n    // If the prop isn't a literal value we don't know enough about the object\n    // and should consider it mutable.\n    : Empty<T>;\n\n// Overly generic types interfere with our already pretty complex return type.\n// To make our lives easier we can filter them out at the function declaration\n// step and we never need to think about them again.\ntype ShouldNotNarrow<T> = Or<\n  Or<IsAny<T>, IsUnknown<T>>,\n  IsEqual<\n    T,\n    // eslint-disable-next-line ts/no-empty-object-type\n    {}\n  >\n>;\n\n/**\n * A function that checks if the input is empty. Empty is defined as anything\n * exposing a numerical `length`, or `size` property that is equal to `0`. This\n * definition covers strings, arrays, Maps, Sets, plain objects, and custom\n * classes. Additionally, `null` and `undefined` are also considered empty.\n *\n * `number`, `bigint`, `boolean`, `symbol`, and `function` will always return\n * `false`. `RegExp`, `Date`, and weak collections will always return `true`.\n * Classes and Errors are treated as plain objects: if they expose any public\n * property they would be considered non-empty, unless they expose a numerical\n * `length` or `size` property, which defines their emptiness regardless of\n * other properties.\n *\n * This function has *limited* utility at the type level because **negating** it\n * does not yield a useful type in most cases because of TypeScript\n * limitations. Additionally, utilities which accept a narrower input type\n * provide better type-safety on their inputs. In most cases, you should use\n * one of the following functions instead:\n * `isEmpty` - provides better type-safety on inputs by accepting a narrower set of cases.\n * `hasAtLeast` - when the input is just an array/tuple.\n * `isStrictEqual` - when you just need to check for a specific literal value.\n * `isNullish` - when you just care about `null` and `undefined`.\n * `isTruthy` - when you need to also filter `number` and `boolean`.\n *\n * @param data - The variable to check.\n * @signature\n *    P.isEmptyish(data)\n * @example\n *    P.isEmptyish(undefined); //=> true\n *    P.isEmptyish(null); //=> true\n *    P.isEmptyish(''); //=> true\n *    P.isEmptyish([]); //=> true\n *    P.isEmptyish({}); //=> true\n *    P.isEmptyish(new Map()); //=> true\n *    P.isEmptyish(new Set()); //=> true\n *    P.isEmptyish({ a: \"hello\", size: 0 }); //=> true\n *    P.isEmptyish(/abc/); //=> true\n *    P.isEmptyish(new Date()); //=> true\n *    P.isEmptyish(new WeakMap()); //=> true\n *\n *    P.isEmptyish('test'); //=> false\n *    P.isEmptyish([1, 2, 3]); //=> false\n *    P.isEmptyish({ a: \"hello\" }); //=> false\n *    P.isEmptyish({ length: 1 }); //=> false\n *    P.isEmptyish(0); //=> false\n *    P.isEmptyish(true); //=> false\n *    P.isEmptyish(() => {}); //=> false\n * @category Guard\n */\nexport function isEmptyish<T>(\n  data: ShouldNotNarrow<T> extends true\n    ? never\n    : T | Readonly<Emptyish<NoInfer<T>>>,\n): data is ShouldNotNarrow<T> extends true\n  ? never\n  : T extends unknown\n    ? Emptyish<NoInfer<T>>\n    : never;\nexport function isEmptyish(data: unknown): boolean;\n\nexport function isEmptyish(data: unknown): boolean {\n  // eslint-disable-next-line eqeqeq -- Less code to ship.\n  if (data == undefined || data === '') {\n    // These are the only literal values that are considered emptyish.\n    return true;\n  }\n\n  if (typeof data !== 'object') {\n    // There are no non-object types that could be empty at this point...\n    return false;\n  }\n\n  if ('length' in data && typeof data.length === 'number') {\n    // Arrays and array-likes.\n    return data.length === 0;\n  }\n\n  if ('size' in data && typeof data.size === 'number') {\n    // Maps and Sets.\n    return data.size === 0;\n  }\n\n  // eslint-disable-next-line no-unreachable-loop, no-restricted-syntax -- Instead of taking Object.keys just to check its length, which will be inefficient if the object has a lot of keys, we have a backdoor into an iterator of the object's properties via the `for...in` loop.\n  for (const _ in data) {\n    return false;\n  }\n\n  // We can't do a similar optimization for symbol props, so we leave them for\n  // the very last check when the object is practically empty. Assuming that\n  // even if an object has a symbol prop, it probably doesn't have thousands of\n  // them.\n  return Object.getOwnPropertySymbols(data).length === 0;\n}\n"],"mappings":"AAiMA,SAAgB,EAAW,EAAwB,CAEjD,GAAI,GAAQ,MAAa,IAAS,GAEhC,MAAO,GAGT,GAAI,OAAO,GAAS,SAElB,MAAO,GAGT,GAAI,WAAY,GAAQ,OAAO,EAAK,QAAW,SAE7C,OAAO,EAAK,SAAW,EAGzB,GAAI,SAAU,GAAQ,OAAO,EAAK,MAAS,SAEzC,OAAO,EAAK,OAAS,EAIvB,IAAK,IAAM,KAAK,EACd,MAAO,GAOT,OAAO,OAAO,sBAAsB,EAAK,CAAC,SAAW"}
+{"version":3,"file":"is-emptyish.js","names":[],"sources":["../src/is-emptyish.ts"],"sourcesContent":["import type {\n  And,\n  HasRequiredKeys,\n  IsAny,\n  IsEqual,\n  IsNever,\n  IsNumericLiteral,\n  IsUnknown,\n  OmitIndexSignature,\n  Or,\n  Tagged,\n  ValueOf,\n} from 'type-fest';\nimport type { HasWritableKeys } from './internal/types/has-writable-keys';\nimport type { TupleParts } from './internal/types/tuple-parts';\n\n// eslint-disable-next-line ts/no-unused-vars -- we use a non-exported unique symbol to prevent users from faking our return type.\ndeclare const EMPTYISH_BRAND: unique symbol;\n\n// Because our function is a type-predicate and it narrows the input based on\n// the result of our type, we sometimes need a way to \"turn off\" narrowing while\n// still returning the input type. By tagging/branding our return type we stop\n// TypeScript from narrowing it while still allowing it to be used as if it was\n// the input type (because it still extends the type).\ntype Empty<T> = Tagged<T, typeof EMPTYISH_BRAND>;\n\n// The goal of this type is to return the empty \"view\" of the input type. This\n// makes it possible for TypeScript to narrow it precisely.\ntype Emptyish<T>\n  // There are effectively 4 types that can be empty:\n  = | (T extends string ? '' : never)\n    | (T extends object ? EmptyishObjectLike<T> : never)\n    | (T extends null ? null : never)\n    | (T extends undefined ? undefined : never);\n\n// Because of TypeScript's duck-typing, a lot of sub-types of `object` can\n// extend each other so we need to cascade between the different \"kinds\" of\n// objects.\ntype EmptyishObjectLike<T extends object>\n  = T extends ReadonlyArray<unknown>\n    ? EmptyishArray<T>\n    : T extends ReadonlyMap<infer Key, unknown>\n      ? T extends Map<unknown, unknown>\n        // Mutable maps should remain mutable so we can't narrow them down.\n        ? Empty<T>\n        // But immutable maps could be rewritten to prevent any mutations.\n        : ReadonlyMap<Key, never>\n      : T extends ReadonlySet<unknown>\n        ? T extends Set<unknown>\n          // Mutable sets should remain mutable so we can't narrow them down.\n          ? Empty<T>\n          // But immutable sets could be rewritten to prevent any mutations.\n          : ReadonlySet<never>\n        : EmptyishObject<T>;\n\ntype EmptyishArray<T extends ReadonlyArray<unknown>> = T extends readonly []\n  // By returning T we effectively narrow the \"else\" branch to `never`.\n  ? T\n  : And<\n    IsEqual<TupleParts<T>['required'], []>,\n    IsEqual<TupleParts<T>['suffix'], []>\n  > extends true\n    ? T extends Array<unknown>\n      // A mutable array should remain mutable so we can't narrow it down.\n      ? Empty<T>\n      // But immutable arrays could be rewritten to prevent any mutations.\n      : readonly []\n    // An array with a required prefix or suffix would never be empty, we can\n    // use that fact to narrow the \"if\" branch to `never`.\n    : never;\n\ntype EmptyishObject<T extends object> = T extends {\n  length: infer Length extends number;\n}\n  ? T extends string\n    // When a string is tagged/branded it also extends `object` and also has\n    // a `length` prop so we need to prevent handling it because it's\n    // irrelevant here!\n    ? never\n    // Because of how the implementation works, we need to consider any object\n    // with a `length` prop as potentially \"empty\".\n    : EmptyishArbitrary<T, Length>\n  : T extends { size: infer Size extends number }\n    // Because of how the implementation works, we need to consider any object\n    // with a `size` prop as potentially \"empty\".\n    ? EmptyishArbitrary<T, Size>\n    : IsNever<ValueOf<T>> extends true\n      // This handles empty objects; by returning T we effectively narrow the\n      // \"else\" branch to `never`.\n      ? T\n      : HasRequiredKeys<OmitIndexSignature<T>> extends true\n        // If the object has required keys it can never be empty, we can use\n        // that fact to narrow the \"if\" branch to `never`.\n        ? never\n        : HasWritableKeys<T> extends true\n          // A mutable object should remain mutable so we can't narrow it down.\n          ? Empty<T>\n          // But immutable objects could be rewritten to prevent any mutations.\n          : { readonly [P in keyof T]: never };\n\n// We use certain props to check for emptiness effectively, but that means we\n// will return those values for any object that has them. Because we don't know\n// anything about those objects we need to be careful about narrowing.\ntype EmptyishArbitrary<T, N>\n  = IsNumericLiteral<N> extends true\n    ? [0] extends [N]\n        ? [N] extends [0]\n            // If the prop is a literal 0 the object is and always will be empty\n            // so we can return it to narrow the \"else\" branch as `never`.\n            ? T\n            // If it accepts 0, but might accept other values too we need to\n            // consider the object mutable and not narrow it down.\n            : Empty<T>\n        // If the prop will never be 0 we can say it will never be empty and can\n        // return `never` for the \"if\" branch.\n        : never\n    // If the prop isn't a literal value we don't know enough about the object\n    // and should consider it mutable.\n    : Empty<T>;\n\n// Overly generic types interfere with our already pretty complex return type.\n// To make our lives easier we can filter them out at the function declaration\n// step and we never need to think about them again.\ntype ShouldNotNarrow<T> = Or<\n  Or<IsAny<T>, IsUnknown<T>>,\n  IsEqual<\n    T,\n    // eslint-disable-next-line ts/no-empty-object-type\n    {}\n  >\n>;\n\n/**\n * A function that checks if the input is empty. Empty is defined as anything\n * exposing a numerical `length`, or `size` property that is equal to `0`. This\n * definition covers strings, arrays, Maps, Sets, plain objects, and custom\n * classes. Additionally, `null` and `undefined` are also considered empty.\n *\n * `number`, `bigint`, `boolean`, `symbol`, and `function` will always return\n * `false`. `RegExp`, `Date`, and weak collections will always return `true`.\n * Classes and Errors are treated as plain objects: if they expose any public\n * property they would be considered non-empty, unless they expose a numerical\n * `length` or `size` property, which defines their emptiness regardless of\n * other properties.\n *\n * This function has *limited* utility at the type level because **negating** it\n * does not yield a useful type in most cases because of TypeScript\n * limitations. Additionally, utilities which accept a narrower input type\n * provide better type-safety on their inputs. In most cases, you should use\n * one of the following functions instead:\n * `isEmpty` - provides better type-safety on inputs by accepting a narrower set of cases.\n * `hasAtLeast` - when the input is just an array/tuple.\n * `isStrictEqual` - when you just need to check for a specific literal value.\n * `isNullish` - when you just care about `null` and `undefined`.\n * `isTruthy` - when you need to also filter `number` and `boolean`.\n *\n * @param data - The variable to check.\n * @signature\n *    P.isEmptyish(data)\n * @example\n *    P.isEmptyish(undefined); //=> true\n *    P.isEmptyish(null); //=> true\n *    P.isEmptyish(''); //=> true\n *    P.isEmptyish([]); //=> true\n *    P.isEmptyish({}); //=> true\n *    P.isEmptyish(new Map()); //=> true\n *    P.isEmptyish(new Set()); //=> true\n *    P.isEmptyish({ a: \"hello\", size: 0 }); //=> true\n *    P.isEmptyish(/abc/); //=> true\n *    P.isEmptyish(new Date()); //=> true\n *    P.isEmptyish(new WeakMap()); //=> true\n *\n *    P.isEmptyish('test'); //=> false\n *    P.isEmptyish([1, 2, 3]); //=> false\n *    P.isEmptyish({ a: \"hello\" }); //=> false\n *    P.isEmptyish({ length: 1 }); //=> false\n *    P.isEmptyish(0); //=> false\n *    P.isEmptyish(true); //=> false\n *    P.isEmptyish(() => {}); //=> false\n * @category Guard\n */\nexport function isEmptyish<T>(\n  data: ShouldNotNarrow<T> extends true\n    ? never\n    : T | Readonly<Emptyish<NoInfer<T>>>,\n): data is ShouldNotNarrow<T> extends true\n  ? never\n  : T extends unknown\n    ? Emptyish<NoInfer<T>>\n    : never;\nexport function isEmptyish(data: unknown): boolean;\n\nexport function isEmptyish(data: unknown): boolean {\n  // eslint-disable-next-line eqeqeq -- Less code to ship.\n  if (data == undefined || data === '') {\n    // These are the only literal values that are considered emptyish.\n    return true;\n  }\n\n  if (typeof data !== 'object') {\n    // There are no non-object types that could be empty at this point...\n    return false;\n  }\n\n  if ('length' in data && typeof data.length === 'number') {\n    // Arrays and array-likes.\n    return data.length === 0;\n  }\n\n  if ('size' in data && typeof data.size === 'number') {\n    // Maps and Sets.\n    return data.size === 0;\n  }\n\n  // eslint-disable-next-line no-unreachable-loop, no-restricted-syntax -- Instead of taking Object.keys just to check its length, which will be inefficient if the object has a lot of keys, we have a backdoor into an iterator of the object's properties via the `for...in` loop.\n  for (const _ in data) {\n    return false;\n  }\n\n  // We can't do a similar optimization for symbol props, so we leave them for\n  // the very last check when the object is practically empty. Assuming that\n  // even if an object has a symbol prop, it probably doesn't have thousands of\n  // them.\n  return Object.getOwnPropertySymbols(data).length === 0;\n}\n"],"mappings":"AAgMA,SAAgB,EAAW,EAAwB,CAEjD,GAAI,GAAQ,MAAa,IAAS,GAEhC,MAAO,GAGT,GAAI,OAAO,GAAS,SAElB,MAAO,GAGT,GAAI,WAAY,GAAQ,OAAO,EAAK,QAAW,SAE7C,OAAO,EAAK,SAAW,EAGzB,GAAI,SAAU,GAAQ,OAAO,EAAK,MAAS,SAEzC,OAAO,EAAK,OAAS,EAIvB,IAAK,IAAM,KAAK,EACd,MAAO,GAOT,OAAO,OAAO,sBAAsB,EAAK,CAAC,SAAW"}

package/dist/is-emptyish.test-d.cjs

@@ -1 +1 @@
-const e=require(`./dist-CiyBKPT6.cjs`),t=require(`./is-emptyish.cjs`);new Int8Array(1),Buffer.alloc(0),e.i(`strings`,()=>{e.o(`primitives`,()=>{let n=`test`;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`empty literal`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`non-empty literals`,()=>{let n=`test`;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`union of non-empty literals`,()=>{t.isEmptyish(`cat`),(0,e.t.expectTypeOf)(`cat`).toEqualTypeOf()}),e.o(`union with an empty literal`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`non-empty string templates`,()=>{let n=`prefix_0`;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`string template (with empty)`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`empty-able string template`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()})}),e.i(`branded`,()=>{e.o(`primitive`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`non-empty literal`,()=>{let n=`test`;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`empty literal`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`union of non-empty literals`,()=>{t.isEmptyish(`cat`),(0,e.t.expectTypeOf)(`cat`).toEqualTypeOf()}),e.o(`union of empty and non-empty literals`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()})}),e.i(`nullish`,()=>{e.o(`null`,()=>{t.isEmptyish(null),(0,e.t.expectTypeOf)(null).toEqualTypeOf()}),e.o(`undefined`,()=>{t.isEmptyish(void 0),(0,e.t.expectTypeOf)(void 0).toEqualTypeOf()}),e.o(`optional nullable`,()=>{t.isEmptyish(null),(0,e.t.expectTypeOf)(null).toEqualTypeOf()}),e.o(`optional primitive`,()=>{t.isEmptyish(void 0),(0,e.t.expectTypeOf)(void 0).toEqualTypeOf()}),e.o(`optional non-empty literal`,()=>{t.isEmptyish(`cat`),(0,e.t.expectTypeOf)(`cat`).toEqualTypeOf()}),e.o(`optional empty literal`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`nullable primitive`,()=>{t.isEmptyish(null),(0,e.t.expectTypeOf)(null).toEqualTypeOf()}),e.o(`nullable non-empty literal`,()=>{t.isEmptyish(`cat`),(0,e.t.expectTypeOf)(`cat`).toEqualTypeOf()}),e.o(`nullable empty literal`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`optional, nullable, empty, and non-empty`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()})}),e.i(`all tuple shapes`,()=>{e.o(`empty tuple`,()=>{let n=[];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`empty readonly tuple`,()=>{let n=[];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`fixed tuple`,()=>{let n=[1,2,3];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`fixed readonly tuple`,()=>{let n=[1,2,3];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`array`,()=>{let n=[];t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly array`,()=>{let n=[];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional tuple`,()=>{let n=[];t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly optional tuple`,()=>{let n=[];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`fixed-prefix array`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly fixed-prefix array`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`fixed-suffix array`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly fixed-suffix array`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`mixed tuples`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly mixed tuples`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional prefix arrays`,()=>{let n=[];t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly optional prefix arrays`,()=>{let n=[];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`fixed-elements array`,()=>{let n=[1,2];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly fixed-elements array`,()=>{let n=[1,2];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()})}),e.i(`array-like`,()=>{e.o(`typed arrays`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`buffers`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`sets`,()=>{let n=new Set;t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly sets`,()=>{let n=new Set;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o("array-like (e.g., `arguments`)",()=>{})}),e.i(`plain objects`,()=>{e.o(`never record`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly never record`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`plain object`,()=>{let n={a:123,b:`hello`};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly plain object`,()=>{let n={a:123,b:`hello`};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`unbounded record`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly unbounded record`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`partial bounded record`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly partial bounded record`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`partial and required props`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`required interfaces`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional interfaces`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional readonly interfaces`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`required prop and index signature`,()=>{let n={a:`hello`};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly required prop and index signature`,()=>{let n={a:`hello`};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional prop and index signature`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly optional prop and index signature`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`required symbol prop`,()=>{let n={[Symbol(`hello`)]:`world`};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional symbol prop`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly optional symbol prop`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()})}),e.i(`keyed collections`,()=>{e.o(`maps`,()=>{let n=new Map;t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly maps`,()=>{let n=new Map;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`search params`,()=>{let n=new URLSearchParams;t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()})}),e.i(`self-declared sizes`,()=>{e.o(`primitive length`,()=>{let n={length:0,a:`hello`};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal empty length`,()=>{let n={length:0};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal non-empty length`,()=>{let n={length:1};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal union of empty and non-empty length`,()=>{let n={length:1};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`length is optional and readonly`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`primitive size`,()=>{let n={size:0,a:`hello`};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal empty size`,()=>{let n={size:0};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal non-empty size`,()=>{let n={size:1};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal union of empty and non-empty size`,()=>{let n={size:1};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`size is optional and readonly`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()})}),e.i(`generic types`,()=>{e.o(`non-nullable`,()=>{let n={};t.isEmptyish(n)&&(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`any`,()=>{t.isEmptyish(``)&&(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`unknown`,()=>{t.isEmptyish(``)&&(0,e.t.expectTypeOf)(``).toEqualTypeOf()})});
+const e=require(`./dist-8XtUY3ad.cjs`),t=require(`./is-emptyish.cjs`);new Int8Array(1),Buffer.alloc(0),e.i(`strings`,()=>{e.o(`primitives`,()=>{let n=`test`;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`empty literal`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`non-empty literals`,()=>{let n=`test`;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`union of non-empty literals`,()=>{t.isEmptyish(`cat`),(0,e.t.expectTypeOf)(`cat`).toEqualTypeOf()}),e.o(`union with an empty literal`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`non-empty string templates`,()=>{let n=`prefix_0`;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`string template (with empty)`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`empty-able string template`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()})}),e.i(`branded`,()=>{e.o(`primitive`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`non-empty literal`,()=>{let n=`test`;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`empty literal`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`union of non-empty literals`,()=>{t.isEmptyish(`cat`),(0,e.t.expectTypeOf)(`cat`).toEqualTypeOf()}),e.o(`union of empty and non-empty literals`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()})}),e.i(`nullish`,()=>{e.o(`null`,()=>{t.isEmptyish(null),(0,e.t.expectTypeOf)(null).toEqualTypeOf()}),e.o(`undefined`,()=>{t.isEmptyish(void 0),(0,e.t.expectTypeOf)(void 0).toEqualTypeOf()}),e.o(`optional nullable`,()=>{t.isEmptyish(null),(0,e.t.expectTypeOf)(null).toEqualTypeOf()}),e.o(`optional primitive`,()=>{t.isEmptyish(void 0),(0,e.t.expectTypeOf)(void 0).toEqualTypeOf()}),e.o(`optional non-empty literal`,()=>{t.isEmptyish(`cat`),(0,e.t.expectTypeOf)(`cat`).toEqualTypeOf()}),e.o(`optional empty literal`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`nullable primitive`,()=>{t.isEmptyish(null),(0,e.t.expectTypeOf)(null).toEqualTypeOf()}),e.o(`nullable non-empty literal`,()=>{t.isEmptyish(`cat`),(0,e.t.expectTypeOf)(`cat`).toEqualTypeOf()}),e.o(`nullable empty literal`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`optional, nullable, empty, and non-empty`,()=>{t.isEmptyish(``),(0,e.t.expectTypeOf)(``).toEqualTypeOf()})}),e.i(`all tuple shapes`,()=>{e.o(`empty tuple`,()=>{let n=[];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`empty readonly tuple`,()=>{let n=[];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`fixed tuple`,()=>{let n=[1,2,3];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`fixed readonly tuple`,()=>{let n=[1,2,3];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`array`,()=>{let n=[];t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly array`,()=>{let n=[];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional tuple`,()=>{let n=[];t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly optional tuple`,()=>{let n=[];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`fixed-prefix array`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly fixed-prefix array`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`fixed-suffix array`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly fixed-suffix array`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`mixed tuples`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly mixed tuples`,()=>{let n=[1];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional prefix arrays`,()=>{let n=[];t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly optional prefix arrays`,()=>{let n=[];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`fixed-elements array`,()=>{let n=[1,2];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly fixed-elements array`,()=>{let n=[1,2];t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()})}),e.i(`array-like`,()=>{e.o(`typed arrays`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`buffers`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`sets`,()=>{let n=new Set;t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly sets`,()=>{let n=new Set;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o("array-like (e.g., `arguments`)",()=>{})}),e.i(`plain objects`,()=>{e.o(`never record`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly never record`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`plain object`,()=>{let n={a:123,b:`hello`};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly plain object`,()=>{let n={a:123,b:`hello`};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`unbounded record`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly unbounded record`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`partial bounded record`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly partial bounded record`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`partial and required props`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`required interfaces`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional interfaces`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional readonly interfaces`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`required prop and index signature`,()=>{let n={a:`hello`};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly required prop and index signature`,()=>{let n={a:`hello`};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional prop and index signature`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly optional prop and index signature`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`required symbol prop`,()=>{let n={[Symbol(`hello`)]:`world`};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`optional symbol prop`,()=>{let n={};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly optional symbol prop`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()})}),e.i(`keyed collections`,()=>{e.o(`maps`,()=>{let n=new Map;t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`readonly maps`,()=>{let n=new Map;t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`search params`,()=>{let n=new URLSearchParams;t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()})}),e.i(`self-declared sizes`,()=>{e.o(`primitive length`,()=>{let n={length:0,a:`hello`};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal empty length`,()=>{let n={length:0};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal non-empty length`,()=>{let n={length:1};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal union of empty and non-empty length`,()=>{let n={length:1};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`length is optional and readonly`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`primitive size`,()=>{let n={size:0,a:`hello`};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal empty size`,()=>{let n={size:0};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal non-empty size`,()=>{let n={size:1};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`literal union of empty and non-empty size`,()=>{let n={size:1};t.isEmptyish(n)?(0,e.t.expectTypeOf)(n).toExtend():(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`size is optional and readonly`,()=>{let n={};t.isEmptyish(n),(0,e.t.expectTypeOf)(n).toEqualTypeOf()})}),e.i(`generic types`,()=>{e.o(`non-nullable`,()=>{let n={};t.isEmptyish(n)&&(0,e.t.expectTypeOf)(n).toEqualTypeOf()}),e.o(`any`,()=>{t.isEmptyish(``)&&(0,e.t.expectTypeOf)(``).toEqualTypeOf()}),e.o(`unknown`,()=>{t.isEmptyish(``)&&(0,e.t.expectTypeOf)(``).toEqualTypeOf()})});

package/dist/is-emptyish.test-d.js

@@ -1,2 +1,2 @@
-import{i as e,o as t,t as n}from"./dist-CUT1dnRU.js";import{isEmptyish as r}from"./is-emptyish.js";new Int8Array(1),Buffer.alloc(0),e(`strings`,()=>{t(`primitives`,()=>{let e=`test`;r(e),n(e).toEqualTypeOf()}),t(`empty literal`,()=>{r(``),n(``).toEqualTypeOf()}),t(`non-empty literals`,()=>{let e=`test`;r(e),n(e).toEqualTypeOf()}),t(`union of non-empty literals`,()=>{r(`cat`),n(`cat`).toEqualTypeOf()}),t(`union with an empty literal`,()=>{r(``),n(``).toEqualTypeOf()}),t(`non-empty string templates`,()=>{let e=`prefix_0`;r(e),n(e).toEqualTypeOf()}),t(`string template (with empty)`,()=>{r(``),n(``).toEqualTypeOf()}),t(`empty-able string template`,()=>{r(``),n(``).toEqualTypeOf()})}),e(`branded`,()=>{t(`primitive`,()=>{r(``),n(``).toEqualTypeOf()}),t(`non-empty literal`,()=>{let e=`test`;r(e),n(e).toEqualTypeOf()}),t(`empty literal`,()=>{r(``),n(``).toEqualTypeOf()}),t(`union of non-empty literals`,()=>{r(`cat`),n(`cat`).toEqualTypeOf()}),t(`union of empty and non-empty literals`,()=>{r(``),n(``).toEqualTypeOf()})}),e(`nullish`,()=>{t(`null`,()=>{r(null),n(null).toEqualTypeOf()}),t(`undefined`,()=>{r(void 0),n(void 0).toEqualTypeOf()}),t(`optional nullable`,()=>{r(null),n(null).toEqualTypeOf()}),t(`optional primitive`,()=>{r(void 0),n(void 0).toEqualTypeOf()}),t(`optional non-empty literal`,()=>{r(`cat`),n(`cat`).toEqualTypeOf()}),t(`optional empty literal`,()=>{r(``),n(``).toEqualTypeOf()}),t(`nullable primitive`,()=>{r(null),n(null).toEqualTypeOf()}),t(`nullable non-empty literal`,()=>{r(`cat`),n(`cat`).toEqualTypeOf()}),t(`nullable empty literal`,()=>{r(``),n(``).toEqualTypeOf()}),t(`optional, nullable, empty, and non-empty`,()=>{r(``),n(``).toEqualTypeOf()})}),e(`all tuple shapes`,()=>{t(`empty tuple`,()=>{let e=[];r(e),n(e).toEqualTypeOf()}),t(`empty readonly tuple`,()=>{let e=[];r(e),n(e).toEqualTypeOf()}),t(`fixed tuple`,()=>{let e=[1,2,3];r(e),n(e).toEqualTypeOf()}),t(`fixed readonly tuple`,()=>{let e=[1,2,3];r(e),n(e).toEqualTypeOf()}),t(`array`,()=>{let e=[];r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly array`,()=>{let e=[];r(e),n(e).toEqualTypeOf()}),t(`optional tuple`,()=>{let e=[];r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly optional tuple`,()=>{let e=[];r(e),n(e).toEqualTypeOf()}),t(`fixed-prefix array`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`readonly fixed-prefix array`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`fixed-suffix array`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`readonly fixed-suffix array`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`mixed tuples`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`readonly mixed tuples`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`optional prefix arrays`,()=>{let e=[];r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly optional prefix arrays`,()=>{let e=[];r(e),n(e).toEqualTypeOf()}),t(`fixed-elements array`,()=>{let e=[1,2];r(e),n(e).toEqualTypeOf()}),t(`readonly fixed-elements array`,()=>{let e=[1,2];r(e),n(e).toEqualTypeOf()})}),e(`array-like`,()=>{t(`typed arrays`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`buffers`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`sets`,()=>{let e=new Set;r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly sets`,()=>{let e=new Set;r(e),n(e).toEqualTypeOf()}),t("array-like (e.g., `arguments`)",()=>{})}),e(`plain objects`,()=>{t(`never record`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`readonly never record`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`plain object`,()=>{let e={a:123,b:`hello`};r(e),n(e).toEqualTypeOf()}),t(`readonly plain object`,()=>{let e={a:123,b:`hello`};r(e),n(e).toEqualTypeOf()}),t(`unbounded record`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly unbounded record`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`partial bounded record`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly partial bounded record`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`partial and required props`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`required interfaces`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`optional interfaces`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`optional readonly interfaces`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`required prop and index signature`,()=>{let e={a:`hello`};r(e),n(e).toEqualTypeOf()}),t(`readonly required prop and index signature`,()=>{let e={a:`hello`};r(e),n(e).toEqualTypeOf()}),t(`optional prop and index signature`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly optional prop and index signature`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`required symbol prop`,()=>{let e={[Symbol(`hello`)]:`world`};r(e),n(e).toEqualTypeOf()}),t(`optional symbol prop`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly optional symbol prop`,()=>{let e={};r(e),n(e).toEqualTypeOf()})}),e(`keyed collections`,()=>{t(`maps`,()=>{let e=new Map;r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly maps`,()=>{let e=new Map;r(e),n(e).toEqualTypeOf()}),t(`search params`,()=>{let e=new URLSearchParams;r(e)?n(e).toExtend():n(e).toEqualTypeOf()})}),e(`self-declared sizes`,()=>{t(`primitive length`,()=>{let e={length:0,a:`hello`};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`literal empty length`,()=>{let e={length:0};r(e),n(e).toEqualTypeOf()}),t(`literal non-empty length`,()=>{let e={length:1};r(e),n(e).toEqualTypeOf()}),t(`literal union of empty and non-empty length`,()=>{let e={length:1};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`length is optional and readonly`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`primitive size`,()=>{let e={size:0,a:`hello`};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`literal empty size`,()=>{let e={size:0};r(e),n(e).toEqualTypeOf()}),t(`literal non-empty size`,()=>{let e={size:1};r(e),n(e).toEqualTypeOf()}),t(`literal union of empty and non-empty size`,()=>{let e={size:1};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`size is optional and readonly`,()=>{let e={};r(e),n(e).toEqualTypeOf()})}),e(`generic types`,()=>{t(`non-nullable`,()=>{let e={};r(e)&&n(e).toEqualTypeOf()}),t(`any`,()=>{r(``)&&n(``).toEqualTypeOf()}),t(`unknown`,()=>{r(``)&&n(``).toEqualTypeOf()})});
+import{i as e,o as t,t as n}from"./dist-Bd1vawFi.js";import{isEmptyish as r}from"./is-emptyish.js";new Int8Array(1),Buffer.alloc(0),e(`strings`,()=>{t(`primitives`,()=>{let e=`test`;r(e),n(e).toEqualTypeOf()}),t(`empty literal`,()=>{r(``),n(``).toEqualTypeOf()}),t(`non-empty literals`,()=>{let e=`test`;r(e),n(e).toEqualTypeOf()}),t(`union of non-empty literals`,()=>{r(`cat`),n(`cat`).toEqualTypeOf()}),t(`union with an empty literal`,()=>{r(``),n(``).toEqualTypeOf()}),t(`non-empty string templates`,()=>{let e=`prefix_0`;r(e),n(e).toEqualTypeOf()}),t(`string template (with empty)`,()=>{r(``),n(``).toEqualTypeOf()}),t(`empty-able string template`,()=>{r(``),n(``).toEqualTypeOf()})}),e(`branded`,()=>{t(`primitive`,()=>{r(``),n(``).toEqualTypeOf()}),t(`non-empty literal`,()=>{let e=`test`;r(e),n(e).toEqualTypeOf()}),t(`empty literal`,()=>{r(``),n(``).toEqualTypeOf()}),t(`union of non-empty literals`,()=>{r(`cat`),n(`cat`).toEqualTypeOf()}),t(`union of empty and non-empty literals`,()=>{r(``),n(``).toEqualTypeOf()})}),e(`nullish`,()=>{t(`null`,()=>{r(null),n(null).toEqualTypeOf()}),t(`undefined`,()=>{r(void 0),n(void 0).toEqualTypeOf()}),t(`optional nullable`,()=>{r(null),n(null).toEqualTypeOf()}),t(`optional primitive`,()=>{r(void 0),n(void 0).toEqualTypeOf()}),t(`optional non-empty literal`,()=>{r(`cat`),n(`cat`).toEqualTypeOf()}),t(`optional empty literal`,()=>{r(``),n(``).toEqualTypeOf()}),t(`nullable primitive`,()=>{r(null),n(null).toEqualTypeOf()}),t(`nullable non-empty literal`,()=>{r(`cat`),n(`cat`).toEqualTypeOf()}),t(`nullable empty literal`,()=>{r(``),n(``).toEqualTypeOf()}),t(`optional, nullable, empty, and non-empty`,()=>{r(``),n(``).toEqualTypeOf()})}),e(`all tuple shapes`,()=>{t(`empty tuple`,()=>{let e=[];r(e),n(e).toEqualTypeOf()}),t(`empty readonly tuple`,()=>{let e=[];r(e),n(e).toEqualTypeOf()}),t(`fixed tuple`,()=>{let e=[1,2,3];r(e),n(e).toEqualTypeOf()}),t(`fixed readonly tuple`,()=>{let e=[1,2,3];r(e),n(e).toEqualTypeOf()}),t(`array`,()=>{let e=[];r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly array`,()=>{let e=[];r(e),n(e).toEqualTypeOf()}),t(`optional tuple`,()=>{let e=[];r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly optional tuple`,()=>{let e=[];r(e),n(e).toEqualTypeOf()}),t(`fixed-prefix array`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`readonly fixed-prefix array`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`fixed-suffix array`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`readonly fixed-suffix array`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`mixed tuples`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`readonly mixed tuples`,()=>{let e=[1];r(e),n(e).toEqualTypeOf()}),t(`optional prefix arrays`,()=>{let e=[];r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly optional prefix arrays`,()=>{let e=[];r(e),n(e).toEqualTypeOf()}),t(`fixed-elements array`,()=>{let e=[1,2];r(e),n(e).toEqualTypeOf()}),t(`readonly fixed-elements array`,()=>{let e=[1,2];r(e),n(e).toEqualTypeOf()})}),e(`array-like`,()=>{t(`typed arrays`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`buffers`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`sets`,()=>{let e=new Set;r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly sets`,()=>{let e=new Set;r(e),n(e).toEqualTypeOf()}),t("array-like (e.g., `arguments`)",()=>{})}),e(`plain objects`,()=>{t(`never record`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`readonly never record`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`plain object`,()=>{let e={a:123,b:`hello`};r(e),n(e).toEqualTypeOf()}),t(`readonly plain object`,()=>{let e={a:123,b:`hello`};r(e),n(e).toEqualTypeOf()}),t(`unbounded record`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly unbounded record`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`partial bounded record`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly partial bounded record`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`partial and required props`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`required interfaces`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`optional interfaces`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`optional readonly interfaces`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`required prop and index signature`,()=>{let e={a:`hello`};r(e),n(e).toEqualTypeOf()}),t(`readonly required prop and index signature`,()=>{let e={a:`hello`};r(e),n(e).toEqualTypeOf()}),t(`optional prop and index signature`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly optional prop and index signature`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`required symbol prop`,()=>{let e={[Symbol(`hello`)]:`world`};r(e),n(e).toEqualTypeOf()}),t(`optional symbol prop`,()=>{let e={};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly optional symbol prop`,()=>{let e={};r(e),n(e).toEqualTypeOf()})}),e(`keyed collections`,()=>{t(`maps`,()=>{let e=new Map;r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`readonly maps`,()=>{let e=new Map;r(e),n(e).toEqualTypeOf()}),t(`search params`,()=>{let e=new URLSearchParams;r(e)?n(e).toExtend():n(e).toEqualTypeOf()})}),e(`self-declared sizes`,()=>{t(`primitive length`,()=>{let e={length:0,a:`hello`};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`literal empty length`,()=>{let e={length:0};r(e),n(e).toEqualTypeOf()}),t(`literal non-empty length`,()=>{let e={length:1};r(e),n(e).toEqualTypeOf()}),t(`literal union of empty and non-empty length`,()=>{let e={length:1};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`length is optional and readonly`,()=>{let e={};r(e),n(e).toEqualTypeOf()}),t(`primitive size`,()=>{let e={size:0,a:`hello`};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`literal empty size`,()=>{let e={size:0};r(e),n(e).toEqualTypeOf()}),t(`literal non-empty size`,()=>{let e={size:1};r(e),n(e).toEqualTypeOf()}),t(`literal union of empty and non-empty size`,()=>{let e={size:1};r(e)?n(e).toExtend():n(e).toEqualTypeOf()}),t(`size is optional and readonly`,()=>{let e={};r(e),n(e).toEqualTypeOf()})}),e(`generic types`,()=>{t(`non-nullable`,()=>{let e={};r(e)&&n(e).toEqualTypeOf()}),t(`any`,()=>{r(``)&&n(``).toEqualTypeOf()}),t(`unknown`,()=>{r(``)&&n(``).toEqualTypeOf()})});
 //# sourceMappingURL=is-emptyish.test-d.js.map

package/dist/is-emptyish.test.cjs

@@ -1 +1 @@
-const e=require(`./dist-CiyBKPT6.cjs`),t=require(`./is-emptyish.cjs`);e.i(`nullish`,()=>{e.a(`null`,()=>{e.n(t.isEmptyish(null)).toBe(!0)}),e.a(`undefined`,()=>{e.n(t.isEmptyish(void 0)).toBe(!0)})}),e.i(`strings`,()=>{e.a(`literals`,()=>{e.n(t.isEmptyish(``)).toBe(!0),e.n(t.isEmptyish(`test`)).toBe(!1)}),e.a(`boxed`,()=>{e.n(t.isEmptyish(new String(``))).toBe(!0),e.n(t.isEmptyish(new String(`test`))).toBe(!1)})}),e.i(`arrays`,()=>{e.a(`simple`,()=>{e.n(t.isEmptyish([])).toBe(!0),e.n(t.isEmptyish([1,2,3])).toBe(!1)}),e.a(`sparse`,()=>{e.n(t.isEmptyish([,,])).toBe(!1)}),e.a(`via Array.from`,()=>{e.n(t.isEmptyish(Array.from({length:0}))).toBe(!0),e.n(t.isEmptyish(Array.from({length:10}))).toBe(!1)}),e.a(`typed arrays`,()=>{e.n(t.isEmptyish(new Int8Array)).toBe(!0),e.n(t.isEmptyish(new Int8Array([1,2,3]))).toBe(!1)}),e.a(`buffers`,()=>{e.n(t.isEmptyish(Buffer.alloc(0))).toBe(!0),e.n(t.isEmptyish(Buffer.alloc(3))).toBe(!1)}),e.a(`sets`,()=>{e.n(t.isEmptyish(new Set)).toBe(!0),e.n(t.isEmptyish(new Set([1,2,3]))).toBe(!1)}),e.a("array-like (e.g., `arguments`)",()=>{function n(){e.n(t.isEmptyish(arguments)).toBe(!0)}n();function r(n,r,i){e.n(t.isEmptyish(arguments)).toBe(!1)}r(`test`,123,!0)})}),e.i(`keyed collections`,()=>{e.a(`plain objects`,()=>{e.n(t.isEmptyish({})).toBe(!0),e.n(t.isEmptyish({key:`value`})).toBe(!1)}),e.a(`null-prototyped objects`,()=>{let n=Object.create(null);e.n(t.isEmptyish(n)).toBe(!0),n.key=`hello, world!`,e.n(t.isEmptyish(n)).toBe(!1)}),e.a(`symbol props`,()=>{e.n(t.isEmptyish({[Symbol(`hello`)]:`world`})).toBe(!1)}),e.a(`maps`,()=>{e.n(t.isEmptyish(new Map)).toBe(!0),e.n(t.isEmptyish(new Map([[`key`,`value`]]))).toBe(!1)}),e.a(`url search params`,()=>{e.n(t.isEmptyish(new URLSearchParams)).toBe(!0),e.n(t.isEmptyish(new URLSearchParams(``))).toBe(!0),e.n(t.isEmptyish(new URLSearchParams(`?`))).toBe(!0),e.n(t.isEmptyish(new URLSearchParams(`hello`))).toBe(!1),e.n(t.isEmptyish(new URLSearchParams({hello:`world `}))).toBe(!1)}),e.a(`prototype chains`,()=>{e.n(t.isEmptyish(Object.create(Object.create({})))).toBe(!0),e.n(t.isEmptyish(Object.create(Object.create({a:123})))).toBe(!1)})}),e.i(`self-declared sizes`,()=>{e.a(`length`,()=>{e.n(t.isEmptyish({length:0})).toBe(!0),e.n(t.isEmptyish({length:1})).toBe(!1)}),e.a(`size`,()=>{e.n(t.isEmptyish({size:0})).toBe(!0),e.n(t.isEmptyish({size:1})).toBe(!1)}),e.a(`props are not coerced`,()=>{e.n(t.isEmptyish({length:`0`})).toBe(!1),e.n(t.isEmptyish({size:null})).toBe(!1)}),e.a(`length has precedence over size`,()=>{e.n(t.isEmptyish({length:0,size:5})).toBe(!0),e.n(t.isEmptyish({length:1,size:0})).toBe(!1)})}),e.i(`unsupported types`,()=>{e.i(`always false`,()=>{e.a(`numbers`,()=>{e.n(t.isEmptyish(0)).toBe(!1),e.n(t.isEmptyish(-0)).toBe(!1),e.n(t.isEmptyish(NaN)).toBe(!1),e.n(t.isEmptyish(1/0)).toBe(!1),e.n(t.isEmptyish(100)).toBe(!1),e.n(t.isEmptyish(12.34)).toBe(!1)}),e.a(`bigints`,()=>{e.n(t.isEmptyish(0n)).toBe(!1),e.n(t.isEmptyish(1n)).toBe(!1)}),e.a(`booleans`,()=>{e.n(t.isEmptyish(!1)).toBe(!1),e.n(t.isEmptyish(!0)).toBe(!1)}),e.a(`symbols`,()=>{e.n(t.isEmptyish(Symbol(``))).toBe(!1),e.n(t.isEmptyish(Symbol(`something`))).toBe(!1)}),e.a(`functions`,()=>{e.n(t.isEmptyish(()=>{})).toBe(!1),e.n(t.isEmptyish(()=>{console.log(`hello`)})).toBe(!1)})}),e.a(`classes`,()=>{class n{}class r{a=`hello`}class i{#e=`hello`;get a(){return this.#e}}class a{data=[]}e.n(t.isEmptyish(new n)).toBe(!0),e.n(t.isEmptyish(new r)).toBe(!1),e.n(t.isEmptyish(new i)).toBe(!0),e.n(t.isEmptyish(new a)).toBe(!1)}),e.a(`errors`,()=>{class n extends Error{constructor(e=`hello`){super(),this.data=e}}e.n(t.isEmptyish(Error())).toBe(!0),e.n(t.isEmptyish(Error(`hello world!`))).toBe(!0),e.n(t.isEmptyish(new n)).toBe(!1)}),e.i(`always true`,()=>{e.a(`regexp`,()=>{e.n(t.isEmptyish(RegExp(``))).toBe(!0),e.n(t.isEmptyish(/abc/u)).toBe(!0)}),e.a(`dates`,()=>{e.n(t.isEmptyish(new Date(0))).toBe(!0),e.n(t.isEmptyish(new Date)).toBe(!0)}),e.a(`weak collections`,()=>{e.n(t.isEmptyish(new WeakMap)).toBe(!0),e.n(t.isEmptyish(new WeakSet)).toBe(!0)})})});
+const e=require(`./dist-8XtUY3ad.cjs`),t=require(`./is-emptyish.cjs`);e.i(`nullish`,()=>{e.a(`null`,()=>{e.n(t.isEmptyish(null)).toBe(!0)}),e.a(`undefined`,()=>{e.n(t.isEmptyish(void 0)).toBe(!0)})}),e.i(`strings`,()=>{e.a(`literals`,()=>{e.n(t.isEmptyish(``)).toBe(!0),e.n(t.isEmptyish(`test`)).toBe(!1)}),e.a(`boxed`,()=>{e.n(t.isEmptyish(new String(``))).toBe(!0),e.n(t.isEmptyish(new String(`test`))).toBe(!1)})}),e.i(`arrays`,()=>{e.a(`simple`,()=>{e.n(t.isEmptyish([])).toBe(!0),e.n(t.isEmptyish([1,2,3])).toBe(!1)}),e.a(`sparse`,()=>{e.n(t.isEmptyish([,,])).toBe(!1)}),e.a(`via Array.from`,()=>{e.n(t.isEmptyish(Array.from({length:0}))).toBe(!0),e.n(t.isEmptyish(Array.from({length:10}))).toBe(!1)}),e.a(`typed arrays`,()=>{e.n(t.isEmptyish(new Int8Array)).toBe(!0),e.n(t.isEmptyish(new Int8Array([1,2,3]))).toBe(!1)}),e.a(`buffers`,()=>{e.n(t.isEmptyish(Buffer.alloc(0))).toBe(!0),e.n(t.isEmptyish(Buffer.alloc(3))).toBe(!1)}),e.a(`sets`,()=>{e.n(t.isEmptyish(new Set)).toBe(!0),e.n(t.isEmptyish(new Set([1,2,3]))).toBe(!1)}),e.a("array-like (e.g., `arguments`)",()=>{function n(){e.n(t.isEmptyish(arguments)).toBe(!0)}n();function r(n,r,i){e.n(t.isEmptyish(arguments)).toBe(!1)}r(`test`,123,!0)})}),e.i(`keyed collections`,()=>{e.a(`plain objects`,()=>{e.n(t.isEmptyish({})).toBe(!0),e.n(t.isEmptyish({key:`value`})).toBe(!1)}),e.a(`null-prototyped objects`,()=>{let n=Object.create(null);e.n(t.isEmptyish(n)).toBe(!0),n.key=`hello, world!`,e.n(t.isEmptyish(n)).toBe(!1)}),e.a(`symbol props`,()=>{e.n(t.isEmptyish({[Symbol(`hello`)]:`world`})).toBe(!1)}),e.a(`maps`,()=>{e.n(t.isEmptyish(new Map)).toBe(!0),e.n(t.isEmptyish(new Map([[`key`,`value`]]))).toBe(!1)}),e.a(`url search params`,()=>{e.n(t.isEmptyish(new URLSearchParams)).toBe(!0),e.n(t.isEmptyish(new URLSearchParams(``))).toBe(!0),e.n(t.isEmptyish(new URLSearchParams(`?`))).toBe(!0),e.n(t.isEmptyish(new URLSearchParams(`hello`))).toBe(!1),e.n(t.isEmptyish(new URLSearchParams({hello:`world `}))).toBe(!1)}),e.a(`prototype chains`,()=>{e.n(t.isEmptyish(Object.create(Object.create({})))).toBe(!0),e.n(t.isEmptyish(Object.create(Object.create({a:123})))).toBe(!1)})}),e.i(`self-declared sizes`,()=>{e.a(`length`,()=>{e.n(t.isEmptyish({length:0})).toBe(!0),e.n(t.isEmptyish({length:1})).toBe(!1)}),e.a(`size`,()=>{e.n(t.isEmptyish({size:0})).toBe(!0),e.n(t.isEmptyish({size:1})).toBe(!1)}),e.a(`props are not coerced`,()=>{e.n(t.isEmptyish({length:`0`})).toBe(!1),e.n(t.isEmptyish({size:null})).toBe(!1)}),e.a(`length has precedence over size`,()=>{e.n(t.isEmptyish({length:0,size:5})).toBe(!0),e.n(t.isEmptyish({length:1,size:0})).toBe(!1)})}),e.i(`unsupported types`,()=>{e.i(`always false`,()=>{e.a(`numbers`,()=>{e.n(t.isEmptyish(0)).toBe(!1),e.n(t.isEmptyish(-0)).toBe(!1),e.n(t.isEmptyish(NaN)).toBe(!1),e.n(t.isEmptyish(1/0)).toBe(!1),e.n(t.isEmptyish(100)).toBe(!1),e.n(t.isEmptyish(12.34)).toBe(!1)}),e.a(`bigints`,()=>{e.n(t.isEmptyish(0n)).toBe(!1),e.n(t.isEmptyish(1n)).toBe(!1)}),e.a(`booleans`,()=>{e.n(t.isEmptyish(!1)).toBe(!1),e.n(t.isEmptyish(!0)).toBe(!1)}),e.a(`symbols`,()=>{e.n(t.isEmptyish(Symbol(``))).toBe(!1),e.n(t.isEmptyish(Symbol(`something`))).toBe(!1)}),e.a(`functions`,()=>{e.n(t.isEmptyish(()=>{})).toBe(!1),e.n(t.isEmptyish(()=>{console.log(`hello`)})).toBe(!1)})}),e.a(`classes`,()=>{class n{}class r{a=`hello`}class i{#e=`hello`;get a(){return this.#e}}class a{data=[]}e.n(t.isEmptyish(new n)).toBe(!0),e.n(t.isEmptyish(new r)).toBe(!1),e.n(t.isEmptyish(new i)).toBe(!0),e.n(t.isEmptyish(new a)).toBe(!1)}),e.a(`errors`,()=>{class n extends Error{constructor(e=`hello`){super(),this.data=e}}e.n(t.isEmptyish(Error())).toBe(!0),e.n(t.isEmptyish(Error(`hello world!`))).toBe(!0),e.n(t.isEmptyish(new n)).toBe(!1)}),e.i(`always true`,()=>{e.a(`regexp`,()=>{e.n(t.isEmptyish(RegExp(``))).toBe(!0),e.n(t.isEmptyish(/abc/u)).toBe(!0)}),e.a(`dates`,()=>{e.n(t.isEmptyish(new Date(0))).toBe(!0),e.n(t.isEmptyish(new Date)).toBe(!0)}),e.a(`weak collections`,()=>{e.n(t.isEmptyish(new WeakMap)).toBe(!0),e.n(t.isEmptyish(new WeakSet)).toBe(!0)})})});

package/dist/is-emptyish.test.js

@@ -1,2 +1,2 @@
-import{a as e,i as t,n}from"./dist-CUT1dnRU.js";import{isEmptyish as r}from"./is-emptyish.js";t(`nullish`,()=>{e(`null`,()=>{n(r(null)).toBe(!0)}),e(`undefined`,()=>{n(r(void 0)).toBe(!0)})}),t(`strings`,()=>{e(`literals`,()=>{n(r(``)).toBe(!0),n(r(`test`)).toBe(!1)}),e(`boxed`,()=>{n(r(new String(``))).toBe(!0),n(r(new String(`test`))).toBe(!1)})}),t(`arrays`,()=>{e(`simple`,()=>{n(r([])).toBe(!0),n(r([1,2,3])).toBe(!1)}),e(`sparse`,()=>{n(r([,,])).toBe(!1)}),e(`via Array.from`,()=>{n(r(Array.from({length:0}))).toBe(!0),n(r(Array.from({length:10}))).toBe(!1)}),e(`typed arrays`,()=>{n(r(new Int8Array)).toBe(!0),n(r(new Int8Array([1,2,3]))).toBe(!1)}),e(`buffers`,()=>{n(r(Buffer.alloc(0))).toBe(!0),n(r(Buffer.alloc(3))).toBe(!1)}),e(`sets`,()=>{n(r(new Set)).toBe(!0),n(r(new Set([1,2,3]))).toBe(!1)}),e("array-like (e.g., `arguments`)",()=>{function e(){n(r(arguments)).toBe(!0)}e();function t(e,t,i){n(r(arguments)).toBe(!1)}t(`test`,123,!0)})}),t(`keyed collections`,()=>{e(`plain objects`,()=>{n(r({})).toBe(!0),n(r({key:`value`})).toBe(!1)}),e(`null-prototyped objects`,()=>{let e=Object.create(null);n(r(e)).toBe(!0),e.key=`hello, world!`,n(r(e)).toBe(!1)}),e(`symbol props`,()=>{n(r({[Symbol(`hello`)]:`world`})).toBe(!1)}),e(`maps`,()=>{n(r(new Map)).toBe(!0),n(r(new Map([[`key`,`value`]]))).toBe(!1)}),e(`url search params`,()=>{n(r(new URLSearchParams)).toBe(!0),n(r(new URLSearchParams(``))).toBe(!0),n(r(new URLSearchParams(`?`))).toBe(!0),n(r(new URLSearchParams(`hello`))).toBe(!1),n(r(new URLSearchParams({hello:`world `}))).toBe(!1)}),e(`prototype chains`,()=>{n(r(Object.create(Object.create({})))).toBe(!0),n(r(Object.create(Object.create({a:123})))).toBe(!1)})}),t(`self-declared sizes`,()=>{e(`length`,()=>{n(r({length:0})).toBe(!0),n(r({length:1})).toBe(!1)}),e(`size`,()=>{n(r({size:0})).toBe(!0),n(r({size:1})).toBe(!1)}),e(`props are not coerced`,()=>{n(r({length:`0`})).toBe(!1),n(r({size:null})).toBe(!1)}),e(`length has precedence over size`,()=>{n(r({length:0,size:5})).toBe(!0),n(r({length:1,size:0})).toBe(!1)})}),t(`unsupported types`,()=>{t(`always false`,()=>{e(`numbers`,()=>{n(r(0)).toBe(!1),n(r(-0)).toBe(!1),n(r(NaN)).toBe(!1),n(r(1/0)).toBe(!1),n(r(100)).toBe(!1),n(r(12.34)).toBe(!1)}),e(`bigints`,()=>{n(r(0n)).toBe(!1),n(r(1n)).toBe(!1)}),e(`booleans`,()=>{n(r(!1)).toBe(!1),n(r(!0)).toBe(!1)}),e(`symbols`,()=>{n(r(Symbol(``))).toBe(!1),n(r(Symbol(`something`))).toBe(!1)}),e(`functions`,()=>{n(r(()=>{})).toBe(!1),n(r(()=>{console.log(`hello`)})).toBe(!1)})}),e(`classes`,()=>{class e{}class t{a=`hello`}class i{#e=`hello`;get a(){return this.#e}}class a{data=[]}n(r(new e)).toBe(!0),n(r(new t)).toBe(!1),n(r(new i)).toBe(!0),n(r(new a)).toBe(!1)}),e(`errors`,()=>{class e extends Error{constructor(e=`hello`){super(),this.data=e}}n(r(Error())).toBe(!0),n(r(Error(`hello world!`))).toBe(!0),n(r(new e)).toBe(!1)}),t(`always true`,()=>{e(`regexp`,()=>{n(r(RegExp(``))).toBe(!0),n(r(/abc/u)).toBe(!0)}),e(`dates`,()=>{n(r(new Date(0))).toBe(!0),n(r(new Date)).toBe(!0)}),e(`weak collections`,()=>{n(r(new WeakMap)).toBe(!0),n(r(new WeakSet)).toBe(!0)})})});
+import{a as e,i as t,n}from"./dist-Bd1vawFi.js";import{isEmptyish as r}from"./is-emptyish.js";t(`nullish`,()=>{e(`null`,()=>{n(r(null)).toBe(!0)}),e(`undefined`,()=>{n(r(void 0)).toBe(!0)})}),t(`strings`,()=>{e(`literals`,()=>{n(r(``)).toBe(!0),n(r(`test`)).toBe(!1)}),e(`boxed`,()=>{n(r(new String(``))).toBe(!0),n(r(new String(`test`))).toBe(!1)})}),t(`arrays`,()=>{e(`simple`,()=>{n(r([])).toBe(!0),n(r([1,2,3])).toBe(!1)}),e(`sparse`,()=>{n(r([,,])).toBe(!1)}),e(`via Array.from`,()=>{n(r(Array.from({length:0}))).toBe(!0),n(r(Array.from({length:10}))).toBe(!1)}),e(`typed arrays`,()=>{n(r(new Int8Array)).toBe(!0),n(r(new Int8Array([1,2,3]))).toBe(!1)}),e(`buffers`,()=>{n(r(Buffer.alloc(0))).toBe(!0),n(r(Buffer.alloc(3))).toBe(!1)}),e(`sets`,()=>{n(r(new Set)).toBe(!0),n(r(new Set([1,2,3]))).toBe(!1)}),e("array-like (e.g., `arguments`)",()=>{function e(){n(r(arguments)).toBe(!0)}e();function t(e,t,i){n(r(arguments)).toBe(!1)}t(`test`,123,!0)})}),t(`keyed collections`,()=>{e(`plain objects`,()=>{n(r({})).toBe(!0),n(r({key:`value`})).toBe(!1)}),e(`null-prototyped objects`,()=>{let e=Object.create(null);n(r(e)).toBe(!0),e.key=`hello, world!`,n(r(e)).toBe(!1)}),e(`symbol props`,()=>{n(r({[Symbol(`hello`)]:`world`})).toBe(!1)}),e(`maps`,()=>{n(r(new Map)).toBe(!0),n(r(new Map([[`key`,`value`]]))).toBe(!1)}),e(`url search params`,()=>{n(r(new URLSearchParams)).toBe(!0),n(r(new URLSearchParams(``))).toBe(!0),n(r(new URLSearchParams(`?`))).toBe(!0),n(r(new URLSearchParams(`hello`))).toBe(!1),n(r(new URLSearchParams({hello:`world `}))).toBe(!1)}),e(`prototype chains`,()=>{n(r(Object.create(Object.create({})))).toBe(!0),n(r(Object.create(Object.create({a:123})))).toBe(!1)})}),t(`self-declared sizes`,()=>{e(`length`,()=>{n(r({length:0})).toBe(!0),n(r({length:1})).toBe(!1)}),e(`size`,()=>{n(r({size:0})).toBe(!0),n(r({size:1})).toBe(!1)}),e(`props are not coerced`,()=>{n(r({length:`0`})).toBe(!1),n(r({size:null})).toBe(!1)}),e(`length has precedence over size`,()=>{n(r({length:0,size:5})).toBe(!0),n(r({length:1,size:0})).toBe(!1)})}),t(`unsupported types`,()=>{t(`always false`,()=>{e(`numbers`,()=>{n(r(0)).toBe(!1),n(r(-0)).toBe(!1),n(r(NaN)).toBe(!1),n(r(1/0)).toBe(!1),n(r(100)).toBe(!1),n(r(12.34)).toBe(!1)}),e(`bigints`,()=>{n(r(0n)).toBe(!1),n(r(1n)).toBe(!1)}),e(`booleans`,()=>{n(r(!1)).toBe(!1),n(r(!0)).toBe(!1)}),e(`symbols`,()=>{n(r(Symbol(``))).toBe(!1),n(r(Symbol(`something`))).toBe(!1)}),e(`functions`,()=>{n(r(()=>{})).toBe(!1),n(r(()=>{console.log(`hello`)})).toBe(!1)})}),e(`classes`,()=>{class e{}class t{a=`hello`}class i{#e=`hello`;get a(){return this.#e}}class a{data=[]}n(r(new e)).toBe(!0),n(r(new t)).toBe(!1),n(r(new i)).toBe(!0),n(r(new a)).toBe(!1)}),e(`errors`,()=>{class e extends Error{constructor(e=`hello`){super(),this.data=e}}n(r(Error())).toBe(!0),n(r(Error(`hello world!`))).toBe(!0),n(r(new e)).toBe(!1)}),t(`always true`,()=>{e(`regexp`,()=>{n(r(RegExp(``))).toBe(!0),n(r(/abc/u)).toBe(!0)}),e(`dates`,()=>{n(r(new Date(0))).toBe(!0),n(r(new Date)).toBe(!0)}),e(`weak collections`,()=>{n(r(new WeakMap)).toBe(!0),n(r(new WeakSet)).toBe(!0)})})});
 //# sourceMappingURL=is-emptyish.test.js.map

package/dist/is-function.d.cts

@@ -1,5 +1,8 @@
+import { t as StrictFunction } from "./strict-function-CPTwDgnZ.cjs";
+import { t as NarrowedTo } from "./narrowed-to-D_6H-aZW.cjs";
+
 //#region src/is-function.d.ts
-type DefinitelyFunction<T> = Extract<T, Function> extends never ? Function : Extract<T, Function>;
+
 /**
  * A function that checks if the passed parameter is a Function and narrows its type accordingly.
  *
@@ -12,7 +15,7 @@ type DefinitelyFunction<T> = Extract<T, Function> extends never ? Function : Ext
  *    P.isFunction('somethingElse') //=> false
  * @category Guard
  */
-declare function isFunction<T>(data: Function | T): data is DefinitelyFunction<T>;
+declare function isFunction<T>(data: StrictFunction | T): data is NarrowedTo<T, StrictFunction>;
 //#endregion
 export { isFunction };
 //# sourceMappingURL=is-function.d.cts.map

package/dist/is-function.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"is-function.d.cts","names":[],"sources":["../src/is-function.ts"],"sourcesContent":[],"mappings":";KAIK,wBACD,QAAQ,GAAG,0BAA0B,WAAW,QAAQ,GAAG;;;;;;;;;;AAa/D;;;AAE8B,iBAFd,UAEc,CAAA,CAAA,CAAA,CAAA,IAAA,EADtB,QACsB,GADX,CACW,CAAA,EAAA,IAAA,IAAnB,kBAAmB,CAAA,CAAA,CAAA"}
+{"version":3,"file":"is-function.d.cts","names":[],"sources":["../src/is-function.ts"],"sourcesContent":[],"mappings":";;;;;;;AAeA;;;;;;;;;;iBAAgB,oBAAoB,iBAAiB,YAAY,WAAW,GAAG"}

package/dist/is-function.d.ts

@@ -1,5 +1,8 @@
+import { t as StrictFunction } from "./strict-function-BBgKFNUw.js";
+import { t as NarrowedTo } from "./narrowed-to-B7tkuY2k.js";
+
 //#region src/is-function.d.ts
-type DefinitelyFunction<T> = Extract<T, Function> extends never ? Function : Extract<T, Function>;
+
 /**
  * A function that checks if the passed parameter is a Function and narrows its type accordingly.
  *
@@ -12,7 +15,7 @@ type DefinitelyFunction<T> = Extract<T, Function> extends never ? Function : Ext
  *    P.isFunction('somethingElse') //=> false
  * @category Guard
  */
-declare function isFunction<T>(data: Function | T): data is DefinitelyFunction<T>;
+declare function isFunction<T>(data: StrictFunction | T): data is NarrowedTo<T, StrictFunction>;
 //#endregion
 export { isFunction };
 //# sourceMappingURL=is-function.d.ts.map

package/dist/is-function.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"is-function.d.ts","names":[],"sources":["../src/is-function.ts"],"sourcesContent":[],"mappings":";KAIK,wBACD,QAAQ,GAAG,0BAA0B,WAAW,QAAQ,GAAG;;;;;;;;;;AAa/D;;;AAE8B,iBAFd,UAEc,CAAA,CAAA,CAAA,CAAA,IAAA,EADtB,QACsB,GADX,CACW,CAAA,EAAA,IAAA,IAAnB,kBAAmB,CAAA,CAAA,CAAA"}
+{"version":3,"file":"is-function.d.ts","names":[],"sources":["../src/is-function.ts"],"sourcesContent":[],"mappings":";;;;;;;AAeA;;;;;;;;;;iBAAgB,oBAAoB,iBAAiB,YAAY,WAAW,GAAG"}

package/dist/is-function.js.map

@@ -1 +1 @@
-{"version":3,"file":"is-function.js","names":[],"sources":["../src/is-function.ts"],"sourcesContent":["/* eslint-disable ts/no-unsafe-function-type --\n * Function is used generically in this file to define any type of function, so\n * this lint error is not relevant for it.\n */\ntype DefinitelyFunction<T>\n  = Extract<T, Function> extends never ? Function : Extract<T, Function>;\n/**\n * A function that checks if the passed parameter is a Function and narrows its type accordingly.\n *\n * @param data - The variable to check.\n * @returns True if the passed input is a Function, false otherwise.\n * @signature\n *    P.isFunction(data)\n * @example\n *    P.isFunction(() => {}) //=> true\n *    P.isFunction('somethingElse') //=> false\n * @category Guard\n */\nexport function isFunction<T>(\n  data: Function | T,\n): data is DefinitelyFunction<T> {\n  return typeof data === 'function';\n}\n"],"mappings":"AAkBA,SAAgB,EACd,EAC+B,CAC/B,OAAO,OAAO,GAAS"}
+{"version":3,"file":"is-function.js","names":[],"sources":["../src/is-function.ts"],"sourcesContent":["import type { NarrowedTo } from './internal/types/narrowed-to';\nimport type { StrictFunction } from './internal/types/strict-function';\n\n/**\n * A function that checks if the passed parameter is a Function and narrows its type accordingly.\n *\n * @param data - The variable to check.\n * @returns True if the passed input is a Function, false otherwise.\n * @signature\n *    P.isFunction(data)\n * @example\n *    P.isFunction(() => {}) //=> true\n *    P.isFunction('somethingElse') //=> false\n * @category Guard\n */\nexport function isFunction<T>(data: StrictFunction | T): data is NarrowedTo<T, StrictFunction> {\n  return typeof data === 'function';\n}\n"],"mappings":"AAeA,SAAgB,EAAc,EAAiE,CAC7F,OAAO,OAAO,GAAS"}

package/dist/is-included-in.d.cts

@@ -1,6 +1,5 @@
-import { t as IsUnion } from "./is-union-Dp9mCo1b.cjs";
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
-import { IsLiteral } from "type-fest";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
+import { IsLiteral, IsUnion } from "type-fest";
 
 //#region src/is-included-in.d.ts
 

package/dist/is-included-in.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"is-included-in.d.cts","names":[],"sources":["../src/is-included-in.ts"],"sourcesContent":[],"mappings":";;;;;;;;AAE6E;;;;;;;;;AAoBtD;;KALlB,eAsC0B,CAAA,UAtCA,iBAsCA,CAAA,GAtCqB,CAsCrB,SAAA,SAAA,EAAA,GAAA,IAAA,GApC3B,CAoC2B,SAAA,SAAA,CAAA,KAAA,KAAA,EAAA,GAAA,KAAA,KAAA,CAAA,GAnCzB,OAmCyB,CAnCjB,IAmCiB,CAAA,SAAA,IAAA,GAAA,KAAA,GAjCvB,eAiCuB,CAjCP,IAiCO,CAAA,GAAA,KAAA;;;;;;;;AAwC/B;;;;;;;;;;AAIA;;;;;;AAgCA;;;;;;;KA5EK,YA8EK,CAAA,CAAA,EAAA,UA9EqB,iBA8ErB,CA9EuC,CA8EvC,CAAA,CAAA,GA7EN,SA6EM,CA7EI,CA6EJ,CAAA,SAAA,IAAA,GArEJ,eAqEI,CArEY,CAqEZ,CAAA,GAjEJ,SAiEI,CAjEM,CAiEN,CAAA,MAAA,CAAA,CAAA;;;AACV;;;;;;;;;;;;;;;;;;;;;;;iBAvCgB,0BAA0B,kBAAkB,UACpD,cACK,aAAa,GAAG,kBAAkB,oBACpC;iBACK,0BAA0B,SAClC,cACK,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA8Bf,0BAA0B,kBAAkB,eAC/C,aAAa,GAAG,kBAAkB,mBACrC,cAAc;iBACR,0BAA0B,cAC7B,kBAAkB,YACrB"}
+{"version":3,"file":"is-included-in.d.cts","names":[],"sources":["../src/is-included-in.ts"],"sourcesContent":[],"mappings":";;;;;;;AAC6E;;;;;;;;;AAoBtD;;KALlB,eAsC0B,CAAA,UAtCA,iBAsCA,CAAA,GAtCqB,CAsCrB,SAAA,SAAA,EAAA,GAAA,IAAA,GApC3B,CAoC2B,SAAA,SAAA,CAAA,KAAA,KAAA,EAAA,GAAA,KAAA,KAAA,CAAA,GAnCzB,OAmCyB,CAnCjB,IAmCiB,CAAA,SAAA,IAAA,GAAA,KAAA,GAjCvB,eAiCuB,CAjCP,IAiCO,CAAA,GAAA,KAAA;;;;;;;;AAwC/B;;;;;;;;;;AAIA;;;;;;AAgCA;;;;;;;KA5EK,YA8EK,CAAA,CAAA,EAAA,UA9EqB,iBA8ErB,CA9EuC,CA8EvC,CAAA,CAAA,GA7EN,SA6EM,CA7EI,CA6EJ,CAAA,SAAA,IAAA,GArEJ,eAqEI,CArEY,CAqEZ,CAAA,GAjEJ,SAiEI,CAjEM,CAiEN,CAAA,MAAA,CAAA,CAAA;;;AACV;;;;;;;;;;;;;;;;;;;;;;;iBAvCgB,0BAA0B,kBAAkB,UACpD,cACK,aAAa,GAAG,kBAAkB,oBACpC;iBACK,0BAA0B,SAClC,cACK,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA8Bf,0BAA0B,kBAAkB,eAC/C,aAAa,GAAG,kBAAkB,mBACrC,cAAc;iBACR,0BAA0B,cAC7B,kBAAkB,YACrB"}

package/dist/is-included-in.d.ts

@@ -1,6 +1,5 @@
-import { t as IsUnion } from "./is-union-Bu19sEkP.js";
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
-import { IsLiteral } from "type-fest";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
+import { IsLiteral, IsUnion } from "type-fest";
 
 //#region src/is-included-in.d.ts
 

package/dist/is-included-in.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"is-included-in.d.ts","names":[],"sources":["../src/is-included-in.ts"],"sourcesContent":[],"mappings":";;;;;;;;AAE6E;;;;;;;;;AAoBtD;;KALlB,eAsC0B,CAAA,UAtCA,iBAsCA,CAAA,GAtCqB,CAsCrB,SAAA,SAAA,EAAA,GAAA,IAAA,GApC3B,CAoC2B,SAAA,SAAA,CAAA,KAAA,KAAA,EAAA,GAAA,KAAA,KAAA,CAAA,GAnCzB,OAmCyB,CAnCjB,IAmCiB,CAAA,SAAA,IAAA,GAAA,KAAA,GAjCvB,eAiCuB,CAjCP,IAiCO,CAAA,GAAA,KAAA;;;;;;;;AAwC/B;;;;;;;;;;AAIA;;;;;;AAgCA;;;;;;;KA5EK,YA8EK,CAAA,CAAA,EAAA,UA9EqB,iBA8ErB,CA9EuC,CA8EvC,CAAA,CAAA,GA7EN,SA6EM,CA7EI,CA6EJ,CAAA,SAAA,IAAA,GArEJ,eAqEI,CArEY,CAqEZ,CAAA,GAjEJ,SAiEI,CAjEM,CAiEN,CAAA,MAAA,CAAA,CAAA;;;AACV;;;;;;;;;;;;;;;;;;;;;;;iBAvCgB,0BAA0B,kBAAkB,UACpD,cACK,aAAa,GAAG,kBAAkB,oBACpC;iBACK,0BAA0B,SAClC,cACK,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA8Bf,0BAA0B,kBAAkB,eAC/C,aAAa,GAAG,kBAAkB,mBACrC,cAAc;iBACR,0BAA0B,cAC7B,kBAAkB,YACrB"}
+{"version":3,"file":"is-included-in.d.ts","names":[],"sources":["../src/is-included-in.ts"],"sourcesContent":[],"mappings":";;;;;;;AAC6E;;;;;;;;;AAoBtD;;KALlB,eAsC0B,CAAA,UAtCA,iBAsCA,CAAA,GAtCqB,CAsCrB,SAAA,SAAA,EAAA,GAAA,IAAA,GApC3B,CAoC2B,SAAA,SAAA,CAAA,KAAA,KAAA,EAAA,GAAA,KAAA,KAAA,CAAA,GAnCzB,OAmCyB,CAnCjB,IAmCiB,CAAA,SAAA,IAAA,GAAA,KAAA,GAjCvB,eAiCuB,CAjCP,IAiCO,CAAA,GAAA,KAAA;;;;;;;;AAwC/B;;;;;;;;;;AAIA;;;;;;AAgCA;;;;;;;KA5EK,YA8EK,CAAA,CAAA,EAAA,UA9EqB,iBA8ErB,CA9EuC,CA8EvC,CAAA,CAAA,GA7EN,SA6EM,CA7EI,CA6EJ,CAAA,SAAA,IAAA,GArEJ,eAqEI,CArEY,CAqEZ,CAAA,GAjEJ,SAiEI,CAjEM,CAiEN,CAAA,MAAA,CAAA,CAAA;;;AACV;;;;;;;;;;;;;;;;;;;;;;;iBAvCgB,0BAA0B,kBAAkB,UACpD,cACK,aAAa,GAAG,kBAAkB,oBACpC;iBACK,0BAA0B,SAClC,cACK,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA8Bf,0BAA0B,kBAAkB,eAC/C,aAAa,GAAG,kBAAkB,mBACrC,cAAc;iBACR,0BAA0B,cAC7B,kBAAkB,YACrB"}

package/dist/is-included-in.js.map

@@ -1 +1 @@
-{"version":3,"file":"is-included-in.js","names":[],"sources":["../src/is-included-in.ts"],"sourcesContent":["import type { IsLiteral } from 'type-fest';\nimport type { IsUnion } from './internal/types/is-union';\nimport type { IterableContainer } from './internal/types/iterable-container';\n\n/**\n * A \"constant\" tuple is a type that has a single runtime value that can fulfil\n * it. This means that it doesn't have any variadic/rest/spread/array parts, and\n * that all it's values are singular (non-union) literals.\n *\n * We use this type to allow narrowing when checking against a set of values\n * defined as a const.\n *\n * @example\n *   type T1 = IsConstantTuple<[\"cat\", \"dog\", 3, true]>; // => true;\n *   type T2 = IsConstantTuple<[\"cat\" | \"dog\"]>; // false;\n *   type T2 = IsConstantTuple<[\"cat\", ...Array<\"cat\">]>; // false;\n */\ntype IsConstantTuple<T extends IterableContainer> = T extends readonly []\n  ? true\n  : T extends readonly [infer Head, ...infer Rest]\n    ? IsUnion<Head> extends true\n      ? false\n      : IsConstantTuple<Rest>\n    : false;\n\n/**\n * There is no way to tell Typescript to only narrow the \"accepted\" side of a\n * type-predicate and so in many cases the negated side is also affected, this\n * results in over-narrowing in many cases, breaking typing. For this reason we\n * only want to use the type-predicate variant of `isIncludedIn` when we can\n * assume the result represents the expected types (closely enough). This is not\n * and ideal solution and we will still generate wrong types in some cases (see\n * tests), but it reduces the surface of this problem significantly, while still\n * keeping the utility of `isIncludedIn` for the common cases.\n *\n * TL;DR - The types are narrowable when: T is literal and S is a pure tuple, or\n * when T isn't a literal, but S is.\n *\n * @example\n *   const data = 1 as 1 | 2 | 3;\n *   const container = [] as Array<1 | 2>;\n *   if (isIncludedIn(data, container)) {\n *     ... it makes sense to narrow data to `1 | 2` as the value `3` is not part\n *     ... of the typing of container, so will never result in being true.\n *   } else {\n *     ... but it doesn't make sense to narrow the value to 3 here, because 1\n *     ... and 2 are still valid values for data, when container doesn't include\n *     ... them **at runtime**.\n *     ... Typescript narrows the _rejected_ branch based on how it narrowed the\n *     ... _accepted_ clause, and we can't control that; because our input type\n *     ... is `1 | 2 | 3` and the accepted side is `1 | 2`, the rejected side is\n *     ... typed `Exclude<1 | 2 | 3, 1 | 2>`, which is `3`.\n *   }\n * }\n */\ntype IsNarrowable<T, S extends IterableContainer<T>>\n  = IsLiteral<T> extends true\n    // When T is literal (i.g. it isn't a primitive type like `string` or\n    // `number`) then the criteria for narrowing is that the container is a\n    // \"pure\" tuple because we *assume* that S represents a constant set of\n    // values, and that it's typing also represents it's runtime content 1-\n    // for-1. If S isn't a pure tuple it means we can't tell from the typing\n    // which of it's values are actually present in runtime so can't use them\n    // to narrow correctly.\n    ? IsConstantTuple<S>\n    // When T isn't a literal type but the items in S are we can narrow the\n    // type because it won't affect the negated side (`Exclude<number, 3>`\n    // is still `number`).\n    : IsLiteral<S[number]>;\n\n/**\n * Checks if the item is included in the container. This is a wrapper around\n * `Array.prototype.includes` and `Set.prototype.has` and thus relies on the\n * same equality checks that those functions do (which is reference equality,\n * e.g. `===`). In some cases the input's type is also narrowed to the\n * container's item types.\n *\n * Notice that unlike most functions, this function takes a generic item as it's\n * data and **an array** as it's parameter.\n *\n * @param data - The item that is checked.\n * @param container - The items that are checked against.\n * @returns `true` if the item is in the container, or `false` otherwise. In\n * cases the type of `data` is also narrowed down.\n * @signature\n *   P.isIncludedIn(data, container);\n * @example\n *   P.isIncludedIn(2, [1, 2, 3]); // => true\n *   P.isIncludedIn(4, [1, 2, 3]); // => false\n *\n *   const data = \"cat\" as \"cat\" | \"dog\" | \"mouse\";\n *   P.isIncludedIn(data, [\"cat\", \"dog\"] as const); // true (typed \"cat\" | \"dog\");\n * @dataFirst\n * @category Guard\n */\nexport function isIncludedIn<T, S extends IterableContainer<T>>(\n  data: T,\n  container: IsNarrowable<T, S> extends true ? S : never,\n): data is S[number];\nexport function isIncludedIn<T, S extends T>(\n  data: T,\n  container: IterableContainer<S>,\n): boolean;\n\n/**\n * Checks if the item is included in the container. This is a wrapper around\n * `Array.prototype.includes` and `Set.prototype.has` and thus relies on the\n * same equality checks that those functions do (which is reference equality,\n * e.g. `===`). In some cases the input's type is also narrowed to the\n * container's item types.\n *\n * Notice that unlike most functions, this function takes a generic item as it's\n * data and **an array** as it's parameter.\n *\n * @param container - The items that are checked against.\n * @returns `true` if the item is in the container, or `false` otherwise. In\n * cases the type of `data` is also narrowed down.\n * @signature\n *   P.isIncludedIn(container)(data);\n * @example\n *   P.pipe(2, P.isIncludedIn([1, 2, 3])); // => true\n *   P.pipe(4, P.isIncludedIn([1, 2, 3])); // => false\n *\n *   const data = \"cat\" as \"cat\" | \"dog\" | \"mouse\";\n *   P.pipe(\n *     data,\n *     P.isIncludedIn([\"cat\", \"dog\"] as const),\n *   ); // => true (typed \"cat\" | \"dog\");\n * @dataLast\n * @category Guard\n */\nexport function isIncludedIn<T, S extends IterableContainer<T>>(\n  container: IsNarrowable<T, S> extends true ? S : never,\n): (data: T) => data is S[number];\nexport function isIncludedIn<T, S extends T>(\n  container: IterableContainer<S>,\n): (data: T) => boolean;\n\nexport function isIncludedIn(\n  dataOrContainer: unknown,\n  container?: ReadonlyArray<unknown>,\n): unknown {\n  if (container === undefined) {\n    // === dataLast ===\n    // We don't use curry here because we can optimize the dataLast case by\n    // memoizing a set and accessing it in O(1) time instead of scanning the\n    // array **each time** (O(n)) each time.\n    const asSet = new Set(dataOrContainer as ReadonlyArray<unknown>);\n    return (data: unknown) => asSet.has(data);\n  }\n\n  // === dataFirst ===\n  return container.includes(dataOrContainer);\n}\n"],"mappings":"AA0IA,SAAgB,EACd,EACA,EACS,CACT,GAAI,IAAc,IAAA,GAAW,CAK3B,IAAM,EAAQ,IAAI,IAAI,EAA0C,CAChE,MAAQ,IAAkB,EAAM,IAAI,EAAK,CAI3C,OAAO,EAAU,SAAS,EAAgB"}
+{"version":3,"file":"is-included-in.js","names":[],"sources":["../src/is-included-in.ts"],"sourcesContent":["import type { IsLiteral, IsUnion } from 'type-fest';\nimport type { IterableContainer } from './internal/types/iterable-container';\n\n/**\n * A \"constant\" tuple is a type that has a single runtime value that can fulfil\n * it. This means that it doesn't have any variadic/rest/spread/array parts, and\n * that all it's values are singular (non-union) literals.\n *\n * We use this type to allow narrowing when checking against a set of values\n * defined as a const.\n *\n * @example\n *   type T1 = IsConstantTuple<[\"cat\", \"dog\", 3, true]>; // => true;\n *   type T2 = IsConstantTuple<[\"cat\" | \"dog\"]>; // false;\n *   type T2 = IsConstantTuple<[\"cat\", ...Array<\"cat\">]>; // false;\n */\ntype IsConstantTuple<T extends IterableContainer> = T extends readonly []\n  ? true\n  : T extends readonly [infer Head, ...infer Rest]\n    ? IsUnion<Head> extends true\n      ? false\n      : IsConstantTuple<Rest>\n    : false;\n\n/**\n * There is no way to tell Typescript to only narrow the \"accepted\" side of a\n * type-predicate and so in many cases the negated side is also affected, this\n * results in over-narrowing in many cases, breaking typing. For this reason we\n * only want to use the type-predicate variant of `isIncludedIn` when we can\n * assume the result represents the expected types (closely enough). This is not\n * and ideal solution and we will still generate wrong types in some cases (see\n * tests), but it reduces the surface of this problem significantly, while still\n * keeping the utility of `isIncludedIn` for the common cases.\n *\n * TL;DR - The types are narrowable when: T is literal and S is a pure tuple, or\n * when T isn't a literal, but S is.\n *\n * @example\n *   const data = 1 as 1 | 2 | 3;\n *   const container = [] as Array<1 | 2>;\n *   if (isIncludedIn(data, container)) {\n *     ... it makes sense to narrow data to `1 | 2` as the value `3` is not part\n *     ... of the typing of container, so will never result in being true.\n *   } else {\n *     ... but it doesn't make sense to narrow the value to 3 here, because 1\n *     ... and 2 are still valid values for data, when container doesn't include\n *     ... them **at runtime**.\n *     ... Typescript narrows the _rejected_ branch based on how it narrowed the\n *     ... _accepted_ clause, and we can't control that; because our input type\n *     ... is `1 | 2 | 3` and the accepted side is `1 | 2`, the rejected side is\n *     ... typed `Exclude<1 | 2 | 3, 1 | 2>`, which is `3`.\n *   }\n * }\n */\ntype IsNarrowable<T, S extends IterableContainer<T>>\n  = IsLiteral<T> extends true\n    // When T is literal (i.g. it isn't a primitive type like `string` or\n    // `number`) then the criteria for narrowing is that the container is a\n    // \"pure\" tuple because we *assume* that S represents a constant set of\n    // values, and that it's typing also represents it's runtime content 1-\n    // for-1. If S isn't a pure tuple it means we can't tell from the typing\n    // which of it's values are actually present in runtime so can't use them\n    // to narrow correctly.\n    ? IsConstantTuple<S>\n    // When T isn't a literal type but the items in S are we can narrow the\n    // type because it won't affect the negated side (`Exclude<number, 3>`\n    // is still `number`).\n    : IsLiteral<S[number]>;\n\n/**\n * Checks if the item is included in the container. This is a wrapper around\n * `Array.prototype.includes` and `Set.prototype.has` and thus relies on the\n * same equality checks that those functions do (which is reference equality,\n * e.g. `===`). In some cases the input's type is also narrowed to the\n * container's item types.\n *\n * Notice that unlike most functions, this function takes a generic item as it's\n * data and **an array** as it's parameter.\n *\n * @param data - The item that is checked.\n * @param container - The items that are checked against.\n * @returns `true` if the item is in the container, or `false` otherwise. In\n * cases the type of `data` is also narrowed down.\n * @signature\n *   P.isIncludedIn(data, container);\n * @example\n *   P.isIncludedIn(2, [1, 2, 3]); // => true\n *   P.isIncludedIn(4, [1, 2, 3]); // => false\n *\n *   const data = \"cat\" as \"cat\" | \"dog\" | \"mouse\";\n *   P.isIncludedIn(data, [\"cat\", \"dog\"] as const); // true (typed \"cat\" | \"dog\");\n * @dataFirst\n * @category Guard\n */\nexport function isIncludedIn<T, S extends IterableContainer<T>>(\n  data: T,\n  container: IsNarrowable<T, S> extends true ? S : never,\n): data is S[number];\nexport function isIncludedIn<T, S extends T>(\n  data: T,\n  container: IterableContainer<S>,\n): boolean;\n\n/**\n * Checks if the item is included in the container. This is a wrapper around\n * `Array.prototype.includes` and `Set.prototype.has` and thus relies on the\n * same equality checks that those functions do (which is reference equality,\n * e.g. `===`). In some cases the input's type is also narrowed to the\n * container's item types.\n *\n * Notice that unlike most functions, this function takes a generic item as it's\n * data and **an array** as it's parameter.\n *\n * @param container - The items that are checked against.\n * @returns `true` if the item is in the container, or `false` otherwise. In\n * cases the type of `data` is also narrowed down.\n * @signature\n *   P.isIncludedIn(container)(data);\n * @example\n *   P.pipe(2, P.isIncludedIn([1, 2, 3])); // => true\n *   P.pipe(4, P.isIncludedIn([1, 2, 3])); // => false\n *\n *   const data = \"cat\" as \"cat\" | \"dog\" | \"mouse\";\n *   P.pipe(\n *     data,\n *     P.isIncludedIn([\"cat\", \"dog\"] as const),\n *   ); // => true (typed \"cat\" | \"dog\");\n * @dataLast\n * @category Guard\n */\nexport function isIncludedIn<T, S extends IterableContainer<T>>(\n  container: IsNarrowable<T, S> extends true ? S : never,\n): (data: T) => data is S[number];\nexport function isIncludedIn<T, S extends T>(\n  container: IterableContainer<S>,\n): (data: T) => boolean;\n\nexport function isIncludedIn(\n  dataOrContainer: unknown,\n  container?: ReadonlyArray<unknown>,\n): unknown {\n  if (container === undefined) {\n    // === dataLast ===\n    // We don't use curry here because we can optimize the dataLast case by\n    // memoizing a set and accessing it in O(1) time instead of scanning the\n    // array **each time** (O(n)) each time.\n    const asSet = new Set(dataOrContainer as ReadonlyArray<unknown>);\n    return (data: unknown) => asSet.has(data);\n  }\n\n  // === dataFirst ===\n  return container.includes(dataOrContainer);\n}\n"],"mappings":"AAyIA,SAAgB,EACd,EACA,EACS,CACT,GAAI,IAAc,IAAA,GAAW,CAK3B,IAAM,EAAQ,IAAI,IAAI,EAA0C,CAChE,MAAQ,IAAkB,EAAM,IAAI,EAAK,CAI3C,OAAO,EAAU,SAAS,EAAgB"}

package/dist/is-nullish.d.cts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-Yf5qTOcD.cjs";
+import { t as NarrowedTo } from "./narrowed-to-D_6H-aZW.cjs";
 
 //#region src/is-nullish.d.ts
 

package/dist/is-nullish.d.ts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-j75i8Rl2.js";
+import { t as NarrowedTo } from "./narrowed-to-B7tkuY2k.js";
 
 //#region src/is-nullish.d.ts
 

package/dist/is-number.d.cts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-Yf5qTOcD.cjs";
+import { t as NarrowedTo } from "./narrowed-to-D_6H-aZW.cjs";
 
 //#region src/is-number.d.ts
 

package/dist/is-number.d.ts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-j75i8Rl2.js";
+import { t as NarrowedTo } from "./narrowed-to-B7tkuY2k.js";
 
 //#region src/is-number.d.ts
 

package/dist/is-object-type.d.cts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-Yf5qTOcD.cjs";
+import { t as NarrowedTo } from "./narrowed-to-D_6H-aZW.cjs";
 
 //#region src/is-object-type.d.ts
 

package/dist/is-object-type.d.ts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-j75i8Rl2.js";
+import { t as NarrowedTo } from "./narrowed-to-B7tkuY2k.js";
 
 //#region src/is-object-type.d.ts
 

package/dist/is-plain-object.d.cts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-Yf5qTOcD.cjs";
+import { t as NarrowedTo } from "./narrowed-to-D_6H-aZW.cjs";
 
 //#region src/is-plain-object.d.ts
 

package/dist/is-plain-object.d.ts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-j75i8Rl2.js";
+import { t as NarrowedTo } from "./narrowed-to-B7tkuY2k.js";
 
 //#region src/is-plain-object.d.ts
 

package/dist/is-shallow-equal.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){if(e===t||Object.is(e,t))return!0;if(typeof e!=`object`||!e||typeof t!=`object`||!t)return!1;if(e instanceof Map&&t instanceof Map)return r(e,t);if(e instanceof Set&&t instanceof Set)return i(e,t);let n=Object.keys(e);if(n.length!==Object.keys(t).length)return!1;for(let r of n){if(!Object.prototype.hasOwnProperty.call(t,r))return!1;let{[r]:n}=e,{[r]:i}=t;if(n!==i||!Object.is(n,i))return!1}return!0}function r(e,t){if(e.size!==t.size)return!1;for(let[n,r]of e){let e=t.get(n);if(r!==e||!Object.is(r,e))return!1}return!0}function i(e,t){if(e.size!==t.size)return!1;for(let n of e)if(!t.has(n))return!1;return!0}export{t as isShallowEqual};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){if(e===t||Object.is(e,t))return!0;if(typeof e!=`object`||!e||typeof t!=`object`||!t)return!1;if(e instanceof Map&&t instanceof Map)return r(e,t);if(e instanceof Set&&t instanceof Set)return i(e,t);let n=Object.keys(e);if(n.length!==Object.keys(t).length)return!1;for(let r of n){if(!Object.prototype.hasOwnProperty.call(t,r))return!1;let{[r]:n}=e,{[r]:i}=t;if(n!==i||!Object.is(n,i))return!1}return!0}function r(e,t){if(e.size!==t.size)return!1;for(let[n,r]of e){let e=t.get(n);if(r!==e||!Object.is(r,e))return!1}return!0}function i(e,t){if(e.size!==t.size)return!1;for(let n of e)if(!t.has(n))return!1;return!0}export{t as isShallowEqual};
 //# sourceMappingURL=is-shallow-equal.js.map

package/dist/is-strict-equal.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){return e===t||Object.is(e,t)}export{t as isStrictEqual};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){return e===t||Object.is(e,t)}export{t as isStrictEqual};
 //# sourceMappingURL=is-strict-equal.js.map

package/dist/is-string.d.cts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-Yf5qTOcD.cjs";
+import { t as NarrowedTo } from "./narrowed-to-D_6H-aZW.cjs";
 
 //#region src/is-string.d.ts
 

package/dist/is-string.d.ts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-j75i8Rl2.js";
+import { t as NarrowedTo } from "./narrowed-to-B7tkuY2k.js";
 
 //#region src/is-string.d.ts
 

package/dist/is-symbol.d.cts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-Yf5qTOcD.cjs";
+import { t as NarrowedTo } from "./narrowed-to-D_6H-aZW.cjs";
 
 //#region src/is-symbol.d.ts
 

package/dist/is-symbol.d.ts

@@ -1,4 +1,4 @@
-import { t as NarrowedTo } from "./narrowed-to-j75i8Rl2.js";
+import { t as NarrowedTo } from "./narrowed-to-B7tkuY2k.js";
 
 //#region src/is-symbol.d.ts
 

package/dist/{iterable-container-OFsaw8WL.d.cts → iterable-container-1TN3AJ3s.d.cts}

@@ -14,4 +14,4 @@
 type IterableContainer<T = unknown> = readonly [] | ReadonlyArray<T>;
 //#endregion
 export { IterableContainer as t };
-//# sourceMappingURL=iterable-container-OFsaw8WL.d.cts.map
+//# sourceMappingURL=iterable-container-1TN3AJ3s.d.cts.map

package/dist/{iterable-container-OFsaw8WL.d.cts.map → iterable-container-1TN3AJ3s.d.cts.map}

@@ -1 +1 @@
-{"version":3,"file":"iterable-container-OFsaw8WL.d.cts","names":[],"sources":["../src/internal/types/iterable-container.ts"],"sourcesContent":[],"mappings":";;AAYA;;;;;;;;;;;KAAY,+CAA+C,cAAc"}
+{"version":3,"file":"iterable-container-1TN3AJ3s.d.cts","names":[],"sources":["../src/internal/types/iterable-container.ts"],"sourcesContent":[],"mappings":";;AAYA;;;;;;;;;;;KAAY,+CAA+C,cAAc"}

package/dist/{iterable-container-BdjPuIjL.d.ts → iterable-container-Dv5vSKht.d.ts}

@@ -14,4 +14,4 @@
 type IterableContainer<T = unknown> = readonly [] | ReadonlyArray<T>;
 //#endregion
 export { IterableContainer as t };
-//# sourceMappingURL=iterable-container-BdjPuIjL.d.ts.map
+//# sourceMappingURL=iterable-container-Dv5vSKht.d.ts.map

package/dist/iterable-container-Dv5vSKht.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterable-container-Dv5vSKht.d.ts","names":[],"sources":["../src/internal/types/iterable-container.ts"],"sourcesContent":[],"mappings":";;AAYA;;;;;;;;;;;KAAY,+CAA+C,cAAc"}

package/dist/join.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){return e.join(t)}export{t as join};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){return e.join(t)}export{t as join};
 //# sourceMappingURL=join.js.map

package/dist/keys.d.cts

@@ -1,6 +1,6 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
-import { t as ToString } from "./to-string-Se4KcQka.cjs";
-import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-FUg082M_.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
+import { t as ToString } from "./to-string-DkC3zRUJ.cjs";
+import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-DhcNc5iz.cjs";
 
 //#region src/keys.d.ts
 type Keys<T> = T extends IterableContainer ? ArrayKeys<T> : ObjectKeys<T>;

package/dist/keys.d.ts

@@ -1,6 +1,6 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
-import { t as ToString } from "./to-string-C6_OnZ6e.js";
-import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-DMAkBhMk.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
+import { t as ToString } from "./to-string-YIFx2KS6.js";
+import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-CZQf3ld_.js";
 
 //#region src/keys.d.ts
 type Keys<T> = T extends IterableContainer ? ArrayKeys<T> : ObjectKeys<T>;

package/dist/keys.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(Object.keys,t)}export{t as keys};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(Object.keys,t)}export{t as keys};
 //# sourceMappingURL=keys.js.map

package/dist/last.d.cts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
 import { LastArrayElement } from "type-fest";
 
 //#region src/last.d.ts

package/dist/last.d.ts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
 import { LastArrayElement } from "type-fest";
 
 //#region src/last.d.ts

package/dist/last.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e){return e.at(-1)}export{t as last};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e){return e.at(-1)}export{t as last};
 //# sourceMappingURL=last.js.map

package/dist/{lazy-data-last-impl-DW5TXWv8.js → lazy-data-last-impl-R05wr4K6.js}

@@ -1,2 +1,2 @@
 function e(e,t,n){let r=n=>e(n,...t);return n===void 0?r:Object.assign(r,{lazy:n,lazyArgs:t})}export{e as t};
-//# sourceMappingURL=lazy-data-last-impl-DW5TXWv8.js.map
+//# sourceMappingURL=lazy-data-last-impl-R05wr4K6.js.map

package/dist/lazy-data-last-impl-R05wr4K6.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lazy-data-last-impl-R05wr4K6.js","names":[],"sources":["../src/internal/lazy-data-last-impl.ts"],"sourcesContent":["/* eslint-disable ts/no-explicit-any */\n\nimport type { LazyEvaluator } from './types/lazy-evaluator';\nimport type { StrictFunction } from './types/strict-function';\n\n/**\n * Use this helper function to build the data last implementation together with\n * a lazy implementation. Use this when you need to build your own currying\n * logic when you want to decide between dataFirst and dataLast on something\n * that isn't the number of arguments provided. This is useful for implementing\n * functions with optional or variadic arguments.\n */\nexport function lazyDataLastImpl(\n  fn: StrictFunction,\n  args: ReadonlyArray<unknown>,\n  lazy?: (...args: any) => LazyEvaluator,\n  // TODO: We can probably provide better typing to the return type...\n): unknown {\n  // @ts-expect-error [ts2345] -- This error is accurate because we don't know\n  // anything about `fn` so can't ensure that we are passing the correct\n  // arguments to it, we just have to trust that the caller knows what they are\n  // doing.\n  const dataLast = (data: unknown): unknown => fn(data, ...args);\n\n  return lazy === undefined\n    ? dataLast\n    : Object.assign(dataLast, { lazy, lazyArgs: args });\n}\n"],"mappings":"AAYA,SAAgB,EACd,EACA,EACA,EAES,CAKT,IAAM,EAAY,GAA2B,EAAG,EAAM,GAAG,EAAK,CAE9D,OAAO,IAAS,IAAA,GACZ,EACA,OAAO,OAAO,EAAU,CAAE,OAAM,SAAU,EAAM,CAAC"}

package/dist/length.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e){return`length`in e?e.length:[...e].length}export{t as length};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e){return`length`in e?e.length:[...e].length}export{t as length};
 //# sourceMappingURL=length.js.map

package/dist/{magic-string.es-BY9a6RR2.js → magic-string.es-94aXgwpn.js}

@@ -12,4 +12,4 @@ var e=44,t=59,n=`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+
 `),e!==-1)return n.content.substr(e+1)+t;t=n.content+t}if(n.intro.length>0){if(e=n.intro.lastIndexOf(`
 `),e!==-1)return n.intro.substr(e+1)+t;t=n.intro+t}}while(n=n.previous);return e=this.intro.lastIndexOf(`
 `),e===-1?this.intro+t:this.intro.substr(e+1)+t}slice(e=0,t=this.original.length-this.offset){if(e+=this.offset,t+=this.offset,this.original.length!==0){for(;e<0;)e+=this.original.length;for(;t<0;)t+=this.original.length}let n=``,r=this.firstChunk;for(;r&&(r.start>e||r.end<=e);){if(r.start<t&&r.end>=t)return n;r=r.next}if(r&&r.edited&&r.start!==e)throw Error(`Cannot use replaced character ${e} as slice start anchor.`);let i=r;for(;r;){r.intro&&(i!==r||r.start===e)&&(n+=r.intro);let a=r.start<t&&r.end>=t;if(a&&r.edited&&r.end!==t)throw Error(`Cannot use replaced character ${t} as slice end anchor.`);let o=i===r?e-r.start:0,s=a?r.content.length+t-r.end:r.content.length;if(n+=r.content.slice(o,s),r.outro&&(!a||r.end===t)&&(n+=r.outro),a)break;r=r.next}return n}snip(e,t){let n=this.clone();return n.remove(0,e),n.remove(t,n.original.length),n}_split(e){if(this.byStart[e]||this.byEnd[e])return;let t=this.lastSearchedChunk,n=t,r=e>t.end;for(;t;){if(t.contains(e))return this._splitChunk(t,e);if(t=r?this.byStart[t.end]:this.byEnd[t.start],t===n)return;n=t}}_splitChunk(e,t){if(e.edited&&e.content.length){let n=y(this.original)(t);throw Error(`Cannot split a chunk that has already been edited (${n.line}:${n.column} – "${e.original}")`)}let n=e.split(t);return this.byEnd[t]=e,this.byStart[t]=n,this.byEnd[n.end]=n,e===this.lastChunk&&(this.lastChunk=n),this.lastSearchedChunk=e,!0}toString(){let e=this.intro,t=this.firstChunk;for(;t;)e+=t.toString(),t=t.next;return e+this.outro}isEmpty(){let e=this.firstChunk;do if(e.intro.length&&e.intro.trim()||e.content.length&&e.content.trim()||e.outro.length&&e.outro.trim())return!1;while(e=e.next);return!0}length(){let e=this.firstChunk,t=0;do t+=e.intro.length+e.content.length+e.outro.length;while(e=e.next);return t}trimLines(){return this.trim(`[\\r\\n]`)}trim(e){return this.trimStart(e).trimEnd(e)}trimEndAborted(e){let t=RegExp((e||`\\s`)+`+$`);if(this.outro=this.outro.replace(t,``),this.outro.length)return!0;let n=this.lastChunk;do{let e=n.end,r=n.trimEnd(t);if(n.end!==e&&(this.lastChunk===n&&(this.lastChunk=n.next),this.byEnd[n.end]=n,this.byStart[n.next.start]=n.next,this.byEnd[n.next.end]=n.next),r)return!0;n=n.previous}while(n);return!1}trimEnd(e){return this.trimEndAborted(e),this}trimStartAborted(e){let t=RegExp(`^`+(e||`\\s`)+`+`);if(this.intro=this.intro.replace(t,``),this.intro.length)return!0;let n=this.firstChunk;do{let e=n.end,r=n.trimStart(t);if(n.end!==e&&(n===this.lastChunk&&(this.lastChunk=n.next),this.byEnd[n.end]=n,this.byStart[n.next.start]=n.next,this.byEnd[n.next.end]=n.next),r)return!0;n=n.next}while(n);return!1}trimStart(e){return this.trimStartAborted(e),this}hasChanged(){return this.original!==this.toString()}_replaceRegexp(e,t){function n(e,n){return typeof t==`string`?t.replace(/\$(\$|&|\d+)/g,(t,n)=>n===`$`?`$`:n===`&`?e[0]:+n<e.length?e[+n]:`$${n}`):t(...e,e.index,n,e.groups)}function r(e,t){let n,r=[];for(;n=e.exec(t);)r.push(n);return r}if(e.global)r(e,this.original).forEach(e=>{if(e.index!=null){let t=n(e,this.original);t!==e[0]&&this.overwrite(e.index,e.index+e[0].length,t)}});else{let t=this.original.match(e);if(t&&t.index!=null){let e=n(t,this.original);e!==t[0]&&this.overwrite(t.index,t.index+t[0].length,e)}}return this}_replaceString(e,t){let{original:n}=this,r=n.indexOf(e);return r!==-1&&(typeof t==`function`&&(t=t(e,r,n)),e!==t&&this.overwrite(r,r+e.length,t)),this}replace(e,t){return typeof e==`string`?this._replaceString(e,t):this._replaceRegexp(e,t)}_replaceAllString(e,t){let{original:n}=this,r=e.length;for(let i=n.indexOf(e);i!==-1;i=n.indexOf(e,i+r)){let e=n.slice(i,i+r),a=t;typeof t==`function`&&(a=t(e,i,n)),e!==a&&this.overwrite(i,i+r,a)}return this}replaceAll(e,t){if(typeof e==`string`)return this._replaceAllString(e,t);if(!e.global)throw TypeError(`MagicString.prototype.replaceAll called with a non-global RegExp argument`);return this._replaceRegexp(e,t)}};export{C as default};
-//# sourceMappingURL=magic-string.es-BY9a6RR2.js.map
+//# sourceMappingURL=magic-string.es-94aXgwpn.js.map