@visulima/object 1.0.6 → 1.0.8

package/CHANGELOG.md

@@ -1,3 +1,29 @@
+## @visulima/object [1.0.8](https://github.com/visulima/visulima/compare/@visulima/object@1.0.7...@visulima/object@1.0.8) (2025-01-12)
+
+### Bug Fixes
+
+* updated @visulima/packem, and all other dev dependencies ([7797a1c](https://github.com/visulima/visulima/commit/7797a1c3e6f1fc532895247bd88285a8a9883c40))
+
+### Miscellaneous Chores
+
+* updated dev dependencies ([9de2eab](https://github.com/visulima/visulima/commit/9de2eab91e95c8b9289d12f863a5167218770650))
+
+## @visulima/object [1.0.7](https://github.com/visulima/visulima/compare/@visulima/object@1.0.6...@visulima/object@1.0.7) (2024-12-12)
+
+### Bug Fixes
+
+* allow node v23 ([8ca929a](https://github.com/visulima/visulima/commit/8ca929af311ce8036cbbfde68b6db05381b860a5))
+* allowed node 23, updated dev dependencies ([f99d34e](https://github.com/visulima/visulima/commit/f99d34e01f6b13be8586a1b5d37dc8b8df0a5817))
+* updated packem to v1.8.2 ([23f869b](https://github.com/visulima/visulima/commit/23f869b4120856cc97e2bffa6d508e2ae30420ea))
+
+### Styles
+
+* cs fixes ([46d31e0](https://github.com/visulima/visulima/commit/46d31e082e1865262bf380859c14fabd28ff456d))
+
+### Miscellaneous Chores
+
+* updated dev dependencies ([a916944](https://github.com/visulima/visulima/commit/a916944b888bb34c34b0c54328b38d29e4399857))
+
 ## @visulima/object [1.0.6](https://github.com/visulima/visulima/compare/@visulima/object@1.0.5...@visulima/object@1.0.6) (2024-10-05)
 
 ### Bug Fixes

package/LICENSE.md

@@ -121,4 +121,126 @@ License: (MIT OR CC0-1.0)
 By: Sindre Sorhus
 Repository: sindresorhus/type-fest
 
+> Creative Commons Legal Code
+>
+> CC0 1.0 Universal
+>
+>     CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
+>     LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
+>     ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
+>     INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
+>     REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
+>     PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
+>     THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
+>     HEREUNDER.
+>
+> Statement of Purpose
+>
+> The laws of most jurisdictions throughout the world automatically confer
+> exclusive Copyright and Related Rights (defined below) upon the creator
+> and subsequent owner(s) (each and all, an "owner") of an original work of
+> authorship and/or a database (each, a "Work").
+>
+> Certain owners wish to permanently relinquish those rights to a Work for
+> the purpose of contributing to a commons of creative, cultural and
+> scientific works ("Commons") that the public can reliably and without fear
+> of later claims of infringement build upon, modify, incorporate in other
+> works, reuse and redistribute as freely as possible in any form whatsoever
+> and for any purposes, including without limitation commercial purposes.
+> These owners may contribute to the Commons to promote the ideal of a free
+> culture and the further production of creative, cultural and scientific
+> works, or to gain reputation or greater distribution for their Work in
+> part through the use and efforts of others.
+>
+> For these and/or other purposes and motivations, and without any
+> expectation of additional consideration or compensation, the person
+> associating CC0 with a Work (the "Affirmer"), to the extent that he or she
+> is an owner of Copyright and Related Rights in the Work, voluntarily
+> elects to apply CC0 to the Work and publicly distribute the Work under its
+> terms, with knowledge of his or her Copyright and Related Rights in the
+> Work and the meaning and intended legal effect of CC0 on those rights.
+>
+> 1. Copyright and Related Rights. A Work made available under CC0 may be
+> protected by copyright and related or neighboring rights ("Copyright and
+> Related Rights"). Copyright and Related Rights include, but are not
+> limited to, the following:
+>
+>   i. the right to reproduce, adapt, distribute, perform, display,
+>      communicate, and translate a Work;
+>  ii. moral rights retained by the original author(s) and/or performer(s);
+> iii. publicity and privacy rights pertaining to a person's image or
+>      likeness depicted in a Work;
+>  iv. rights protecting against unfair competition in regards to a Work,
+>      subject to the limitations in paragraph 4(a), below;
+>   v. rights protecting the extraction, dissemination, use and reuse of data
+>      in a Work;
+>  vi. database rights (such as those arising under Directive 96/9/EC of the
+>      European Parliament and of the Council of 11 March 1996 on the legal
+>      protection of databases, and under any national implementation
+>      thereof, including any amended or successor version of such
+>      directive); and
+> vii. other similar, equivalent or corresponding rights throughout the
+>      world based on applicable law or treaty, and any national
+>      implementations thereof.
+>
+> 2. Waiver. To the greatest extent permitted by, but not in contravention
+> of, applicable law, Affirmer hereby overtly, fully, permanently,
+> irrevocably and unconditionally waives, abandons, and surrenders all of
+> Affirmer's Copyright and Related Rights and associated claims and causes
+> of action, whether now known or unknown (including existing as well as
+> future claims and causes of action), in the Work (i) in all territories
+> worldwide, (ii) for the maximum duration provided by applicable law or
+> treaty (including future time extensions), (iii) in any current or future
+> medium and for any number of copies, and (iv) for any purpose whatsoever,
+> including without limitation commercial, advertising or promotional
+> purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
+> member of the public at large and to the detriment of Affirmer's heirs and
+> successors, fully intending that such Waiver shall not be subject to
+> revocation, rescission, cancellation, termination, or any other legal or
+> equitable action to disrupt the quiet enjoyment of the Work by the public
+> as contemplated by Affirmer's express Statement of Purpose.
+>
+> 3. Public License Fallback. Should any part of the Waiver for any reason
+> be judged legally invalid or ineffective under applicable law, then the
+> Waiver shall be preserved to the maximum extent permitted taking into
+> account Affirmer's express Statement of Purpose. In addition, to the
+> extent the Waiver is so judged Affirmer hereby grants to each affected
+> person a royalty-free, non transferable, non sublicensable, non exclusive,
+> irrevocable and unconditional license to exercise Affirmer's Copyright and
+> Related Rights in the Work (i) in all territories worldwide, (ii) for the
+> maximum duration provided by applicable law or treaty (including future
+> time extensions), (iii) in any current or future medium and for any number
+> of copies, and (iv) for any purpose whatsoever, including without
+> limitation commercial, advertising or promotional purposes (the
+> "License"). The License shall be deemed effective as of the date CC0 was
+> applied by Affirmer to the Work. Should any part of the License for any
+> reason be judged legally invalid or ineffective under applicable law, such
+> partial invalidity or ineffectiveness shall not invalidate the remainder
+> of the License, and in such case Affirmer hereby affirms that he or she
+> will not (i) exercise any of his or her remaining Copyright and Related
+> Rights in the Work or (ii) assert any associated claims and causes of
+> action with respect to the Work, in either case contrary to Affirmer's
+> express Statement of Purpose.
+>
+> 4. Limitations and Disclaimers.
+>
+>  a. No trademark or patent rights held by Affirmer are waived, abandoned,
+>     surrendered, licensed or otherwise affected by this document.
+>  b. Affirmer offers the Work as-is and makes no representations or
+>     warranties of any kind concerning the Work, express, implied,
+>     statutory or otherwise, including without limitation warranties of
+>     title, merchantability, fitness for a particular purpose, non
+>     infringement, or the absence of latent or other defects, accuracy, or
+>     the present or absence of errors, whether or not discoverable, all to
+>     the greatest extent permissible under applicable law.
+>  c. Affirmer disclaims responsibility for clearing rights of other persons
+>     that may apply to the Work or any use thereof, including without
+>     limitation any person's Copyright and Related Rights in the Work.
+>     Further, Affirmer disclaims responsibility for obtaining any necessary
+>     consents, permissions or other rights required for any use of the
+>     Work.
+>  d. Affirmer understands and acknowledges that Creative Commons is not a
+>     party to this document and has no duty or obligation with respect to
+>     this CC0 or use of the Work.
+
 <!-- /TYPE_DEPENDENCIES -->

package/README.md

@@ -101,12 +101,12 @@ omit(doc, ["items.discard"]);
 
 ## Related
 
--   [is-plain-object](https://github.com/jonschlinkert/is-plain-object) - Returns true if the given value is an object created by the Object constructor.
--   [is-plain-obj][is-plain-obj] - Check if a value is a plain object.
--   [dot-prop][dot-prop] - Get, set, or delete a property from a nested object using a dot path.
--   [ts-dot-prop](https://github.com/justinlettau/ts-dot-prop) - TypeScript utility to transform nested objects using a dot notation path.
--   [dset](https://www.npmjs.com/package/dset) - A tiny (194B) utility for safely writing deep Object values~!
--   [filter-anything](https://github.com/mesqueeb/filter-anything) - A simple (TypeScript) integration of "pick" and "omit" to filter props of an object.
+- [is-plain-object](https://github.com/jonschlinkert/is-plain-object) - Returns true if the given value is an object created by the Object constructor.
+- [is-plain-obj][is-plain-obj] - Check if a value is a plain object.
+- [dot-prop][dot-prop] - Get, set, or delete a property from a nested object using a dot path.
+- [ts-dot-prop](https://github.com/justinlettau/ts-dot-prop) - TypeScript utility to transform nested objects using a dot notation path.
+- [dset](https://www.npmjs.com/package/dset) - A tiny (194B) utility for safely writing deep Object values~!
+- [filter-anything](https://github.com/mesqueeb/filter-anything) - A simple (TypeScript) integration of "pick" and "omit" to filter props of an object.
 
 ## Supported Node.js Versions
 
@@ -121,8 +121,8 @@ If you would like to help take a look at the [list of issues](https://github.com
 
 ## Credits
 
--   [Daniel Bannert](https://github.com/prisis)
--   [All Contributors](https://github.com/visulima/visulima/graphs/contributors)
+- [Daniel Bannert](https://github.com/prisis)
+- [All Contributors](https://github.com/visulima/visulima/graphs/contributors)
 
 ## License
 

package/dist/index.cjs

@@ -1 +1,187 @@
-"use strict";var S=Object.defineProperty;var u=(a,l)=>S(a,"name",{value:l,configurable:!0});Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const E=require("./packem_shared/omit-Cwc8rJUb.cjs"),R=require("./packem_shared/pick-CkwC0jUm.cjs"),y=require("./packem_shared/getProperty-D34HTBAJ.cjs"),T=require("./packem_shared/isPlainObject-BTLAczOE.cjs");var s={},o={},A;function L(){if(A)return o;A=1,Object.defineProperty(o,"__esModule",{value:!0}),o.isDocumentToRecurOn=o.flatten=o.unique=void 0;function a(f){return[...new Set(f)]}u(a,"unique"),o.unique=a;function l(f){return[].concat(...f)}u(l,"flatten"),o.flatten=l;function d(f){return typeof f=="object"&&f!==null&&!Array.isArray(f)&&Object.keys(f).length}return u(d,"isDocumentToRecurOn"),o.isDocumentToRecurOn=d,o}u(L,"requireUtils");var O={},q;function w(){return q||(q=1,Object.defineProperty(O,"__esModule",{value:!0})),O}u(w,"requireTypes");var h;function x(){return h||(h=1,function(a){var l=s&&s.__createBinding||(Object.create?function(r,e,t,i){i===void 0&&(i=t);var n=Object.getOwnPropertyDescriptor(e,t);(!n||("get"in n?!e.__esModule:n.writable||n.configurable))&&(n={enumerable:!0,get:u(function(){return e[t]},"get")}),Object.defineProperty(r,i,n)}:function(r,e,t,i){i===void 0&&(i=t),r[i]=e[t]}),d=s&&s.__setModuleDefault||(Object.create?function(r,e){Object.defineProperty(r,"default",{enumerable:!0,value:e})}:function(r,e){r.default=e}),f=s&&s.__importStar||function(r){if(r&&r.__esModule)return r;var e={};if(r!=null)for(var t in r)t!=="default"&&Object.prototype.hasOwnProperty.call(r,t)&&l(e,r,t);return d(e,r),e},m=s&&s.__exportStar||function(r,e){for(var t in r)t!=="default"&&!Object.prototype.hasOwnProperty.call(e,t)&&l(e,r,t)};Object.defineProperty(a,"__esModule",{value:!0}),a.deepKeysFromList=a.deepKeys=void 0;const c=f(L());m(w(),a);function g(r,e){const t=P(e);return typeof r=="object"&&r!==null?b("",r,t):[]}u(g,"deepKeys"),a.deepKeys=g;function _(r,e){const t=P(e);return r.map(i=>typeof i=="object"&&i!==null?g(i,t):[])}u(_,"deepKeysFromList"),a.deepKeysFromList=_;function b(r,e,t){const i=Object.keys(e).map(n=>{const p=v(r,j(n,t));return t.expandNestedObjects&&c.isDocumentToRecurOn(e[n])||t.arrayIndexesAsKeys&&Array.isArray(e[n])&&e[n].length?b(p,e[n],t):t.expandArrayObjects&&Array.isArray(e[n])?M(e[n],p,t):t.ignoreEmptyArrays&&Array.isArray(e[n])&&!e[n].length?[]:p});return c.flatten(i)}u(b,"generateDeepKeysList");function M(r,e,t){let i=_(r,t);return r.length?r.length&&c.flatten(i).length===0?[e]:(i=i.map(n=>Array.isArray(n)&&n.length===0?[e]:n.map(p=>v(e,j(p,t)))),c.unique(c.flatten(i))):t.ignoreEmptyArraysWhenExpanding?[]:[e]}u(M,"processArrayKeys");function j(r,e){return e.escapeNestedDots?r.replace(/\./g,"\\."):r}u(j,"escapeNestedDotsIfSpecified");function v(r,e){return r?r+"."+e:e}u(v,"buildKeyName");function P(r){return{arrayIndexesAsKeys:!1,expandNestedObjects:!0,expandArrayObjects:!1,ignoreEmptyArraysWhenExpanding:!1,escapeNestedDots:!1,ignoreEmptyArrays:!1,...r??{}}}u(P,"mergeOptions")}(s)),s}u(x,"requireDeeks");var D=x();exports.omit=E;exports.pick=R;exports.deleteProperty=y.deleteProperty;exports.escapePath=y.escapePath;exports.getProperty=y.getProperty;exports.hasProperty=y.hasProperty;exports.setProperty=y.setProperty;exports.isPlainObject=T;exports.deepKeys=D.deepKeys;exports.deepKeysFromList=D.deepKeysFromList;
+'use strict';
+
+Object.defineProperties(exports, { __esModule: { value: true }, [Symbol.toStringTag]: { value: 'Module' } });
+
+const omit = require('./packem_shared/omit-DSwyUtN2.cjs');
+const pick = require('./packem_shared/pick-BX11mP2m.cjs');
+const getProperty = require('./packem_shared/getProperty-BuSUBWTY.cjs');
+const isPlainObject = require('./packem_shared/isPlainObject-D2hOGcuW.cjs');
+
+var deeks = {};
+
+var utils = {};
+
+var hasRequiredUtils;
+
+function requireUtils () {
+	if (hasRequiredUtils) return utils;
+	hasRequiredUtils = 1;
+	var __defProp = Object.defineProperty;
+	var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+	Object.defineProperty(utils, "__esModule", { value: true });
+	utils.isDocumentToRecurOn = utils.flatten = utils.unique = undefined;
+	function unique(array) {
+	  return [...new Set(array)];
+	}
+	__name(unique, "unique");
+	utils.unique = unique;
+	function flatten(array) {
+	  return [].concat(...array);
+	}
+	__name(flatten, "flatten");
+	utils.flatten = flatten;
+	function isDocumentToRecurOn(val) {
+	  return typeof val === "object" && val !== null && !Array.isArray(val) && Object.keys(val).length;
+	}
+	__name(isDocumentToRecurOn, "isDocumentToRecurOn");
+	utils.isDocumentToRecurOn = isDocumentToRecurOn;
+	return utils;
+}
+
+var types = {};
+
+var hasRequiredTypes;
+
+function requireTypes () {
+	if (hasRequiredTypes) return types;
+	hasRequiredTypes = 1;
+	Object.defineProperty(types, "__esModule", { value: true });
+	return types;
+}
+
+var hasRequiredDeeks;
+
+function requireDeeks () {
+	if (hasRequiredDeeks) return deeks;
+	hasRequiredDeeks = 1;
+	(function (exports) {
+		var __defProp = Object.defineProperty;
+		var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+		var __createBinding = deeks.__createBinding || (Object.create ? function(o, m, k, k2) {
+		  if (k2 === undefined) k2 = k;
+		  var desc = Object.getOwnPropertyDescriptor(m, k);
+		  if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+		    desc = { enumerable: true, get: /* @__PURE__ */ __name(function() {
+		      return m[k];
+		    }, "get") };
+		  }
+		  Object.defineProperty(o, k2, desc);
+		} : function(o, m, k, k2) {
+		  if (k2 === undefined) k2 = k;
+		  o[k2] = m[k];
+		});
+		var __setModuleDefault = deeks.__setModuleDefault || (Object.create ? function(o, v) {
+		  Object.defineProperty(o, "default", { enumerable: true, value: v });
+		} : function(o, v) {
+		  o["default"] = v;
+		});
+		var __importStar = deeks.__importStar || function(mod) {
+		  if (mod && mod.__esModule) return mod;
+		  var result = {};
+		  if (mod != null) {
+		    for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+		  }
+		  __setModuleDefault(result, mod);
+		  return result;
+		};
+		var __exportStar = deeks.__exportStar || function(m, exports2) {
+		  for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports2, p)) __createBinding(exports2, m, p);
+		};
+		Object.defineProperty(exports, "__esModule", { value: true });
+		exports.deepKeysFromList = exports.deepKeys = undefined;
+		const utils = __importStar(requireUtils());
+		__exportStar(requireTypes(), exports);
+		function deepKeys(object, options) {
+		  const parsedOptions = mergeOptions(options);
+		  if (typeof object === "object" && object !== null) {
+		    return generateDeepKeysList("", object, parsedOptions);
+		  }
+		  return [];
+		}
+		__name(deepKeys, "deepKeys");
+		exports.deepKeys = deepKeys;
+		function deepKeysFromList(list, options) {
+		  const parsedOptions = mergeOptions(options);
+		  return list.map((document) => {
+		    if (typeof document === "object" && document !== null) {
+		      return deepKeys(document, parsedOptions);
+		    }
+		    return [];
+		  });
+		}
+		__name(deepKeysFromList, "deepKeysFromList");
+		exports.deepKeysFromList = deepKeysFromList;
+		function generateDeepKeysList(heading, data, options) {
+		  const keys = Object.keys(data).map((currentKey) => {
+		    const keyName = buildKeyName(heading, escapeNestedDotsIfSpecified(currentKey, options));
+		    if (options.expandNestedObjects && utils.isDocumentToRecurOn(data[currentKey]) || options.arrayIndexesAsKeys && Array.isArray(data[currentKey]) && data[currentKey].length) {
+		      return generateDeepKeysList(keyName, data[currentKey], options);
+		    } else if (options.expandArrayObjects && Array.isArray(data[currentKey])) {
+		      return processArrayKeys(data[currentKey], keyName, options);
+		    } else if (options.ignoreEmptyArrays && Array.isArray(data[currentKey]) && !data[currentKey].length) {
+		      return [];
+		    }
+		    return keyName;
+		  });
+		  return utils.flatten(keys);
+		}
+		__name(generateDeepKeysList, "generateDeepKeysList");
+		function processArrayKeys(subArray, currentKeyPath, options) {
+		  let subArrayKeys = deepKeysFromList(subArray, options);
+		  if (!subArray.length) {
+		    return options.ignoreEmptyArraysWhenExpanding ? [] : [currentKeyPath];
+		  } else if (subArray.length && utils.flatten(subArrayKeys).length === 0) {
+		    return [currentKeyPath];
+		  } else {
+		    subArrayKeys = subArrayKeys.map((schemaKeys) => {
+		      if (Array.isArray(schemaKeys) && schemaKeys.length === 0) {
+		        return [currentKeyPath];
+		      }
+		      return schemaKeys.map((subKey) => buildKeyName(currentKeyPath, escapeNestedDotsIfSpecified(subKey, options)));
+		    });
+		    return utils.unique(utils.flatten(subArrayKeys));
+		  }
+		}
+		__name(processArrayKeys, "processArrayKeys");
+		function escapeNestedDotsIfSpecified(key, options) {
+		  if (options.escapeNestedDots) {
+		    return key.replace(/\./g, "\\.");
+		  }
+		  return key;
+		}
+		__name(escapeNestedDotsIfSpecified, "escapeNestedDotsIfSpecified");
+		function buildKeyName(upperKeyName, currentKeyName) {
+		  if (upperKeyName) {
+		    return upperKeyName + "." + currentKeyName;
+		  }
+		  return currentKeyName;
+		}
+		__name(buildKeyName, "buildKeyName");
+		function mergeOptions(options) {
+		  return {
+		    arrayIndexesAsKeys: false,
+		    expandNestedObjects: true,
+		    expandArrayObjects: false,
+		    ignoreEmptyArraysWhenExpanding: false,
+		    escapeNestedDots: false,
+		    ignoreEmptyArrays: false,
+		    ...options ?? {}
+		  };
+		}
+		__name(mergeOptions, "mergeOptions"); 
+	} (deeks));
+	return deeks;
+}
+
+var deeksExports = requireDeeks();
+
+exports.omit = omit;
+exports.pick = pick;
+exports.deleteProperty = getProperty.deleteProperty;
+exports.escapePath = getProperty.escapePath;
+exports.getProperty = getProperty.getProperty;
+exports.hasProperty = getProperty.hasProperty;
+exports.setProperty = getProperty.setProperty;
+exports.isPlainObject = isPlainObject;
+exports.deepKeys = deeksExports.deepKeys;
+exports.deepKeysFromList = deeksExports.deepKeysFromList;

package/dist/index.d.cts

@@ -76,8 +76,8 @@ type Includes<Value extends readonly any[], Item> =
 @category Utilities
 */
 type IsEqual<A, B> =
-	(<G>() => G extends A ? 1 : 2) extends
-	(<G>() => G extends B ? 1 : 2)
+	(<G>() => G extends A & G | G ? 1 : 2) extends
+	(<G>() => G extends B & G | G ? 1 : 2)
 		? true
 		: false;
 
@@ -166,6 +166,72 @@ fn(someInterface as Simplify<SomeInterface>); // Good: transform an `interface`
 */
 type Simplify<T> = {[KeyType in keyof T]: T[KeyType]} & {};
 
+/**
+Returns a boolean for whether the given type is `never`.
+
+@link https://github.com/microsoft/TypeScript/issues/31751#issuecomment-498526919
+@link https://stackoverflow.com/a/53984913/10292952
+@link https://www.zhenghao.io/posts/ts-never
+
+Useful in type utilities, such as checking if something does not occur.
+
+@example
+```
+import type {IsNever, And} from 'type-fest';
+
+// https://github.com/andnp/SimplyTyped/blob/master/src/types/strings.ts
+type AreStringsEqual<A extends string, B extends string> =
+	And<
+		IsNever<Exclude<A, B>> extends true ? true : false,
+		IsNever<Exclude<B, A>> extends true ? true : false
+	>;
+
+type EndIfEqual<I extends string, O extends string> =
+	AreStringsEqual<I, O> extends true
+		? never
+		: void;
+
+function endIfEqual<I extends string, O extends string>(input: I, output: O): EndIfEqual<I, O> {
+	if (input === output) {
+		process.exit(0);
+	}
+}
+
+endIfEqual('abc', 'abc');
+//=> never
+
+endIfEqual('abc', '123');
+//=> void
+```
+
+@category Type Guard
+@category Utilities
+*/
+type IsNever<T> = [T] extends [never] ? true : false;
+
+/**
+An if-else-like type that resolves depending on whether the given type is `never`.
+
+@see {@link IsNever}
+
+@example
+```
+import type {IfNever} from 'type-fest';
+
+type ShouldBeTrue = IfNever<never>;
+//=> true
+
+type ShouldBeBar = IfNever<'not never', 'foo', 'bar'>;
+//=> 'bar'
+```
+
+@category Type Guard
+@category Utilities
+*/
+type IfNever<T, TypeIfNever = true, TypeIfNotNever = false> = (
+	IsNever<T> extends true ? TypeIfNever : TypeIfNotNever
+);
+
 /**
 Returns the static, fixed-length portion of the given array, excluding variable-length parts.
 
@@ -227,10 +293,14 @@ T extends readonly [...infer U] ?
 /**
 Returns whether the given array `T` is readonly.
 */
-type IsArrayReadonly<T extends UnknownArray> = T extends unknown[] ? false : true;
+type IsArrayReadonly<T extends UnknownArray> = IfNever<T, false, T extends unknown[] ? false : true>;
 
 type StringDigit = '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9';
 
+// Can eventually be replaced with the built-in once this library supports
+// TS5.4+ only. Tracked in https://github.com/sindresorhus/type-fest/issues/848
+type NoInfer<T> = T extends infer U ? U : never;
+
 /**
 Returns a boolean for whether the given type is `any`.
 
@@ -259,7 +329,7 @@ const anyA = get(anyObject, 'a');
 @category Type Guard
 @category Utilities
 */
-type IsAny<T> = 0 extends 1 & T ? true : false;
+type IsAny<T> = 0 extends 1 & NoInfer<T> ? true : false;
 
 type Numeric = number | bigint;
 
@@ -320,49 +390,6 @@ type ShouldBeTrue = IsNegative<-1>;
 */
 type IsNegative<T extends Numeric> = T extends Negative<T> ? true : false;
 
-/**
-Returns a boolean for whether the given type is `never`.
-
-@link https://github.com/microsoft/TypeScript/issues/31751#issuecomment-498526919
-@link https://stackoverflow.com/a/53984913/10292952
-@link https://www.zhenghao.io/posts/ts-never
-
-Useful in type utilities, such as checking if something does not occur.
-
-@example
-```
-import type {IsNever, And} from 'type-fest';
-
-// https://github.com/andnp/SimplyTyped/blob/master/src/types/strings.ts
-type AreStringsEqual<A extends string, B extends string> =
-	And<
-		IsNever<Exclude<A, B>> extends true ? true : false,
-		IsNever<Exclude<B, A>> extends true ? true : false
-	>;
-
-type EndIfEqual<I extends string, O extends string> =
-	AreStringsEqual<I, O> extends true
-		? never
-		: void;
-
-function endIfEqual<I extends string, O extends string>(input: I, output: O): EndIfEqual<I, O> {
-	if (input === output) {
-		process.exit(0);
-	}
-}
-
-endIfEqual('abc', 'abc');
-//=> never
-
-endIfEqual('abc', '123');
-//=> void
-```
-
-@category Type Guard
-@category Utilities
-*/
-type IsNever<T> = [T] extends [never] ? true : false;
-
 /**
 Returns a boolean for whether two given types are both true.
 
@@ -866,41 +893,6 @@ Matches non-recursive types.
 */
 type NonRecursiveType = BuiltIns | Function | (new (...arguments_: any[]) => unknown);
 
-/**
-Returns a boolean for whether the given type is a union type.
-
-@example
-```
-type A = IsUnion<string | number>;
-//=> true
-
-type B = IsUnion<string>;
-//=> false
-```
-*/
-type IsUnion<T> = InternalIsUnion<T>;
-
-/**
-The actual implementation of `IsUnion`.
-*/
-type InternalIsUnion<T, U = T> =
-(
-	// @link https://ghaiklor.github.io/type-challenges-solutions/en/medium-isunion.html
-	IsNever<T> extends true
-		? false
-		: T extends any
-			? [U] extends [T]
-				? false
-				: true
-			: never
-) extends infer Result
-	// In some cases `Result` will return `false | true` which is `boolean`,
-	// that means `T` has at least two types and it's a union type,
-	// so we will return `true` instead of `boolean`.
-	? boolean extends Result ? true
-		: Result
-	: never; // Should never happen
-
 /**
 Create an object type with the given key `<Key>` and value `<Value>`.
 
@@ -1725,13 +1717,13 @@ type Dog = {
 function displayPetInfo(petInfo: (Cat | Dog)['info']) {
 	// typeof petInfo =>
 	// {
-	//     name: string;
-	//     type: 'cat';
-	//     catType: string; // Needn't care about this field, because it's not a common pet info field.
+	// 	name: string;
+	// 	type: 'cat';
+	// 	catType: string; // Needn't care about this field, because it's not a common pet info field.
 	// } | {
-	//     name: string;
-	//     type: 'dog';
-	//     dogType: string; // Needn't care about this field, because it's not a common pet info field.
+	// 	name: string;
+	// 	type: 'dog';
+	// 	dogType: string; // Needn't care about this field, because it's not a common pet info field.
 	// }
 
 	// petInfo type is complex and have some needless fields
@@ -1743,8 +1735,8 @@ function displayPetInfo(petInfo: (Cat | Dog)['info']) {
 function displayPetInfo(petInfo: SharedUnionFieldsDeep<Cat | Dog>['info']) {
 	// typeof petInfo =>
 	// {
-	//     name: string;
-	//     type: 'cat' | 'dog';
+	// 	name: string;
+	// 	type: 'cat' | 'dog';
 	// }
 
 	// petInfo type is simple and clear
@@ -1754,17 +1746,16 @@ function displayPetInfo(petInfo: SharedUnionFieldsDeep<Cat | Dog>['info']) {
 }
 ```
 
+@see SharedUnionFields
+
 @category Object
 @category Union
 */
 type SharedUnionFieldsDeep<Union, Options extends SharedUnionFieldsDeepOptions = {recurseIntoArrays: false}> =
-// If `Union` is not a union type, return `Union` directly.
-IsUnion<Union> extends false
-	? Union
 	// `Union extends` will convert `Union`
 	// to a [distributive conditionaltype](https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-8.html#distributive-conditional-types).
 	// But this is not what we want, so we need to wrap `Union` with `[]` to prevent it.
-	: [Union] extends [NonRecursiveType | ReadonlyMap<unknown, unknown> | ReadonlySet<unknown>]
+	[Union] extends [NonRecursiveType | ReadonlyMap<unknown, unknown> | ReadonlySet<unknown>]
 		? Union
 		: [Union] extends [UnknownArray]
 			? Options['recurseIntoArrays'] extends true
@@ -1778,13 +1769,18 @@ IsUnion<Union> extends false
 Same as `SharedUnionFieldsDeep`, but accepts only `object`s and as inputs. Internal helper for `SharedUnionFieldsDeep`.
 */
 type SharedObjectUnionFieldsDeep<Union, Options extends SharedUnionFieldsDeepOptions> =
+	// `keyof Union` can extract the same key in union type, if there is no same key, return never.
 	keyof Union extends infer Keys
 		? IsNever<Keys> extends false
 			? {
 				[Key in keyof Union]:
 				Union[Key] extends NonRecursiveType
 					? Union[Key]
-					: SharedUnionFieldsDeep<Union[Key], Options>
+					// Remove `undefined` from the union to support optional
+					// fields, then recover `undefined` if union was already undefined.
+					: SharedUnionFieldsDeep<Exclude<Union[Key], undefined>, Options> | (
+						undefined extends Required<Union>[Key] ? undefined : never
+					)
 			}
 			: {}
 		: Union;
@@ -2173,8 +2169,20 @@ type PropertyOf<BaseType, Key extends string, Options extends GetOptions = {}> =
 		? undefined
 		: Key extends keyof BaseType
 			? StrictPropertyOf<BaseType, Key, Options>
-			: BaseType extends readonly [] | readonly [unknown, ...unknown[]]
-				? unknown // It's a tuple, but `Key` did not extend `keyof BaseType`. So the index is out of bounds.
+			// Handle arrays and tuples
+			: BaseType extends readonly unknown[]
+				? Key extends `${number}`
+					// For arrays with unknown length (regular arrays)
+					? number extends BaseType['length']
+						? Strictify<BaseType[number], Options>
+						// For tuples: check if the index is valid
+						: Key extends keyof BaseType
+							? Strictify<BaseType[Key & keyof BaseType], Options>
+							// Out-of-bounds access for tuples
+							: unknown
+					// Non-numeric string key for arrays/tuples
+					: unknown
+				// Handle array-like objects
 				: BaseType extends {
 					[n: number]: infer Item;
 					length: number; // Note: This is needed to avoid being too lax with records types using number keys like `{0: string; 1: boolean}`.