@rebasepro/utils 0.7.0 → 0.9.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/dist/index.es.js +1 -2
- package/dist/index.es.js.map +1 -1
- package/dist/index.umd.js +1 -2
- package/dist/index.umd.js.map +1 -1
- package/dist/objects.d.ts +1 -1
- package/package.json +12 -12
- package/src/fields.ts +0 -1
- package/src/objects.ts +1 -1
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2026 Rebase
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
package/dist/index.es.js
CHANGED
|
@@ -97,7 +97,7 @@ function clone(value) {
|
|
|
97
97
|
/**
|
|
98
98
|
* Deep clone a value, preserving function references and class instances.
|
|
99
99
|
* Unlike structuredClone, this handles objects that contain functions
|
|
100
|
-
* (e.g.
|
|
100
|
+
* (e.g. CollectionConfig with target(), childCollections(), callbacks).
|
|
101
101
|
*/
|
|
102
102
|
function deepClone(value) {
|
|
103
103
|
if (value === null || value === void 0) return value;
|
|
@@ -547,7 +547,6 @@ function isDefaultFieldConfigId(id) {
|
|
|
547
547
|
"multi_number_select",
|
|
548
548
|
"file_upload",
|
|
549
549
|
"multi_file_upload",
|
|
550
|
-
"reference_as_string",
|
|
551
550
|
"reference",
|
|
552
551
|
"multi_references",
|
|
553
552
|
"relation",
|
package/dist/index.es.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.es.js","names":[],"sources":["../src/strings.ts","../src/objects.ts","../src/arrays.ts","../src/dates.ts","../src/hash.ts","../src/regexp.ts","../src/flatten_object.ts","../src/plurals.ts","../src/names.ts","../src/fields.ts"],"sourcesContent":["const tokenizeRegex = /[A-Z]{2,}(?=[A-Z][a-z]|\\b)|[A-Z]?[a-z]+|[0-9]+(?:[a-z](?![a-z]))?|[A-Z]/g;\n\nexport const toKebabCase = (str?: string) => {\n if (!str || typeof str !== \"string\") return \"\";\n const regExpMatchArray = str.match(tokenizeRegex);\n if (!regExpMatchArray) return \"\";\n return regExpMatchArray\n .map(x => x.toLowerCase())\n .join(\"-\");\n};\n\nconst snakeCaseRegex = tokenizeRegex;\n\nexport const toSnakeCase = (str?: string) => {\n if (!str || typeof str !== \"string\") return \"\";\n const regExpMatchArray = str.match(snakeCaseRegex);\n if (!regExpMatchArray) return \"\";\n return regExpMatchArray\n .map(x => x.toLowerCase())\n .join(\"_\");\n};\n\nexport function camelCase(str: string): string {\n if (!str) return \"\";\n if (str.length === 1) return str.toLowerCase();\n\n // Split by hyphens, underscores, or spaces and filter out empty strings\n const parts = str.split(/[-_ ]+/).filter(Boolean);\n\n if (parts.length === 0) return \"\";\n\n // Start with first part in lowercase\n return parts[0].toLowerCase() +\n // Transform remaining parts to have first letter uppercase\n parts.slice(1)\n .map(part => part.charAt(0).toUpperCase() + part.substring(1).toLowerCase())\n .join(\"\");\n}\n\nexport function randomString(strLength = 5) {\n return Math.random().toString(36).slice(2, 2 + strLength);\n}\n\nexport function randomColor() {\n return Math.floor(Math.random() * 16777215).toString(16);\n}\n\nexport function slugify(text?: string, separator = \"_\", lowercase = true) {\n if (!text) return \"\";\n const from = \"ãàáäâẽèéëêìíïîõòóöôùúüûñç·/_,:;-\"\n const to = `aaaaaeeeeeiiiiooooouuuunc${separator}${separator}${separator}${separator}${separator}${separator}${separator}`;\n\n for (let i = 0, l = from.length; i < l; i++) {\n text = text.replace(new RegExp(from.charAt(i), \"g\"), to.charAt(i));\n }\n\n text = text\n .toString() // Cast to string\n .trim() // Remove whitespace from both sides of a string\n .replace(/^\\s+|\\s+$/g, \"\")\n .replace(/\\s+/g, separator) // Replace spaces with separator\n .replace(/&/g, separator) // Replace & with separator\n .replace(/[^\\w\\\\-]+/g, \"\") // Remove all non-word chars\n .replace(new RegExp(\"\\\\\" + separator + \"\\\\\" + separator + \"+\", \"g\"),\n separator); // Replace multiple separators with single one\n\n return lowercase\n ? text.toLowerCase() // Convert the string to lowercase letters\n : text;\n}\n\nexport function unslugify(slug?: string): string {\n if (!slug) return \"\";\n if (slug.includes(\"-\") || slug.includes(\"_\") || !slug.includes(\" \")) {\n const result = slug.replace(/[-_]/g, \" \");\n return result.replace(/\\w\\S*/g, function (txt) {\n return txt.charAt(0).toUpperCase() + txt.substring(1);\n }).trim();\n } else {\n return slug.trim();\n }\n}\n\nexport function prettifyIdentifier(input: string) {\n if (!input) return \"\";\n\n let text = input;\n\n // 1. Handle camelCase and Acronyms\n // Group 1 ($1 $2): Lowercase followed by Uppercase (e.g., imageURL -> image URL)\n // Group 2 ($3 $4): Uppercase followed by Uppercase+lowercase (e.g., XMLParser -> XML Parser)\n text = text.replace(/([a-z])([A-Z])|([A-Z])([A-Z][a-z])/g, \"$1$3 $2$4\");\n\n // 2. Replace hyphens/underscores with spaces\n text = text.replace(/[_-]+/g, \" \");\n\n // 3. Capitalize first letter of each word (Title Case)\n const s = text\n .trim()\n .replace(/\\b\\w/g, (char) => char.toUpperCase());\n return s;\n}\n","import hash from \"object-hash\";\nimport { GeoPoint } from \"@rebasepro/types\";\n\n/** @private is the value an empty array? */\nexport const isEmptyArray = (value?: unknown) =>\n Array.isArray(value) && value.length === 0;\n\n/** @private is the given object a Function? */\nexport const isFunction = (obj: unknown): obj is (...args: unknown[]) => unknown =>\n typeof obj === \"function\";\n\n/** @private is the given object an integer? */\nexport const isInteger = (obj: unknown): boolean =>\n String(Math.floor(Number(obj))) === String(obj);\n\n/** @private is the given object a NaN? */\n\nexport const isNaN = (obj: unknown): boolean => obj !== obj;\n\n/**\n * Deeply get a value from an object via its path.\n */\nexport function getIn(\n obj: Record<string, unknown> | unknown[] | unknown,\n key: string | string[],\n def?: unknown,\n p = 0\n) {\n const path = toPath(key);\n while (obj && p < path.length) {\n obj = (obj as Record<string, unknown>)[path[p++]];\n }\n\n // check if path is not in the end\n if (p !== path.length && !obj) {\n return def;\n }\n\n return obj === undefined ? def : obj;\n}\n\nexport function setIn<T>(obj: T, path: string, value: unknown): T {\n const res = clone(obj) as Record<string, unknown>;\n let resVal: Record<string, unknown> = res;\n let i = 0;\n const pathArray = toPath(path);\n\n for (; i < pathArray.length - 1; i++) {\n const currentPath: string = pathArray[i];\n const currentObj = getIn(obj as Record<string, unknown>, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = clone(currentObj) as Record<string, unknown>;\n } else {\n const nextPath: string = pathArray[i + 1];\n resVal = resVal[currentPath] =\n (isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {}) as Record<string, unknown>;\n }\n }\n\n // Return original object if new value is the same as current\n if ((i === 0 ? obj as Record<string, unknown> : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n }\n\n // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res as T;\n}\n\nexport function clone<T>(value: T): T {\n if (Array.isArray(value)) {\n return [...value] as T;\n } else if (typeof value === \"object\" && value !== null) {\n return { ...value } as T;\n } else {\n return value; // This is for primitive types which do not need cloning.\n }\n}\n\n/**\n * Deep clone a value, preserving function references and class instances.\n * Unlike structuredClone, this handles objects that contain functions\n * (e.g. EntityCollection with target(), childCollections(), callbacks).\n */\nexport function deepClone<T>(value: T): T {\n if (value === null || value === undefined) return value;\n if (typeof value === \"function\") return value;\n if (typeof value !== \"object\") return value;\n\n if (Array.isArray(value)) {\n return value.map(item => deepClone(item)) as T;\n }\n\n // Preserve class instances (Date, GeoPoint, etc.) — don't recurse\n if (Object.getPrototypeOf(value) !== Object.prototype) {\n return value;\n }\n\n const result: Record<string, unknown> = {};\n for (const key of Object.keys(value)) {\n result[key] = deepClone((value as Record<string, unknown>)[key]);\n }\n return result as T;\n}\n\nfunction toPath(value: string | string[]) {\n if (Array.isArray(value)) return value; // Already in path array form.\n // Replace brackets with dots, remove leading/trailing dots, then split by dot.\n return value.replace(/\\[(\\d+)]/g, \".$1\").replace(/^\\./, \"\").replace(/\\.$/, \"\").split(\".\");\n}\n\n\nexport const pick: <T extends Record<string, unknown>>(obj: T, ...args: (keyof T)[]) => Partial<T> = <T extends Record<string, unknown>>(obj: T, ...args: (keyof T)[]) => ({\n ...args.reduce<Record<string, unknown>>((res, key) => ({\n ...res,\n [key as string]: obj[key as string]\n }), {})\n}) as Partial<T>;\n\nexport function isObject(item: unknown): item is Record<string, unknown> {\n return !!item && typeof item === \"object\" && !Array.isArray(item);\n}\n\nexport function isPlainObject(obj: unknown): obj is Record<string, unknown> {\n // 1. Rule out non-objects, null, and arrays\n if (typeof obj !== \"object\" || obj === null || Array.isArray(obj)) {\n return false;\n }\n\n // 2. Get the object's direct prototype\n const proto = Object.getPrototypeOf(obj);\n\n // 3. A plain object's direct prototype is Object.prototype\n return proto === Object.prototype;\n}\n\nexport function mergeDeep<T extends object, U extends object>(\n target: T,\n source: U,\n ignoreUndefined = false\n): T & U {\n // If target is not a true object (e.g., null, array, primitive), return target itself.\n if (!isObject(target)) {\n return target as T & U;\n }\n\n // Create a shallow copy of the target to avoid modifying the original object.\n const output = { ...target };\n\n // If source is not a true object, there's nothing to merge from it.\n // Return the shallow copy of target.\n if (!isObject(source)) {\n return output as T & U;\n }\n\n // Iterate over keys in the source object.\n for (const key in source) {\n if (key === \"__proto__\" || key === \"constructor\" || key === \"prototype\") {\n continue;\n }\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n const sourceValue = source[key];\n const outputValue = (output as Record<string, unknown>)[key]; // Current value in our merged object (originating from target)\n\n // Skip if source value is undefined and ignoreUndefined is true.\n // This handles both not adding new undefined properties and not overwriting existing properties with undefined.\n if (ignoreUndefined && sourceValue === undefined) {\n continue;\n }\n\n if (sourceValue instanceof Date) {\n // If source value is a Date, create a new Date instance.\n (output as Record<string, unknown>)[key] = new Date(sourceValue.getTime());\n } else if (Array.isArray(sourceValue)) {\n if (Array.isArray(outputValue)) {\n // If the array contains primitives or class instances (non-plain objects),\n // overwrite the array entirely instead of doing element-wise merging.\n const hasPlainObjects = sourceValue.some(isPlainObject) || outputValue.some(isPlainObject);\n if (!hasPlainObjects) {\n (output as Record<string, unknown>)[key] = [...sourceValue];\n } else {\n const newArray = [];\n const maxLength = Math.max(outputValue.length, sourceValue.length);\n for (let i = 0; i < maxLength; i++) {\n const sourceItem = sourceValue[i];\n const targetItem = outputValue[i];\n\n if (i >= sourceValue.length) { // source is shorter\n newArray[i] = targetItem;\n } else if (i >= outputValue.length) { // target is shorter\n newArray[i] = sourceItem;\n } else if (sourceItem === null) {\n newArray[i] = targetItem;\n } else if (isPlainObject(sourceItem) && isPlainObject(targetItem)) {\n // Only recursively merge plain objects, preserve class instances\n newArray[i] = mergeDeep(targetItem, sourceItem, ignoreUndefined);\n } else {\n // For class instances and primitives, use source directly\n newArray[i] = sourceItem;\n }\n }\n (output as Record<string, unknown>)[key] = newArray;\n }\n } else {\n // If output's value (from target) is not an array,\n // overwrite with a shallow copy of the source array.\n (output as Record<string, unknown>)[key] = [...sourceValue];\n }\n } else if (isPlainObject(sourceValue)) {\n // If source value is a plain object (not a class instance like EntityReference, GeoPoint, etc.):\n if (isPlainObject(outputValue)) {\n // If the corresponding value in output (from target) is also a plain object, recurse.\n // Ensure the ignoreUndefined flag is passed down.\n (output as Record<string, unknown>)[key] = mergeDeep(outputValue as Record<string, unknown>, sourceValue, ignoreUndefined);\n } else {\n // If output's value (from target) is not a plain object (e.g., null, primitive, class instance, or key didn't exist in original target),\n // overwrite with the source object.\n (output as Record<string, unknown>)[key] = sourceValue;\n }\n } else if (isObject(sourceValue)) {\n // If source value is a class instance (not a plain object), use it directly to preserve prototype\n (output as Record<string, unknown>)[key] = sourceValue;\n } else {\n // If source value is a primitive, null, or undefined (and not ignored).\n (output as Record<string, unknown>)[key] = sourceValue;\n }\n }\n }\n\n return output as T & U;\n}\n\nexport function getValueInPath(o: object | undefined, path: string): unknown {\n if (!o) return undefined;\n if (typeof o === \"object\") {\n if (path in o) {\n return (o as Record<string, unknown>)[path];\n }\n if (path.includes(\".\") || path.includes(\"[\")) {\n let pathSegments = path.split(/[.[]/);\n if (path.includes(\"[\")) {\n pathSegments = pathSegments.map(segment => segment.replace(\"]\", \"\"));\n }\n const firstSegment = pathSegments[0];\n const isArrayAndIndexExists = Array.isArray((o as Record<string, unknown>)[firstSegment]) && !isNaN(parseInt(pathSegments[1]));\n const nextObject = isArrayAndIndexExists\n ? ((o as Record<string, unknown>)[firstSegment] as unknown[])[parseInt(pathSegments[1])]\n : (o as Record<string, unknown>)[firstSegment];\n\n const nextPath = pathSegments.slice(isArrayAndIndexExists ? 2 : 1).join(\".\");\n if (nextPath === \"\")\n return nextObject;\n return getValueInPath(nextObject as object | undefined, nextPath);\n }\n }\n return undefined;\n}\n\nexport function removeInPath(o: object, path: string): object | undefined {\n const res = clone(o) as Record<string, unknown>;\n let current = res;\n const parts = path.split(\".\");\n const last = parts.pop();\n for (const part of parts) {\n if (part in current && current[part] !== null && typeof current[part] === \"object\") {\n current[part] = clone(current[part]) as Record<string, unknown>;\n current = current[part] as Record<string, unknown>;\n } else {\n return res;\n }\n }\n if (last && current && typeof current === \"object\") {\n delete current[last];\n }\n return res;\n}\n\nexport function removeFunctions(o: unknown): unknown {\n if (o === undefined) return undefined;\n if (o === null) return null;\n if (typeof o === \"object\") {\n // Handle arrays first - map over them recursively\n if (Array.isArray(o)) {\n return o.map(v => removeFunctions(v));\n }\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(o)) {\n return o;\n }\n return Object.entries(o)\n .filter(([_, value]) => typeof value !== \"function\")\n .map(([key, value]) => {\n if (Array.isArray(value)) {\n return { [key]: value.map(v => removeFunctions(v)) };\n } else if (typeof value === \"object\") {\n return { [key]: removeFunctions(value) };\n } else return { [key]: value };\n })\n .reduce((a, b) => ({ ...a,\n...b }), {});\n }\n return o;\n}\n\nexport function getHashValue<T>(v: T): string | null {\n if (!v) return null;\n if (typeof v === \"object\" && v !== null) {\n if (\"id\" in v)\n return String((v as Record<string, unknown>).id);\n else if (v instanceof Date)\n return v.toLocaleString();\n else if (v instanceof GeoPoint)\n return hash(v as Record<string, unknown>);\n }\n return hash(v as object, { ignoreUnknown: true });\n}\n\nexport function removeUndefined(value: unknown, removeEmptyStrings?: boolean): unknown {\n if (typeof value === \"function\") {\n return value;\n }\n if (Array.isArray(value)) {\n return value.map((v: unknown) => removeUndefined(v, removeEmptyStrings));\n }\n if (typeof value === \"object\") {\n if (value === null)\n return value;\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(value)) {\n return value;\n }\n const res: Record<string, unknown> = {};\n Object.keys(value).forEach((key) => {\n if (!isEmptyObject(value as object)) {\n const childRes = removeUndefined((value as Record<string, unknown>)[key], removeEmptyStrings);\n const isString = typeof childRes === \"string\";\n const shouldKeepIfString = !removeEmptyStrings || (removeEmptyStrings && !isString) || (removeEmptyStrings && isString && childRes !== \"\");\n if (childRes !== undefined && !isEmptyObject(childRes as object) && shouldKeepIfString)\n res[key] = childRes;\n }\n });\n return res;\n }\n return value;\n}\n\nexport function removeNulls(value: unknown): unknown {\n if (typeof value === \"function\") {\n return value;\n }\n if (Array.isArray(value)) {\n return value.map((v: unknown) => removeNulls(v));\n }\n if (typeof value === \"object\") {\n if (value === null)\n return value;\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(value)) {\n return value;\n }\n const res: Record<string, unknown> = {};\n const obj = value as Record<string, unknown>;\n Object.keys(obj).forEach((key) => {\n if (obj[key] !== null)\n res[key] = removeNulls(obj[key]);\n });\n return res;\n }\n return value;\n}\n\nexport function isEmptyObject(obj: object) {\n return obj &&\n Object.getPrototypeOf(obj) === Object.prototype &&\n Object.keys(obj).length === 0\n}\n\nexport function removePropsIfExisting(source: Record<string, unknown> | unknown[], comparison: Record<string, unknown> | unknown[]) {\n const isObject = (val: unknown): val is Record<string, unknown> => typeof val === \"object\" && val !== null;\n const isArray = (val: unknown): val is unknown[] => Array.isArray(val);\n\n if (!isObject(source) || !isObject(comparison)) {\n return source;\n }\n\n const res = isArray(source) ? [...source] : { ...source };\n\n if (isArray(res)) {\n for (let i = res.length - 1; i >= 0; i--) {\n if (res[i] === comparison[i]) {\n res.splice(i, 1);\n } else if (isObject(res[i]) && isObject(comparison[i])) {\n res[i] = removePropsIfExisting(res[i] as unknown as Record<string, unknown>, (comparison as unknown as unknown[])[i] as Record<string, unknown>);\n }\n }\n } else {\n Object.keys(comparison).forEach(key => {\n if (key in res) {\n if (isObject(res[key]) && isObject(comparison[key])) {\n res[key] = removePropsIfExisting(res[key], comparison[key]);\n } else if (res[key] === comparison[key]) {\n delete res[key];\n }\n }\n });\n }\n\n return res;\n}\n","export function toArray<T>(input?: T | T[]): T[] {\n return Array.isArray(input) ? input : (input ? [input] : []);\n}\n","export const defaultDateFormat = \"MMMM dd, yyyy, HH:mm:ss\";\n","export function hashString(str: string): number {\n if (!str) return 0;\n let hash = 0;\n let i;\n let chr;\n for (i = 0; i < str.length; i++) {\n chr = str.charCodeAt(i);\n hash = ((hash << 5) - hash) + chr;\n hash |= 0; // Convert to 32bit integer\n }\n return Math.abs(hash);\n}\n","export function serializeRegExp(input: RegExp): string {\n if (!input) return \"\";\n // const fragments = input.toString().match(/\\/(.*?)\\/([a-z]*)?$/i);\n // if (fragments) {\n // if (fragments[2])\n // return input.toString();\n // return fragments[1];\n // }\n return input.toString();\n}\n\n/**\n * Get a RegExp out of a serialized string\n * @param input\n */\nexport function hydrateRegExp(input?: string): RegExp | undefined {\n if (!input) return undefined;\n const fragments = input.match(/\\/(.*?)\\/([a-z]*)?$/i);\n if (fragments) {\n return new RegExp(fragments[1], fragments[2] || \"\");\n } else {\n return new RegExp(input, \"\");\n }\n}\n\nexport function isValidRegExp(input: string): boolean {\n const fullRegexp = input.match(/\\/((?![*+?])(?:[^\\r\\n[/\\\\]|\\\\.|\\[(?:[^\\r\\n\\]\\\\]|\\\\.)*])+)\\/((?:g(?:im?|mi?)?|i(?:gm?|mg?)?|m(?:gi?|ig?)?)?)/);\n if (fullRegexp)\n return true;\n const simpleRegexp = input.match(/((?![*+?])(?:[^\\r\\n[/\\\\]|\\\\.|\\[(?:[^\\r\\n\\]\\\\]|\\\\.)*])+)/);\n return !!simpleRegexp;\n}\n","export function flattenObject(obj: Record<string, unknown>, parentKey = \"\") {\n if (!obj) return obj;\n return Object.keys(obj).reduce((flatObj, key) => {\n const newKey = parentKey ? `${parentKey}.${key}` : key;\n\n if (typeof obj[key] === \"object\" && obj[key] !== null) {\n if (Array.isArray(obj[key])) {\n obj[key].forEach((item: unknown, index: number) => {\n if (typeof item === \"object\" && item !== null) {\n Object.assign(flatObj, flattenObject(item as Record<string, unknown>, `${newKey}[${index}]`));\n } else {\n flatObj[`${newKey}[${index}]`] = item;\n }\n });\n } else {\n Object.assign(flatObj, flattenObject(obj[key] as Record<string, unknown>, newKey));\n }\n } else {\n flatObj[newKey] = obj[key];\n }\n\n return flatObj;\n }, {} as { [key: string]: unknown });\n}\n\n\n// map from nested property key like \"a.b.c\" to the maximum array count found in a list of objects for that array\nexport type ArrayValuesCount = Record<string, number>;\n\nexport function getArrayValuesCount(array: Record<string, unknown>[]): ArrayValuesCount {\n return array.reduce((acc: ArrayValuesCount, obj: Record<string, unknown>) => {\n Object.entries(obj).forEach(([key, value]) => {\n // proceed only if value is an array\n if (Array.isArray(value)) {\n acc[key] = Math.max(acc[key] || 0, value.length);\n }\n\n // handle nested object\n if (typeof value === \"object\" && value !== null) {\n const nested = getArrayValuesCount([value as Record<string, unknown>]);\n Object.entries(nested).forEach(([nestedKey, nestedCount]) => {\n const compoundKey = `${key}.${nestedKey}`;\n acc[compoundKey] = Math.max(acc[compoundKey] || 0, nestedCount);\n });\n }\n });\n return acc;\n }, {});\n}\n","/**\n * Returns the plural of an English word.\n *\n * @param {string} word\n * @param {number} [amount]\n * @returns {string}\n */\nexport function plural(word: string, amount?: number): string {\n if (amount !== undefined && amount === 1) {\n return word\n }\n const plurals: { [key: string]: string } = {\n \"(quiz)$\": \"$1zes\",\n \"^(ox)$\": \"$1en\",\n \"([m|l])ouse$\": \"$1ice\",\n \"(matr|vert|ind)ix|ex$\": \"$1ices\",\n \"(x|ch|ss|sh)$\": \"$1es\",\n \"([^aeiouy]|qu)y$\": \"$1ies\",\n \"(hive)$\": \"$1s\",\n \"(?:([^f])fe|([lr])f)$\": \"$1$2ves\",\n \"(shea|lea|loa|thie)f$\": \"$1ves\",\n sis$: \"ses\",\n \"([ti])um$\": \"$1a\",\n \"(tomat|potat|ech|her|vet)o$\": \"$1oes\",\n \"(bu)s$\": \"$1ses\",\n \"(alias)$\": \"$1es\",\n \"(octop)us$\": \"$1i\",\n \"(ax|test)is$\": \"$1es\",\n \"(us)$\": \"$1es\",\n \"([^s]+)$\": \"$1s\"\n }\n const irregular: { [key: string]: string } = {\n move: \"moves\",\n foot: \"feet\",\n goose: \"geese\",\n sex: \"sexes\",\n child: \"children\",\n man: \"men\",\n tooth: \"teeth\",\n person: \"people\"\n }\n const uncountable: string[] = [\n \"sheep\",\n \"fish\",\n \"deer\",\n \"moose\",\n \"series\",\n \"species\",\n \"money\",\n \"rice\",\n \"information\",\n \"equipment\",\n \"bison\",\n \"cod\",\n \"offspring\",\n \"pike\",\n \"salmon\",\n \"shrimp\",\n \"swine\",\n \"trout\",\n \"aircraft\",\n \"hovercraft\",\n \"spacecraft\",\n \"sugar\",\n \"tuna\",\n \"you\",\n \"wood\"\n ]\n // save some time in the case that singular and plural are the same\n if (uncountable.indexOf(word.toLowerCase()) >= 0) {\n return word;\n }\n // check for irregular forms\n for (const w in irregular) {\n const pattern = new RegExp(`${w}$`, \"i\")\n const replace = irregular[w]\n if (pattern.test(word)) {\n return word.replace(pattern, replace);\n }\n }\n // check for matches using regular expressions\n for (const reg in plurals) {\n const pattern = new RegExp(reg, \"i\")\n if (pattern.test(word)) {\n return word.replace(pattern, plurals[reg])\n }\n }\n return word;\n}\n\n/**\n * Returns the singular of an English word.\n *\n * @param {string} word\n * @param {number} [amount]\n * @returns {string}\n */\nexport function singular(word: string, amount?: number): string {\n if (amount !== undefined && amount !== 1) {\n return word;\n }\n const singulars: { [key: string]: string } = {\n \"(quiz)zes$\": \"$1\",\n \"(matr)ices$\": \"$1ix\",\n \"(vert|ind)ices$\": \"$1ex\",\n \"^(ox)en$\": \"$1\",\n \"(alias)es$\": \"$1\",\n \"(octop|vir)i$\": \"$1us\",\n \"(cris|ax|test)es$\": \"$1is\",\n \"(shoe)s$\": \"$1\",\n \"(o)es$\": \"$1\",\n \"(bus)es$\": \"$1\",\n \"([m|l])ice$\": \"$1ouse\",\n \"(x|ch|ss|sh)es$\": \"$1\",\n \"(m)ovies$\": \"$1ovie\",\n \"(s)eries$\": \"$1eries\",\n \"([^aeiouy]|qu)ies$\": \"$1y\",\n \"([lr])ves$\": \"$1f\",\n \"(tive)s$\": \"$1\",\n \"(hive)s$\": \"$1\",\n \"(li|wi|kni)ves$\": \"$1fe\",\n \"(shea|loa|lea|thie)ves$\": \"$1f\",\n \"(^analy)ses$\": \"$1sis\",\n \"((a)naly|(b)a|(d)iagno|(p)arenthe|(p)rogno|(s)ynop|(t)he)ses$\": \"$1$2sis\",\n \"([ti])a$\": \"$1um\",\n \"(n)ews$\": \"$1ews\",\n \"(h|bl)ouses$\": \"$1ouse\",\n \"(corpse)s$\": \"$1\",\n \"(us)es$\": \"$1\",\n s$: \"\"\n }\n const irregular: { [key: string]: string } = {\n move: \"moves\",\n foot: \"feet\",\n goose: \"geese\",\n sex: \"sexes\",\n child: \"children\",\n man: \"men\",\n tooth: \"teeth\",\n person: \"people\"\n }\n const uncountable: string[] = [\n \"sheep\",\n \"fish\",\n \"deer\",\n \"moose\",\n \"series\",\n \"species\",\n \"money\",\n \"rice\",\n \"information\",\n \"equipment\",\n \"bison\",\n \"cod\",\n \"offspring\",\n \"pike\",\n \"salmon\",\n \"shrimp\",\n \"swine\",\n \"trout\",\n \"aircraft\",\n \"hovercraft\",\n \"spacecraft\",\n \"sugar\",\n \"tuna\",\n \"you\",\n \"wood\"\n ]\n // save some time in the case that singular and plural are the same\n if (uncountable.indexOf(word.toLowerCase()) >= 0) {\n return word;\n }\n // check for irregular forms\n for (const w in irregular) {\n const pattern = new RegExp(`${irregular[w]}$`, \"i\");\n if (pattern.test(word)) {\n return word.replace(pattern, w);\n }\n }\n // check for matches using regular expressions\n for (const reg in singulars) {\n const pattern = new RegExp(reg, \"i\");\n if (pattern.test(word)) {\n return word.replace(pattern, singulars[reg]);\n }\n }\n return word;\n}\n","import { toSnakeCase } from \"./strings\";\n\n/**\n * Generates a foreign key column name from a given string, typically a collection slug or name.\n * It converts the name to snake_case, attempts to singularize it by removing a trailing 's'\n * (a common convention for collection names), and appends '_id'.\n *\n * @param name The base name to convert to a foreign key.\n * @returns A foreign key name in the format 'singular_name_id'.\n *\n * @example\n * // returns \"user_id\"\n * generateForeignKeyName(\"users\")\n *\n * @example\n * // returns \"post_id\"\n * generateForeignKeyName(\"posts\")\n *\n * @example\n * // returns \"product_id\"\n * generateForeignKeyName(\"Product\")\n *\n */\nexport function generateForeignKeyName(name: string): string {\n const snakeCaseName = toSnakeCase(name);\n // A simple heuristic to singularize a plural name, which is a common convention.\n const singularName = snakeCaseName.endsWith(\"s\") ? snakeCaseName.slice(0, -1) : snakeCaseName;\n return `${singularName}_id`;\n}\n\n","\n\nexport function isDefaultFieldConfigId(id: string): boolean {\n return [\"text_field\",\n \"multiline\",\n \"markdown\",\n \"url\",\n \"email\",\n \"switch\",\n \"select\",\n \"multi_select\",\n \"number_input\",\n \"number_select\",\n \"multi_number_select\",\n \"file_upload\",\n \"multi_file_upload\",\n \"reference_as_string\",\n \"reference\",\n \"multi_references\",\n \"relation\",\n \"date_time\",\n \"group\",\n \"key_value\",\n \"repeat\",\n \"custom_array\",\n \"block\"\n ].includes(id);\n}\n"],"mappings":";;;AAAA,IAAM,gBAAgB;AAEtB,IAAa,eAAe,QAAiB;CACzC,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU,OAAO;CAC5C,MAAM,mBAAmB,IAAI,MAAM,aAAa;CAChD,IAAI,CAAC,kBAAkB,OAAO;CAC9B,OAAO,iBACF,KAAI,MAAK,EAAE,YAAY,CAAC,EACxB,KAAK,GAAG;AACjB;AAEA,IAAM,iBAAiB;AAEvB,IAAa,eAAe,QAAiB;CACzC,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU,OAAO;CAC5C,MAAM,mBAAmB,IAAI,MAAM,cAAc;CACjD,IAAI,CAAC,kBAAkB,OAAO;CAC9B,OAAO,iBACF,KAAI,MAAK,EAAE,YAAY,CAAC,EACxB,KAAK,GAAG;AACjB;AAEA,SAAgB,UAAU,KAAqB;CAC3C,IAAI,CAAC,KAAK,OAAO;CACjB,IAAI,IAAI,WAAW,GAAG,OAAO,IAAI,YAAY;CAG7C,MAAM,QAAQ,IAAI,MAAM,QAAQ,EAAE,OAAO,OAAO;CAEhD,IAAI,MAAM,WAAW,GAAG,OAAO;CAG/B,OAAO,MAAM,GAAG,YAAY,IAExB,MAAM,MAAM,CAAC,EACR,KAAI,SAAQ,KAAK,OAAO,CAAC,EAAE,YAAY,IAAI,KAAK,UAAU,CAAC,EAAE,YAAY,CAAC,EAC1E,KAAK,EAAE;AACpB;AAEA,SAAgB,aAAa,YAAY,GAAG;CACxC,OAAO,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,IAAI,SAAS;AAC5D;AAEA,SAAgB,cAAc;CAC1B,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,QAAQ,EAAE,SAAS,EAAE;AAC3D;AAEA,SAAgB,QAAQ,MAAe,YAAY,KAAK,YAAY,MAAM;CACtE,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,OAAO;CACb,MAAM,KAAK,4BAA4B,YAAY,YAAY,YAAY,YAAY,YAAY,YAAY;CAE/G,KAAK,IAAI,IAAI,GAAG,IAAI,IAAa,IAAI,GAAG,KACpC,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,OAAO,CAAC,GAAG,GAAG,GAAG,GAAG,OAAO,CAAC,CAAC;CAGrE,OAAO,KACF,SAAS,EACT,KAAK,EACL,QAAQ,cAAc,EAAE,EACxB,QAAQ,QAAQ,SAAS,EACzB,QAAQ,MAAM,SAAS,EACvB,QAAQ,cAAc,EAAE,EACxB,QAAQ,IAAI,OAAO,OAAO,YAAY,OAAO,YAAY,KAAK,GAAG,GAC9D,SAAS;CAEjB,OAAO,YACD,KAAK,YAAY,IACjB;AACV;AAEA,SAAgB,UAAU,MAAuB;CAC7C,IAAI,CAAC,MAAM,OAAO;CAClB,IAAI,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG,KAAK,CAAC,KAAK,SAAS,GAAG,GAE9D,OADe,KAAK,QAAQ,SAAS,GAC9B,EAAO,QAAQ,UAAU,SAAU,KAAK;EAC3C,OAAO,IAAI,OAAO,CAAC,EAAE,YAAY,IAAI,IAAI,UAAU,CAAC;CACxD,CAAC,EAAE,KAAK;MAER,OAAO,KAAK,KAAK;AAEzB;AAEA,SAAgB,mBAAmB,OAAe;CAC9C,IAAI,CAAC,OAAO,OAAO;CAEnB,IAAI,OAAO;CAKX,OAAO,KAAK,QAAQ,uCAAuC,WAAW;CAGtE,OAAO,KAAK,QAAQ,UAAU,GAAG;CAMjC,OAHU,KACL,KAAK,EACL,QAAQ,UAAU,SAAS,KAAK,YAAY,CAC1C;AACX;;;;ACjGA,IAAa,gBAAgB,UACzB,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW;;AAG7C,IAAa,cAAc,QACvB,OAAO,QAAQ;;AAGnB,IAAa,aAAa,QACtB,OAAO,KAAK,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,OAAO,GAAG;;AAIlD,IAAa,SAAS,QAA0B,QAAQ;;;;AAKxD,SAAgB,MACZ,KACA,KACA,KACA,IAAI,GACN;CACE,MAAM,OAAO,OAAO,GAAG;CACvB,OAAO,OAAO,IAAI,KAAK,QACnB,MAAO,IAAgC,KAAK;CAIhD,IAAI,MAAM,KAAK,UAAU,CAAC,KACtB,OAAO;CAGX,OAAO,QAAQ,KAAA,IAAY,MAAM;AACrC;AAEA,SAAgB,MAAS,KAAQ,MAAc,OAAmB;CAC9D,MAAM,MAAM,MAAM,GAAG;CACrB,IAAI,SAAkC;CACtC,IAAI,IAAI;CACR,MAAM,YAAY,OAAO,IAAI;CAE7B,OAAO,IAAI,UAAU,SAAS,GAAG,KAAK;EAClC,MAAM,cAAsB,UAAU;EACtC,MAAM,aAAa,MAAM,KAAgC,UAAU,MAAM,GAAG,IAAI,CAAC,CAAC;EAElF,IAAI,eAAe,SAAS,UAAU,KAAK,MAAM,QAAQ,UAAU,IAC/D,SAAS,OAAO,eAAe,MAAM,UAAU;OAC5C;GACH,MAAM,WAAmB,UAAU,IAAI;GACvC,SAAS,OAAO,eACX,UAAU,QAAQ,KAAK,OAAO,QAAQ,KAAK,IAAI,CAAC,IAAI,CAAC;EAC9D;CACJ;CAGA,KAAK,MAAM,IAAI,MAAiC,QAAQ,UAAU,QAAQ,OACtE,OAAO;CAGX,IAAI,UAAU,KAAA,GACV,OAAO,OAAO,UAAU;MAExB,OAAO,UAAU,MAAM;CAK3B,IAAI,MAAM,KAAK,UAAU,KAAA,GACrB,OAAO,IAAI,UAAU;CAGzB,OAAO;AACX;AAEA,SAAgB,MAAS,OAAa;CAClC,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,CAAC,GAAG,KAAK;MACb,IAAI,OAAO,UAAU,YAAY,UAAU,MAC9C,OAAO,EAAE,GAAG,MAAM;MAElB,OAAO;AAEf;;;;;;AAOA,SAAgB,UAAa,OAAa;CACtC,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;CAClD,IAAI,OAAO,UAAU,YAAY,OAAO;CACxC,IAAI,OAAO,UAAU,UAAU,OAAO;CAEtC,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAI,SAAQ,UAAU,IAAI,CAAC;CAI5C,IAAI,OAAO,eAAe,KAAK,MAAM,OAAO,WACxC,OAAO;CAGX,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,OAAO,OAAO,KAAK,KAAK,GAC/B,OAAO,OAAO,UAAW,MAAkC,IAAI;CAEnE,OAAO;AACX;AAEA,SAAS,OAAO,OAA0B;CACtC,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO;CAEjC,OAAO,MAAM,QAAQ,aAAa,KAAK,EAAE,QAAQ,OAAO,EAAE,EAAE,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;AAC5F;AAGA,IAAa,QAA4H,KAAQ,GAAG,UAAuB,EACvK,GAAG,KAAK,QAAiC,KAAK,SAAS;CACnD,GAAG;EACF,MAAgB,IAAI;AACzB,IAAI,CAAC,CAAC,EACV;AAEA,SAAgB,SAAS,MAAgD;CACrE,OAAO,CAAC,CAAC,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI;AACpE;AAEA,SAAgB,cAAc,KAA8C;CAExE,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAC5D,OAAO;CAOX,OAHc,OAAO,eAAe,GAG7B,MAAU,OAAO;AAC5B;AAEA,SAAgB,UACZ,QACA,QACA,kBAAkB,OACb;CAEL,IAAI,CAAC,SAAS,MAAM,GAChB,OAAO;CAIX,MAAM,SAAS,EAAE,GAAG,OAAO;CAI3B,IAAI,CAAC,SAAS,MAAM,GAChB,OAAO;CAIX,KAAK,MAAM,OAAO,QAAQ;EACtB,IAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,aACxD;EAEJ,IAAI,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;GACnD,MAAM,cAAc,OAAO;GAC3B,MAAM,cAAe,OAAmC;GAIxD,IAAI,mBAAmB,gBAAgB,KAAA,GACnC;GAGJ,IAAI,uBAAuB,MAEvB,OAAoC,OAAO,IAAI,KAAK,YAAY,QAAQ,CAAC;QACtE,IAAI,MAAM,QAAQ,WAAW,GAChC,IAAI,MAAM,QAAQ,WAAW,GAIzB,IAAI,EADoB,YAAY,KAAK,aAAa,KAAK,YAAY,KAAK,aAAa,IAErF,OAAoC,OAAO,CAAC,GAAG,WAAW;QACvD;IACH,MAAM,WAAW,CAAC;IAClB,MAAM,YAAY,KAAK,IAAI,YAAY,QAAQ,YAAY,MAAM;IACjE,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;KAChC,MAAM,aAAa,YAAY;KAC/B,MAAM,aAAa,YAAY;KAE/B,IAAI,KAAK,YAAY,QACjB,SAAS,KAAK;UACX,IAAI,KAAK,YAAY,QACxB,SAAS,KAAK;UACX,IAAI,eAAe,MACtB,SAAS,KAAK;UACX,IAAI,cAAc,UAAU,KAAK,cAAc,UAAU,GAE5D,SAAS,KAAK,UAAU,YAAY,YAAY,eAAe;UAG/D,SAAS,KAAK;IAEtB;IACA,OAAoC,OAAO;GAC/C;QAIA,OAAoC,OAAO,CAAC,GAAG,WAAW;QAE3D,IAAI,cAAc,WAAW,GAEhC,IAAI,cAAc,WAAW,GAGzB,OAAoC,OAAO,UAAU,aAAwC,aAAa,eAAe;QAIzH,OAAoC,OAAO;QAE5C,IAAI,SAAS,WAAW,GAE3B,OAAoC,OAAO;QAG3C,OAAoC,OAAO;EAEnD;CACJ;CAEA,OAAO;AACX;AAEA,SAAgB,eAAe,GAAuB,MAAuB;CACzE,IAAI,CAAC,GAAG,OAAO,KAAA;CACf,IAAI,OAAO,MAAM,UAAU;EACvB,IAAI,QAAQ,GACR,OAAQ,EAA8B;EAE1C,IAAI,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG,GAAG;GAC1C,IAAI,eAAe,KAAK,MAAM,MAAM;GACpC,IAAI,KAAK,SAAS,GAAG,GACjB,eAAe,aAAa,KAAI,YAAW,QAAQ,QAAQ,KAAK,EAAE,CAAC;GAEvE,MAAM,eAAe,aAAa;GAClC,MAAM,wBAAwB,MAAM,QAAS,EAA8B,aAAa,KAAK,CAAC,MAAM,SAAS,aAAa,EAAE,CAAC;GAC7H,MAAM,aAAa,wBACX,EAA8B,cAA4B,SAAS,aAAa,EAAE,KACnF,EAA8B;GAErC,MAAM,WAAW,aAAa,MAAM,wBAAwB,IAAI,CAAC,EAAE,KAAK,GAAG;GAC3E,IAAI,aAAa,IACb,OAAO;GACX,OAAO,eAAe,YAAkC,QAAQ;EACpE;CACJ;AAEJ;AAEA,SAAgB,aAAa,GAAW,MAAkC;CACtE,MAAM,MAAM,MAAM,CAAC;CACnB,IAAI,UAAU;CACd,MAAM,QAAQ,KAAK,MAAM,GAAG;CAC5B,MAAM,OAAO,MAAM,IAAI;CACvB,KAAK,MAAM,QAAQ,OACf,IAAI,QAAQ,WAAW,QAAQ,UAAU,QAAQ,OAAO,QAAQ,UAAU,UAAU;EAChF,QAAQ,QAAQ,MAAM,QAAQ,KAAK;EACnC,UAAU,QAAQ;CACtB,OACI,OAAO;CAGf,IAAI,QAAQ,WAAW,OAAO,YAAY,UACtC,OAAO,QAAQ;CAEnB,OAAO;AACX;AAEA,SAAgB,gBAAgB,GAAqB;CACjD,IAAI,MAAM,KAAA,GAAW,OAAO,KAAA;CAC5B,IAAI,MAAM,MAAM,OAAO;CACvB,IAAI,OAAO,MAAM,UAAU;EAEvB,IAAI,MAAM,QAAQ,CAAC,GACf,OAAO,EAAE,KAAI,MAAK,gBAAgB,CAAC,CAAC;EAGxC,IAAI,CAAC,cAAc,CAAC,GAChB,OAAO;EAEX,OAAO,OAAO,QAAQ,CAAC,EAClB,QAAQ,CAAC,GAAG,WAAW,OAAO,UAAU,UAAU,EAClD,KAAK,CAAC,KAAK,WAAW;GACnB,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,GAAG,MAAM,MAAM,KAAI,MAAK,gBAAgB,CAAC,CAAC,EAAE;QAChD,IAAI,OAAO,UAAU,UACxB,OAAO,GAAG,MAAM,gBAAgB,KAAK,EAAE;QACpC,OAAO,GAAG,MAAM,MAAM;EACjC,CAAC,EACA,QAAQ,GAAG,OAAO;GAAE,GAAG;GACpC,GAAG;EAAE,IAAI,CAAC,CAAC;CACP;CACA,OAAO;AACX;AAEA,SAAgB,aAAgB,GAAqB;CACjD,IAAI,CAAC,GAAG,OAAO;CACf,IAAI,OAAO,MAAM,YAAY,MAAM;MAC3B,QAAQ,GACR,OAAO,OAAQ,EAA8B,EAAE;OAC9C,IAAI,aAAa,MAClB,OAAO,EAAE,eAAe;OACvB,IAAI,aAAa,UAClB,OAAO,KAAK,CAA4B;CAAA;CAEhD,OAAO,KAAK,GAAa,EAAE,eAAe,KAAK,CAAC;AACpD;AAEA,SAAgB,gBAAgB,OAAgB,oBAAuC;CACnF,IAAI,OAAO,UAAU,YACjB,OAAO;CAEX,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAK,MAAe,gBAAgB,GAAG,kBAAkB,CAAC;CAE3E,IAAI,OAAO,UAAU,UAAU;EAC3B,IAAI,UAAU,MACV,OAAO;EAEX,IAAI,CAAC,cAAc,KAAK,GACpB,OAAO;EAEX,MAAM,MAA+B,CAAC;EACtC,OAAO,KAAK,KAAK,EAAE,SAAS,QAAQ;GAChC,IAAI,CAAC,cAAc,KAAe,GAAG;IACjC,MAAM,WAAW,gBAAiB,MAAkC,MAAM,kBAAkB;IAC5F,MAAM,WAAW,OAAO,aAAa;IACrC,MAAM,qBAAqB,CAAC,sBAAuB,sBAAsB,CAAC,YAAc,sBAAsB,YAAY,aAAa;IACvI,IAAI,aAAa,KAAA,KAAa,CAAC,cAAc,QAAkB,KAAK,oBAChE,IAAI,OAAO;GACnB;EACJ,CAAC;EACD,OAAO;CACX;CACA,OAAO;AACX;AAEA,SAAgB,YAAY,OAAyB;CACjD,IAAI,OAAO,UAAU,YACjB,OAAO;CAEX,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAK,MAAe,YAAY,CAAC,CAAC;CAEnD,IAAI,OAAO,UAAU,UAAU;EAC3B,IAAI,UAAU,MACV,OAAO;EAEX,IAAI,CAAC,cAAc,KAAK,GACpB,OAAO;EAEX,MAAM,MAA+B,CAAC;EACtC,MAAM,MAAM;EACZ,OAAO,KAAK,GAAG,EAAE,SAAS,QAAQ;GAC9B,IAAI,IAAI,SAAS,MACb,IAAI,OAAO,YAAY,IAAI,IAAI;EACvC,CAAC;EACD,OAAO;CACX;CACA,OAAO;AACX;AAEA,SAAgB,cAAc,KAAa;CACvC,OAAO,OACH,OAAO,eAAe,GAAG,MAAM,OAAO,aACtC,OAAO,KAAK,GAAG,EAAE,WAAW;AACpC;AAEA,SAAgB,sBAAsB,QAA6C,YAAiD;CAChI,MAAM,YAAY,QAAiD,OAAO,QAAQ,YAAY,QAAQ;CACtG,MAAM,WAAW,QAAmC,MAAM,QAAQ,GAAG;CAErE,IAAI,CAAC,SAAS,MAAM,KAAK,CAAC,SAAS,UAAU,GACzC,OAAO;CAGX,MAAM,MAAM,QAAQ,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,EAAE,GAAG,OAAO;CAExD,IAAI,QAAQ,GAAG;OACN,IAAI,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KACjC,IAAI,IAAI,OAAO,WAAW,IACtB,IAAI,OAAO,GAAG,CAAC;OACZ,IAAI,SAAS,IAAI,EAAE,KAAK,SAAS,WAAW,EAAE,GACjD,IAAI,KAAK,sBAAsB,IAAI,IAA2C,WAAoC,EAA6B;CAAA,OAIvJ,OAAO,KAAK,UAAU,EAAE,SAAQ,QAAO;EACnC,IAAI,OAAO;OACH,SAAS,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,GAC9C,IAAI,OAAO,sBAAsB,IAAI,MAAM,WAAW,IAAI;QACvD,IAAI,IAAI,SAAS,WAAW,MAC/B,OAAO,IAAI;EAAA;CAGvB,CAAC;CAGL,OAAO;AACX;;;ACnaA,SAAgB,QAAW,OAAsB;CAC7C,OAAO,MAAM,QAAQ,KAAK,IAAI,QAAS,QAAQ,CAAC,KAAK,IAAI,CAAC;AAC9D;;;ACFA,IAAa,oBAAoB;;;ACAjC,SAAgB,WAAW,KAAqB;CAC5C,IAAI,CAAC,KAAK,OAAO;CACjB,IAAI,OAAO;CACX,IAAI;CACJ,IAAI;CACJ,KAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EAC7B,MAAM,IAAI,WAAW,CAAC;EACtB,QAAS,QAAQ,KAAK,OAAQ;EAC9B,QAAQ;CACZ;CACA,OAAO,KAAK,IAAI,IAAI;AACxB;;;ACXA,SAAgB,gBAAgB,OAAuB;CACnD,IAAI,CAAC,OAAO,OAAO;CAOnB,OAAO,MAAM,SAAS;AAC1B;;;;;AAMA,SAAgB,cAAc,OAAoC;CAC9D,IAAI,CAAC,OAAO,OAAO,KAAA;CACnB,MAAM,YAAY,MAAM,MAAM,sBAAsB;CACpD,IAAI,WACA,OAAO,IAAI,OAAO,UAAU,IAAI,UAAU,MAAM,EAAE;MAElD,OAAO,IAAI,OAAO,OAAO,EAAE;AAEnC;AAEA,SAAgB,cAAc,OAAwB;CAElD,IADmB,MAAM,MAAM,6GAC3B,GACA,OAAO;CAEX,OAAO,CAAC,CADa,MAAM,MAAM,yDACxB;AACb;;;AC/BA,SAAgB,cAAc,KAA8B,YAAY,IAAI;CACxE,IAAI,CAAC,KAAK,OAAO;CACjB,OAAO,OAAO,KAAK,GAAG,EAAE,QAAQ,SAAS,QAAQ;EAC7C,MAAM,SAAS,YAAY,GAAG,UAAU,GAAG,QAAQ;EAEnD,IAAI,OAAO,IAAI,SAAS,YAAY,IAAI,SAAS,MAC7C,IAAI,MAAM,QAAQ,IAAI,IAAI,GACtB,IAAI,KAAK,SAAS,MAAe,UAAkB;GAC/C,IAAI,OAAO,SAAS,YAAY,SAAS,MACrC,OAAO,OAAO,SAAS,cAAc,MAAiC,GAAG,OAAO,GAAG,MAAM,EAAE,CAAC;QAE5F,QAAQ,GAAG,OAAO,GAAG,MAAM,MAAM;EAEzC,CAAC;OAED,OAAO,OAAO,SAAS,cAAc,IAAI,MAAiC,MAAM,CAAC;OAGrF,QAAQ,UAAU,IAAI;EAG1B,OAAO;CACX,GAAG,CAAC,CAA+B;AACvC;AAMA,SAAgB,oBAAoB,OAAoD;CACpF,OAAO,MAAM,QAAQ,KAAuB,QAAiC;EACzE,OAAO,QAAQ,GAAG,EAAE,SAAS,CAAC,KAAK,WAAW;GAE1C,IAAI,MAAM,QAAQ,KAAK,GACnB,IAAI,OAAO,KAAK,IAAI,IAAI,QAAQ,GAAG,MAAM,MAAM;GAInD,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM;IAC7C,MAAM,SAAS,oBAAoB,CAAC,KAAgC,CAAC;IACrE,OAAO,QAAQ,MAAM,EAAE,SAAS,CAAC,WAAW,iBAAiB;KACzD,MAAM,cAAc,GAAG,IAAI,GAAG;KAC9B,IAAI,eAAe,KAAK,IAAI,IAAI,gBAAgB,GAAG,WAAW;IAClE,CAAC;GACL;EACJ,CAAC;EACD,OAAO;CACX,GAAG,CAAC,CAAC;AACT;;;;;;;;;;ACzCA,SAAgB,OAAO,MAAc,QAAyB;CAC1D,IAAI,WAAW,KAAA,KAAa,WAAW,GACnC,OAAO;CAEX,MAAM,UAAqC;EACvC,WAAW;EACX,UAAU;EACV,gBAAgB;EAChB,yBAAyB;EACzB,iBAAiB;EACjB,oBAAoB;EACpB,WAAW;EACX,yBAAyB;EACzB,yBAAyB;EACzB,MAAM;EACN,aAAa;EACb,+BAA+B;EAC/B,UAAU;EACV,YAAY;EACZ,cAAc;EACd,gBAAgB;EAChB,SAAS;EACT,YAAY;CAChB;CACA,MAAM,YAAuC;EACzC,MAAM;EACN,MAAM;EACN,OAAO;EACP,KAAK;EACL,OAAO;EACP,KAAK;EACL,OAAO;EACP,QAAQ;CACZ;CA6BA,IAAI;EA3BA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CAGA,EAAY,QAAQ,KAAK,YAAY,CAAC,KAAK,GAC3C,OAAO;CAGX,KAAK,MAAM,KAAK,WAAW;EACvB,MAAM,UAAU,IAAI,OAAO,GAAG,EAAE,IAAI,GAAG;EACvC,MAAM,UAAU,UAAU;EAC1B,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,OAAO;CAE5C;CAEA,KAAK,MAAM,OAAO,SAAS;EACvB,MAAM,UAAU,IAAI,OAAO,KAAK,GAAG;EACnC,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,QAAQ,IAAI;CAEjD;CACA,OAAO;AACX;;;;;;;;AASA,SAAgB,SAAS,MAAc,QAAyB;CAC5D,IAAI,WAAW,KAAA,KAAa,WAAW,GACnC,OAAO;CAEX,MAAM,YAAuC;EACzC,cAAc;EACd,eAAe;EACf,mBAAmB;EACnB,YAAY;EACZ,cAAc;EACd,iBAAiB;EACjB,qBAAqB;EACrB,YAAY;EACZ,UAAU;EACV,YAAY;EACZ,eAAe;EACf,mBAAmB;EACnB,aAAa;EACb,aAAa;EACb,sBAAsB;EACtB,cAAc;EACd,YAAY;EACZ,YAAY;EACZ,mBAAmB;EACnB,2BAA2B;EAC3B,gBAAgB;EAChB,iEAAiE;EACjE,YAAY;EACZ,WAAW;EACX,gBAAgB;EAChB,cAAc;EACd,WAAW;EACX,IAAI;CACR;CACA,MAAM,YAAuC;EACzC,MAAM;EACN,MAAM;EACN,OAAO;EACP,KAAK;EACL,OAAO;EACP,KAAK;EACL,OAAO;EACP,QAAQ;CACZ;CA6BA,IAAI;EA3BA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CAGA,EAAY,QAAQ,KAAK,YAAY,CAAC,KAAK,GAC3C,OAAO;CAGX,KAAK,MAAM,KAAK,WAAW;EACvB,MAAM,UAAU,IAAI,OAAO,GAAG,UAAU,GAAG,IAAI,GAAG;EAClD,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,CAAC;CAEtC;CAEA,KAAK,MAAM,OAAO,WAAW;EACzB,MAAM,UAAU,IAAI,OAAO,KAAK,GAAG;EACnC,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,UAAU,IAAI;CAEnD;CACA,OAAO;AACX;;;;;;;;;;;;;;;;;;;;;;;;ACpKA,SAAgB,uBAAuB,MAAsB;CACzD,MAAM,gBAAgB,YAAY,IAAI;CAGtC,OAAO,GADc,cAAc,SAAS,GAAG,IAAI,cAAc,MAAM,GAAG,EAAE,IAAI,cACzD;AAC3B;;;AC1BA,SAAgB,uBAAuB,IAAqB;CACxD,OAAO;EAAC;EACJ;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACJ,EAAE,SAAS,EAAE;AACjB"}
|
|
1
|
+
{"version":3,"file":"index.es.js","names":[],"sources":["../src/strings.ts","../src/objects.ts","../src/arrays.ts","../src/dates.ts","../src/hash.ts","../src/regexp.ts","../src/flatten_object.ts","../src/plurals.ts","../src/names.ts","../src/fields.ts"],"sourcesContent":["const tokenizeRegex = /[A-Z]{2,}(?=[A-Z][a-z]|\\b)|[A-Z]?[a-z]+|[0-9]+(?:[a-z](?![a-z]))?|[A-Z]/g;\n\nexport const toKebabCase = (str?: string) => {\n if (!str || typeof str !== \"string\") return \"\";\n const regExpMatchArray = str.match(tokenizeRegex);\n if (!regExpMatchArray) return \"\";\n return regExpMatchArray\n .map(x => x.toLowerCase())\n .join(\"-\");\n};\n\nconst snakeCaseRegex = tokenizeRegex;\n\nexport const toSnakeCase = (str?: string) => {\n if (!str || typeof str !== \"string\") return \"\";\n const regExpMatchArray = str.match(snakeCaseRegex);\n if (!regExpMatchArray) return \"\";\n return regExpMatchArray\n .map(x => x.toLowerCase())\n .join(\"_\");\n};\n\nexport function camelCase(str: string): string {\n if (!str) return \"\";\n if (str.length === 1) return str.toLowerCase();\n\n // Split by hyphens, underscores, or spaces and filter out empty strings\n const parts = str.split(/[-_ ]+/).filter(Boolean);\n\n if (parts.length === 0) return \"\";\n\n // Start with first part in lowercase\n return parts[0].toLowerCase() +\n // Transform remaining parts to have first letter uppercase\n parts.slice(1)\n .map(part => part.charAt(0).toUpperCase() + part.substring(1).toLowerCase())\n .join(\"\");\n}\n\nexport function randomString(strLength = 5) {\n return Math.random().toString(36).slice(2, 2 + strLength);\n}\n\nexport function randomColor() {\n return Math.floor(Math.random() * 16777215).toString(16);\n}\n\nexport function slugify(text?: string, separator = \"_\", lowercase = true) {\n if (!text) return \"\";\n const from = \"ãàáäâẽèéëêìíïîõòóöôùúüûñç·/_,:;-\"\n const to = `aaaaaeeeeeiiiiooooouuuunc${separator}${separator}${separator}${separator}${separator}${separator}${separator}`;\n\n for (let i = 0, l = from.length; i < l; i++) {\n text = text.replace(new RegExp(from.charAt(i), \"g\"), to.charAt(i));\n }\n\n text = text\n .toString() // Cast to string\n .trim() // Remove whitespace from both sides of a string\n .replace(/^\\s+|\\s+$/g, \"\")\n .replace(/\\s+/g, separator) // Replace spaces with separator\n .replace(/&/g, separator) // Replace & with separator\n .replace(/[^\\w\\\\-]+/g, \"\") // Remove all non-word chars\n .replace(new RegExp(\"\\\\\" + separator + \"\\\\\" + separator + \"+\", \"g\"),\n separator); // Replace multiple separators with single one\n\n return lowercase\n ? text.toLowerCase() // Convert the string to lowercase letters\n : text;\n}\n\nexport function unslugify(slug?: string): string {\n if (!slug) return \"\";\n if (slug.includes(\"-\") || slug.includes(\"_\") || !slug.includes(\" \")) {\n const result = slug.replace(/[-_]/g, \" \");\n return result.replace(/\\w\\S*/g, function (txt) {\n return txt.charAt(0).toUpperCase() + txt.substring(1);\n }).trim();\n } else {\n return slug.trim();\n }\n}\n\nexport function prettifyIdentifier(input: string) {\n if (!input) return \"\";\n\n let text = input;\n\n // 1. Handle camelCase and Acronyms\n // Group 1 ($1 $2): Lowercase followed by Uppercase (e.g., imageURL -> image URL)\n // Group 2 ($3 $4): Uppercase followed by Uppercase+lowercase (e.g., XMLParser -> XML Parser)\n text = text.replace(/([a-z])([A-Z])|([A-Z])([A-Z][a-z])/g, \"$1$3 $2$4\");\n\n // 2. Replace hyphens/underscores with spaces\n text = text.replace(/[_-]+/g, \" \");\n\n // 3. Capitalize first letter of each word (Title Case)\n const s = text\n .trim()\n .replace(/\\b\\w/g, (char) => char.toUpperCase());\n return s;\n}\n","import hash from \"object-hash\";\nimport { GeoPoint } from \"@rebasepro/types\";\n\n/** @private is the value an empty array? */\nexport const isEmptyArray = (value?: unknown) =>\n Array.isArray(value) && value.length === 0;\n\n/** @private is the given object a Function? */\nexport const isFunction = (obj: unknown): obj is (...args: unknown[]) => unknown =>\n typeof obj === \"function\";\n\n/** @private is the given object an integer? */\nexport const isInteger = (obj: unknown): boolean =>\n String(Math.floor(Number(obj))) === String(obj);\n\n/** @private is the given object a NaN? */\n\nexport const isNaN = (obj: unknown): boolean => obj !== obj;\n\n/**\n * Deeply get a value from an object via its path.\n */\nexport function getIn(\n obj: Record<string, unknown> | unknown[] | unknown,\n key: string | string[],\n def?: unknown,\n p = 0\n) {\n const path = toPath(key);\n while (obj && p < path.length) {\n obj = (obj as Record<string, unknown>)[path[p++]];\n }\n\n // check if path is not in the end\n if (p !== path.length && !obj) {\n return def;\n }\n\n return obj === undefined ? def : obj;\n}\n\nexport function setIn<T>(obj: T, path: string, value: unknown): T {\n const res = clone(obj) as Record<string, unknown>;\n let resVal: Record<string, unknown> = res;\n let i = 0;\n const pathArray = toPath(path);\n\n for (; i < pathArray.length - 1; i++) {\n const currentPath: string = pathArray[i];\n const currentObj = getIn(obj as Record<string, unknown>, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = clone(currentObj) as Record<string, unknown>;\n } else {\n const nextPath: string = pathArray[i + 1];\n resVal = resVal[currentPath] =\n (isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {}) as Record<string, unknown>;\n }\n }\n\n // Return original object if new value is the same as current\n if ((i === 0 ? obj as Record<string, unknown> : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n }\n\n // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res as T;\n}\n\nexport function clone<T>(value: T): T {\n if (Array.isArray(value)) {\n return [...value] as T;\n } else if (typeof value === \"object\" && value !== null) {\n return { ...value } as T;\n } else {\n return value; // This is for primitive types which do not need cloning.\n }\n}\n\n/**\n * Deep clone a value, preserving function references and class instances.\n * Unlike structuredClone, this handles objects that contain functions\n * (e.g. CollectionConfig with target(), childCollections(), callbacks).\n */\nexport function deepClone<T>(value: T): T {\n if (value === null || value === undefined) return value;\n if (typeof value === \"function\") return value;\n if (typeof value !== \"object\") return value;\n\n if (Array.isArray(value)) {\n return value.map(item => deepClone(item)) as T;\n }\n\n // Preserve class instances (Date, GeoPoint, etc.) — don't recurse\n if (Object.getPrototypeOf(value) !== Object.prototype) {\n return value;\n }\n\n const result: Record<string, unknown> = {};\n for (const key of Object.keys(value)) {\n result[key] = deepClone((value as Record<string, unknown>)[key]);\n }\n return result as T;\n}\n\nfunction toPath(value: string | string[]) {\n if (Array.isArray(value)) return value; // Already in path array form.\n // Replace brackets with dots, remove leading/trailing dots, then split by dot.\n return value.replace(/\\[(\\d+)]/g, \".$1\").replace(/^\\./, \"\").replace(/\\.$/, \"\").split(\".\");\n}\n\n\nexport const pick: <T extends Record<string, unknown>>(obj: T, ...args: (keyof T)[]) => Partial<T> = <T extends Record<string, unknown>>(obj: T, ...args: (keyof T)[]) => ({\n ...args.reduce<Record<string, unknown>>((res, key) => ({\n ...res,\n [key as string]: obj[key as string]\n }), {})\n}) as Partial<T>;\n\nexport function isObject(item: unknown): item is Record<string, unknown> {\n return !!item && typeof item === \"object\" && !Array.isArray(item);\n}\n\nexport function isPlainObject(obj: unknown): obj is Record<string, unknown> {\n // 1. Rule out non-objects, null, and arrays\n if (typeof obj !== \"object\" || obj === null || Array.isArray(obj)) {\n return false;\n }\n\n // 2. Get the object's direct prototype\n const proto = Object.getPrototypeOf(obj);\n\n // 3. A plain object's direct prototype is Object.prototype\n return proto === Object.prototype;\n}\n\nexport function mergeDeep<T extends object, U extends object>(\n target: T,\n source: U,\n ignoreUndefined = false\n): T & U {\n // If target is not a true object (e.g., null, array, primitive), return target itself.\n if (!isObject(target)) {\n return target as T & U;\n }\n\n // Create a shallow copy of the target to avoid modifying the original object.\n const output = { ...target };\n\n // If source is not a true object, there's nothing to merge from it.\n // Return the shallow copy of target.\n if (!isObject(source)) {\n return output as T & U;\n }\n\n // Iterate over keys in the source object.\n for (const key in source) {\n if (key === \"__proto__\" || key === \"constructor\" || key === \"prototype\") {\n continue;\n }\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n const sourceValue = source[key];\n const outputValue = (output as Record<string, unknown>)[key]; // Current value in our merged object (originating from target)\n\n // Skip if source value is undefined and ignoreUndefined is true.\n // This handles both not adding new undefined properties and not overwriting existing properties with undefined.\n if (ignoreUndefined && sourceValue === undefined) {\n continue;\n }\n\n if (sourceValue instanceof Date) {\n // If source value is a Date, create a new Date instance.\n (output as Record<string, unknown>)[key] = new Date(sourceValue.getTime());\n } else if (Array.isArray(sourceValue)) {\n if (Array.isArray(outputValue)) {\n // If the array contains primitives or class instances (non-plain objects),\n // overwrite the array entirely instead of doing element-wise merging.\n const hasPlainObjects = sourceValue.some(isPlainObject) || outputValue.some(isPlainObject);\n if (!hasPlainObjects) {\n (output as Record<string, unknown>)[key] = [...sourceValue];\n } else {\n const newArray = [];\n const maxLength = Math.max(outputValue.length, sourceValue.length);\n for (let i = 0; i < maxLength; i++) {\n const sourceItem = sourceValue[i];\n const targetItem = outputValue[i];\n\n if (i >= sourceValue.length) { // source is shorter\n newArray[i] = targetItem;\n } else if (i >= outputValue.length) { // target is shorter\n newArray[i] = sourceItem;\n } else if (sourceItem === null) {\n newArray[i] = targetItem;\n } else if (isPlainObject(sourceItem) && isPlainObject(targetItem)) {\n // Only recursively merge plain objects, preserve class instances\n newArray[i] = mergeDeep(targetItem, sourceItem, ignoreUndefined);\n } else {\n // For class instances and primitives, use source directly\n newArray[i] = sourceItem;\n }\n }\n (output as Record<string, unknown>)[key] = newArray;\n }\n } else {\n // If output's value (from target) is not an array,\n // overwrite with a shallow copy of the source array.\n (output as Record<string, unknown>)[key] = [...sourceValue];\n }\n } else if (isPlainObject(sourceValue)) {\n // If source value is a plain object (not a class instance like EntityReference, GeoPoint, etc.):\n if (isPlainObject(outputValue)) {\n // If the corresponding value in output (from target) is also a plain object, recurse.\n // Ensure the ignoreUndefined flag is passed down.\n (output as Record<string, unknown>)[key] = mergeDeep(outputValue as Record<string, unknown>, sourceValue, ignoreUndefined);\n } else {\n // If output's value (from target) is not a plain object (e.g., null, primitive, class instance, or key didn't exist in original target),\n // overwrite with the source object.\n (output as Record<string, unknown>)[key] = sourceValue;\n }\n } else if (isObject(sourceValue)) {\n // If source value is a class instance (not a plain object), use it directly to preserve prototype\n (output as Record<string, unknown>)[key] = sourceValue;\n } else {\n // If source value is a primitive, null, or undefined (and not ignored).\n (output as Record<string, unknown>)[key] = sourceValue;\n }\n }\n }\n\n return output as T & U;\n}\n\nexport function getValueInPath(o: object | undefined, path: string): unknown {\n if (!o) return undefined;\n if (typeof o === \"object\") {\n if (path in o) {\n return (o as Record<string, unknown>)[path];\n }\n if (path.includes(\".\") || path.includes(\"[\")) {\n let pathSegments = path.split(/[.[]/);\n if (path.includes(\"[\")) {\n pathSegments = pathSegments.map(segment => segment.replace(\"]\", \"\"));\n }\n const firstSegment = pathSegments[0];\n const isArrayAndIndexExists = Array.isArray((o as Record<string, unknown>)[firstSegment]) && !isNaN(parseInt(pathSegments[1]));\n const nextObject = isArrayAndIndexExists\n ? ((o as Record<string, unknown>)[firstSegment] as unknown[])[parseInt(pathSegments[1])]\n : (o as Record<string, unknown>)[firstSegment];\n\n const nextPath = pathSegments.slice(isArrayAndIndexExists ? 2 : 1).join(\".\");\n if (nextPath === \"\")\n return nextObject;\n return getValueInPath(nextObject as object | undefined, nextPath);\n }\n }\n return undefined;\n}\n\nexport function removeInPath(o: object, path: string): object | undefined {\n const res = clone(o) as Record<string, unknown>;\n let current = res;\n const parts = path.split(\".\");\n const last = parts.pop();\n for (const part of parts) {\n if (part in current && current[part] !== null && typeof current[part] === \"object\") {\n current[part] = clone(current[part]) as Record<string, unknown>;\n current = current[part] as Record<string, unknown>;\n } else {\n return res;\n }\n }\n if (last && current && typeof current === \"object\") {\n delete current[last];\n }\n return res;\n}\n\nexport function removeFunctions(o: unknown): unknown {\n if (o === undefined) return undefined;\n if (o === null) return null;\n if (typeof o === \"object\") {\n // Handle arrays first - map over them recursively\n if (Array.isArray(o)) {\n return o.map(v => removeFunctions(v));\n }\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(o)) {\n return o;\n }\n return Object.entries(o)\n .filter(([_, value]) => typeof value !== \"function\")\n .map(([key, value]) => {\n if (Array.isArray(value)) {\n return { [key]: value.map(v => removeFunctions(v)) };\n } else if (typeof value === \"object\") {\n return { [key]: removeFunctions(value) };\n } else return { [key]: value };\n })\n .reduce((a, b) => ({ ...a,\n...b }), {});\n }\n return o;\n}\n\nexport function getHashValue<T>(v: T): string | null {\n if (!v) return null;\n if (typeof v === \"object\" && v !== null) {\n if (\"id\" in v)\n return String((v as Record<string, unknown>).id);\n else if (v instanceof Date)\n return v.toLocaleString();\n else if (v instanceof GeoPoint)\n return hash(v as Record<string, unknown>);\n }\n return hash(v as object, { ignoreUnknown: true });\n}\n\nexport function removeUndefined(value: unknown, removeEmptyStrings?: boolean): unknown {\n if (typeof value === \"function\") {\n return value;\n }\n if (Array.isArray(value)) {\n return value.map((v: unknown) => removeUndefined(v, removeEmptyStrings));\n }\n if (typeof value === \"object\") {\n if (value === null)\n return value;\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(value)) {\n return value;\n }\n const res: Record<string, unknown> = {};\n Object.keys(value).forEach((key) => {\n if (!isEmptyObject(value as object)) {\n const childRes = removeUndefined((value as Record<string, unknown>)[key], removeEmptyStrings);\n const isString = typeof childRes === \"string\";\n const shouldKeepIfString = !removeEmptyStrings || (removeEmptyStrings && !isString) || (removeEmptyStrings && isString && childRes !== \"\");\n if (childRes !== undefined && !isEmptyObject(childRes as object) && shouldKeepIfString)\n res[key] = childRes;\n }\n });\n return res;\n }\n return value;\n}\n\nexport function removeNulls(value: unknown): unknown {\n if (typeof value === \"function\") {\n return value;\n }\n if (Array.isArray(value)) {\n return value.map((v: unknown) => removeNulls(v));\n }\n if (typeof value === \"object\") {\n if (value === null)\n return value;\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(value)) {\n return value;\n }\n const res: Record<string, unknown> = {};\n const obj = value as Record<string, unknown>;\n Object.keys(obj).forEach((key) => {\n if (obj[key] !== null)\n res[key] = removeNulls(obj[key]);\n });\n return res;\n }\n return value;\n}\n\nexport function isEmptyObject(obj: object) {\n return obj &&\n Object.getPrototypeOf(obj) === Object.prototype &&\n Object.keys(obj).length === 0\n}\n\nexport function removePropsIfExisting(source: Record<string, unknown> | unknown[], comparison: Record<string, unknown> | unknown[]) {\n const isObject = (val: unknown): val is Record<string, unknown> => typeof val === \"object\" && val !== null;\n const isArray = (val: unknown): val is unknown[] => Array.isArray(val);\n\n if (!isObject(source) || !isObject(comparison)) {\n return source;\n }\n\n const res = isArray(source) ? [...source] : { ...source };\n\n if (isArray(res)) {\n for (let i = res.length - 1; i >= 0; i--) {\n if (res[i] === comparison[i]) {\n res.splice(i, 1);\n } else if (isObject(res[i]) && isObject(comparison[i])) {\n res[i] = removePropsIfExisting(res[i] as unknown as Record<string, unknown>, (comparison as unknown as unknown[])[i] as Record<string, unknown>);\n }\n }\n } else {\n Object.keys(comparison).forEach(key => {\n if (key in res) {\n if (isObject(res[key]) && isObject(comparison[key])) {\n res[key] = removePropsIfExisting(res[key], comparison[key]);\n } else if (res[key] === comparison[key]) {\n delete res[key];\n }\n }\n });\n }\n\n return res;\n}\n","export function toArray<T>(input?: T | T[]): T[] {\n return Array.isArray(input) ? input : (input ? [input] : []);\n}\n","export const defaultDateFormat = \"MMMM dd, yyyy, HH:mm:ss\";\n","export function hashString(str: string): number {\n if (!str) return 0;\n let hash = 0;\n let i;\n let chr;\n for (i = 0; i < str.length; i++) {\n chr = str.charCodeAt(i);\n hash = ((hash << 5) - hash) + chr;\n hash |= 0; // Convert to 32bit integer\n }\n return Math.abs(hash);\n}\n","export function serializeRegExp(input: RegExp): string {\n if (!input) return \"\";\n // const fragments = input.toString().match(/\\/(.*?)\\/([a-z]*)?$/i);\n // if (fragments) {\n // if (fragments[2])\n // return input.toString();\n // return fragments[1];\n // }\n return input.toString();\n}\n\n/**\n * Get a RegExp out of a serialized string\n * @param input\n */\nexport function hydrateRegExp(input?: string): RegExp | undefined {\n if (!input) return undefined;\n const fragments = input.match(/\\/(.*?)\\/([a-z]*)?$/i);\n if (fragments) {\n return new RegExp(fragments[1], fragments[2] || \"\");\n } else {\n return new RegExp(input, \"\");\n }\n}\n\nexport function isValidRegExp(input: string): boolean {\n const fullRegexp = input.match(/\\/((?![*+?])(?:[^\\r\\n[/\\\\]|\\\\.|\\[(?:[^\\r\\n\\]\\\\]|\\\\.)*])+)\\/((?:g(?:im?|mi?)?|i(?:gm?|mg?)?|m(?:gi?|ig?)?)?)/);\n if (fullRegexp)\n return true;\n const simpleRegexp = input.match(/((?![*+?])(?:[^\\r\\n[/\\\\]|\\\\.|\\[(?:[^\\r\\n\\]\\\\]|\\\\.)*])+)/);\n return !!simpleRegexp;\n}\n","export function flattenObject(obj: Record<string, unknown>, parentKey = \"\") {\n if (!obj) return obj;\n return Object.keys(obj).reduce((flatObj, key) => {\n const newKey = parentKey ? `${parentKey}.${key}` : key;\n\n if (typeof obj[key] === \"object\" && obj[key] !== null) {\n if (Array.isArray(obj[key])) {\n obj[key].forEach((item: unknown, index: number) => {\n if (typeof item === \"object\" && item !== null) {\n Object.assign(flatObj, flattenObject(item as Record<string, unknown>, `${newKey}[${index}]`));\n } else {\n flatObj[`${newKey}[${index}]`] = item;\n }\n });\n } else {\n Object.assign(flatObj, flattenObject(obj[key] as Record<string, unknown>, newKey));\n }\n } else {\n flatObj[newKey] = obj[key];\n }\n\n return flatObj;\n }, {} as { [key: string]: unknown });\n}\n\n\n// map from nested property key like \"a.b.c\" to the maximum array count found in a list of objects for that array\nexport type ArrayValuesCount = Record<string, number>;\n\nexport function getArrayValuesCount(array: Record<string, unknown>[]): ArrayValuesCount {\n return array.reduce((acc: ArrayValuesCount, obj: Record<string, unknown>) => {\n Object.entries(obj).forEach(([key, value]) => {\n // proceed only if value is an array\n if (Array.isArray(value)) {\n acc[key] = Math.max(acc[key] || 0, value.length);\n }\n\n // handle nested object\n if (typeof value === \"object\" && value !== null) {\n const nested = getArrayValuesCount([value as Record<string, unknown>]);\n Object.entries(nested).forEach(([nestedKey, nestedCount]) => {\n const compoundKey = `${key}.${nestedKey}`;\n acc[compoundKey] = Math.max(acc[compoundKey] || 0, nestedCount);\n });\n }\n });\n return acc;\n }, {});\n}\n","/**\n * Returns the plural of an English word.\n *\n * @param {string} word\n * @param {number} [amount]\n * @returns {string}\n */\nexport function plural(word: string, amount?: number): string {\n if (amount !== undefined && amount === 1) {\n return word\n }\n const plurals: { [key: string]: string } = {\n \"(quiz)$\": \"$1zes\",\n \"^(ox)$\": \"$1en\",\n \"([m|l])ouse$\": \"$1ice\",\n \"(matr|vert|ind)ix|ex$\": \"$1ices\",\n \"(x|ch|ss|sh)$\": \"$1es\",\n \"([^aeiouy]|qu)y$\": \"$1ies\",\n \"(hive)$\": \"$1s\",\n \"(?:([^f])fe|([lr])f)$\": \"$1$2ves\",\n \"(shea|lea|loa|thie)f$\": \"$1ves\",\n sis$: \"ses\",\n \"([ti])um$\": \"$1a\",\n \"(tomat|potat|ech|her|vet)o$\": \"$1oes\",\n \"(bu)s$\": \"$1ses\",\n \"(alias)$\": \"$1es\",\n \"(octop)us$\": \"$1i\",\n \"(ax|test)is$\": \"$1es\",\n \"(us)$\": \"$1es\",\n \"([^s]+)$\": \"$1s\"\n }\n const irregular: { [key: string]: string } = {\n move: \"moves\",\n foot: \"feet\",\n goose: \"geese\",\n sex: \"sexes\",\n child: \"children\",\n man: \"men\",\n tooth: \"teeth\",\n person: \"people\"\n }\n const uncountable: string[] = [\n \"sheep\",\n \"fish\",\n \"deer\",\n \"moose\",\n \"series\",\n \"species\",\n \"money\",\n \"rice\",\n \"information\",\n \"equipment\",\n \"bison\",\n \"cod\",\n \"offspring\",\n \"pike\",\n \"salmon\",\n \"shrimp\",\n \"swine\",\n \"trout\",\n \"aircraft\",\n \"hovercraft\",\n \"spacecraft\",\n \"sugar\",\n \"tuna\",\n \"you\",\n \"wood\"\n ]\n // save some time in the case that singular and plural are the same\n if (uncountable.indexOf(word.toLowerCase()) >= 0) {\n return word;\n }\n // check for irregular forms\n for (const w in irregular) {\n const pattern = new RegExp(`${w}$`, \"i\")\n const replace = irregular[w]\n if (pattern.test(word)) {\n return word.replace(pattern, replace);\n }\n }\n // check for matches using regular expressions\n for (const reg in plurals) {\n const pattern = new RegExp(reg, \"i\")\n if (pattern.test(word)) {\n return word.replace(pattern, plurals[reg])\n }\n }\n return word;\n}\n\n/**\n * Returns the singular of an English word.\n *\n * @param {string} word\n * @param {number} [amount]\n * @returns {string}\n */\nexport function singular(word: string, amount?: number): string {\n if (amount !== undefined && amount !== 1) {\n return word;\n }\n const singulars: { [key: string]: string } = {\n \"(quiz)zes$\": \"$1\",\n \"(matr)ices$\": \"$1ix\",\n \"(vert|ind)ices$\": \"$1ex\",\n \"^(ox)en$\": \"$1\",\n \"(alias)es$\": \"$1\",\n \"(octop|vir)i$\": \"$1us\",\n \"(cris|ax|test)es$\": \"$1is\",\n \"(shoe)s$\": \"$1\",\n \"(o)es$\": \"$1\",\n \"(bus)es$\": \"$1\",\n \"([m|l])ice$\": \"$1ouse\",\n \"(x|ch|ss|sh)es$\": \"$1\",\n \"(m)ovies$\": \"$1ovie\",\n \"(s)eries$\": \"$1eries\",\n \"([^aeiouy]|qu)ies$\": \"$1y\",\n \"([lr])ves$\": \"$1f\",\n \"(tive)s$\": \"$1\",\n \"(hive)s$\": \"$1\",\n \"(li|wi|kni)ves$\": \"$1fe\",\n \"(shea|loa|lea|thie)ves$\": \"$1f\",\n \"(^analy)ses$\": \"$1sis\",\n \"((a)naly|(b)a|(d)iagno|(p)arenthe|(p)rogno|(s)ynop|(t)he)ses$\": \"$1$2sis\",\n \"([ti])a$\": \"$1um\",\n \"(n)ews$\": \"$1ews\",\n \"(h|bl)ouses$\": \"$1ouse\",\n \"(corpse)s$\": \"$1\",\n \"(us)es$\": \"$1\",\n s$: \"\"\n }\n const irregular: { [key: string]: string } = {\n move: \"moves\",\n foot: \"feet\",\n goose: \"geese\",\n sex: \"sexes\",\n child: \"children\",\n man: \"men\",\n tooth: \"teeth\",\n person: \"people\"\n }\n const uncountable: string[] = [\n \"sheep\",\n \"fish\",\n \"deer\",\n \"moose\",\n \"series\",\n \"species\",\n \"money\",\n \"rice\",\n \"information\",\n \"equipment\",\n \"bison\",\n \"cod\",\n \"offspring\",\n \"pike\",\n \"salmon\",\n \"shrimp\",\n \"swine\",\n \"trout\",\n \"aircraft\",\n \"hovercraft\",\n \"spacecraft\",\n \"sugar\",\n \"tuna\",\n \"you\",\n \"wood\"\n ]\n // save some time in the case that singular and plural are the same\n if (uncountable.indexOf(word.toLowerCase()) >= 0) {\n return word;\n }\n // check for irregular forms\n for (const w in irregular) {\n const pattern = new RegExp(`${irregular[w]}$`, \"i\");\n if (pattern.test(word)) {\n return word.replace(pattern, w);\n }\n }\n // check for matches using regular expressions\n for (const reg in singulars) {\n const pattern = new RegExp(reg, \"i\");\n if (pattern.test(word)) {\n return word.replace(pattern, singulars[reg]);\n }\n }\n return word;\n}\n","import { toSnakeCase } from \"./strings\";\n\n/**\n * Generates a foreign key column name from a given string, typically a collection slug or name.\n * It converts the name to snake_case, attempts to singularize it by removing a trailing 's'\n * (a common convention for collection names), and appends '_id'.\n *\n * @param name The base name to convert to a foreign key.\n * @returns A foreign key name in the format 'singular_name_id'.\n *\n * @example\n * // returns \"user_id\"\n * generateForeignKeyName(\"users\")\n *\n * @example\n * // returns \"post_id\"\n * generateForeignKeyName(\"posts\")\n *\n * @example\n * // returns \"product_id\"\n * generateForeignKeyName(\"Product\")\n *\n */\nexport function generateForeignKeyName(name: string): string {\n const snakeCaseName = toSnakeCase(name);\n // A simple heuristic to singularize a plural name, which is a common convention.\n const singularName = snakeCaseName.endsWith(\"s\") ? snakeCaseName.slice(0, -1) : snakeCaseName;\n return `${singularName}_id`;\n}\n\n","\n\nexport function isDefaultFieldConfigId(id: string): boolean {\n return [\"text_field\",\n \"multiline\",\n \"markdown\",\n \"url\",\n \"email\",\n \"switch\",\n \"select\",\n \"multi_select\",\n \"number_input\",\n \"number_select\",\n \"multi_number_select\",\n \"file_upload\",\n \"multi_file_upload\",\n \"reference\",\n \"multi_references\",\n \"relation\",\n \"date_time\",\n \"group\",\n \"key_value\",\n \"repeat\",\n \"custom_array\",\n \"block\"\n ].includes(id);\n}\n"],"mappings":";;;AAAA,IAAM,gBAAgB;AAEtB,IAAa,eAAe,QAAiB;CACzC,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU,OAAO;CAC5C,MAAM,mBAAmB,IAAI,MAAM,aAAa;CAChD,IAAI,CAAC,kBAAkB,OAAO;CAC9B,OAAO,iBACF,KAAI,MAAK,EAAE,YAAY,CAAC,EACxB,KAAK,GAAG;AACjB;AAEA,IAAM,iBAAiB;AAEvB,IAAa,eAAe,QAAiB;CACzC,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU,OAAO;CAC5C,MAAM,mBAAmB,IAAI,MAAM,cAAc;CACjD,IAAI,CAAC,kBAAkB,OAAO;CAC9B,OAAO,iBACF,KAAI,MAAK,EAAE,YAAY,CAAC,EACxB,KAAK,GAAG;AACjB;AAEA,SAAgB,UAAU,KAAqB;CAC3C,IAAI,CAAC,KAAK,OAAO;CACjB,IAAI,IAAI,WAAW,GAAG,OAAO,IAAI,YAAY;CAG7C,MAAM,QAAQ,IAAI,MAAM,QAAQ,EAAE,OAAO,OAAO;CAEhD,IAAI,MAAM,WAAW,GAAG,OAAO;CAG/B,OAAO,MAAM,GAAG,YAAY,IAExB,MAAM,MAAM,CAAC,EACR,KAAI,SAAQ,KAAK,OAAO,CAAC,EAAE,YAAY,IAAI,KAAK,UAAU,CAAC,EAAE,YAAY,CAAC,EAC1E,KAAK,EAAE;AACpB;AAEA,SAAgB,aAAa,YAAY,GAAG;CACxC,OAAO,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,IAAI,SAAS;AAC5D;AAEA,SAAgB,cAAc;CAC1B,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,QAAQ,EAAE,SAAS,EAAE;AAC3D;AAEA,SAAgB,QAAQ,MAAe,YAAY,KAAK,YAAY,MAAM;CACtE,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,OAAO;CACb,MAAM,KAAK,4BAA4B,YAAY,YAAY,YAAY,YAAY,YAAY,YAAY;CAE/G,KAAK,IAAI,IAAI,GAAG,IAAI,IAAa,IAAI,GAAG,KACpC,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,OAAO,CAAC,GAAG,GAAG,GAAG,GAAG,OAAO,CAAC,CAAC;CAGrE,OAAO,KACF,SAAS,EACT,KAAK,EACL,QAAQ,cAAc,EAAE,EACxB,QAAQ,QAAQ,SAAS,EACzB,QAAQ,MAAM,SAAS,EACvB,QAAQ,cAAc,EAAE,EACxB,QAAQ,IAAI,OAAO,OAAO,YAAY,OAAO,YAAY,KAAK,GAAG,GAC9D,SAAS;CAEjB,OAAO,YACD,KAAK,YAAY,IACjB;AACV;AAEA,SAAgB,UAAU,MAAuB;CAC7C,IAAI,CAAC,MAAM,OAAO;CAClB,IAAI,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG,KAAK,CAAC,KAAK,SAAS,GAAG,GAE9D,OADe,KAAK,QAAQ,SAAS,GAC9B,EAAO,QAAQ,UAAU,SAAU,KAAK;EAC3C,OAAO,IAAI,OAAO,CAAC,EAAE,YAAY,IAAI,IAAI,UAAU,CAAC;CACxD,CAAC,EAAE,KAAK;MAER,OAAO,KAAK,KAAK;AAEzB;AAEA,SAAgB,mBAAmB,OAAe;CAC9C,IAAI,CAAC,OAAO,OAAO;CAEnB,IAAI,OAAO;CAKX,OAAO,KAAK,QAAQ,uCAAuC,WAAW;CAGtE,OAAO,KAAK,QAAQ,UAAU,GAAG;CAMjC,OAHU,KACL,KAAK,EACL,QAAQ,UAAU,SAAS,KAAK,YAAY,CAC1C;AACX;;;;ACjGA,IAAa,gBAAgB,UACzB,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW;;AAG7C,IAAa,cAAc,QACvB,OAAO,QAAQ;;AAGnB,IAAa,aAAa,QACtB,OAAO,KAAK,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,OAAO,GAAG;;AAIlD,IAAa,SAAS,QAA0B,QAAQ;;;;AAKxD,SAAgB,MACZ,KACA,KACA,KACA,IAAI,GACN;CACE,MAAM,OAAO,OAAO,GAAG;CACvB,OAAO,OAAO,IAAI,KAAK,QACnB,MAAO,IAAgC,KAAK;CAIhD,IAAI,MAAM,KAAK,UAAU,CAAC,KACtB,OAAO;CAGX,OAAO,QAAQ,KAAA,IAAY,MAAM;AACrC;AAEA,SAAgB,MAAS,KAAQ,MAAc,OAAmB;CAC9D,MAAM,MAAM,MAAM,GAAG;CACrB,IAAI,SAAkC;CACtC,IAAI,IAAI;CACR,MAAM,YAAY,OAAO,IAAI;CAE7B,OAAO,IAAI,UAAU,SAAS,GAAG,KAAK;EAClC,MAAM,cAAsB,UAAU;EACtC,MAAM,aAAa,MAAM,KAAgC,UAAU,MAAM,GAAG,IAAI,CAAC,CAAC;EAElF,IAAI,eAAe,SAAS,UAAU,KAAK,MAAM,QAAQ,UAAU,IAC/D,SAAS,OAAO,eAAe,MAAM,UAAU;OAC5C;GACH,MAAM,WAAmB,UAAU,IAAI;GACvC,SAAS,OAAO,eACX,UAAU,QAAQ,KAAK,OAAO,QAAQ,KAAK,IAAI,CAAC,IAAI,CAAC;EAC9D;CACJ;CAGA,KAAK,MAAM,IAAI,MAAiC,QAAQ,UAAU,QAAQ,OACtE,OAAO;CAGX,IAAI,UAAU,KAAA,GACV,OAAO,OAAO,UAAU;MAExB,OAAO,UAAU,MAAM;CAK3B,IAAI,MAAM,KAAK,UAAU,KAAA,GACrB,OAAO,IAAI,UAAU;CAGzB,OAAO;AACX;AAEA,SAAgB,MAAS,OAAa;CAClC,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,CAAC,GAAG,KAAK;MACb,IAAI,OAAO,UAAU,YAAY,UAAU,MAC9C,OAAO,EAAE,GAAG,MAAM;MAElB,OAAO;AAEf;;;;;;AAOA,SAAgB,UAAa,OAAa;CACtC,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;CAClD,IAAI,OAAO,UAAU,YAAY,OAAO;CACxC,IAAI,OAAO,UAAU,UAAU,OAAO;CAEtC,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAI,SAAQ,UAAU,IAAI,CAAC;CAI5C,IAAI,OAAO,eAAe,KAAK,MAAM,OAAO,WACxC,OAAO;CAGX,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,OAAO,OAAO,KAAK,KAAK,GAC/B,OAAO,OAAO,UAAW,MAAkC,IAAI;CAEnE,OAAO;AACX;AAEA,SAAS,OAAO,OAA0B;CACtC,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO;CAEjC,OAAO,MAAM,QAAQ,aAAa,KAAK,EAAE,QAAQ,OAAO,EAAE,EAAE,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;AAC5F;AAGA,IAAa,QAA4H,KAAQ,GAAG,UAAuB,EACvK,GAAG,KAAK,QAAiC,KAAK,SAAS;CACnD,GAAG;EACF,MAAgB,IAAI;AACzB,IAAI,CAAC,CAAC,EACV;AAEA,SAAgB,SAAS,MAAgD;CACrE,OAAO,CAAC,CAAC,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI;AACpE;AAEA,SAAgB,cAAc,KAA8C;CAExE,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAC5D,OAAO;CAOX,OAHc,OAAO,eAAe,GAG7B,MAAU,OAAO;AAC5B;AAEA,SAAgB,UACZ,QACA,QACA,kBAAkB,OACb;CAEL,IAAI,CAAC,SAAS,MAAM,GAChB,OAAO;CAIX,MAAM,SAAS,EAAE,GAAG,OAAO;CAI3B,IAAI,CAAC,SAAS,MAAM,GAChB,OAAO;CAIX,KAAK,MAAM,OAAO,QAAQ;EACtB,IAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,aACxD;EAEJ,IAAI,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;GACnD,MAAM,cAAc,OAAO;GAC3B,MAAM,cAAe,OAAmC;GAIxD,IAAI,mBAAmB,gBAAgB,KAAA,GACnC;GAGJ,IAAI,uBAAuB,MAEvB,OAAoC,OAAO,IAAI,KAAK,YAAY,QAAQ,CAAC;QACtE,IAAI,MAAM,QAAQ,WAAW,GAChC,IAAI,MAAM,QAAQ,WAAW,GAIzB,IAAI,EADoB,YAAY,KAAK,aAAa,KAAK,YAAY,KAAK,aAAa,IAErF,OAAoC,OAAO,CAAC,GAAG,WAAW;QACvD;IACH,MAAM,WAAW,CAAC;IAClB,MAAM,YAAY,KAAK,IAAI,YAAY,QAAQ,YAAY,MAAM;IACjE,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;KAChC,MAAM,aAAa,YAAY;KAC/B,MAAM,aAAa,YAAY;KAE/B,IAAI,KAAK,YAAY,QACjB,SAAS,KAAK;UACX,IAAI,KAAK,YAAY,QACxB,SAAS,KAAK;UACX,IAAI,eAAe,MACtB,SAAS,KAAK;UACX,IAAI,cAAc,UAAU,KAAK,cAAc,UAAU,GAE5D,SAAS,KAAK,UAAU,YAAY,YAAY,eAAe;UAG/D,SAAS,KAAK;IAEtB;IACA,OAAoC,OAAO;GAC/C;QAIA,OAAoC,OAAO,CAAC,GAAG,WAAW;QAE3D,IAAI,cAAc,WAAW,GAEhC,IAAI,cAAc,WAAW,GAGzB,OAAoC,OAAO,UAAU,aAAwC,aAAa,eAAe;QAIzH,OAAoC,OAAO;QAE5C,IAAI,SAAS,WAAW,GAE3B,OAAoC,OAAO;QAG3C,OAAoC,OAAO;EAEnD;CACJ;CAEA,OAAO;AACX;AAEA,SAAgB,eAAe,GAAuB,MAAuB;CACzE,IAAI,CAAC,GAAG,OAAO,KAAA;CACf,IAAI,OAAO,MAAM,UAAU;EACvB,IAAI,QAAQ,GACR,OAAQ,EAA8B;EAE1C,IAAI,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG,GAAG;GAC1C,IAAI,eAAe,KAAK,MAAM,MAAM;GACpC,IAAI,KAAK,SAAS,GAAG,GACjB,eAAe,aAAa,KAAI,YAAW,QAAQ,QAAQ,KAAK,EAAE,CAAC;GAEvE,MAAM,eAAe,aAAa;GAClC,MAAM,wBAAwB,MAAM,QAAS,EAA8B,aAAa,KAAK,CAAC,MAAM,SAAS,aAAa,EAAE,CAAC;GAC7H,MAAM,aAAa,wBACX,EAA8B,cAA4B,SAAS,aAAa,EAAE,KACnF,EAA8B;GAErC,MAAM,WAAW,aAAa,MAAM,wBAAwB,IAAI,CAAC,EAAE,KAAK,GAAG;GAC3E,IAAI,aAAa,IACb,OAAO;GACX,OAAO,eAAe,YAAkC,QAAQ;EACpE;CACJ;AAEJ;AAEA,SAAgB,aAAa,GAAW,MAAkC;CACtE,MAAM,MAAM,MAAM,CAAC;CACnB,IAAI,UAAU;CACd,MAAM,QAAQ,KAAK,MAAM,GAAG;CAC5B,MAAM,OAAO,MAAM,IAAI;CACvB,KAAK,MAAM,QAAQ,OACf,IAAI,QAAQ,WAAW,QAAQ,UAAU,QAAQ,OAAO,QAAQ,UAAU,UAAU;EAChF,QAAQ,QAAQ,MAAM,QAAQ,KAAK;EACnC,UAAU,QAAQ;CACtB,OACI,OAAO;CAGf,IAAI,QAAQ,WAAW,OAAO,YAAY,UACtC,OAAO,QAAQ;CAEnB,OAAO;AACX;AAEA,SAAgB,gBAAgB,GAAqB;CACjD,IAAI,MAAM,KAAA,GAAW,OAAO,KAAA;CAC5B,IAAI,MAAM,MAAM,OAAO;CACvB,IAAI,OAAO,MAAM,UAAU;EAEvB,IAAI,MAAM,QAAQ,CAAC,GACf,OAAO,EAAE,KAAI,MAAK,gBAAgB,CAAC,CAAC;EAGxC,IAAI,CAAC,cAAc,CAAC,GAChB,OAAO;EAEX,OAAO,OAAO,QAAQ,CAAC,EAClB,QAAQ,CAAC,GAAG,WAAW,OAAO,UAAU,UAAU,EAClD,KAAK,CAAC,KAAK,WAAW;GACnB,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,GAAG,MAAM,MAAM,KAAI,MAAK,gBAAgB,CAAC,CAAC,EAAE;QAChD,IAAI,OAAO,UAAU,UACxB,OAAO,GAAG,MAAM,gBAAgB,KAAK,EAAE;QACpC,OAAO,GAAG,MAAM,MAAM;EACjC,CAAC,EACA,QAAQ,GAAG,OAAO;GAAE,GAAG;GACpC,GAAG;EAAE,IAAI,CAAC,CAAC;CACP;CACA,OAAO;AACX;AAEA,SAAgB,aAAgB,GAAqB;CACjD,IAAI,CAAC,GAAG,OAAO;CACf,IAAI,OAAO,MAAM,YAAY,MAAM;MAC3B,QAAQ,GACR,OAAO,OAAQ,EAA8B,EAAE;OAC9C,IAAI,aAAa,MAClB,OAAO,EAAE,eAAe;OACvB,IAAI,aAAa,UAClB,OAAO,KAAK,CAA4B;CAAA;CAEhD,OAAO,KAAK,GAAa,EAAE,eAAe,KAAK,CAAC;AACpD;AAEA,SAAgB,gBAAgB,OAAgB,oBAAuC;CACnF,IAAI,OAAO,UAAU,YACjB,OAAO;CAEX,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAK,MAAe,gBAAgB,GAAG,kBAAkB,CAAC;CAE3E,IAAI,OAAO,UAAU,UAAU;EAC3B,IAAI,UAAU,MACV,OAAO;EAEX,IAAI,CAAC,cAAc,KAAK,GACpB,OAAO;EAEX,MAAM,MAA+B,CAAC;EACtC,OAAO,KAAK,KAAK,EAAE,SAAS,QAAQ;GAChC,IAAI,CAAC,cAAc,KAAe,GAAG;IACjC,MAAM,WAAW,gBAAiB,MAAkC,MAAM,kBAAkB;IAC5F,MAAM,WAAW,OAAO,aAAa;IACrC,MAAM,qBAAqB,CAAC,sBAAuB,sBAAsB,CAAC,YAAc,sBAAsB,YAAY,aAAa;IACvI,IAAI,aAAa,KAAA,KAAa,CAAC,cAAc,QAAkB,KAAK,oBAChE,IAAI,OAAO;GACnB;EACJ,CAAC;EACD,OAAO;CACX;CACA,OAAO;AACX;AAEA,SAAgB,YAAY,OAAyB;CACjD,IAAI,OAAO,UAAU,YACjB,OAAO;CAEX,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAK,MAAe,YAAY,CAAC,CAAC;CAEnD,IAAI,OAAO,UAAU,UAAU;EAC3B,IAAI,UAAU,MACV,OAAO;EAEX,IAAI,CAAC,cAAc,KAAK,GACpB,OAAO;EAEX,MAAM,MAA+B,CAAC;EACtC,MAAM,MAAM;EACZ,OAAO,KAAK,GAAG,EAAE,SAAS,QAAQ;GAC9B,IAAI,IAAI,SAAS,MACb,IAAI,OAAO,YAAY,IAAI,IAAI;EACvC,CAAC;EACD,OAAO;CACX;CACA,OAAO;AACX;AAEA,SAAgB,cAAc,KAAa;CACvC,OAAO,OACH,OAAO,eAAe,GAAG,MAAM,OAAO,aACtC,OAAO,KAAK,GAAG,EAAE,WAAW;AACpC;AAEA,SAAgB,sBAAsB,QAA6C,YAAiD;CAChI,MAAM,YAAY,QAAiD,OAAO,QAAQ,YAAY,QAAQ;CACtG,MAAM,WAAW,QAAmC,MAAM,QAAQ,GAAG;CAErE,IAAI,CAAC,SAAS,MAAM,KAAK,CAAC,SAAS,UAAU,GACzC,OAAO;CAGX,MAAM,MAAM,QAAQ,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,EAAE,GAAG,OAAO;CAExD,IAAI,QAAQ,GAAG;OACN,IAAI,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KACjC,IAAI,IAAI,OAAO,WAAW,IACtB,IAAI,OAAO,GAAG,CAAC;OACZ,IAAI,SAAS,IAAI,EAAE,KAAK,SAAS,WAAW,EAAE,GACjD,IAAI,KAAK,sBAAsB,IAAI,IAA2C,WAAoC,EAA6B;CAAA,OAIvJ,OAAO,KAAK,UAAU,EAAE,SAAQ,QAAO;EACnC,IAAI,OAAO;OACH,SAAS,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,GAC9C,IAAI,OAAO,sBAAsB,IAAI,MAAM,WAAW,IAAI;QACvD,IAAI,IAAI,SAAS,WAAW,MAC/B,OAAO,IAAI;EAAA;CAGvB,CAAC;CAGL,OAAO;AACX;;;ACnaA,SAAgB,QAAW,OAAsB;CAC7C,OAAO,MAAM,QAAQ,KAAK,IAAI,QAAS,QAAQ,CAAC,KAAK,IAAI,CAAC;AAC9D;;;ACFA,IAAa,oBAAoB;;;ACAjC,SAAgB,WAAW,KAAqB;CAC5C,IAAI,CAAC,KAAK,OAAO;CACjB,IAAI,OAAO;CACX,IAAI;CACJ,IAAI;CACJ,KAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EAC7B,MAAM,IAAI,WAAW,CAAC;EACtB,QAAS,QAAQ,KAAK,OAAQ;EAC9B,QAAQ;CACZ;CACA,OAAO,KAAK,IAAI,IAAI;AACxB;;;ACXA,SAAgB,gBAAgB,OAAuB;CACnD,IAAI,CAAC,OAAO,OAAO;CAOnB,OAAO,MAAM,SAAS;AAC1B;;;;;AAMA,SAAgB,cAAc,OAAoC;CAC9D,IAAI,CAAC,OAAO,OAAO,KAAA;CACnB,MAAM,YAAY,MAAM,MAAM,sBAAsB;CACpD,IAAI,WACA,OAAO,IAAI,OAAO,UAAU,IAAI,UAAU,MAAM,EAAE;MAElD,OAAO,IAAI,OAAO,OAAO,EAAE;AAEnC;AAEA,SAAgB,cAAc,OAAwB;CAElD,IADmB,MAAM,MAAM,6GAC3B,GACA,OAAO;CAEX,OAAO,CAAC,CADa,MAAM,MAAM,yDACxB;AACb;;;AC/BA,SAAgB,cAAc,KAA8B,YAAY,IAAI;CACxE,IAAI,CAAC,KAAK,OAAO;CACjB,OAAO,OAAO,KAAK,GAAG,EAAE,QAAQ,SAAS,QAAQ;EAC7C,MAAM,SAAS,YAAY,GAAG,UAAU,GAAG,QAAQ;EAEnD,IAAI,OAAO,IAAI,SAAS,YAAY,IAAI,SAAS,MAC7C,IAAI,MAAM,QAAQ,IAAI,IAAI,GACtB,IAAI,KAAK,SAAS,MAAe,UAAkB;GAC/C,IAAI,OAAO,SAAS,YAAY,SAAS,MACrC,OAAO,OAAO,SAAS,cAAc,MAAiC,GAAG,OAAO,GAAG,MAAM,EAAE,CAAC;QAE5F,QAAQ,GAAG,OAAO,GAAG,MAAM,MAAM;EAEzC,CAAC;OAED,OAAO,OAAO,SAAS,cAAc,IAAI,MAAiC,MAAM,CAAC;OAGrF,QAAQ,UAAU,IAAI;EAG1B,OAAO;CACX,GAAG,CAAC,CAA+B;AACvC;AAMA,SAAgB,oBAAoB,OAAoD;CACpF,OAAO,MAAM,QAAQ,KAAuB,QAAiC;EACzE,OAAO,QAAQ,GAAG,EAAE,SAAS,CAAC,KAAK,WAAW;GAE1C,IAAI,MAAM,QAAQ,KAAK,GACnB,IAAI,OAAO,KAAK,IAAI,IAAI,QAAQ,GAAG,MAAM,MAAM;GAInD,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM;IAC7C,MAAM,SAAS,oBAAoB,CAAC,KAAgC,CAAC;IACrE,OAAO,QAAQ,MAAM,EAAE,SAAS,CAAC,WAAW,iBAAiB;KACzD,MAAM,cAAc,GAAG,IAAI,GAAG;KAC9B,IAAI,eAAe,KAAK,IAAI,IAAI,gBAAgB,GAAG,WAAW;IAClE,CAAC;GACL;EACJ,CAAC;EACD,OAAO;CACX,GAAG,CAAC,CAAC;AACT;;;;;;;;;;ACzCA,SAAgB,OAAO,MAAc,QAAyB;CAC1D,IAAI,WAAW,KAAA,KAAa,WAAW,GACnC,OAAO;CAEX,MAAM,UAAqC;EACvC,WAAW;EACX,UAAU;EACV,gBAAgB;EAChB,yBAAyB;EACzB,iBAAiB;EACjB,oBAAoB;EACpB,WAAW;EACX,yBAAyB;EACzB,yBAAyB;EACzB,MAAM;EACN,aAAa;EACb,+BAA+B;EAC/B,UAAU;EACV,YAAY;EACZ,cAAc;EACd,gBAAgB;EAChB,SAAS;EACT,YAAY;CAChB;CACA,MAAM,YAAuC;EACzC,MAAM;EACN,MAAM;EACN,OAAO;EACP,KAAK;EACL,OAAO;EACP,KAAK;EACL,OAAO;EACP,QAAQ;CACZ;CA6BA,IAAI;EA3BA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CAGA,EAAY,QAAQ,KAAK,YAAY,CAAC,KAAK,GAC3C,OAAO;CAGX,KAAK,MAAM,KAAK,WAAW;EACvB,MAAM,UAAU,IAAI,OAAO,GAAG,EAAE,IAAI,GAAG;EACvC,MAAM,UAAU,UAAU;EAC1B,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,OAAO;CAE5C;CAEA,KAAK,MAAM,OAAO,SAAS;EACvB,MAAM,UAAU,IAAI,OAAO,KAAK,GAAG;EACnC,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,QAAQ,IAAI;CAEjD;CACA,OAAO;AACX;;;;;;;;AASA,SAAgB,SAAS,MAAc,QAAyB;CAC5D,IAAI,WAAW,KAAA,KAAa,WAAW,GACnC,OAAO;CAEX,MAAM,YAAuC;EACzC,cAAc;EACd,eAAe;EACf,mBAAmB;EACnB,YAAY;EACZ,cAAc;EACd,iBAAiB;EACjB,qBAAqB;EACrB,YAAY;EACZ,UAAU;EACV,YAAY;EACZ,eAAe;EACf,mBAAmB;EACnB,aAAa;EACb,aAAa;EACb,sBAAsB;EACtB,cAAc;EACd,YAAY;EACZ,YAAY;EACZ,mBAAmB;EACnB,2BAA2B;EAC3B,gBAAgB;EAChB,iEAAiE;EACjE,YAAY;EACZ,WAAW;EACX,gBAAgB;EAChB,cAAc;EACd,WAAW;EACX,IAAI;CACR;CACA,MAAM,YAAuC;EACzC,MAAM;EACN,MAAM;EACN,OAAO;EACP,KAAK;EACL,OAAO;EACP,KAAK;EACL,OAAO;EACP,QAAQ;CACZ;CA6BA,IAAI;EA3BA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CAGA,EAAY,QAAQ,KAAK,YAAY,CAAC,KAAK,GAC3C,OAAO;CAGX,KAAK,MAAM,KAAK,WAAW;EACvB,MAAM,UAAU,IAAI,OAAO,GAAG,UAAU,GAAG,IAAI,GAAG;EAClD,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,CAAC;CAEtC;CAEA,KAAK,MAAM,OAAO,WAAW;EACzB,MAAM,UAAU,IAAI,OAAO,KAAK,GAAG;EACnC,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,UAAU,IAAI;CAEnD;CACA,OAAO;AACX;;;;;;;;;;;;;;;;;;;;;;;;ACpKA,SAAgB,uBAAuB,MAAsB;CACzD,MAAM,gBAAgB,YAAY,IAAI;CAGtC,OAAO,GADc,cAAc,SAAS,GAAG,IAAI,cAAc,MAAM,GAAG,EAAE,IAAI,cACzD;AAC3B;;;AC1BA,SAAgB,uBAAuB,IAAqB;CACxD,OAAO;EAAC;EACJ;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACJ,EAAE,SAAS,EAAE;AACjB"}
|
package/dist/index.umd.js
CHANGED
|
@@ -126,7 +126,7 @@
|
|
|
126
126
|
/**
|
|
127
127
|
* Deep clone a value, preserving function references and class instances.
|
|
128
128
|
* Unlike structuredClone, this handles objects that contain functions
|
|
129
|
-
* (e.g.
|
|
129
|
+
* (e.g. CollectionConfig with target(), childCollections(), callbacks).
|
|
130
130
|
*/
|
|
131
131
|
function deepClone(value) {
|
|
132
132
|
if (value === null || value === void 0) return value;
|
|
@@ -576,7 +576,6 @@
|
|
|
576
576
|
"multi_number_select",
|
|
577
577
|
"file_upload",
|
|
578
578
|
"multi_file_upload",
|
|
579
|
-
"reference_as_string",
|
|
580
579
|
"reference",
|
|
581
580
|
"multi_references",
|
|
582
581
|
"relation",
|
package/dist/index.umd.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.umd.js","names":[],"sources":["../src/strings.ts","../src/objects.ts","../src/arrays.ts","../src/dates.ts","../src/hash.ts","../src/regexp.ts","../src/flatten_object.ts","../src/plurals.ts","../src/names.ts","../src/fields.ts"],"sourcesContent":["const tokenizeRegex = /[A-Z]{2,}(?=[A-Z][a-z]|\\b)|[A-Z]?[a-z]+|[0-9]+(?:[a-z](?![a-z]))?|[A-Z]/g;\n\nexport const toKebabCase = (str?: string) => {\n if (!str || typeof str !== \"string\") return \"\";\n const regExpMatchArray = str.match(tokenizeRegex);\n if (!regExpMatchArray) return \"\";\n return regExpMatchArray\n .map(x => x.toLowerCase())\n .join(\"-\");\n};\n\nconst snakeCaseRegex = tokenizeRegex;\n\nexport const toSnakeCase = (str?: string) => {\n if (!str || typeof str !== \"string\") return \"\";\n const regExpMatchArray = str.match(snakeCaseRegex);\n if (!regExpMatchArray) return \"\";\n return regExpMatchArray\n .map(x => x.toLowerCase())\n .join(\"_\");\n};\n\nexport function camelCase(str: string): string {\n if (!str) return \"\";\n if (str.length === 1) return str.toLowerCase();\n\n // Split by hyphens, underscores, or spaces and filter out empty strings\n const parts = str.split(/[-_ ]+/).filter(Boolean);\n\n if (parts.length === 0) return \"\";\n\n // Start with first part in lowercase\n return parts[0].toLowerCase() +\n // Transform remaining parts to have first letter uppercase\n parts.slice(1)\n .map(part => part.charAt(0).toUpperCase() + part.substring(1).toLowerCase())\n .join(\"\");\n}\n\nexport function randomString(strLength = 5) {\n return Math.random().toString(36).slice(2, 2 + strLength);\n}\n\nexport function randomColor() {\n return Math.floor(Math.random() * 16777215).toString(16);\n}\n\nexport function slugify(text?: string, separator = \"_\", lowercase = true) {\n if (!text) return \"\";\n const from = \"ãàáäâẽèéëêìíïîõòóöôùúüûñç·/_,:;-\"\n const to = `aaaaaeeeeeiiiiooooouuuunc${separator}${separator}${separator}${separator}${separator}${separator}${separator}`;\n\n for (let i = 0, l = from.length; i < l; i++) {\n text = text.replace(new RegExp(from.charAt(i), \"g\"), to.charAt(i));\n }\n\n text = text\n .toString() // Cast to string\n .trim() // Remove whitespace from both sides of a string\n .replace(/^\\s+|\\s+$/g, \"\")\n .replace(/\\s+/g, separator) // Replace spaces with separator\n .replace(/&/g, separator) // Replace & with separator\n .replace(/[^\\w\\\\-]+/g, \"\") // Remove all non-word chars\n .replace(new RegExp(\"\\\\\" + separator + \"\\\\\" + separator + \"+\", \"g\"),\n separator); // Replace multiple separators with single one\n\n return lowercase\n ? text.toLowerCase() // Convert the string to lowercase letters\n : text;\n}\n\nexport function unslugify(slug?: string): string {\n if (!slug) return \"\";\n if (slug.includes(\"-\") || slug.includes(\"_\") || !slug.includes(\" \")) {\n const result = slug.replace(/[-_]/g, \" \");\n return result.replace(/\\w\\S*/g, function (txt) {\n return txt.charAt(0).toUpperCase() + txt.substring(1);\n }).trim();\n } else {\n return slug.trim();\n }\n}\n\nexport function prettifyIdentifier(input: string) {\n if (!input) return \"\";\n\n let text = input;\n\n // 1. Handle camelCase and Acronyms\n // Group 1 ($1 $2): Lowercase followed by Uppercase (e.g., imageURL -> image URL)\n // Group 2 ($3 $4): Uppercase followed by Uppercase+lowercase (e.g., XMLParser -> XML Parser)\n text = text.replace(/([a-z])([A-Z])|([A-Z])([A-Z][a-z])/g, \"$1$3 $2$4\");\n\n // 2. Replace hyphens/underscores with spaces\n text = text.replace(/[_-]+/g, \" \");\n\n // 3. Capitalize first letter of each word (Title Case)\n const s = text\n .trim()\n .replace(/\\b\\w/g, (char) => char.toUpperCase());\n return s;\n}\n","import hash from \"object-hash\";\nimport { GeoPoint } from \"@rebasepro/types\";\n\n/** @private is the value an empty array? */\nexport const isEmptyArray = (value?: unknown) =>\n Array.isArray(value) && value.length === 0;\n\n/** @private is the given object a Function? */\nexport const isFunction = (obj: unknown): obj is (...args: unknown[]) => unknown =>\n typeof obj === \"function\";\n\n/** @private is the given object an integer? */\nexport const isInteger = (obj: unknown): boolean =>\n String(Math.floor(Number(obj))) === String(obj);\n\n/** @private is the given object a NaN? */\n\nexport const isNaN = (obj: unknown): boolean => obj !== obj;\n\n/**\n * Deeply get a value from an object via its path.\n */\nexport function getIn(\n obj: Record<string, unknown> | unknown[] | unknown,\n key: string | string[],\n def?: unknown,\n p = 0\n) {\n const path = toPath(key);\n while (obj && p < path.length) {\n obj = (obj as Record<string, unknown>)[path[p++]];\n }\n\n // check if path is not in the end\n if (p !== path.length && !obj) {\n return def;\n }\n\n return obj === undefined ? def : obj;\n}\n\nexport function setIn<T>(obj: T, path: string, value: unknown): T {\n const res = clone(obj) as Record<string, unknown>;\n let resVal: Record<string, unknown> = res;\n let i = 0;\n const pathArray = toPath(path);\n\n for (; i < pathArray.length - 1; i++) {\n const currentPath: string = pathArray[i];\n const currentObj = getIn(obj as Record<string, unknown>, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = clone(currentObj) as Record<string, unknown>;\n } else {\n const nextPath: string = pathArray[i + 1];\n resVal = resVal[currentPath] =\n (isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {}) as Record<string, unknown>;\n }\n }\n\n // Return original object if new value is the same as current\n if ((i === 0 ? obj as Record<string, unknown> : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n }\n\n // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res as T;\n}\n\nexport function clone<T>(value: T): T {\n if (Array.isArray(value)) {\n return [...value] as T;\n } else if (typeof value === \"object\" && value !== null) {\n return { ...value } as T;\n } else {\n return value; // This is for primitive types which do not need cloning.\n }\n}\n\n/**\n * Deep clone a value, preserving function references and class instances.\n * Unlike structuredClone, this handles objects that contain functions\n * (e.g. EntityCollection with target(), childCollections(), callbacks).\n */\nexport function deepClone<T>(value: T): T {\n if (value === null || value === undefined) return value;\n if (typeof value === \"function\") return value;\n if (typeof value !== \"object\") return value;\n\n if (Array.isArray(value)) {\n return value.map(item => deepClone(item)) as T;\n }\n\n // Preserve class instances (Date, GeoPoint, etc.) — don't recurse\n if (Object.getPrototypeOf(value) !== Object.prototype) {\n return value;\n }\n\n const result: Record<string, unknown> = {};\n for (const key of Object.keys(value)) {\n result[key] = deepClone((value as Record<string, unknown>)[key]);\n }\n return result as T;\n}\n\nfunction toPath(value: string | string[]) {\n if (Array.isArray(value)) return value; // Already in path array form.\n // Replace brackets with dots, remove leading/trailing dots, then split by dot.\n return value.replace(/\\[(\\d+)]/g, \".$1\").replace(/^\\./, \"\").replace(/\\.$/, \"\").split(\".\");\n}\n\n\nexport const pick: <T extends Record<string, unknown>>(obj: T, ...args: (keyof T)[]) => Partial<T> = <T extends Record<string, unknown>>(obj: T, ...args: (keyof T)[]) => ({\n ...args.reduce<Record<string, unknown>>((res, key) => ({\n ...res,\n [key as string]: obj[key as string]\n }), {})\n}) as Partial<T>;\n\nexport function isObject(item: unknown): item is Record<string, unknown> {\n return !!item && typeof item === \"object\" && !Array.isArray(item);\n}\n\nexport function isPlainObject(obj: unknown): obj is Record<string, unknown> {\n // 1. Rule out non-objects, null, and arrays\n if (typeof obj !== \"object\" || obj === null || Array.isArray(obj)) {\n return false;\n }\n\n // 2. Get the object's direct prototype\n const proto = Object.getPrototypeOf(obj);\n\n // 3. A plain object's direct prototype is Object.prototype\n return proto === Object.prototype;\n}\n\nexport function mergeDeep<T extends object, U extends object>(\n target: T,\n source: U,\n ignoreUndefined = false\n): T & U {\n // If target is not a true object (e.g., null, array, primitive), return target itself.\n if (!isObject(target)) {\n return target as T & U;\n }\n\n // Create a shallow copy of the target to avoid modifying the original object.\n const output = { ...target };\n\n // If source is not a true object, there's nothing to merge from it.\n // Return the shallow copy of target.\n if (!isObject(source)) {\n return output as T & U;\n }\n\n // Iterate over keys in the source object.\n for (const key in source) {\n if (key === \"__proto__\" || key === \"constructor\" || key === \"prototype\") {\n continue;\n }\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n const sourceValue = source[key];\n const outputValue = (output as Record<string, unknown>)[key]; // Current value in our merged object (originating from target)\n\n // Skip if source value is undefined and ignoreUndefined is true.\n // This handles both not adding new undefined properties and not overwriting existing properties with undefined.\n if (ignoreUndefined && sourceValue === undefined) {\n continue;\n }\n\n if (sourceValue instanceof Date) {\n // If source value is a Date, create a new Date instance.\n (output as Record<string, unknown>)[key] = new Date(sourceValue.getTime());\n } else if (Array.isArray(sourceValue)) {\n if (Array.isArray(outputValue)) {\n // If the array contains primitives or class instances (non-plain objects),\n // overwrite the array entirely instead of doing element-wise merging.\n const hasPlainObjects = sourceValue.some(isPlainObject) || outputValue.some(isPlainObject);\n if (!hasPlainObjects) {\n (output as Record<string, unknown>)[key] = [...sourceValue];\n } else {\n const newArray = [];\n const maxLength = Math.max(outputValue.length, sourceValue.length);\n for (let i = 0; i < maxLength; i++) {\n const sourceItem = sourceValue[i];\n const targetItem = outputValue[i];\n\n if (i >= sourceValue.length) { // source is shorter\n newArray[i] = targetItem;\n } else if (i >= outputValue.length) { // target is shorter\n newArray[i] = sourceItem;\n } else if (sourceItem === null) {\n newArray[i] = targetItem;\n } else if (isPlainObject(sourceItem) && isPlainObject(targetItem)) {\n // Only recursively merge plain objects, preserve class instances\n newArray[i] = mergeDeep(targetItem, sourceItem, ignoreUndefined);\n } else {\n // For class instances and primitives, use source directly\n newArray[i] = sourceItem;\n }\n }\n (output as Record<string, unknown>)[key] = newArray;\n }\n } else {\n // If output's value (from target) is not an array,\n // overwrite with a shallow copy of the source array.\n (output as Record<string, unknown>)[key] = [...sourceValue];\n }\n } else if (isPlainObject(sourceValue)) {\n // If source value is a plain object (not a class instance like EntityReference, GeoPoint, etc.):\n if (isPlainObject(outputValue)) {\n // If the corresponding value in output (from target) is also a plain object, recurse.\n // Ensure the ignoreUndefined flag is passed down.\n (output as Record<string, unknown>)[key] = mergeDeep(outputValue as Record<string, unknown>, sourceValue, ignoreUndefined);\n } else {\n // If output's value (from target) is not a plain object (e.g., null, primitive, class instance, or key didn't exist in original target),\n // overwrite with the source object.\n (output as Record<string, unknown>)[key] = sourceValue;\n }\n } else if (isObject(sourceValue)) {\n // If source value is a class instance (not a plain object), use it directly to preserve prototype\n (output as Record<string, unknown>)[key] = sourceValue;\n } else {\n // If source value is a primitive, null, or undefined (and not ignored).\n (output as Record<string, unknown>)[key] = sourceValue;\n }\n }\n }\n\n return output as T & U;\n}\n\nexport function getValueInPath(o: object | undefined, path: string): unknown {\n if (!o) return undefined;\n if (typeof o === \"object\") {\n if (path in o) {\n return (o as Record<string, unknown>)[path];\n }\n if (path.includes(\".\") || path.includes(\"[\")) {\n let pathSegments = path.split(/[.[]/);\n if (path.includes(\"[\")) {\n pathSegments = pathSegments.map(segment => segment.replace(\"]\", \"\"));\n }\n const firstSegment = pathSegments[0];\n const isArrayAndIndexExists = Array.isArray((o as Record<string, unknown>)[firstSegment]) && !isNaN(parseInt(pathSegments[1]));\n const nextObject = isArrayAndIndexExists\n ? ((o as Record<string, unknown>)[firstSegment] as unknown[])[parseInt(pathSegments[1])]\n : (o as Record<string, unknown>)[firstSegment];\n\n const nextPath = pathSegments.slice(isArrayAndIndexExists ? 2 : 1).join(\".\");\n if (nextPath === \"\")\n return nextObject;\n return getValueInPath(nextObject as object | undefined, nextPath);\n }\n }\n return undefined;\n}\n\nexport function removeInPath(o: object, path: string): object | undefined {\n const res = clone(o) as Record<string, unknown>;\n let current = res;\n const parts = path.split(\".\");\n const last = parts.pop();\n for (const part of parts) {\n if (part in current && current[part] !== null && typeof current[part] === \"object\") {\n current[part] = clone(current[part]) as Record<string, unknown>;\n current = current[part] as Record<string, unknown>;\n } else {\n return res;\n }\n }\n if (last && current && typeof current === \"object\") {\n delete current[last];\n }\n return res;\n}\n\nexport function removeFunctions(o: unknown): unknown {\n if (o === undefined) return undefined;\n if (o === null) return null;\n if (typeof o === \"object\") {\n // Handle arrays first - map over them recursively\n if (Array.isArray(o)) {\n return o.map(v => removeFunctions(v));\n }\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(o)) {\n return o;\n }\n return Object.entries(o)\n .filter(([_, value]) => typeof value !== \"function\")\n .map(([key, value]) => {\n if (Array.isArray(value)) {\n return { [key]: value.map(v => removeFunctions(v)) };\n } else if (typeof value === \"object\") {\n return { [key]: removeFunctions(value) };\n } else return { [key]: value };\n })\n .reduce((a, b) => ({ ...a,\n...b }), {});\n }\n return o;\n}\n\nexport function getHashValue<T>(v: T): string | null {\n if (!v) return null;\n if (typeof v === \"object\" && v !== null) {\n if (\"id\" in v)\n return String((v as Record<string, unknown>).id);\n else if (v instanceof Date)\n return v.toLocaleString();\n else if (v instanceof GeoPoint)\n return hash(v as Record<string, unknown>);\n }\n return hash(v as object, { ignoreUnknown: true });\n}\n\nexport function removeUndefined(value: unknown, removeEmptyStrings?: boolean): unknown {\n if (typeof value === \"function\") {\n return value;\n }\n if (Array.isArray(value)) {\n return value.map((v: unknown) => removeUndefined(v, removeEmptyStrings));\n }\n if (typeof value === \"object\") {\n if (value === null)\n return value;\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(value)) {\n return value;\n }\n const res: Record<string, unknown> = {};\n Object.keys(value).forEach((key) => {\n if (!isEmptyObject(value as object)) {\n const childRes = removeUndefined((value as Record<string, unknown>)[key], removeEmptyStrings);\n const isString = typeof childRes === \"string\";\n const shouldKeepIfString = !removeEmptyStrings || (removeEmptyStrings && !isString) || (removeEmptyStrings && isString && childRes !== \"\");\n if (childRes !== undefined && !isEmptyObject(childRes as object) && shouldKeepIfString)\n res[key] = childRes;\n }\n });\n return res;\n }\n return value;\n}\n\nexport function removeNulls(value: unknown): unknown {\n if (typeof value === \"function\") {\n return value;\n }\n if (Array.isArray(value)) {\n return value.map((v: unknown) => removeNulls(v));\n }\n if (typeof value === \"object\") {\n if (value === null)\n return value;\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(value)) {\n return value;\n }\n const res: Record<string, unknown> = {};\n const obj = value as Record<string, unknown>;\n Object.keys(obj).forEach((key) => {\n if (obj[key] !== null)\n res[key] = removeNulls(obj[key]);\n });\n return res;\n }\n return value;\n}\n\nexport function isEmptyObject(obj: object) {\n return obj &&\n Object.getPrototypeOf(obj) === Object.prototype &&\n Object.keys(obj).length === 0\n}\n\nexport function removePropsIfExisting(source: Record<string, unknown> | unknown[], comparison: Record<string, unknown> | unknown[]) {\n const isObject = (val: unknown): val is Record<string, unknown> => typeof val === \"object\" && val !== null;\n const isArray = (val: unknown): val is unknown[] => Array.isArray(val);\n\n if (!isObject(source) || !isObject(comparison)) {\n return source;\n }\n\n const res = isArray(source) ? [...source] : { ...source };\n\n if (isArray(res)) {\n for (let i = res.length - 1; i >= 0; i--) {\n if (res[i] === comparison[i]) {\n res.splice(i, 1);\n } else if (isObject(res[i]) && isObject(comparison[i])) {\n res[i] = removePropsIfExisting(res[i] as unknown as Record<string, unknown>, (comparison as unknown as unknown[])[i] as Record<string, unknown>);\n }\n }\n } else {\n Object.keys(comparison).forEach(key => {\n if (key in res) {\n if (isObject(res[key]) && isObject(comparison[key])) {\n res[key] = removePropsIfExisting(res[key], comparison[key]);\n } else if (res[key] === comparison[key]) {\n delete res[key];\n }\n }\n });\n }\n\n return res;\n}\n","export function toArray<T>(input?: T | T[]): T[] {\n return Array.isArray(input) ? input : (input ? [input] : []);\n}\n","export const defaultDateFormat = \"MMMM dd, yyyy, HH:mm:ss\";\n","export function hashString(str: string): number {\n if (!str) return 0;\n let hash = 0;\n let i;\n let chr;\n for (i = 0; i < str.length; i++) {\n chr = str.charCodeAt(i);\n hash = ((hash << 5) - hash) + chr;\n hash |= 0; // Convert to 32bit integer\n }\n return Math.abs(hash);\n}\n","export function serializeRegExp(input: RegExp): string {\n if (!input) return \"\";\n // const fragments = input.toString().match(/\\/(.*?)\\/([a-z]*)?$/i);\n // if (fragments) {\n // if (fragments[2])\n // return input.toString();\n // return fragments[1];\n // }\n return input.toString();\n}\n\n/**\n * Get a RegExp out of a serialized string\n * @param input\n */\nexport function hydrateRegExp(input?: string): RegExp | undefined {\n if (!input) return undefined;\n const fragments = input.match(/\\/(.*?)\\/([a-z]*)?$/i);\n if (fragments) {\n return new RegExp(fragments[1], fragments[2] || \"\");\n } else {\n return new RegExp(input, \"\");\n }\n}\n\nexport function isValidRegExp(input: string): boolean {\n const fullRegexp = input.match(/\\/((?![*+?])(?:[^\\r\\n[/\\\\]|\\\\.|\\[(?:[^\\r\\n\\]\\\\]|\\\\.)*])+)\\/((?:g(?:im?|mi?)?|i(?:gm?|mg?)?|m(?:gi?|ig?)?)?)/);\n if (fullRegexp)\n return true;\n const simpleRegexp = input.match(/((?![*+?])(?:[^\\r\\n[/\\\\]|\\\\.|\\[(?:[^\\r\\n\\]\\\\]|\\\\.)*])+)/);\n return !!simpleRegexp;\n}\n","export function flattenObject(obj: Record<string, unknown>, parentKey = \"\") {\n if (!obj) return obj;\n return Object.keys(obj).reduce((flatObj, key) => {\n const newKey = parentKey ? `${parentKey}.${key}` : key;\n\n if (typeof obj[key] === \"object\" && obj[key] !== null) {\n if (Array.isArray(obj[key])) {\n obj[key].forEach((item: unknown, index: number) => {\n if (typeof item === \"object\" && item !== null) {\n Object.assign(flatObj, flattenObject(item as Record<string, unknown>, `${newKey}[${index}]`));\n } else {\n flatObj[`${newKey}[${index}]`] = item;\n }\n });\n } else {\n Object.assign(flatObj, flattenObject(obj[key] as Record<string, unknown>, newKey));\n }\n } else {\n flatObj[newKey] = obj[key];\n }\n\n return flatObj;\n }, {} as { [key: string]: unknown });\n}\n\n\n// map from nested property key like \"a.b.c\" to the maximum array count found in a list of objects for that array\nexport type ArrayValuesCount = Record<string, number>;\n\nexport function getArrayValuesCount(array: Record<string, unknown>[]): ArrayValuesCount {\n return array.reduce((acc: ArrayValuesCount, obj: Record<string, unknown>) => {\n Object.entries(obj).forEach(([key, value]) => {\n // proceed only if value is an array\n if (Array.isArray(value)) {\n acc[key] = Math.max(acc[key] || 0, value.length);\n }\n\n // handle nested object\n if (typeof value === \"object\" && value !== null) {\n const nested = getArrayValuesCount([value as Record<string, unknown>]);\n Object.entries(nested).forEach(([nestedKey, nestedCount]) => {\n const compoundKey = `${key}.${nestedKey}`;\n acc[compoundKey] = Math.max(acc[compoundKey] || 0, nestedCount);\n });\n }\n });\n return acc;\n }, {});\n}\n","/**\n * Returns the plural of an English word.\n *\n * @param {string} word\n * @param {number} [amount]\n * @returns {string}\n */\nexport function plural(word: string, amount?: number): string {\n if (amount !== undefined && amount === 1) {\n return word\n }\n const plurals: { [key: string]: string } = {\n \"(quiz)$\": \"$1zes\",\n \"^(ox)$\": \"$1en\",\n \"([m|l])ouse$\": \"$1ice\",\n \"(matr|vert|ind)ix|ex$\": \"$1ices\",\n \"(x|ch|ss|sh)$\": \"$1es\",\n \"([^aeiouy]|qu)y$\": \"$1ies\",\n \"(hive)$\": \"$1s\",\n \"(?:([^f])fe|([lr])f)$\": \"$1$2ves\",\n \"(shea|lea|loa|thie)f$\": \"$1ves\",\n sis$: \"ses\",\n \"([ti])um$\": \"$1a\",\n \"(tomat|potat|ech|her|vet)o$\": \"$1oes\",\n \"(bu)s$\": \"$1ses\",\n \"(alias)$\": \"$1es\",\n \"(octop)us$\": \"$1i\",\n \"(ax|test)is$\": \"$1es\",\n \"(us)$\": \"$1es\",\n \"([^s]+)$\": \"$1s\"\n }\n const irregular: { [key: string]: string } = {\n move: \"moves\",\n foot: \"feet\",\n goose: \"geese\",\n sex: \"sexes\",\n child: \"children\",\n man: \"men\",\n tooth: \"teeth\",\n person: \"people\"\n }\n const uncountable: string[] = [\n \"sheep\",\n \"fish\",\n \"deer\",\n \"moose\",\n \"series\",\n \"species\",\n \"money\",\n \"rice\",\n \"information\",\n \"equipment\",\n \"bison\",\n \"cod\",\n \"offspring\",\n \"pike\",\n \"salmon\",\n \"shrimp\",\n \"swine\",\n \"trout\",\n \"aircraft\",\n \"hovercraft\",\n \"spacecraft\",\n \"sugar\",\n \"tuna\",\n \"you\",\n \"wood\"\n ]\n // save some time in the case that singular and plural are the same\n if (uncountable.indexOf(word.toLowerCase()) >= 0) {\n return word;\n }\n // check for irregular forms\n for (const w in irregular) {\n const pattern = new RegExp(`${w}$`, \"i\")\n const replace = irregular[w]\n if (pattern.test(word)) {\n return word.replace(pattern, replace);\n }\n }\n // check for matches using regular expressions\n for (const reg in plurals) {\n const pattern = new RegExp(reg, \"i\")\n if (pattern.test(word)) {\n return word.replace(pattern, plurals[reg])\n }\n }\n return word;\n}\n\n/**\n * Returns the singular of an English word.\n *\n * @param {string} word\n * @param {number} [amount]\n * @returns {string}\n */\nexport function singular(word: string, amount?: number): string {\n if (amount !== undefined && amount !== 1) {\n return word;\n }\n const singulars: { [key: string]: string } = {\n \"(quiz)zes$\": \"$1\",\n \"(matr)ices$\": \"$1ix\",\n \"(vert|ind)ices$\": \"$1ex\",\n \"^(ox)en$\": \"$1\",\n \"(alias)es$\": \"$1\",\n \"(octop|vir)i$\": \"$1us\",\n \"(cris|ax|test)es$\": \"$1is\",\n \"(shoe)s$\": \"$1\",\n \"(o)es$\": \"$1\",\n \"(bus)es$\": \"$1\",\n \"([m|l])ice$\": \"$1ouse\",\n \"(x|ch|ss|sh)es$\": \"$1\",\n \"(m)ovies$\": \"$1ovie\",\n \"(s)eries$\": \"$1eries\",\n \"([^aeiouy]|qu)ies$\": \"$1y\",\n \"([lr])ves$\": \"$1f\",\n \"(tive)s$\": \"$1\",\n \"(hive)s$\": \"$1\",\n \"(li|wi|kni)ves$\": \"$1fe\",\n \"(shea|loa|lea|thie)ves$\": \"$1f\",\n \"(^analy)ses$\": \"$1sis\",\n \"((a)naly|(b)a|(d)iagno|(p)arenthe|(p)rogno|(s)ynop|(t)he)ses$\": \"$1$2sis\",\n \"([ti])a$\": \"$1um\",\n \"(n)ews$\": \"$1ews\",\n \"(h|bl)ouses$\": \"$1ouse\",\n \"(corpse)s$\": \"$1\",\n \"(us)es$\": \"$1\",\n s$: \"\"\n }\n const irregular: { [key: string]: string } = {\n move: \"moves\",\n foot: \"feet\",\n goose: \"geese\",\n sex: \"sexes\",\n child: \"children\",\n man: \"men\",\n tooth: \"teeth\",\n person: \"people\"\n }\n const uncountable: string[] = [\n \"sheep\",\n \"fish\",\n \"deer\",\n \"moose\",\n \"series\",\n \"species\",\n \"money\",\n \"rice\",\n \"information\",\n \"equipment\",\n \"bison\",\n \"cod\",\n \"offspring\",\n \"pike\",\n \"salmon\",\n \"shrimp\",\n \"swine\",\n \"trout\",\n \"aircraft\",\n \"hovercraft\",\n \"spacecraft\",\n \"sugar\",\n \"tuna\",\n \"you\",\n \"wood\"\n ]\n // save some time in the case that singular and plural are the same\n if (uncountable.indexOf(word.toLowerCase()) >= 0) {\n return word;\n }\n // check for irregular forms\n for (const w in irregular) {\n const pattern = new RegExp(`${irregular[w]}$`, \"i\");\n if (pattern.test(word)) {\n return word.replace(pattern, w);\n }\n }\n // check for matches using regular expressions\n for (const reg in singulars) {\n const pattern = new RegExp(reg, \"i\");\n if (pattern.test(word)) {\n return word.replace(pattern, singulars[reg]);\n }\n }\n return word;\n}\n","import { toSnakeCase } from \"./strings\";\n\n/**\n * Generates a foreign key column name from a given string, typically a collection slug or name.\n * It converts the name to snake_case, attempts to singularize it by removing a trailing 's'\n * (a common convention for collection names), and appends '_id'.\n *\n * @param name The base name to convert to a foreign key.\n * @returns A foreign key name in the format 'singular_name_id'.\n *\n * @example\n * // returns \"user_id\"\n * generateForeignKeyName(\"users\")\n *\n * @example\n * // returns \"post_id\"\n * generateForeignKeyName(\"posts\")\n *\n * @example\n * // returns \"product_id\"\n * generateForeignKeyName(\"Product\")\n *\n */\nexport function generateForeignKeyName(name: string): string {\n const snakeCaseName = toSnakeCase(name);\n // A simple heuristic to singularize a plural name, which is a common convention.\n const singularName = snakeCaseName.endsWith(\"s\") ? snakeCaseName.slice(0, -1) : snakeCaseName;\n return `${singularName}_id`;\n}\n\n","\n\nexport function isDefaultFieldConfigId(id: string): boolean {\n return [\"text_field\",\n \"multiline\",\n \"markdown\",\n \"url\",\n \"email\",\n \"switch\",\n \"select\",\n \"multi_select\",\n \"number_input\",\n \"number_select\",\n \"multi_number_select\",\n \"file_upload\",\n \"multi_file_upload\",\n \"reference_as_string\",\n \"reference\",\n \"multi_references\",\n \"relation\",\n \"date_time\",\n \"group\",\n \"key_value\",\n \"repeat\",\n \"custom_array\",\n \"block\"\n ].includes(id);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAAA,IAAM,gBAAgB;CAEtB,IAAa,eAAe,QAAiB;EACzC,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU,OAAO;EAC5C,MAAM,mBAAmB,IAAI,MAAM,aAAa;EAChD,IAAI,CAAC,kBAAkB,OAAO;EAC9B,OAAO,iBACF,KAAI,MAAK,EAAE,YAAY,CAAC,EACxB,KAAK,GAAG;CACjB;CAEA,IAAM,iBAAiB;CAEvB,IAAa,eAAe,QAAiB;EACzC,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU,OAAO;EAC5C,MAAM,mBAAmB,IAAI,MAAM,cAAc;EACjD,IAAI,CAAC,kBAAkB,OAAO;EAC9B,OAAO,iBACF,KAAI,MAAK,EAAE,YAAY,CAAC,EACxB,KAAK,GAAG;CACjB;CAEA,SAAgB,UAAU,KAAqB;EAC3C,IAAI,CAAC,KAAK,OAAO;EACjB,IAAI,IAAI,WAAW,GAAG,OAAO,IAAI,YAAY;EAG7C,MAAM,QAAQ,IAAI,MAAM,QAAQ,EAAE,OAAO,OAAO;EAEhD,IAAI,MAAM,WAAW,GAAG,OAAO;EAG/B,OAAO,MAAM,GAAG,YAAY,IAExB,MAAM,MAAM,CAAC,EACR,KAAI,SAAQ,KAAK,OAAO,CAAC,EAAE,YAAY,IAAI,KAAK,UAAU,CAAC,EAAE,YAAY,CAAC,EAC1E,KAAK,EAAE;CACpB;CAEA,SAAgB,aAAa,YAAY,GAAG;EACxC,OAAO,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,IAAI,SAAS;CAC5D;CAEA,SAAgB,cAAc;EAC1B,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,QAAQ,EAAE,SAAS,EAAE;CAC3D;CAEA,SAAgB,QAAQ,MAAe,YAAY,KAAK,YAAY,MAAM;EACtE,IAAI,CAAC,MAAM,OAAO;EAClB,MAAM,OAAO;EACb,MAAM,KAAK,4BAA4B,YAAY,YAAY,YAAY,YAAY,YAAY,YAAY;EAE/G,KAAK,IAAI,IAAI,GAAG,IAAI,IAAa,IAAI,GAAG,KACpC,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,OAAO,CAAC,GAAG,GAAG,GAAG,GAAG,OAAO,CAAC,CAAC;EAGrE,OAAO,KACF,SAAS,EACT,KAAK,EACL,QAAQ,cAAc,EAAE,EACxB,QAAQ,QAAQ,SAAS,EACzB,QAAQ,MAAM,SAAS,EACvB,QAAQ,cAAc,EAAE,EACxB,QAAQ,IAAI,OAAO,OAAO,YAAY,OAAO,YAAY,KAAK,GAAG,GAC9D,SAAS;EAEjB,OAAO,YACD,KAAK,YAAY,IACjB;CACV;CAEA,SAAgB,UAAU,MAAuB;EAC7C,IAAI,CAAC,MAAM,OAAO;EAClB,IAAI,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG,KAAK,CAAC,KAAK,SAAS,GAAG,GAE9D,OADe,KAAK,QAAQ,SAAS,GAC9B,EAAO,QAAQ,UAAU,SAAU,KAAK;GAC3C,OAAO,IAAI,OAAO,CAAC,EAAE,YAAY,IAAI,IAAI,UAAU,CAAC;EACxD,CAAC,EAAE,KAAK;OAER,OAAO,KAAK,KAAK;CAEzB;CAEA,SAAgB,mBAAmB,OAAe;EAC9C,IAAI,CAAC,OAAO,OAAO;EAEnB,IAAI,OAAO;EAKX,OAAO,KAAK,QAAQ,uCAAuC,WAAW;EAGtE,OAAO,KAAK,QAAQ,UAAU,GAAG;EAMjC,OAHU,KACL,KAAK,EACL,QAAQ,UAAU,SAAS,KAAK,YAAY,CAC1C;CACX;;;;CCjGA,IAAa,gBAAgB,UACzB,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW;;CAG7C,IAAa,cAAc,QACvB,OAAO,QAAQ;;CAGnB,IAAa,aAAa,QACtB,OAAO,KAAK,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,OAAO,GAAG;;CAIlD,IAAa,SAAS,QAA0B,QAAQ;;;;CAKxD,SAAgB,MACZ,KACA,KACA,KACA,IAAI,GACN;EACE,MAAM,OAAO,OAAO,GAAG;EACvB,OAAO,OAAO,IAAI,KAAK,QACnB,MAAO,IAAgC,KAAK;EAIhD,IAAI,MAAM,KAAK,UAAU,CAAC,KACtB,OAAO;EAGX,OAAO,QAAQ,KAAA,IAAY,MAAM;CACrC;CAEA,SAAgB,MAAS,KAAQ,MAAc,OAAmB;EAC9D,MAAM,MAAM,MAAM,GAAG;EACrB,IAAI,SAAkC;EACtC,IAAI,IAAI;EACR,MAAM,YAAY,OAAO,IAAI;EAE7B,OAAO,IAAI,UAAU,SAAS,GAAG,KAAK;GAClC,MAAM,cAAsB,UAAU;GACtC,MAAM,aAAa,MAAM,KAAgC,UAAU,MAAM,GAAG,IAAI,CAAC,CAAC;GAElF,IAAI,eAAe,SAAS,UAAU,KAAK,MAAM,QAAQ,UAAU,IAC/D,SAAS,OAAO,eAAe,MAAM,UAAU;QAC5C;IACH,MAAM,WAAmB,UAAU,IAAI;IACvC,SAAS,OAAO,eACX,UAAU,QAAQ,KAAK,OAAO,QAAQ,KAAK,IAAI,CAAC,IAAI,CAAC;GAC9D;EACJ;EAGA,KAAK,MAAM,IAAI,MAAiC,QAAQ,UAAU,QAAQ,OACtE,OAAO;EAGX,IAAI,UAAU,KAAA,GACV,OAAO,OAAO,UAAU;OAExB,OAAO,UAAU,MAAM;EAK3B,IAAI,MAAM,KAAK,UAAU,KAAA,GACrB,OAAO,IAAI,UAAU;EAGzB,OAAO;CACX;CAEA,SAAgB,MAAS,OAAa;EAClC,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,CAAC,GAAG,KAAK;OACb,IAAI,OAAO,UAAU,YAAY,UAAU,MAC9C,OAAO,EAAE,GAAG,MAAM;OAElB,OAAO;CAEf;;;;;;CAOA,SAAgB,UAAa,OAAa;EACtC,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;EAClD,IAAI,OAAO,UAAU,YAAY,OAAO;EACxC,IAAI,OAAO,UAAU,UAAU,OAAO;EAEtC,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAI,SAAQ,UAAU,IAAI,CAAC;EAI5C,IAAI,OAAO,eAAe,KAAK,MAAM,OAAO,WACxC,OAAO;EAGX,MAAM,SAAkC,CAAC;EACzC,KAAK,MAAM,OAAO,OAAO,KAAK,KAAK,GAC/B,OAAO,OAAO,UAAW,MAAkC,IAAI;EAEnE,OAAO;CACX;CAEA,SAAS,OAAO,OAA0B;EACtC,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO;EAEjC,OAAO,MAAM,QAAQ,aAAa,KAAK,EAAE,QAAQ,OAAO,EAAE,EAAE,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;CAC5F;CAGA,IAAa,QAA4H,KAAQ,GAAG,UAAuB,EACvK,GAAG,KAAK,QAAiC,KAAK,SAAS;EACnD,GAAG;GACF,MAAgB,IAAI;CACzB,IAAI,CAAC,CAAC,EACV;CAEA,SAAgB,SAAS,MAAgD;EACrE,OAAO,CAAC,CAAC,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI;CACpE;CAEA,SAAgB,cAAc,KAA8C;EAExE,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAC5D,OAAO;EAOX,OAHc,OAAO,eAAe,GAG7B,MAAU,OAAO;CAC5B;CAEA,SAAgB,UACZ,QACA,QACA,kBAAkB,OACb;EAEL,IAAI,CAAC,SAAS,MAAM,GAChB,OAAO;EAIX,MAAM,SAAS,EAAE,GAAG,OAAO;EAI3B,IAAI,CAAC,SAAS,MAAM,GAChB,OAAO;EAIX,KAAK,MAAM,OAAO,QAAQ;GACtB,IAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,aACxD;GAEJ,IAAI,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;IACnD,MAAM,cAAc,OAAO;IAC3B,MAAM,cAAe,OAAmC;IAIxD,IAAI,mBAAmB,gBAAgB,KAAA,GACnC;IAGJ,IAAI,uBAAuB,MAEvB,OAAoC,OAAO,IAAI,KAAK,YAAY,QAAQ,CAAC;SACtE,IAAI,MAAM,QAAQ,WAAW,GAChC,IAAI,MAAM,QAAQ,WAAW,GAIzB,IAAI,EADoB,YAAY,KAAK,aAAa,KAAK,YAAY,KAAK,aAAa,IAErF,OAAoC,OAAO,CAAC,GAAG,WAAW;SACvD;KACH,MAAM,WAAW,CAAC;KAClB,MAAM,YAAY,KAAK,IAAI,YAAY,QAAQ,YAAY,MAAM;KACjE,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;MAChC,MAAM,aAAa,YAAY;MAC/B,MAAM,aAAa,YAAY;MAE/B,IAAI,KAAK,YAAY,QACjB,SAAS,KAAK;WACX,IAAI,KAAK,YAAY,QACxB,SAAS,KAAK;WACX,IAAI,eAAe,MACtB,SAAS,KAAK;WACX,IAAI,cAAc,UAAU,KAAK,cAAc,UAAU,GAE5D,SAAS,KAAK,UAAU,YAAY,YAAY,eAAe;WAG/D,SAAS,KAAK;KAEtB;KACA,OAAoC,OAAO;IAC/C;SAIA,OAAoC,OAAO,CAAC,GAAG,WAAW;SAE3D,IAAI,cAAc,WAAW,GAEhC,IAAI,cAAc,WAAW,GAGzB,OAAoC,OAAO,UAAU,aAAwC,aAAa,eAAe;SAIzH,OAAoC,OAAO;SAE5C,IAAI,SAAS,WAAW,GAE3B,OAAoC,OAAO;SAG3C,OAAoC,OAAO;GAEnD;EACJ;EAEA,OAAO;CACX;CAEA,SAAgB,eAAe,GAAuB,MAAuB;EACzE,IAAI,CAAC,GAAG,OAAO,KAAA;EACf,IAAI,OAAO,MAAM,UAAU;GACvB,IAAI,QAAQ,GACR,OAAQ,EAA8B;GAE1C,IAAI,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG,GAAG;IAC1C,IAAI,eAAe,KAAK,MAAM,MAAM;IACpC,IAAI,KAAK,SAAS,GAAG,GACjB,eAAe,aAAa,KAAI,YAAW,QAAQ,QAAQ,KAAK,EAAE,CAAC;IAEvE,MAAM,eAAe,aAAa;IAClC,MAAM,wBAAwB,MAAM,QAAS,EAA8B,aAAa,KAAK,CAAC,MAAM,SAAS,aAAa,EAAE,CAAC;IAC7H,MAAM,aAAa,wBACX,EAA8B,cAA4B,SAAS,aAAa,EAAE,KACnF,EAA8B;IAErC,MAAM,WAAW,aAAa,MAAM,wBAAwB,IAAI,CAAC,EAAE,KAAK,GAAG;IAC3E,IAAI,aAAa,IACb,OAAO;IACX,OAAO,eAAe,YAAkC,QAAQ;GACpE;EACJ;CAEJ;CAEA,SAAgB,aAAa,GAAW,MAAkC;EACtE,MAAM,MAAM,MAAM,CAAC;EACnB,IAAI,UAAU;EACd,MAAM,QAAQ,KAAK,MAAM,GAAG;EAC5B,MAAM,OAAO,MAAM,IAAI;EACvB,KAAK,MAAM,QAAQ,OACf,IAAI,QAAQ,WAAW,QAAQ,UAAU,QAAQ,OAAO,QAAQ,UAAU,UAAU;GAChF,QAAQ,QAAQ,MAAM,QAAQ,KAAK;GACnC,UAAU,QAAQ;EACtB,OACI,OAAO;EAGf,IAAI,QAAQ,WAAW,OAAO,YAAY,UACtC,OAAO,QAAQ;EAEnB,OAAO;CACX;CAEA,SAAgB,gBAAgB,GAAqB;EACjD,IAAI,MAAM,KAAA,GAAW,OAAO,KAAA;EAC5B,IAAI,MAAM,MAAM,OAAO;EACvB,IAAI,OAAO,MAAM,UAAU;GAEvB,IAAI,MAAM,QAAQ,CAAC,GACf,OAAO,EAAE,KAAI,MAAK,gBAAgB,CAAC,CAAC;GAGxC,IAAI,CAAC,cAAc,CAAC,GAChB,OAAO;GAEX,OAAO,OAAO,QAAQ,CAAC,EAClB,QAAQ,CAAC,GAAG,WAAW,OAAO,UAAU,UAAU,EAClD,KAAK,CAAC,KAAK,WAAW;IACnB,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,GAAG,MAAM,MAAM,KAAI,MAAK,gBAAgB,CAAC,CAAC,EAAE;SAChD,IAAI,OAAO,UAAU,UACxB,OAAO,GAAG,MAAM,gBAAgB,KAAK,EAAE;SACpC,OAAO,GAAG,MAAM,MAAM;GACjC,CAAC,EACA,QAAQ,GAAG,OAAO;IAAE,GAAG;IACpC,GAAG;GAAE,IAAI,CAAC,CAAC;EACP;EACA,OAAO;CACX;CAEA,SAAgB,aAAgB,GAAqB;EACjD,IAAI,CAAC,GAAG,OAAO;EACf,IAAI,OAAO,MAAM,YAAY,MAAM;OAC3B,QAAQ,GACR,OAAO,OAAQ,EAA8B,EAAE;QAC9C,IAAI,aAAa,MAClB,OAAO,EAAE,eAAe;QACvB,IAAI,aAAa,iBAAA,UAClB,QAAA,GAAA,YAAA,SAAY,CAA4B;EAAA;EAEhD,QAAA,GAAA,YAAA,SAAY,GAAa,EAAE,eAAe,KAAK,CAAC;CACpD;CAEA,SAAgB,gBAAgB,OAAgB,oBAAuC;EACnF,IAAI,OAAO,UAAU,YACjB,OAAO;EAEX,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAK,MAAe,gBAAgB,GAAG,kBAAkB,CAAC;EAE3E,IAAI,OAAO,UAAU,UAAU;GAC3B,IAAI,UAAU,MACV,OAAO;GAEX,IAAI,CAAC,cAAc,KAAK,GACpB,OAAO;GAEX,MAAM,MAA+B,CAAC;GACtC,OAAO,KAAK,KAAK,EAAE,SAAS,QAAQ;IAChC,IAAI,CAAC,cAAc,KAAe,GAAG;KACjC,MAAM,WAAW,gBAAiB,MAAkC,MAAM,kBAAkB;KAC5F,MAAM,WAAW,OAAO,aAAa;KACrC,MAAM,qBAAqB,CAAC,sBAAuB,sBAAsB,CAAC,YAAc,sBAAsB,YAAY,aAAa;KACvI,IAAI,aAAa,KAAA,KAAa,CAAC,cAAc,QAAkB,KAAK,oBAChE,IAAI,OAAO;IACnB;GACJ,CAAC;GACD,OAAO;EACX;EACA,OAAO;CACX;CAEA,SAAgB,YAAY,OAAyB;EACjD,IAAI,OAAO,UAAU,YACjB,OAAO;EAEX,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAK,MAAe,YAAY,CAAC,CAAC;EAEnD,IAAI,OAAO,UAAU,UAAU;GAC3B,IAAI,UAAU,MACV,OAAO;GAEX,IAAI,CAAC,cAAc,KAAK,GACpB,OAAO;GAEX,MAAM,MAA+B,CAAC;GACtC,MAAM,MAAM;GACZ,OAAO,KAAK,GAAG,EAAE,SAAS,QAAQ;IAC9B,IAAI,IAAI,SAAS,MACb,IAAI,OAAO,YAAY,IAAI,IAAI;GACvC,CAAC;GACD,OAAO;EACX;EACA,OAAO;CACX;CAEA,SAAgB,cAAc,KAAa;EACvC,OAAO,OACH,OAAO,eAAe,GAAG,MAAM,OAAO,aACtC,OAAO,KAAK,GAAG,EAAE,WAAW;CACpC;CAEA,SAAgB,sBAAsB,QAA6C,YAAiD;EAChI,MAAM,YAAY,QAAiD,OAAO,QAAQ,YAAY,QAAQ;EACtG,MAAM,WAAW,QAAmC,MAAM,QAAQ,GAAG;EAErE,IAAI,CAAC,SAAS,MAAM,KAAK,CAAC,SAAS,UAAU,GACzC,OAAO;EAGX,MAAM,MAAM,QAAQ,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,EAAE,GAAG,OAAO;EAExD,IAAI,QAAQ,GAAG;QACN,IAAI,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KACjC,IAAI,IAAI,OAAO,WAAW,IACtB,IAAI,OAAO,GAAG,CAAC;QACZ,IAAI,SAAS,IAAI,EAAE,KAAK,SAAS,WAAW,EAAE,GACjD,IAAI,KAAK,sBAAsB,IAAI,IAA2C,WAAoC,EAA6B;EAAA,OAIvJ,OAAO,KAAK,UAAU,EAAE,SAAQ,QAAO;GACnC,IAAI,OAAO;QACH,SAAS,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,GAC9C,IAAI,OAAO,sBAAsB,IAAI,MAAM,WAAW,IAAI;SACvD,IAAI,IAAI,SAAS,WAAW,MAC/B,OAAO,IAAI;GAAA;EAGvB,CAAC;EAGL,OAAO;CACX;;;CCnaA,SAAgB,QAAW,OAAsB;EAC7C,OAAO,MAAM,QAAQ,KAAK,IAAI,QAAS,QAAQ,CAAC,KAAK,IAAI,CAAC;CAC9D;;;CCFA,IAAa,oBAAoB;;;CCAjC,SAAgB,WAAW,KAAqB;EAC5C,IAAI,CAAC,KAAK,OAAO;EACjB,IAAI,OAAO;EACX,IAAI;EACJ,IAAI;EACJ,KAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GAC7B,MAAM,IAAI,WAAW,CAAC;GACtB,QAAS,QAAQ,KAAK,OAAQ;GAC9B,QAAQ;EACZ;EACA,OAAO,KAAK,IAAI,IAAI;CACxB;;;CCXA,SAAgB,gBAAgB,OAAuB;EACnD,IAAI,CAAC,OAAO,OAAO;EAOnB,OAAO,MAAM,SAAS;CAC1B;;;;;CAMA,SAAgB,cAAc,OAAoC;EAC9D,IAAI,CAAC,OAAO,OAAO,KAAA;EACnB,MAAM,YAAY,MAAM,MAAM,sBAAsB;EACpD,IAAI,WACA,OAAO,IAAI,OAAO,UAAU,IAAI,UAAU,MAAM,EAAE;OAElD,OAAO,IAAI,OAAO,OAAO,EAAE;CAEnC;CAEA,SAAgB,cAAc,OAAwB;EAElD,IADmB,MAAM,MAAM,6GAC3B,GACA,OAAO;EAEX,OAAO,CAAC,CADa,MAAM,MAAM,yDACxB;CACb;;;CC/BA,SAAgB,cAAc,KAA8B,YAAY,IAAI;EACxE,IAAI,CAAC,KAAK,OAAO;EACjB,OAAO,OAAO,KAAK,GAAG,EAAE,QAAQ,SAAS,QAAQ;GAC7C,MAAM,SAAS,YAAY,GAAG,UAAU,GAAG,QAAQ;GAEnD,IAAI,OAAO,IAAI,SAAS,YAAY,IAAI,SAAS,MAC7C,IAAI,MAAM,QAAQ,IAAI,IAAI,GACtB,IAAI,KAAK,SAAS,MAAe,UAAkB;IAC/C,IAAI,OAAO,SAAS,YAAY,SAAS,MACrC,OAAO,OAAO,SAAS,cAAc,MAAiC,GAAG,OAAO,GAAG,MAAM,EAAE,CAAC;SAE5F,QAAQ,GAAG,OAAO,GAAG,MAAM,MAAM;GAEzC,CAAC;QAED,OAAO,OAAO,SAAS,cAAc,IAAI,MAAiC,MAAM,CAAC;QAGrF,QAAQ,UAAU,IAAI;GAG1B,OAAO;EACX,GAAG,CAAC,CAA+B;CACvC;CAMA,SAAgB,oBAAoB,OAAoD;EACpF,OAAO,MAAM,QAAQ,KAAuB,QAAiC;GACzE,OAAO,QAAQ,GAAG,EAAE,SAAS,CAAC,KAAK,WAAW;IAE1C,IAAI,MAAM,QAAQ,KAAK,GACnB,IAAI,OAAO,KAAK,IAAI,IAAI,QAAQ,GAAG,MAAM,MAAM;IAInD,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM;KAC7C,MAAM,SAAS,oBAAoB,CAAC,KAAgC,CAAC;KACrE,OAAO,QAAQ,MAAM,EAAE,SAAS,CAAC,WAAW,iBAAiB;MACzD,MAAM,cAAc,GAAG,IAAI,GAAG;MAC9B,IAAI,eAAe,KAAK,IAAI,IAAI,gBAAgB,GAAG,WAAW;KAClE,CAAC;IACL;GACJ,CAAC;GACD,OAAO;EACX,GAAG,CAAC,CAAC;CACT;;;;;;;;;;CCzCA,SAAgB,OAAO,MAAc,QAAyB;EAC1D,IAAI,WAAW,KAAA,KAAa,WAAW,GACnC,OAAO;EAEX,MAAM,UAAqC;GACvC,WAAW;GACX,UAAU;GACV,gBAAgB;GAChB,yBAAyB;GACzB,iBAAiB;GACjB,oBAAoB;GACpB,WAAW;GACX,yBAAyB;GACzB,yBAAyB;GACzB,MAAM;GACN,aAAa;GACb,+BAA+B;GAC/B,UAAU;GACV,YAAY;GACZ,cAAc;GACd,gBAAgB;GAChB,SAAS;GACT,YAAY;EAChB;EACA,MAAM,YAAuC;GACzC,MAAM;GACN,MAAM;GACN,OAAO;GACP,KAAK;GACL,OAAO;GACP,KAAK;GACL,OAAO;GACP,QAAQ;EACZ;EA6BA,IAAI;GA3BA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EAGA,EAAY,QAAQ,KAAK,YAAY,CAAC,KAAK,GAC3C,OAAO;EAGX,KAAK,MAAM,KAAK,WAAW;GACvB,MAAM,UAAU,IAAI,OAAO,GAAG,EAAE,IAAI,GAAG;GACvC,MAAM,UAAU,UAAU;GAC1B,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,OAAO;EAE5C;EAEA,KAAK,MAAM,OAAO,SAAS;GACvB,MAAM,UAAU,IAAI,OAAO,KAAK,GAAG;GACnC,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,QAAQ,IAAI;EAEjD;EACA,OAAO;CACX;;;;;;;;CASA,SAAgB,SAAS,MAAc,QAAyB;EAC5D,IAAI,WAAW,KAAA,KAAa,WAAW,GACnC,OAAO;EAEX,MAAM,YAAuC;GACzC,cAAc;GACd,eAAe;GACf,mBAAmB;GACnB,YAAY;GACZ,cAAc;GACd,iBAAiB;GACjB,qBAAqB;GACrB,YAAY;GACZ,UAAU;GACV,YAAY;GACZ,eAAe;GACf,mBAAmB;GACnB,aAAa;GACb,aAAa;GACb,sBAAsB;GACtB,cAAc;GACd,YAAY;GACZ,YAAY;GACZ,mBAAmB;GACnB,2BAA2B;GAC3B,gBAAgB;GAChB,iEAAiE;GACjE,YAAY;GACZ,WAAW;GACX,gBAAgB;GAChB,cAAc;GACd,WAAW;GACX,IAAI;EACR;EACA,MAAM,YAAuC;GACzC,MAAM;GACN,MAAM;GACN,OAAO;GACP,KAAK;GACL,OAAO;GACP,KAAK;GACL,OAAO;GACP,QAAQ;EACZ;EA6BA,IAAI;GA3BA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EAGA,EAAY,QAAQ,KAAK,YAAY,CAAC,KAAK,GAC3C,OAAO;EAGX,KAAK,MAAM,KAAK,WAAW;GACvB,MAAM,UAAU,IAAI,OAAO,GAAG,UAAU,GAAG,IAAI,GAAG;GAClD,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,CAAC;EAEtC;EAEA,KAAK,MAAM,OAAO,WAAW;GACzB,MAAM,UAAU,IAAI,OAAO,KAAK,GAAG;GACnC,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,UAAU,IAAI;EAEnD;EACA,OAAO;CACX;;;;;;;;;;;;;;;;;;;;;;;;CCpKA,SAAgB,uBAAuB,MAAsB;EACzD,MAAM,gBAAgB,YAAY,IAAI;EAGtC,OAAO,GADc,cAAc,SAAS,GAAG,IAAI,cAAc,MAAM,GAAG,EAAE,IAAI,cACzD;CAC3B;;;CC1BA,SAAgB,uBAAuB,IAAqB;EACxD,OAAO;GAAC;GACJ;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACJ,EAAE,SAAS,EAAE;CACjB"}
|
|
1
|
+
{"version":3,"file":"index.umd.js","names":[],"sources":["../src/strings.ts","../src/objects.ts","../src/arrays.ts","../src/dates.ts","../src/hash.ts","../src/regexp.ts","../src/flatten_object.ts","../src/plurals.ts","../src/names.ts","../src/fields.ts"],"sourcesContent":["const tokenizeRegex = /[A-Z]{2,}(?=[A-Z][a-z]|\\b)|[A-Z]?[a-z]+|[0-9]+(?:[a-z](?![a-z]))?|[A-Z]/g;\n\nexport const toKebabCase = (str?: string) => {\n if (!str || typeof str !== \"string\") return \"\";\n const regExpMatchArray = str.match(tokenizeRegex);\n if (!regExpMatchArray) return \"\";\n return regExpMatchArray\n .map(x => x.toLowerCase())\n .join(\"-\");\n};\n\nconst snakeCaseRegex = tokenizeRegex;\n\nexport const toSnakeCase = (str?: string) => {\n if (!str || typeof str !== \"string\") return \"\";\n const regExpMatchArray = str.match(snakeCaseRegex);\n if (!regExpMatchArray) return \"\";\n return regExpMatchArray\n .map(x => x.toLowerCase())\n .join(\"_\");\n};\n\nexport function camelCase(str: string): string {\n if (!str) return \"\";\n if (str.length === 1) return str.toLowerCase();\n\n // Split by hyphens, underscores, or spaces and filter out empty strings\n const parts = str.split(/[-_ ]+/).filter(Boolean);\n\n if (parts.length === 0) return \"\";\n\n // Start with first part in lowercase\n return parts[0].toLowerCase() +\n // Transform remaining parts to have first letter uppercase\n parts.slice(1)\n .map(part => part.charAt(0).toUpperCase() + part.substring(1).toLowerCase())\n .join(\"\");\n}\n\nexport function randomString(strLength = 5) {\n return Math.random().toString(36).slice(2, 2 + strLength);\n}\n\nexport function randomColor() {\n return Math.floor(Math.random() * 16777215).toString(16);\n}\n\nexport function slugify(text?: string, separator = \"_\", lowercase = true) {\n if (!text) return \"\";\n const from = \"ãàáäâẽèéëêìíïîõòóöôùúüûñç·/_,:;-\"\n const to = `aaaaaeeeeeiiiiooooouuuunc${separator}${separator}${separator}${separator}${separator}${separator}${separator}`;\n\n for (let i = 0, l = from.length; i < l; i++) {\n text = text.replace(new RegExp(from.charAt(i), \"g\"), to.charAt(i));\n }\n\n text = text\n .toString() // Cast to string\n .trim() // Remove whitespace from both sides of a string\n .replace(/^\\s+|\\s+$/g, \"\")\n .replace(/\\s+/g, separator) // Replace spaces with separator\n .replace(/&/g, separator) // Replace & with separator\n .replace(/[^\\w\\\\-]+/g, \"\") // Remove all non-word chars\n .replace(new RegExp(\"\\\\\" + separator + \"\\\\\" + separator + \"+\", \"g\"),\n separator); // Replace multiple separators with single one\n\n return lowercase\n ? text.toLowerCase() // Convert the string to lowercase letters\n : text;\n}\n\nexport function unslugify(slug?: string): string {\n if (!slug) return \"\";\n if (slug.includes(\"-\") || slug.includes(\"_\") || !slug.includes(\" \")) {\n const result = slug.replace(/[-_]/g, \" \");\n return result.replace(/\\w\\S*/g, function (txt) {\n return txt.charAt(0).toUpperCase() + txt.substring(1);\n }).trim();\n } else {\n return slug.trim();\n }\n}\n\nexport function prettifyIdentifier(input: string) {\n if (!input) return \"\";\n\n let text = input;\n\n // 1. Handle camelCase and Acronyms\n // Group 1 ($1 $2): Lowercase followed by Uppercase (e.g., imageURL -> image URL)\n // Group 2 ($3 $4): Uppercase followed by Uppercase+lowercase (e.g., XMLParser -> XML Parser)\n text = text.replace(/([a-z])([A-Z])|([A-Z])([A-Z][a-z])/g, \"$1$3 $2$4\");\n\n // 2. Replace hyphens/underscores with spaces\n text = text.replace(/[_-]+/g, \" \");\n\n // 3. Capitalize first letter of each word (Title Case)\n const s = text\n .trim()\n .replace(/\\b\\w/g, (char) => char.toUpperCase());\n return s;\n}\n","import hash from \"object-hash\";\nimport { GeoPoint } from \"@rebasepro/types\";\n\n/** @private is the value an empty array? */\nexport const isEmptyArray = (value?: unknown) =>\n Array.isArray(value) && value.length === 0;\n\n/** @private is the given object a Function? */\nexport const isFunction = (obj: unknown): obj is (...args: unknown[]) => unknown =>\n typeof obj === \"function\";\n\n/** @private is the given object an integer? */\nexport const isInteger = (obj: unknown): boolean =>\n String(Math.floor(Number(obj))) === String(obj);\n\n/** @private is the given object a NaN? */\n\nexport const isNaN = (obj: unknown): boolean => obj !== obj;\n\n/**\n * Deeply get a value from an object via its path.\n */\nexport function getIn(\n obj: Record<string, unknown> | unknown[] | unknown,\n key: string | string[],\n def?: unknown,\n p = 0\n) {\n const path = toPath(key);\n while (obj && p < path.length) {\n obj = (obj as Record<string, unknown>)[path[p++]];\n }\n\n // check if path is not in the end\n if (p !== path.length && !obj) {\n return def;\n }\n\n return obj === undefined ? def : obj;\n}\n\nexport function setIn<T>(obj: T, path: string, value: unknown): T {\n const res = clone(obj) as Record<string, unknown>;\n let resVal: Record<string, unknown> = res;\n let i = 0;\n const pathArray = toPath(path);\n\n for (; i < pathArray.length - 1; i++) {\n const currentPath: string = pathArray[i];\n const currentObj = getIn(obj as Record<string, unknown>, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = clone(currentObj) as Record<string, unknown>;\n } else {\n const nextPath: string = pathArray[i + 1];\n resVal = resVal[currentPath] =\n (isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {}) as Record<string, unknown>;\n }\n }\n\n // Return original object if new value is the same as current\n if ((i === 0 ? obj as Record<string, unknown> : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n }\n\n // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res as T;\n}\n\nexport function clone<T>(value: T): T {\n if (Array.isArray(value)) {\n return [...value] as T;\n } else if (typeof value === \"object\" && value !== null) {\n return { ...value } as T;\n } else {\n return value; // This is for primitive types which do not need cloning.\n }\n}\n\n/**\n * Deep clone a value, preserving function references and class instances.\n * Unlike structuredClone, this handles objects that contain functions\n * (e.g. CollectionConfig with target(), childCollections(), callbacks).\n */\nexport function deepClone<T>(value: T): T {\n if (value === null || value === undefined) return value;\n if (typeof value === \"function\") return value;\n if (typeof value !== \"object\") return value;\n\n if (Array.isArray(value)) {\n return value.map(item => deepClone(item)) as T;\n }\n\n // Preserve class instances (Date, GeoPoint, etc.) — don't recurse\n if (Object.getPrototypeOf(value) !== Object.prototype) {\n return value;\n }\n\n const result: Record<string, unknown> = {};\n for (const key of Object.keys(value)) {\n result[key] = deepClone((value as Record<string, unknown>)[key]);\n }\n return result as T;\n}\n\nfunction toPath(value: string | string[]) {\n if (Array.isArray(value)) return value; // Already in path array form.\n // Replace brackets with dots, remove leading/trailing dots, then split by dot.\n return value.replace(/\\[(\\d+)]/g, \".$1\").replace(/^\\./, \"\").replace(/\\.$/, \"\").split(\".\");\n}\n\n\nexport const pick: <T extends Record<string, unknown>>(obj: T, ...args: (keyof T)[]) => Partial<T> = <T extends Record<string, unknown>>(obj: T, ...args: (keyof T)[]) => ({\n ...args.reduce<Record<string, unknown>>((res, key) => ({\n ...res,\n [key as string]: obj[key as string]\n }), {})\n}) as Partial<T>;\n\nexport function isObject(item: unknown): item is Record<string, unknown> {\n return !!item && typeof item === \"object\" && !Array.isArray(item);\n}\n\nexport function isPlainObject(obj: unknown): obj is Record<string, unknown> {\n // 1. Rule out non-objects, null, and arrays\n if (typeof obj !== \"object\" || obj === null || Array.isArray(obj)) {\n return false;\n }\n\n // 2. Get the object's direct prototype\n const proto = Object.getPrototypeOf(obj);\n\n // 3. A plain object's direct prototype is Object.prototype\n return proto === Object.prototype;\n}\n\nexport function mergeDeep<T extends object, U extends object>(\n target: T,\n source: U,\n ignoreUndefined = false\n): T & U {\n // If target is not a true object (e.g., null, array, primitive), return target itself.\n if (!isObject(target)) {\n return target as T & U;\n }\n\n // Create a shallow copy of the target to avoid modifying the original object.\n const output = { ...target };\n\n // If source is not a true object, there's nothing to merge from it.\n // Return the shallow copy of target.\n if (!isObject(source)) {\n return output as T & U;\n }\n\n // Iterate over keys in the source object.\n for (const key in source) {\n if (key === \"__proto__\" || key === \"constructor\" || key === \"prototype\") {\n continue;\n }\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n const sourceValue = source[key];\n const outputValue = (output as Record<string, unknown>)[key]; // Current value in our merged object (originating from target)\n\n // Skip if source value is undefined and ignoreUndefined is true.\n // This handles both not adding new undefined properties and not overwriting existing properties with undefined.\n if (ignoreUndefined && sourceValue === undefined) {\n continue;\n }\n\n if (sourceValue instanceof Date) {\n // If source value is a Date, create a new Date instance.\n (output as Record<string, unknown>)[key] = new Date(sourceValue.getTime());\n } else if (Array.isArray(sourceValue)) {\n if (Array.isArray(outputValue)) {\n // If the array contains primitives or class instances (non-plain objects),\n // overwrite the array entirely instead of doing element-wise merging.\n const hasPlainObjects = sourceValue.some(isPlainObject) || outputValue.some(isPlainObject);\n if (!hasPlainObjects) {\n (output as Record<string, unknown>)[key] = [...sourceValue];\n } else {\n const newArray = [];\n const maxLength = Math.max(outputValue.length, sourceValue.length);\n for (let i = 0; i < maxLength; i++) {\n const sourceItem = sourceValue[i];\n const targetItem = outputValue[i];\n\n if (i >= sourceValue.length) { // source is shorter\n newArray[i] = targetItem;\n } else if (i >= outputValue.length) { // target is shorter\n newArray[i] = sourceItem;\n } else if (sourceItem === null) {\n newArray[i] = targetItem;\n } else if (isPlainObject(sourceItem) && isPlainObject(targetItem)) {\n // Only recursively merge plain objects, preserve class instances\n newArray[i] = mergeDeep(targetItem, sourceItem, ignoreUndefined);\n } else {\n // For class instances and primitives, use source directly\n newArray[i] = sourceItem;\n }\n }\n (output as Record<string, unknown>)[key] = newArray;\n }\n } else {\n // If output's value (from target) is not an array,\n // overwrite with a shallow copy of the source array.\n (output as Record<string, unknown>)[key] = [...sourceValue];\n }\n } else if (isPlainObject(sourceValue)) {\n // If source value is a plain object (not a class instance like EntityReference, GeoPoint, etc.):\n if (isPlainObject(outputValue)) {\n // If the corresponding value in output (from target) is also a plain object, recurse.\n // Ensure the ignoreUndefined flag is passed down.\n (output as Record<string, unknown>)[key] = mergeDeep(outputValue as Record<string, unknown>, sourceValue, ignoreUndefined);\n } else {\n // If output's value (from target) is not a plain object (e.g., null, primitive, class instance, or key didn't exist in original target),\n // overwrite with the source object.\n (output as Record<string, unknown>)[key] = sourceValue;\n }\n } else if (isObject(sourceValue)) {\n // If source value is a class instance (not a plain object), use it directly to preserve prototype\n (output as Record<string, unknown>)[key] = sourceValue;\n } else {\n // If source value is a primitive, null, or undefined (and not ignored).\n (output as Record<string, unknown>)[key] = sourceValue;\n }\n }\n }\n\n return output as T & U;\n}\n\nexport function getValueInPath(o: object | undefined, path: string): unknown {\n if (!o) return undefined;\n if (typeof o === \"object\") {\n if (path in o) {\n return (o as Record<string, unknown>)[path];\n }\n if (path.includes(\".\") || path.includes(\"[\")) {\n let pathSegments = path.split(/[.[]/);\n if (path.includes(\"[\")) {\n pathSegments = pathSegments.map(segment => segment.replace(\"]\", \"\"));\n }\n const firstSegment = pathSegments[0];\n const isArrayAndIndexExists = Array.isArray((o as Record<string, unknown>)[firstSegment]) && !isNaN(parseInt(pathSegments[1]));\n const nextObject = isArrayAndIndexExists\n ? ((o as Record<string, unknown>)[firstSegment] as unknown[])[parseInt(pathSegments[1])]\n : (o as Record<string, unknown>)[firstSegment];\n\n const nextPath = pathSegments.slice(isArrayAndIndexExists ? 2 : 1).join(\".\");\n if (nextPath === \"\")\n return nextObject;\n return getValueInPath(nextObject as object | undefined, nextPath);\n }\n }\n return undefined;\n}\n\nexport function removeInPath(o: object, path: string): object | undefined {\n const res = clone(o) as Record<string, unknown>;\n let current = res;\n const parts = path.split(\".\");\n const last = parts.pop();\n for (const part of parts) {\n if (part in current && current[part] !== null && typeof current[part] === \"object\") {\n current[part] = clone(current[part]) as Record<string, unknown>;\n current = current[part] as Record<string, unknown>;\n } else {\n return res;\n }\n }\n if (last && current && typeof current === \"object\") {\n delete current[last];\n }\n return res;\n}\n\nexport function removeFunctions(o: unknown): unknown {\n if (o === undefined) return undefined;\n if (o === null) return null;\n if (typeof o === \"object\") {\n // Handle arrays first - map over them recursively\n if (Array.isArray(o)) {\n return o.map(v => removeFunctions(v));\n }\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(o)) {\n return o;\n }\n return Object.entries(o)\n .filter(([_, value]) => typeof value !== \"function\")\n .map(([key, value]) => {\n if (Array.isArray(value)) {\n return { [key]: value.map(v => removeFunctions(v)) };\n } else if (typeof value === \"object\") {\n return { [key]: removeFunctions(value) };\n } else return { [key]: value };\n })\n .reduce((a, b) => ({ ...a,\n...b }), {});\n }\n return o;\n}\n\nexport function getHashValue<T>(v: T): string | null {\n if (!v) return null;\n if (typeof v === \"object\" && v !== null) {\n if (\"id\" in v)\n return String((v as Record<string, unknown>).id);\n else if (v instanceof Date)\n return v.toLocaleString();\n else if (v instanceof GeoPoint)\n return hash(v as Record<string, unknown>);\n }\n return hash(v as object, { ignoreUnknown: true });\n}\n\nexport function removeUndefined(value: unknown, removeEmptyStrings?: boolean): unknown {\n if (typeof value === \"function\") {\n return value;\n }\n if (Array.isArray(value)) {\n return value.map((v: unknown) => removeUndefined(v, removeEmptyStrings));\n }\n if (typeof value === \"object\") {\n if (value === null)\n return value;\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(value)) {\n return value;\n }\n const res: Record<string, unknown> = {};\n Object.keys(value).forEach((key) => {\n if (!isEmptyObject(value as object)) {\n const childRes = removeUndefined((value as Record<string, unknown>)[key], removeEmptyStrings);\n const isString = typeof childRes === \"string\";\n const shouldKeepIfString = !removeEmptyStrings || (removeEmptyStrings && !isString) || (removeEmptyStrings && isString && childRes !== \"\");\n if (childRes !== undefined && !isEmptyObject(childRes as object) && shouldKeepIfString)\n res[key] = childRes;\n }\n });\n return res;\n }\n return value;\n}\n\nexport function removeNulls(value: unknown): unknown {\n if (typeof value === \"function\") {\n return value;\n }\n if (Array.isArray(value)) {\n return value.map((v: unknown) => removeNulls(v));\n }\n if (typeof value === \"object\") {\n if (value === null)\n return value;\n // Preserve class instances (EntityReference, GeoPoint, etc.) - don't recurse into them\n if (!isPlainObject(value)) {\n return value;\n }\n const res: Record<string, unknown> = {};\n const obj = value as Record<string, unknown>;\n Object.keys(obj).forEach((key) => {\n if (obj[key] !== null)\n res[key] = removeNulls(obj[key]);\n });\n return res;\n }\n return value;\n}\n\nexport function isEmptyObject(obj: object) {\n return obj &&\n Object.getPrototypeOf(obj) === Object.prototype &&\n Object.keys(obj).length === 0\n}\n\nexport function removePropsIfExisting(source: Record<string, unknown> | unknown[], comparison: Record<string, unknown> | unknown[]) {\n const isObject = (val: unknown): val is Record<string, unknown> => typeof val === \"object\" && val !== null;\n const isArray = (val: unknown): val is unknown[] => Array.isArray(val);\n\n if (!isObject(source) || !isObject(comparison)) {\n return source;\n }\n\n const res = isArray(source) ? [...source] : { ...source };\n\n if (isArray(res)) {\n for (let i = res.length - 1; i >= 0; i--) {\n if (res[i] === comparison[i]) {\n res.splice(i, 1);\n } else if (isObject(res[i]) && isObject(comparison[i])) {\n res[i] = removePropsIfExisting(res[i] as unknown as Record<string, unknown>, (comparison as unknown as unknown[])[i] as Record<string, unknown>);\n }\n }\n } else {\n Object.keys(comparison).forEach(key => {\n if (key in res) {\n if (isObject(res[key]) && isObject(comparison[key])) {\n res[key] = removePropsIfExisting(res[key], comparison[key]);\n } else if (res[key] === comparison[key]) {\n delete res[key];\n }\n }\n });\n }\n\n return res;\n}\n","export function toArray<T>(input?: T | T[]): T[] {\n return Array.isArray(input) ? input : (input ? [input] : []);\n}\n","export const defaultDateFormat = \"MMMM dd, yyyy, HH:mm:ss\";\n","export function hashString(str: string): number {\n if (!str) return 0;\n let hash = 0;\n let i;\n let chr;\n for (i = 0; i < str.length; i++) {\n chr = str.charCodeAt(i);\n hash = ((hash << 5) - hash) + chr;\n hash |= 0; // Convert to 32bit integer\n }\n return Math.abs(hash);\n}\n","export function serializeRegExp(input: RegExp): string {\n if (!input) return \"\";\n // const fragments = input.toString().match(/\\/(.*?)\\/([a-z]*)?$/i);\n // if (fragments) {\n // if (fragments[2])\n // return input.toString();\n // return fragments[1];\n // }\n return input.toString();\n}\n\n/**\n * Get a RegExp out of a serialized string\n * @param input\n */\nexport function hydrateRegExp(input?: string): RegExp | undefined {\n if (!input) return undefined;\n const fragments = input.match(/\\/(.*?)\\/([a-z]*)?$/i);\n if (fragments) {\n return new RegExp(fragments[1], fragments[2] || \"\");\n } else {\n return new RegExp(input, \"\");\n }\n}\n\nexport function isValidRegExp(input: string): boolean {\n const fullRegexp = input.match(/\\/((?![*+?])(?:[^\\r\\n[/\\\\]|\\\\.|\\[(?:[^\\r\\n\\]\\\\]|\\\\.)*])+)\\/((?:g(?:im?|mi?)?|i(?:gm?|mg?)?|m(?:gi?|ig?)?)?)/);\n if (fullRegexp)\n return true;\n const simpleRegexp = input.match(/((?![*+?])(?:[^\\r\\n[/\\\\]|\\\\.|\\[(?:[^\\r\\n\\]\\\\]|\\\\.)*])+)/);\n return !!simpleRegexp;\n}\n","export function flattenObject(obj: Record<string, unknown>, parentKey = \"\") {\n if (!obj) return obj;\n return Object.keys(obj).reduce((flatObj, key) => {\n const newKey = parentKey ? `${parentKey}.${key}` : key;\n\n if (typeof obj[key] === \"object\" && obj[key] !== null) {\n if (Array.isArray(obj[key])) {\n obj[key].forEach((item: unknown, index: number) => {\n if (typeof item === \"object\" && item !== null) {\n Object.assign(flatObj, flattenObject(item as Record<string, unknown>, `${newKey}[${index}]`));\n } else {\n flatObj[`${newKey}[${index}]`] = item;\n }\n });\n } else {\n Object.assign(flatObj, flattenObject(obj[key] as Record<string, unknown>, newKey));\n }\n } else {\n flatObj[newKey] = obj[key];\n }\n\n return flatObj;\n }, {} as { [key: string]: unknown });\n}\n\n\n// map from nested property key like \"a.b.c\" to the maximum array count found in a list of objects for that array\nexport type ArrayValuesCount = Record<string, number>;\n\nexport function getArrayValuesCount(array: Record<string, unknown>[]): ArrayValuesCount {\n return array.reduce((acc: ArrayValuesCount, obj: Record<string, unknown>) => {\n Object.entries(obj).forEach(([key, value]) => {\n // proceed only if value is an array\n if (Array.isArray(value)) {\n acc[key] = Math.max(acc[key] || 0, value.length);\n }\n\n // handle nested object\n if (typeof value === \"object\" && value !== null) {\n const nested = getArrayValuesCount([value as Record<string, unknown>]);\n Object.entries(nested).forEach(([nestedKey, nestedCount]) => {\n const compoundKey = `${key}.${nestedKey}`;\n acc[compoundKey] = Math.max(acc[compoundKey] || 0, nestedCount);\n });\n }\n });\n return acc;\n }, {});\n}\n","/**\n * Returns the plural of an English word.\n *\n * @param {string} word\n * @param {number} [amount]\n * @returns {string}\n */\nexport function plural(word: string, amount?: number): string {\n if (amount !== undefined && amount === 1) {\n return word\n }\n const plurals: { [key: string]: string } = {\n \"(quiz)$\": \"$1zes\",\n \"^(ox)$\": \"$1en\",\n \"([m|l])ouse$\": \"$1ice\",\n \"(matr|vert|ind)ix|ex$\": \"$1ices\",\n \"(x|ch|ss|sh)$\": \"$1es\",\n \"([^aeiouy]|qu)y$\": \"$1ies\",\n \"(hive)$\": \"$1s\",\n \"(?:([^f])fe|([lr])f)$\": \"$1$2ves\",\n \"(shea|lea|loa|thie)f$\": \"$1ves\",\n sis$: \"ses\",\n \"([ti])um$\": \"$1a\",\n \"(tomat|potat|ech|her|vet)o$\": \"$1oes\",\n \"(bu)s$\": \"$1ses\",\n \"(alias)$\": \"$1es\",\n \"(octop)us$\": \"$1i\",\n \"(ax|test)is$\": \"$1es\",\n \"(us)$\": \"$1es\",\n \"([^s]+)$\": \"$1s\"\n }\n const irregular: { [key: string]: string } = {\n move: \"moves\",\n foot: \"feet\",\n goose: \"geese\",\n sex: \"sexes\",\n child: \"children\",\n man: \"men\",\n tooth: \"teeth\",\n person: \"people\"\n }\n const uncountable: string[] = [\n \"sheep\",\n \"fish\",\n \"deer\",\n \"moose\",\n \"series\",\n \"species\",\n \"money\",\n \"rice\",\n \"information\",\n \"equipment\",\n \"bison\",\n \"cod\",\n \"offspring\",\n \"pike\",\n \"salmon\",\n \"shrimp\",\n \"swine\",\n \"trout\",\n \"aircraft\",\n \"hovercraft\",\n \"spacecraft\",\n \"sugar\",\n \"tuna\",\n \"you\",\n \"wood\"\n ]\n // save some time in the case that singular and plural are the same\n if (uncountable.indexOf(word.toLowerCase()) >= 0) {\n return word;\n }\n // check for irregular forms\n for (const w in irregular) {\n const pattern = new RegExp(`${w}$`, \"i\")\n const replace = irregular[w]\n if (pattern.test(word)) {\n return word.replace(pattern, replace);\n }\n }\n // check for matches using regular expressions\n for (const reg in plurals) {\n const pattern = new RegExp(reg, \"i\")\n if (pattern.test(word)) {\n return word.replace(pattern, plurals[reg])\n }\n }\n return word;\n}\n\n/**\n * Returns the singular of an English word.\n *\n * @param {string} word\n * @param {number} [amount]\n * @returns {string}\n */\nexport function singular(word: string, amount?: number): string {\n if (amount !== undefined && amount !== 1) {\n return word;\n }\n const singulars: { [key: string]: string } = {\n \"(quiz)zes$\": \"$1\",\n \"(matr)ices$\": \"$1ix\",\n \"(vert|ind)ices$\": \"$1ex\",\n \"^(ox)en$\": \"$1\",\n \"(alias)es$\": \"$1\",\n \"(octop|vir)i$\": \"$1us\",\n \"(cris|ax|test)es$\": \"$1is\",\n \"(shoe)s$\": \"$1\",\n \"(o)es$\": \"$1\",\n \"(bus)es$\": \"$1\",\n \"([m|l])ice$\": \"$1ouse\",\n \"(x|ch|ss|sh)es$\": \"$1\",\n \"(m)ovies$\": \"$1ovie\",\n \"(s)eries$\": \"$1eries\",\n \"([^aeiouy]|qu)ies$\": \"$1y\",\n \"([lr])ves$\": \"$1f\",\n \"(tive)s$\": \"$1\",\n \"(hive)s$\": \"$1\",\n \"(li|wi|kni)ves$\": \"$1fe\",\n \"(shea|loa|lea|thie)ves$\": \"$1f\",\n \"(^analy)ses$\": \"$1sis\",\n \"((a)naly|(b)a|(d)iagno|(p)arenthe|(p)rogno|(s)ynop|(t)he)ses$\": \"$1$2sis\",\n \"([ti])a$\": \"$1um\",\n \"(n)ews$\": \"$1ews\",\n \"(h|bl)ouses$\": \"$1ouse\",\n \"(corpse)s$\": \"$1\",\n \"(us)es$\": \"$1\",\n s$: \"\"\n }\n const irregular: { [key: string]: string } = {\n move: \"moves\",\n foot: \"feet\",\n goose: \"geese\",\n sex: \"sexes\",\n child: \"children\",\n man: \"men\",\n tooth: \"teeth\",\n person: \"people\"\n }\n const uncountable: string[] = [\n \"sheep\",\n \"fish\",\n \"deer\",\n \"moose\",\n \"series\",\n \"species\",\n \"money\",\n \"rice\",\n \"information\",\n \"equipment\",\n \"bison\",\n \"cod\",\n \"offspring\",\n \"pike\",\n \"salmon\",\n \"shrimp\",\n \"swine\",\n \"trout\",\n \"aircraft\",\n \"hovercraft\",\n \"spacecraft\",\n \"sugar\",\n \"tuna\",\n \"you\",\n \"wood\"\n ]\n // save some time in the case that singular and plural are the same\n if (uncountable.indexOf(word.toLowerCase()) >= 0) {\n return word;\n }\n // check for irregular forms\n for (const w in irregular) {\n const pattern = new RegExp(`${irregular[w]}$`, \"i\");\n if (pattern.test(word)) {\n return word.replace(pattern, w);\n }\n }\n // check for matches using regular expressions\n for (const reg in singulars) {\n const pattern = new RegExp(reg, \"i\");\n if (pattern.test(word)) {\n return word.replace(pattern, singulars[reg]);\n }\n }\n return word;\n}\n","import { toSnakeCase } from \"./strings\";\n\n/**\n * Generates a foreign key column name from a given string, typically a collection slug or name.\n * It converts the name to snake_case, attempts to singularize it by removing a trailing 's'\n * (a common convention for collection names), and appends '_id'.\n *\n * @param name The base name to convert to a foreign key.\n * @returns A foreign key name in the format 'singular_name_id'.\n *\n * @example\n * // returns \"user_id\"\n * generateForeignKeyName(\"users\")\n *\n * @example\n * // returns \"post_id\"\n * generateForeignKeyName(\"posts\")\n *\n * @example\n * // returns \"product_id\"\n * generateForeignKeyName(\"Product\")\n *\n */\nexport function generateForeignKeyName(name: string): string {\n const snakeCaseName = toSnakeCase(name);\n // A simple heuristic to singularize a plural name, which is a common convention.\n const singularName = snakeCaseName.endsWith(\"s\") ? snakeCaseName.slice(0, -1) : snakeCaseName;\n return `${singularName}_id`;\n}\n\n","\n\nexport function isDefaultFieldConfigId(id: string): boolean {\n return [\"text_field\",\n \"multiline\",\n \"markdown\",\n \"url\",\n \"email\",\n \"switch\",\n \"select\",\n \"multi_select\",\n \"number_input\",\n \"number_select\",\n \"multi_number_select\",\n \"file_upload\",\n \"multi_file_upload\",\n \"reference\",\n \"multi_references\",\n \"relation\",\n \"date_time\",\n \"group\",\n \"key_value\",\n \"repeat\",\n \"custom_array\",\n \"block\"\n ].includes(id);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAAA,IAAM,gBAAgB;CAEtB,IAAa,eAAe,QAAiB;EACzC,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU,OAAO;EAC5C,MAAM,mBAAmB,IAAI,MAAM,aAAa;EAChD,IAAI,CAAC,kBAAkB,OAAO;EAC9B,OAAO,iBACF,KAAI,MAAK,EAAE,YAAY,CAAC,EACxB,KAAK,GAAG;CACjB;CAEA,IAAM,iBAAiB;CAEvB,IAAa,eAAe,QAAiB;EACzC,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU,OAAO;EAC5C,MAAM,mBAAmB,IAAI,MAAM,cAAc;EACjD,IAAI,CAAC,kBAAkB,OAAO;EAC9B,OAAO,iBACF,KAAI,MAAK,EAAE,YAAY,CAAC,EACxB,KAAK,GAAG;CACjB;CAEA,SAAgB,UAAU,KAAqB;EAC3C,IAAI,CAAC,KAAK,OAAO;EACjB,IAAI,IAAI,WAAW,GAAG,OAAO,IAAI,YAAY;EAG7C,MAAM,QAAQ,IAAI,MAAM,QAAQ,EAAE,OAAO,OAAO;EAEhD,IAAI,MAAM,WAAW,GAAG,OAAO;EAG/B,OAAO,MAAM,GAAG,YAAY,IAExB,MAAM,MAAM,CAAC,EACR,KAAI,SAAQ,KAAK,OAAO,CAAC,EAAE,YAAY,IAAI,KAAK,UAAU,CAAC,EAAE,YAAY,CAAC,EAC1E,KAAK,EAAE;CACpB;CAEA,SAAgB,aAAa,YAAY,GAAG;EACxC,OAAO,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,IAAI,SAAS;CAC5D;CAEA,SAAgB,cAAc;EAC1B,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,QAAQ,EAAE,SAAS,EAAE;CAC3D;CAEA,SAAgB,QAAQ,MAAe,YAAY,KAAK,YAAY,MAAM;EACtE,IAAI,CAAC,MAAM,OAAO;EAClB,MAAM,OAAO;EACb,MAAM,KAAK,4BAA4B,YAAY,YAAY,YAAY,YAAY,YAAY,YAAY;EAE/G,KAAK,IAAI,IAAI,GAAG,IAAI,IAAa,IAAI,GAAG,KACpC,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,OAAO,CAAC,GAAG,GAAG,GAAG,GAAG,OAAO,CAAC,CAAC;EAGrE,OAAO,KACF,SAAS,EACT,KAAK,EACL,QAAQ,cAAc,EAAE,EACxB,QAAQ,QAAQ,SAAS,EACzB,QAAQ,MAAM,SAAS,EACvB,QAAQ,cAAc,EAAE,EACxB,QAAQ,IAAI,OAAO,OAAO,YAAY,OAAO,YAAY,KAAK,GAAG,GAC9D,SAAS;EAEjB,OAAO,YACD,KAAK,YAAY,IACjB;CACV;CAEA,SAAgB,UAAU,MAAuB;EAC7C,IAAI,CAAC,MAAM,OAAO;EAClB,IAAI,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG,KAAK,CAAC,KAAK,SAAS,GAAG,GAE9D,OADe,KAAK,QAAQ,SAAS,GAC9B,EAAO,QAAQ,UAAU,SAAU,KAAK;GAC3C,OAAO,IAAI,OAAO,CAAC,EAAE,YAAY,IAAI,IAAI,UAAU,CAAC;EACxD,CAAC,EAAE,KAAK;OAER,OAAO,KAAK,KAAK;CAEzB;CAEA,SAAgB,mBAAmB,OAAe;EAC9C,IAAI,CAAC,OAAO,OAAO;EAEnB,IAAI,OAAO;EAKX,OAAO,KAAK,QAAQ,uCAAuC,WAAW;EAGtE,OAAO,KAAK,QAAQ,UAAU,GAAG;EAMjC,OAHU,KACL,KAAK,EACL,QAAQ,UAAU,SAAS,KAAK,YAAY,CAC1C;CACX;;;;CCjGA,IAAa,gBAAgB,UACzB,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW;;CAG7C,IAAa,cAAc,QACvB,OAAO,QAAQ;;CAGnB,IAAa,aAAa,QACtB,OAAO,KAAK,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,OAAO,GAAG;;CAIlD,IAAa,SAAS,QAA0B,QAAQ;;;;CAKxD,SAAgB,MACZ,KACA,KACA,KACA,IAAI,GACN;EACE,MAAM,OAAO,OAAO,GAAG;EACvB,OAAO,OAAO,IAAI,KAAK,QACnB,MAAO,IAAgC,KAAK;EAIhD,IAAI,MAAM,KAAK,UAAU,CAAC,KACtB,OAAO;EAGX,OAAO,QAAQ,KAAA,IAAY,MAAM;CACrC;CAEA,SAAgB,MAAS,KAAQ,MAAc,OAAmB;EAC9D,MAAM,MAAM,MAAM,GAAG;EACrB,IAAI,SAAkC;EACtC,IAAI,IAAI;EACR,MAAM,YAAY,OAAO,IAAI;EAE7B,OAAO,IAAI,UAAU,SAAS,GAAG,KAAK;GAClC,MAAM,cAAsB,UAAU;GACtC,MAAM,aAAa,MAAM,KAAgC,UAAU,MAAM,GAAG,IAAI,CAAC,CAAC;GAElF,IAAI,eAAe,SAAS,UAAU,KAAK,MAAM,QAAQ,UAAU,IAC/D,SAAS,OAAO,eAAe,MAAM,UAAU;QAC5C;IACH,MAAM,WAAmB,UAAU,IAAI;IACvC,SAAS,OAAO,eACX,UAAU,QAAQ,KAAK,OAAO,QAAQ,KAAK,IAAI,CAAC,IAAI,CAAC;GAC9D;EACJ;EAGA,KAAK,MAAM,IAAI,MAAiC,QAAQ,UAAU,QAAQ,OACtE,OAAO;EAGX,IAAI,UAAU,KAAA,GACV,OAAO,OAAO,UAAU;OAExB,OAAO,UAAU,MAAM;EAK3B,IAAI,MAAM,KAAK,UAAU,KAAA,GACrB,OAAO,IAAI,UAAU;EAGzB,OAAO;CACX;CAEA,SAAgB,MAAS,OAAa;EAClC,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,CAAC,GAAG,KAAK;OACb,IAAI,OAAO,UAAU,YAAY,UAAU,MAC9C,OAAO,EAAE,GAAG,MAAM;OAElB,OAAO;CAEf;;;;;;CAOA,SAAgB,UAAa,OAAa;EACtC,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;EAClD,IAAI,OAAO,UAAU,YAAY,OAAO;EACxC,IAAI,OAAO,UAAU,UAAU,OAAO;EAEtC,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAI,SAAQ,UAAU,IAAI,CAAC;EAI5C,IAAI,OAAO,eAAe,KAAK,MAAM,OAAO,WACxC,OAAO;EAGX,MAAM,SAAkC,CAAC;EACzC,KAAK,MAAM,OAAO,OAAO,KAAK,KAAK,GAC/B,OAAO,OAAO,UAAW,MAAkC,IAAI;EAEnE,OAAO;CACX;CAEA,SAAS,OAAO,OAA0B;EACtC,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO;EAEjC,OAAO,MAAM,QAAQ,aAAa,KAAK,EAAE,QAAQ,OAAO,EAAE,EAAE,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;CAC5F;CAGA,IAAa,QAA4H,KAAQ,GAAG,UAAuB,EACvK,GAAG,KAAK,QAAiC,KAAK,SAAS;EACnD,GAAG;GACF,MAAgB,IAAI;CACzB,IAAI,CAAC,CAAC,EACV;CAEA,SAAgB,SAAS,MAAgD;EACrE,OAAO,CAAC,CAAC,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI;CACpE;CAEA,SAAgB,cAAc,KAA8C;EAExE,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAC5D,OAAO;EAOX,OAHc,OAAO,eAAe,GAG7B,MAAU,OAAO;CAC5B;CAEA,SAAgB,UACZ,QACA,QACA,kBAAkB,OACb;EAEL,IAAI,CAAC,SAAS,MAAM,GAChB,OAAO;EAIX,MAAM,SAAS,EAAE,GAAG,OAAO;EAI3B,IAAI,CAAC,SAAS,MAAM,GAChB,OAAO;EAIX,KAAK,MAAM,OAAO,QAAQ;GACtB,IAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,aACxD;GAEJ,IAAI,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;IACnD,MAAM,cAAc,OAAO;IAC3B,MAAM,cAAe,OAAmC;IAIxD,IAAI,mBAAmB,gBAAgB,KAAA,GACnC;IAGJ,IAAI,uBAAuB,MAEvB,OAAoC,OAAO,IAAI,KAAK,YAAY,QAAQ,CAAC;SACtE,IAAI,MAAM,QAAQ,WAAW,GAChC,IAAI,MAAM,QAAQ,WAAW,GAIzB,IAAI,EADoB,YAAY,KAAK,aAAa,KAAK,YAAY,KAAK,aAAa,IAErF,OAAoC,OAAO,CAAC,GAAG,WAAW;SACvD;KACH,MAAM,WAAW,CAAC;KAClB,MAAM,YAAY,KAAK,IAAI,YAAY,QAAQ,YAAY,MAAM;KACjE,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;MAChC,MAAM,aAAa,YAAY;MAC/B,MAAM,aAAa,YAAY;MAE/B,IAAI,KAAK,YAAY,QACjB,SAAS,KAAK;WACX,IAAI,KAAK,YAAY,QACxB,SAAS,KAAK;WACX,IAAI,eAAe,MACtB,SAAS,KAAK;WACX,IAAI,cAAc,UAAU,KAAK,cAAc,UAAU,GAE5D,SAAS,KAAK,UAAU,YAAY,YAAY,eAAe;WAG/D,SAAS,KAAK;KAEtB;KACA,OAAoC,OAAO;IAC/C;SAIA,OAAoC,OAAO,CAAC,GAAG,WAAW;SAE3D,IAAI,cAAc,WAAW,GAEhC,IAAI,cAAc,WAAW,GAGzB,OAAoC,OAAO,UAAU,aAAwC,aAAa,eAAe;SAIzH,OAAoC,OAAO;SAE5C,IAAI,SAAS,WAAW,GAE3B,OAAoC,OAAO;SAG3C,OAAoC,OAAO;GAEnD;EACJ;EAEA,OAAO;CACX;CAEA,SAAgB,eAAe,GAAuB,MAAuB;EACzE,IAAI,CAAC,GAAG,OAAO,KAAA;EACf,IAAI,OAAO,MAAM,UAAU;GACvB,IAAI,QAAQ,GACR,OAAQ,EAA8B;GAE1C,IAAI,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG,GAAG;IAC1C,IAAI,eAAe,KAAK,MAAM,MAAM;IACpC,IAAI,KAAK,SAAS,GAAG,GACjB,eAAe,aAAa,KAAI,YAAW,QAAQ,QAAQ,KAAK,EAAE,CAAC;IAEvE,MAAM,eAAe,aAAa;IAClC,MAAM,wBAAwB,MAAM,QAAS,EAA8B,aAAa,KAAK,CAAC,MAAM,SAAS,aAAa,EAAE,CAAC;IAC7H,MAAM,aAAa,wBACX,EAA8B,cAA4B,SAAS,aAAa,EAAE,KACnF,EAA8B;IAErC,MAAM,WAAW,aAAa,MAAM,wBAAwB,IAAI,CAAC,EAAE,KAAK,GAAG;IAC3E,IAAI,aAAa,IACb,OAAO;IACX,OAAO,eAAe,YAAkC,QAAQ;GACpE;EACJ;CAEJ;CAEA,SAAgB,aAAa,GAAW,MAAkC;EACtE,MAAM,MAAM,MAAM,CAAC;EACnB,IAAI,UAAU;EACd,MAAM,QAAQ,KAAK,MAAM,GAAG;EAC5B,MAAM,OAAO,MAAM,IAAI;EACvB,KAAK,MAAM,QAAQ,OACf,IAAI,QAAQ,WAAW,QAAQ,UAAU,QAAQ,OAAO,QAAQ,UAAU,UAAU;GAChF,QAAQ,QAAQ,MAAM,QAAQ,KAAK;GACnC,UAAU,QAAQ;EACtB,OACI,OAAO;EAGf,IAAI,QAAQ,WAAW,OAAO,YAAY,UACtC,OAAO,QAAQ;EAEnB,OAAO;CACX;CAEA,SAAgB,gBAAgB,GAAqB;EACjD,IAAI,MAAM,KAAA,GAAW,OAAO,KAAA;EAC5B,IAAI,MAAM,MAAM,OAAO;EACvB,IAAI,OAAO,MAAM,UAAU;GAEvB,IAAI,MAAM,QAAQ,CAAC,GACf,OAAO,EAAE,KAAI,MAAK,gBAAgB,CAAC,CAAC;GAGxC,IAAI,CAAC,cAAc,CAAC,GAChB,OAAO;GAEX,OAAO,OAAO,QAAQ,CAAC,EAClB,QAAQ,CAAC,GAAG,WAAW,OAAO,UAAU,UAAU,EAClD,KAAK,CAAC,KAAK,WAAW;IACnB,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,GAAG,MAAM,MAAM,KAAI,MAAK,gBAAgB,CAAC,CAAC,EAAE;SAChD,IAAI,OAAO,UAAU,UACxB,OAAO,GAAG,MAAM,gBAAgB,KAAK,EAAE;SACpC,OAAO,GAAG,MAAM,MAAM;GACjC,CAAC,EACA,QAAQ,GAAG,OAAO;IAAE,GAAG;IACpC,GAAG;GAAE,IAAI,CAAC,CAAC;EACP;EACA,OAAO;CACX;CAEA,SAAgB,aAAgB,GAAqB;EACjD,IAAI,CAAC,GAAG,OAAO;EACf,IAAI,OAAO,MAAM,YAAY,MAAM;OAC3B,QAAQ,GACR,OAAO,OAAQ,EAA8B,EAAE;QAC9C,IAAI,aAAa,MAClB,OAAO,EAAE,eAAe;QACvB,IAAI,aAAa,iBAAA,UAClB,QAAA,GAAA,YAAA,SAAY,CAA4B;EAAA;EAEhD,QAAA,GAAA,YAAA,SAAY,GAAa,EAAE,eAAe,KAAK,CAAC;CACpD;CAEA,SAAgB,gBAAgB,OAAgB,oBAAuC;EACnF,IAAI,OAAO,UAAU,YACjB,OAAO;EAEX,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAK,MAAe,gBAAgB,GAAG,kBAAkB,CAAC;EAE3E,IAAI,OAAO,UAAU,UAAU;GAC3B,IAAI,UAAU,MACV,OAAO;GAEX,IAAI,CAAC,cAAc,KAAK,GACpB,OAAO;GAEX,MAAM,MAA+B,CAAC;GACtC,OAAO,KAAK,KAAK,EAAE,SAAS,QAAQ;IAChC,IAAI,CAAC,cAAc,KAAe,GAAG;KACjC,MAAM,WAAW,gBAAiB,MAAkC,MAAM,kBAAkB;KAC5F,MAAM,WAAW,OAAO,aAAa;KACrC,MAAM,qBAAqB,CAAC,sBAAuB,sBAAsB,CAAC,YAAc,sBAAsB,YAAY,aAAa;KACvI,IAAI,aAAa,KAAA,KAAa,CAAC,cAAc,QAAkB,KAAK,oBAChE,IAAI,OAAO;IACnB;GACJ,CAAC;GACD,OAAO;EACX;EACA,OAAO;CACX;CAEA,SAAgB,YAAY,OAAyB;EACjD,IAAI,OAAO,UAAU,YACjB,OAAO;EAEX,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,MAAM,KAAK,MAAe,YAAY,CAAC,CAAC;EAEnD,IAAI,OAAO,UAAU,UAAU;GAC3B,IAAI,UAAU,MACV,OAAO;GAEX,IAAI,CAAC,cAAc,KAAK,GACpB,OAAO;GAEX,MAAM,MAA+B,CAAC;GACtC,MAAM,MAAM;GACZ,OAAO,KAAK,GAAG,EAAE,SAAS,QAAQ;IAC9B,IAAI,IAAI,SAAS,MACb,IAAI,OAAO,YAAY,IAAI,IAAI;GACvC,CAAC;GACD,OAAO;EACX;EACA,OAAO;CACX;CAEA,SAAgB,cAAc,KAAa;EACvC,OAAO,OACH,OAAO,eAAe,GAAG,MAAM,OAAO,aACtC,OAAO,KAAK,GAAG,EAAE,WAAW;CACpC;CAEA,SAAgB,sBAAsB,QAA6C,YAAiD;EAChI,MAAM,YAAY,QAAiD,OAAO,QAAQ,YAAY,QAAQ;EACtG,MAAM,WAAW,QAAmC,MAAM,QAAQ,GAAG;EAErE,IAAI,CAAC,SAAS,MAAM,KAAK,CAAC,SAAS,UAAU,GACzC,OAAO;EAGX,MAAM,MAAM,QAAQ,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,EAAE,GAAG,OAAO;EAExD,IAAI,QAAQ,GAAG;QACN,IAAI,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KACjC,IAAI,IAAI,OAAO,WAAW,IACtB,IAAI,OAAO,GAAG,CAAC;QACZ,IAAI,SAAS,IAAI,EAAE,KAAK,SAAS,WAAW,EAAE,GACjD,IAAI,KAAK,sBAAsB,IAAI,IAA2C,WAAoC,EAA6B;EAAA,OAIvJ,OAAO,KAAK,UAAU,EAAE,SAAQ,QAAO;GACnC,IAAI,OAAO;QACH,SAAS,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,GAC9C,IAAI,OAAO,sBAAsB,IAAI,MAAM,WAAW,IAAI;SACvD,IAAI,IAAI,SAAS,WAAW,MAC/B,OAAO,IAAI;GAAA;EAGvB,CAAC;EAGL,OAAO;CACX;;;CCnaA,SAAgB,QAAW,OAAsB;EAC7C,OAAO,MAAM,QAAQ,KAAK,IAAI,QAAS,QAAQ,CAAC,KAAK,IAAI,CAAC;CAC9D;;;CCFA,IAAa,oBAAoB;;;CCAjC,SAAgB,WAAW,KAAqB;EAC5C,IAAI,CAAC,KAAK,OAAO;EACjB,IAAI,OAAO;EACX,IAAI;EACJ,IAAI;EACJ,KAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GAC7B,MAAM,IAAI,WAAW,CAAC;GACtB,QAAS,QAAQ,KAAK,OAAQ;GAC9B,QAAQ;EACZ;EACA,OAAO,KAAK,IAAI,IAAI;CACxB;;;CCXA,SAAgB,gBAAgB,OAAuB;EACnD,IAAI,CAAC,OAAO,OAAO;EAOnB,OAAO,MAAM,SAAS;CAC1B;;;;;CAMA,SAAgB,cAAc,OAAoC;EAC9D,IAAI,CAAC,OAAO,OAAO,KAAA;EACnB,MAAM,YAAY,MAAM,MAAM,sBAAsB;EACpD,IAAI,WACA,OAAO,IAAI,OAAO,UAAU,IAAI,UAAU,MAAM,EAAE;OAElD,OAAO,IAAI,OAAO,OAAO,EAAE;CAEnC;CAEA,SAAgB,cAAc,OAAwB;EAElD,IADmB,MAAM,MAAM,6GAC3B,GACA,OAAO;EAEX,OAAO,CAAC,CADa,MAAM,MAAM,yDACxB;CACb;;;CC/BA,SAAgB,cAAc,KAA8B,YAAY,IAAI;EACxE,IAAI,CAAC,KAAK,OAAO;EACjB,OAAO,OAAO,KAAK,GAAG,EAAE,QAAQ,SAAS,QAAQ;GAC7C,MAAM,SAAS,YAAY,GAAG,UAAU,GAAG,QAAQ;GAEnD,IAAI,OAAO,IAAI,SAAS,YAAY,IAAI,SAAS,MAC7C,IAAI,MAAM,QAAQ,IAAI,IAAI,GACtB,IAAI,KAAK,SAAS,MAAe,UAAkB;IAC/C,IAAI,OAAO,SAAS,YAAY,SAAS,MACrC,OAAO,OAAO,SAAS,cAAc,MAAiC,GAAG,OAAO,GAAG,MAAM,EAAE,CAAC;SAE5F,QAAQ,GAAG,OAAO,GAAG,MAAM,MAAM;GAEzC,CAAC;QAED,OAAO,OAAO,SAAS,cAAc,IAAI,MAAiC,MAAM,CAAC;QAGrF,QAAQ,UAAU,IAAI;GAG1B,OAAO;EACX,GAAG,CAAC,CAA+B;CACvC;CAMA,SAAgB,oBAAoB,OAAoD;EACpF,OAAO,MAAM,QAAQ,KAAuB,QAAiC;GACzE,OAAO,QAAQ,GAAG,EAAE,SAAS,CAAC,KAAK,WAAW;IAE1C,IAAI,MAAM,QAAQ,KAAK,GACnB,IAAI,OAAO,KAAK,IAAI,IAAI,QAAQ,GAAG,MAAM,MAAM;IAInD,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM;KAC7C,MAAM,SAAS,oBAAoB,CAAC,KAAgC,CAAC;KACrE,OAAO,QAAQ,MAAM,EAAE,SAAS,CAAC,WAAW,iBAAiB;MACzD,MAAM,cAAc,GAAG,IAAI,GAAG;MAC9B,IAAI,eAAe,KAAK,IAAI,IAAI,gBAAgB,GAAG,WAAW;KAClE,CAAC;IACL;GACJ,CAAC;GACD,OAAO;EACX,GAAG,CAAC,CAAC;CACT;;;;;;;;;;CCzCA,SAAgB,OAAO,MAAc,QAAyB;EAC1D,IAAI,WAAW,KAAA,KAAa,WAAW,GACnC,OAAO;EAEX,MAAM,UAAqC;GACvC,WAAW;GACX,UAAU;GACV,gBAAgB;GAChB,yBAAyB;GACzB,iBAAiB;GACjB,oBAAoB;GACpB,WAAW;GACX,yBAAyB;GACzB,yBAAyB;GACzB,MAAM;GACN,aAAa;GACb,+BAA+B;GAC/B,UAAU;GACV,YAAY;GACZ,cAAc;GACd,gBAAgB;GAChB,SAAS;GACT,YAAY;EAChB;EACA,MAAM,YAAuC;GACzC,MAAM;GACN,MAAM;GACN,OAAO;GACP,KAAK;GACL,OAAO;GACP,KAAK;GACL,OAAO;GACP,QAAQ;EACZ;EA6BA,IAAI;GA3BA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EAGA,EAAY,QAAQ,KAAK,YAAY,CAAC,KAAK,GAC3C,OAAO;EAGX,KAAK,MAAM,KAAK,WAAW;GACvB,MAAM,UAAU,IAAI,OAAO,GAAG,EAAE,IAAI,GAAG;GACvC,MAAM,UAAU,UAAU;GAC1B,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,OAAO;EAE5C;EAEA,KAAK,MAAM,OAAO,SAAS;GACvB,MAAM,UAAU,IAAI,OAAO,KAAK,GAAG;GACnC,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,QAAQ,IAAI;EAEjD;EACA,OAAO;CACX;;;;;;;;CASA,SAAgB,SAAS,MAAc,QAAyB;EAC5D,IAAI,WAAW,KAAA,KAAa,WAAW,GACnC,OAAO;EAEX,MAAM,YAAuC;GACzC,cAAc;GACd,eAAe;GACf,mBAAmB;GACnB,YAAY;GACZ,cAAc;GACd,iBAAiB;GACjB,qBAAqB;GACrB,YAAY;GACZ,UAAU;GACV,YAAY;GACZ,eAAe;GACf,mBAAmB;GACnB,aAAa;GACb,aAAa;GACb,sBAAsB;GACtB,cAAc;GACd,YAAY;GACZ,YAAY;GACZ,mBAAmB;GACnB,2BAA2B;GAC3B,gBAAgB;GAChB,iEAAiE;GACjE,YAAY;GACZ,WAAW;GACX,gBAAgB;GAChB,cAAc;GACd,WAAW;GACX,IAAI;EACR;EACA,MAAM,YAAuC;GACzC,MAAM;GACN,MAAM;GACN,OAAO;GACP,KAAK;GACL,OAAO;GACP,KAAK;GACL,OAAO;GACP,QAAQ;EACZ;EA6BA,IAAI;GA3BA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EAGA,EAAY,QAAQ,KAAK,YAAY,CAAC,KAAK,GAC3C,OAAO;EAGX,KAAK,MAAM,KAAK,WAAW;GACvB,MAAM,UAAU,IAAI,OAAO,GAAG,UAAU,GAAG,IAAI,GAAG;GAClD,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,CAAC;EAEtC;EAEA,KAAK,MAAM,OAAO,WAAW;GACzB,MAAM,UAAU,IAAI,OAAO,KAAK,GAAG;GACnC,IAAI,QAAQ,KAAK,IAAI,GACjB,OAAO,KAAK,QAAQ,SAAS,UAAU,IAAI;EAEnD;EACA,OAAO;CACX;;;;;;;;;;;;;;;;;;;;;;;;CCpKA,SAAgB,uBAAuB,MAAsB;EACzD,MAAM,gBAAgB,YAAY,IAAI;EAGtC,OAAO,GADc,cAAc,SAAS,GAAG,IAAI,cAAc,MAAM,GAAG,EAAE,IAAI,cACzD;CAC3B;;;CC1BA,SAAgB,uBAAuB,IAAqB;EACxD,OAAO;GAAC;GACJ;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACJ,EAAE,SAAS,EAAE;CACjB"}
|
package/dist/objects.d.ts
CHANGED
|
@@ -15,7 +15,7 @@ export declare function clone<T>(value: T): T;
|
|
|
15
15
|
/**
|
|
16
16
|
* Deep clone a value, preserving function references and class instances.
|
|
17
17
|
* Unlike structuredClone, this handles objects that contain functions
|
|
18
|
-
* (e.g.
|
|
18
|
+
* (e.g. CollectionConfig with target(), childCollections(), callbacks).
|
|
19
19
|
*/
|
|
20
20
|
export declare function deepClone<T>(value: T): T;
|
|
21
21
|
export declare const pick: <T extends Record<string, unknown>>(obj: T, ...args: (keyof T)[]) => Partial<T>;
|
package/package.json
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@rebasepro/utils",
|
|
3
3
|
"type": "module",
|
|
4
|
-
"version": "0.
|
|
4
|
+
"version": "0.9.0",
|
|
5
5
|
"description": "Utility functions for Rebase",
|
|
6
6
|
"funding": {
|
|
7
7
|
"url": "https://github.com/sponsors/rebaseco"
|
|
@@ -29,14 +29,6 @@
|
|
|
29
29
|
"headless cms",
|
|
30
30
|
"content manager"
|
|
31
31
|
],
|
|
32
|
-
"scripts": {
|
|
33
|
-
"watch": "vite build --watch",
|
|
34
|
-
"build": "vite build && tsc --emitDeclarationOnly -p tsconfig.prod.json",
|
|
35
|
-
"test:lint": "eslint \"src/**\" --quiet",
|
|
36
|
-
"test": "jest --passWithNoTests",
|
|
37
|
-
"clean": "rm -rf dist && find ./src -name '*.js' -type f | xargs rm -f",
|
|
38
|
-
"generateIcons": "ts-node --esm src/icons/generateIcons.ts"
|
|
39
|
-
},
|
|
40
32
|
"exports": {
|
|
41
33
|
".": {
|
|
42
34
|
"types": "./dist/index.d.ts",
|
|
@@ -47,8 +39,8 @@
|
|
|
47
39
|
"./package.json": "./package.json"
|
|
48
40
|
},
|
|
49
41
|
"dependencies": {
|
|
50
|
-
"
|
|
51
|
-
"
|
|
42
|
+
"object-hash": "^3.0.0",
|
|
43
|
+
"@rebasepro/types": "0.9.0"
|
|
52
44
|
},
|
|
53
45
|
"devDependencies": {
|
|
54
46
|
"@jest/globals": "^30.4.1",
|
|
@@ -101,5 +93,13 @@
|
|
|
101
93
|
"moduleNameMapper": {
|
|
102
94
|
"\\.(css|less)$": "<rootDir>/test/__mocks__/styleMock.js"
|
|
103
95
|
}
|
|
96
|
+
},
|
|
97
|
+
"scripts": {
|
|
98
|
+
"watch": "vite build --watch",
|
|
99
|
+
"build": "vite build && tsc --emitDeclarationOnly -p tsconfig.prod.json",
|
|
100
|
+
"test:lint": "eslint \"src/**\" --quiet",
|
|
101
|
+
"test": "jest --passWithNoTests",
|
|
102
|
+
"clean": "rm -rf dist && find ./src -name '*.js' -type f | xargs rm -f",
|
|
103
|
+
"generateIcons": "ts-node --esm src/icons/generateIcons.ts"
|
|
104
104
|
}
|
|
105
|
-
}
|
|
105
|
+
}
|
package/src/fields.ts
CHANGED
package/src/objects.ts
CHANGED
|
@@ -91,7 +91,7 @@ export function clone<T>(value: T): T {
|
|
|
91
91
|
/**
|
|
92
92
|
* Deep clone a value, preserving function references and class instances.
|
|
93
93
|
* Unlike structuredClone, this handles objects that contain functions
|
|
94
|
-
* (e.g.
|
|
94
|
+
* (e.g. CollectionConfig with target(), childCollections(), callbacks).
|
|
95
95
|
*/
|
|
96
96
|
export function deepClone<T>(value: T): T {
|
|
97
97
|
if (value === null || value === undefined) return value;
|