prettier-plugin-intlayer 0.0.0-stage → 9.7.1

package/README.md

@@ -1,3 +1,47 @@
-# Temporary Holding Version
+# prettier-plugin-intlayer
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+Prettier plugin for [Intlayer](https://intlayer.org). It puts the keys of your
+translations in a fixed order every time Prettier formats a file.
+
+| Helper     | Order                                                           |
+| ---------- | --------------------------------------------------------------- |
+| `t()`      | pinned locales (`en`), then alphabetical                        |
+| `plural()` | CLDR: `zero`, `one`, `two`, `few`, `many`, `other`              |
+| `enu()`    | ascending threshold, `fallback` last (only if behavior-safe)    |
+| `select()` | alphabetical, `fallback` last (implicit last-key fallback kept) |
+
+The serialized `.content.json` nodes (`{ "nodeType": "translation", … }`) are
+sorted the same way.
+
+## Installation
+
+```bash
+npm install --save-dev prettier prettier-plugin-intlayer
+```
+
+Or let `intlayer init prettier` install and configure it.
+
+## Usage
+
+```json
+{
+  "plugins": ["prettier-plugin-intlayer"],
+  "intlayerPinnedLocales": ["en"],
+  "intlayerSortContentKeys": false
+}
+```
+
+| Option                                  | Default  | Description                                                                        |
+| --------------------------------------- | -------- | ---------------------------------------------------------------------------------- |
+| `intlayerPinnedLocales`                 | `["en"]` | Locales kept first in `t()`, in this order. `[]` sorts them all.                   |
+| `intlayerSortContentKeys`               | `false`  | In `*.content.*` files, also sort the dictionary content keys and nested objects.  |
+| `intlayerCollapseIdenticalTranslations` | `true`   | In `*.content.*` files, `t({ en: 'Next.js', fr: 'Next.js' })` becomes `'Next.js'`. |
+
+Objects holding a spread, a computed key, a method or a duplicated key are
+left untouched. Comments move with their key.
+
+Prettier runs one plugin per parser: if another plugin also replaces the JS/TS
+parsers (e.g. `prettier-plugin-tailwindcss`), scope this one to `*.content.*`
+files with an override.
+
+Documentation: https://intlayer.org/doc/prettier

package/dist/cjs/@intlayer/core/dist/esm/interpreter/getEnumeration.cjs

@@ -0,0 +1,42 @@
+// ../@intlayer/core/dist/esm/interpreter/getEnumeration.mjs
+/**
+* Find the matching condition for a quantity.
+*
+* Usage:
+*
+* ```ts
+* const key = findMatchingCondition({
+*  '<=-2.3': 'You have less than -2.3',
+*  '<1': 'You have less than one',
+*  '2': 'You have two',
+*  '>=3': 'You have three or more',
+* }, 2);
+* // '2'
+* ```
+*
+* The order of the keys will define the priority of the content.
+*
+* ```ts
+* const key = findMatchingCondition({
+*  '<4': 'You have less than four',
+*  '2': 'You have two',
+* }, 2);
+* // '<4'
+* ```
+*
+* If no keys match, the default key is '1'.
+*/
+const findMatchingCondition = (enumerationContent, quantity) => {
+	const numericKeys = Object.keys(enumerationContent);
+	for (const key of numericKeys) {
+		const isEqual = !key.startsWith(">") && !key.startsWith("<") && !key.startsWith("=") && parseFloat(key) === quantity || key.startsWith("=") && parseFloat(key.slice(1)) === quantity;
+		const isSuperior = key.startsWith(">") && quantity > parseFloat(key.slice(1));
+		const isSuperiorOrEqual = key.startsWith(">=") && quantity >= parseFloat(key.slice(2));
+		const isInferior = key.startsWith("<") && quantity < parseFloat(key.slice(1));
+		const isInferiorOrEqual = key.startsWith("<=") && quantity <= parseFloat(key.slice(2));
+		if (isEqual || isSuperior || isSuperiorOrEqual || isInferior || isInferiorOrEqual) return key;
+	}
+};
+
+exports.findMatchingCondition = findMatchingCondition;
+//# sourceMappingURL=getEnumeration.cjs.map

package/dist/cjs/@intlayer/core/dist/esm/interpreter/getEnumeration.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"getEnumeration.cjs","names":[],"sources":["../../../../../../../../@intlayer/core/dist/esm/interpreter/getEnumeration.mjs"],"sourcesContent":["// src/interpreter/getEnumeration.ts\n/**\n* Find the matching condition for a quantity.\n*\n* Usage:\n*\n* ```ts\n* const key = findMatchingCondition({\n*  '<=-2.3': 'You have less than -2.3',\n*  '<1': 'You have less than one',\n*  '2': 'You have two',\n*  '>=3': 'You have three or more',\n* }, 2);\n* // '2'\n* ```\n*\n* The order of the keys will define the priority of the content.\n*\n* ```ts\n* const key = findMatchingCondition({\n*  '<4': 'You have less than four',\n*  '2': 'You have two',\n* }, 2);\n* // '<4'\n* ```\n*\n* If no keys match, the default key is '1'.\n*/\nconst findMatchingCondition = (enumerationContent, quantity) => {\n\tconst numericKeys = Object.keys(enumerationContent);\n\tfor (const key of numericKeys) {\n\t\tconst isEqual = !key.startsWith(\">\") && !key.startsWith(\"<\") && !key.startsWith(\"=\") && parseFloat(key) === quantity || key.startsWith(\"=\") && parseFloat(key.slice(1)) === quantity;\n\t\tconst isSuperior = key.startsWith(\">\") && quantity > parseFloat(key.slice(1));\n\t\tconst isSuperiorOrEqual = key.startsWith(\">=\") && quantity >= parseFloat(key.slice(2));\n\t\tconst isInferior = key.startsWith(\"<\") && quantity < parseFloat(key.slice(1));\n\t\tconst isInferiorOrEqual = key.startsWith(\"<=\") && quantity <= parseFloat(key.slice(2));\n\t\tif (isEqual || isSuperior || isSuperiorOrEqual || isInferior || isInferiorOrEqual) return key;\n\t}\n};\n/**\n* Picks content from an enumeration map based on a provided quantity.\n*\n* Supported keys in the enumeration map:\n* - Specific numbers: '0', '1', '2'\n* - Comparison operators: '<5', '>=10', '<=2'\n* - Fallback: 'fallback'\n*\n* The first matching key in the object's iteration order will be selected.\n*\n* @param enumerationContent - A map of conditions/quantities to content.\n* @param quantity - The number to match against the conditions.\n* @returns The matching content.\n*\n* @example\n* ```ts\n* const content = getEnumeration({\n*   '0': 'No items',\n*   '1': 'One item',\n*   '>1': 'Many items',\n* }, 5);\n* // 'Many items'\n* ```\n*/\nconst getEnumeration = (enumerationContent, quantity) => {\n\treturn enumerationContent[findMatchingCondition(enumerationContent, quantity) ?? \"fallback\"];\n};\n\nexport { findMatchingCondition, getEnumeration };\n//# sourceMappingURL=getEnumeration.mjs.map"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,MAAM,yBAAyB,oBAAoB,aAAa;CAC/D,MAAM,cAAc,OAAO,KAAK,kBAAkB;CAClD,KAAK,MAAM,OAAO,aAAa;EAC9B,MAAM,UAAU,CAAC,IAAI,WAAW,GAAG,KAAK,CAAC,IAAI,WAAW,GAAG,KAAK,CAAC,IAAI,WAAW,GAAG,KAAK,WAAW,GAAG,MAAM,YAAY,IAAI,WAAW,GAAG,KAAK,WAAW,IAAI,MAAM,CAAC,CAAC,MAAM;EAC5K,MAAM,aAAa,IAAI,WAAW,GAAG,KAAK,WAAW,WAAW,IAAI,MAAM,CAAC,CAAC;EAC5E,MAAM,oBAAoB,IAAI,WAAW,IAAI,KAAK,YAAY,WAAW,IAAI,MAAM,CAAC,CAAC;EACrF,MAAM,aAAa,IAAI,WAAW,GAAG,KAAK,WAAW,WAAW,IAAI,MAAM,CAAC,CAAC;EAC5E,MAAM,oBAAoB,IAAI,WAAW,IAAI,KAAK,YAAY,WAAW,IAAI,MAAM,CAAC,CAAC;EACrF,IAAI,WAAW,cAAc,qBAAqB,cAAc,mBAAmB,OAAO;CAC3F;AACD"}

package/dist/cjs/collapseTranslations.cjs

@@ -0,0 +1,73 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+const require_sortContentNodes = require("./sortContentNodes.cjs");
+
+// src/collapseTranslations.ts
+/** Fields of a serialized translation node that may be collapsed. */
+const SERIALIZED_TRANSLATION_FIELDS = /* @__PURE__ */ new Set(["nodeType", "translation"]);
+/** Start / end offsets, from Babel (`start`/`end`) or ESTree (`range`). */
+const getNodeBounds = (node) => {
+	if (Array.isArray(node.range)) return node.range;
+	if (typeof node.start === "number" && typeof node.end === "number") return [node.start, node.end];
+};
+const isStringLiteral = (node) => require_sortContentNodes.isAstNode(node) && (node.type === "StringLiteral" || node.type === "Literal") && typeof node.value === "string";
+/**
+* The string literal every locale shares, or `undefined` when the locales
+* differ, hold anything but a plain string, or there is only one locale.
+*/
+const getSharedStringLiteral = (translationMap) => {
+	const properties = translationMap.properties;
+	if (properties.length < 2 || !properties.every(require_sortContentNodes.isPlainProperty)) return;
+	const values = properties.map((property) => property.value);
+	if (!values.every(isStringLiteral)) return void 0;
+	const [firstValue] = values;
+	return values.every((value) => value.value === firstValue.value) ? firstValue : void 0;
+};
+/** Replaces a node in place by another one, keeping the object identity. */
+const replaceNodeInPlace = (target, replacement) => {
+	for (const field of Object.keys(target)) delete target[field];
+	Object.assign(target, replacement);
+};
+/**
+* The node to collapse and the literal replacing it: a `t({...})` call, or a
+* serialized `{ nodeType: 'translation', translation: {...} }` object.
+*/
+const getCollapsibleTranslation = (node) => {
+	const helperContent = require_sortContentNodes.getHelperCallContent(node);
+	if (helperContent) return helperContent.nodeType === "translation" && node.arguments.length === 1 && !node.typeArguments && !node.typeParameters ? getSharedStringLiteral(helperContent.content) : void 0;
+	const serializedContent = require_sortContentNodes.getSerializedNodeContent(node);
+	if (serializedContent?.nodeType !== "translation") return void 0;
+	return node.properties.every((property) => require_sortContentNodes.isPlainProperty(property) && SERIALIZED_TRANSLATION_FIELDS.has(require_sortContentNodes.getStaticKeyName(property) ?? "")) ? getSharedStringLiteral(serializedContent.content) : void 0;
+};
+/**
+* Replaces, in place, every translation whose locales all hold the same
+* string by that string: `t({ en: 'Next.js', fr: 'Next.js' })` → `'Next.js'`.
+*
+* Translations holding a comment are kept, so no comment is lost.
+*/
+const collapseIdenticalTranslationsInAst = (rootNode) => {
+	const commentBounds = (require_sortContentNodes.isAstNode(rootNode) && Array.isArray(rootNode.comments) ? rootNode.comments : []).map(getNodeBounds).filter((bounds) => bounds !== void 0);
+	const containsComment = (node) => {
+		const bounds = getNodeBounds(node);
+		if (!bounds) return true;
+		return commentBounds.some(([commentStart, commentEnd]) => commentStart >= bounds[0] && commentEnd <= bounds[1]);
+	};
+	const visitedNodes = /* @__PURE__ */ new WeakSet();
+	const pendingValues = [rootNode];
+	while (pendingValues.length > 0) {
+		const value = pendingValues.pop();
+		if (typeof value !== "object" || value === null) continue;
+		if (visitedNodes.has(value)) continue;
+		visitedNodes.add(value);
+		if (require_sortContentNodes.isAstNode(value)) {
+			const sharedLiteral = getCollapsibleTranslation(value);
+			if (sharedLiteral && !containsComment(value)) {
+				replaceNodeInPlace(value, { ...sharedLiteral });
+				continue;
+			}
+		}
+		for (const [field, child] of Object.entries(value)) if (field !== "loc" && field !== "range" && field !== "parent") pendingValues.push(child);
+	}
+};
+
+exports.collapseIdenticalTranslationsInAst = collapseIdenticalTranslationsInAst;
+//# sourceMappingURL=collapseTranslations.cjs.map

package/dist/cjs/collapseTranslations.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"collapseTranslations.cjs","names":["isAstNode","isPlainProperty","getHelperCallContent","getSerializedNodeContent","getStaticKeyName"],"sources":["../../src/collapseTranslations.ts"],"sourcesContent":["import {\n  type AstNode,\n  getHelperCallContent,\n  getSerializedNodeContent,\n  getStaticKeyName,\n  isAstNode,\n  isPlainProperty,\n} from './sortContentNodes';\n\n/** Fields of a serialized translation node that may be collapsed. */\nconst SERIALIZED_TRANSLATION_FIELDS = new Set(['nodeType', 'translation']);\n\n/** Start / end offsets, from Babel (`start`/`end`) or ESTree (`range`). */\nconst getNodeBounds = (node: AstNode): [number, number] | undefined => {\n  if (Array.isArray(node.range)) return node.range as [number, number];\n  if (typeof node.start === 'number' && typeof node.end === 'number') {\n    return [node.start, node.end];\n  }\n\n  return undefined;\n};\n\nconst isStringLiteral = (node: unknown): node is AstNode =>\n  isAstNode(node) &&\n  (node.type === 'StringLiteral' || node.type === 'Literal') &&\n  typeof node.value === 'string';\n\n/**\n * The string literal every locale shares, or `undefined` when the locales\n * differ, hold anything but a plain string, or there is only one locale.\n */\nconst getSharedStringLiteral = (\n  translationMap: AstNode\n): AstNode | undefined => {\n  const properties = translationMap.properties as unknown[];\n\n  if (properties.length < 2 || !properties.every(isPlainProperty)) {\n    return undefined;\n  }\n\n  const values = (properties as AstNode[]).map((property) => property.value);\n\n  if (!values.every(isStringLiteral)) return undefined;\n\n  const [firstValue] = values;\n\n  return values.every((value) => value.value === firstValue.value)\n    ? firstValue\n    : undefined;\n};\n\n/** Replaces a node in place by another one, keeping the object identity. */\nconst replaceNodeInPlace = (target: AstNode, replacement: AstNode): void => {\n  for (const field of Object.keys(target)) {\n    delete target[field];\n  }\n\n  Object.assign(target, replacement);\n};\n\n/**\n * The node to collapse and the literal replacing it: a `t({...})` call, or a\n * serialized `{ nodeType: 'translation', translation: {...} }` object.\n */\nconst getCollapsibleTranslation = (node: AstNode): AstNode | undefined => {\n  const helperContent = getHelperCallContent(node);\n\n  if (helperContent) {\n    const isPlainCall =\n      helperContent.nodeType === 'translation' &&\n      (node.arguments as unknown[]).length === 1 &&\n      !node.typeArguments &&\n      !node.typeParameters;\n\n    return isPlainCall\n      ? getSharedStringLiteral(helperContent.content)\n      : undefined;\n  }\n\n  const serializedContent = getSerializedNodeContent(node);\n\n  if (serializedContent?.nodeType !== 'translation') return undefined;\n\n  const hasOnlyTranslationFields = (node.properties as unknown[]).every(\n    (property) =>\n      isPlainProperty(property) &&\n      SERIALIZED_TRANSLATION_FIELDS.has(getStaticKeyName(property) ?? '')\n  );\n\n  return hasOnlyTranslationFields\n    ? getSharedStringLiteral(serializedContent.content)\n    : undefined;\n};\n\n/**\n * Replaces, in place, every translation whose locales all hold the same\n * string by that string: `t({ en: 'Next.js', fr: 'Next.js' })` → `'Next.js'`.\n *\n * Translations holding a comment are kept, so no comment is lost.\n */\nexport const collapseIdenticalTranslationsInAst = (rootNode: unknown): void => {\n  const commentBounds = (\n    isAstNode(rootNode) && Array.isArray(rootNode.comments)\n      ? (rootNode.comments as AstNode[])\n      : []\n  )\n    .map(getNodeBounds)\n    .filter((bounds): bounds is [number, number] => bounds !== undefined);\n\n  const containsComment = (node: AstNode): boolean => {\n    const bounds = getNodeBounds(node);\n\n    if (!bounds) return true;\n\n    return commentBounds.some(\n      ([commentStart, commentEnd]) =>\n        commentStart >= bounds[0] && commentEnd <= bounds[1]\n    );\n  };\n\n  const visitedNodes = new WeakSet<object>();\n  const pendingValues: unknown[] = [rootNode];\n\n  while (pendingValues.length > 0) {\n    const value = pendingValues.pop();\n\n    if (typeof value !== 'object' || value === null) continue;\n    if (visitedNodes.has(value)) continue;\n\n    visitedNodes.add(value);\n\n    if (isAstNode(value)) {\n      const sharedLiteral = getCollapsibleTranslation(value);\n\n      if (sharedLiteral && !containsComment(value)) {\n        replaceNodeInPlace(value, { ...sharedLiteral });\n        continue;\n      }\n    }\n\n    for (const [field, child] of Object.entries(value)) {\n      if (field !== 'loc' && field !== 'range' && field !== 'parent') {\n        pendingValues.push(child);\n      }\n    }\n  }\n};\n"],"mappings":";;;;;AAUA,MAAM,gDAAgC,IAAI,IAAI,CAAC,YAAY,aAAa,CAAC;;AAGzE,MAAM,iBAAiB,SAAgD;CACrE,IAAI,MAAM,QAAQ,KAAK,KAAK,GAAG,OAAO,KAAK;CAC3C,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,KAAK,QAAQ,UACxD,OAAO,CAAC,KAAK,OAAO,KAAK,GAAG;AAIhC;AAEA,MAAM,mBAAmB,SACvBA,mCAAU,IAAI,MACb,KAAK,SAAS,mBAAmB,KAAK,SAAS,cAChD,OAAO,KAAK,UAAU;;;;;AAMxB,MAAM,0BACJ,mBACwB;CACxB,MAAM,aAAa,eAAe;CAElC,IAAI,WAAW,SAAS,KAAK,CAAC,WAAW,MAAMC,wCAAe,GAC5D;CAGF,MAAM,SAAU,WAAyB,KAAK,aAAa,SAAS,KAAK;CAEzE,IAAI,CAAC,OAAO,MAAM,eAAe,GAAG,OAAO;CAE3C,MAAM,CAAC,cAAc;CAErB,OAAO,OAAO,OAAO,UAAU,MAAM,UAAU,WAAW,KAAK,IAC3D,aACA;AACN;;AAGA,MAAM,sBAAsB,QAAiB,gBAA+B;CAC1E,KAAK,MAAM,SAAS,OAAO,KAAK,MAAM,GACpC,OAAO,OAAO;CAGhB,OAAO,OAAO,QAAQ,WAAW;AACnC;;;;;AAMA,MAAM,6BAA6B,SAAuC;CACxE,MAAM,gBAAgBC,8CAAqB,IAAI;CAE/C,IAAI,eAOF,OALE,cAAc,aAAa,iBAC1B,KAAK,UAAwB,WAAW,KACzC,CAAC,KAAK,iBACN,CAAC,KAAK,iBAGJ,uBAAuB,cAAc,OAAO,IAC5C;CAGN,MAAM,oBAAoBC,kDAAyB,IAAI;CAEvD,IAAI,mBAAmB,aAAa,eAAe,OAAO;CAQ1D,OANkC,KAAK,WAAyB,OAC7D,aACCF,yCAAgB,QAAQ,KACxB,8BAA8B,IAAIG,0CAAiB,QAAQ,KAAK,EAAE,CAGxC,IAC1B,uBAAuB,kBAAkB,OAAO,IAChD;AACN;;;;;;;AAQA,MAAa,sCAAsC,aAA4B;CAC7E,MAAM,iBACJJ,mCAAU,QAAQ,KAAK,MAAM,QAAQ,SAAS,QAAQ,IACjD,SAAS,WACV,CAAC,EAAC,CAEL,IAAI,aAAa,CAAC,CAClB,QAAQ,WAAuC,WAAW,MAAS;CAEtE,MAAM,mBAAmB,SAA2B;EAClD,MAAM,SAAS,cAAc,IAAI;EAEjC,IAAI,CAAC,QAAQ,OAAO;EAEpB,OAAO,cAAc,MAClB,CAAC,cAAc,gBACd,gBAAgB,OAAO,MAAM,cAAc,OAAO,EACtD;CACF;CAEA,MAAM,+BAAe,IAAI,QAAgB;CACzC,MAAM,gBAA2B,CAAC,QAAQ;CAE1C,OAAO,cAAc,SAAS,GAAG;EAC/B,MAAM,QAAQ,cAAc,IAAI;EAEhC,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM;EACjD,IAAI,aAAa,IAAI,KAAK,GAAG;EAE7B,aAAa,IAAI,KAAK;EAEtB,IAAIA,mCAAU,KAAK,GAAG;GACpB,MAAM,gBAAgB,0BAA0B,KAAK;GAErD,IAAI,iBAAiB,CAAC,gBAAgB,KAAK,GAAG;IAC5C,mBAAmB,OAAO,EAAE,GAAG,cAAc,CAAC;IAC9C;GACF;EACF;EAEA,KAAK,MAAM,CAAC,OAAO,UAAU,OAAO,QAAQ,KAAK,GAC/C,IAAI,UAAU,SAAS,UAAU,WAAW,UAAU,UACpD,cAAc,KAAK,KAAK;CAG9B;AACF"}

package/dist/cjs/index.cjs

@@ -0,0 +1,84 @@
+Object.defineProperties(exports, { __esModule: { value: true }, [Symbol.toStringTag]: { value: 'Module' } });
+const require_collapseTranslations = require("./collapseTranslations.cjs");
+const require_sortContentKeys = require("./sortContentKeys.cjs");
+const require_sortContentNodes = require("./sortContentNodes.cjs");
+const require_keyOrderings = require("./keyOrderings.cjs");
+let prettier_plugins_acorn = require("prettier/plugins/acorn");
+let prettier_plugins_babel = require("prettier/plugins/babel");
+let prettier_plugins_flow = require("prettier/plugins/flow");
+let prettier_plugins_meriyah = require("prettier/plugins/meriyah");
+let prettier_plugins_typescript = require("prettier/plugins/typescript");
+
+// src/index.ts
+/** Locales kept at the top of every translation when none are configured. */
+const DEFAULT_PINNED_LOCALES = ["en"];
+const readPinnedLocales = (options) => options.intlayerPinnedLocales ?? DEFAULT_PINNED_LOCALES;
+/** Wraps a built-in parser so the parsed AST gets its content nodes sorted. */
+const withSortedTranslations = (parser) => ({
+	...parser,
+	parse: async (text, options) => {
+		const ast = await parser.parse(text, options);
+		const pluginOptions = options;
+		const isContentDeclaration = require_sortContentKeys.isContentFile(options.filepath);
+		if (pluginOptions.intlayerCollapseIdenticalTranslations !== false && isContentDeclaration) require_collapseTranslations.collapseIdenticalTranslationsInAst(ast);
+		require_sortContentNodes.sortContentNodesInAst(ast, readPinnedLocales(options));
+		if (pluginOptions.intlayerSortContentKeys && isContentDeclaration) require_sortContentKeys.sortContentKeysInAst(ast);
+		return ast;
+	}
+});
+const wrapParsers = (sourceParsers, parserNames) => Object.fromEntries(parserNames.map((parserName) => [parserName, withSortedTranslations(sourceParsers[parserName])]));
+const parsers = {
+	...wrapParsers(prettier_plugins_babel.parsers, [
+		"babel",
+		"babel-flow",
+		"babel-ts",
+		"json",
+		"json5",
+		"jsonc"
+	]),
+	...wrapParsers(prettier_plugins_typescript.parsers, ["typescript"]),
+	...wrapParsers(prettier_plugins_acorn.parsers, ["acorn", "espree"]),
+	...wrapParsers(prettier_plugins_flow.parsers, ["flow"]),
+	...wrapParsers(prettier_plugins_meriyah.parsers, ["meriyah"])
+};
+const options = {
+	intlayerPinnedLocales: {
+		type: "string",
+		array: true,
+		category: "Intlayer",
+		default: [{ value: [...DEFAULT_PINNED_LOCALES] }],
+		description: "Locales kept first, in this order, in every t() translation. The other locales are sorted alphabetically."
+	},
+	intlayerCollapseIdenticalTranslations: {
+		type: "boolean",
+		category: "Intlayer",
+		default: true,
+		description: "In .content files, replace a t() whose locales all hold the same string by that string: t({ en: 'Next.js', fr: 'Next.js' }) becomes 'Next.js'."
+	},
+	intlayerSortContentKeys: {
+		type: "boolean",
+		category: "Intlayer",
+		default: false,
+		description: "In .content files, also sort the keys of the dictionary content and of its nested objects alphabetically."
+	}
+};
+const plugin = {
+	parsers,
+	options
+};
+
+exports.DEFAULT_PINNED_LOCALES = DEFAULT_PINNED_LOCALES;
+exports.PLURAL_CATEGORY_ORDER = require_keyOrderings.PLURAL_CATEGORY_ORDER;
+exports.collapseIdenticalTranslationsInAst = require_collapseTranslations.collapseIdenticalTranslationsInAst;
+exports.createLocaleComparator = require_keyOrderings.createLocaleComparator;
+exports.default = plugin;
+exports.isContentFile = require_sortContentKeys.isContentFile;
+exports.options = options;
+exports.orderAlphabetically = require_keyOrderings.orderAlphabetically;
+exports.orderEnumerationConditions = require_keyOrderings.orderEnumerationConditions;
+exports.orderPluralCategories = require_keyOrderings.orderPluralCategories;
+exports.orderSelectCases = require_keyOrderings.orderSelectCases;
+exports.parsers = parsers;
+exports.sortContentKeysInAst = require_sortContentKeys.sortContentKeysInAst;
+exports.sortContentNodesInAst = require_sortContentNodes.sortContentNodesInAst;
+//# sourceMappingURL=index.cjs.map

package/dist/cjs/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","names":["isContentFile","babelParsers","typescriptParsers","acornParsers","flowParsers","meriyahParsers"],"sources":["../../src/index.ts"],"sourcesContent":["import type { Parser, ParserOptions, Plugin, SupportOptions } from 'prettier';\nimport { parsers as acornParsers } from 'prettier/plugins/acorn';\nimport { parsers as babelParsers } from 'prettier/plugins/babel';\nimport { parsers as flowParsers } from 'prettier/plugins/flow';\nimport { parsers as meriyahParsers } from 'prettier/plugins/meriyah';\nimport { parsers as typescriptParsers } from 'prettier/plugins/typescript';\nimport { collapseIdenticalTranslationsInAst } from './collapseTranslations';\nimport { isContentFile, sortContentKeysInAst } from './sortContentKeys';\nimport { sortContentNodesInAst } from './sortContentNodes';\n\nexport { collapseIdenticalTranslationsInAst } from './collapseTranslations';\nexport {\n  createLocaleComparator,\n  orderAlphabetically,\n  orderEnumerationConditions,\n  orderPluralCategories,\n  orderSelectCases,\n  PLURAL_CATEGORY_ORDER,\n} from './keyOrderings';\nexport { isContentFile, sortContentKeysInAst } from './sortContentKeys';\nexport { sortContentNodesInAst } from './sortContentNodes';\n\n/** Locales kept at the top of every translation when none are configured. */\nexport const DEFAULT_PINNED_LOCALES = ['en'] as const;\n\ntype IntlayerPluginOptions = ParserOptions & {\n  intlayerPinnedLocales?: string[];\n  intlayerSortContentKeys?: boolean;\n  intlayerCollapseIdenticalTranslations?: boolean;\n};\n\nconst readPinnedLocales = (options: ParserOptions): readonly string[] =>\n  (options as IntlayerPluginOptions).intlayerPinnedLocales ??\n  DEFAULT_PINNED_LOCALES;\n\n/** Wraps a built-in parser so the parsed AST gets its content nodes sorted. */\nconst withSortedTranslations = <AstType>(\n  parser: Parser<AstType>\n): Parser<AstType> => ({\n  ...parser,\n  parse: async (text, options) => {\n    const ast = await parser.parse(text, options);\n    const pluginOptions = options as IntlayerPluginOptions;\n    const isContentDeclaration = isContentFile(options.filepath);\n\n    if (\n      pluginOptions.intlayerCollapseIdenticalTranslations !== false &&\n      isContentDeclaration\n    ) {\n      collapseIdenticalTranslationsInAst(ast);\n    }\n\n    sortContentNodesInAst(ast, readPinnedLocales(options));\n\n    if (pluginOptions.intlayerSortContentKeys && isContentDeclaration) {\n      sortContentKeysInAst(ast);\n    }\n\n    return ast;\n  },\n});\n\nconst wrapParsers = (\n  sourceParsers: Record<string, Parser>,\n  parserNames: readonly string[]\n): Record<string, Parser> =>\n  Object.fromEntries(\n    parserNames.map((parserName) => [\n      parserName,\n      withSortedTranslations(sourceParsers[parserName]),\n    ])\n  );\n\nexport const parsers: Plugin['parsers'] = {\n  ...wrapParsers(babelParsers, [\n    'babel',\n    'babel-flow',\n    'babel-ts',\n    'json',\n    'json5',\n    'jsonc',\n  ]),\n  ...wrapParsers(typescriptParsers, ['typescript']),\n  ...wrapParsers(acornParsers, ['acorn', 'espree']),\n  ...wrapParsers(flowParsers, ['flow']),\n  ...wrapParsers(meriyahParsers, ['meriyah']),\n};\n\nexport const options: SupportOptions = {\n  intlayerPinnedLocales: {\n    type: 'string',\n    array: true,\n    category: 'Intlayer',\n    default: [{ value: [...DEFAULT_PINNED_LOCALES] }],\n    description:\n      'Locales kept first, in this order, in every t() translation. The other locales are sorted alphabetically.',\n  },\n  intlayerCollapseIdenticalTranslations: {\n    type: 'boolean',\n    category: 'Intlayer',\n    default: true,\n    description:\n      \"In .content files, replace a t() whose locales all hold the same string by that string: t({ en: 'Next.js', fr: 'Next.js' }) becomes 'Next.js'.\",\n  },\n  intlayerSortContentKeys: {\n    type: 'boolean',\n    category: 'Intlayer',\n    default: false,\n    description:\n      'In .content files, also sort the keys of the dictionary content and of its nested objects alphabetically.',\n  },\n};\n\nconst plugin: Plugin = { parsers, options };\n\nexport default plugin;\n"],"mappings":";;;;;;;;;;;;;AAuBA,MAAa,yBAAyB,CAAC,IAAI;AAQ3C,MAAM,qBAAqB,YACxB,QAAkC,yBACnC;;AAGF,MAAM,0BACJ,YACqB;CACrB,GAAG;CACH,OAAO,OAAO,MAAM,YAAY;EAC9B,MAAM,MAAM,MAAM,OAAO,MAAM,MAAM,OAAO;EAC5C,MAAM,gBAAgB;EACtB,MAAM,uBAAuBA,sCAAc,QAAQ,QAAQ;EAE3D,IACE,cAAc,0CAA0C,SACxD,sBAEA,gEAAmC,GAAG;EAGxC,+CAAsB,KAAK,kBAAkB,OAAO,CAAC;EAErD,IAAI,cAAc,2BAA2B,sBAC3C,6CAAqB,GAAG;EAG1B,OAAO;CACT;AACF;AAEA,MAAM,eACJ,eACA,gBAEA,OAAO,YACL,YAAY,KAAK,eAAe,CAC9B,YACA,uBAAuB,cAAc,WAAW,CAClD,CAAC,CACH;AAEF,MAAa,UAA6B;CACxC,GAAG,YAAYC,gCAAc;EAC3B;EACA;EACA;EACA;EACA;EACA;CACF,CAAC;CACD,GAAG,YAAYC,qCAAmB,CAAC,YAAY,CAAC;CAChD,GAAG,YAAYC,gCAAc,CAAC,SAAS,QAAQ,CAAC;CAChD,GAAG,YAAYC,+BAAa,CAAC,MAAM,CAAC;CACpC,GAAG,YAAYC,kCAAgB,CAAC,SAAS,CAAC;AAC5C;AAEA,MAAa,UAA0B;CACrC,uBAAuB;EACrB,MAAM;EACN,OAAO;EACP,UAAU;EACV,SAAS,CAAC,EAAE,OAAO,CAAC,GAAG,sBAAsB,EAAE,CAAC;EAChD,aACE;CACJ;CACA,uCAAuC;EACrC,MAAM;EACN,UAAU;EACV,SAAS;EACT,aACE;CACJ;CACA,yBAAyB;EACvB,MAAM;EACN,UAAU;EACV,SAAS;EACT,aACE;CACJ;AACF;AAEA,MAAM,SAAiB;CAAE;CAAS;AAAQ"}

package/dist/cjs/keyOrderings.cjs

@@ -0,0 +1,135 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+const require_getEnumeration = require("./@intlayer/core/dist/esm/interpreter/getEnumeration.cjs");
+
+// src/keyOrderings.ts
+const compareStrings = (stringA, stringB) => {
+	if (stringA === stringB) return 0;
+	return stringA < stringB ? -1 : 1;
+};
+/** Plain alphabetical order, for the keys of a content object. */
+const orderAlphabetically = (keys) => [...keys].sort(compareStrings);
+/**
+* Builds the comparator ordering locales: pinned locales first (in the given
+* order), then every other locale alphabetically.
+*/
+const createLocaleComparator = (pinnedLocales) => {
+	const pinnedRank = new Map(pinnedLocales.map((locale, index) => [locale, index]));
+	return (localeA, localeB) => {
+		const rankA = pinnedRank.get(localeA) ?? Number.POSITIVE_INFINITY;
+		const rankB = pinnedRank.get(localeB) ?? Number.POSITIVE_INFINITY;
+		if (rankA !== rankB) return rankA < rankB ? -1 : 1;
+		return compareStrings(localeA, localeB);
+	};
+};
+/** Locale order for `t()`: pinned locales, then alphabetical. */
+const createLocaleOrdering = (pinnedLocales) => {
+	const compareLocales = createLocaleComparator(pinnedLocales);
+	return (keys) => [...keys].sort(compareLocales);
+};
+/** CLDR plural categories, from the smallest quantity to the fallback. */
+const PLURAL_CATEGORY_ORDER = [
+	"zero",
+	"one",
+	"two",
+	"few",
+	"many",
+	"other"
+];
+/**
+* CLDR order for `plural()`. Unknown keys leave the object untouched.
+*/
+const orderPluralCategories = (keys) => {
+	const categoryRank = new Map(PLURAL_CATEGORY_ORDER.map((category, index) => [category, index]));
+	if (!keys.every((key) => categoryRank.has(key))) return void 0;
+	return [...keys].sort((keyA, keyB) => categoryRank.get(keyA) - categoryRank.get(keyB));
+};
+const FALLBACK_KEY = "fallback";
+const ENUMERATION_CONDITION_PATTERN = /^(<=|>=|<|>|=)?(-?\d+(?:\.\d+)?)$/;
+/** Rank of each operator for one threshold: `<1`, `<=1`, `1`, `>=1`, `>1`. */
+const OPERATOR_RANK = {
+	"<": 0,
+	"<=": 1,
+	"": 2,
+	"=": 2,
+	">=": 3,
+	">": 4
+};
+const parseEnumerationCondition = (key) => {
+	const match = ENUMERATION_CONDITION_PATTERN.exec(key);
+	if (!match) return void 0;
+	return {
+		key,
+		threshold: Number(match[2]),
+		operatorRank: OPERATOR_RANK[match[1] ?? ""]
+	};
+};
+/**
+* Keys in the order the runtime iterates them: JavaScript lists integer-like
+* keys first, ascending, whatever their position in the source.
+*/
+const toRuntimeKeyOrder = (keys) => Object.keys(Object.fromEntries(keys.map((key) => [key, true])));
+/**
+* Quantities covering every interval the conditions can distinguish: each
+* threshold, the midpoint between two thresholds, and one value beyond each
+* end.
+*/
+const getProbeQuantities = (conditions) => {
+	const thresholds = [...new Set(conditions.map((condition) => condition.threshold))].sort((thresholdA, thresholdB) => thresholdA - thresholdB);
+	if (thresholds.length === 0) return [];
+	const midpoints = thresholds.slice(1).map((threshold, index) => (thresholds[index] + threshold) / 2);
+	return [
+		thresholds[0] - 1,
+		...thresholds,
+		...midpoints,
+		thresholds[thresholds.length - 1] + 1
+	];
+};
+const resolvesIdentically = (originalKeys, reorderedKeys, quantities) => {
+	const toContentState = (keys) => Object.fromEntries(toRuntimeKeyOrder(keys).map((key) => [key, key]));
+	const originalContent = toContentState(originalKeys);
+	const reorderedContent = toContentState(reorderedKeys);
+	return quantities.every((quantity) => require_getEnumeration.findMatchingCondition(originalContent, quantity) === require_getEnumeration.findMatchingCondition(reorderedContent, quantity));
+};
+/**
+* Ascending threshold order for `enu()`, `fallback` last.
+*
+* The first matching condition wins at runtime, so the new order is applied
+* only when it selects the same branch for every quantity; overlapping
+* conditions whose priority depends on their position are left untouched.
+*/
+const orderEnumerationConditions = (keys) => {
+	const conditionKeys = keys.filter((key) => key !== FALLBACK_KEY);
+	const conditions = conditionKeys.map(parseEnumerationCondition);
+	if (conditions.some((condition) => condition === void 0)) return;
+	const sortedConditionKeys = conditions.sort((conditionA, conditionB) => conditionA.threshold - conditionB.threshold || conditionA.operatorRank - conditionB.operatorRank || compareStrings(conditionA.key, conditionB.key)).map((condition) => condition.key);
+	if (!resolvesIdentically(conditionKeys, sortedConditionKeys, getProbeQuantities(conditions))) return;
+	const fallbackKeys = keys.filter((key) => key === FALLBACK_KEY);
+	return [...sortedConditionKeys, ...fallbackKeys];
+};
+/** Keys `getSelect` falls back to, by name, before the last declared key. */
+const SELECT_NAMED_FALLBACK_KEYS = ["fallback", "other"];
+/**
+* Alphabetical order for `select()`, `fallback` last.
+*
+* Without a `fallback` or `other` key, the last key is the implicit fallback,
+* so it stays last and only the keys before it are sorted.
+*/
+const orderSelectCases = (keys) => {
+	const hasNamedFallback = keys.some((key) => SELECT_NAMED_FALLBACK_KEYS.includes(key));
+	const runtimeKeys = toRuntimeKeyOrder(keys);
+	const pinnedLastKey = hasNamedFallback ? keys.includes(FALLBACK_KEY) ? FALLBACK_KEY : void 0 : runtimeKeys[runtimeKeys.length - 1];
+	const sortedKeys = keys.filter((key) => key !== pinnedLastKey).sort(compareStrings);
+	const orderedKeys = pinnedLastKey === void 0 ? sortedKeys : [...sortedKeys, pinnedLastKey];
+	const reorderedRuntimeKeys = toRuntimeKeyOrder(orderedKeys);
+	if (!hasNamedFallback && reorderedRuntimeKeys[reorderedRuntimeKeys.length - 1] !== pinnedLastKey) return;
+	return orderedKeys;
+};
+
+exports.PLURAL_CATEGORY_ORDER = PLURAL_CATEGORY_ORDER;
+exports.createLocaleComparator = createLocaleComparator;
+exports.createLocaleOrdering = createLocaleOrdering;
+exports.orderAlphabetically = orderAlphabetically;
+exports.orderEnumerationConditions = orderEnumerationConditions;
+exports.orderPluralCategories = orderPluralCategories;
+exports.orderSelectCases = orderSelectCases;
+//# sourceMappingURL=keyOrderings.cjs.map

package/dist/cjs/keyOrderings.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"keyOrderings.cjs","names":["findMatchingCondition"],"sources":["../../src/keyOrderings.ts"],"sourcesContent":["import { findMatchingCondition } from '@intlayer/core/interpreter';\nimport type { EnumerationContentState } from '@intlayer/core/transpiler';\n\n/**\n * Returns the given keys in their canonical order, or `undefined` when the\n * keys must keep their current order.\n */\nexport type KeyOrdering = (keys: readonly string[]) => string[] | undefined;\n\nconst compareStrings = (stringA: string, stringB: string): number => {\n  if (stringA === stringB) return 0;\n\n  return stringA < stringB ? -1 : 1;\n};\n\n/** Plain alphabetical order, for the keys of a content object. */\nexport const orderAlphabetically: KeyOrdering = (keys) =>\n  [...keys].sort(compareStrings);\n\n/**\n * Builds the comparator ordering locales: pinned locales first (in the given\n * order), then every other locale alphabetically.\n */\nexport const createLocaleComparator = (pinnedLocales: readonly string[]) => {\n  const pinnedRank = new Map(\n    pinnedLocales.map((locale, index) => [locale, index])\n  );\n\n  return (localeA: string, localeB: string): number => {\n    const rankA = pinnedRank.get(localeA) ?? Number.POSITIVE_INFINITY;\n    const rankB = pinnedRank.get(localeB) ?? Number.POSITIVE_INFINITY;\n\n    if (rankA !== rankB) return rankA < rankB ? -1 : 1;\n\n    return compareStrings(localeA, localeB);\n  };\n};\n\n/** Locale order for `t()`: pinned locales, then alphabetical. */\nexport const createLocaleOrdering = (\n  pinnedLocales: readonly string[]\n): KeyOrdering => {\n  const compareLocales = createLocaleComparator(pinnedLocales);\n\n  return (keys) => [...keys].sort(compareLocales);\n};\n\n/** CLDR plural categories, from the smallest quantity to the fallback. */\nexport const PLURAL_CATEGORY_ORDER = [\n  'zero',\n  'one',\n  'two',\n  'few',\n  'many',\n  'other',\n] as const;\n\n/**\n * CLDR order for `plural()`. Unknown keys leave the object untouched.\n */\nexport const orderPluralCategories: KeyOrdering = (keys) => {\n  const categoryRank = new Map<string, number>(\n    PLURAL_CATEGORY_ORDER.map((category, index) => [category, index])\n  );\n\n  if (!keys.every((key) => categoryRank.has(key))) return undefined;\n\n  return [...keys].sort(\n    (keyA, keyB) =>\n      (categoryRank.get(keyA) as number) - (categoryRank.get(keyB) as number)\n  );\n};\n\nconst FALLBACK_KEY = 'fallback';\n\nconst ENUMERATION_CONDITION_PATTERN = /^(<=|>=|<|>|=)?(-?\\d+(?:\\.\\d+)?)$/;\n\n/** Rank of each operator for one threshold: `<1`, `<=1`, `1`, `>=1`, `>1`. */\nconst OPERATOR_RANK: Record<string, number> = {\n  '<': 0,\n  '<=': 1,\n  '': 2,\n  '=': 2,\n  '>=': 3,\n  '>': 4,\n};\n\ntype EnumerationCondition = {\n  key: string;\n  threshold: number;\n  operatorRank: number;\n};\n\nconst parseEnumerationCondition = (\n  key: string\n): EnumerationCondition | undefined => {\n  const match = ENUMERATION_CONDITION_PATTERN.exec(key);\n\n  if (!match) return undefined;\n\n  return {\n    key,\n    threshold: Number(match[2]),\n    operatorRank: OPERATOR_RANK[match[1] ?? ''],\n  };\n};\n\n/**\n * Keys in the order the runtime iterates them: JavaScript lists integer-like\n * keys first, ascending, whatever their position in the source.\n */\nconst toRuntimeKeyOrder = (keys: readonly string[]): string[] =>\n  Object.keys(Object.fromEntries(keys.map((key) => [key, true])));\n\n/**\n * Quantities covering every interval the conditions can distinguish: each\n * threshold, the midpoint between two thresholds, and one value beyond each\n * end.\n */\nconst getProbeQuantities = (\n  conditions: readonly EnumerationCondition[]\n): number[] => {\n  const thresholds = [\n    ...new Set(conditions.map((condition) => condition.threshold)),\n  ].sort((thresholdA, thresholdB) => thresholdA - thresholdB);\n\n  if (thresholds.length === 0) return [];\n\n  const midpoints = thresholds\n    .slice(1)\n    .map((threshold, index) => (thresholds[index] + threshold) / 2);\n\n  return [\n    thresholds[0] - 1,\n    ...thresholds,\n    ...midpoints,\n    thresholds[thresholds.length - 1] + 1,\n  ];\n};\n\nconst resolvesIdentically = (\n  originalKeys: readonly string[],\n  reorderedKeys: readonly string[],\n  quantities: readonly number[]\n): boolean => {\n  const toContentState = (keys: readonly string[]) =>\n    Object.fromEntries(\n      toRuntimeKeyOrder(keys).map((key) => [key, key])\n    ) as EnumerationContentState<string>;\n  const originalContent = toContentState(originalKeys);\n  const reorderedContent = toContentState(reorderedKeys);\n\n  return quantities.every(\n    (quantity) =>\n      findMatchingCondition(originalContent, quantity) ===\n      findMatchingCondition(reorderedContent, quantity)\n  );\n};\n\n/**\n * Ascending threshold order for `enu()`, `fallback` last.\n *\n * The first matching condition wins at runtime, so the new order is applied\n * only when it selects the same branch for every quantity; overlapping\n * conditions whose priority depends on their position are left untouched.\n */\nexport const orderEnumerationConditions: KeyOrdering = (keys) => {\n  const conditionKeys = keys.filter((key) => key !== FALLBACK_KEY);\n  const conditions = conditionKeys.map(parseEnumerationCondition);\n\n  if (conditions.some((condition) => condition === undefined)) {\n    return undefined;\n  }\n\n  const sortedConditionKeys = (conditions as EnumerationCondition[])\n    .sort(\n      (conditionA, conditionB) =>\n        conditionA.threshold - conditionB.threshold ||\n        conditionA.operatorRank - conditionB.operatorRank ||\n        compareStrings(conditionA.key, conditionB.key)\n    )\n    .map((condition) => condition.key);\n\n  if (\n    !resolvesIdentically(\n      conditionKeys,\n      sortedConditionKeys,\n      getProbeQuantities(conditions as EnumerationCondition[])\n    )\n  ) {\n    return undefined;\n  }\n\n  const fallbackKeys = keys.filter((key) => key === FALLBACK_KEY);\n\n  return [...sortedConditionKeys, ...fallbackKeys];\n};\n\n/** Keys `getSelect` falls back to, by name, before the last declared key. */\nconst SELECT_NAMED_FALLBACK_KEYS = ['fallback', 'other'];\n\n/**\n * Alphabetical order for `select()`, `fallback` last.\n *\n * Without a `fallback` or `other` key, the last key is the implicit fallback,\n * so it stays last and only the keys before it are sorted.\n */\nexport const orderSelectCases: KeyOrdering = (keys) => {\n  const hasNamedFallback = keys.some((key) =>\n    SELECT_NAMED_FALLBACK_KEYS.includes(key)\n  );\n  const runtimeKeys = toRuntimeKeyOrder(keys);\n  const pinnedLastKey = hasNamedFallback\n    ? keys.includes(FALLBACK_KEY)\n      ? FALLBACK_KEY\n      : undefined\n    : runtimeKeys[runtimeKeys.length - 1];\n  const sortedKeys = keys\n    .filter((key) => key !== pinnedLastKey)\n    .sort(compareStrings);\n  const orderedKeys =\n    pinnedLastKey === undefined ? sortedKeys : [...sortedKeys, pinnedLastKey];\n  const reorderedRuntimeKeys = toRuntimeKeyOrder(orderedKeys);\n\n  // Integer-like keys always iterate first: bail out if that moves the\n  // implicit fallback.\n  if (\n    !hasNamedFallback &&\n    reorderedRuntimeKeys[reorderedRuntimeKeys.length - 1] !== pinnedLastKey\n  ) {\n    return undefined;\n  }\n\n  return orderedKeys;\n};\n"],"mappings":";;;;AASA,MAAM,kBAAkB,SAAiB,YAA4B;CACnE,IAAI,YAAY,SAAS,OAAO;CAEhC,OAAO,UAAU,UAAU,KAAK;AAClC;;AAGA,MAAa,uBAAoC,SAC/C,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,cAAc;;;;;AAM/B,MAAa,0BAA0B,kBAAqC;CAC1E,MAAM,aAAa,IAAI,IACrB,cAAc,KAAK,QAAQ,UAAU,CAAC,QAAQ,KAAK,CAAC,CACtD;CAEA,QAAQ,SAAiB,YAA4B;EACnD,MAAM,QAAQ,WAAW,IAAI,OAAO,KAAK,OAAO;EAChD,MAAM,QAAQ,WAAW,IAAI,OAAO,KAAK,OAAO;EAEhD,IAAI,UAAU,OAAO,OAAO,QAAQ,QAAQ,KAAK;EAEjD,OAAO,eAAe,SAAS,OAAO;CACxC;AACF;;AAGA,MAAa,wBACX,kBACgB;CAChB,MAAM,iBAAiB,uBAAuB,aAAa;CAE3D,QAAQ,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,cAAc;AAChD;;AAGA,MAAa,wBAAwB;CACnC;CACA;CACA;CACA;CACA;CACA;AACF;;;;AAKA,MAAa,yBAAsC,SAAS;CAC1D,MAAM,eAAe,IAAI,IACvB,sBAAsB,KAAK,UAAU,UAAU,CAAC,UAAU,KAAK,CAAC,CAClE;CAEA,IAAI,CAAC,KAAK,OAAO,QAAQ,aAAa,IAAI,GAAG,CAAC,GAAG,OAAO;CAExD,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,MACd,MAAM,SACJ,aAAa,IAAI,IAAI,IAAgB,aAAa,IAAI,IAAI,CAC/D;AACF;AAEA,MAAM,eAAe;AAErB,MAAM,gCAAgC;;AAGtC,MAAM,gBAAwC;CAC5C,KAAK;CACL,MAAM;CACN,IAAI;CACJ,KAAK;CACL,MAAM;CACN,KAAK;AACP;AAQA,MAAM,6BACJ,QACqC;CACrC,MAAM,QAAQ,8BAA8B,KAAK,GAAG;CAEpD,IAAI,CAAC,OAAO,OAAO;CAEnB,OAAO;EACL;EACA,WAAW,OAAO,MAAM,EAAE;EAC1B,cAAc,cAAc,MAAM,MAAM;CAC1C;AACF;;;;;AAMA,MAAM,qBAAqB,SACzB,OAAO,KAAK,OAAO,YAAY,KAAK,KAAK,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;;;;;;AAOhE,MAAM,sBACJ,eACa;CACb,MAAM,aAAa,CACjB,GAAG,IAAI,IAAI,WAAW,KAAK,cAAc,UAAU,SAAS,CAAC,CAC/D,CAAC,CAAC,MAAM,YAAY,eAAe,aAAa,UAAU;CAE1D,IAAI,WAAW,WAAW,GAAG,OAAO,CAAC;CAErC,MAAM,YAAY,WACf,MAAM,CAAC,CAAC,CACR,KAAK,WAAW,WAAW,WAAW,SAAS,aAAa,CAAC;CAEhE,OAAO;EACL,WAAW,KAAK;EAChB,GAAG;EACH,GAAG;EACH,WAAW,WAAW,SAAS,KAAK;CACtC;AACF;AAEA,MAAM,uBACJ,cACA,eACA,eACY;CACZ,MAAM,kBAAkB,SACtB,OAAO,YACL,kBAAkB,IAAI,CAAC,CAAC,KAAK,QAAQ,CAAC,KAAK,GAAG,CAAC,CACjD;CACF,MAAM,kBAAkB,eAAe,YAAY;CACnD,MAAM,mBAAmB,eAAe,aAAa;CAErD,OAAO,WAAW,OACf,aACCA,6CAAsB,iBAAiB,QAAQ,MAC/CA,6CAAsB,kBAAkB,QAAQ,CACpD;AACF;;;;;;;;AASA,MAAa,8BAA2C,SAAS;CAC/D,MAAM,gBAAgB,KAAK,QAAQ,QAAQ,QAAQ,YAAY;CAC/D,MAAM,aAAa,cAAc,IAAI,yBAAyB;CAE9D,IAAI,WAAW,MAAM,cAAc,cAAc,MAAS,GACxD;CAGF,MAAM,sBAAuB,WAC1B,MACE,YAAY,eACX,WAAW,YAAY,WAAW,aAClC,WAAW,eAAe,WAAW,gBACrC,eAAe,WAAW,KAAK,WAAW,GAAG,CACjD,CAAC,CACA,KAAK,cAAc,UAAU,GAAG;CAEnC,IACE,CAAC,oBACC,eACA,qBACA,mBAAmB,UAAoC,CACzD,GAEA;CAGF,MAAM,eAAe,KAAK,QAAQ,QAAQ,QAAQ,YAAY;CAE9D,OAAO,CAAC,GAAG,qBAAqB,GAAG,YAAY;AACjD;;AAGA,MAAM,6BAA6B,CAAC,YAAY,OAAO;;;;;;;AAQvD,MAAa,oBAAiC,SAAS;CACrD,MAAM,mBAAmB,KAAK,MAAM,QAClC,2BAA2B,SAAS,GAAG,CACzC;CACA,MAAM,cAAc,kBAAkB,IAAI;CAC1C,MAAM,gBAAgB,mBAClB,KAAK,SAAS,YAAY,IACxB,eACA,SACF,YAAY,YAAY,SAAS;CACrC,MAAM,aAAa,KAChB,QAAQ,QAAQ,QAAQ,aAAa,CAAC,CACtC,KAAK,cAAc;CACtB,MAAM,cACJ,kBAAkB,SAAY,aAAa,CAAC,GAAG,YAAY,aAAa;CAC1E,MAAM,uBAAuB,kBAAkB,WAAW;CAI1D,IACE,CAAC,oBACD,qBAAqB,qBAAqB,SAAS,OAAO,eAE1D;CAGF,OAAO;AACT"}

package/dist/cjs/sortContentKeys.cjs

@@ -0,0 +1,86 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+const require_keyOrderings = require("./keyOrderings.cjs");
+const require_sortContentNodes = require("./sortContentNodes.cjs");
+
+// src/sortContentKeys.ts
+/** `*.content.ts`, `*.content.json`, … — the Intlayer declaration files. */
+const CONTENT_FILE_PATTERN = /\.content\.(?:[cm]?[jt]sx?|json5?|jsonc)$/;
+/** Expression wrappers looked through: `x as T`, `x satisfies T`, `(x)`, `x!`. */
+const EXPRESSION_WRAPPER_TYPES = /* @__PURE__ */ new Set([
+	"TSAsExpression",
+	"TSSatisfiesExpression",
+	"TSNonNullExpression",
+	"TSTypeAssertion",
+	"TypeCastExpression",
+	"ParenthesizedExpression"
+]);
+/** True when Prettier is formatting an Intlayer content declaration file. */
+const isContentFile = (filePath) => typeof filePath === "string" && CONTENT_FILE_PATTERN.test(filePath);
+const getPropertyValues = (objectNode) => objectNode.properties.filter(require_sortContentNodes.isPlainProperty).map((property) => property.value);
+/**
+* Sorts a content value alphabetically, recursing through nested objects,
+* arrays and the arguments of every helper call. The maps of `t()` /
+* `plural()` / `enu()` / `select()` keep their own ordering; the argument
+* objects of other helpers keep theirs.
+*/
+const sortContentValue = (value) => {
+	if (!require_sortContentNodes.isAstNode(value)) return;
+	if (EXPRESSION_WRAPPER_TYPES.has(value.type)) {
+		sortContentValue(value.expression);
+		return;
+	}
+	if (value.type === "ArrayExpression") {
+		for (const element of value.elements) sortContentValue(element);
+		return;
+	}
+	const helperContent = require_sortContentNodes.getHelperCallContent(value) ?? require_sortContentNodes.getSerializedNodeContent(value);
+	if (helperContent) {
+		for (const nestedValue of getPropertyValues(helperContent.content)) sortContentValue(nestedValue);
+		return;
+	}
+	if (value.type === "CallExpression") {
+		for (const argument of value.arguments) if (require_sortContentNodes.isObjectExpression(argument)) for (const nestedValue of getPropertyValues(argument)) sortContentValue(nestedValue);
+		else sortContentValue(argument);
+		return;
+	}
+	if (!require_sortContentNodes.isObjectExpression(value)) return;
+	if (!value.properties.some((property) => require_sortContentNodes.isPlainProperty(property) && require_sortContentNodes.getStaticKeyName(property) === "nodeType")) require_sortContentNodes.sortObjectProperties(value, require_keyOrderings.orderAlphabetically);
+	for (const nestedValue of getPropertyValues(value)) sortContentValue(nestedValue);
+};
+/**
+* The `content` of a dictionary declaration: an object holding both a `key`
+* and a `content` property.
+*/
+const getDictionaryContent = (node) => {
+	if (!require_sortContentNodes.isObjectExpression(node)) return void 0;
+	const properties = node.properties.filter(require_sortContentNodes.isPlainProperty);
+	const findProperty = (name) => properties.find((property) => require_sortContentNodes.getStaticKeyName(property) === name);
+	if (!findProperty("key")) return void 0;
+	return findProperty("content")?.value;
+};
+/**
+* Sorts, in place, the keys of every dictionary `content` object of the AST,
+* and of their nested objects, alphabetically.
+*/
+const sortContentKeysInAst = (rootNode) => {
+	const visitedNodes = /* @__PURE__ */ new WeakSet();
+	const pendingValues = [rootNode];
+	while (pendingValues.length > 0) {
+		const value = pendingValues.pop();
+		if (typeof value !== "object" || value === null) continue;
+		if (visitedNodes.has(value)) continue;
+		visitedNodes.add(value);
+		if (require_sortContentNodes.isAstNode(value)) {
+			const dictionaryContent = getDictionaryContent(value);
+			if (dictionaryContent) {
+				sortContentValue(dictionaryContent);
+				continue;
+			}
+		}
+		for (const [field, child] of Object.entries(value)) if (field !== "loc" && field !== "range" && field !== "parent") pendingValues.push(child);
+	}
+};
+
+exports.isContentFile = isContentFile;
+exports.sortContentKeysInAst = sortContentKeysInAst;
+//# sourceMappingURL=sortContentKeys.cjs.map

package/dist/cjs/sortContentKeys.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sortContentKeys.cjs","names":["isPlainProperty","isAstNode","getHelperCallContent","getSerializedNodeContent","isObjectExpression","getStaticKeyName","orderAlphabetically"],"sources":["../../src/sortContentKeys.ts"],"sourcesContent":["import { orderAlphabetically } from './keyOrderings';\nimport {\n  type AstNode,\n  getHelperCallContent,\n  getSerializedNodeContent,\n  getStaticKeyName,\n  isAstNode,\n  isObjectExpression,\n  isPlainProperty,\n  sortObjectProperties,\n} from './sortContentNodes';\n\n/** `*.content.ts`, `*.content.json`, … — the Intlayer declaration files. */\nconst CONTENT_FILE_PATTERN = /\\.content\\.(?:[cm]?[jt]sx?|json5?|jsonc)$/;\n\n/** Expression wrappers looked through: `x as T`, `x satisfies T`, `(x)`, `x!`. */\nconst EXPRESSION_WRAPPER_TYPES = new Set([\n  'TSAsExpression',\n  'TSSatisfiesExpression',\n  'TSNonNullExpression',\n  'TSTypeAssertion',\n  'TypeCastExpression',\n  'ParenthesizedExpression',\n]);\n\n/** True when Prettier is formatting an Intlayer content declaration file. */\nexport const isContentFile = (filePath: string | undefined): boolean =>\n  typeof filePath === 'string' && CONTENT_FILE_PATTERN.test(filePath);\n\nconst getPropertyValues = (objectNode: AstNode): unknown[] =>\n  (objectNode.properties as unknown[])\n    .filter(isPlainProperty)\n    .map((property) => property.value);\n\n/**\n * Sorts a content value alphabetically, recursing through nested objects,\n * arrays and the arguments of every helper call. The maps of `t()` /\n * `plural()` / `enu()` / `select()` keep their own ordering; the argument\n * objects of other helpers keep theirs.\n */\nconst sortContentValue = (value: unknown): void => {\n  if (!isAstNode(value)) return;\n\n  if (EXPRESSION_WRAPPER_TYPES.has(value.type)) {\n    sortContentValue(value.expression);\n    return;\n  }\n\n  if (value.type === 'ArrayExpression') {\n    for (const element of value.elements as unknown[]) {\n      sortContentValue(element);\n    }\n    return;\n  }\n\n  const helperContent =\n    getHelperCallContent(value) ?? getSerializedNodeContent(value);\n\n  if (helperContent) {\n    for (const nestedValue of getPropertyValues(helperContent.content)) {\n      sortContentValue(nestedValue);\n    }\n    return;\n  }\n\n  // Any other helper (`cond`, `gender`, `md`, `insert`, `nest`, `file`, …):\n  // its argument object may carry a meaningful key order (the last `cond` /\n  // `gender` key is the fallback), so only the values inside are sorted.\n  if (value.type === 'CallExpression') {\n    for (const argument of value.arguments as unknown[]) {\n      if (isObjectExpression(argument)) {\n        for (const nestedValue of getPropertyValues(argument)) {\n          sortContentValue(nestedValue);\n        }\n      } else {\n        sortContentValue(argument);\n      }\n    }\n    return;\n  }\n\n  if (!isObjectExpression(value)) return;\n\n  // An unknown serialized node (`{ nodeType: 'condition', … }`) is not a plain\n  // content object: its fields are not reordered.\n  const isSerializedNode = (value.properties as unknown[]).some(\n    (property) =>\n      isPlainProperty(property) && getStaticKeyName(property) === 'nodeType'\n  );\n\n  if (!isSerializedNode) sortObjectProperties(value, orderAlphabetically);\n\n  for (const nestedValue of getPropertyValues(value)) {\n    sortContentValue(nestedValue);\n  }\n};\n\n/**\n * The `content` of a dictionary declaration: an object holding both a `key`\n * and a `content` property.\n */\nconst getDictionaryContent = (node: AstNode): unknown => {\n  if (!isObjectExpression(node)) return undefined;\n\n  const properties = (node.properties as unknown[]).filter(isPlainProperty);\n  const findProperty = (name: string) =>\n    properties.find((property) => getStaticKeyName(property) === name);\n\n  if (!findProperty('key')) return undefined;\n\n  return findProperty('content')?.value;\n};\n\n/**\n * Sorts, in place, the keys of every dictionary `content` object of the AST,\n * and of their nested objects, alphabetically.\n */\nexport const sortContentKeysInAst = (rootNode: unknown): void => {\n  const visitedNodes = new WeakSet<object>();\n  const pendingValues: unknown[] = [rootNode];\n\n  while (pendingValues.length > 0) {\n    const value = pendingValues.pop();\n\n    if (typeof value !== 'object' || value === null) continue;\n    if (visitedNodes.has(value)) continue;\n\n    visitedNodes.add(value);\n\n    if (isAstNode(value)) {\n      const dictionaryContent = getDictionaryContent(value);\n\n      if (dictionaryContent) {\n        sortContentValue(dictionaryContent);\n        continue;\n      }\n    }\n\n    for (const [field, child] of Object.entries(value)) {\n      if (field !== 'loc' && field !== 'range' && field !== 'parent') {\n        pendingValues.push(child);\n      }\n    }\n  }\n};\n"],"mappings":";;;;;;AAaA,MAAM,uBAAuB;;AAG7B,MAAM,2CAA2B,IAAI,IAAI;CACvC;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;AAGD,MAAa,iBAAiB,aAC5B,OAAO,aAAa,YAAY,qBAAqB,KAAK,QAAQ;AAEpE,MAAM,qBAAqB,eACxB,WAAW,WACT,OAAOA,wCAAe,CAAC,CACvB,KAAK,aAAa,SAAS,KAAK;;;;;;;AAQrC,MAAM,oBAAoB,UAAyB;CACjD,IAAI,CAACC,mCAAU,KAAK,GAAG;CAEvB,IAAI,yBAAyB,IAAI,MAAM,IAAI,GAAG;EAC5C,iBAAiB,MAAM,UAAU;EACjC;CACF;CAEA,IAAI,MAAM,SAAS,mBAAmB;EACpC,KAAK,MAAM,WAAW,MAAM,UAC1B,iBAAiB,OAAO;EAE1B;CACF;CAEA,MAAM,gBACJC,8CAAqB,KAAK,KAAKC,kDAAyB,KAAK;CAE/D,IAAI,eAAe;EACjB,KAAK,MAAM,eAAe,kBAAkB,cAAc,OAAO,GAC/D,iBAAiB,WAAW;EAE9B;CACF;CAKA,IAAI,MAAM,SAAS,kBAAkB;EACnC,KAAK,MAAM,YAAY,MAAM,WAC3B,IAAIC,4CAAmB,QAAQ,GAC7B,KAAK,MAAM,eAAe,kBAAkB,QAAQ,GAClD,iBAAiB,WAAW;OAG9B,iBAAiB,QAAQ;EAG7B;CACF;CAEA,IAAI,CAACA,4CAAmB,KAAK,GAAG;CAShC,IAAI,CALsB,MAAM,WAAyB,MACtD,aACCJ,yCAAgB,QAAQ,KAAKK,0CAAiB,QAAQ,MAAM,UAG5C,GAAG,8CAAqB,OAAOC,wCAAmB;CAEtE,KAAK,MAAM,eAAe,kBAAkB,KAAK,GAC/C,iBAAiB,WAAW;AAEhC;;;;;AAMA,MAAM,wBAAwB,SAA2B;CACvD,IAAI,CAACF,4CAAmB,IAAI,GAAG,OAAO;CAEtC,MAAM,aAAc,KAAK,WAAyB,OAAOJ,wCAAe;CACxE,MAAM,gBAAgB,SACpB,WAAW,MAAM,aAAaK,0CAAiB,QAAQ,MAAM,IAAI;CAEnE,IAAI,CAAC,aAAa,KAAK,GAAG,OAAO;CAEjC,OAAO,aAAa,SAAS,CAAC,EAAE;AAClC;;;;;AAMA,MAAa,wBAAwB,aAA4B;CAC/D,MAAM,+BAAe,IAAI,QAAgB;CACzC,MAAM,gBAA2B,CAAC,QAAQ;CAE1C,OAAO,cAAc,SAAS,GAAG;EAC/B,MAAM,QAAQ,cAAc,IAAI;EAEhC,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM;EACjD,IAAI,aAAa,IAAI,KAAK,GAAG;EAE7B,aAAa,IAAI,KAAK;EAEtB,IAAIJ,mCAAU,KAAK,GAAG;GACpB,MAAM,oBAAoB,qBAAqB,KAAK;GAEpD,IAAI,mBAAmB;IACrB,iBAAiB,iBAAiB;IAClC;GACF;EACF;EAEA,KAAK,MAAM,CAAC,OAAO,UAAU,OAAO,QAAQ,KAAK,GAC/C,IAAI,UAAU,SAAS,UAAU,WAAW,UAAU,UACpD,cAAc,KAAK,KAAK;CAG9B;AACF"}