@strapi/database 5.12.0 → 5.12.2

package/dist/utils/identifiers/index.js

@@ -0,0 +1,414 @@
+'use strict';
+
+var _ = require('lodash/fp');
+var hash = require('./hash.js');
+
+/**
+ * This file contains utility functions for generating names used in the database.
+ * These names include table names, column names, join table names, index names, and more.
+ * The generated names can be customized with prefixes, suffixes, and maximum length.
+ * These utility functions are used throughout the codebase to ensure consistent and standardized naming conventions in the database.
+ *
+ * The reason for checking maxLength for suffixes and prefixes and using the long ones from Strapi 4 is so that we always
+ * have access to the full length names, in particular for migration purposes, but also so that (in theory) the feature
+ * could be disabled and stay compatible with v4 database structure.
+ */ function _class_private_field_loose_base(receiver, privateKey) {
+    if (!Object.prototype.hasOwnProperty.call(receiver, privateKey)) {
+        throw new TypeError("attempted to use private field on non-instance");
+    }
+    return receiver;
+}
+var id = 0;
+function _class_private_field_loose_key(name) {
+    return "__private_" + id++ + "_" + name;
+}
+const IDENTIFIER_MAX_LENGTH = 55;
+var // Fixed compression map for suffixes and prefixes
+_replacementMap = /*#__PURE__*/ _class_private_field_loose_key("_replacementMap"), _options = /*#__PURE__*/ _class_private_field_loose_key("_options");
+class Identifiers {
+    get replacementMap() {
+        return _class_private_field_loose_base(this, _replacementMap)[_replacementMap];
+    }
+    get options() {
+        return _class_private_field_loose_base(this, _options)[_options];
+    }
+    constructor(options){
+        Object.defineProperty(this, _replacementMap, {
+            writable: true,
+            value: void 0
+        });
+        Object.defineProperty(this, _options, {
+            writable: true,
+            value: void 0
+        });
+        this.ID_COLUMN = 'id';
+        this.ORDER_COLUMN = 'order';
+        this.FIELD_COLUMN = 'field';
+        this.HASH_LENGTH = 5;
+        this.HASH_SEPARATOR = '' // no separator is needed, we will just attach hash directly to shortened name
+        ;
+        this.IDENTIFIER_SEPARATOR = '_';
+        this.MIN_TOKEN_LENGTH = 3 // the min characters required at the beginning of a name part
+        ;
+        _class_private_field_loose_base(this, _replacementMap)[_replacementMap] = {
+            links: 'lnk',
+            order_inv_fk: 'oifk',
+            order: 'ord',
+            morphs: 'mph',
+            index: 'idx',
+            inv_fk: 'ifk',
+            order_fk: 'ofk',
+            id_column_index: 'idix',
+            order_index: 'oidx',
+            unique: 'uq',
+            primary: 'pk'
+        };
+        this.mapshortNames = (name)=>{
+            if (name in this.replacementMap) {
+                return this.replacementMap[name];
+            }
+            return undefined;
+        };
+        // Generic name handler that must be used by all helper functions
+        /**
+   * TODO: we should be requiring snake_case inputs for all names here, but we
+   * aren't and it will require some refactoring to make it work. Currently if
+   * we get names 'myModel' and 'my_model' they would be converted to the same
+   * final string my_model which generally works but is not entirely safe
+   * */ this.getName = (names, options)=>{
+            const tokens = _.castArray(names).map((name)=>{
+                return {
+                    name,
+                    compressible: true
+                };
+            });
+            if (options?.suffix) {
+                tokens.push({
+                    name: options.suffix,
+                    compressible: false,
+                    shortName: this.mapshortNames(options.suffix)
+                });
+            }
+            if (options?.prefix) {
+                tokens.unshift({
+                    name: options.prefix,
+                    compressible: false,
+                    shortName: this.mapshortNames(options.prefix)
+                });
+            }
+            return this.getNameFromTokens(tokens);
+        };
+        /**
+   * TABLES
+   */ this.getTableName = (name, options)=>{
+            return this.getName(name, options);
+        };
+        this.getJoinTableName = (collectionName, attributeName, options)=>{
+            return this.getName([
+                collectionName,
+                attributeName
+            ], {
+                suffix: 'links',
+                ...options
+            });
+        };
+        this.getMorphTableName = (collectionName, attributeName, options)=>{
+            return this.getName([
+                _.snakeCase(collectionName),
+                _.snakeCase(attributeName)
+            ], {
+                suffix: 'morphs',
+                ...options
+            });
+        };
+        /**
+   * COLUMNS
+   */ this.getColumnName = (attributeName, options)=>{
+            return this.getName(attributeName, options);
+        };
+        this.getJoinColumnAttributeIdName = (attributeName, options)=>{
+            return this.getName(attributeName, {
+                suffix: 'id',
+                ...options
+            });
+        };
+        this.getInverseJoinColumnAttributeIdName = (attributeName, options)=>{
+            return this.getName(_.snakeCase(attributeName), {
+                suffix: 'id',
+                prefix: 'inv',
+                ...options
+            });
+        };
+        this.getOrderColumnName = (singularName, options)=>{
+            return this.getName(singularName, {
+                suffix: 'order',
+                ...options
+            });
+        };
+        this.getInverseOrderColumnName = (singularName, options)=>{
+            return this.getName(singularName, {
+                suffix: 'order',
+                prefix: 'inv',
+                ...options
+            });
+        };
+        /**
+   * Morph Join Tables
+   */ this.getMorphColumnJoinTableIdName = (singularName, options)=>{
+            return this.getName(_.snakeCase(singularName), {
+                suffix: 'id',
+                ...options
+            });
+        };
+        this.getMorphColumnAttributeIdName = (attributeName, options)=>{
+            return this.getName(_.snakeCase(attributeName), {
+                suffix: 'id',
+                ...options
+            });
+        };
+        this.getMorphColumnTypeName = (attributeName, options)=>{
+            return this.getName(_.snakeCase(attributeName), {
+                suffix: 'type',
+                ...options
+            });
+        };
+        /**
+   * INDEXES
+   * Note that these methods are generally used to reference full table names + attribute(s), which
+   * may already be shortened strings rather than individual parts.
+   * That is fine and expected to compress the previously incompressible parts of those strings,
+   * because in these cases the relevant information is the table name and we can't really do
+   * any better; shortening the individual parts again might make it even more confusing.
+   *
+   * So for example, the fk for the table `mytable_myattr4567d_localizations` will become
+   * mytable_myattr4567d_loc63bf2_fk
+   */ // base index types
+        this.getIndexName = (names, options)=>{
+            return this.getName(names, {
+                suffix: 'index',
+                ...options
+            });
+        };
+        this.getFkIndexName = (names, options)=>{
+            return this.getName(names, {
+                suffix: 'fk',
+                ...options
+            });
+        };
+        this.getUniqueIndexName = (names, options)=>{
+            return this.getName(names, {
+                suffix: 'unique',
+                ...options
+            });
+        };
+        this.getPrimaryIndexName = (names, options)=>{
+            return this.getName(names, {
+                suffix: 'primary',
+                ...options
+            });
+        };
+        // custom index types
+        this.getInverseFkIndexName = (names, options)=>{
+            return this.getName(names, {
+                suffix: 'inv_fk',
+                ...options
+            });
+        };
+        this.getOrderFkIndexName = (names, options)=>{
+            return this.getName(names, {
+                suffix: 'order_fk',
+                ...options
+            });
+        };
+        this.getOrderInverseFkIndexName = (names, options)=>{
+            return this.getName(names, {
+                suffix: 'order_inv_fk',
+                ...options
+            });
+        };
+        this.getIdColumnIndexName = (names, options)=>{
+            return this.getName(names, {
+                suffix: 'id_column_index',
+                ...options
+            });
+        };
+        this.getOrderIndexName = (names, options)=>{
+            return this.getName(names, {
+                suffix: 'order_index',
+                ...options
+            });
+        };
+        /**
+   * Generates a string with a max length, appending a hash at the end if necessary to keep it unique
+   *
+   * @example
+   * // if we have strings such as "longstring1" and "longstring2" with a max length of 9,
+   * // we don't want to end up with "longstrin" and "longstrin"
+   * // we want something such as    "longs0b23" and "longs953f"
+   * const token1 = generateToken("longstring1", 9); // "longs0b23"
+   * const token2 = generateToken("longstring2", 9); // "longs953f"
+   *
+   * @param name - The base name
+   * @param len - The desired length of the token.
+   * @returns The generated token with hash.
+   * @throws Error if the length is not a positive integer, or if the length is too short for the token.
+   * @internal
+   */ this.getShortenedName = (name, len)=>{
+            if (!_.isInteger(len) || len <= 0) {
+                throw new Error(`tokenWithHash length must be a positive integer, received ${len}`);
+            }
+            if (name.length <= len) {
+                return name;
+            }
+            if (len < this.MIN_TOKEN_LENGTH + this.HASH_LENGTH) {
+                throw new Error(`length for part of identifier too short, minimum is hash length (${this.HASH_LENGTH}) plus min token length (${this.MIN_TOKEN_LENGTH}), received ${len} for token ${name}`);
+            }
+            const availableLength = len - this.HASH_LENGTH - this.HASH_SEPARATOR.length;
+            if (availableLength < this.MIN_TOKEN_LENGTH) {
+                throw new Error(`length for part of identifier minimum is less than min token length (${this.MIN_TOKEN_LENGTH}), received ${len} for token ${name}`);
+            }
+            return `${name.substring(0, availableLength)}${this.HASH_SEPARATOR}${hash.createHash(name, this.HASH_LENGTH)}`;
+        };
+        /**
+   * Constructs a name from an array of name tokens within a specified maximum length. It ensures the final name does not exceed
+   * this limit by selectively compressing tokens marked as compressible. If the name exceeds the maximum length and cannot be
+   * compressed sufficiently, an error is thrown. This function supports dynamic adjustment of token lengths to fit within the
+   * maxLength constraint (that is, it will always make use of all available space), while also ensuring the preservation of
+   * incompressible tokens.
+   * @internal
+   */ this.getNameFromTokens = (nameTokens)=>{
+            const { maxLength } = this.options;
+            if (!_.isInteger(maxLength) || maxLength < 0) {
+                throw new Error('maxLength must be a positive integer or 0 (for unlimited length)');
+            }
+            const unshortenedName = nameTokens.map((token)=>{
+                return token.name;
+            }).join(this.IDENTIFIER_SEPARATOR);
+            // if maxLength == 0 we want the legacy v4 name without any shortening
+            if (maxLength === 0) {
+                this.setUnshortenedName(unshortenedName, unshortenedName);
+                return unshortenedName;
+            }
+            // check the full length name (but with incompressible tokens using shortNames if available)
+            const fullLengthName = nameTokens.map((token)=>{
+                if (token.compressible) {
+                    return token.name;
+                }
+                return token.shortName ?? token.name;
+            }).join(this.IDENTIFIER_SEPARATOR);
+            if (fullLengthName.length <= maxLength) {
+                this.setUnshortenedName(fullLengthName, unshortenedName);
+                return fullLengthName;
+            }
+            // Split tokens by compressibility
+            const [compressible, incompressible] = _.partition((token)=>token.compressible, nameTokens);
+            const totalIncompressibleLength = _.sumBy((token)=>token.compressible === false && token.shortName !== undefined ? token.shortName.length : token.name.length)(incompressible);
+            const totalSeparatorsLength = nameTokens.length * this.IDENTIFIER_SEPARATOR.length - 1;
+            const available = maxLength - totalIncompressibleLength - totalSeparatorsLength;
+            const availablePerToken = Math.floor(available / compressible.length);
+            if (totalIncompressibleLength + totalSeparatorsLength > maxLength || availablePerToken < this.MIN_TOKEN_LENGTH) {
+                throw new Error('Maximum length is too small to accommodate all tokens');
+            }
+            // Calculate the remainder from the division and add it to the surplus
+            let surplus = available % compressible.length;
+            // Check that it's even possible to proceed
+            const minHashedLength = this.HASH_LENGTH + this.HASH_SEPARATOR.length + this.MIN_TOKEN_LENGTH;
+            const totalLength = nameTokens.reduce((total, token)=>{
+                if (token.compressible) {
+                    if (token.name.length < availablePerToken) {
+                        return total + token.name.length;
+                    }
+                    return total + minHashedLength;
+                }
+                const tokenName = token.shortName ?? token.name;
+                return total + tokenName.length;
+            }, nameTokens.length * this.IDENTIFIER_SEPARATOR.length - 1);
+            // TODO: this is the weakest thing of the shortener, but fortunately it can be improved later without a breaking change if it turns out to be a problem (for example, if there is some case we need 6+ name parts in one identifier). We could take this "shortest string we could generate" that is too long and apply the hash directly to that, which would work fine even though it would be very difficult to determine what it was actually referring to
+            // Check if the maximum length is less than the total length
+            if (maxLength < totalLength) {
+                throw new Error('Maximum length is too small to accommodate all tokens');
+            }
+            // Calculate total surplus length from shorter strings and total deficit length from longer strings
+            let deficits = [];
+            compressible.forEach((token)=>{
+                const actualLength = token.name.length;
+                if (actualLength < availablePerToken) {
+                    surplus += availablePerToken - actualLength;
+                    token.allocatedLength = actualLength;
+                } else {
+                    token.allocatedLength = availablePerToken;
+                    deficits.push(token);
+                }
+            });
+            // Redistribute surplus length to longer strings, one character at a time
+            // This way we avoid issues with greed and trying to handle floating points by dividing available length
+            function filterAndIncreaseLength(token) {
+                if (token.allocatedLength < token.name.length && surplus > 0) {
+                    token.allocatedLength += 1;
+                    surplus -= 1;
+                    // if it hasn't reached its full length, keep it in array for next round
+                    return token.allocatedLength < token.name.length;
+                }
+                return false; // Remove this token from the deficits array
+            }
+            // Redistribute surplus length to longer strings, one character at a time
+            let previousSurplus = surplus + 1; // infinite loop protection
+            while(surplus > 0 && deficits.length > 0){
+                deficits = deficits.filter((token)=>filterAndIncreaseLength(token));
+                // infinite loop protection; if the surplus hasn't changed, there was nothing left to distribute it to
+                if (surplus === previousSurplus) {
+                    break;
+                }
+                previousSurplus = surplus;
+            }
+            // Build final string
+            const shortenedName = nameTokens.map((token)=>{
+                // if it is compressible, shorten it
+                if (token.compressible && 'allocatedLength' in token && token.allocatedLength !== undefined) {
+                    return this.getShortenedName(token.name, token.allocatedLength);
+                }
+                // if is is only compressible as a fixed value, use that
+                if (token.compressible === false && token.shortName) {
+                    return token.shortName;
+                }
+                // otherwise return it as-is
+                return token.name;
+            }).join(this.IDENTIFIER_SEPARATOR);
+            // this should be unreachable, but add a final check for potential edge cases we missed
+            if (shortenedName.length > maxLength) {
+                throw new Error(`name shortening failed to generate a name of the correct maxLength; name ${shortenedName}`);
+            }
+            this.setUnshortenedName(shortenedName, unshortenedName);
+            return shortenedName;
+        };
+        // We need to be able to find the full-length name for any shortened name, primarily for migration purposes
+        // Therefore we store every name that passes through so we can retrieve the original later
+        this.nameMap = new Map();
+        this.getUnshortenedName = (shortName)=>{
+            return this.nameMap.get(this.serializeKey(shortName)) ?? shortName;
+        };
+        this.setUnshortenedName = (shortName, fullName)=>{
+            // This is protection against cases where a name is shortened twice, for example shortened in a model outside of createMetadata
+            // and then run through the shortener against inside createMetadata, which would do nothing at all but replace the original
+            // name in this mapping
+            if (this.nameMap.get(this.serializeKey(shortName)) && shortName === fullName) {
+                return;
+            }
+            // set the name
+            this.nameMap.set(this.serializeKey(shortName), fullName);
+        };
+        this.serializeKey = (shortName)=>{
+            return `${shortName}.${this.options.maxLength}`;
+        };
+        _class_private_field_loose_base(this, _options)[_options] = options;
+    }
+}
+// TODO: instead of instantiating this here as a global metadata should create its own to use
+// However, that would require refactoring all of the metadata methods to be instantiated to keep a centralized identifiers
+const identifiers = new Identifiers({
+    maxLength: IDENTIFIER_MAX_LENGTH
+});
+
+exports.Identifiers = Identifiers;
+exports.identifiers = identifiers;
+//# sourceMappingURL=index.js.map

package/dist/utils/identifiers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../src/utils/identifiers/index.ts"],"sourcesContent":["/**\n * This file contains utility functions for generating names used in the database.\n * These names include table names, column names, join table names, index names, and more.\n * The generated names can be customized with prefixes, suffixes, and maximum length.\n * These utility functions are used throughout the codebase to ensure consistent and standardized naming conventions in the database.\n *\n * The reason for checking maxLength for suffixes and prefixes and using the long ones from Strapi 4 is so that we always\n * have access to the full length names, in particular for migration purposes, but also so that (in theory) the feature\n * could be disabled and stay compatible with v4 database structure.\n */\nimport _, { isInteger, partition, snakeCase, sumBy } from 'lodash/fp';\nimport { createHash } from './hash';\nimport {\n  IdentifiersOptions,\n  NameInput,\n  NameOptions,\n  NameToken,\n  NameTokenWithAllocation,\n} from './types';\n\nconst IDENTIFIER_MAX_LENGTH = 55 as const;\n\nexport class Identifiers {\n  ID_COLUMN = 'id' as const;\n\n  ORDER_COLUMN = 'order' as const;\n\n  FIELD_COLUMN = 'field' as const;\n\n  HASH_LENGTH = 5 as const;\n\n  HASH_SEPARATOR = '' as const; // no separator is needed, we will just attach hash directly to shortened name\n\n  IDENTIFIER_SEPARATOR = '_' as const;\n\n  MIN_TOKEN_LENGTH = 3 as const; // the min characters required at the beginning of a name part\n\n  // Fixed compression map for suffixes and prefixes\n  #replacementMap = {\n    links: 'lnk',\n    order_inv_fk: 'oifk',\n    order: 'ord',\n    morphs: 'mph',\n    index: 'idx',\n    inv_fk: 'ifk',\n    order_fk: 'ofk',\n    id_column_index: 'idix',\n    order_index: 'oidx',\n    unique: 'uq',\n    primary: 'pk',\n  };\n\n  #options: IdentifiersOptions;\n\n  constructor(options: { maxLength: number }) {\n    this.#options = options;\n  }\n\n  get replacementMap() {\n    return this.#replacementMap;\n  }\n\n  get options() {\n    return this.#options;\n  }\n\n  mapshortNames = (name: string): string | undefined => {\n    if (name in this.replacementMap) {\n      return (this.replacementMap as any)[name];\n    }\n    return undefined;\n  };\n\n  // Generic name handler that must be used by all helper functions\n  /**\n   * TODO: we should be requiring snake_case inputs for all names here, but we\n   * aren't and it will require some refactoring to make it work. Currently if\n   * we get names 'myModel' and 'my_model' they would be converted to the same\n   * final string my_model which generally works but is not entirely safe\n   * */\n  getName = (names: NameInput, options?: NameOptions) => {\n    const tokens: NameToken[] = _.castArray(names).map((name) => {\n      return {\n        name,\n        compressible: true,\n      };\n    });\n\n    if (options?.suffix) {\n      tokens.push({\n        name: options.suffix,\n        compressible: false,\n        shortName: this.mapshortNames(options.suffix),\n      });\n    }\n\n    if (options?.prefix) {\n      tokens.unshift({\n        name: options.prefix,\n        compressible: false,\n        shortName: this.mapshortNames(options.prefix),\n      });\n    }\n\n    return this.getNameFromTokens(tokens);\n  };\n\n  /**\n   * TABLES\n   */\n\n  getTableName = (name: string, options?: NameOptions) => {\n    return this.getName(name, options);\n  };\n\n  getJoinTableName = (collectionName: string, attributeName: string, options?: NameOptions) => {\n    return this.getName([collectionName, attributeName], {\n      suffix: 'links',\n      ...options,\n    });\n  };\n\n  getMorphTableName = (collectionName: string, attributeName: string, options?: NameOptions) => {\n    return this.getName([snakeCase(collectionName), snakeCase(attributeName)], {\n      suffix: 'morphs',\n      ...options,\n    });\n  };\n\n  /**\n   * COLUMNS\n   */\n\n  getColumnName = (attributeName: string, options?: NameOptions) => {\n    return this.getName(attributeName, options);\n  };\n\n  getJoinColumnAttributeIdName = (attributeName: string, options?: NameOptions) => {\n    return this.getName(attributeName, { suffix: 'id', ...options });\n  };\n\n  getInverseJoinColumnAttributeIdName = (attributeName: string, options?: NameOptions) => {\n    return this.getName(snakeCase(attributeName), { suffix: 'id', prefix: 'inv', ...options });\n  };\n\n  getOrderColumnName = (singularName: string, options?: NameOptions) => {\n    return this.getName(singularName, { suffix: 'order', ...options });\n  };\n\n  getInverseOrderColumnName = (singularName: string, options?: NameOptions) => {\n    return this.getName(singularName, {\n      suffix: 'order',\n      prefix: 'inv',\n      ...options,\n    });\n  };\n\n  /**\n   * Morph Join Tables\n   */\n  getMorphColumnJoinTableIdName = (singularName: string, options?: NameOptions) => {\n    return this.getName(snakeCase(singularName), { suffix: 'id', ...options });\n  };\n\n  getMorphColumnAttributeIdName = (attributeName: string, options?: NameOptions) => {\n    return this.getName(snakeCase(attributeName), { suffix: 'id', ...options });\n  };\n\n  getMorphColumnTypeName = (attributeName: string, options?: NameOptions) => {\n    return this.getName(snakeCase(attributeName), { suffix: 'type', ...options });\n  };\n\n  /**\n   * INDEXES\n   * Note that these methods are generally used to reference full table names + attribute(s), which\n   * may already be shortened strings rather than individual parts.\n   * That is fine and expected to compress the previously incompressible parts of those strings,\n   * because in these cases the relevant information is the table name and we can't really do\n   * any better; shortening the individual parts again might make it even more confusing.\n   *\n   * So for example, the fk for the table `mytable_myattr4567d_localizations` will become\n   * mytable_myattr4567d_loc63bf2_fk\n   */\n\n  // base index types\n  getIndexName = (names: NameInput, options?: NameOptions) => {\n    return this.getName(names, { suffix: 'index', ...options });\n  };\n\n  getFkIndexName = (names: NameInput, options?: NameOptions) => {\n    return this.getName(names, { suffix: 'fk', ...options });\n  };\n\n  getUniqueIndexName = (names: NameInput, options?: NameOptions) => {\n    return this.getName(names, { suffix: 'unique', ...options });\n  };\n\n  getPrimaryIndexName = (names: NameInput, options?: NameOptions) => {\n    return this.getName(names, { suffix: 'primary', ...options });\n  };\n\n  // custom index types\n  getInverseFkIndexName = (names: NameInput, options?: NameOptions) => {\n    return this.getName(names, { suffix: 'inv_fk', ...options });\n  };\n\n  getOrderFkIndexName = (names: NameInput, options?: NameOptions) => {\n    return this.getName(names, { suffix: 'order_fk', ...options });\n  };\n\n  getOrderInverseFkIndexName = (names: NameInput, options?: NameOptions) => {\n    return this.getName(names, { suffix: 'order_inv_fk', ...options });\n  };\n\n  getIdColumnIndexName = (names: NameInput, options?: NameOptions) => {\n    return this.getName(names, { suffix: 'id_column_index', ...options });\n  };\n\n  getOrderIndexName = (names: NameInput, options?: NameOptions) => {\n    return this.getName(names, { suffix: 'order_index', ...options });\n  };\n\n  /**\n   * Generates a string with a max length, appending a hash at the end if necessary to keep it unique\n   *\n   * @example\n   * // if we have strings such as \"longstring1\" and \"longstring2\" with a max length of 9,\n   * // we don't want to end up with \"longstrin\" and \"longstrin\"\n   * // we want something such as    \"longs0b23\" and \"longs953f\"\n   * const token1 = generateToken(\"longstring1\", 9); // \"longs0b23\"\n   * const token2 = generateToken(\"longstring2\", 9); // \"longs953f\"\n   *\n   * @param name - The base name\n   * @param len - The desired length of the token.\n   * @returns The generated token with hash.\n   * @throws Error if the length is not a positive integer, or if the length is too short for the token.\n   * @internal\n   */\n  getShortenedName = (name: string, len: number) => {\n    if (!isInteger(len) || len <= 0) {\n      throw new Error(`tokenWithHash length must be a positive integer, received ${len}`);\n    }\n    if (name.length <= len) {\n      return name;\n    }\n    if (len < this.MIN_TOKEN_LENGTH + this.HASH_LENGTH) {\n      throw new Error(\n        `length for part of identifier too short, minimum is hash length (${this.HASH_LENGTH}) plus min token length (${this.MIN_TOKEN_LENGTH}), received ${len} for token ${name}`\n      );\n    }\n\n    const availableLength = len - this.HASH_LENGTH - this.HASH_SEPARATOR.length;\n    if (availableLength < this.MIN_TOKEN_LENGTH) {\n      throw new Error(\n        `length for part of identifier minimum is less than min token length (${this.MIN_TOKEN_LENGTH}), received ${len} for token ${name}`\n      );\n    }\n\n    return `${name.substring(0, availableLength)}${this.HASH_SEPARATOR}${createHash(\n      name,\n      this.HASH_LENGTH\n    )}`;\n  };\n\n  /**\n   * Constructs a name from an array of name tokens within a specified maximum length. It ensures the final name does not exceed\n   * this limit by selectively compressing tokens marked as compressible. If the name exceeds the maximum length and cannot be\n   * compressed sufficiently, an error is thrown. This function supports dynamic adjustment of token lengths to fit within the\n   * maxLength constraint (that is, it will always make use of all available space), while also ensuring the preservation of\n   * incompressible tokens.\n   * @internal\n   */\n  getNameFromTokens = (nameTokens: NameToken[]): string => {\n    const { maxLength } = this.options;\n\n    if (!isInteger(maxLength) || maxLength < 0) {\n      throw new Error('maxLength must be a positive integer or 0 (for unlimited length)');\n    }\n\n    const unshortenedName = nameTokens\n      .map((token) => {\n        return token.name;\n      })\n      .join(this.IDENTIFIER_SEPARATOR);\n\n    // if maxLength == 0 we want the legacy v4 name without any shortening\n    if (maxLength === 0) {\n      this.setUnshortenedName(unshortenedName, unshortenedName);\n      return unshortenedName;\n    }\n\n    // check the full length name (but with incompressible tokens using shortNames if available)\n    const fullLengthName = nameTokens\n      .map((token) => {\n        if (token.compressible) {\n          return token.name;\n        }\n        return token.shortName ?? token.name;\n      })\n      .join(this.IDENTIFIER_SEPARATOR);\n\n    if (fullLengthName.length <= maxLength) {\n      this.setUnshortenedName(fullLengthName, unshortenedName);\n      return fullLengthName;\n    }\n\n    // Split tokens by compressibility\n    const [compressible, incompressible] = partition(\n      (token: NameToken) => token.compressible,\n      nameTokens\n    );\n\n    const totalIncompressibleLength = sumBy((token: NameToken) =>\n      token.compressible === false && token.shortName !== undefined\n        ? token.shortName.length\n        : token.name.length\n    )(incompressible);\n    const totalSeparatorsLength = nameTokens.length * this.IDENTIFIER_SEPARATOR.length - 1;\n    const available = maxLength - totalIncompressibleLength - totalSeparatorsLength;\n    const availablePerToken = Math.floor(available / compressible.length);\n\n    if (\n      totalIncompressibleLength + totalSeparatorsLength > maxLength ||\n      availablePerToken < this.MIN_TOKEN_LENGTH\n    ) {\n      throw new Error('Maximum length is too small to accommodate all tokens');\n    }\n\n    // Calculate the remainder from the division and add it to the surplus\n    let surplus = available % compressible.length;\n\n    // Check that it's even possible to proceed\n    const minHashedLength = this.HASH_LENGTH + this.HASH_SEPARATOR.length + this.MIN_TOKEN_LENGTH;\n    const totalLength = nameTokens.reduce(\n      (total, token) => {\n        if (token.compressible) {\n          if (token.name.length < availablePerToken) {\n            return total + token.name.length;\n          }\n          return total + minHashedLength;\n        }\n        const tokenName = token.shortName ?? token.name;\n        return total + tokenName.length;\n      },\n      nameTokens.length * this.IDENTIFIER_SEPARATOR.length - 1\n    );\n\n    // TODO: this is the weakest thing of the shortener, but fortunately it can be improved later without a breaking change if it turns out to be a problem (for example, if there is some case we need 6+ name parts in one identifier). We could take this \"shortest string we could generate\" that is too long and apply the hash directly to that, which would work fine even though it would be very difficult to determine what it was actually referring to\n    // Check if the maximum length is less than the total length\n    if (maxLength < totalLength) {\n      throw new Error('Maximum length is too small to accommodate all tokens');\n    }\n\n    // Calculate total surplus length from shorter strings and total deficit length from longer strings\n    let deficits: NameTokenWithAllocation[] = [];\n    compressible.forEach((token) => {\n      const actualLength = token.name.length;\n      if (actualLength < availablePerToken) {\n        surplus += availablePerToken - actualLength;\n        token.allocatedLength = actualLength;\n      } else {\n        token.allocatedLength = availablePerToken;\n        deficits.push(token as NameTokenWithAllocation);\n      }\n    });\n\n    // Redistribute surplus length to longer strings, one character at a time\n    // This way we avoid issues with greed and trying to handle floating points by dividing available length\n    function filterAndIncreaseLength(token: NameTokenWithAllocation) {\n      if (token.allocatedLength < token.name.length && surplus > 0) {\n        token.allocatedLength += 1;\n        surplus -= 1;\n        // if it hasn't reached its full length, keep it in array for next round\n        return token.allocatedLength < token.name.length;\n      }\n      return false; // Remove this token from the deficits array\n    }\n\n    // Redistribute surplus length to longer strings, one character at a time\n    let previousSurplus = surplus + 1; // infinite loop protection\n    while (surplus > 0 && deficits.length > 0) {\n      deficits = deficits.filter((token) => filterAndIncreaseLength(token));\n\n      // infinite loop protection; if the surplus hasn't changed, there was nothing left to distribute it to\n      if (surplus === previousSurplus) {\n        break;\n      }\n      previousSurplus = surplus;\n    }\n\n    // Build final string\n    const shortenedName = nameTokens\n      .map((token) => {\n        // if it is compressible, shorten it\n        if (\n          token.compressible &&\n          'allocatedLength' in token &&\n          token.allocatedLength !== undefined\n        ) {\n          return this.getShortenedName(token.name, token.allocatedLength);\n        }\n\n        // if is is only compressible as a fixed value, use that\n        if (token.compressible === false && token.shortName) {\n          return token.shortName;\n        }\n\n        // otherwise return it as-is\n        return token.name;\n      })\n      .join(this.IDENTIFIER_SEPARATOR);\n\n    // this should be unreachable, but add a final check for potential edge cases we missed\n    if (shortenedName.length > maxLength) {\n      throw new Error(\n        `name shortening failed to generate a name of the correct maxLength; name ${shortenedName}`\n      );\n    }\n\n    this.setUnshortenedName(shortenedName, unshortenedName);\n    return shortenedName;\n  };\n\n  // We need to be able to find the full-length name for any shortened name, primarily for migration purposes\n  // Therefore we store every name that passes through so we can retrieve the original later\n  nameMap = new Map<string, string>();\n\n  getUnshortenedName = (shortName: string) => {\n    return this.nameMap.get(this.serializeKey(shortName)) ?? shortName;\n  };\n\n  setUnshortenedName = (shortName: string, fullName: string) => {\n    // This is protection against cases where a name is shortened twice, for example shortened in a model outside of createMetadata\n    // and then run through the shortener against inside createMetadata, which would do nothing at all but replace the original\n    // name in this mapping\n    if (this.nameMap.get(this.serializeKey(shortName)) && shortName === fullName) {\n      return;\n    }\n\n    // set the name\n    this.nameMap.set(this.serializeKey(shortName), fullName);\n  };\n\n  serializeKey = (shortName: string) => {\n    return `${shortName}.${this.options.maxLength}`;\n  };\n}\n\n// TODO: instead of instantiating this here as a global metadata should create its own to use\n// However, that would require refactoring all of the metadata methods to be instantiated to keep a centralized identifiers\nexport const identifiers = new Identifiers({ maxLength: IDENTIFIER_MAX_LENGTH });\n"],"names":["IDENTIFIER_MAX_LENGTH","Identifiers","replacementMap","options","constructor","ID_COLUMN","ORDER_COLUMN","FIELD_COLUMN","HASH_LENGTH","HASH_SEPARATOR","IDENTIFIER_SEPARATOR","MIN_TOKEN_LENGTH","links","order_inv_fk","order","morphs","index","inv_fk","order_fk","id_column_index","order_index","unique","primary","mapshortNames","name","undefined","getName","names","tokens","_","castArray","map","compressible","suffix","push","shortName","prefix","unshift","getNameFromTokens","getTableName","getJoinTableName","collectionName","attributeName","getMorphTableName","snakeCase","getColumnName","getJoinColumnAttributeIdName","getInverseJoinColumnAttributeIdName","getOrderColumnName","singularName","getInverseOrderColumnName","getMorphColumnJoinTableIdName","getMorphColumnAttributeIdName","getMorphColumnTypeName","getIndexName","getFkIndexName","getUniqueIndexName","getPrimaryIndexName","getInverseFkIndexName","getOrderFkIndexName","getOrderInverseFkIndexName","getIdColumnIndexName","getOrderIndexName","getShortenedName","len","isInteger","Error","length","availableLength","substring","createHash","nameTokens","maxLength","unshortenedName","token","join","setUnshortenedName","fullLengthName","incompressible","partition","totalIncompressibleLength","sumBy","totalSeparatorsLength","available","availablePerToken","Math","floor","surplus","minHashedLength","totalLength","reduce","total","tokenName","deficits","forEach","actualLength","allocatedLength","filterAndIncreaseLength","previousSurplus","filter","shortenedName","nameMap","Map","getUnshortenedName","get","serializeKey","fullName","set","identifiers"],"mappings":";;;;;AAAA;;;;;;;;;AASC,IAAA,SAAA,+BAAA,CAAA,QAAA,EAAA,UAAA,EAAA;;;;;;;;;;AAWD,MAAMA,qBAAwB,GAAA,EAAA;;AAkB5B,eAcA,iBAAA,8BAAA,CAAA,iBAAA,CAAA,EAAA,QAAA,iBAAA,8BAAA,CAAA,UAAA,CAAA;AA9BK,MAAMC,WAAAA,CAAAA;AAoCX,IAAA,IAAIC,cAAiB,GAAA;QACnB,OAAO,+BAAA,CAAA,IAAI,EAAEA,eAAAA,CAAAA,CAAAA,eAAAA,CAAAA;AACf;AAEA,IAAA,IAAIC,OAAU,GAAA;QACZ,OAAO,+BAAA,CAAA,IAAI,EAAEA,QAAAA,CAAAA,CAAAA,QAAAA,CAAAA;AACf;AAVAC,IAAAA,WAAAA,CAAYD,OAA8B,CAAE;QAhB5C,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,eAAA,EAAA;;mBAAA,KAAA;;QAcA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,QAAA,EAAA;;mBAAA,KAAA;;aA7BAE,SAAY,GAAA,IAAA;aAEZC,YAAe,GAAA,OAAA;aAEfC,YAAe,GAAA,OAAA;aAEfC,WAAc,GAAA,CAAA;AAEdC,QAAAA,IAAAA,CAAAA,cAAAA,GAAiB;;aAEjBC,oBAAuB,GAAA,GAAA;AAEvBC,QAAAA,IAAAA,CAAAA,gBAAAA,GAAmB;;AAGlBT,QAAAA,+BAAAA,CAAAA,IAAAA,EAAAA,eAAAA,CAAAA,CAAAA,eAAiB,CAAA,GAAA;YAChBU,KAAO,EAAA,KAAA;YACPC,YAAc,EAAA,MAAA;YACdC,KAAO,EAAA,KAAA;YACPC,MAAQ,EAAA,KAAA;YACRC,KAAO,EAAA,KAAA;YACPC,MAAQ,EAAA,KAAA;YACRC,QAAU,EAAA,KAAA;YACVC,eAAiB,EAAA,MAAA;YACjBC,WAAa,EAAA,MAAA;YACbC,MAAQ,EAAA,IAAA;YACRC,OAAS,EAAA;AACX,SAAA;AAgBAC,QAAAA,IAAAA,CAAAA,aAAAA,GAAgB,CAACC,IAAAA,GAAAA;AACf,YAAA,IAAIA,IAAQ,IAAA,IAAI,CAACtB,cAAc,EAAE;AAC/B,gBAAA,OAAO,IAAK,CAACA,cAAsB,CAACsB,IAAK,CAAA;AAC3C;YACA,OAAOC,SAAAA;AACT,SAAA;;AAGA;;;;;QAMAC,IAAAA,CAAAA,OAAAA,GAAU,CAACC,KAAkBxB,EAAAA,OAAAA,GAAAA;AAC3B,YAAA,MAAMyB,SAAsBC,CAAEC,CAAAA,SAAS,CAACH,KAAOI,CAAAA,CAAAA,GAAG,CAAC,CAACP,IAAAA,GAAAA;gBAClD,OAAO;AACLA,oBAAAA,IAAAA;oBACAQ,YAAc,EAAA;AAChB,iBAAA;AACF,aAAA,CAAA;AAEA,YAAA,IAAI7B,SAAS8B,MAAQ,EAAA;AACnBL,gBAAAA,MAAAA,CAAOM,IAAI,CAAC;AACVV,oBAAAA,IAAAA,EAAMrB,QAAQ8B,MAAM;oBACpBD,YAAc,EAAA,KAAA;AACdG,oBAAAA,SAAAA,EAAW,IAAI,CAACZ,aAAa,CAACpB,QAAQ8B,MAAM;AAC9C,iBAAA,CAAA;AACF;AAEA,YAAA,IAAI9B,SAASiC,MAAQ,EAAA;AACnBR,gBAAAA,MAAAA,CAAOS,OAAO,CAAC;AACbb,oBAAAA,IAAAA,EAAMrB,QAAQiC,MAAM;oBACpBJ,YAAc,EAAA,KAAA;AACdG,oBAAAA,SAAAA,EAAW,IAAI,CAACZ,aAAa,CAACpB,QAAQiC,MAAM;AAC9C,iBAAA,CAAA;AACF;YAEA,OAAO,IAAI,CAACE,iBAAiB,CAACV,MAAAA,CAAAA;AAChC,SAAA;AAEA;;MAIAW,IAAAA,CAAAA,YAAAA,GAAe,CAACf,IAAcrB,EAAAA,OAAAA,GAAAA;AAC5B,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACF,IAAMrB,EAAAA,OAAAA,CAAAA;AAC5B,SAAA;aAEAqC,gBAAmB,GAAA,CAACC,gBAAwBC,aAAuBvC,EAAAA,OAAAA,GAAAA;YACjE,OAAO,IAAI,CAACuB,OAAO,CAAC;AAACe,gBAAAA,cAAAA;AAAgBC,gBAAAA;aAAc,EAAE;gBACnDT,MAAQ,EAAA,OAAA;AACR,gBAAA,GAAG9B;AACL,aAAA,CAAA;AACF,SAAA;aAEAwC,iBAAoB,GAAA,CAACF,gBAAwBC,aAAuBvC,EAAAA,OAAAA,GAAAA;YAClE,OAAO,IAAI,CAACuB,OAAO,CAAC;gBAACkB,WAAUH,CAAAA,cAAAA,CAAAA;gBAAiBG,WAAUF,CAAAA,aAAAA;aAAe,EAAE;gBACzET,MAAQ,EAAA,QAAA;AACR,gBAAA,GAAG9B;AACL,aAAA,CAAA;AACF,SAAA;AAEA;;MAIA0C,IAAAA,CAAAA,aAAAA,GAAgB,CAACH,aAAuBvC,EAAAA,OAAAA,GAAAA;AACtC,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACgB,aAAevC,EAAAA,OAAAA,CAAAA;AACrC,SAAA;AAEA2C,QAAAA,IAAAA,CAAAA,4BAAAA,GAA+B,CAACJ,aAAuBvC,EAAAA,OAAAA,GAAAA;AACrD,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACgB,aAAe,EAAA;gBAAET,MAAQ,EAAA,IAAA;AAAM,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AAChE,SAAA;AAEA4C,QAAAA,IAAAA,CAAAA,mCAAAA,GAAsC,CAACL,aAAuBvC,EAAAA,OAAAA,GAAAA;AAC5D,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACkB,YAAUF,aAAgB,CAAA,EAAA;gBAAET,MAAQ,EAAA,IAAA;gBAAMG,MAAQ,EAAA,KAAA;AAAO,gBAAA,GAAGjC;AAAQ,aAAA,CAAA;AAC1F,SAAA;AAEA6C,QAAAA,IAAAA,CAAAA,kBAAAA,GAAqB,CAACC,YAAsB9C,EAAAA,OAAAA,GAAAA;AAC1C,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACuB,YAAc,EAAA;gBAAEhB,MAAQ,EAAA,OAAA;AAAS,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AAClE,SAAA;AAEA+C,QAAAA,IAAAA,CAAAA,yBAAAA,GAA4B,CAACD,YAAsB9C,EAAAA,OAAAA,GAAAA;AACjD,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACuB,YAAc,EAAA;gBAChChB,MAAQ,EAAA,OAAA;gBACRG,MAAQ,EAAA,KAAA;AACR,gBAAA,GAAGjC;AACL,aAAA,CAAA;AACF,SAAA;AAEA;;MAGAgD,IAAAA,CAAAA,6BAAAA,GAAgC,CAACF,YAAsB9C,EAAAA,OAAAA,GAAAA;AACrD,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACkB,YAAUK,YAAe,CAAA,EAAA;gBAAEhB,MAAQ,EAAA,IAAA;AAAM,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AAC1E,SAAA;AAEAiD,QAAAA,IAAAA,CAAAA,6BAAAA,GAAgC,CAACV,aAAuBvC,EAAAA,OAAAA,GAAAA;AACtD,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACkB,YAAUF,aAAgB,CAAA,EAAA;gBAAET,MAAQ,EAAA,IAAA;AAAM,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AAC3E,SAAA;AAEAkD,QAAAA,IAAAA,CAAAA,sBAAAA,GAAyB,CAACX,aAAuBvC,EAAAA,OAAAA,GAAAA;AAC/C,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACkB,YAAUF,aAAgB,CAAA,EAAA;gBAAET,MAAQ,EAAA,MAAA;AAAQ,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AAC7E,SAAA;AAEA;;;;;;;;;;AAUC;AAGDmD,QAAAA,IAAAA,CAAAA,YAAAA,GAAe,CAAC3B,KAAkBxB,EAAAA,OAAAA,GAAAA;AAChC,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACC,KAAO,EAAA;gBAAEM,MAAQ,EAAA,OAAA;AAAS,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AAC3D,SAAA;AAEAoD,QAAAA,IAAAA,CAAAA,cAAAA,GAAiB,CAAC5B,KAAkBxB,EAAAA,OAAAA,GAAAA;AAClC,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACC,KAAO,EAAA;gBAAEM,MAAQ,EAAA,IAAA;AAAM,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AACxD,SAAA;AAEAqD,QAAAA,IAAAA,CAAAA,kBAAAA,GAAqB,CAAC7B,KAAkBxB,EAAAA,OAAAA,GAAAA;AACtC,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACC,KAAO,EAAA;gBAAEM,MAAQ,EAAA,QAAA;AAAU,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AAC5D,SAAA;AAEAsD,QAAAA,IAAAA,CAAAA,mBAAAA,GAAsB,CAAC9B,KAAkBxB,EAAAA,OAAAA,GAAAA;AACvC,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACC,KAAO,EAAA;gBAAEM,MAAQ,EAAA,SAAA;AAAW,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AAC7D,SAAA;;AAGAuD,QAAAA,IAAAA,CAAAA,qBAAAA,GAAwB,CAAC/B,KAAkBxB,EAAAA,OAAAA,GAAAA;AACzC,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACC,KAAO,EAAA;gBAAEM,MAAQ,EAAA,QAAA;AAAU,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AAC5D,SAAA;AAEAwD,QAAAA,IAAAA,CAAAA,mBAAAA,GAAsB,CAAChC,KAAkBxB,EAAAA,OAAAA,GAAAA;AACvC,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACC,KAAO,EAAA;gBAAEM,MAAQ,EAAA,UAAA;AAAY,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AAC9D,SAAA;AAEAyD,QAAAA,IAAAA,CAAAA,0BAAAA,GAA6B,CAACjC,KAAkBxB,EAAAA,OAAAA,GAAAA;AAC9C,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACC,KAAO,EAAA;gBAAEM,MAAQ,EAAA,cAAA;AAAgB,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AAClE,SAAA;AAEA0D,QAAAA,IAAAA,CAAAA,oBAAAA,GAAuB,CAAClC,KAAkBxB,EAAAA,OAAAA,GAAAA;AACxC,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACC,KAAO,EAAA;gBAAEM,MAAQ,EAAA,iBAAA;AAAmB,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AACrE,SAAA;AAEA2D,QAAAA,IAAAA,CAAAA,iBAAAA,GAAoB,CAACnC,KAAkBxB,EAAAA,OAAAA,GAAAA;AACrC,YAAA,OAAO,IAAI,CAACuB,OAAO,CAACC,KAAO,EAAA;gBAAEM,MAAQ,EAAA,aAAA;AAAe,gBAAA,GAAG9B;AAAQ,aAAA,CAAA;AACjE,SAAA;AAEA;;;;;;;;;;;;;;;MAgBA4D,IAAAA,CAAAA,gBAAAA,GAAmB,CAACvC,IAAcwC,EAAAA,GAAAA,GAAAA;AAChC,YAAA,IAAI,CAACC,WAAAA,CAAUD,GAAQA,CAAAA,IAAAA,GAAAA,IAAO,CAAG,EAAA;AAC/B,gBAAA,MAAM,IAAIE,KAAM,CAAA,CAAC,0DAA0D,EAAEF,IAAI,CAAC,CAAA;AACpF;YACA,IAAIxC,IAAAA,CAAK2C,MAAM,IAAIH,GAAK,EAAA;gBACtB,OAAOxC,IAAAA;AACT;YACA,IAAIwC,GAAAA,GAAM,IAAI,CAACrD,gBAAgB,GAAG,IAAI,CAACH,WAAW,EAAE;gBAClD,MAAM,IAAI0D,MACR,CAAC,iEAAiE,EAAE,IAAI,CAAC1D,WAAW,CAAC,yBAAyB,EAAE,IAAI,CAACG,gBAAgB,CAAC,YAAY,EAAEqD,GAAI,CAAA,WAAW,EAAExC,IAAAA,CAAK,CAAC,CAAA;AAE/K;YAEA,MAAM4C,eAAAA,GAAkBJ,GAAM,GAAA,IAAI,CAACxD,WAAW,GAAG,IAAI,CAACC,cAAc,CAAC0D,MAAM;AAC3E,YAAA,IAAIC,eAAkB,GAAA,IAAI,CAACzD,gBAAgB,EAAE;AAC3C,gBAAA,MAAM,IAAIuD,KAAAA,CACR,CAAC,qEAAqE,EAAE,IAAI,CAACvD,gBAAgB,CAAC,YAAY,EAAEqD,GAAAA,CAAI,WAAW,EAAExC,KAAK,CAAC,CAAA;AAEvI;AAEA,YAAA,OAAO,CAAC,EAAEA,IAAAA,CAAK6C,SAAS,CAAC,CAAA,EAAGD,iBAAiB,EAAE,IAAI,CAAC3D,cAAc,CAAC,EAAE6D,eACnE9C,CAAAA,IAAAA,EACA,IAAI,CAAChB,WAAW,EAChB,CAAC;AACL,SAAA;AAEA;;;;;;;AAOC,MAAA,IAAA,CACD8B,oBAAoB,CAACiC,UAAAA,GAAAA;AACnB,YAAA,MAAM,EAAEC,SAAS,EAAE,GAAG,IAAI,CAACrE,OAAO;AAElC,YAAA,IAAI,CAAC8D,WAAAA,CAAUO,SAAcA,CAAAA,IAAAA,SAAAA,GAAY,CAAG,EAAA;AAC1C,gBAAA,MAAM,IAAIN,KAAM,CAAA,kEAAA,CAAA;AAClB;AAEA,YAAA,MAAMO,eAAkBF,GAAAA,UAAAA,CACrBxC,GAAG,CAAC,CAAC2C,KAAAA,GAAAA;AACJ,gBAAA,OAAOA,MAAMlD,IAAI;AACnB,aAAA,CAAA,CACCmD,IAAI,CAAC,IAAI,CAACjE,oBAAoB,CAAA;;AAGjC,YAAA,IAAI8D,cAAc,CAAG,EAAA;gBACnB,IAAI,CAACI,kBAAkB,CAACH,eAAiBA,EAAAA,eAAAA,CAAAA;gBACzC,OAAOA,eAAAA;AACT;;AAGA,YAAA,MAAMI,cAAiBN,GAAAA,UAAAA,CACpBxC,GAAG,CAAC,CAAC2C,KAAAA,GAAAA;gBACJ,IAAIA,KAAAA,CAAM1C,YAAY,EAAE;AACtB,oBAAA,OAAO0C,MAAMlD,IAAI;AACnB;AACA,gBAAA,OAAOkD,KAAMvC,CAAAA,SAAS,IAAIuC,KAAAA,CAAMlD,IAAI;AACtC,aAAA,CAAA,CACCmD,IAAI,CAAC,IAAI,CAACjE,oBAAoB,CAAA;YAEjC,IAAImE,cAAAA,CAAeV,MAAM,IAAIK,SAAW,EAAA;gBACtC,IAAI,CAACI,kBAAkB,CAACC,cAAgBJ,EAAAA,eAAAA,CAAAA;gBACxC,OAAOI,cAAAA;AACT;;YAGA,MAAM,CAAC7C,cAAc8C,cAAe,CAAA,GAAGC,YACrC,CAACL,KAAAA,GAAqBA,KAAM1C,CAAAA,YAAY,EACxCuC,UAAAA,CAAAA;YAGF,MAAMS,yBAAAA,GAA4BC,QAAM,CAACP,KAAAA,GACvCA,MAAM1C,YAAY,KAAK,SAAS0C,KAAMvC,CAAAA,SAAS,KAAKV,SAChDiD,GAAAA,KAAAA,CAAMvC,SAAS,CAACgC,MAAM,GACtBO,KAAMlD,CAAAA,IAAI,CAAC2C,MAAM,CACrBW,CAAAA,cAAAA,CAAAA;YACF,MAAMI,qBAAAA,GAAwBX,WAAWJ,MAAM,GAAG,IAAI,CAACzD,oBAAoB,CAACyD,MAAM,GAAG,CAAA;YACrF,MAAMgB,SAAAA,GAAYX,YAAYQ,yBAA4BE,GAAAA,qBAAAA;AAC1D,YAAA,MAAME,oBAAoBC,IAAKC,CAAAA,KAAK,CAACH,SAAAA,GAAYnD,aAAamC,MAAM,CAAA;AAEpE,YAAA,IACEa,4BAA4BE,qBAAwBV,GAAAA,SAAAA,IACpDY,oBAAoB,IAAI,CAACzE,gBAAgB,EACzC;AACA,gBAAA,MAAM,IAAIuD,KAAM,CAAA,uDAAA,CAAA;AAClB;;YAGA,IAAIqB,OAAAA,GAAUJ,SAAYnD,GAAAA,YAAAA,CAAamC,MAAM;;AAG7C,YAAA,MAAMqB,eAAkB,GAAA,IAAI,CAAChF,WAAW,GAAG,IAAI,CAACC,cAAc,CAAC0D,MAAM,GAAG,IAAI,CAACxD,gBAAgB;AAC7F,YAAA,MAAM8E,WAAclB,GAAAA,UAAAA,CAAWmB,MAAM,CACnC,CAACC,KAAOjB,EAAAA,KAAAA,GAAAA;gBACN,IAAIA,KAAAA,CAAM1C,YAAY,EAAE;AACtB,oBAAA,IAAI0C,KAAMlD,CAAAA,IAAI,CAAC2C,MAAM,GAAGiB,iBAAmB,EAAA;AACzC,wBAAA,OAAOO,KAAQjB,GAAAA,KAAAA,CAAMlD,IAAI,CAAC2C,MAAM;AAClC;AACA,oBAAA,OAAOwB,KAAQH,GAAAA,eAAAA;AACjB;AACA,gBAAA,MAAMI,SAAYlB,GAAAA,KAAAA,CAAMvC,SAAS,IAAIuC,MAAMlD,IAAI;gBAC/C,OAAOmE,KAAAA,GAAQC,UAAUzB,MAAM;aAEjCI,EAAAA,UAAAA,CAAWJ,MAAM,GAAG,IAAI,CAACzD,oBAAoB,CAACyD,MAAM,GAAG,CAAA,CAAA;;;AAKzD,YAAA,IAAIK,YAAYiB,WAAa,EAAA;AAC3B,gBAAA,MAAM,IAAIvB,KAAM,CAAA,uDAAA,CAAA;AAClB;;AAGA,YAAA,IAAI2B,WAAsC,EAAE;YAC5C7D,YAAa8D,CAAAA,OAAO,CAAC,CAACpB,KAAAA,GAAAA;AACpB,gBAAA,MAAMqB,YAAerB,GAAAA,KAAAA,CAAMlD,IAAI,CAAC2C,MAAM;AACtC,gBAAA,IAAI4B,eAAeX,iBAAmB,EAAA;AACpCG,oBAAAA,OAAAA,IAAWH,iBAAoBW,GAAAA,YAAAA;AAC/BrB,oBAAAA,KAAAA,CAAMsB,eAAe,GAAGD,YAAAA;iBACnB,MAAA;AACLrB,oBAAAA,KAAAA,CAAMsB,eAAe,GAAGZ,iBAAAA;AACxBS,oBAAAA,QAAAA,CAAS3D,IAAI,CAACwC,KAAAA,CAAAA;AAChB;AACF,aAAA,CAAA;;;AAIA,YAAA,SAASuB,wBAAwBvB,KAA8B,EAAA;gBAC7D,IAAIA,KAAAA,CAAMsB,eAAe,GAAGtB,KAAAA,CAAMlD,IAAI,CAAC2C,MAAM,IAAIoB,OAAAA,GAAU,CAAG,EAAA;AAC5Db,oBAAAA,KAAAA,CAAMsB,eAAe,IAAI,CAAA;oBACzBT,OAAW,IAAA,CAAA;;AAEX,oBAAA,OAAOb,MAAMsB,eAAe,GAAGtB,KAAMlD,CAAAA,IAAI,CAAC2C,MAAM;AAClD;AACA,gBAAA,OAAO;AACT;;YAGA,IAAI+B,eAAAA,GAAkBX,OAAU,GAAA,CAAA,CAAA;AAChC,YAAA,MAAOA,OAAU,GAAA,CAAA,IAAKM,QAAS1B,CAAAA,MAAM,GAAG,CAAG,CAAA;AACzC0B,gBAAAA,QAAAA,GAAWA,QAASM,CAAAA,MAAM,CAAC,CAACzB,QAAUuB,uBAAwBvB,CAAAA,KAAAA,CAAAA,CAAAA;;AAG9D,gBAAA,IAAIa,YAAYW,eAAiB,EAAA;AAC/B,oBAAA;AACF;gBACAA,eAAkBX,GAAAA,OAAAA;AACpB;;AAGA,YAAA,MAAMa,aAAgB7B,GAAAA,UAAAA,CACnBxC,GAAG,CAAC,CAAC2C,KAAAA,GAAAA;;gBAEJ,IACEA,KAAAA,CAAM1C,YAAY,IAClB,iBAAA,IAAqB0C,SACrBA,KAAMsB,CAAAA,eAAe,KAAKvE,SAC1B,EAAA;oBACA,OAAO,IAAI,CAACsC,gBAAgB,CAACW,MAAMlD,IAAI,EAAEkD,MAAMsB,eAAe,CAAA;AAChE;;AAGA,gBAAA,IAAItB,MAAM1C,YAAY,KAAK,KAAS0C,IAAAA,KAAAA,CAAMvC,SAAS,EAAE;AACnD,oBAAA,OAAOuC,MAAMvC,SAAS;AACxB;;AAGA,gBAAA,OAAOuC,MAAMlD,IAAI;AACnB,aAAA,CAAA,CACCmD,IAAI,CAAC,IAAI,CAACjE,oBAAoB,CAAA;;YAGjC,IAAI0F,aAAAA,CAAcjC,MAAM,GAAGK,SAAW,EAAA;AACpC,gBAAA,MAAM,IAAIN,KACR,CAAA,CAAC,yEAAyE,EAAEkC,cAAc,CAAC,CAAA;AAE/F;YAEA,IAAI,CAACxB,kBAAkB,CAACwB,aAAe3B,EAAAA,eAAAA,CAAAA;YACvC,OAAO2B,aAAAA;AACT,SAAA;;;AAIAC,QAAAA,IAAAA,CAAAA,OAAAA,GAAU,IAAIC,GAAAA,EAAAA;AAEdC,QAAAA,IAAAA,CAAAA,kBAAAA,GAAqB,CAACpE,SAAAA,GAAAA;YACpB,OAAO,IAAI,CAACkE,OAAO,CAACG,GAAG,CAAC,IAAI,CAACC,YAAY,CAACtE,SAAeA,CAAAA,CAAAA,IAAAA,SAAAA;AAC3D,SAAA;AAEAyC,QAAAA,IAAAA,CAAAA,kBAAAA,GAAqB,CAACzC,SAAmBuE,EAAAA,QAAAA,GAAAA;;;;AAIvC,YAAA,IAAI,IAAI,CAACL,OAAO,CAACG,GAAG,CAAC,IAAI,CAACC,YAAY,CAACtE,SAAeA,CAAAA,CAAAA,IAAAA,SAAAA,KAAcuE,QAAU,EAAA;AAC5E,gBAAA;AACF;;YAGA,IAAI,CAACL,OAAO,CAACM,GAAG,CAAC,IAAI,CAACF,YAAY,CAACtE,SAAYuE,CAAAA,EAAAA,QAAAA,CAAAA;AACjD,SAAA;AAEAD,QAAAA,IAAAA,CAAAA,YAAAA,GAAe,CAACtE,SAAAA,GAAAA;YACd,OAAO,CAAC,EAAEA,SAAAA,CAAU,CAAC,EAAE,IAAI,CAAChC,OAAO,CAACqE,SAAS,CAAC,CAAC;AACjD,SAAA;QAtYE,+BAAA,CAAA,IAAI,EAAErE,QAAAA,CAAAA,CAAAA,QAAUA,CAAAA,GAAAA,OAAAA;AAClB;AAsYF;AAEA;AACA;AACO,MAAMyG,WAAc,GAAA,IAAI3G,WAAY,CAAA;IAAEuE,SAAWxE,EAAAA;AAAsB,CAAG;;;;;"}