@ditojs/utils 2.64.0 → 2.66.0

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ditojs/utils",
-  "version": "2.64.0",
+  "version": "2.66.0",
   "type": "module",
   "description": "Dito.js Utility Functions – Dito.js is a declarative and modern web framework, based on Objection.js, Koa.js and Vue.js",
   "repository": "https://github.com/ditojs/dito/tree/master/packages/utils",
@@ -39,5 +39,5 @@
   "devDependencies": {
     "typescript": "^5.9.3"
   },
-  "gitHead": "2981f6cd6e7d28291835eacab14d2c91938d9f82"
+  "gitHead": "f4c1f6cf632c396e160a701d90fbcafe0cdf8478"
 }

package/src/string/getCommonPrefix.js

@@ -1,14 +1,35 @@
-export function getCommonPrefix(str1, str2) {
-  return str1.slice(0, getCommonOffset(str1, str2))
+/**
+ * Computes the index of the end of the longest common prefix from an array of
+ * strings.
+ * @param {string[]} strings
+ * @returns {number}
+ */
+export function getCommonOffset(...strings) {
+  if (strings.length === 0) return 0
+  let offset = 0
+  const string1 = strings[0]
+  const length1 = string1.length
+  for (let i = 0; i < length1; i++) {
+    const char = string1.charCodeAt(i)
+    for (let j = 1; j < strings.length; j++) {
+      const string2 = strings[j]
+      if (i >= string2.length || char !== string2.charCodeAt(i)) {
+        return offset
+      }
+    }
+    offset++
+  }
+  return offset
 }
 
-export function getCommonOffset(str1, str2) {
-  const length1 = str1.length
-  const length2 = str2.length
-  const max = length2 < length1 ? length2 : length1
-  let pos = 0
-  while (pos < max && str2.charCodeAt(pos) === str1.charCodeAt(pos)) {
-    pos++
-  }
-  return pos
+/**
+ * Computes the longest common prefix from an array of strings.
+ *
+ * @param {string[]} strings
+ * @returns {string}
+ */
+export function getCommonPrefix(...strings) {
+  return strings.length === 0
+    ? ''
+    : strings[0].slice(0, getCommonOffset(...strings))
 }

package/src/string/getCommonPrefix.test.js

@@ -1,4 +1,4 @@
-import { getCommonPrefix } from './getCommonPrefix.js'
+import { getCommonPrefix, getCommonOffset } from './getCommonPrefix.js'
 
 describe('getCommonPrefix()', () => {
   it('should return the longest common prefix', () => {
@@ -10,3 +10,14 @@ describe('getCommonPrefix()', () => {
     expect(getCommonPrefix('InterState', 'Intersection')).toBe('Inter')
   })
 })
+
+describe('getCommonOffset()', () => {
+  it('should return the longest common prefix', () => {
+    expect(getCommonOffset('interstate', 'intersection')).toBe(6)
+    expect(getCommonOffset('intersection', 'interstate')).toBe(6)
+  })
+  it('should compare case-sensitively', () => {
+    expect(getCommonOffset('interstate', 'Intersection')).toBe(0)
+    expect(getCommonOffset('InterState', 'Intersection')).toBe(5)
+  })
+})

package/types/index.d.ts

@@ -293,14 +293,14 @@ export function deindent(
   ...values: Array<string>
 ): string
 /**
- * Returns the longest prefix string that is common to both supplied strings.
+ * Returns the longest prefix string that is common to the supplied strings.
  */
-export function getCommonPrefix(str1: string, str2: string): string
+export function getCommonPrefix(...strings: Array<string>): string
 /**
- * Returns the offset of the longest prefix string that is common to both
+ * Returns the offset of the longest prefix string that is common to the
  * supplied strings.
  */
-export function getCommonOffset(str1: string, str2: string): number
+export function getCommonOffset(...strings: Array<string>): number
 /**
  * Determines whether the supplied string is an absolute url.
  *