@intlayer/core 9.0.0-canary.2 → 9.0.0-canary.20

package/dist/cjs/dictionaryManipulator/getNodeType.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"getNodeType.cjs","names":["NodeTypes","isValidElement"],"sources":["../../../src/dictionaryManipulator/getNodeType.ts"],"sourcesContent":["import type { ContentNode, TypedNode } from '@intlayer/types/dictionary';\n\nimport type { NodeType } from '@intlayer/types/nodeType';\nimport * as NodeTypes from '@intlayer/types/nodeType';\nimport { isValidElement } from '../utils/isValidReactElement';\n\n/**\n * Type guard to check if content is a TypedNode\n */\nconst isTypedNode = (content: unknown): content is TypedNode => {\n  return (\n    typeof content === 'object' &&\n    content !== null &&\n    'nodeType' in content &&\n    typeof (content as TypedNode).nodeType === 'string'\n  );\n};\n\n/**\n * Type guard to check if content is a valid NodeType\n */\nconst isValidNodeType = (nodeType: string): nodeType is NodeType => {\n  return [\n    NodeTypes.TRANSLATION,\n    NodeTypes.ENUMERATION,\n    NodeTypes.PLURAL,\n    NodeTypes.CONDITION,\n    NodeTypes.INSERTION,\n    NodeTypes.FILE,\n    NodeTypes.OBJECT,\n    NodeTypes.ARRAY,\n    NodeTypes.NESTED,\n    NodeTypes.REACT_NODE,\n    NodeTypes.MARKDOWN,\n    NodeTypes.HTML,\n    NodeTypes.TEXT,\n    NodeTypes.NUMBER,\n    NodeTypes.BOOLEAN,\n    NodeTypes.GENDER,\n    NodeTypes.NULL,\n    NodeTypes.UNKNOWN,\n  ].includes(nodeType as NodeType);\n};\n\nexport const getNodeType = (content: ContentNode): NodeType => {\n  if (typeof content === 'string') {\n    return NodeTypes.TEXT;\n  }\n\n  if (isTypedNode(content)) {\n    const nodeType = content.nodeType;\n    if (isValidNodeType(nodeType)) {\n      return nodeType;\n    }\n    // Fallback for unknown node types\n    return NodeTypes.UNKNOWN;\n  }\n\n  if (Array.isArray(content)) {\n    return NodeTypes.ARRAY;\n  }\n\n  if (isValidElement(content)) {\n    return NodeTypes.REACT_NODE;\n  }\n\n  if (typeof content === 'number') {\n    return NodeTypes.NUMBER;\n  }\n\n  if (typeof content === 'boolean') {\n    return NodeTypes.BOOLEAN;\n  }\n\n  if (content && typeof content === 'object') {\n    return NodeTypes.OBJECT;\n  }\n\n  if (content === null) {\n    return NodeTypes.NULL;\n  }\n\n  return NodeTypes.UNKNOWN;\n};\n"],"mappings":";;;;;;;;;;AASA,MAAM,eAAe,YAA2C;AAC9D,QACE,OAAO,YAAY,YACnB,YAAY,QACZ,cAAc,WACd,OAAQ,QAAsB,aAAa;;;;;AAO/C,MAAM,mBAAmB,aAA2C;AAClE,QAAO;EACLA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACX,CAAC,SAAS,SAAqB;;AAGlC,MAAa,eAAe,YAAmC;AAC7D,KAAI,OAAO,YAAY,SACrB,QAAOA,yBAAU;AAGnB,KAAI,YAAY,QAAQ,EAAE;EACxB,MAAM,WAAW,QAAQ;AACzB,MAAI,gBAAgB,SAAS,CAC3B,QAAO;AAGT,SAAOA,yBAAU;;AAGnB,KAAI,MAAM,QAAQ,QAAQ,CACxB,QAAOA,yBAAU;AAGnB,KAAIC,iDAAe,QAAQ,CACzB,QAAOD,yBAAU;AAGnB,KAAI,OAAO,YAAY,SACrB,QAAOA,yBAAU;AAGnB,KAAI,OAAO,YAAY,UACrB,QAAOA,yBAAU;AAGnB,KAAI,WAAW,OAAO,YAAY,SAChC,QAAOA,yBAAU;AAGnB,KAAI,YAAY,KACd,QAAOA,yBAAU;AAGnB,QAAOA,yBAAU"}
+{"version":3,"file":"getNodeType.cjs","names":["NodeTypes","isValidElement"],"sources":["../../../src/dictionaryManipulator/getNodeType.ts"],"sourcesContent":["import type { ContentNode, TypedNode } from '@intlayer/types/dictionary';\n\nimport type { NodeType } from '@intlayer/types/nodeType';\nimport * as NodeTypes from '@intlayer/types/nodeType';\nimport { isValidElement } from '../utils/isValidReactElement';\n\n/**\n * Type guard to check if content is a TypedNode\n */\nconst isTypedNode = (content: unknown): content is TypedNode => {\n  return (\n    typeof content === 'object' &&\n    content !== null &&\n    'nodeType' in content &&\n    typeof (content as TypedNode).nodeType === 'string'\n  );\n};\n\n/**\n * Type guard to check if content is a valid NodeType\n */\nconst isValidNodeType = (nodeType: string): nodeType is NodeType => {\n  return [\n    NodeTypes.TRANSLATION,\n    NodeTypes.ENUMERATION,\n    NodeTypes.PLURAL,\n    NodeTypes.CONDITION,\n    NodeTypes.INSERTION,\n    NodeTypes.FILE,\n    NodeTypes.OBJECT,\n    NodeTypes.ARRAY,\n    NodeTypes.NESTED,\n    NodeTypes.REACT_NODE,\n    NodeTypes.MARKDOWN,\n    NodeTypes.HTML,\n    NodeTypes.TEXT,\n    NodeTypes.NUMBER,\n    NodeTypes.BOOLEAN,\n    NodeTypes.GENDER,\n    NodeTypes.NULL,\n    NodeTypes.UNKNOWN,\n  ].includes(nodeType as NodeType);\n};\n\nexport const getNodeType = (content: ContentNode): NodeType => {\n  if (typeof content === 'string') {\n    return NodeTypes.TEXT;\n  }\n\n  if (isTypedNode(content)) {\n    const nodeType = content.nodeType;\n    if (isValidNodeType(nodeType)) {\n      return nodeType;\n    }\n    // Fallback for unknown node types\n    return NodeTypes.UNKNOWN;\n  }\n\n  if (Array.isArray(content)) {\n    return NodeTypes.ARRAY;\n  }\n\n  if (isValidElement(content)) {\n    return NodeTypes.REACT_NODE;\n  }\n\n  if (typeof content === 'number') {\n    return NodeTypes.NUMBER;\n  }\n\n  if (typeof content === 'boolean') {\n    return NodeTypes.BOOLEAN;\n  }\n\n  if (content && typeof content === 'object') {\n    return NodeTypes.OBJECT;\n  }\n\n  if (content === null) {\n    return NodeTypes.NULL;\n  }\n\n  return NodeTypes.UNKNOWN;\n};\n"],"mappings":";;;;;;;;;;AASA,MAAM,eAAe,YAA2C;CAC9D,OACE,OAAO,YAAY,YACnB,YAAY,QACZ,cAAc,WACd,OAAQ,QAAsB,aAAa;AAE/C;;;;AAKA,MAAM,mBAAmB,aAA2C;CAClE,OAAO;EACLA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;EACVA,yBAAU;CACZ,CAAC,CAAC,SAAS,QAAoB;AACjC;AAEA,MAAa,eAAe,YAAmC;CAC7D,IAAI,OAAO,YAAY,UACrB,OAAOA,yBAAU;CAGnB,IAAI,YAAY,OAAO,GAAG;EACxB,MAAM,WAAW,QAAQ;EACzB,IAAI,gBAAgB,QAAQ,GAC1B,OAAO;EAGT,OAAOA,yBAAU;CACnB;CAEA,IAAI,MAAM,QAAQ,OAAO,GACvB,OAAOA,yBAAU;CAGnB,IAAIC,iDAAe,OAAO,GACxB,OAAOD,yBAAU;CAGnB,IAAI,OAAO,YAAY,UACrB,OAAOA,yBAAU;CAGnB,IAAI,OAAO,YAAY,WACrB,OAAOA,yBAAU;CAGnB,IAAI,WAAW,OAAO,YAAY,UAChC,OAAOA,yBAAU;CAGnB,IAAI,YAAY,MACd,OAAOA,yBAAU;CAGnB,OAAOA,yBAAU;AACnB"}

package/dist/cjs/dictionaryManipulator/index.cjs

@@ -20,14 +20,14 @@ exports.QUALIFIER_ORDER = require_dictionaryManipulator_qualifiedDictionary.QUAL
 exports.editDictionaryByKeyPath = require_dictionaryManipulator_editDictionaryByKeyPath.editDictionaryByKeyPath;
 exports.getContentNodeByKeyPath = require_dictionaryManipulator_getContentNodeByKeyPath.getContentNodeByKeyPath;
 exports.getDefaultNode = require_dictionaryManipulator_getDefaultNode.getDefaultNode;
-exports.getDictionaryCompositeId = require_dictionaryManipulator_qualifiedDictionary.getDictionaryCompositeId;
-exports.getDictionaryQualifierId = require_dictionaryManipulator_qualifiedDictionary.getDictionaryQualifierId;
-exports.getDictionaryQualifierSegments = require_dictionaryManipulator_qualifiedDictionary.getDictionaryQualifierSegments;
+exports.getDictionaryCompositeIds = require_dictionaryManipulator_qualifiedDictionary.getDictionaryCompositeIds;
+exports.getDictionaryQualifierIds = require_dictionaryManipulator_qualifiedDictionary.getDictionaryQualifierIds;
 exports.getDictionaryQualifierTypes = require_dictionaryManipulator_qualifiedDictionary.getDictionaryQualifierTypes;
 exports.getDictionarySelectorCacheKey = require_dictionaryManipulator_qualifiedDictionary.getDictionarySelectorCacheKey;
 exports.getEmptyNode = require_dictionaryManipulator_getEmptyNode.getEmptyNode;
 exports.getNodeChildren = require_dictionaryManipulator_getNodeChildren.getNodeChildren;
 exports.getNodeType = require_dictionaryManipulator_getNodeType.getNodeType;
+exports.getVariantIds = require_dictionaryManipulator_qualifiedDictionary.getVariantIds;
 exports.isQualifiedDictionaryGroup = require_dictionaryManipulator_qualifiedDictionary.isQualifiedDictionaryGroup;
 exports.isQualifiedDynamicLoaderMap = require_dictionaryManipulator_qualifiedDictionary.isQualifiedDynamicLoaderMap;
 exports.mergeDictionaries = require_dictionaryManipulator_mergeDictionaries.mergeDictionaries;
@@ -42,4 +42,5 @@ exports.renameContentNodeByKeyPath = require_dictionaryManipulator_renameContent
 exports.resolveQualifiedDictionary = require_dictionaryManipulator_qualifiedDictionary.resolveQualifiedDictionary;
 exports.resolveQualifiedDynamicContent = require_dictionaryManipulator_qualifiedDictionary.resolveQualifiedDynamicContent;
 exports.resolveQualifiedDynamicContentAsync = require_dictionaryManipulator_qualifiedDictionary.resolveQualifiedDynamicContentAsync;
+exports.serializeVariant = require_dictionaryManipulator_qualifiedDictionary.serializeVariant;
 exports.updateNodeChildren = require_dictionaryManipulator_updateNodeChildren.updateNodeChildren;

package/dist/cjs/dictionaryManipulator/mergeDictionaries.cjs

@@ -1,5 +1,4 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-const require_runtime = require('../_virtual/_rolldown/runtime.cjs');
 const require_deepTransformPlugins_getMultilingualDictionary = require('../deepTransformPlugins/getMultilingualDictionary.cjs');
 const require_dictionaryManipulator_getNodeType = require('./getNodeType.cjs');
 let _intlayer_config_built = require("@intlayer/config/built");
@@ -24,7 +23,7 @@ const customMerge = (destination, source) => {
 	if (Array.isArray(destination) && Array.isArray(source)) return arrayMerge(destination, source);
 	if (typeof destination === "object" && typeof source === "object") {
 		const result = {};
-		const allKeys = new Set([...Object.keys(destination), ...Object.keys(source)]);
+		const allKeys = /* @__PURE__ */ new Set([...Object.keys(destination), ...Object.keys(source)]);
 		for (const key of allKeys) result[key] = customMerge(destination[key], source[key]);
 		return result;
 	}

package/dist/cjs/dictionaryManipulator/mergeDictionaries.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"mergeDictionaries.cjs","names":["getNodeType","getMultilingualDictionary"],"sources":["../../../src/dictionaryManipulator/mergeDictionaries.ts"],"sourcesContent":["import { log } from '@intlayer/config/built';\nimport { colorizeKey, getAppLogger } from '@intlayer/config/logger';\nimport type {\n  ContentNode,\n  Dictionary,\n  LocalDictionaryId,\n} from '@intlayer/types/dictionary';\nimport { getMultilingualDictionary } from '../deepTransformPlugins';\nimport { getNodeType } from './getNodeType';\n\n// Extended type that includes arrays for internal merge operations\ntype MergeableContent = ContentNode | ContentNode[];\n\nconst checkTypesMatch = (\n  object1: ContentNode,\n  object2: ContentNode,\n  object2LocalId: LocalDictionaryId | undefined,\n  dictionaryKey: string,\n  path: string[] = []\n): void => {\n  const appLogger = getAppLogger({ log });\n\n  // If either side is missing/undefined, allow merge without error\n  if (\n    object1 === undefined ||\n    object1 === null ||\n    object2 === undefined ||\n    object2 === null\n  )\n    return;\n\n  const type1 = getNodeType(object1);\n  const type2 = getNodeType(object2);\n\n  // Unknown types are treated as flexible; skip strict mismatch reporting\n  if (type1 === 'unknown' || type2 === 'unknown') return;\n\n  if (type1 !== type2) {\n    appLogger(\n      [\n        `Error: Dictionary ${colorizeKey(dictionaryKey)} has a multiple content files with type mismatch at path \"${path.join('.')}\": Cannot merge ${type1} with ${type2} while merging ${object2LocalId}`,\n      ],\n      {\n        level: 'error',\n      }\n    );\n\n    return;\n  }\n};\n\n// Custom merge function that prefers destination (first dictionary) values\nconst customMerge = (\n  destination: ContentNode,\n  source: ContentNode\n): MergeableContent => {\n  // If destination is undefined/null, use source\n  if (destination === undefined || destination === null) {\n    return source;\n  }\n\n  // If source is undefined/null, use destination\n  if (source === undefined || source === null) {\n    return destination;\n  }\n\n  // For primitive values, prefer destination (first dictionary)\n  if (typeof destination !== 'object' || typeof source !== 'object') {\n    return destination;\n  }\n\n  // For arrays, use our custom array merge\n  if (Array.isArray(destination) && Array.isArray(source)) {\n    return arrayMerge(\n      destination as ContentNode[],\n      source as ContentNode[]\n    ) as MergeableContent;\n  }\n\n  // For objects, recursively merge with our custom logic\n  if (typeof destination === 'object' && typeof source === 'object') {\n    const result: Record<string, MergeableContent> = {};\n    const allKeys = new Set([\n      ...Object.keys(destination as unknown as Record<string, ContentNode>),\n      ...Object.keys(source as unknown as Record<string, ContentNode>),\n    ]);\n\n    for (const key of allKeys) {\n      result[key] = customMerge(\n        (destination as unknown as Record<string, ContentNode>)[key],\n        (source as unknown as Record<string, ContentNode>)[key]\n      );\n    }\n\n    return result as unknown as MergeableContent;\n  }\n\n  // Fallback to destination\n  return destination;\n};\n\n// Custom array merge strategy that merges arrays by key when present, otherwise by index\nconst arrayMerge = (\n  destinationArray: ContentNode[],\n  sourceArray: ContentNode[]\n): MergeableContent[] => {\n  // Check if both arrays contain only primitives\n  const destHasOnlyPrimitives = destinationArray.every(\n    (item) => typeof item !== 'object' || item === null\n  );\n  const sourceHasOnlyPrimitives = sourceArray.every(\n    (item) => typeof item !== 'object' || item === null\n  );\n\n  // If both arrays contain only primitives, use the source array (second dictionary)\n  if (destHasOnlyPrimitives && sourceHasOnlyPrimitives) {\n    return sourceArray;\n  }\n\n  // Otherwise, merge by index with object merging logic\n  const result: MergeableContent[] = [];\n  const maxLength = Math.max(destinationArray.length, sourceArray.length);\n\n  for (let i = 0; i < maxLength; i++) {\n    const destItem = destinationArray[i];\n    const sourceItem = sourceArray[i];\n\n    if (destItem === undefined && sourceItem === undefined) {\n    } else if (destItem === undefined) {\n      // Only source exists, add it\n      result.push(sourceItem);\n    } else if (sourceItem === undefined) {\n      // Only destination exists, add it\n      result.push(destItem);\n    } else {\n      // Both exist, merge them\n      if (\n        typeof destItem === 'object' &&\n        typeof sourceItem === 'object' &&\n        destItem !== null &&\n        sourceItem !== null\n      ) {\n        // Check if both objects have a 'key' property for keyed merging\n        if (\n          'key' in destItem &&\n          'key' in sourceItem &&\n          (destItem as Record<string, string>).key ===\n            (sourceItem as Record<string, string>).key\n        ) {\n          // Merge objects with same key, preferring destination (first dictionary) values\n          result.push(customMerge(destItem, sourceItem));\n        } else {\n          // Merge objects by index, preferring destination (first dictionary) values\n          result.push(customMerge(destItem, sourceItem));\n        }\n      } else {\n        // For primitives or non-objects, use destination value (first dictionary)\n        result.push(destItem);\n      }\n    }\n  }\n\n  return result;\n};\n\nexport const mergeDictionaries = (dictionaries: Dictionary[]): Dictionary => {\n  const localIds = Array.from(\n    new Set<LocalDictionaryId>(\n      dictionaries.filter((dict) => dict.localId).map((dict) => dict.localId!)\n    )\n  );\n\n  if (!dictionaries[0] || dictionaries.length <= 1) {\n    return dictionaries[0]!;\n  }\n\n  const dictionariesKeys = dictionaries.map((dict) => dict.key);\n\n  // Check if all dictionaries have the same key\n  if (new Set(dictionariesKeys).size !== 1) {\n    throw new Error('All dictionaries must have the same key');\n  }\n\n  let mergedContent: Dictionary['content'] = dictionaries[0].content;\n\n  for (let i = 1; i < dictionaries.length; i++) {\n    const dict = dictionaries[i];\n\n    if (!dict) continue;\n\n    // If the dictionary is a per-locale dictionary, transform it to a partial multilingual dictionary\n    const currentDictionary = getMultilingualDictionary(dict);\n\n    // Check types before merging\n    checkTypesMatch(\n      mergedContent,\n      currentDictionary.content,\n      currentDictionary.localId,\n      currentDictionary.key,\n      []\n    );\n\n    mergedContent = customMerge(\n      mergedContent,\n      currentDictionary.content\n    ) as ContentNode;\n  }\n\n  const mergedDictionary: Dictionary = {\n    key: dictionaries[0].key,\n    content: mergedContent,\n    localIds,\n  };\n\n  return mergedDictionary;\n};\n"],"mappings":";;;;;;;;AAaA,MAAM,mBACJ,SACA,SACA,gBACA,eACA,OAAiB,EAAE,KACV;CACT,MAAM,sDAAyB,EAAE,iCAAK,CAAC;AAGvC,KACE,YAAY,UACZ,YAAY,QACZ,YAAY,UACZ,YAAY,KAEZ;CAEF,MAAM,QAAQA,sDAAY,QAAQ;CAClC,MAAM,QAAQA,sDAAY,QAAQ;AAGlC,KAAI,UAAU,aAAa,UAAU,UAAW;AAEhD,KAAI,UAAU,OAAO;AACnB,YACE,CACE,8DAAiC,cAAc,CAAC,4DAA4D,KAAK,KAAK,IAAI,CAAC,kBAAkB,MAAM,QAAQ,MAAM,iBAAiB,iBACnL,EACD,EACE,OAAO,SACR,CACF;AAED;;;AAKJ,MAAM,eACJ,aACA,WACqB;AAErB,KAAI,gBAAgB,UAAa,gBAAgB,KAC/C,QAAO;AAIT,KAAI,WAAW,UAAa,WAAW,KACrC,QAAO;AAIT,KAAI,OAAO,gBAAgB,YAAY,OAAO,WAAW,SACvD,QAAO;AAIT,KAAI,MAAM,QAAQ,YAAY,IAAI,MAAM,QAAQ,OAAO,CACrD,QAAO,WACL,aACA,OACD;AAIH,KAAI,OAAO,gBAAgB,YAAY,OAAO,WAAW,UAAU;EACjE,MAAM,SAA2C,EAAE;EACnD,MAAM,UAAU,IAAI,IAAI,CACtB,GAAG,OAAO,KAAK,YAAsD,EACrE,GAAG,OAAO,KAAK,OAAiD,CACjE,CAAC;AAEF,OAAK,MAAM,OAAO,QAChB,QAAO,OAAO,YACX,YAAuD,MACvD,OAAkD,KACpD;AAGH,SAAO;;AAIT,QAAO;;AAIT,MAAM,cACJ,kBACA,gBACuB;CAEvB,MAAM,wBAAwB,iBAAiB,OAC5C,SAAS,OAAO,SAAS,YAAY,SAAS,KAChD;CACD,MAAM,0BAA0B,YAAY,OACzC,SAAS,OAAO,SAAS,YAAY,SAAS,KAChD;AAGD,KAAI,yBAAyB,wBAC3B,QAAO;CAIT,MAAM,SAA6B,EAAE;CACrC,MAAM,YAAY,KAAK,IAAI,iBAAiB,QAAQ,YAAY,OAAO;AAEvE,MAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;EAClC,MAAM,WAAW,iBAAiB;EAClC,MAAM,aAAa,YAAY;AAE/B,MAAI,aAAa,UAAa,eAAe,QAAW,YAC7C,aAAa,OAEtB,QAAO,KAAK,WAAW;WACd,eAAe,OAExB,QAAO,KAAK,SAAS;WAInB,OAAO,aAAa,YACpB,OAAO,eAAe,YACtB,aAAa,QACb,eAAe,KAGf,KACE,SAAS,YACT,SAAS,cACR,SAAoC,QAClC,WAAsC,IAGzC,QAAO,KAAK,YAAY,UAAU,WAAW,CAAC;MAG9C,QAAO,KAAK,YAAY,UAAU,WAAW,CAAC;MAIhD,QAAO,KAAK,SAAS;;AAK3B,QAAO;;AAGT,MAAa,qBAAqB,iBAA2C;CAC3E,MAAM,WAAW,MAAM,KACrB,IAAI,IACF,aAAa,QAAQ,SAAS,KAAK,QAAQ,CAAC,KAAK,SAAS,KAAK,QAAS,CACzE,CACF;AAED,KAAI,CAAC,aAAa,MAAM,aAAa,UAAU,EAC7C,QAAO,aAAa;CAGtB,MAAM,mBAAmB,aAAa,KAAK,SAAS,KAAK,IAAI;AAG7D,KAAI,IAAI,IAAI,iBAAiB,CAAC,SAAS,EACrC,OAAM,IAAI,MAAM,0CAA0C;CAG5D,IAAI,gBAAuC,aAAa,GAAG;AAE3D,MAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,OAAO,aAAa;AAE1B,MAAI,CAAC,KAAM;EAGX,MAAM,oBAAoBC,iFAA0B,KAAK;AAGzD,kBACE,eACA,kBAAkB,SAClB,kBAAkB,SAClB,kBAAkB,KAClB,EAAE,CACH;AAED,kBAAgB,YACd,eACA,kBAAkB,QACnB;;AASH,QAAO;EALL,KAAK,aAAa,GAAG;EACrB,SAAS;EACT;EAGqB"}
+{"version":3,"file":"mergeDictionaries.cjs","names":["getNodeType","getMultilingualDictionary"],"sources":["../../../src/dictionaryManipulator/mergeDictionaries.ts"],"sourcesContent":["import { log } from '@intlayer/config/built';\nimport { colorizeKey, getAppLogger } from '@intlayer/config/logger';\nimport type {\n  ContentNode,\n  Dictionary,\n  LocalDictionaryId,\n} from '@intlayer/types/dictionary';\nimport { getMultilingualDictionary } from '../deepTransformPlugins';\nimport { getNodeType } from './getNodeType';\n\n// Extended type that includes arrays for internal merge operations\ntype MergeableContent = ContentNode | ContentNode[];\n\nconst checkTypesMatch = (\n  object1: ContentNode,\n  object2: ContentNode,\n  object2LocalId: LocalDictionaryId | undefined,\n  dictionaryKey: string,\n  path: string[] = []\n): void => {\n  const appLogger = getAppLogger({ log });\n\n  // If either side is missing/undefined, allow merge without error\n  if (\n    object1 === undefined ||\n    object1 === null ||\n    object2 === undefined ||\n    object2 === null\n  )\n    return;\n\n  const type1 = getNodeType(object1);\n  const type2 = getNodeType(object2);\n\n  // Unknown types are treated as flexible; skip strict mismatch reporting\n  if (type1 === 'unknown' || type2 === 'unknown') return;\n\n  if (type1 !== type2) {\n    appLogger(\n      [\n        `Error: Dictionary ${colorizeKey(dictionaryKey)} has a multiple content files with type mismatch at path \"${path.join('.')}\": Cannot merge ${type1} with ${type2} while merging ${object2LocalId}`,\n      ],\n      {\n        level: 'error',\n      }\n    );\n\n    return;\n  }\n};\n\n// Custom merge function that prefers destination (first dictionary) values\nconst customMerge = (\n  destination: ContentNode,\n  source: ContentNode\n): MergeableContent => {\n  // If destination is undefined/null, use source\n  if (destination === undefined || destination === null) {\n    return source;\n  }\n\n  // If source is undefined/null, use destination\n  if (source === undefined || source === null) {\n    return destination;\n  }\n\n  // For primitive values, prefer destination (first dictionary)\n  if (typeof destination !== 'object' || typeof source !== 'object') {\n    return destination;\n  }\n\n  // For arrays, use our custom array merge\n  if (Array.isArray(destination) && Array.isArray(source)) {\n    return arrayMerge(\n      destination as ContentNode[],\n      source as ContentNode[]\n    ) as MergeableContent;\n  }\n\n  // For objects, recursively merge with our custom logic\n  if (typeof destination === 'object' && typeof source === 'object') {\n    const result: Record<string, MergeableContent> = {};\n    const allKeys = new Set([\n      ...Object.keys(destination as unknown as Record<string, ContentNode>),\n      ...Object.keys(source as unknown as Record<string, ContentNode>),\n    ]);\n\n    for (const key of allKeys) {\n      result[key] = customMerge(\n        (destination as unknown as Record<string, ContentNode>)[key],\n        (source as unknown as Record<string, ContentNode>)[key]\n      );\n    }\n\n    return result as unknown as MergeableContent;\n  }\n\n  // Fallback to destination\n  return destination;\n};\n\n// Custom array merge strategy that merges arrays by key when present, otherwise by index\nconst arrayMerge = (\n  destinationArray: ContentNode[],\n  sourceArray: ContentNode[]\n): MergeableContent[] => {\n  // Check if both arrays contain only primitives\n  const destHasOnlyPrimitives = destinationArray.every(\n    (item) => typeof item !== 'object' || item === null\n  );\n  const sourceHasOnlyPrimitives = sourceArray.every(\n    (item) => typeof item !== 'object' || item === null\n  );\n\n  // If both arrays contain only primitives, use the source array (second dictionary)\n  if (destHasOnlyPrimitives && sourceHasOnlyPrimitives) {\n    return sourceArray;\n  }\n\n  // Otherwise, merge by index with object merging logic\n  const result: MergeableContent[] = [];\n  const maxLength = Math.max(destinationArray.length, sourceArray.length);\n\n  for (let i = 0; i < maxLength; i++) {\n    const destItem = destinationArray[i];\n    const sourceItem = sourceArray[i];\n\n    if (destItem === undefined && sourceItem === undefined) {\n    } else if (destItem === undefined) {\n      // Only source exists, add it\n      result.push(sourceItem);\n    } else if (sourceItem === undefined) {\n      // Only destination exists, add it\n      result.push(destItem);\n    } else {\n      // Both exist, merge them\n      if (\n        typeof destItem === 'object' &&\n        typeof sourceItem === 'object' &&\n        destItem !== null &&\n        sourceItem !== null\n      ) {\n        // Check if both objects have a 'key' property for keyed merging\n        if (\n          'key' in destItem &&\n          'key' in sourceItem &&\n          (destItem as Record<string, string>).key ===\n            (sourceItem as Record<string, string>).key\n        ) {\n          // Merge objects with same key, preferring destination (first dictionary) values\n          result.push(customMerge(destItem, sourceItem));\n        } else {\n          // Merge objects by index, preferring destination (first dictionary) values\n          result.push(customMerge(destItem, sourceItem));\n        }\n      } else {\n        // For primitives or non-objects, use destination value (first dictionary)\n        result.push(destItem);\n      }\n    }\n  }\n\n  return result;\n};\n\nexport const mergeDictionaries = (dictionaries: Dictionary[]): Dictionary => {\n  const localIds = Array.from(\n    new Set<LocalDictionaryId>(\n      dictionaries.filter((dict) => dict.localId).map((dict) => dict.localId!)\n    )\n  );\n\n  if (!dictionaries[0] || dictionaries.length <= 1) {\n    return dictionaries[0]!;\n  }\n\n  const dictionariesKeys = dictionaries.map((dict) => dict.key);\n\n  // Check if all dictionaries have the same key\n  if (new Set(dictionariesKeys).size !== 1) {\n    throw new Error('All dictionaries must have the same key');\n  }\n\n  let mergedContent: Dictionary['content'] = dictionaries[0].content;\n\n  for (let i = 1; i < dictionaries.length; i++) {\n    const dict = dictionaries[i];\n\n    if (!dict) continue;\n\n    // If the dictionary is a per-locale dictionary, transform it to a partial multilingual dictionary\n    const currentDictionary = getMultilingualDictionary(dict);\n\n    // Check types before merging\n    checkTypesMatch(\n      mergedContent,\n      currentDictionary.content,\n      currentDictionary.localId,\n      currentDictionary.key,\n      []\n    );\n\n    mergedContent = customMerge(\n      mergedContent,\n      currentDictionary.content\n    ) as ContentNode;\n  }\n\n  const mergedDictionary: Dictionary = {\n    key: dictionaries[0].key,\n    content: mergedContent,\n    localIds,\n  };\n\n  return mergedDictionary;\n};\n"],"mappings":";;;;;;;AAaA,MAAM,mBACJ,SACA,SACA,gBACA,eACA,OAAiB,CAAC,MACT;CACT,MAAM,sDAAyB,EAAE,gCAAI,CAAC;CAGtC,IACE,YAAY,UACZ,YAAY,QACZ,YAAY,UACZ,YAAY,MAEZ;CAEF,MAAM,QAAQA,sDAAY,OAAO;CACjC,MAAM,QAAQA,sDAAY,OAAO;CAGjC,IAAI,UAAU,aAAa,UAAU,WAAW;CAEhD,IAAI,UAAU,OAAO;EACnB,UACE,CACE,8DAAiC,aAAa,EAAE,4DAA4D,KAAK,KAAK,GAAG,EAAE,kBAAkB,MAAM,QAAQ,MAAM,iBAAiB,gBACpL,GACA,EACE,OAAO,QACT,CACF;EAEA;CACF;AACF;AAGA,MAAM,eACJ,aACA,WACqB;CAErB,IAAI,gBAAgB,UAAa,gBAAgB,MAC/C,OAAO;CAIT,IAAI,WAAW,UAAa,WAAW,MACrC,OAAO;CAIT,IAAI,OAAO,gBAAgB,YAAY,OAAO,WAAW,UACvD,OAAO;CAIT,IAAI,MAAM,QAAQ,WAAW,KAAK,MAAM,QAAQ,MAAM,GACpD,OAAO,WACL,aACA,MACF;CAIF,IAAI,OAAO,gBAAgB,YAAY,OAAO,WAAW,UAAU;EACjE,MAAM,SAA2C,CAAC;EAClD,MAAM,0BAAU,IAAI,IAAI,CACtB,GAAG,OAAO,KAAK,WAAqD,GACpE,GAAG,OAAO,KAAK,MAAgD,CACjE,CAAC;EAED,KAAK,MAAM,OAAO,SAChB,OAAO,OAAO,YACX,YAAuD,MACvD,OAAkD,IACrD;EAGF,OAAO;CACT;CAGA,OAAO;AACT;AAGA,MAAM,cACJ,kBACA,gBACuB;CAEvB,MAAM,wBAAwB,iBAAiB,OAC5C,SAAS,OAAO,SAAS,YAAY,SAAS,IACjD;CACA,MAAM,0BAA0B,YAAY,OACzC,SAAS,OAAO,SAAS,YAAY,SAAS,IACjD;CAGA,IAAI,yBAAyB,yBAC3B,OAAO;CAIT,MAAM,SAA6B,CAAC;CACpC,MAAM,YAAY,KAAK,IAAI,iBAAiB,QAAQ,YAAY,MAAM;CAEtE,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;EAClC,MAAM,WAAW,iBAAiB;EAClC,MAAM,aAAa,YAAY;EAE/B,IAAI,aAAa,UAAa,eAAe,QAAW,CACxD,OAAO,IAAI,aAAa,QAEtB,OAAO,KAAK,UAAU;OACjB,IAAI,eAAe,QAExB,OAAO,KAAK,QAAQ;OAGpB,IACE,OAAO,aAAa,YACpB,OAAO,eAAe,YACtB,aAAa,QACb,eAAe,MAGf,IACE,SAAS,YACT,SAAS,cACR,SAAoC,QAClC,WAAsC,KAGzC,OAAO,KAAK,YAAY,UAAU,UAAU,CAAC;OAG7C,OAAO,KAAK,YAAY,UAAU,UAAU,CAAC;OAI/C,OAAO,KAAK,QAAQ;CAG1B;CAEA,OAAO;AACT;AAEA,MAAa,qBAAqB,iBAA2C;CAC3E,MAAM,WAAW,MAAM,KACrB,IAAI,IACF,aAAa,QAAQ,SAAS,KAAK,OAAO,CAAC,CAAC,KAAK,SAAS,KAAK,OAAQ,CACzE,CACF;CAEA,IAAI,CAAC,aAAa,MAAM,aAAa,UAAU,GAC7C,OAAO,aAAa;CAGtB,MAAM,mBAAmB,aAAa,KAAK,SAAS,KAAK,GAAG;CAG5D,IAAI,IAAI,IAAI,gBAAgB,CAAC,CAAC,SAAS,GACrC,MAAM,IAAI,MAAM,yCAAyC;CAG3D,IAAI,gBAAuC,aAAa,EAAE,CAAC;CAE3D,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,OAAO,aAAa;EAE1B,IAAI,CAAC,MAAM;EAGX,MAAM,oBAAoBC,iFAA0B,IAAI;EAGxD,gBACE,eACA,kBAAkB,SAClB,kBAAkB,SAClB,kBAAkB,KAClB,CAAC,CACH;EAEA,gBAAgB,YACd,eACA,kBAAkB,OACpB;CACF;CAQA,OAAO;EALL,KAAK,aAAa,EAAE,CAAC;EACrB,SAAS;EACT;CAGoB;AACxB"}

package/dist/cjs/dictionaryManipulator/mergeQualifiedDictionaries.cjs

@@ -1,5 +1,4 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-const require_runtime = require('../_virtual/_rolldown/runtime.cjs');
 const require_dictionaryManipulator_qualifiedDictionary = require('./qualifiedDictionary.cjs');
 const require_dictionaryManipulator_mergeDictionaries = require('./mergeDictionaries.cjs');
 let _intlayer_config_built = require("@intlayer/config/built");
@@ -13,7 +12,7 @@ let _intlayer_config_logger = require("@intlayer/config/logger");
 *   `mergeDictionaries` (single merged dictionary).
 * - At least one dictionary declares a qualifier → the group's dimension set is
 *   the union of every declared dimension (in canonical order
-*   `variant → meta → item`). Dictionaries are grouped by their composite id
+*   `variant → item`). Dictionaries are grouped by their composite id
 *   (one segment per dimension), merged within each group (locale completion /
 *   priority overrides preserved), and a `QualifiedDictionaryGroup` is returned.
 *   Unqualified siblings act as shared base content merged into every entry.
@@ -31,27 +30,26 @@ const mergeQualifiedDictionaries = (dictionaries) => {
 	const baseDictionaries = [];
 	const entriesDictionaries = /* @__PURE__ */ new Map();
 	dictionaries.forEach((dictionary, index) => {
-		if (perDictionaryTypes[index].length === 0) {
+		if (perDictionaryTypes[index]?.length === 0) {
 			baseDictionaries.push(dictionary);
 			return;
 		}
-		const compositeId = require_dictionaryManipulator_qualifiedDictionary.getDictionaryCompositeId(dictionary, groupQualifierTypes);
-		if (compositeId === void 0) {
+		const compositeIds = require_dictionaryManipulator_qualifiedDictionary.getDictionaryCompositeIds(dictionary, groupQualifierTypes);
+		if (compositeIds === void 0) {
 			appLogger(`Dictionary ${(0, _intlayer_config_logger.colorizeKey)(dictionary.key)} declares (${perDictionaryTypes[index].join(", ")}) but the key's dimensions are (${groupQualifierTypes.join(", ")}); every entry must declare all of them. Entry ignored${dictionary.filePath ? ` - ${dictionary.filePath}` : ""}.`, { level: "error" });
 			return;
 		}
-		const existingEntries = entriesDictionaries.get(compositeId) ?? [];
-		existingEntries.push(dictionary);
-		entriesDictionaries.set(compositeId, existingEntries);
+		for (const compositeId of compositeIds) {
+			const existingEntries = entriesDictionaries.get(compositeId) ?? [];
+			existingEntries.push(dictionary);
+			entriesDictionaries.set(compositeId, existingEntries);
+		}
 	});
 	const content = {};
-	const metaByCompositeId = {};
-	const declaresMeta = groupQualifierTypes.includes("meta");
 	let importMode;
 	for (const [compositeId, qualifiedDictionaries] of entriesDictionaries) {
 		content[compositeId] = require_dictionaryManipulator_mergeDictionaries.mergeDictionaries([...qualifiedDictionaries, ...baseDictionaries]).content;
 		const [firstQualified] = qualifiedDictionaries;
-		if (declaresMeta && firstQualified?.meta !== void 0) metaByCompositeId[compositeId] = firstQualified.meta;
 		importMode ??= firstQualified?.importMode;
 	}
 	const localIds = Array.from(new Set(dictionaries.filter((dictionary) => dictionary.localId).map((dictionary) => dictionary.localId)));
@@ -59,7 +57,6 @@ const mergeQualifiedDictionaries = (dictionaries) => {
 		key: dictionaries[0].key,
 		qualifierTypes: groupQualifierTypes,
 		content,
-		...declaresMeta && { meta: metaByCompositeId },
 		...importMode !== void 0 && { importMode },
 		localIds
 	};

package/dist/cjs/dictionaryManipulator/mergeQualifiedDictionaries.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"mergeQualifiedDictionaries.cjs","names":["getDictionaryQualifierTypes","QUALIFIER_ORDER","mergeDictionaries","getDictionaryCompositeId"],"sources":["../../../src/dictionaryManipulator/mergeQualifiedDictionaries.ts"],"sourcesContent":["import { log } from '@intlayer/config/built';\nimport { colorizeKey, getAppLogger } from '@intlayer/config/logger';\nimport type {\n  Dictionary,\n  DictionaryMeta,\n  DictionaryQualifierType,\n  QualifiedDictionaryGroup,\n} from '@intlayer/types/dictionary';\nimport { mergeDictionaries } from './mergeDictionaries';\nimport {\n  getDictionaryCompositeId,\n  getDictionaryQualifierTypes,\n  QUALIFIER_ORDER,\n} from './qualifiedDictionary';\n\n/**\n * Merges sibling dictionaries sharing the same key, honouring qualifiers.\n *\n * - No dictionary declares a qualifier → behaves exactly like\n *   `mergeDictionaries` (single merged dictionary).\n * - At least one dictionary declares a qualifier → the group's dimension set is\n *   the union of every declared dimension (in canonical order\n *   `variant → meta → item`). Dictionaries are grouped by their composite id\n *   (one segment per dimension), merged within each group (locale completion /\n *   priority overrides preserved), and a `QualifiedDictionaryGroup` is returned.\n *   Unqualified siblings act as shared base content merged into every entry.\n *\n * Every qualified entry must declare ALL dimensions of the group; an entry that\n * declares only a subset is ambiguous and is rejected with an error log.\n */\nexport const mergeQualifiedDictionaries = (\n  dictionaries: Dictionary[]\n): Dictionary | QualifiedDictionaryGroup => {\n  const perDictionaryTypes = dictionaries.map(getDictionaryQualifierTypes);\n\n  const declaredDimensions = new Set<DictionaryQualifierType>();\n  for (const types of perDictionaryTypes) {\n    for (const type of types) declaredDimensions.add(type);\n  }\n\n  // Canonical order, restricted to the dimensions actually declared.\n  const groupQualifierTypes = QUALIFIER_ORDER.filter((qualifierType) =>\n    declaredDimensions.has(qualifierType)\n  );\n\n  if (groupQualifierTypes.length === 0) {\n    return mergeDictionaries(dictionaries);\n  }\n\n  const appLogger = getAppLogger({ log });\n\n  const baseDictionaries: Dictionary[] = [];\n  const entriesDictionaries = new Map<string, Dictionary[]>();\n\n  dictionaries.forEach((dictionary, index) => {\n    if (perDictionaryTypes[index].length === 0) {\n      baseDictionaries.push(dictionary);\n      return;\n    }\n\n    const compositeId = getDictionaryCompositeId(\n      dictionary,\n      groupQualifierTypes\n    );\n\n    if (compositeId === undefined) {\n      appLogger(\n        `Dictionary ${colorizeKey(dictionary.key)} declares (${perDictionaryTypes[index].join(', ')}) but the key's dimensions are (${groupQualifierTypes.join(', ')}); every entry must declare all of them. Entry ignored${dictionary.filePath ? ` - ${dictionary.filePath}` : ''}.`,\n        { level: 'error' }\n      );\n      return;\n    }\n\n    const existingEntries = entriesDictionaries.get(compositeId) ?? [];\n    existingEntries.push(dictionary);\n    entriesDictionaries.set(compositeId, existingEntries);\n  });\n\n  // `content` maps each composite id to its resolved content node directly; the\n  // qualifier coordinates live in the key, not in a per-entry wrapper. `meta`\n  // preserves the declared meta fields (composite id only encodes `meta.id`).\n  const content: Record<string, unknown> = {};\n  const metaByCompositeId: Record<string, DictionaryMeta> = {};\n  const declaresMeta = groupQualifierTypes.includes('meta');\n\n  let importMode: Dictionary['importMode'];\n\n  for (const [compositeId, qualifiedDictionaries] of entriesDictionaries) {\n    // Unqualified siblings act as shared base content: appended last so the\n    // qualified entries take precedence (mergeDictionaries prefers first).\n    const mergedEntry = mergeDictionaries([\n      ...qualifiedDictionaries,\n      ...baseDictionaries,\n    ]);\n\n    content[compositeId] = mergedEntry.content;\n\n    const [firstQualified] = qualifiedDictionaries;\n\n    if (declaresMeta && firstQualified?.meta !== undefined) {\n      metaByCompositeId[compositeId] = firstQualified.meta;\n    }\n\n    importMode ??= firstQualified?.importMode;\n  }\n\n  const localIds = Array.from(\n    new Set(\n      dictionaries\n        .filter((dictionary) => dictionary.localId)\n        .map((dictionary) => dictionary.localId!)\n    )\n  );\n\n  return {\n    key: dictionaries[0]!.key,\n    qualifierTypes: groupQualifierTypes,\n    content,\n    ...(declaresMeta && { meta: metaByCompositeId }),\n    ...(importMode !== undefined && { importMode }),\n    localIds,\n  };\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AA8BA,MAAa,8BACX,iBAC0C;CAC1C,MAAM,qBAAqB,aAAa,IAAIA,8EAA4B;CAExE,MAAM,qCAAqB,IAAI,KAA8B;AAC7D,MAAK,MAAM,SAAS,mBAClB,MAAK,MAAM,QAAQ,MAAO,oBAAmB,IAAI,KAAK;CAIxD,MAAM,sBAAsBC,kEAAgB,QAAQ,kBAClD,mBAAmB,IAAI,cAAc,CACtC;AAED,KAAI,oBAAoB,WAAW,EACjC,QAAOC,kEAAkB,aAAa;CAGxC,MAAM,sDAAyB,EAAE,iCAAK,CAAC;CAEvC,MAAM,mBAAiC,EAAE;CACzC,MAAM,sCAAsB,IAAI,KAA2B;AAE3D,cAAa,SAAS,YAAY,UAAU;AAC1C,MAAI,mBAAmB,OAAO,WAAW,GAAG;AAC1C,oBAAiB,KAAK,WAAW;AACjC;;EAGF,MAAM,cAAcC,2EAClB,YACA,oBACD;AAED,MAAI,gBAAgB,QAAW;AAC7B,aACE,uDAA0B,WAAW,IAAI,CAAC,aAAa,mBAAmB,OAAO,KAAK,KAAK,CAAC,kCAAkC,oBAAoB,KAAK,KAAK,CAAC,wDAAwD,WAAW,WAAW,MAAM,WAAW,aAAa,GAAG,IAC5Q,EAAE,OAAO,SAAS,CACnB;AACD;;EAGF,MAAM,kBAAkB,oBAAoB,IAAI,YAAY,IAAI,EAAE;AAClE,kBAAgB,KAAK,WAAW;AAChC,sBAAoB,IAAI,aAAa,gBAAgB;GACrD;CAKF,MAAM,UAAmC,EAAE;CAC3C,MAAM,oBAAoD,EAAE;CAC5D,MAAM,eAAe,oBAAoB,SAAS,OAAO;CAEzD,IAAI;AAEJ,MAAK,MAAM,CAAC,aAAa,0BAA0B,qBAAqB;AAQtE,UAAQ,eALYD,kEAAkB,CACpC,GAAG,uBACH,GAAG,iBACJ,CAEiC,CAAC;EAEnC,MAAM,CAAC,kBAAkB;AAEzB,MAAI,gBAAgB,gBAAgB,SAAS,OAC3C,mBAAkB,eAAe,eAAe;AAGlD,iBAAe,gBAAgB;;CAGjC,MAAM,WAAW,MAAM,KACrB,IAAI,IACF,aACG,QAAQ,eAAe,WAAW,QAAQ,CAC1C,KAAK,eAAe,WAAW,QAAS,CAC5C,CACF;AAED,QAAO;EACL,KAAK,aAAa,GAAI;EACtB,gBAAgB;EAChB;EACA,GAAI,gBAAgB,EAAE,MAAM,mBAAmB;EAC/C,GAAI,eAAe,UAAa,EAAE,YAAY;EAC9C;EACD"}
+{"version":3,"file":"mergeQualifiedDictionaries.cjs","names":["getDictionaryQualifierTypes","QUALIFIER_ORDER","mergeDictionaries","getDictionaryCompositeIds"],"sources":["../../../src/dictionaryManipulator/mergeQualifiedDictionaries.ts"],"sourcesContent":["import { log } from '@intlayer/config/built';\nimport { colorizeKey, getAppLogger } from '@intlayer/config/logger';\nimport type {\n  Dictionary,\n  DictionaryQualifierType,\n  QualifiedDictionaryGroup,\n} from '@intlayer/types/dictionary';\nimport { mergeDictionaries } from './mergeDictionaries';\nimport {\n  getDictionaryCompositeIds,\n  getDictionaryQualifierTypes,\n  QUALIFIER_ORDER,\n} from './qualifiedDictionary';\n\n/**\n * Merges sibling dictionaries sharing the same key, honouring qualifiers.\n *\n * - No dictionary declares a qualifier → behaves exactly like\n *   `mergeDictionaries` (single merged dictionary).\n * - At least one dictionary declares a qualifier → the group's dimension set is\n *   the union of every declared dimension (in canonical order\n *   `variant → item`). Dictionaries are grouped by their composite id\n *   (one segment per dimension), merged within each group (locale completion /\n *   priority overrides preserved), and a `QualifiedDictionaryGroup` is returned.\n *   Unqualified siblings act as shared base content merged into every entry.\n *\n * Every qualified entry must declare ALL dimensions of the group; an entry that\n * declares only a subset is ambiguous and is rejected with an error log.\n */\nexport const mergeQualifiedDictionaries = (\n  dictionaries: Dictionary[]\n): Dictionary | QualifiedDictionaryGroup => {\n  const perDictionaryTypes = dictionaries.map(getDictionaryQualifierTypes);\n\n  const declaredDimensions = new Set<DictionaryQualifierType>();\n  for (const types of perDictionaryTypes) {\n    for (const type of types) declaredDimensions.add(type);\n  }\n\n  // Canonical order, restricted to the dimensions actually declared.\n  const groupQualifierTypes = QUALIFIER_ORDER.filter((qualifierType) =>\n    declaredDimensions.has(qualifierType)\n  );\n\n  if (groupQualifierTypes.length === 0) {\n    return mergeDictionaries(dictionaries);\n  }\n\n  const appLogger = getAppLogger({ log });\n\n  const baseDictionaries: Dictionary[] = [];\n  const entriesDictionaries = new Map<string, Dictionary[]>();\n\n  dictionaries.forEach((dictionary, index) => {\n    if (perDictionaryTypes[index]?.length === 0) {\n      baseDictionaries.push(dictionary);\n      return;\n    }\n\n    // A dictionary may map to several composite ids (array variant fan-out):\n    // its content is registered under every id it lists.\n    const compositeIds = getDictionaryCompositeIds(\n      dictionary,\n      groupQualifierTypes\n    );\n\n    if (compositeIds === undefined) {\n      appLogger(\n        `Dictionary ${colorizeKey(dictionary.key)} declares (${perDictionaryTypes[index].join(', ')}) but the key's dimensions are (${groupQualifierTypes.join(', ')}); every entry must declare all of them. Entry ignored${dictionary.filePath ? ` - ${dictionary.filePath}` : ''}.`,\n        { level: 'error' }\n      );\n      return;\n    }\n\n    for (const compositeId of compositeIds) {\n      const existingEntries = entriesDictionaries.get(compositeId) ?? [];\n      existingEntries.push(dictionary);\n      entriesDictionaries.set(compositeId, existingEntries);\n    }\n  });\n\n  // `content` maps each composite id to its resolved content node directly; the\n  // qualifier coordinates live in the key, not in a per-entry wrapper. For an\n  // object variant the variant segment is the canonical serialization of the\n  // object, so it fully identifies the entry — no side-map is needed.\n  const content: Record<string, unknown> = {};\n\n  let importMode: Dictionary['importMode'];\n\n  for (const [compositeId, qualifiedDictionaries] of entriesDictionaries) {\n    // Unqualified siblings act as shared base content: appended last so the\n    // qualified entries take precedence (mergeDictionaries prefers first).\n    const mergedEntry = mergeDictionaries([\n      ...qualifiedDictionaries,\n      ...baseDictionaries,\n    ]);\n\n    content[compositeId] = mergedEntry.content;\n\n    const [firstQualified] = qualifiedDictionaries;\n\n    importMode ??= firstQualified?.importMode;\n  }\n\n  const localIds = Array.from(\n    new Set(\n      dictionaries\n        .filter((dictionary) => dictionary.localId)\n        .map((dictionary) => dictionary.localId!)\n    )\n  );\n\n  return {\n    key: dictionaries[0]!.key,\n    qualifierTypes: groupQualifierTypes,\n    content,\n    ...(importMode !== undefined && { importMode }),\n    localIds,\n  };\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AA6BA,MAAa,8BACX,iBAC0C;CAC1C,MAAM,qBAAqB,aAAa,IAAIA,6EAA2B;CAEvE,MAAM,qCAAqB,IAAI,IAA6B;CAC5D,KAAK,MAAM,SAAS,oBAClB,KAAK,MAAM,QAAQ,OAAO,mBAAmB,IAAI,IAAI;CAIvD,MAAM,sBAAsBC,kEAAgB,QAAQ,kBAClD,mBAAmB,IAAI,aAAa,CACtC;CAEA,IAAI,oBAAoB,WAAW,GACjC,OAAOC,kEAAkB,YAAY;CAGvC,MAAM,sDAAyB,EAAE,gCAAI,CAAC;CAEtC,MAAM,mBAAiC,CAAC;CACxC,MAAM,sCAAsB,IAAI,IAA0B;CAE1D,aAAa,SAAS,YAAY,UAAU;EAC1C,IAAI,mBAAmB,MAAM,EAAE,WAAW,GAAG;GAC3C,iBAAiB,KAAK,UAAU;GAChC;EACF;EAIA,MAAM,eAAeC,4EACnB,YACA,mBACF;EAEA,IAAI,iBAAiB,QAAW;GAC9B,UACE,uDAA0B,WAAW,GAAG,EAAE,aAAa,mBAAmB,MAAM,CAAC,KAAK,IAAI,EAAE,kCAAkC,oBAAoB,KAAK,IAAI,EAAE,wDAAwD,WAAW,WAAW,MAAM,WAAW,aAAa,GAAG,IAC5Q,EAAE,OAAO,QAAQ,CACnB;GACA;EACF;EAEA,KAAK,MAAM,eAAe,cAAc;GACtC,MAAM,kBAAkB,oBAAoB,IAAI,WAAW,KAAK,CAAC;GACjE,gBAAgB,KAAK,UAAU;GAC/B,oBAAoB,IAAI,aAAa,eAAe;EACtD;CACF,CAAC;CAMD,MAAM,UAAmC,CAAC;CAE1C,IAAI;CAEJ,KAAK,MAAM,CAAC,aAAa,0BAA0B,qBAAqB;EAQtE,QAAQ,eALYD,kEAAkB,CACpC,GAAG,uBACH,GAAG,gBACL,CAEiC,CAAC,CAAC;EAEnC,MAAM,CAAC,kBAAkB;EAEzB,eAAe,gBAAgB;CACjC;CAEA,MAAM,WAAW,MAAM,KACrB,IAAI,IACF,aACG,QAAQ,eAAe,WAAW,OAAO,CAAC,CAC1C,KAAK,eAAe,WAAW,OAAQ,CAC5C,CACF;CAEA,OAAO;EACL,KAAK,aAAa,EAAE,CAAE;EACtB,gBAAgB;EAChB;EACA,GAAI,eAAe,UAAa,EAAE,WAAW;EAC7C;CACF;AACF"}

package/dist/cjs/dictionaryManipulator/normalizeDictionary.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"normalizeDictionary.cjs","names":["t","getPerLocaleDictionary","orderDictionaries"],"sources":["../../../src/dictionaryManipulator/normalizeDictionary.ts"],"sourcesContent":["import type { Locale } from '@intlayer/types/allLocales';\nimport type { IntlayerConfig } from '@intlayer/types/config';\nimport type { Dictionary } from '@intlayer/types/dictionary';\nimport { getPerLocaleDictionary } from '../deepTransformPlugins';\nimport { t } from '../transpiler/translation';\nimport { orderDictionaries } from './orderDictionaries';\n\nexport const normalizeDictionary = (\n  dictionary: Dictionary,\n  configuration: IntlayerConfig\n): Dictionary => {\n  const { locales } = configuration.internationalization;\n\n  const parsedDictionary = JSON.parse(JSON.stringify(dictionary));\n\n  // If the dictionary is a per-locale dictionary, transform it to a partial multilingual dictionary\n  if (dictionary.locale) {\n    return {\n      ...dictionary,\n      locale: undefined,\n      content: t({\n        [dictionary.locale]: dictionary.content,\n      }),\n    };\n  }\n\n  const perLocaleContent = locales.reduce(\n    (acc, locale) => {\n      const perLocaleDictionary = getPerLocaleDictionary(\n        parsedDictionary,\n        locale\n      );\n\n      acc[locale] = perLocaleDictionary.content;\n      return acc;\n    },\n    {} as Record<Locale, Dictionary['content']>\n  );\n\n  return {\n    ...dictionary,\n    content: t(perLocaleContent),\n  };\n};\n\nexport const normalizeDictionaries = (\n  dictionaries: Dictionary[],\n  configuration: IntlayerConfig\n): Dictionary[] => {\n  const orderedDictionaries = orderDictionaries(dictionaries, configuration);\n\n  const structuredDictionaries = orderedDictionaries.map((dictionary) =>\n    normalizeDictionary(dictionary, configuration)\n  );\n\n  return structuredDictionaries;\n};\n"],"mappings":";;;;;;AAOA,MAAa,uBACX,YACA,kBACe;CACf,MAAM,EAAE,YAAY,cAAc;CAElC,MAAM,mBAAmB,KAAK,MAAM,KAAK,UAAU,WAAW,CAAC;AAG/D,KAAI,WAAW,OACb,QAAO;EACL,GAAG;EACH,QAAQ;EACR,SAASA,6CAAE,GACR,WAAW,SAAS,WAAW,SACjC,CAAC;EACH;CAGH,MAAM,mBAAmB,QAAQ,QAC9B,KAAK,WAAW;AAMf,MAAI,UALwBC,wEAC1B,kBACA,OAG+B,CAAC;AAClC,SAAO;IAET,EAAE,CACH;AAED,QAAO;EACL,GAAG;EACH,SAASD,6CAAE,iBAAiB;EAC7B;;AAGH,MAAa,yBACX,cACA,kBACiB;AAOjB,QAN4BE,kEAAkB,cAAc,cAEV,CAAC,KAAK,eACtD,oBAAoB,YAAY,cAAc,CAGnB"}
+{"version":3,"file":"normalizeDictionary.cjs","names":["t","getPerLocaleDictionary","orderDictionaries"],"sources":["../../../src/dictionaryManipulator/normalizeDictionary.ts"],"sourcesContent":["import type { Locale } from '@intlayer/types/allLocales';\nimport type { IntlayerConfig } from '@intlayer/types/config';\nimport type { Dictionary } from '@intlayer/types/dictionary';\nimport { getPerLocaleDictionary } from '../deepTransformPlugins';\nimport { t } from '../transpiler/translation';\nimport { orderDictionaries } from './orderDictionaries';\n\nexport const normalizeDictionary = (\n  dictionary: Dictionary,\n  configuration: IntlayerConfig\n): Dictionary => {\n  const { locales } = configuration.internationalization;\n\n  const parsedDictionary = JSON.parse(JSON.stringify(dictionary));\n\n  // If the dictionary is a per-locale dictionary, transform it to a partial multilingual dictionary\n  if (dictionary.locale) {\n    return {\n      ...dictionary,\n      locale: undefined,\n      content: t({\n        [dictionary.locale]: dictionary.content,\n      }),\n    };\n  }\n\n  const perLocaleContent = locales.reduce(\n    (acc, locale) => {\n      const perLocaleDictionary = getPerLocaleDictionary(\n        parsedDictionary,\n        locale\n      );\n\n      acc[locale] = perLocaleDictionary.content;\n      return acc;\n    },\n    {} as Record<Locale, Dictionary['content']>\n  );\n\n  return {\n    ...dictionary,\n    content: t(perLocaleContent),\n  };\n};\n\nexport const normalizeDictionaries = (\n  dictionaries: Dictionary[],\n  configuration: IntlayerConfig\n): Dictionary[] => {\n  const orderedDictionaries = orderDictionaries(dictionaries, configuration);\n\n  const structuredDictionaries = orderedDictionaries.map((dictionary) =>\n    normalizeDictionary(dictionary, configuration)\n  );\n\n  return structuredDictionaries;\n};\n"],"mappings":";;;;;;AAOA,MAAa,uBACX,YACA,kBACe;CACf,MAAM,EAAE,YAAY,cAAc;CAElC,MAAM,mBAAmB,KAAK,MAAM,KAAK,UAAU,UAAU,CAAC;CAG9D,IAAI,WAAW,QACb,OAAO;EACL,GAAG;EACH,QAAQ;EACR,SAASA,6CAAE,GACR,WAAW,SAAS,WAAW,QAClC,CAAC;CACH;CAGF,MAAM,mBAAmB,QAAQ,QAC9B,KAAK,WAAW;EAMf,IAAI,UALwBC,wEAC1B,kBACA,MAG8B,CAAC,CAAC;EAClC,OAAO;CACT,GACA,CAAC,CACH;CAEA,OAAO;EACL,GAAG;EACH,SAASD,6CAAE,gBAAgB;CAC7B;AACF;AAEA,MAAa,yBACX,cACA,kBACiB;CAOjB,OAN4BE,kEAAkB,cAAc,aAEX,CAAC,CAAC,KAAK,eACtD,oBAAoB,YAAY,aAAa,CAGnB;AAC9B"}

package/dist/cjs/dictionaryManipulator/orderDictionaries.cjs

@@ -1,5 +1,4 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-const require_runtime = require('../_virtual/_rolldown/runtime.cjs');
 let _intlayer_config_built = require("@intlayer/config/built");
 
 //#region src/dictionaryManipulator/orderDictionaries.ts

package/dist/cjs/dictionaryManipulator/orderDictionaries.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"orderDictionaries.cjs","names":["editor"],"sources":["../../../src/dictionaryManipulator/orderDictionaries.ts"],"sourcesContent":["import { editor } from '@intlayer/config/built';\nimport type { Dictionary } from '@intlayer/types/dictionary';\n\n/**\n * Orders dictionaries based on the dictionary priority strategy.\n *\n * @param dictionaries - Array of dictionaries to order\n * @param priorityStrategy - The priority strategy ('local_first' or 'distant_first')\n * @returns Ordered array of dictionaries\n */\nexport const orderDictionaries = (\n  dictionaries: Dictionary[],\n  config?: {\n    editor: {\n      dictionaryPriorityStrategy: 'local_first' | 'distant_first';\n    };\n  }\n): Dictionary[] => {\n  const dictionaryPriorityStrategy =\n    config?.editor?.dictionaryPriorityStrategy ??\n    editor.dictionaryPriorityStrategy;\n\n  if (dictionaries.length <= 1) {\n    return dictionaries;\n  }\n\n  // Stabilize original indices to preserve relative order for complete ties\n  const withIndex = dictionaries.map((dictionary, index) => ({\n    dictionary,\n    index,\n  }));\n\n  const getPriority = (dictionary: Dictionary): number => {\n    const p = dictionary.priority ?? 0;\n\n    return Number.isFinite(p) ? p : 0;\n  };\n\n  const getLocationWeight = (d: Dictionary): number => {\n    const location = d.location;\n\n    // undefined location should always be last\n    if (location === undefined) {\n      return 2;\n    }\n\n    if (dictionaryPriorityStrategy === 'distant_first') {\n      // distant should come first\n      return location === 'remote' ? 0 : 1;\n    }\n    // default: local_first\n    return location === 'local' ? 0 : 1;\n  };\n\n  withIndex.sort((a, b) => {\n    // 1) Non-autoFilled before autoFilled (autoFilled have lower precedence)\n    const aAuto = a.dictionary.filled ? 1 : 0;\n    const bAuto = b.dictionary.filled ? 1 : 0;\n    if (aAuto !== bAuto) return aAuto - bAuto; // 0 before 1\n\n    // 2) Higher priority first (larger number wins)\n    const aP = getPriority(a.dictionary);\n    const bP = getPriority(b.dictionary);\n    if (aP !== bP) return bP - aP; // descending\n\n    // 3) Location according to strategy\n    const aLocation = getLocationWeight(a.dictionary);\n    const bLocation = getLocationWeight(b.dictionary);\n    if (aLocation !== bLocation) return aLocation - bLocation;\n\n    // 4) Stable fallback by original index\n    return a.index - b.index;\n  });\n\n  return withIndex.map(({ dictionary }) => dictionary);\n};\n"],"mappings":";;;;;;;;;;;;AAUA,MAAa,qBACX,cACA,WAKiB;CACjB,MAAM,6BACJ,QAAQ,QAAQ,8BAChBA,8BAAO;AAET,KAAI,aAAa,UAAU,EACzB,QAAO;CAIT,MAAM,YAAY,aAAa,KAAK,YAAY,WAAW;EACzD;EACA;EACD,EAAE;CAEH,MAAM,eAAe,eAAmC;EACtD,MAAM,IAAI,WAAW,YAAY;AAEjC,SAAO,OAAO,SAAS,EAAE,GAAG,IAAI;;CAGlC,MAAM,qBAAqB,MAA0B;EACnD,MAAM,WAAW,EAAE;AAGnB,MAAI,aAAa,OACf,QAAO;AAGT,MAAI,+BAA+B,gBAEjC,QAAO,aAAa,WAAW,IAAI;AAGrC,SAAO,aAAa,UAAU,IAAI;;AAGpC,WAAU,MAAM,GAAG,MAAM;EAEvB,MAAM,QAAQ,EAAE,WAAW,SAAS,IAAI;EACxC,MAAM,QAAQ,EAAE,WAAW,SAAS,IAAI;AACxC,MAAI,UAAU,MAAO,QAAO,QAAQ;EAGpC,MAAM,KAAK,YAAY,EAAE,WAAW;EACpC,MAAM,KAAK,YAAY,EAAE,WAAW;AACpC,MAAI,OAAO,GAAI,QAAO,KAAK;EAG3B,MAAM,YAAY,kBAAkB,EAAE,WAAW;EACjD,MAAM,YAAY,kBAAkB,EAAE,WAAW;AACjD,MAAI,cAAc,UAAW,QAAO,YAAY;AAGhD,SAAO,EAAE,QAAQ,EAAE;GACnB;AAEF,QAAO,UAAU,KAAK,EAAE,iBAAiB,WAAW"}
+{"version":3,"file":"orderDictionaries.cjs","names":["editor"],"sources":["../../../src/dictionaryManipulator/orderDictionaries.ts"],"sourcesContent":["import { editor } from '@intlayer/config/built';\nimport type { Dictionary } from '@intlayer/types/dictionary';\n\n/**\n * Orders dictionaries based on the dictionary priority strategy.\n *\n * @param dictionaries - Array of dictionaries to order\n * @param priorityStrategy - The priority strategy ('local_first' or 'distant_first')\n * @returns Ordered array of dictionaries\n */\nexport const orderDictionaries = (\n  dictionaries: Dictionary[],\n  config?: {\n    editor: {\n      dictionaryPriorityStrategy: 'local_first' | 'distant_first';\n    };\n  }\n): Dictionary[] => {\n  const dictionaryPriorityStrategy =\n    config?.editor?.dictionaryPriorityStrategy ??\n    editor.dictionaryPriorityStrategy;\n\n  if (dictionaries.length <= 1) {\n    return dictionaries;\n  }\n\n  // Stabilize original indices to preserve relative order for complete ties\n  const withIndex = dictionaries.map((dictionary, index) => ({\n    dictionary,\n    index,\n  }));\n\n  const getPriority = (dictionary: Dictionary): number => {\n    const p = dictionary.priority ?? 0;\n\n    return Number.isFinite(p) ? p : 0;\n  };\n\n  const getLocationWeight = (d: Dictionary): number => {\n    const location = d.location;\n\n    // undefined location should always be last\n    if (location === undefined) {\n      return 2;\n    }\n\n    if (dictionaryPriorityStrategy === 'distant_first') {\n      // distant should come first\n      return location === 'remote' ? 0 : 1;\n    }\n    // default: local_first\n    return location === 'local' ? 0 : 1;\n  };\n\n  withIndex.sort((a, b) => {\n    // 1) Non-autoFilled before autoFilled (autoFilled have lower precedence)\n    const aAuto = a.dictionary.filled ? 1 : 0;\n    const bAuto = b.dictionary.filled ? 1 : 0;\n    if (aAuto !== bAuto) return aAuto - bAuto; // 0 before 1\n\n    // 2) Higher priority first (larger number wins)\n    const aP = getPriority(a.dictionary);\n    const bP = getPriority(b.dictionary);\n    if (aP !== bP) return bP - aP; // descending\n\n    // 3) Location according to strategy\n    const aLocation = getLocationWeight(a.dictionary);\n    const bLocation = getLocationWeight(b.dictionary);\n    if (aLocation !== bLocation) return aLocation - bLocation;\n\n    // 4) Stable fallback by original index\n    return a.index - b.index;\n  });\n\n  return withIndex.map(({ dictionary }) => dictionary);\n};\n"],"mappings":";;;;;;;;;;;AAUA,MAAa,qBACX,cACA,WAKiB;CACjB,MAAM,6BACJ,QAAQ,QAAQ,8BAChBA,8BAAO;CAET,IAAI,aAAa,UAAU,GACzB,OAAO;CAIT,MAAM,YAAY,aAAa,KAAK,YAAY,WAAW;EACzD;EACA;CACF,EAAE;CAEF,MAAM,eAAe,eAAmC;EACtD,MAAM,IAAI,WAAW,YAAY;EAEjC,OAAO,OAAO,SAAS,CAAC,IAAI,IAAI;CAClC;CAEA,MAAM,qBAAqB,MAA0B;EACnD,MAAM,WAAW,EAAE;EAGnB,IAAI,aAAa,QACf,OAAO;EAGT,IAAI,+BAA+B,iBAEjC,OAAO,aAAa,WAAW,IAAI;EAGrC,OAAO,aAAa,UAAU,IAAI;CACpC;CAEA,UAAU,MAAM,GAAG,MAAM;EAEvB,MAAM,QAAQ,EAAE,WAAW,SAAS,IAAI;EACxC,MAAM,QAAQ,EAAE,WAAW,SAAS,IAAI;EACxC,IAAI,UAAU,OAAO,OAAO,QAAQ;EAGpC,MAAM,KAAK,YAAY,EAAE,UAAU;EACnC,MAAM,KAAK,YAAY,EAAE,UAAU;EACnC,IAAI,OAAO,IAAI,OAAO,KAAK;EAG3B,MAAM,YAAY,kBAAkB,EAAE,UAAU;EAChD,MAAM,YAAY,kBAAkB,EAAE,UAAU;EAChD,IAAI,cAAc,WAAW,OAAO,YAAY;EAGhD,OAAO,EAAE,QAAQ,EAAE;CACrB,CAAC;CAED,OAAO,UAAU,KAAK,EAAE,iBAAiB,UAAU;AACrD"}

package/dist/cjs/dictionaryManipulator/qualifiedDictionary.cjs

@@ -2,100 +2,125 @@ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 
 //#region src/dictionaryManipulator/qualifiedDictionary.ts
 /**
-* Selector keys that are reserved for dictionary resolution and therefore
-* excluded from meta field matching.
+* Canonical order of qualifier dimensions. A key that declares both dimensions
+* always nests them in this order, with `item` innermost so it can act as the
+* collection (array) axis.
 */
-const RESERVED_SELECTOR_KEYS = [
-	"locale",
-	"item",
-	"variant"
-];
-/**
-* Canonical order of qualifier dimensions. A key that declares several
-* dimensions always nests them in this order, with `item` innermost so it can
-* act as the collection (array) axis.
-*/
-const QUALIFIER_ORDER = [
-	"variant",
-	"meta",
-	"item"
-];
+const QUALIFIER_ORDER = ["variant", "item"];
 /**
 * Separator joining per-dimension ids into a composite entry id. Also used as
 * the chunk path separator in dynamic mode.
 */
 const COMPOSITE_ID_SEPARATOR = "/";
 /**
+* Characters kept verbatim in an encoded qualifier segment. Everything else is
+* percent-encoded so a segment can never contain the composite-id separator
+* (`/`), path-hostile characters (`\` `:` `*` `?` `"` `<` `>` `|`, control
+* chars), or characters that would break the generated loader modules (`'`).
+*/
+const SEGMENT_UNSAFE_CHARS = /[^A-Za-z0-9._&=-]/g;
+/**
+* Stricter set for the components of an object variant: also encodes `&` and
+* `=` so the `field=value&field=value` serialization stays unambiguous.
+*/
+const COMPONENT_UNSAFE_CHARS = /[^A-Za-z0-9._-]/g;
+/** Percent-encodes one UTF-16 code unit as a fixed-width `%XXXX` run. */
+const percentEncodeChar = (char) => `%${char.charCodeAt(0).toString(16).toUpperCase().padStart(4, "0")}`;
+const encodeSegmentText = (raw, unsafeChars) => {
+	if (raw === "") return "%";
+	const encoded = raw.replace(unsafeChars, percentEncodeChar);
+	if (encoded === "." || encoded === "..") return encoded.replace(/\./g, "%002E");
+	return encoded;
+};
+/**
+* Canonical serialization of a single variant value into its identity string —
+* the variant segment of a composite id, the chunk directory name in dynamic
+* mode, and the runtime matching key.
+*
+* - `undefined` → `'default'` (the implicit fallback variant)
+* - a string → the string itself (a named variant)
+* - an object → its sorted `key=value` pairs joined by `&`
+*   (e.g. `{ userId: '123', id: 'abc' }` → `'id=abc&userId=123'`)
+*
+* Characters that are unsafe in file paths or generated code are
+* percent-encoded (fixed-width `%XXXX` runs, injective). Common names —
+* letters, digits, `-` `_` `.` — are left untouched. Both the declaration and
+* the selector go through this function, so encoding never affects matching.
+*
+* Two variants resolve to the same entry iff their serializations are equal, so
+* an object variant in a selector must equal the one declared on the dictionary.
+*/
+const serializeVariant = (variant) => {
+	if (variant === void 0) return "default";
+	if (typeof variant === "string") return encodeSegmentText(variant, SEGMENT_UNSAFE_CHARS);
+	return Object.keys(variant).sort().map((field) => `${encodeSegmentText(field, COMPONENT_UNSAFE_CHARS)}=${encodeSegmentText(String(variant[field]), COMPONENT_UNSAFE_CHARS)}`).join("&");
+};
+/**
+* Normalizes the `variant` field of a dictionary into the list of variant ids
+* the declaration registers under. A single value yields one id; an **array**
+* fans out into one id per element (duplicates collapsed). Returns `undefined`
+* when the dictionary does not declare the variant dimension (no `variant`
+* field, or an empty array).
+*/
+const getVariantIds = (variant) => {
+	if (variant === void 0) return void 0;
+	const values = Array.isArray(variant) ? variant : [variant];
+	if (values.length === 0) return void 0;
+	return [...new Set(values.map(serializeVariant))];
+};
+/**
 * Returns the qualifier dimensions declared on a dictionary, in canonical
-* order (`variant → meta → item`). Empty when the dictionary is unqualified
+* order (`variant → item`). Empty when the dictionary is unqualified
 * (plain dictionary or shared base content of a qualified group).
 */
 const getDictionaryQualifierTypes = (dictionary) => {
 	const declaredQualifiers = [];
-	if (typeof dictionary.variant === "string") declaredQualifiers.push("variant");
-	if (dictionary.meta !== void 0) declaredQualifiers.push("meta");
+	if (getVariantIds(dictionary.variant) !== void 0) declaredQualifiers.push("variant");
 	if (typeof dictionary.item === "number") declaredQualifiers.push("item");
 	return declaredQualifiers;
 };
 /**
-* Returns the qualifier identifier of a dictionary for the given qualifier
-* dimension — one segment of the composite entry id.
+* Returns the qualifier identifiers of a dictionary for the given qualifier
+* dimension — the candidate segments of the composite entry ids.
 *
-* - 'variant' → the variant name
-* - 'meta' → the `meta.id` discriminator
-* - 'item' → the item index as string
+* - 'variant' → the serialized variant id(s); an array variant yields one id
+*   per element (declaration-side fan-out)
+* - 'item' → the item index as a single-element list
 */
-const getDictionaryQualifierId = (dictionary, qualifierType) => {
-	if (qualifierType === "variant") return dictionary.variant;
-	if (qualifierType === "meta") {
-		const metaId = dictionary.meta?.id;
-		return metaId === void 0 ? void 0 : String(metaId);
-	}
-	return dictionary.item === void 0 ? void 0 : String(dictionary.item);
+const getDictionaryQualifierIds = (dictionary, qualifierType) => {
+	if (qualifierType === "variant") return getVariantIds(dictionary.variant);
+	return dictionary.item === void 0 ? void 0 : [String(dictionary.item)];
 };
 /**
-* Returns the per-dimension id segments of a dictionary for the given ordered
-* dimension set, or `undefined` when the dictionary does not declare every
-* dimension of the set.
+* Builds every composite entry id of a dictionary — the cartesian product of
+* its per-dimension id lists, joined in canonical order. A dictionary with a
+* plain (non-array) variant yields exactly one id; an array variant fans out
+* into one id per element. `undefined` when a dimension of the set is missing.
 */
-const getDictionaryQualifierSegments = (dictionary, qualifierTypes) => {
-	const segments = [];
+const getDictionaryCompositeIds = (dictionary, qualifierTypes) => {
+	let compositeIds = [""];
 	for (const qualifierType of qualifierTypes) {
-		const id = getDictionaryQualifierId(dictionary, qualifierType);
-		if (id === void 0) return void 0;
-		segments.push(id);
+		const ids = getDictionaryQualifierIds(dictionary, qualifierType);
+		if (ids === void 0) return void 0;
+		compositeIds = compositeIds.flatMap((prefix) => ids.map((id) => prefix === "" ? id : `${prefix}${"/"}${id}`));
 	}
-	return segments;
+	return compositeIds;
 };
 /**
-* Builds the composite entry id of a dictionary — its per-dimension id segments
-* joined in canonical order. `undefined` when a dimension is missing.
-*/
-const getDictionaryCompositeId = (dictionary, qualifierTypes) => getDictionaryQualifierSegments(dictionary, qualifierTypes)?.join("/");
-/**
-* Checks that every declared meta field is provided and equal in the selector.
-* Reserved keys (`locale`, `item`, `variant`) are skipped; `meta.id` is part of
-* the equality check.
+* Tests whether a composite entry id matches a selector across every declared
+* dimension. Segments are compared in their encoded form (both the stored id
+* and the selector go through {@link serializeVariant}). The `item` dimension
+* matches any value when the selector does not provide one (open collection
+* axis).
 */
-const metaFieldsMatch = (meta, selector) => {
-	if (!meta) return false;
-	return Object.entries(meta).every(([metaField, declaredValue]) => {
-		if (RESERVED_SELECTOR_KEYS.includes(metaField)) return true;
-		const providedValue = selector?.[metaField];
-		return providedValue !== void 0 && String(providedValue) === String(declaredValue);
+const compositeIdMatchesSelector = (compositeId, qualifierTypes, selector) => {
+	const segments = compositeId.split("/");
+	return qualifierTypes.every((qualifierType, index) => {
+		if (qualifierType === "variant") return segments[index] === serializeVariant(selector?.variant);
+		return selector?.item === void 0 || segments[index] === String(selector.item);
 	});
 };
 /**
-* Tests whether a group entry matches a selector across every declared
-* dimension. The `item` dimension matches any value when the selector does not
-* provide one (open collection axis).
-*/
-const entryMatchesSelector = (entry, qualifierTypes, selector) => qualifierTypes.every((qualifierType) => {
-	if (qualifierType === "variant") return entry.variant === (selector?.variant ?? "default");
-	if (qualifierType === "item") return selector?.item === void 0 || String(entry.item) === String(selector.item);
-	return metaFieldsMatch(entry.meta, selector);
-});
-/**
 * Type guard discriminating a `QualifiedDictionaryGroup` (merge output of a
 * qualified key) from a plain `Dictionary`. Both carry a `content` field; only
 * the group declares `qualifierTypes`, which is therefore the discriminator.
@@ -104,12 +129,13 @@ const isQualifiedDictionaryGroup = (value) => typeof value === "object" && value
 /**
 * Reconstructs a resolvable {@link Dictionary} from a single entry of a
 * qualified group: the content node stored under its composite id, plus the
-* qualifier coordinates decoded from that id (`variant`, `item`) and the
-* preserved `meta` object for the meta dimension.
+* qualifier coordinates decoded from that id (`variant`, `item`).
 *
-* This keeps the resolver's matching/transform code unchanged: it still sees a
-* `{ key, content, variant?, item?, meta? }` shape, even though the stored
-* format no longer duplicates those fields per entry.
+* This keeps the resolver's transform code unchanged: it still sees a
+* `{ key, content, variant?, item? }` shape, even though the stored format no
+* longer duplicates those fields per entry. The `variant` coordinate stays in
+* its serialized (encoded) form, e.g. `'id=abc&userId=123'` — matching happens
+* on the composite id segments, never on this reconstructed field.
 */
 const reconstructQualifiedEntry = (group, compositeId) => {
 	const segments = compositeId.split("/");
@@ -121,10 +147,6 @@ const reconstructQualifiedEntry = (group, compositeId) => {
 		if (qualifierType === "variant") entry.variant = segments[index];
 		else if (qualifierType === "item") entry.item = Number(segments[index]);
 	});
-	if (group.qualifierTypes.includes("meta")) {
-		const metaIndex = group.qualifierTypes.indexOf("meta");
-		entry.meta = group.meta?.[compositeId] ?? { id: segments[metaIndex] };
-	}
 	return entry;
 };
 /**
@@ -134,8 +156,8 @@ const reconstructQualifiedEntry = (group, compositeId) => {
 * - Plain dictionary → returned as-is (selector ignored)
 * - `item` declared but not selected → every matching entry ordered by index
 * - `item` selected → the matching entry or null
-* - `variant` defaults to the `default` entry when not selected
-* - `meta` requires `{ id }` and every declared meta field to match
+* - `variant` defaults to the `default` entry when not selected; an object
+*   variant resolves only when the selector provides an equal object
 *
 * Dimensions compose: e.g. a variant × item key with `{ variant: 'promo' }`
 * returns every promo item as an array; adding `{ item: 2 }` narrows to one.
@@ -143,9 +165,8 @@ const reconstructQualifiedEntry = (group, compositeId) => {
 const resolveQualifiedDictionary = (dictionaryOrGroup, selector) => {
 	if (!isQualifiedDictionaryGroup(dictionaryOrGroup)) return dictionaryOrGroup;
 	const { qualifierTypes, content } = dictionaryOrGroup;
-	if (qualifierTypes.includes("meta") && selector?.id === void 0) return null;
 	const itemAxisOpen = qualifierTypes.includes("item") && selector?.item === void 0;
-	const matchedEntries = Object.keys(content).map((compositeId) => reconstructQualifiedEntry(dictionaryOrGroup, compositeId)).filter((entry) => entryMatchesSelector(entry, qualifierTypes, selector));
+	const matchedEntries = Object.keys(content).filter((compositeId) => compositeIdMatchesSelector(compositeId, qualifierTypes, selector)).map((compositeId) => reconstructQualifiedEntry(dictionaryOrGroup, compositeId));
 	if (itemAxisOpen) return matchedEntries.sort((left, right) => (left.item ?? 0) - (right.item ?? 0));
 	return matchedEntries[0] ?? null;
 };
@@ -166,7 +187,10 @@ const parseDictionarySelector = (localeOrSelector) => {
 */
 const getDictionarySelectorCacheKey = (selector) => {
 	if (!selector) return "";
-	return Object.keys(selector).filter((selectorKey) => selectorKey !== "locale").sort().map((selectorKey) => `${selectorKey}:${String(selector[selectorKey])}`).join("|");
+	return Object.keys(selector).filter((selectorKey) => selectorKey !== "locale").sort().map((selectorKey) => {
+		const value = selector[selectorKey];
+		return `${selectorKey}:${selectorKey === "variant" ? serializeVariant(value) : String(value)}`;
+	}).join("|");
 };
 /**
 * Marker property carrying the ordered qualifier dimensions on a dynamic loader
@@ -177,7 +201,7 @@ const getDictionarySelectorCacheKey = (selector) => {
 const QUALIFIER_DYNAMIC_TYPES_KEY = "__intlayerQualifierTypes";
 /**
 * Type guard discriminating a qualified dynamic loader map (collections /
-* variants / meta records, possibly combined) from a plain dynamic loader map.
+* variants, possibly combined) from a plain dynamic loader map.
 */
 const isQualifiedDynamicLoaderMap = (value) => typeof value === "object" && value !== null && "__intlayerQualifierTypes" in value;
 /**
@@ -194,11 +218,6 @@ const collectQualifiedChunks = (loaderMap, key, locale, selector) => {
 		missed: true,
 		chunks: []
 	};
-	if (qualifierTypes.includes("meta") && selector?.id === void 0) return {
-		itemAxisOpen,
-		missed: true,
-		chunks: []
-	};
 	const chunks = [];
 	const walk = (node, dimensions, segments) => {
 		if (dimensions.length === 0) {
@@ -214,7 +233,7 @@ const collectQualifiedChunks = (loaderMap, key, locale, selector) => {
 			for (const segment of Object.keys(tree).sort((left, right) => Number(left) - Number(right))) walk(tree[segment], rest, [...segments, segment]);
 			return true;
 		}
-		const segment = dimension === "variant" ? selector?.variant ?? "default" : dimension === "meta" ? String(selector?.id) : String(selector?.item);
+		const segment = dimension === "variant" ? serializeVariant(selector?.variant) : String(selector?.item);
 		const child = tree[segment];
 		if (!child) return false;
 		return walk(child, rest, [...segments, segment]);
@@ -226,20 +245,15 @@ const collectQualifiedChunks = (loaderMap, key, locale, selector) => {
 	};
 };
 /**
-* Whether a loaded chunk satisfies the selector's meta fields (no-op unless the
-* key declares a `meta` dimension).
-*/
-const chunkMatchesMeta = (loaderMap, dictionary, selector) => !loaderMap["__intlayerQualifierTypes"].includes("meta") || metaFieldsMatch(dictionary.meta, selector);
-/**
 * Resolves the content of a qualified dynamic loader map against a selector,
 * loading only the chunk(s) the selector actually targets.
 *
 * Walks the nested loader tree one dimension at a time (canonical order
-* `variant → meta → item`): `variant` defaults to `default`, `meta` descends by
-* `id`, and `item` either narrows to the selected index or — when no item is
-* given — expands into every sibling chunk (the collection axis). Meta-equality
-* is verified on the loaded chunk. Semantics mirror
-* {@link resolveQualifiedDictionary} so dynamic and static modes behave alike.
+* `variant → item`): `variant` defaults to `default` (or descends by the
+* serialized object identity), and `item` either narrows to the selected index
+* or — when no item is given — expands into every sibling chunk (the collection
+* axis). Semantics mirror {@link resolveQualifiedDictionary} so dynamic and
+* static modes behave alike.
 *
 * The Suspense mechanism is injected through `loadChunk` so the same logic
 * serves both the client (suspender cache) and the server (`react.use`). Every
@@ -257,7 +271,7 @@ const resolveQualifiedDynamicContent = (params) => {
 	const { loaderMap, key, locale, selector, loadChunk, transform } = params;
 	const { itemAxisOpen, missed, chunks } = collectQualifiedChunks(loaderMap, key, locale, selector);
 	if (missed) return itemAxisOpen ? [] : null;
-	const dictionaries = chunks.map(({ cacheKey, loader }) => loadChunk(cacheKey, loader())).filter((dictionary) => chunkMatchesMeta(loaderMap, dictionary, selector));
+	const dictionaries = chunks.map(({ cacheKey, loader }) => loadChunk(cacheKey, loader()));
 	if (itemAxisOpen) return dictionaries.map(transform);
 	const [dictionary] = dictionaries;
 	return dictionary ? transform(dictionary) : null;
@@ -277,7 +291,7 @@ const resolveQualifiedDynamicContentAsync = async (params) => {
 	const { loaderMap, key, locale, selector, transform } = params;
 	const { itemAxisOpen, missed, chunks } = collectQualifiedChunks(loaderMap, key, locale, selector);
 	if (missed) return itemAxisOpen ? [] : null;
-	const dictionaries = (await Promise.all(chunks.map(({ loader }) => loader()))).filter((dictionary) => chunkMatchesMeta(loaderMap, dictionary, selector));
+	const dictionaries = await Promise.all(chunks.map(({ loader }) => loader()));
 	if (itemAxisOpen) return dictionaries.map(transform);
 	const [dictionary] = dictionaries;
 	return dictionary ? transform(dictionary) : null;
@@ -287,11 +301,11 @@ const resolveQualifiedDynamicContentAsync = async (params) => {
 exports.COMPOSITE_ID_SEPARATOR = COMPOSITE_ID_SEPARATOR;
 exports.QUALIFIER_DYNAMIC_TYPES_KEY = QUALIFIER_DYNAMIC_TYPES_KEY;
 exports.QUALIFIER_ORDER = QUALIFIER_ORDER;
-exports.getDictionaryCompositeId = getDictionaryCompositeId;
-exports.getDictionaryQualifierId = getDictionaryQualifierId;
-exports.getDictionaryQualifierSegments = getDictionaryQualifierSegments;
+exports.getDictionaryCompositeIds = getDictionaryCompositeIds;
+exports.getDictionaryQualifierIds = getDictionaryQualifierIds;
 exports.getDictionaryQualifierTypes = getDictionaryQualifierTypes;
 exports.getDictionarySelectorCacheKey = getDictionarySelectorCacheKey;
+exports.getVariantIds = getVariantIds;
 exports.isQualifiedDictionaryGroup = isQualifiedDictionaryGroup;
 exports.isQualifiedDynamicLoaderMap = isQualifiedDynamicLoaderMap;
 exports.parseDictionarySelector = parseDictionarySelector;
@@ -299,4 +313,5 @@ exports.reconstructQualifiedEntry = reconstructQualifiedEntry;
 exports.resolveQualifiedDictionary = resolveQualifiedDictionary;
 exports.resolveQualifiedDynamicContent = resolveQualifiedDynamicContent;
 exports.resolveQualifiedDynamicContentAsync = resolveQualifiedDynamicContentAsync;
+exports.serializeVariant = serializeVariant;
 //# sourceMappingURL=qualifiedDictionary.cjs.map