@visulima/string 3.0.0-alpha.7 → 3.0.0-alpha.9

package/CHANGELOG.md

@@ -1,3 +1,42 @@
+## @visulima/string [3.0.0-alpha.9](https://github.com/visulima/visulima/compare/@visulima/string@3.0.0-alpha.8...@visulima/string@3.0.0-alpha.9) (2026-04-08)
+
+### Features
+
+* **string): native indent implementation; refactor(tui:** replace indent-string and is-fullwidth-code-point ([1368488](https://github.com/visulima/visulima/commit/136848850242ddeae91320dd21d6fdeb0760768c))
+* **string:** add east-asian-width, isFullwidthCodePoint exports and fix utilities ([b44e0c5](https://github.com/visulima/visulima/commit/b44e0c5b4e5cff7b39d9148516f7ed510bb35bb6))
+* **string:** add indent, strip-indent, dedent, redent, isFullwidthCodePoint, and east-asian-width helpers ([5441f3c](https://github.com/visulima/visulima/commit/5441f3c883256165b36c0d9580bbb44cc36e9a62))
+
+### Bug Fixes
+
+* resolve failing tests across multiple packages ([2b4b6f0](https://github.com/visulima/visulima/commit/2b4b6f04169b60fdc4cf77b293015436a272c0fb))
+* **string:** properly fix eslint errors in code ([184b6a3](https://github.com/visulima/visulima/commit/184b6a30bb3d49185f64a0a6d88f693bd61644f9))
+* **string:** remove remaining eslint suppressions with proper code fixes ([c2e183e](https://github.com/visulima/visulima/commit/c2e183ed1cdb8fe54d46c5376eca0208a9b65b0f))
+* **string:** resolve eslint errors ([18f4366](https://github.com/visulima/visulima/commit/18f43665e335b66f2960b4ebffc510efe9df9b6e))
+
+### Miscellaneous Chores
+
+* **data-manipulation:** remove empty dependency objects from package.json ([c0e8f76](https://github.com/visulima/visulima/commit/c0e8f7689a2da413f771494f6ecb07babc4b5e06))
+* **string:** add tsconfig.eslint.json for type-aware linting ([b29661d](https://github.com/visulima/visulima/commit/b29661dc2cf32823f4aff40ac3c7b6a3e12b678e))
+* **string:** apply prettier formatting ([ed0e3a1](https://github.com/visulima/visulima/commit/ed0e3a15ff5d387ae4897eb0d4ed8a0a864951c2))
+* **string:** migrate .prettierrc.cjs to prettier.config.js ([750ddba](https://github.com/visulima/visulima/commit/750ddba531071ff5b4d74a5e13799630c8d55c27))
+* update bundled dependency licenses ([6ace4c6](https://github.com/visulima/visulima/commit/6ace4c69d41fc1fd0a744fbca8ca219ba631b4ab))
+
+
+### Dependencies
+
+* **@visulima/colorize:** upgraded to 2.0.0-alpha.8
+
+## @visulima/string [3.0.0-alpha.8](https://github.com/visulima/visulima/compare/@visulima/string@3.0.0-alpha.7...@visulima/string@3.0.0-alpha.8) (2026-03-26)
+
+### Features
+
+* **web:** auto-generate packages page from workspace metadata ([623e520](https://github.com/visulima/visulima/commit/623e5207693a7fe720f5f2f179593a3654c880e3))
+
+
+### Dependencies
+
+* **@visulima/colorize:** upgraded to 2.0.0-alpha.7
+
 ## @visulima/string [3.0.0-alpha.7](https://github.com/visulima/visulima/compare/@visulima/string@3.0.0-alpha.6...@visulima/string@3.0.0-alpha.7) (2026-03-26)
 
 ### Bug Fixes

package/LICENSE.md

@@ -159,6 +159,23 @@ Repository: https://github.com/mdevils/html-entities.git
 
 ---------------------------------------
 
+## indent-string
+License: MIT
+By: Sindre Sorhus
+Repository: sindresorhus/indent-string
+
+> MIT License
+>
+> Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
+>
+> Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+>
+> The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+>
+> THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+---------------------------------------
+
 ## lodash-es
 License: MIT
 By: John-David Dalton, Mathias Bynens
@@ -334,6 +351,23 @@ Repository: git+https://github.com/codsen/codsen.git
 
 ---------------------------------------
 
+## redent
+License: MIT
+By: Sindre Sorhus
+Repository: sindresorhus/redent
+
+> MIT License
+>
+> Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
+>
+> Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+>
+> The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+>
+> THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+---------------------------------------
+
 ## rfdc
 License: MIT
 By: David Mark Clements
@@ -447,6 +481,23 @@ Repository: git+https://github.com/codsen/codsen.git
 
 ---------------------------------------
 
+## strip-indent
+License: MIT
+By: Sindre Sorhus
+Repository: sindresorhus/strip-indent
+
+> MIT License
+>
+> Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
+>
+> Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+>
+> The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+>
+> THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+---------------------------------------
+
 ## tiny-invariant
 License: MIT
 By: Alex Reardon
@@ -479,11 +530,14 @@ Repository: https://github.com/alexreardon/tiny-invariant.git
 <!-- TYPE_DEPENDENCIES -->
 
 # Licenses of bundled types
+
 The published @visulima/string artifact additionally contains code with the following licenses:
 MIT
 
 # Bundled types:
+
 ## fastest-levenshtein
+
 License: MIT
 By: Kasper U. Weihe
 Repository: git+https://github.com/ka-weihe/fastest-levenshtein.git

package/README.md

@@ -55,8 +55,11 @@
     - Split by separators (foo-bar → ["foo", "bar"])
     - Preserve known acronyms (XMLHttpRequest → ["XML", "Http", "Request"])
 - **Text Indentation**:
-    - `outdent`: Remove leading indentation while preserving relative indentation
-    - Handles template literals and string inputs
+    - `indent`: Add indentation to each line in a string
+    - `stripIndent`: Strip common leading whitespace from all lines
+    - `dedent`: Strip indent and trim leading/trailing blank lines
+    - `redent`: Strip redundant indentation and re-indent
+    - `outdent`: Remove indentation from template literals
     - Normalizes newlines across platforms
     - Configurable trimming behavior
 - **String Analysis**:
@@ -66,6 +69,9 @@
 - **String Width Calculation**:
     - `getStringWidth`: Calculate visual width of strings with Unicode support
     - `getStringTruncatedWidth`: Width calculation with smart truncation
+    - `isFullwidthCodePoint`: Check if a code point is fullwidth
+    - `eastAsianWidth`: Get character width (1 or 2) for a code point
+    - `eastAsianWidthType`: Get East Asian Width category for a code point
     - Handles CJK characters, emojis, ANSI codes, and more
     - Configurable character width settings
     - Support for zero-width and combining characters

package/dist/align-text.js

@@ -11,14 +11,16 @@ const alignText = (text, options = {}) => {
   const pad = options.pad ?? " ";
   const widthDiffFunction = align === "right" ? fullDiff : halfDiff;
   let returnString = false;
-  if (!Array.isArray(text)) {
+  let lines;
+  if (Array.isArray(text)) {
+    lines = text;
+  } else {
     returnString = true;
-    text = String(text).split(split);
+    lines = text.split(split);
   }
   let width;
   let maxWidth = 0;
-  text = text.map((input) => {
-    input = String(input);
+  const result = lines.map((input) => {
     width = getStringWidth(input, options.stringWidthOptions);
     maxWidth = Math.max(width, maxWidth);
     return {
@@ -26,7 +28,7 @@ const alignText = (text, options = {}) => {
       width
     };
   }).map((object) => Array.from({ length: widthDiffFunction(maxWidth, object.width) + 1 }).join(pad) + object.str);
-  return returnString ? text.join(split) : text;
+  return returnString ? result.join(split) : result;
 };
 
 export { alignText };

package/dist/case/camel-case.js

@@ -1,11 +1,11 @@
-import { R as RE_FAST_ANSI } from '../packem_shared/constants-D5qaproB.js';
+import { R as RE_FAST_ANSI } from '../packem_shared/constants-BsZS5f0z.js';
 import LRUCache from '../packem_shared/LRUCache-3r3SovvR.js';
 import lowerFirst from './lower-first.js';
 import { splitByCase } from './split-by-case.js';
 import upperFirst from './upper-first.js';
 import { g as generateCacheKey } from '../packem_shared/generate-cache-key-DdayDfjV.js';
-import joinSegments from '../packem_shared/joinSegments-BStLas0c.js';
-import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-DEB8-ZPT.js';
+import joinSegments from '../packem_shared/joinSegments-CvxSgKz0.js';
+import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-4p3yKEzn.js';
 
 const defaultCacheStore = new LRUCache(1e3);
 const camelCase = (value, options) => {
@@ -36,13 +36,13 @@ const camelCase = (value, options) => {
       if (options?.handleAnsi && RE_FAST_ANSI.test(word)) {
         return word;
       }
-      word = options?.locale?.startsWith("de") ? normalizeGermanEszett(word) : word;
-      word = options?.locale ? word.toLocaleLowerCase(options.locale) : word.toLowerCase();
+      const normalized = options?.locale?.startsWith("de") ? normalizeGermanEszett(word) : word;
+      const lowered = options?.locale ? normalized.toLocaleLowerCase(options.locale) : normalized.toLowerCase();
       if (firstWord) {
         firstWord = false;
-        return lowerFirst(word, options);
+        return lowerFirst(lowered, options);
       }
-      return upperFirst(word, options);
+      return upperFirst(lowered, options);
     }),
     ""
   );

package/dist/case/capital-case.js

@@ -1,10 +1,10 @@
-import { R as RE_FAST_ANSI } from '../packem_shared/constants-D5qaproB.js';
+import { R as RE_FAST_ANSI } from '../packem_shared/constants-BsZS5f0z.js';
 import LRUCache from '../packem_shared/LRUCache-3r3SovvR.js';
 import { splitByCase } from './split-by-case.js';
 import upperFirst from './upper-first.js';
 import { g as generateCacheKey } from '../packem_shared/generate-cache-key-DdayDfjV.js';
-import joinSegments from '../packem_shared/joinSegments-BStLas0c.js';
-import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-DEB8-ZPT.js';
+import joinSegments from '../packem_shared/joinSegments-CvxSgKz0.js';
+import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-4p3yKEzn.js';
 
 const defaultCacheStore = new LRUCache(1e3);
 const capitalCase = (value, options) => {

package/dist/case/flip-case.js

@@ -20,7 +20,7 @@ const __cjs_getBuiltinModule = (module) => {
 const {
   stripVTControlCharacters
 } = __cjs_getBuiltinModule("node:util");
-import { s as stripEmoji } from '../packem_shared/constants-D5qaproB.js';
+import { s as stripEmoji } from '../packem_shared/constants-BsZS5f0z.js';
 import LRUCache from '../packem_shared/LRUCache-3r3SovvR.js';
 import { g as generateCacheKey } from '../packem_shared/generate-cache-key-DdayDfjV.js';
 

package/dist/case/identify-case.js

@@ -8,6 +8,7 @@ const IS_UPPERCASE = /^[A-Z][A-Z0-9]*$/;
 const WHITESPACE_REGEX = /\s+/;
 const IS_NUMERIC = /^\d+$/;
 const IS_CAMEL_CASE_LIKE = /^[a-z][a-z0-9]*(?:[A-Z][a-z0-9]*)+$/;
+const IS_LOWERCASE_START = /^[a-z]/;
 const CONTAINS_PUNCTUATION_MID_WORD = /[.!?;:,](?!\s|$)/;
 const identifyCase = (value) => {
   if (typeof value !== "string") {
@@ -47,7 +48,7 @@ const identifyCase = (value) => {
   if (words.length > 1 && IS_NUMERIC.test(words[0]) && IS_PASCAL_CASE.test(words[1])) {
     return "title";
   }
-  if (words.length > 1 && IS_PASCAL_CASE.test(words[0]) && /^[a-z]/.test(words[1])) {
+  if (words.length > 1 && IS_PASCAL_CASE.test(words[0]) && IS_LOWERCASE_START.test(words[1])) {
     return "sentence";
   }
   if (IS_PASCAL_CASE.test(value)) {

package/dist/case/index.d.ts

@@ -20,5 +20,5 @@ export { default as trainCase } from "./train-case.js";
 export { type a as CamelCase, type b as CapitalCase, type C as CaseOptions, type c as ConstantCase, type D as DotCase, type F as FlatCase, type d as FlipCase, type I as IdentifyCase, type K as KebabCase, type L as LocaleOptions, type e as LowerFirst, type N as NoCase, type P as PascalCase, type f as PascalSnakeCase, type g as PathCase, type S as SentenceCase, type h as SnakeCase, type i as SplitByCase, type T as TitleCase, type j as TrainCase, type U as UpperFirst } from "../packem_shared/types.d-DfgbcNKh.js";
 export { default as upperFirst } from "./upper-first.js";
 import "../packem_shared/lru-cache.d-BsP6kbVJ.js";
-declare const joinSegments: <T extends string = string>(segments: string[], joiner: string) => T;
+declare const joinSegments: (segments: string[], joiner: string) => string;
 export { joinSegments };

package/dist/case/index.js

@@ -17,4 +17,4 @@ export { splitByCase } from './split-by-case.js';
 export { default as titleCase } from './title-case.js';
 export { default as trainCase } from './train-case.js';
 export { default as upperFirst } from './upper-first.js';
-export { default as joinSegments } from '../packem_shared/joinSegments-BStLas0c.js';
+export { default as joinSegments } from '../packem_shared/joinSegments-CvxSgKz0.js';

package/dist/case/kebab-case.js

@@ -1,9 +1,9 @@
-import { R as RE_FAST_ANSI } from '../packem_shared/constants-D5qaproB.js';
+import { R as RE_FAST_ANSI } from '../packem_shared/constants-BsZS5f0z.js';
 import LRUCache from '../packem_shared/LRUCache-3r3SovvR.js';
 import { splitByCase } from './split-by-case.js';
 import { g as generateCacheKey } from '../packem_shared/generate-cache-key-DdayDfjV.js';
-import joinSegments from '../packem_shared/joinSegments-BStLas0c.js';
-import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-DEB8-ZPT.js';
+import joinSegments from '../packem_shared/joinSegments-CvxSgKz0.js';
+import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-4p3yKEzn.js';
 
 const defaultCacheStore = new LRUCache(1e3);
 const kebabCase = (value, options) => {

package/dist/case/pascal-case.js

@@ -1,10 +1,10 @@
-import { R as RE_FAST_ANSI } from '../packem_shared/constants-D5qaproB.js';
+import { R as RE_FAST_ANSI } from '../packem_shared/constants-BsZS5f0z.js';
 import LRUCache from '../packem_shared/LRUCache-3r3SovvR.js';
 import { splitByCase } from './split-by-case.js';
 import upperFirst from './upper-first.js';
 import { g as generateCacheKey } from '../packem_shared/generate-cache-key-DdayDfjV.js';
-import joinSegments from '../packem_shared/joinSegments-BStLas0c.js';
-import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-DEB8-ZPT.js';
+import joinSegments from '../packem_shared/joinSegments-CvxSgKz0.js';
+import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-4p3yKEzn.js';
 
 const defaultCacheStore = new LRUCache(1e3);
 const pascalCase = (value, options) => {

package/dist/case/sentence-case.js

@@ -1,10 +1,10 @@
-import { R as RE_FAST_ANSI } from '../packem_shared/constants-D5qaproB.js';
+import { R as RE_FAST_ANSI } from '../packem_shared/constants-BsZS5f0z.js';
 import LRUCache from '../packem_shared/LRUCache-3r3SovvR.js';
 import { splitByCase } from './split-by-case.js';
 import upperFirst from './upper-first.js';
 import { g as generateCacheKey } from '../packem_shared/generate-cache-key-DdayDfjV.js';
-import joinSegments from '../packem_shared/joinSegments-BStLas0c.js';
-import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-DEB8-ZPT.js';
+import joinSegments from '../packem_shared/joinSegments-CvxSgKz0.js';
+import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-4p3yKEzn.js';
 
 const defaultCacheStore = new LRUCache(1e3);
 const sentenceCase = (value, options) => {
@@ -35,13 +35,13 @@ const sentenceCase = (value, options) => {
       if (options?.handleAnsi && RE_FAST_ANSI.test(word)) {
         return word;
       }
-      word = options?.locale?.startsWith("de") ? normalizeGermanEszett(word) : word;
-      word = options?.locale ? word.toLocaleLowerCase(options.locale) : word.toLowerCase();
+      const normalized = options?.locale?.startsWith("de") ? normalizeGermanEszett(word) : word;
+      const lowered = options?.locale ? normalized.toLocaleLowerCase(options.locale) : normalized.toLowerCase();
       if (firstWord) {
         firstWord = false;
-        return upperFirst(word, options);
+        return upperFirst(lowered, options);
       }
-      return word;
+      return lowered;
     }),
     " "
   );

package/dist/case/split-by-case.js

@@ -20,16 +20,17 @@ const __cjs_getBuiltinModule = (module) => {
 const {
   stripVTControlCharacters
 } = __cjs_getBuiltinModule("node:util");
-import { j as RE_EMOJI, s as stripEmoji, R as RE_FAST_ANSI, k as RE_CYRILLIC, l as RE_LATIN, m as RE_GREEK, n as RE_GREEK_LATIN_SPLIT, o as RE_UZBEK_LATIN_MODIFIER, p as RE_KATAKANA, q as RE_KANJI, r as RE_HIRAGANA, t as RE_HANGUL, u as RE_HEBREW, v as RE_ARABIC, w as RE_SEPARATORS, x as RE_DEVANAGARI, y as RE_BENGALI, z as RE_GUJARATI, A as RE_GURMUKHI, B as RE_KANNADA, C as RE_TAMIL, D as RE_TELUGU, E as RE_MALAYALAM, F as RE_SINHALA, G as RE_THAI, H as RE_LAO, I as RE_TIBETAN, J as RE_MYANMAR, K as RE_ETHIOPIC, L as RE_KHMER, M as RE_ORIYA } from '../packem_shared/constants-D5qaproB.js';
+import { i as RE_EMOJI, s as stripEmoji, R as RE_FAST_ANSI, l as RE_CYRILLIC, m as RE_LATIN, n as RE_GREEK, o as RE_GREEK_LATIN_SPLIT, p as RE_UZBEK_LATIN_MODIFIER, q as RE_KATAKANA, r as RE_KANJI, t as RE_HIRAGANA, u as RE_HANGUL, v as RE_HEBREW, w as RE_ARABIC, x as RE_SEPARATORS, y as RE_DEVANAGARI, z as RE_BENGALI, A as RE_GUJARATI, B as RE_GURMUKHI, C as RE_KANNADA, D as RE_TAMIL, E as RE_TELUGU, F as RE_MALAYALAM, G as RE_SINHALA, H as RE_THAI, I as RE_LAO, J as RE_TIBETAN, K as RE_MYANMAR, L as RE_ETHIOPIC, M as RE_KHMER, N as RE_ORIYA } from '../packem_shared/constants-BsZS5f0z.js';
 import LRUCache from '../packem_shared/LRUCache-3r3SovvR.js';
 
 const regexCache = new LRUCache(1e3);
+const RE_ESCAPE_SPECIAL = /[.*+?^${}()|[\]\\]/g;
 const getSeparatorsRegex = (separators) => {
   const key = separators.join("");
   if (regexCache.has(key)) {
     return regexCache.get(key);
   }
-  const pattern = separators.map((s) => s.replaceAll(/[.*+?^${}()|[\]\\]/g, String.raw`\$&`)).join("|");
+  const pattern = separators.map((s) => s.replaceAll(RE_ESCAPE_SPECIAL, String.raw`\$&`)).join("|");
   const regex = new RegExp(pattern, "g");
   regexCache.set(key, regex);
   return regex;
@@ -53,6 +54,7 @@ const splitByEmoji = (text) => {
   return segments.filter(Boolean);
 };
 
+const RE_SLOVENIAN_SPECIAL = /[ČŠŽĐ]/i;
 const isUpperCode = new Uint8Array(128);
 const isLowerCode = new Uint8Array(128);
 const isDigitCode = new Uint8Array(128);
@@ -69,8 +71,9 @@ const handleScriptTransitions = (s, scriptDetectors, caseSensitive, locale, cust
     return [];
   }
   let hasDetectedScript = false;
-  for (const detector of Object.values(scriptDetectors)) {
-    if (detector(s[0])) {
+  const detectorValues = Object.values(scriptDetectors);
+  for (const detectorValue of detectorValues) {
+    if (detectorValue(s[0])) {
       hasDetectedScript = true;
       break;
     }
@@ -82,7 +85,9 @@ const handleScriptTransitions = (s, scriptDetectors, caseSensitive, locale, cust
   const result = [];
   let currentSegment = chars[0];
   let previousType = "other";
-  for (const [type, detector] of Object.entries(scriptDetectors)) {
+  const scriptEntries = Object.entries(scriptDetectors);
+  for (const scriptEntry of scriptEntries) {
+    const [type, detector] = scriptEntry;
     if (detector(chars[0])) {
       previousType = type;
       break;
@@ -92,7 +97,8 @@ const handleScriptTransitions = (s, scriptDetectors, caseSensitive, locale, cust
   for (let index = 1; index < chars.length; index++) {
     const char = chars[index];
     let currentType = "other";
-    for (const [type, detector] of Object.entries(scriptDetectors)) {
+    for (const scriptEntry of scriptEntries) {
+      const [type, detector] = scriptEntry;
       if (detector(char)) {
         currentType = type;
         break;
@@ -308,28 +314,36 @@ const splitCamelCaseLocale = (s, locale, knownAcronyms) => {
     if (!RE_GREEK.test(s) && !RE_LATIN.test(s)) {
       return [s];
     }
-    const parts = s.match(RE_GREEK_LATIN_SPLIT) ?? [s];
+    const parts = [];
+    RE_GREEK_LATIN_SPLIT.lastIndex = 0;
+    let greekExecMatch;
+    while ((greekExecMatch = RE_GREEK_LATIN_SPLIT.exec(s)) !== null) {
+      parts.push(greekExecMatch[0]);
+    }
+    if (parts.length === 0) {
+      parts.push(s);
+    }
     const result2 = [];
     const width = parts.length;
     if (width === 1) {
       const part = parts[0];
       if (!part || !RE_GREEK.test(part[0]) || part.length === 1) {
-        return [part || s];
+        return [part ?? s];
       }
     }
-    for (const part of parts) {
-      if (!part) {
+    for (const greekPart of parts) {
+      if (!greekPart) {
         continue;
       }
-      if (!RE_GREEK.test(part[0]) || part.length === 1) {
-        result2.push(part);
+      if (!RE_GREEK.test(greekPart[0]) || greekPart.length === 1) {
+        result2.push(greekPart);
         continue;
       }
-      const partLength = part.length;
-      let word = part[0];
-      let previousIsUpper2 = part[0] === part[0].toLocaleUpperCase(locale);
+      const partLength = greekPart.length;
+      let word = greekPart[0];
+      let previousIsUpper2 = greekPart[0] === greekPart[0].toLocaleUpperCase(locale);
       for (let index = 1; index < partLength; index++) {
-        const char = part[index];
+        const char = greekPart[index];
         const isUpperCaseChar = char === char.toLocaleUpperCase(locale);
         if (!previousIsUpper2 && isUpperCaseChar) {
           result2.push(word);
@@ -367,9 +381,10 @@ const splitCamelCaseLocale = (s, locale, knownAcronyms) => {
         // latin -> japanese
       );
       const result2 = [];
-      for (const segment of baseSegments) {
+      for (const baseSegment of baseSegments) {
+        const segment = baseSegment;
         if (segment.length === 1 && particles.has(segment) && result2.length > 0) {
-          result2[result2.length - 1] += segment;
+          result2[result2.length - 1] = result2.at(-1) + segment;
         } else {
           result2.push(segment);
         }
@@ -394,7 +409,7 @@ const splitCamelCaseLocale = (s, locale, knownAcronyms) => {
     for (let index = 1; index < width_2; index++) {
       const char = chars2[index];
       const isUpperCaseChar = char === char.toLocaleUpperCase(locale);
-      const isSpecialChar = /[ČŠŽĐ]/i.test(char);
+      const isSpecialChar = RE_SLOVENIAN_SPECIAL.test(char);
       const nextIsUpper = index < width_2 - 1 && chars2[index + 1] === chars2[index + 1].toLocaleUpperCase(locale);
       if (!previousIsUpper2 && isUpperCaseChar || isSpecialChar && nextIsUpper) {
         result2.push(currentSegment2);
@@ -566,7 +581,7 @@ const splitCamelCaseLocale = (s, locale, knownAcronyms) => {
         result.push(currentSegment, acronym);
         acronymLength = acronym.length;
         currentSegment = "";
-        const lastAcronymChar = acronym[acronym.length - 1];
+        const lastAcronymChar = acronym.at(-1);
         if (lastAcronymChar) {
           previousIsUpper = lastAcronymChar === lastAcronymChar.toLocaleUpperCase(locale);
         }
@@ -593,20 +608,21 @@ const splitCamelCaseLocale = (s, locale, knownAcronyms) => {
 const processTextWithAnsiEmoji = (text, locale, knownAcronyms) => {
   const result = [];
   const segments = RE_FAST_ANSI.test(text) ? text.split(RE_FAST_ANSI).filter(Boolean) : [text];
-  for (const seg of segments) {
+  for (const segment of segments) {
+    const seg = segment;
     if (RE_FAST_ANSI.test(seg)) {
       result.push(seg);
     } else {
       const subs = RE_EMOJI.test(seg) ? splitByEmoji(seg).filter(Boolean) : [seg];
-      for (const sub of subs) {
-        if (RE_EMOJI.test(sub)) {
-          result.push(sub);
+      for (const emojiSub of subs) {
+        if (RE_EMOJI.test(emojiSub)) {
+          result.push(emojiSub);
         } else {
           if (locale) {
             const normalizedLocale = locale.toLowerCase().split("-")[0];
-            result.push(...splitCamelCaseLocale(sub, normalizedLocale, knownAcronyms));
+            result.push(...splitCamelCaseLocale(emojiSub, normalizedLocale, knownAcronyms));
           } else {
-            result.push(...splitCamelCaseFast(sub, knownAcronyms));
+            result.push(...splitCamelCaseFast(emojiSub, knownAcronyms));
           }
         }
       }
@@ -718,13 +734,13 @@ const splitByCase = (input, options = {}) => {
     parts.push(...standardParts);
   }
   let tokens = [];
-  for (const part of parts) {
+  for (const splitPart of parts) {
     if (handleAnsi || handleEmoji) {
-      tokens.push(...processTextWithAnsiEmoji(part, locale, acronymSet));
+      tokens.push(...processTextWithAnsiEmoji(splitPart, locale, acronymSet));
     } else if (locale) {
-      tokens.push(...splitCamelCaseLocale(part, locale, acronymSet));
+      tokens.push(...splitCamelCaseLocale(splitPart, locale, acronymSet));
     } else {
-      tokens.push(...splitCamelCaseFast(part, acronymSet));
+      tokens.push(...splitCamelCaseFast(splitPart, acronymSet));
     }
   }
   if (normalize) {

package/dist/case/title-case.js

@@ -2,7 +2,7 @@ import LRUCache from '../packem_shared/LRUCache-3r3SovvR.js';
 import { splitByCase } from './split-by-case.js';
 import upperFirst from './upper-first.js';
 import { g as generateCacheKey } from '../packem_shared/generate-cache-key-DdayDfjV.js';
-import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-DEB8-ZPT.js';
+import { n as normalizeGermanEszett } from '../packem_shared/normalize-german-eszett-4p3yKEzn.js';
 
 const defaultCacheStore = new LRUCache(1e3);
 function titleCase(value, options) {
@@ -28,10 +28,8 @@ function titleCase(value, options) {
     stripAnsi: options?.stripAnsi,
     stripEmoji: options?.stripEmoji
   }).map((word) => {
-    if (options?.locale?.startsWith("de")) {
-      word = normalizeGermanEszett(word);
-    }
-    return upperFirst(options?.locale ? word.toLocaleLowerCase(options.locale) : word.toLowerCase(), { locale: options?.locale });
+    const normalized = options?.locale?.startsWith("de") ? normalizeGermanEszett(word) : word;
+    return upperFirst(options?.locale ? normalized.toLocaleLowerCase(options.locale) : normalized.toLowerCase(), { locale: options?.locale });
   }).join(" ");
   if (shouldCache && cacheKey) {
     cacheStore.set(cacheKey, result);

package/dist/case/train-case.js

@@ -2,7 +2,7 @@ import LRUCache from '../packem_shared/LRUCache-3r3SovvR.js';
 import { splitByCase } from './split-by-case.js';
 import upperFirst from './upper-first.js';
 import { g as generateCacheKey } from '../packem_shared/generate-cache-key-DdayDfjV.js';
-import joinSegments from '../packem_shared/joinSegments-BStLas0c.js';
+import joinSegments from '../packem_shared/joinSegments-CvxSgKz0.js';
 
 const defaultCacheStore = new LRUCache(1e3);
 const trainCase = (value, options) => {

package/dist/closest-string.js

@@ -5,13 +5,12 @@ const closestString = (givenWord, possibleWords, options) => {
     throw new TypeError("When using closestString(), the possibleWords array must contain at least one word");
   }
   const { caseSensitive, compareFn: compareFunction = distance } = { ...options };
-  if (!caseSensitive) {
-    givenWord = givenWord.toLowerCase();
-  }
+  const normalizedGivenWord = caseSensitive ? givenWord : givenWord.toLowerCase();
   let nearestWord = possibleWords[0] ?? void 0;
   let closestStringDistance = Infinity;
-  for (const each of possibleWords) {
-    const distance = caseSensitive ? compareFunction(givenWord, each) : compareFunction(givenWord, each.toLowerCase());
+  for (const possibleWord of possibleWords) {
+    const each = possibleWord;
+    const distance = caseSensitive ? compareFunction(normalizedGivenWord, each) : compareFunction(normalizedGivenWord, each.toLowerCase());
     if (distance < closestStringDistance) {
       nearestWord = each;
       closestStringDistance = distance;

package/dist/compare-similarity.js

@@ -5,8 +5,8 @@ const compareSimilarity = (givenWord, options) => {
   if (options?.caseSensitive) {
     return (a, b) => compareFunction(givenWord, a) - compareFunction(givenWord, b);
   }
-  givenWord = givenWord.toLowerCase();
-  return (a, b) => compareFunction(givenWord, a.toLowerCase()) - compareFunction(givenWord, b.toLowerCase());
+  const normalizedGivenWord = givenWord.toLowerCase();
+  return (a, b) => compareFunction(normalizedGivenWord, a.toLowerCase()) - compareFunction(normalizedGivenWord, b.toLowerCase());
 };
 
 export { compareSimilarity };