@dathomir/shared 0.0.1-beta.0

package/LICENSE.md

@@ -0,0 +1,373 @@
+Mozilla Public License Version 2.0
+==================================
+
+1. Definitions
+--------------
+
+1.1. "Contributor"
+    means each individual or legal entity that creates, contributes to
+    the creation of, or owns Covered Software.
+
+1.2. "Contributor Version"
+    means the combination of the Contributions of others (if any) used
+    by a Contributor and that particular Contributor's Contribution.
+
+1.3. "Contribution"
+    means Covered Software of a particular Contributor.
+
+1.4. "Covered Software"
+    means Source Code Form to which the initial Contributor has attached
+    the notice in Exhibit A, the Executable Form of such Source Code
+    Form, and Modifications of such Source Code Form, in each case
+    including portions thereof.
+
+1.5. "Incompatible With Secondary Licenses"
+    means
+
+    (a) that the initial Contributor has attached the notice described
+        in Exhibit B to the Covered Software; or
+
+    (b) that the Covered Software was made available under the terms of
+        version 1.1 or earlier of the License, but not also under the
+        terms of a Secondary License.
+
+1.6. "Executable Form"
+    means any form of the work other than Source Code Form.
+
+1.7. "Larger Work"
+    means a work that combines Covered Software with other material, in
+    a separate file or files, that is not Covered Software.
+
+1.8. "License"
+    means this document.
+
+1.9. "Licensable"
+    means having the right to grant, to the maximum extent possible,
+    whether at the time of the initial grant or subsequently, any and
+    all of the rights conveyed by this License.
+
+1.10. "Modifications"
+    means any of the following:
+
+    (a) any file in Source Code Form that results from an addition to,
+        deletion from, or modification of the contents of Covered
+        Software; or
+
+    (b) any new file in Source Code Form that contains any Covered
+        Software.
+
+1.11. "Patent Claims" of a Contributor
+    means any patent claim(s), including without limitation, method,
+    process, and apparatus claims, in any patent Licensable by such
+    Contributor that would be infringed, but for the grant of the
+    License, by the making, using, selling, offering for sale, having
+    made, import, or transfer of either its Contributions or its
+    Contributor Version.
+
+1.12. "Secondary License"
+    means either the GNU General Public License, Version 2.0, the GNU
+    Lesser General Public License, Version 2.1, the GNU Affero General
+    Public License, Version 3.0, or any later versions of those
+    licenses.
+
+1.13. "Source Code Form"
+    means the form of the work preferred for making modifications.
+
+1.14. "You" (or "Your")
+    means an individual or a legal entity exercising rights under this
+    License. For legal entities, "You" includes any entity that
+    controls, is controlled by, or is under common control with You. For
+    purposes of this definition, "control" means (a) the power, direct
+    or indirect, to cause the direction or management of such entity,
+    whether by contract or otherwise, or (b) ownership of more than
+    fifty percent (50%) of the outstanding shares or beneficial
+    ownership of such entity.
+
+2. License Grants and Conditions
+--------------------------------
+
+2.1. Grants
+
+Each Contributor hereby grants You a world-wide, royalty-free,
+non-exclusive license:
+
+(a) under intellectual property rights (other than patent or trademark)
+    Licensable by such Contributor to use, reproduce, make available,
+    modify, display, perform, distribute, and otherwise exploit its
+    Contributions, either on an unmodified basis, with Modifications, or
+    as part of a Larger Work; and
+
+(b) under Patent Claims of such Contributor to make, use, sell, offer
+    for sale, have made, import, and otherwise transfer either its
+    Contributions or its Contributor Version.
+
+2.2. Effective Date
+
+The licenses granted in Section 2.1 with respect to any Contribution
+become effective for each Contribution on the date the Contributor first
+distributes such Contribution.
+
+2.3. Limitations on Grant Scope
+
+The licenses granted in this Section 2 are the only rights granted under
+this License. No additional rights or licenses will be implied from the
+distribution or licensing of Covered Software under this License.
+Notwithstanding Section 2.1(b) above, no patent license is granted by a
+Contributor:
+
+(a) for any code that a Contributor has removed from Covered Software;
+    or
+
+(b) for infringements caused by: (i) Your and any other third party's
+    modifications of Covered Software, or (ii) the combination of its
+    Contributions with other software (except as part of its Contributor
+    Version); or
+
+(c) under Patent Claims infringed by Covered Software in the absence of
+    its Contributions.
+
+This License does not grant any rights in the trademarks, service marks,
+or logos of any Contributor (except as may be necessary to comply with
+the notice requirements in Section 3.4).
+
+2.4. Subsequent Licenses
+
+No Contributor makes additional grants as a result of Your choice to
+distribute the Covered Software under a subsequent version of this
+License (see Section 10.2) or under the terms of a Secondary License (if
+permitted under the terms of Section 3.3).
+
+2.5. Representation
+
+Each Contributor represents that the Contributor believes its
+Contributions are its original creation(s) or it has sufficient rights
+to grant the rights to its Contributions conveyed by this License.
+
+2.6. Fair Use
+
+This License is not intended to limit any rights You have under
+applicable copyright doctrines of fair use, fair dealing, or other
+equivalents.
+
+2.7. Conditions
+
+Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
+in Section 2.1.
+
+3. Responsibilities
+-------------------
+
+3.1. Distribution of Source Form
+
+All distribution of Covered Software in Source Code Form, including any
+Modifications that You create or to which You contribute, must be under
+the terms of this License. You must inform recipients that the Source
+Code Form of the Covered Software is governed by the terms of this
+License, and how they can obtain a copy of this License. You may not
+attempt to alter or restrict the recipients' rights in the Source Code
+Form.
+
+3.2. Distribution of Executable Form
+
+If You distribute Covered Software in Executable Form then:
+
+(a) such Covered Software must also be made available in Source Code
+    Form, as described in Section 3.1, and You must inform recipients of
+    the Executable Form how they can obtain a copy of such Source Code
+    Form by reasonable means in a timely manner, at a charge no more
+    than the cost of distribution to the recipient; and
+
+(b) You may distribute such Executable Form under the terms of this
+    License, or sublicense it under different terms, provided that the
+    license for the Executable Form does not attempt to limit or alter
+    the recipients' rights in the Source Code Form under this License.
+
+3.3. Distribution of a Larger Work
+
+You may create and distribute a Larger Work under terms of Your choice,
+provided that You also comply with the requirements of this License for
+the Covered Software. If the Larger Work is a combination of Covered
+Software with a work governed by one or more Secondary Licenses, and the
+Covered Software is not Incompatible With Secondary Licenses, this
+License permits You to additionally distribute such Covered Software
+under the terms of such Secondary License(s), so that the recipient of
+the Larger Work may, at their option, further distribute the Covered
+Software under the terms of either this License or such Secondary
+License(s).
+
+3.4. Notices
+
+You may not remove or alter the substance of any license notices
+(including copyright notices, patent notices, disclaimers of warranty,
+or limitations of liability) contained within the Source Code Form of
+the Covered Software, except that You may alter any license notices to
+the extent required to remedy known factual inaccuracies.
+
+3.5. Application of Additional Terms
+
+You may choose to offer, and to charge a fee for, warranty, support,
+indemnity or liability obligations to one or more recipients of Covered
+Software. However, You may do so only on Your own behalf, and not on
+behalf of any Contributor. You must make it absolutely clear that any
+such warranty, support, indemnity, or liability obligation is offered by
+You alone, and You hereby agree to indemnify every Contributor for any
+liability incurred by such Contributor as a result of warranty, support,
+indemnity or liability terms You offer. You may include additional
+disclaimers of warranty and limitations of liability specific to any
+jurisdiction.
+
+4. Inability to Comply Due to Statute or Regulation
+---------------------------------------------------
+
+If it is impossible for You to comply with any of the terms of this
+License with respect to some or all of the Covered Software due to
+statute, judicial order, or regulation then You must: (a) comply with
+the terms of this License to the maximum extent possible; and (b)
+describe the limitations and the code they affect. Such description must
+be placed in a text file included with all distributions of the Covered
+Software under this License. Except to the extent prohibited by statute
+or regulation, such description must be sufficiently detailed for a
+recipient of ordinary skill to be able to understand it.
+
+5. Termination
+--------------
+
+5.1. The rights granted under this License will terminate automatically
+if You fail to comply with any of its terms. However, if You become
+compliant, then the rights granted under this License from a particular
+Contributor are reinstated (a) provisionally, unless and until such
+Contributor explicitly and finally terminates Your grants, and (b) on an
+ongoing basis, if such Contributor fails to notify You of the
+non-compliance by some reasonable means prior to 60 days after You have
+come back into compliance. Moreover, Your grants from a particular
+Contributor are reinstated on an ongoing basis if such Contributor
+notifies You of the non-compliance by some reasonable means, this is the
+first time You have received notice of non-compliance with this License
+from such Contributor, and You become compliant prior to 30 days after
+Your receipt of the notice.
+
+5.2. If You initiate litigation against any entity by asserting a patent
+infringement claim (excluding declaratory judgment actions,
+counter-claims, and cross-claims) alleging that a Contributor Version
+directly or indirectly infringes any patent, then the rights granted to
+You by any and all Contributors for the Covered Software under Section
+2.1 of this License shall terminate.
+
+5.3. In the event of termination under Sections 5.1 or 5.2 above, all
+end user license agreements (excluding distributors and resellers) which
+have been validly granted by You or Your distributors under this License
+prior to termination shall survive termination.
+
+************************************************************************
+*                                                                      *
+*  6. Disclaimer of Warranty                                           *
+*  -------------------------                                           *
+*                                                                      *
+*  Covered Software is provided under this License on an "as is"       *
+*  basis, without warranty of any kind, either expressed, implied, or  *
+*  statutory, including, without limitation, warranties that the       *
+*  Covered Software is free of defects, merchantable, fit for a        *
+*  particular purpose or non-infringing. The entire risk as to the     *
+*  quality and performance of the Covered Software is with You.        *
+*  Should any Covered Software prove defective in any respect, You     *
+*  (not any Contributor) assume the cost of any necessary servicing,   *
+*  repair, or correction. This disclaimer of warranty constitutes an   *
+*  essential part of this License. No use of any Covered Software is   *
+*  authorized under this License except under this disclaimer.         *
+*                                                                      *
+************************************************************************
+
+************************************************************************
+*                                                                      *
+*  7. Limitation of Liability                                          *
+*  --------------------------                                          *
+*                                                                      *
+*  Under no circumstances and under no legal theory, whether tort      *
+*  (including negligence), contract, or otherwise, shall any           *
+*  Contributor, or anyone who distributes Covered Software as          *
+*  permitted above, be liable to You for any direct, indirect,         *
+*  special, incidental, or consequential damages of any character      *
+*  including, without limitation, damages for lost profits, loss of    *
+*  goodwill, work stoppage, computer failure or malfunction, or any    *
+*  and all other commercial damages or losses, even if such party      *
+*  shall have been informed of the possibility of such damages. This   *
+*  limitation of liability shall not apply to liability for death or   *
+*  personal injury resulting from such party's negligence to the       *
+*  extent applicable law prohibits such limitation. Some               *
+*  jurisdictions do not allow the exclusion or limitation of           *
+*  incidental or consequential damages, so this exclusion and          *
+*  limitation may not apply to You.                                    *
+*                                                                      *
+************************************************************************
+
+8. Litigation
+-------------
+
+Any litigation relating to this License may be brought only in the
+courts of a jurisdiction where the defendant maintains its principal
+place of business and such litigation shall be governed by laws of that
+jurisdiction, without reference to its conflict-of-law provisions.
+Nothing in this Section shall prevent a party's ability to bring
+cross-claims or counter-claims.
+
+9. Miscellaneous
+----------------
+
+This License represents the complete agreement concerning the subject
+matter hereof. If any provision of this License is held to be
+unenforceable, such provision shall be reformed only to the extent
+necessary to make it enforceable. Any law or regulation which provides
+that the language of a contract shall be construed against the drafter
+shall not be used to construe this License against a Contributor.
+
+10. Versions of the License
+---------------------------
+
+10.1. New Versions
+
+Mozilla Foundation is the license steward. Except as provided in Section
+10.3, no one other than the license steward has the right to modify or
+publish new versions of this License. Each version will be given a
+distinguishing version number.
+
+10.2. Effect of New Versions
+
+You may distribute the Covered Software under the terms of the version
+of the License under which You originally received the Covered Software,
+or under the terms of any subsequent version published by the license
+steward.
+
+10.3. Modified Versions
+
+If you create software not governed by this License, and you want to
+create a new license for such software, you may create and use a
+modified version of this License if you rename the license and remove
+any references to the name of the license steward (except to note that
+such modified license differs from this License).
+
+10.4. Distributing Source Code Form that is Incompatible With Secondary
+Licenses
+
+If You choose to distribute Source Code Form that is Incompatible With
+Secondary Licenses under the terms of this version of the License, the
+notice described in Exhibit B of this License must be attached.
+
+Exhibit A - Source Code Form License Notice
+-------------------------------------------
+
+  This Source Code Form is subject to the terms of the Mozilla Public
+  License, v. 2.0. If a copy of the MPL was not distributed with this
+  file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+If it is not possible or desirable to put the notice in a particular
+file, then You may include the notice in a location (such as a LICENSE
+file in a relevant directory) where a recipient would be likely to look
+for such a notice.
+
+You may add additional accurate notices of copyright ownership.
+
+Exhibit B - "Incompatible With Secondary Licenses" Notice
+---------------------------------------------------------
+
+  This Source Code Form is "Incompatible With Secondary Licenses", as
+  defined by the Mozilla Public License, v. 2.0.

package/dist/index.cjs

@@ -0,0 +1,112 @@
+
+//#region src/utils/entries.ts
+const entries = (obj) => {
+	return Object.entries(obj);
+};
+
+//#endregion
+//#region src/utils/fromEntries.ts
+const fromEntries = (entries$1) => {
+	return entries$1.reduce((acc, cur) => {
+		return {
+			...acc,
+			[cur[0]]: cur[1]
+		};
+	}, {});
+};
+
+//#endregion
+//#region src/utils/scule.ts
+const NUMBER_CHAR_RE = /\d/;
+const STR_SPLITTERS = [
+	"-",
+	"_",
+	"/",
+	"."
+];
+function isUppercase(char = "") {
+	if (NUMBER_CHAR_RE.test(char)) return;
+	return char !== char.toLowerCase();
+}
+function splitByCase(str, separators) {
+	const splitters = separators ?? STR_SPLITTERS;
+	const parts = [];
+	if (!str || typeof str !== "string") return parts;
+	let buff = "";
+	let previousUpper;
+	let previousSplitter;
+	for (const char of str) {
+		const isSplitter = splitters.includes(char);
+		if (isSplitter === true) {
+			parts.push(buff);
+			buff = "";
+			previousUpper = void 0;
+			continue;
+		}
+		const isUpper = isUppercase(char);
+		if (previousSplitter === false) {
+			if (previousUpper === false && isUpper === true) {
+				parts.push(buff);
+				buff = char;
+				previousUpper = isUpper;
+				continue;
+			}
+			if (previousUpper === true && isUpper === false && buff.length > 1) {
+				const lastChar = buff.at(-1);
+				parts.push(buff.slice(0, Math.max(0, buff.length - 1)));
+				buff = lastChar + char;
+				previousUpper = isUpper;
+				continue;
+			}
+		}
+		buff += char;
+		previousUpper = isUpper;
+		previousSplitter = isSplitter;
+	}
+	parts.push(buff);
+	return parts;
+}
+function upperFirst(str) {
+	return str ? str[0].toUpperCase() + str.slice(1) : "";
+}
+function lowerFirst(str) {
+	return str ? str[0].toLowerCase() + str.slice(1) : "";
+}
+function pascalCase(str, opts) {
+	return str ? (Array.isArray(str) ? str : splitByCase(str)).map((p) => upperFirst(opts?.normalize ? p.toLowerCase() : p)).join("") : "";
+}
+function camelCase(str, opts) {
+	return lowerFirst(pascalCase(str || "", opts));
+}
+function kebabCase(str, joiner) {
+	return str ? (Array.isArray(str) ? str : splitByCase(str)).map((p) => p.toLowerCase()).join(joiner ?? "-") : "";
+}
+function snakeCase(str) {
+	return kebabCase(str || "", "_");
+}
+function flatCase(str) {
+	return kebabCase(str || "", "");
+}
+function trainCase(str, opts) {
+	return (Array.isArray(str) ? str : splitByCase(str)).filter(Boolean).map((p) => upperFirst(opts?.normalize ? p.toLowerCase() : p)).join("-");
+}
+const titleCaseExceptions = /^(a|an|and|as|at|but|by|for|if|in|is|nor|of|on|or|the|to|with)$/i;
+function titleCase(str, opts) {
+	return (Array.isArray(str) ? str : splitByCase(str)).filter(Boolean).map((p) => titleCaseExceptions.test(p) ? p.toLowerCase() : upperFirst(opts?.normalize ? p.toLowerCase() : p)).join(" ");
+}
+
+//#endregion
+exports.camelCase = camelCase;
+exports.entries = entries;
+exports.flatCase = flatCase;
+exports.fromEntries = fromEntries;
+exports.isUppercase = isUppercase;
+exports.kebabCase = kebabCase;
+exports.lowerFirst = lowerFirst;
+exports.pascalCase = pascalCase;
+exports.snakeCase = snakeCase;
+exports.splitByCase = splitByCase;
+exports.titleCase = titleCase;
+exports.trainCase = trainCase;
+exports.upperFirst = upperFirst;
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","names":["entries","parts: string[]","previousUpper: boolean | undefined","previousSplitter: boolean | undefined"],"sources":["../src/utils/entries.ts","../src/utils/fromEntries.ts","../src/utils/scule.ts"],"sourcesContent":["type Entries<T> = (keyof T extends infer U\n  ? U extends keyof T\n    ? [U, T[U]]\n    : never\n  : never)[];\n\nconst entries = <T extends Record<string, unknown>>(obj: T): Entries<T> => {\n  return Object.entries(obj) as Entries<T>;\n};\n\nexport { entries };\nexport type { Entries };\n","type FromEntries<T extends [PropertyKey, unknown][]> = {\n  [K in T[number][0]]: Extract<T[number], [K, unknown]>[1];\n};\n\nconst fromEntries = <T extends [PropertyKey, unknown][]>(\n  entries: T\n): FromEntries<T> => {\n  return entries.reduce((acc, cur) => {\n    return {\n      ...acc,\n      [cur[0]]: cur[1],\n    };\n  }, {} as FromEntries<T>);\n};\n\nexport { fromEntries };\nexport type { FromEntries };\n","type Splitter = \"-\" | \"_\" | \"/\" | \".\";\ntype FirstOfString<S extends string> = S extends `${infer F}${string}`\n  ? F\n  : never;\ntype RemoveFirstOfString<S extends string> = S extends `${string}${infer R}`\n  ? R\n  : never;\ntype IsUpper<S extends string> = S extends Uppercase<S> ? true : false;\ntype IsLower<S extends string> = S extends Lowercase<S> ? true : false;\ntype SameLetterCase<\n  X extends string,\n  Y extends string\n> = IsUpper<X> extends IsUpper<Y>\n  ? true\n  : IsLower<X> extends IsLower<Y>\n  ? true\n  : false;\ntype CapitalizedWords<\n  T extends readonly string[],\n  Accumulator extends string = \"\",\n  Normalize extends boolean | undefined = false\n> = T extends readonly [infer F extends string, ...infer R extends string[]]\n  ? CapitalizedWords<\n      R,\n      `${Accumulator}${Capitalize<Normalize extends true ? Lowercase<F> : F>}`,\n      Normalize\n    >\n  : Accumulator;\ntype JoinLowercaseWords<\n  T extends readonly string[],\n  Joiner extends string,\n  Accumulator extends string = \"\"\n> = T extends readonly [infer F extends string, ...infer R extends string[]]\n  ? Accumulator extends \"\"\n    ? JoinLowercaseWords<R, Joiner, `${Accumulator}${Lowercase<F>}`>\n    : JoinLowercaseWords<R, Joiner, `${Accumulator}${Joiner}${Lowercase<F>}`>\n  : Accumulator;\n\ntype LastOfArray<T extends any[]> = T extends [...any, infer R] ? R : never;\ntype RemoveLastOfArray<T extends any[]> = T extends [...infer F, any]\n  ? F\n  : never;\n\nexport type CaseOptions = {\n  normalize?: boolean;\n};\n\nexport type SplitByCase<\n  T,\n  Separator extends string = Splitter,\n  Accumulator extends unknown[] = []\n> = string extends Separator\n  ? string[]\n  : T extends `${infer F}${infer R}`\n  ? [LastOfArray<Accumulator>] extends [never]\n    ? SplitByCase<R, Separator, [F]>\n    : LastOfArray<Accumulator> extends string\n    ? R extends \"\"\n      ? SplitByCase<\n          R,\n          Separator,\n          [...RemoveLastOfArray<Accumulator>, `${LastOfArray<Accumulator>}${F}`]\n        >\n      : SameLetterCase<F, FirstOfString<R>> extends true\n      ? F extends Separator\n        ? FirstOfString<R> extends Separator\n          ? SplitByCase<R, Separator, [...Accumulator, \"\"]>\n          : IsUpper<FirstOfString<R>> extends true\n          ? SplitByCase<\n              RemoveFirstOfString<R>,\n              Separator,\n              [...Accumulator, FirstOfString<R>]\n            >\n          : SplitByCase<R, Separator, [...Accumulator, \"\"]>\n        : SplitByCase<\n            R,\n            Separator,\n            [\n              ...RemoveLastOfArray<Accumulator>,\n              `${LastOfArray<Accumulator>}${F}`\n            ]\n          >\n      : IsLower<F> extends true\n      ? SplitByCase<\n          RemoveFirstOfString<R>,\n          Separator,\n          [\n            ...RemoveLastOfArray<Accumulator>,\n            `${LastOfArray<Accumulator>}${F}`,\n            FirstOfString<R>\n          ]\n        >\n      : SplitByCase<R, Separator, [...Accumulator, F]>\n    : never\n  : Accumulator extends []\n  ? T extends \"\"\n    ? []\n    : string[]\n  : Accumulator;\n\nexport type JoinByCase<T, Joiner extends string> = string extends T\n  ? string\n  : string[] extends T\n  ? string\n  : T extends string\n  ? SplitByCase<T> extends readonly string[]\n    ? JoinLowercaseWords<SplitByCase<T>, Joiner>\n    : never\n  : T extends readonly string[]\n  ? JoinLowercaseWords<T, Joiner>\n  : never;\n\nexport type PascalCase<\n  T,\n  Normalize extends boolean | undefined = false\n> = string extends T\n  ? string\n  : string[] extends T\n  ? string\n  : T extends string\n  ? SplitByCase<T> extends readonly string[]\n    ? CapitalizedWords<SplitByCase<T>, \"\", Normalize>\n    : never\n  : T extends readonly string[]\n  ? CapitalizedWords<T, \"\", Normalize>\n  : never;\n\nexport type CamelCase<\n  T,\n  Normalize extends boolean | undefined = false\n> = string extends T\n  ? string\n  : string[] extends T\n  ? string\n  : Uncapitalize<PascalCase<T, Normalize>>;\n\nexport type KebabCase<\n  T extends string | readonly string[],\n  Joiner extends string = \"-\"\n> = JoinByCase<T, Joiner>;\n\nexport type SnakeCase<T extends string | readonly string[]> = JoinByCase<\n  T,\n  \"_\"\n>;\n\nexport type TrainCase<\n  T,\n  Normalize extends boolean | undefined = false,\n  Joiner extends string = \"-\"\n> = string extends T\n  ? string\n  : string[] extends T\n  ? string\n  : T extends string\n  ? SplitByCase<T> extends readonly string[]\n    ? CapitalizedWords<SplitByCase<T>, Joiner>\n    : never\n  : T extends readonly string[]\n  ? CapitalizedWords<T, Joiner, Normalize>\n  : never;\n\nexport type FlatCase<\n  T extends string | readonly string[],\n  Joiner extends string = \"\"\n> = JoinByCase<T, Joiner>;\n\nconst NUMBER_CHAR_RE = /\\d/;\nconst STR_SPLITTERS = [\"-\", \"_\", \"/\", \".\"] as const;\n\nexport function isUppercase(char = \"\"): boolean | undefined {\n  if (NUMBER_CHAR_RE.test(char)) {\n    return undefined;\n  }\n  return char !== char.toLowerCase();\n}\n\nexport function splitByCase<T extends string>(str: T): SplitByCase<T>;\nexport function splitByCase<\n  T extends string,\n  Separator extends readonly string[]\n>(str: T, separators: Separator): SplitByCase<T, Separator[number]>;\nexport function splitByCase<\n  T extends string,\n  Separator extends readonly string[]\n>(str: T, separators?: Separator) {\n  const splitters = separators ?? STR_SPLITTERS;\n  const parts: string[] = [];\n\n  if (!str || typeof str !== \"string\") {\n    return parts as SplitByCase<T, Separator[number]>;\n  }\n\n  let buff = \"\";\n\n  let previousUpper: boolean | undefined;\n  let previousSplitter: boolean | undefined;\n\n  for (const char of str) {\n    // Splitter\n    const isSplitter = (splitters as unknown as string).includes(char);\n    if (isSplitter === true) {\n      parts.push(buff);\n      buff = \"\";\n      previousUpper = undefined;\n      continue;\n    }\n\n    const isUpper = isUppercase(char);\n    if (previousSplitter === false) {\n      // Case rising edge\n      if (previousUpper === false && isUpper === true) {\n        parts.push(buff);\n        buff = char;\n        previousUpper = isUpper;\n        continue;\n      }\n      // Case falling edge\n      if (previousUpper === true && isUpper === false && buff.length > 1) {\n        const lastChar = buff.at(-1);\n        parts.push(buff.slice(0, Math.max(0, buff.length - 1)));\n        buff = lastChar + char;\n        previousUpper = isUpper;\n        continue;\n      }\n    }\n\n    // Normal char\n    buff += char;\n    previousUpper = isUpper;\n    previousSplitter = isSplitter;\n  }\n\n  parts.push(buff);\n\n  return parts as SplitByCase<T, Separator[number]>;\n}\n\nexport function upperFirst<S extends string>(str: S): Capitalize<S> {\n  return (str ? str[0].toUpperCase() + str.slice(1) : \"\") as Capitalize<S>;\n}\n\nexport function lowerFirst<S extends string>(str: S): Uncapitalize<S> {\n  return (str ? str[0].toLowerCase() + str.slice(1) : \"\") as Uncapitalize<S>;\n}\n\nexport function pascalCase(): \"\";\nexport function pascalCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str: T, opts?: CaseOptions): PascalCase<T, UserCaseOptions[\"normalize\"]>;\nexport function pascalCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str?: T, opts?: UserCaseOptions) {\n  return str\n    ? ((Array.isArray(str) ? str : splitByCase(str as string))\n        .map((p) => upperFirst(opts?.normalize ? p.toLowerCase() : p))\n        .join(\"\") as PascalCase<T, UserCaseOptions[\"normalize\"]>)\n    : \"\";\n}\n\nexport function camelCase(): \"\";\nexport function camelCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str: T, opts?: UserCaseOptions): CamelCase<T, UserCaseOptions[\"normalize\"]>;\nexport function camelCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str?: T, opts?: UserCaseOptions) {\n  return lowerFirst(pascalCase(str || \"\", opts)) as CamelCase<\n    T,\n    UserCaseOptions[\"normalize\"]\n  >;\n}\n\nexport function kebabCase(): \"\";\nexport function kebabCase<T extends string | readonly string[]>(\n  str: T\n): KebabCase<T>;\nexport function kebabCase<\n  T extends string | readonly string[],\n  Joiner extends string\n>(str: T, joiner: Joiner): KebabCase<T, Joiner>;\nexport function kebabCase<\n  T extends string | readonly string[],\n  Joiner extends string\n>(str?: T, joiner?: Joiner) {\n  return str\n    ? ((Array.isArray(str) ? str : splitByCase(str as string))\n        .map((p) => p.toLowerCase())\n        .join(joiner ?? \"-\") as KebabCase<T, Joiner>)\n    : \"\";\n}\n\nexport function snakeCase(): \"\";\nexport function snakeCase<T extends string | readonly string[]>(\n  str: T\n): SnakeCase<T>;\nexport function snakeCase<T extends string | readonly string[]>(str?: T) {\n  return kebabCase(str || \"\", \"_\") as SnakeCase<T>;\n}\n\nexport function flatCase(): \"\";\nexport function flatCase<T extends string | readonly string[]>(\n  str: T\n): FlatCase<T>;\nexport function flatCase<T extends string | readonly string[]>(str?: T) {\n  return kebabCase(str || \"\", \"\") as FlatCase<T>;\n}\n\nexport function trainCase(): \"\";\nexport function trainCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str: T, opts?: UserCaseOptions): TrainCase<T, UserCaseOptions[\"normalize\"]>;\nexport function trainCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str?: T, opts?: UserCaseOptions) {\n  return (Array.isArray(str) ? str : splitByCase(str as string))\n    .filter(Boolean)\n    .map((p) => upperFirst(opts?.normalize ? p.toLowerCase() : p))\n    .join(\"-\") as TrainCase<T, UserCaseOptions[\"normalize\"]>;\n}\n\nconst titleCaseExceptions =\n  /^(a|an|and|as|at|but|by|for|if|in|is|nor|of|on|or|the|to|with)$/i;\n\nexport function titleCase(): \"\";\nexport function titleCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(\n  str: T,\n  opts?: UserCaseOptions\n): TrainCase<T, UserCaseOptions[\"normalize\"], \" \">;\nexport function titleCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str?: T, opts?: UserCaseOptions) {\n  return (Array.isArray(str) ? str : splitByCase(str as string))\n    .filter(Boolean)\n    .map((p) =>\n      titleCaseExceptions.test(p)\n        ? p.toLowerCase()\n        : upperFirst(opts?.normalize ? p.toLowerCase() : p)\n    )\n    .join(\" \") as TrainCase<T, UserCaseOptions[\"normalize\"]>;\n}\n"],"mappings":";;AAMA,MAAM,WAA8C,QAAuB;AACzE,QAAO,OAAO,QAAQ,IAAI;;;;;ACH5B,MAAM,eACJ,cACmB;AACnB,QAAOA,UAAQ,QAAQ,KAAK,QAAQ;AAClC,SAAO;GACL,GAAG;IACF,IAAI,KAAK,IAAI;GACf;IACA,EAAE,CAAmB;;;;;AC2J1B,MAAM,iBAAiB;AACvB,MAAM,gBAAgB;CAAC;CAAK;CAAK;CAAK;CAAI;AAE1C,SAAgB,YAAY,OAAO,IAAyB;AAC1D,KAAI,eAAe,KAAK,KAAK,CAC3B;AAEF,QAAO,SAAS,KAAK,aAAa;;AAQpC,SAAgB,YAGd,KAAQ,YAAwB;CAChC,MAAM,YAAY,cAAc;CAChC,MAAMC,QAAkB,EAAE;AAE1B,KAAI,CAAC,OAAO,OAAO,QAAQ,SACzB,QAAO;CAGT,IAAI,OAAO;CAEX,IAAIC;CACJ,IAAIC;AAEJ,MAAK,MAAM,QAAQ,KAAK;EAEtB,MAAM,aAAc,UAAgC,SAAS,KAAK;AAClE,MAAI,eAAe,MAAM;AACvB,SAAM,KAAK,KAAK;AAChB,UAAO;AACP,mBAAgB;AAChB;;EAGF,MAAM,UAAU,YAAY,KAAK;AACjC,MAAI,qBAAqB,OAAO;AAE9B,OAAI,kBAAkB,SAAS,YAAY,MAAM;AAC/C,UAAM,KAAK,KAAK;AAChB,WAAO;AACP,oBAAgB;AAChB;;AAGF,OAAI,kBAAkB,QAAQ,YAAY,SAAS,KAAK,SAAS,GAAG;IAClE,MAAM,WAAW,KAAK,GAAG,GAAG;AAC5B,UAAM,KAAK,KAAK,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC,CAAC;AACvD,WAAO,WAAW;AAClB,oBAAgB;AAChB;;;AAKJ,UAAQ;AACR,kBAAgB;AAChB,qBAAmB;;AAGrB,OAAM,KAAK,KAAK;AAEhB,QAAO;;AAGT,SAAgB,WAA6B,KAAuB;AAClE,QAAQ,MAAM,IAAI,GAAG,aAAa,GAAG,IAAI,MAAM,EAAE,GAAG;;AAGtD,SAAgB,WAA6B,KAAyB;AACpE,QAAQ,MAAM,IAAI,GAAG,aAAa,GAAG,IAAI,MAAM,EAAE,GAAG;;AAQtD,SAAgB,WAGd,KAAS,MAAwB;AACjC,QAAO,OACD,MAAM,QAAQ,IAAI,GAAG,MAAM,YAAY,IAAc,EACpD,KAAK,MAAM,WAAW,MAAM,YAAY,EAAE,aAAa,GAAG,EAAE,CAAC,CAC7D,KAAK,GAAG,GACX;;AAQN,SAAgB,UAGd,KAAS,MAAwB;AACjC,QAAO,WAAW,WAAW,OAAO,IAAI,KAAK,CAAC;;AAchD,SAAgB,UAGd,KAAS,QAAiB;AAC1B,QAAO,OACD,MAAM,QAAQ,IAAI,GAAG,MAAM,YAAY,IAAc,EACpD,KAAK,MAAM,EAAE,aAAa,CAAC,CAC3B,KAAK,UAAU,IAAI,GACtB;;AAON,SAAgB,UAAgD,KAAS;AACvE,QAAO,UAAU,OAAO,IAAI,IAAI;;AAOlC,SAAgB,SAA+C,KAAS;AACtE,QAAO,UAAU,OAAO,IAAI,GAAG;;AAQjC,SAAgB,UAGd,KAAS,MAAwB;AACjC,SAAQ,MAAM,QAAQ,IAAI,GAAG,MAAM,YAAY,IAAc,EAC1D,OAAO,QAAQ,CACf,KAAK,MAAM,WAAW,MAAM,YAAY,EAAE,aAAa,GAAG,EAAE,CAAC,CAC7D,KAAK,IAAI;;AAGd,MAAM,sBACJ;AAUF,SAAgB,UAGd,KAAS,MAAwB;AACjC,SAAQ,MAAM,QAAQ,IAAI,GAAG,MAAM,YAAY,IAAc,EAC1D,OAAO,QAAQ,CACf,KAAK,MACJ,oBAAoB,KAAK,EAAE,GACvB,EAAE,aAAa,GACf,WAAW,MAAM,YAAY,EAAE,aAAa,GAAG,EAAE,CACtD,CACA,KAAK,IAAI"}

package/dist/index.d.cts

@@ -0,0 +1,53 @@
+//#region src/utils/entries.d.ts
+type Entries<T> = (keyof T extends infer U ? U extends keyof T ? [U, T[U]] : never : never)[];
+declare const entries: <T extends Record<string, unknown>>(obj: T) => Entries<T>;
+//#endregion
+//#region src/utils/fromEntries.d.ts
+type FromEntries<T extends [PropertyKey, unknown][]> = { [K in T[number][0]]: Extract<T[number], [K, unknown]>[1] };
+declare const fromEntries: <T extends [PropertyKey, unknown][]>(entries: T) => FromEntries<T>;
+//#endregion
+//#region src/utils/scule.d.ts
+type Splitter = "-" | "_" | "/" | ".";
+type FirstOfString<S extends string> = S extends `${infer F}${string}` ? F : never;
+type RemoveFirstOfString<S extends string> = S extends `${string}${infer R}` ? R : never;
+type IsUpper<S extends string> = S extends Uppercase<S> ? true : false;
+type IsLower<S extends string> = S extends Lowercase<S> ? true : false;
+type SameLetterCase<X extends string, Y extends string> = IsUpper<X> extends IsUpper<Y> ? true : IsLower<X> extends IsLower<Y> ? true : false;
+type CapitalizedWords<T extends readonly string[], Accumulator extends string = "", Normalize extends boolean | undefined = false> = T extends readonly [infer F extends string, ...infer R extends string[]] ? CapitalizedWords<R, `${Accumulator}${Capitalize<Normalize extends true ? Lowercase<F> : F>}`, Normalize> : Accumulator;
+type JoinLowercaseWords<T extends readonly string[], Joiner extends string, Accumulator extends string = ""> = T extends readonly [infer F extends string, ...infer R extends string[]] ? Accumulator extends "" ? JoinLowercaseWords<R, Joiner, `${Accumulator}${Lowercase<F>}`> : JoinLowercaseWords<R, Joiner, `${Accumulator}${Joiner}${Lowercase<F>}`> : Accumulator;
+type LastOfArray<T extends any[]> = T extends [...any, infer R] ? R : never;
+type RemoveLastOfArray<T extends any[]> = T extends [...infer F, any] ? F : never;
+type CaseOptions = {
+  normalize?: boolean;
+};
+type SplitByCase<T, Separator extends string = Splitter, Accumulator extends unknown[] = []> = string extends Separator ? string[] : T extends `${infer F}${infer R}` ? [LastOfArray<Accumulator>] extends [never] ? SplitByCase<R, Separator, [F]> : LastOfArray<Accumulator> extends string ? R extends "" ? SplitByCase<R, Separator, [...RemoveLastOfArray<Accumulator>, `${LastOfArray<Accumulator>}${F}`]> : SameLetterCase<F, FirstOfString<R>> extends true ? F extends Separator ? FirstOfString<R> extends Separator ? SplitByCase<R, Separator, [...Accumulator, ""]> : IsUpper<FirstOfString<R>> extends true ? SplitByCase<RemoveFirstOfString<R>, Separator, [...Accumulator, FirstOfString<R>]> : SplitByCase<R, Separator, [...Accumulator, ""]> : SplitByCase<R, Separator, [...RemoveLastOfArray<Accumulator>, `${LastOfArray<Accumulator>}${F}`]> : IsLower<F> extends true ? SplitByCase<RemoveFirstOfString<R>, Separator, [...RemoveLastOfArray<Accumulator>, `${LastOfArray<Accumulator>}${F}`, FirstOfString<R>]> : SplitByCase<R, Separator, [...Accumulator, F]> : never : Accumulator extends [] ? T extends "" ? [] : string[] : Accumulator;
+type JoinByCase<T, Joiner extends string> = string extends T ? string : string[] extends T ? string : T extends string ? SplitByCase<T> extends readonly string[] ? JoinLowercaseWords<SplitByCase<T>, Joiner> : never : T extends readonly string[] ? JoinLowercaseWords<T, Joiner> : never;
+type PascalCase<T, Normalize extends boolean | undefined = false> = string extends T ? string : string[] extends T ? string : T extends string ? SplitByCase<T> extends readonly string[] ? CapitalizedWords<SplitByCase<T>, "", Normalize> : never : T extends readonly string[] ? CapitalizedWords<T, "", Normalize> : never;
+type CamelCase<T, Normalize extends boolean | undefined = false> = string extends T ? string : string[] extends T ? string : Uncapitalize<PascalCase<T, Normalize>>;
+type KebabCase<T extends string | readonly string[], Joiner extends string = "-"> = JoinByCase<T, Joiner>;
+type SnakeCase<T extends string | readonly string[]> = JoinByCase<T, "_">;
+type TrainCase<T, Normalize extends boolean | undefined = false, Joiner extends string = "-"> = string extends T ? string : string[] extends T ? string : T extends string ? SplitByCase<T> extends readonly string[] ? CapitalizedWords<SplitByCase<T>, Joiner> : never : T extends readonly string[] ? CapitalizedWords<T, Joiner, Normalize> : never;
+type FlatCase<T extends string | readonly string[], Joiner extends string = ""> = JoinByCase<T, Joiner>;
+declare function isUppercase(char?: string): boolean | undefined;
+declare function splitByCase<T extends string>(str: T): SplitByCase<T>;
+declare function splitByCase<T extends string, Separator extends readonly string[]>(str: T, separators: Separator): SplitByCase<T, Separator[number]>;
+declare function upperFirst<S extends string>(str: S): Capitalize<S>;
+declare function lowerFirst<S extends string>(str: S): Uncapitalize<S>;
+declare function pascalCase(): "";
+declare function pascalCase<T extends string | readonly string[], UserCaseOptions extends CaseOptions = CaseOptions>(str: T, opts?: CaseOptions): PascalCase<T, UserCaseOptions["normalize"]>;
+declare function camelCase(): "";
+declare function camelCase<T extends string | readonly string[], UserCaseOptions extends CaseOptions = CaseOptions>(str: T, opts?: UserCaseOptions): CamelCase<T, UserCaseOptions["normalize"]>;
+declare function kebabCase(): "";
+declare function kebabCase<T extends string | readonly string[]>(str: T): KebabCase<T>;
+declare function kebabCase<T extends string | readonly string[], Joiner extends string>(str: T, joiner: Joiner): KebabCase<T, Joiner>;
+declare function snakeCase(): "";
+declare function snakeCase<T extends string | readonly string[]>(str: T): SnakeCase<T>;
+declare function flatCase(): "";
+declare function flatCase<T extends string | readonly string[]>(str: T): FlatCase<T>;
+declare function trainCase(): "";
+declare function trainCase<T extends string | readonly string[], UserCaseOptions extends CaseOptions = CaseOptions>(str: T, opts?: UserCaseOptions): TrainCase<T, UserCaseOptions["normalize"]>;
+declare function titleCase(): "";
+declare function titleCase<T extends string | readonly string[], UserCaseOptions extends CaseOptions = CaseOptions>(str: T, opts?: UserCaseOptions): TrainCase<T, UserCaseOptions["normalize"], " ">;
+//#endregion
+export { CamelCase, CaseOptions, type Entries, FlatCase, type FromEntries, JoinByCase, KebabCase, PascalCase, SnakeCase, SplitByCase, TrainCase, camelCase, entries, flatCase, fromEntries, isUppercase, kebabCase, lowerFirst, pascalCase, snakeCase, splitByCase, titleCase, trainCase, upperFirst };
+//# sourceMappingURL=index.d.cts.map

package/dist/index.d.mts

@@ -0,0 +1,53 @@
+//#region src/utils/entries.d.ts
+type Entries<T> = (keyof T extends infer U ? U extends keyof T ? [U, T[U]] : never : never)[];
+declare const entries: <T extends Record<string, unknown>>(obj: T) => Entries<T>;
+//#endregion
+//#region src/utils/fromEntries.d.ts
+type FromEntries<T extends [PropertyKey, unknown][]> = { [K in T[number][0]]: Extract<T[number], [K, unknown]>[1] };
+declare const fromEntries: <T extends [PropertyKey, unknown][]>(entries: T) => FromEntries<T>;
+//#endregion
+//#region src/utils/scule.d.ts
+type Splitter = "-" | "_" | "/" | ".";
+type FirstOfString<S extends string> = S extends `${infer F}${string}` ? F : never;
+type RemoveFirstOfString<S extends string> = S extends `${string}${infer R}` ? R : never;
+type IsUpper<S extends string> = S extends Uppercase<S> ? true : false;
+type IsLower<S extends string> = S extends Lowercase<S> ? true : false;
+type SameLetterCase<X extends string, Y extends string> = IsUpper<X> extends IsUpper<Y> ? true : IsLower<X> extends IsLower<Y> ? true : false;
+type CapitalizedWords<T extends readonly string[], Accumulator extends string = "", Normalize extends boolean | undefined = false> = T extends readonly [infer F extends string, ...infer R extends string[]] ? CapitalizedWords<R, `${Accumulator}${Capitalize<Normalize extends true ? Lowercase<F> : F>}`, Normalize> : Accumulator;
+type JoinLowercaseWords<T extends readonly string[], Joiner extends string, Accumulator extends string = ""> = T extends readonly [infer F extends string, ...infer R extends string[]] ? Accumulator extends "" ? JoinLowercaseWords<R, Joiner, `${Accumulator}${Lowercase<F>}`> : JoinLowercaseWords<R, Joiner, `${Accumulator}${Joiner}${Lowercase<F>}`> : Accumulator;
+type LastOfArray<T extends any[]> = T extends [...any, infer R] ? R : never;
+type RemoveLastOfArray<T extends any[]> = T extends [...infer F, any] ? F : never;
+type CaseOptions = {
+  normalize?: boolean;
+};
+type SplitByCase<T, Separator extends string = Splitter, Accumulator extends unknown[] = []> = string extends Separator ? string[] : T extends `${infer F}${infer R}` ? [LastOfArray<Accumulator>] extends [never] ? SplitByCase<R, Separator, [F]> : LastOfArray<Accumulator> extends string ? R extends "" ? SplitByCase<R, Separator, [...RemoveLastOfArray<Accumulator>, `${LastOfArray<Accumulator>}${F}`]> : SameLetterCase<F, FirstOfString<R>> extends true ? F extends Separator ? FirstOfString<R> extends Separator ? SplitByCase<R, Separator, [...Accumulator, ""]> : IsUpper<FirstOfString<R>> extends true ? SplitByCase<RemoveFirstOfString<R>, Separator, [...Accumulator, FirstOfString<R>]> : SplitByCase<R, Separator, [...Accumulator, ""]> : SplitByCase<R, Separator, [...RemoveLastOfArray<Accumulator>, `${LastOfArray<Accumulator>}${F}`]> : IsLower<F> extends true ? SplitByCase<RemoveFirstOfString<R>, Separator, [...RemoveLastOfArray<Accumulator>, `${LastOfArray<Accumulator>}${F}`, FirstOfString<R>]> : SplitByCase<R, Separator, [...Accumulator, F]> : never : Accumulator extends [] ? T extends "" ? [] : string[] : Accumulator;
+type JoinByCase<T, Joiner extends string> = string extends T ? string : string[] extends T ? string : T extends string ? SplitByCase<T> extends readonly string[] ? JoinLowercaseWords<SplitByCase<T>, Joiner> : never : T extends readonly string[] ? JoinLowercaseWords<T, Joiner> : never;
+type PascalCase<T, Normalize extends boolean | undefined = false> = string extends T ? string : string[] extends T ? string : T extends string ? SplitByCase<T> extends readonly string[] ? CapitalizedWords<SplitByCase<T>, "", Normalize> : never : T extends readonly string[] ? CapitalizedWords<T, "", Normalize> : never;
+type CamelCase<T, Normalize extends boolean | undefined = false> = string extends T ? string : string[] extends T ? string : Uncapitalize<PascalCase<T, Normalize>>;
+type KebabCase<T extends string | readonly string[], Joiner extends string = "-"> = JoinByCase<T, Joiner>;
+type SnakeCase<T extends string | readonly string[]> = JoinByCase<T, "_">;
+type TrainCase<T, Normalize extends boolean | undefined = false, Joiner extends string = "-"> = string extends T ? string : string[] extends T ? string : T extends string ? SplitByCase<T> extends readonly string[] ? CapitalizedWords<SplitByCase<T>, Joiner> : never : T extends readonly string[] ? CapitalizedWords<T, Joiner, Normalize> : never;
+type FlatCase<T extends string | readonly string[], Joiner extends string = ""> = JoinByCase<T, Joiner>;
+declare function isUppercase(char?: string): boolean | undefined;
+declare function splitByCase<T extends string>(str: T): SplitByCase<T>;
+declare function splitByCase<T extends string, Separator extends readonly string[]>(str: T, separators: Separator): SplitByCase<T, Separator[number]>;
+declare function upperFirst<S extends string>(str: S): Capitalize<S>;
+declare function lowerFirst<S extends string>(str: S): Uncapitalize<S>;
+declare function pascalCase(): "";
+declare function pascalCase<T extends string | readonly string[], UserCaseOptions extends CaseOptions = CaseOptions>(str: T, opts?: CaseOptions): PascalCase<T, UserCaseOptions["normalize"]>;
+declare function camelCase(): "";
+declare function camelCase<T extends string | readonly string[], UserCaseOptions extends CaseOptions = CaseOptions>(str: T, opts?: UserCaseOptions): CamelCase<T, UserCaseOptions["normalize"]>;
+declare function kebabCase(): "";
+declare function kebabCase<T extends string | readonly string[]>(str: T): KebabCase<T>;
+declare function kebabCase<T extends string | readonly string[], Joiner extends string>(str: T, joiner: Joiner): KebabCase<T, Joiner>;
+declare function snakeCase(): "";
+declare function snakeCase<T extends string | readonly string[]>(str: T): SnakeCase<T>;
+declare function flatCase(): "";
+declare function flatCase<T extends string | readonly string[]>(str: T): FlatCase<T>;
+declare function trainCase(): "";
+declare function trainCase<T extends string | readonly string[], UserCaseOptions extends CaseOptions = CaseOptions>(str: T, opts?: UserCaseOptions): TrainCase<T, UserCaseOptions["normalize"]>;
+declare function titleCase(): "";
+declare function titleCase<T extends string | readonly string[], UserCaseOptions extends CaseOptions = CaseOptions>(str: T, opts?: UserCaseOptions): TrainCase<T, UserCaseOptions["normalize"], " ">;
+//#endregion
+export { CamelCase, CaseOptions, type Entries, FlatCase, type FromEntries, JoinByCase, KebabCase, PascalCase, SnakeCase, SplitByCase, TrainCase, camelCase, entries, flatCase, fromEntries, isUppercase, kebabCase, lowerFirst, pascalCase, snakeCase, splitByCase, titleCase, trainCase, upperFirst };
+//# sourceMappingURL=index.d.mts.map

package/dist/index.mjs

@@ -0,0 +1,99 @@
+//#region src/utils/entries.ts
+const entries = (obj) => {
+	return Object.entries(obj);
+};
+
+//#endregion
+//#region src/utils/fromEntries.ts
+const fromEntries = (entries$1) => {
+	return entries$1.reduce((acc, cur) => {
+		return {
+			...acc,
+			[cur[0]]: cur[1]
+		};
+	}, {});
+};
+
+//#endregion
+//#region src/utils/scule.ts
+const NUMBER_CHAR_RE = /\d/;
+const STR_SPLITTERS = [
+	"-",
+	"_",
+	"/",
+	"."
+];
+function isUppercase(char = "") {
+	if (NUMBER_CHAR_RE.test(char)) return;
+	return char !== char.toLowerCase();
+}
+function splitByCase(str, separators) {
+	const splitters = separators ?? STR_SPLITTERS;
+	const parts = [];
+	if (!str || typeof str !== "string") return parts;
+	let buff = "";
+	let previousUpper;
+	let previousSplitter;
+	for (const char of str) {
+		const isSplitter = splitters.includes(char);
+		if (isSplitter === true) {
+			parts.push(buff);
+			buff = "";
+			previousUpper = void 0;
+			continue;
+		}
+		const isUpper = isUppercase(char);
+		if (previousSplitter === false) {
+			if (previousUpper === false && isUpper === true) {
+				parts.push(buff);
+				buff = char;
+				previousUpper = isUpper;
+				continue;
+			}
+			if (previousUpper === true && isUpper === false && buff.length > 1) {
+				const lastChar = buff.at(-1);
+				parts.push(buff.slice(0, Math.max(0, buff.length - 1)));
+				buff = lastChar + char;
+				previousUpper = isUpper;
+				continue;
+			}
+		}
+		buff += char;
+		previousUpper = isUpper;
+		previousSplitter = isSplitter;
+	}
+	parts.push(buff);
+	return parts;
+}
+function upperFirst(str) {
+	return str ? str[0].toUpperCase() + str.slice(1) : "";
+}
+function lowerFirst(str) {
+	return str ? str[0].toLowerCase() + str.slice(1) : "";
+}
+function pascalCase(str, opts) {
+	return str ? (Array.isArray(str) ? str : splitByCase(str)).map((p) => upperFirst(opts?.normalize ? p.toLowerCase() : p)).join("") : "";
+}
+function camelCase(str, opts) {
+	return lowerFirst(pascalCase(str || "", opts));
+}
+function kebabCase(str, joiner) {
+	return str ? (Array.isArray(str) ? str : splitByCase(str)).map((p) => p.toLowerCase()).join(joiner ?? "-") : "";
+}
+function snakeCase(str) {
+	return kebabCase(str || "", "_");
+}
+function flatCase(str) {
+	return kebabCase(str || "", "");
+}
+function trainCase(str, opts) {
+	return (Array.isArray(str) ? str : splitByCase(str)).filter(Boolean).map((p) => upperFirst(opts?.normalize ? p.toLowerCase() : p)).join("-");
+}
+const titleCaseExceptions = /^(a|an|and|as|at|but|by|for|if|in|is|nor|of|on|or|the|to|with)$/i;
+function titleCase(str, opts) {
+	return (Array.isArray(str) ? str : splitByCase(str)).filter(Boolean).map((p) => titleCaseExceptions.test(p) ? p.toLowerCase() : upperFirst(opts?.normalize ? p.toLowerCase() : p)).join(" ");
+}
+
+//#endregion
+export { camelCase, entries, flatCase, fromEntries, isUppercase, kebabCase, lowerFirst, pascalCase, snakeCase, splitByCase, titleCase, trainCase, upperFirst };
+//# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":["entries","parts: string[]","previousUpper: boolean | undefined","previousSplitter: boolean | undefined"],"sources":["../src/utils/entries.ts","../src/utils/fromEntries.ts","../src/utils/scule.ts"],"sourcesContent":["type Entries<T> = (keyof T extends infer U\n  ? U extends keyof T\n    ? [U, T[U]]\n    : never\n  : never)[];\n\nconst entries = <T extends Record<string, unknown>>(obj: T): Entries<T> => {\n  return Object.entries(obj) as Entries<T>;\n};\n\nexport { entries };\nexport type { Entries };\n","type FromEntries<T extends [PropertyKey, unknown][]> = {\n  [K in T[number][0]]: Extract<T[number], [K, unknown]>[1];\n};\n\nconst fromEntries = <T extends [PropertyKey, unknown][]>(\n  entries: T\n): FromEntries<T> => {\n  return entries.reduce((acc, cur) => {\n    return {\n      ...acc,\n      [cur[0]]: cur[1],\n    };\n  }, {} as FromEntries<T>);\n};\n\nexport { fromEntries };\nexport type { FromEntries };\n","type Splitter = \"-\" | \"_\" | \"/\" | \".\";\ntype FirstOfString<S extends string> = S extends `${infer F}${string}`\n  ? F\n  : never;\ntype RemoveFirstOfString<S extends string> = S extends `${string}${infer R}`\n  ? R\n  : never;\ntype IsUpper<S extends string> = S extends Uppercase<S> ? true : false;\ntype IsLower<S extends string> = S extends Lowercase<S> ? true : false;\ntype SameLetterCase<\n  X extends string,\n  Y extends string\n> = IsUpper<X> extends IsUpper<Y>\n  ? true\n  : IsLower<X> extends IsLower<Y>\n  ? true\n  : false;\ntype CapitalizedWords<\n  T extends readonly string[],\n  Accumulator extends string = \"\",\n  Normalize extends boolean | undefined = false\n> = T extends readonly [infer F extends string, ...infer R extends string[]]\n  ? CapitalizedWords<\n      R,\n      `${Accumulator}${Capitalize<Normalize extends true ? Lowercase<F> : F>}`,\n      Normalize\n    >\n  : Accumulator;\ntype JoinLowercaseWords<\n  T extends readonly string[],\n  Joiner extends string,\n  Accumulator extends string = \"\"\n> = T extends readonly [infer F extends string, ...infer R extends string[]]\n  ? Accumulator extends \"\"\n    ? JoinLowercaseWords<R, Joiner, `${Accumulator}${Lowercase<F>}`>\n    : JoinLowercaseWords<R, Joiner, `${Accumulator}${Joiner}${Lowercase<F>}`>\n  : Accumulator;\n\ntype LastOfArray<T extends any[]> = T extends [...any, infer R] ? R : never;\ntype RemoveLastOfArray<T extends any[]> = T extends [...infer F, any]\n  ? F\n  : never;\n\nexport type CaseOptions = {\n  normalize?: boolean;\n};\n\nexport type SplitByCase<\n  T,\n  Separator extends string = Splitter,\n  Accumulator extends unknown[] = []\n> = string extends Separator\n  ? string[]\n  : T extends `${infer F}${infer R}`\n  ? [LastOfArray<Accumulator>] extends [never]\n    ? SplitByCase<R, Separator, [F]>\n    : LastOfArray<Accumulator> extends string\n    ? R extends \"\"\n      ? SplitByCase<\n          R,\n          Separator,\n          [...RemoveLastOfArray<Accumulator>, `${LastOfArray<Accumulator>}${F}`]\n        >\n      : SameLetterCase<F, FirstOfString<R>> extends true\n      ? F extends Separator\n        ? FirstOfString<R> extends Separator\n          ? SplitByCase<R, Separator, [...Accumulator, \"\"]>\n          : IsUpper<FirstOfString<R>> extends true\n          ? SplitByCase<\n              RemoveFirstOfString<R>,\n              Separator,\n              [...Accumulator, FirstOfString<R>]\n            >\n          : SplitByCase<R, Separator, [...Accumulator, \"\"]>\n        : SplitByCase<\n            R,\n            Separator,\n            [\n              ...RemoveLastOfArray<Accumulator>,\n              `${LastOfArray<Accumulator>}${F}`\n            ]\n          >\n      : IsLower<F> extends true\n      ? SplitByCase<\n          RemoveFirstOfString<R>,\n          Separator,\n          [\n            ...RemoveLastOfArray<Accumulator>,\n            `${LastOfArray<Accumulator>}${F}`,\n            FirstOfString<R>\n          ]\n        >\n      : SplitByCase<R, Separator, [...Accumulator, F]>\n    : never\n  : Accumulator extends []\n  ? T extends \"\"\n    ? []\n    : string[]\n  : Accumulator;\n\nexport type JoinByCase<T, Joiner extends string> = string extends T\n  ? string\n  : string[] extends T\n  ? string\n  : T extends string\n  ? SplitByCase<T> extends readonly string[]\n    ? JoinLowercaseWords<SplitByCase<T>, Joiner>\n    : never\n  : T extends readonly string[]\n  ? JoinLowercaseWords<T, Joiner>\n  : never;\n\nexport type PascalCase<\n  T,\n  Normalize extends boolean | undefined = false\n> = string extends T\n  ? string\n  : string[] extends T\n  ? string\n  : T extends string\n  ? SplitByCase<T> extends readonly string[]\n    ? CapitalizedWords<SplitByCase<T>, \"\", Normalize>\n    : never\n  : T extends readonly string[]\n  ? CapitalizedWords<T, \"\", Normalize>\n  : never;\n\nexport type CamelCase<\n  T,\n  Normalize extends boolean | undefined = false\n> = string extends T\n  ? string\n  : string[] extends T\n  ? string\n  : Uncapitalize<PascalCase<T, Normalize>>;\n\nexport type KebabCase<\n  T extends string | readonly string[],\n  Joiner extends string = \"-\"\n> = JoinByCase<T, Joiner>;\n\nexport type SnakeCase<T extends string | readonly string[]> = JoinByCase<\n  T,\n  \"_\"\n>;\n\nexport type TrainCase<\n  T,\n  Normalize extends boolean | undefined = false,\n  Joiner extends string = \"-\"\n> = string extends T\n  ? string\n  : string[] extends T\n  ? string\n  : T extends string\n  ? SplitByCase<T> extends readonly string[]\n    ? CapitalizedWords<SplitByCase<T>, Joiner>\n    : never\n  : T extends readonly string[]\n  ? CapitalizedWords<T, Joiner, Normalize>\n  : never;\n\nexport type FlatCase<\n  T extends string | readonly string[],\n  Joiner extends string = \"\"\n> = JoinByCase<T, Joiner>;\n\nconst NUMBER_CHAR_RE = /\\d/;\nconst STR_SPLITTERS = [\"-\", \"_\", \"/\", \".\"] as const;\n\nexport function isUppercase(char = \"\"): boolean | undefined {\n  if (NUMBER_CHAR_RE.test(char)) {\n    return undefined;\n  }\n  return char !== char.toLowerCase();\n}\n\nexport function splitByCase<T extends string>(str: T): SplitByCase<T>;\nexport function splitByCase<\n  T extends string,\n  Separator extends readonly string[]\n>(str: T, separators: Separator): SplitByCase<T, Separator[number]>;\nexport function splitByCase<\n  T extends string,\n  Separator extends readonly string[]\n>(str: T, separators?: Separator) {\n  const splitters = separators ?? STR_SPLITTERS;\n  const parts: string[] = [];\n\n  if (!str || typeof str !== \"string\") {\n    return parts as SplitByCase<T, Separator[number]>;\n  }\n\n  let buff = \"\";\n\n  let previousUpper: boolean | undefined;\n  let previousSplitter: boolean | undefined;\n\n  for (const char of str) {\n    // Splitter\n    const isSplitter = (splitters as unknown as string).includes(char);\n    if (isSplitter === true) {\n      parts.push(buff);\n      buff = \"\";\n      previousUpper = undefined;\n      continue;\n    }\n\n    const isUpper = isUppercase(char);\n    if (previousSplitter === false) {\n      // Case rising edge\n      if (previousUpper === false && isUpper === true) {\n        parts.push(buff);\n        buff = char;\n        previousUpper = isUpper;\n        continue;\n      }\n      // Case falling edge\n      if (previousUpper === true && isUpper === false && buff.length > 1) {\n        const lastChar = buff.at(-1);\n        parts.push(buff.slice(0, Math.max(0, buff.length - 1)));\n        buff = lastChar + char;\n        previousUpper = isUpper;\n        continue;\n      }\n    }\n\n    // Normal char\n    buff += char;\n    previousUpper = isUpper;\n    previousSplitter = isSplitter;\n  }\n\n  parts.push(buff);\n\n  return parts as SplitByCase<T, Separator[number]>;\n}\n\nexport function upperFirst<S extends string>(str: S): Capitalize<S> {\n  return (str ? str[0].toUpperCase() + str.slice(1) : \"\") as Capitalize<S>;\n}\n\nexport function lowerFirst<S extends string>(str: S): Uncapitalize<S> {\n  return (str ? str[0].toLowerCase() + str.slice(1) : \"\") as Uncapitalize<S>;\n}\n\nexport function pascalCase(): \"\";\nexport function pascalCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str: T, opts?: CaseOptions): PascalCase<T, UserCaseOptions[\"normalize\"]>;\nexport function pascalCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str?: T, opts?: UserCaseOptions) {\n  return str\n    ? ((Array.isArray(str) ? str : splitByCase(str as string))\n        .map((p) => upperFirst(opts?.normalize ? p.toLowerCase() : p))\n        .join(\"\") as PascalCase<T, UserCaseOptions[\"normalize\"]>)\n    : \"\";\n}\n\nexport function camelCase(): \"\";\nexport function camelCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str: T, opts?: UserCaseOptions): CamelCase<T, UserCaseOptions[\"normalize\"]>;\nexport function camelCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str?: T, opts?: UserCaseOptions) {\n  return lowerFirst(pascalCase(str || \"\", opts)) as CamelCase<\n    T,\n    UserCaseOptions[\"normalize\"]\n  >;\n}\n\nexport function kebabCase(): \"\";\nexport function kebabCase<T extends string | readonly string[]>(\n  str: T\n): KebabCase<T>;\nexport function kebabCase<\n  T extends string | readonly string[],\n  Joiner extends string\n>(str: T, joiner: Joiner): KebabCase<T, Joiner>;\nexport function kebabCase<\n  T extends string | readonly string[],\n  Joiner extends string\n>(str?: T, joiner?: Joiner) {\n  return str\n    ? ((Array.isArray(str) ? str : splitByCase(str as string))\n        .map((p) => p.toLowerCase())\n        .join(joiner ?? \"-\") as KebabCase<T, Joiner>)\n    : \"\";\n}\n\nexport function snakeCase(): \"\";\nexport function snakeCase<T extends string | readonly string[]>(\n  str: T\n): SnakeCase<T>;\nexport function snakeCase<T extends string | readonly string[]>(str?: T) {\n  return kebabCase(str || \"\", \"_\") as SnakeCase<T>;\n}\n\nexport function flatCase(): \"\";\nexport function flatCase<T extends string | readonly string[]>(\n  str: T\n): FlatCase<T>;\nexport function flatCase<T extends string | readonly string[]>(str?: T) {\n  return kebabCase(str || \"\", \"\") as FlatCase<T>;\n}\n\nexport function trainCase(): \"\";\nexport function trainCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str: T, opts?: UserCaseOptions): TrainCase<T, UserCaseOptions[\"normalize\"]>;\nexport function trainCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str?: T, opts?: UserCaseOptions) {\n  return (Array.isArray(str) ? str : splitByCase(str as string))\n    .filter(Boolean)\n    .map((p) => upperFirst(opts?.normalize ? p.toLowerCase() : p))\n    .join(\"-\") as TrainCase<T, UserCaseOptions[\"normalize\"]>;\n}\n\nconst titleCaseExceptions =\n  /^(a|an|and|as|at|but|by|for|if|in|is|nor|of|on|or|the|to|with)$/i;\n\nexport function titleCase(): \"\";\nexport function titleCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(\n  str: T,\n  opts?: UserCaseOptions\n): TrainCase<T, UserCaseOptions[\"normalize\"], \" \">;\nexport function titleCase<\n  T extends string | readonly string[],\n  UserCaseOptions extends CaseOptions = CaseOptions\n>(str?: T, opts?: UserCaseOptions) {\n  return (Array.isArray(str) ? str : splitByCase(str as string))\n    .filter(Boolean)\n    .map((p) =>\n      titleCaseExceptions.test(p)\n        ? p.toLowerCase()\n        : upperFirst(opts?.normalize ? p.toLowerCase() : p)\n    )\n    .join(\" \") as TrainCase<T, UserCaseOptions[\"normalize\"]>;\n}\n"],"mappings":";AAMA,MAAM,WAA8C,QAAuB;AACzE,QAAO,OAAO,QAAQ,IAAI;;;;;ACH5B,MAAM,eACJ,cACmB;AACnB,QAAOA,UAAQ,QAAQ,KAAK,QAAQ;AAClC,SAAO;GACL,GAAG;IACF,IAAI,KAAK,IAAI;GACf;IACA,EAAE,CAAmB;;;;;AC2J1B,MAAM,iBAAiB;AACvB,MAAM,gBAAgB;CAAC;CAAK;CAAK;CAAK;CAAI;AAE1C,SAAgB,YAAY,OAAO,IAAyB;AAC1D,KAAI,eAAe,KAAK,KAAK,CAC3B;AAEF,QAAO,SAAS,KAAK,aAAa;;AAQpC,SAAgB,YAGd,KAAQ,YAAwB;CAChC,MAAM,YAAY,cAAc;CAChC,MAAMC,QAAkB,EAAE;AAE1B,KAAI,CAAC,OAAO,OAAO,QAAQ,SACzB,QAAO;CAGT,IAAI,OAAO;CAEX,IAAIC;CACJ,IAAIC;AAEJ,MAAK,MAAM,QAAQ,KAAK;EAEtB,MAAM,aAAc,UAAgC,SAAS,KAAK;AAClE,MAAI,eAAe,MAAM;AACvB,SAAM,KAAK,KAAK;AAChB,UAAO;AACP,mBAAgB;AAChB;;EAGF,MAAM,UAAU,YAAY,KAAK;AACjC,MAAI,qBAAqB,OAAO;AAE9B,OAAI,kBAAkB,SAAS,YAAY,MAAM;AAC/C,UAAM,KAAK,KAAK;AAChB,WAAO;AACP,oBAAgB;AAChB;;AAGF,OAAI,kBAAkB,QAAQ,YAAY,SAAS,KAAK,SAAS,GAAG;IAClE,MAAM,WAAW,KAAK,GAAG,GAAG;AAC5B,UAAM,KAAK,KAAK,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC,CAAC;AACvD,WAAO,WAAW;AAClB,oBAAgB;AAChB;;;AAKJ,UAAQ;AACR,kBAAgB;AAChB,qBAAmB;;AAGrB,OAAM,KAAK,KAAK;AAEhB,QAAO;;AAGT,SAAgB,WAA6B,KAAuB;AAClE,QAAQ,MAAM,IAAI,GAAG,aAAa,GAAG,IAAI,MAAM,EAAE,GAAG;;AAGtD,SAAgB,WAA6B,KAAyB;AACpE,QAAQ,MAAM,IAAI,GAAG,aAAa,GAAG,IAAI,MAAM,EAAE,GAAG;;AAQtD,SAAgB,WAGd,KAAS,MAAwB;AACjC,QAAO,OACD,MAAM,QAAQ,IAAI,GAAG,MAAM,YAAY,IAAc,EACpD,KAAK,MAAM,WAAW,MAAM,YAAY,EAAE,aAAa,GAAG,EAAE,CAAC,CAC7D,KAAK,GAAG,GACX;;AAQN,SAAgB,UAGd,KAAS,MAAwB;AACjC,QAAO,WAAW,WAAW,OAAO,IAAI,KAAK,CAAC;;AAchD,SAAgB,UAGd,KAAS,QAAiB;AAC1B,QAAO,OACD,MAAM,QAAQ,IAAI,GAAG,MAAM,YAAY,IAAc,EACpD,KAAK,MAAM,EAAE,aAAa,CAAC,CAC3B,KAAK,UAAU,IAAI,GACtB;;AAON,SAAgB,UAAgD,KAAS;AACvE,QAAO,UAAU,OAAO,IAAI,IAAI;;AAOlC,SAAgB,SAA+C,KAAS;AACtE,QAAO,UAAU,OAAO,IAAI,GAAG;;AAQjC,SAAgB,UAGd,KAAS,MAAwB;AACjC,SAAQ,MAAM,QAAQ,IAAI,GAAG,MAAM,YAAY,IAAc,EAC1D,OAAO,QAAQ,CACf,KAAK,MAAM,WAAW,MAAM,YAAY,EAAE,aAAa,GAAG,EAAE,CAAC,CAC7D,KAAK,IAAI;;AAGd,MAAM,sBACJ;AAUF,SAAgB,UAGd,KAAS,MAAwB;AACjC,SAAQ,MAAM,QAAQ,IAAI,GAAG,MAAM,YAAY,IAAc,EAC1D,OAAO,QAAQ,CACf,KAAK,MACJ,oBAAoB,KAAK,EAAE,GACvB,EAAE,aAAa,GACf,WAAW,MAAM,YAAY,EAAE,aAAa,GAAG,EAAE,CACtD,CACA,KAAK,IAAI"}

package/package.json

@@ -0,0 +1,49 @@
+{
+  "name": "@dathomir/shared",
+  "description": "dathomir shared package",
+  "version": "0.0.1-beta.0",
+  "private": false,
+  "publishConfig": {
+    "access": "public"
+  },
+  "type": "module",
+  "license": "MPL-2.0",
+  "repository": {
+    "type": "git",
+    "url": "git+ssh://git@github.com:dathomir-js/dathomir.git"
+  },
+  "bugs": {
+    "url": "https://github.com/dathomir-js/dathomir/issues",
+    "email": "dathomir@takumaru.dev"
+  },
+  "homepage": "https://github.com/dathomir-js/dathomir#readme",
+  "author": "takuma-ru <takuma-ru@takumaru.dev> (https://github.com/takuma-ru/)",
+  "keywords": [
+    "dathomir",
+    "framework",
+    "frontend",
+    "javascript",
+    "typescript"
+  ],
+  "exports": {
+    ".": {
+      "import": "./dist/index.mjs",
+      "require": "./dist/index.cjs",
+      "types": "./dist/index.d.mts"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "devDependencies": {
+    "@takuma-ru/rlse": "0.0.1-beta.8",
+    "@dathomir/config": "0.0.0"
+  },
+  "scripts": {
+    "dev": "tsdown --watch",
+    "build": "tsdown",
+    "typecheck": "tsc --noEmit",
+    "lint": "oxlint",
+    "release": "rlse"
+  }
+}