@bemedev/decompose 2.0.3 → 2.2.0

package/lib/decompose.cjs

@@ -1,73 +1,61 @@
-'use strict';
-
-var constants_objects = require('./constants/objects.cjs');
-var constants_strings = require('./constants/strings.cjs');
-var helpers = require('./helpers.cjs');
-
-function ddecompose(arg, prev = '', options = constants_objects.DEFAULT_DECOMPOSE_OPTIONS, first = true) {
-    const { object } = {
-        ...constants_objects.DEFAULT_DECOMPOSE_OPTIONS,
-        ...options,
-    };
-    const canAddObjectKeys = object === 'both' || object === 'object';
-    const canAddKeys = object === 'both' || object === 'key';
-    const _prev = prev ? prev + constants_strings.DELIMITER : '';
-    const output = [];
-    const isArray = Array.isArray(arg);
-    if (isArray) {
-        if (canAddObjectKeys && !first)
-            output.push([`${prev}`, arg]);
-        arg.forEach((item, index) => {
-            const values = ddecompose(item, `${_prev}${constants_strings.LEFT_BRACKET}${index}${constants_strings.RIGHT_BRACKET}`, options, false);
-            output.push(...values);
-        });
-        return output;
-    }
-    const isPrimit = helpers.isPrimitive(arg);
-    if (isPrimit) {
-        const isFirst = !prev.includes(constants_strings.DELIMITER);
-        if (canAddKeys || isFirst)
-            output.push([`${prev}`, arg]);
-        return output;
-    }
-    if (canAddObjectKeys && prev !== '')
-        output.push([`${prev}`, arg]);
-    const entries1 = Object.entries(arg);
-    entries1.forEach(([key, value]) => {
-        const values = ddecompose(value, `${_prev}${key}`, options, false);
-        output.push(...values);
-    });
-    return output;
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_constants_strings = require("./constants/strings.cjs");
+const require_constants_objects = require("./constants/objects.cjs");
+const require_helpers = require("./helpers.cjs");
+//#region src/decompose.ts
+function ddecompose(arg, prev = "", options = require_constants_objects.DEFAULT_DECOMPOSE_OPTIONS, first = true) {
+	const { object } = {
+		...require_constants_objects.DEFAULT_DECOMPOSE_OPTIONS,
+		...options
+	};
+	const canAddObjectKeys = object === "both" || object === "object";
+	const canAddKeys = object === "both" || object === "key";
+	const _prev = prev ? prev + require_constants_strings.DELIMITER : "";
+	const output = [];
+	if (Array.isArray(arg)) {
+		if (canAddObjectKeys && !first) output.push([`${prev}`, arg]);
+		arg.forEach((item, index) => {
+			const values = ddecompose(item, `${_prev}${require_constants_strings.LEFT_BRACKET}${index}${require_constants_strings.RIGHT_BRACKET}`, options, false);
+			output.push(...values);
+		});
+		return output;
+	}
+	if (require_helpers.isPrimitive(arg)) {
+		const isFirst = !prev.includes(require_constants_strings.DELIMITER);
+		if (canAddKeys || isFirst) output.push([`${prev}`, arg]);
+		return output;
+	}
+	if (canAddObjectKeys && prev !== "") output.push([`${prev}`, arg]);
+	Object.entries(arg).forEach(([key, value]) => {
+		const values = ddecompose(value, `${_prev}${key}`, options, false);
+		output.push(...values);
+	});
+	return output;
 }
 const _decompose = (val, options) => {
-    const entries1 = ddecompose(val, '', options);
-    const { sep, start } = {
-        ...constants_objects.DEFAULT_DECOMPOSE_OPTIONS,
-        ...options,
-    };
-    if (entries1.length == 0) {
-        if (Array.isArray(val))
-            return [];
-        return {};
-    }
-    const regexDel = new RegExp(constants_strings.DELIMITER, 'g');
-    const regexLeft = new RegExp(constants_strings.LEFT_BRACKET, 'g');
-    const regexRight = new RegExp(constants_strings.RIGHT_BRACKET, 'g');
-    const entries2 = entries1.map(([__key, value]) => {
-        const _key = __key
-            .replace(regexDel, sep)
-            .replace(regexLeft, `[`)
-            .replace(regexRight, `]`);
-        const key = start ? `${sep}${_key}` : _key;
-        return [key, value];
-    });
-    const output = Object.fromEntries(entries2);
-    return output;
+	const entries1 = ddecompose(val, "", options);
+	const { sep, start } = {
+		...require_constants_objects.DEFAULT_DECOMPOSE_OPTIONS,
+		...options
+	};
+	if (entries1.length == 0) {
+		if (Array.isArray(val)) return [];
+		return {};
+	}
+	const regexDel = new RegExp(require_constants_strings.DELIMITER, "g");
+	const regexLeft = new RegExp(require_constants_strings.LEFT_BRACKET, "g");
+	const regexRight = new RegExp(require_constants_strings.RIGHT_BRACKET, "g");
+	const entries2 = entries1.map(([__key, value]) => {
+		const _key = __key.replace(regexDel, sep).replace(regexLeft, `[`).replace(regexRight, `]`);
+		return [start ? `${sep}${_key}` : _key, value];
+	});
+	return Object.fromEntries(entries2);
 };
 /* v8 ignore next 1 */
 const decompose = (val, options) => _decompose(val, options);
 decompose.low = decompose;
 decompose.strict = decompose;
-
+//#endregion
 exports.decompose = decompose;
-//# sourceMappingURL=decompose.cjs.map
+
+//# sourceMappingURL=decompose.cjs.map

package/lib/decompose.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"decompose.cjs","sources":["../src/decompose.ts"],"sourcesContent":["import { DEFAULT_DECOMPOSE_OPTIONS } from './constants';\nimport {\n  DELIMITER,\n  LEFT_BRACKET,\n  RIGHT_BRACKET,\n} from './constants/strings';\nimport { isPrimitive } from './helpers';\nimport type { Decompose, DecomposeOptions } from './types.types';\n\nfunction ddecompose(\n  arg: any,\n  prev = '',\n  options: DecomposeOptions = DEFAULT_DECOMPOSE_OPTIONS,\n  first = true,\n) {\n  const { object } = {\n    ...DEFAULT_DECOMPOSE_OPTIONS,\n    ...options,\n  };\n  const canAddObjectKeys = object === 'both' || object === 'object';\n  const canAddKeys = object === 'both' || object === 'key';\n\n  const _prev = prev ? prev + DELIMITER : '';\n  const output: [string, any][] = [];\n\n  const isArray = Array.isArray(arg);\n  if (isArray) {\n    if (canAddObjectKeys && !first) output.push([`${prev}`, arg]);\n\n    arg.forEach((item, index) => {\n      const values = ddecompose(\n        item,\n        `${_prev}${LEFT_BRACKET}${index}${RIGHT_BRACKET}`,\n        options,\n        false,\n      );\n      output.push(...values);\n    });\n    return output;\n  }\n\n  const isPrimit = isPrimitive(arg);\n  if (isPrimit) {\n    const isFirst = !prev.includes(DELIMITER);\n    if (canAddKeys || isFirst) output.push([`${prev}`, arg]);\n    return output;\n  }\n\n  if (canAddObjectKeys && prev !== '') output.push([`${prev}`, arg]);\n\n  const entries1 = Object.entries(arg);\n  entries1.forEach(([key, value]) => {\n    const values = ddecompose(value, `${_prev}${key}`, options, false);\n    output.push(...values);\n  });\n\n  return output;\n}\n\ntype Decompose_F = <\n  T,\n  const O extends DecomposeOptions = typeof DEFAULT_DECOMPOSE_OPTIONS,\n>(\n  val: T,\n  options?: O,\n) => Decompose<T, O>;\ntype _Decompose_F = (val: any, options?: DecomposeOptions) => any;\n\nexport type Decomposer = Decompose_F & {\n  strict: Decompose_F;\n  low: _Decompose_F;\n};\n\nconst _decompose: _Decompose_F = (val, options) => {\n  const entries1 = ddecompose(val, '', options);\n\n  const { sep, start } = {\n    ...DEFAULT_DECOMPOSE_OPTIONS,\n    ...options,\n  };\n  if (entries1.length == 0) {\n    if (Array.isArray(val)) return [];\n    return {};\n  }\n\n  const regexDel = new RegExp(DELIMITER, 'g');\n  const regexLeft = new RegExp(LEFT_BRACKET, 'g');\n  const regexRight = new RegExp(RIGHT_BRACKET, 'g');\n  const entries2 = entries1.map(([__key, value]) => {\n    const _key = __key\n      .replace(regexDel, sep)\n      .replace(regexLeft, `[`)\n      .replace(regexRight, `]`);\n    const key = start ? `${sep}${_key}` : _key;\n    return [key, value];\n  });\n\n  const output = Object.fromEntries(entries2);\n  return output;\n};\n\n/* v8 ignore next 1 */\nexport const decompose: Decomposer = (val, options) =>\n  _decompose(val, options);\ndecompose.low = decompose;\ndecompose.strict = decompose;\n"],"names":["DEFAULT_DECOMPOSE_OPTIONS","DELIMITER","LEFT_BRACKET","RIGHT_BRACKET","isPrimitive"],"mappings":";;;;;;AASA,SAAS,UAAU,CACjB,GAAQ,EACR,IAAI,GAAG,EAAE,EACT,OAAA,GAA4BA,2CAAyB,EACrD,KAAK,GAAG,IAAI,EAAA;IAEZ,MAAM,EAAE,MAAM,EAAE,GAAG;AACjB,QAAA,GAAGA,2CAAyB;AAC5B,QAAA,GAAG,OAAO;KACX;IACD,MAAM,gBAAgB,GAAG,MAAM,KAAK,MAAM,IAAI,MAAM,KAAK,QAAQ;IACjE,MAAM,UAAU,GAAG,MAAM,KAAK,MAAM,IAAI,MAAM,KAAK,KAAK;AAExD,IAAA,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAGC,2BAAS,GAAG,EAAE;IAC1C,MAAM,MAAM,GAAoB,EAAE;IAElC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;IAClC,IAAI,OAAO,EAAE;QACX,IAAI,gBAAgB,IAAI,CAAC,KAAK;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA,EAAG,IAAI,CAAA,CAAE,EAAE,GAAG,CAAC,CAAC;QAE7D,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,KAAI;YAC1B,MAAM,MAAM,GAAG,UAAU,CACvB,IAAI,EACJ,CAAA,EAAG,KAAK,CAAA,EAAGC,8BAAY,GAAG,KAAK,CAAA,EAAGC,+BAAa,CAAA,CAAE,EACjD,OAAO,EACP,KAAK,CACN;AACD,YAAA,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AACxB,QAAA,CAAC,CAAC;AACF,QAAA,OAAO,MAAM;IACf;AAEA,IAAA,MAAM,QAAQ,GAAGC,mBAAW,CAAC,GAAG,CAAC;IACjC,IAAI,QAAQ,EAAE;QACZ,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,QAAQ,CAACH,2BAAS,CAAC;QACzC,IAAI,UAAU,IAAI,OAAO;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA,EAAG,IAAI,CAAA,CAAE,EAAE,GAAG,CAAC,CAAC;AACxD,QAAA,OAAO,MAAM;IACf;AAEA,IAAA,IAAI,gBAAgB,IAAI,IAAI,KAAK,EAAE;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA,EAAG,IAAI,CAAA,CAAE,EAAE,GAAG,CAAC,CAAC;IAElE,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;IACpC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,KAAI;AAChC,QAAA,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,CAAA,EAAG,KAAK,CAAA,EAAG,GAAG,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC;AAClE,QAAA,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AACxB,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,MAAM;AACf;AAgBA,MAAM,UAAU,GAAiB,CAAC,GAAG,EAAE,OAAO,KAAI;IAChD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,EAAE,EAAE,EAAE,OAAO,CAAC;AAE7C,IAAA,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG;AACrB,QAAA,GAAGD,2CAAyB;AAC5B,QAAA,GAAG,OAAO;KACX;AACD,IAAA,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE;AACxB,QAAA,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;AAAE,YAAA,OAAO,EAAE;AACjC,QAAA,OAAO,EAAE;IACX;IAEA,MAAM,QAAQ,GAAG,IAAI,MAAM,CAACC,2BAAS,EAAE,GAAG,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,MAAM,CAACC,8BAAY,EAAE,GAAG,CAAC;IAC/C,MAAM,UAAU,GAAG,IAAI,MAAM,CAACC,+BAAa,EAAE,GAAG,CAAC;AACjD,IAAA,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,KAAI;QAC/C,MAAM,IAAI,GAAG;AACV,aAAA,OAAO,CAAC,QAAQ,EAAE,GAAG;AACrB,aAAA,OAAO,CAAC,SAAS,EAAE,CAAA,CAAA,CAAG;AACtB,aAAA,OAAO,CAAC,UAAU,EAAE,CAAA,CAAA,CAAG,CAAC;AAC3B,QAAA,MAAM,GAAG,GAAG,KAAK,GAAG,CAAA,EAAG,GAAG,CAAA,EAAG,IAAI,CAAA,CAAE,GAAG,IAAI;AAC1C,QAAA,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC;AACrB,IAAA,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC;AAC3C,IAAA,OAAO,MAAM;AACf,CAAC;AAED;AACO,MAAM,SAAS,GAAe,CAAC,GAAG,EAAE,OAAO,KAChD,UAAU,CAAC,GAAG,EAAE,OAAO;AACzB,SAAS,CAAC,GAAG,GAAG,SAAS;AACzB,SAAS,CAAC,MAAM,GAAG,SAAS;;;;"}
+{"version":3,"file":"decompose.cjs","names":["DEFAULT_DECOMPOSE_OPTIONS","DELIMITER","LEFT_BRACKET","RIGHT_BRACKET","isPrimitive"],"sources":["../src/decompose.ts"],"sourcesContent":["import { DEFAULT_DECOMPOSE_OPTIONS } from './constants';\nimport {\n  DELIMITER,\n  LEFT_BRACKET,\n  RIGHT_BRACKET,\n} from './constants/strings';\nimport { isPrimitive } from './helpers';\nimport type { Decompose, DecomposeOptions } from './types.types';\n\nfunction ddecompose(\n  arg: any,\n  prev = '',\n  options: DecomposeOptions = DEFAULT_DECOMPOSE_OPTIONS,\n  first = true,\n) {\n  const { object } = {\n    ...DEFAULT_DECOMPOSE_OPTIONS,\n    ...options,\n  };\n  const canAddObjectKeys = object === 'both' || object === 'object';\n  const canAddKeys = object === 'both' || object === 'key';\n\n  const _prev = prev ? prev + DELIMITER : '';\n  const output: [string, any][] = [];\n\n  const isArray = Array.isArray(arg);\n  if (isArray) {\n    if (canAddObjectKeys && !first) output.push([`${prev}`, arg]);\n\n    arg.forEach((item, index) => {\n      const values = ddecompose(\n        item,\n        `${_prev}${LEFT_BRACKET}${index}${RIGHT_BRACKET}`,\n        options,\n        false,\n      );\n      output.push(...values);\n    });\n    return output;\n  }\n\n  const isPrimit = isPrimitive(arg);\n  if (isPrimit) {\n    const isFirst = !prev.includes(DELIMITER);\n    if (canAddKeys || isFirst) output.push([`${prev}`, arg]);\n    return output;\n  }\n\n  if (canAddObjectKeys && prev !== '') output.push([`${prev}`, arg]);\n\n  const entries1 = Object.entries(arg);\n  entries1.forEach(([key, value]) => {\n    const values = ddecompose(value, `${_prev}${key}`, options, false);\n    output.push(...values);\n  });\n\n  return output;\n}\n\ntype Decompose_F = <\n  T,\n  const O extends DecomposeOptions = typeof DEFAULT_DECOMPOSE_OPTIONS,\n>(\n  val: T,\n  options?: O,\n) => Decompose<T, O>;\ntype _Decompose_F = (val: any, options?: DecomposeOptions) => any;\n\nexport type Decomposer = Decompose_F & {\n  strict: Decompose_F;\n  low: _Decompose_F;\n};\n\nconst _decompose: _Decompose_F = (val, options) => {\n  const entries1 = ddecompose(val, '', options);\n\n  const { sep, start } = {\n    ...DEFAULT_DECOMPOSE_OPTIONS,\n    ...options,\n  };\n  if (entries1.length == 0) {\n    if (Array.isArray(val)) return [];\n    return {};\n  }\n\n  const regexDel = new RegExp(DELIMITER, 'g');\n  const regexLeft = new RegExp(LEFT_BRACKET, 'g');\n  const regexRight = new RegExp(RIGHT_BRACKET, 'g');\n  const entries2 = entries1.map(([__key, value]) => {\n    const _key = __key\n      .replace(regexDel, sep)\n      .replace(regexLeft, `[`)\n      .replace(regexRight, `]`);\n    const key = start ? `${sep}${_key}` : _key;\n    return [key, value];\n  });\n\n  const output = Object.fromEntries(entries2);\n  return output;\n};\n\n/* v8 ignore next 1 */\nexport const decompose: Decomposer = (val, options) =>\n  _decompose(val, options);\ndecompose.low = decompose;\ndecompose.strict = decompose;\n"],"mappings":";;;;;AASA,SAAS,WACP,KACA,OAAO,IACP,UAA4BA,0BAAAA,2BAC5B,QAAQ,MACR;CACA,MAAM,EAAE,WAAW;EACjB,GAAGA,0BAAAA;EACH,GAAG;EACJ;CACD,MAAM,mBAAmB,WAAW,UAAU,WAAW;CACzD,MAAM,aAAa,WAAW,UAAU,WAAW;CAEnD,MAAM,QAAQ,OAAO,OAAOC,0BAAAA,YAAY;CACxC,MAAM,SAA0B,EAAE;AAGlC,KADgB,MAAM,QAAQ,IAAI,EACrB;AACX,MAAI,oBAAoB,CAAC,MAAO,QAAO,KAAK,CAAC,GAAG,QAAQ,IAAI,CAAC;AAE7D,MAAI,SAAS,MAAM,UAAU;GAC3B,MAAM,SAAS,WACb,MACA,GAAG,QAAQC,0BAAAA,eAAe,QAAQC,0BAAAA,iBAClC,SACA,MACD;AACD,UAAO,KAAK,GAAG,OAAO;IACtB;AACF,SAAO;;AAIT,KADiBC,gBAAAA,YAAY,IAAI,EACnB;EACZ,MAAM,UAAU,CAAC,KAAK,SAASH,0BAAAA,UAAU;AACzC,MAAI,cAAc,QAAS,QAAO,KAAK,CAAC,GAAG,QAAQ,IAAI,CAAC;AACxD,SAAO;;AAGT,KAAI,oBAAoB,SAAS,GAAI,QAAO,KAAK,CAAC,GAAG,QAAQ,IAAI,CAAC;AAEjD,QAAO,QAAQ,IAAI,CAC3B,SAAS,CAAC,KAAK,WAAW;EACjC,MAAM,SAAS,WAAW,OAAO,GAAG,QAAQ,OAAO,SAAS,MAAM;AAClE,SAAO,KAAK,GAAG,OAAO;GACtB;AAEF,QAAO;;AAiBT,MAAM,cAA4B,KAAK,YAAY;CACjD,MAAM,WAAW,WAAW,KAAK,IAAI,QAAQ;CAE7C,MAAM,EAAE,KAAK,UAAU;EACrB,GAAGD,0BAAAA;EACH,GAAG;EACJ;AACD,KAAI,SAAS,UAAU,GAAG;AACxB,MAAI,MAAM,QAAQ,IAAI,CAAE,QAAO,EAAE;AACjC,SAAO,EAAE;;CAGX,MAAM,WAAW,IAAI,OAAOC,0BAAAA,WAAW,IAAI;CAC3C,MAAM,YAAY,IAAI,OAAOC,0BAAAA,cAAc,IAAI;CAC/C,MAAM,aAAa,IAAI,OAAOC,0BAAAA,eAAe,IAAI;CACjD,MAAM,WAAW,SAAS,KAAK,CAAC,OAAO,WAAW;EAChD,MAAM,OAAO,MACV,QAAQ,UAAU,IAAI,CACtB,QAAQ,WAAW,IAAI,CACvB,QAAQ,YAAY,IAAI;AAE3B,SAAO,CADK,QAAQ,GAAG,MAAM,SAAS,MACzB,MAAM;GACnB;AAGF,QADe,OAAO,YAAY,SAAS;;;AAK7C,MAAa,aAAyB,KAAK,YACzC,WAAW,KAAK,QAAQ;AAC1B,UAAU,MAAM;AAChB,UAAU,SAAS"}

package/lib/decompose.js

@@ -1,71 +1,60 @@
-import { DEFAULT_DECOMPOSE_OPTIONS } from './constants/objects.js';
-import { LEFT_BRACKET, RIGHT_BRACKET, DELIMITER } from './constants/strings.js';
-import { isPrimitive } from './helpers.js';
-
-function ddecompose(arg, prev = '', options = DEFAULT_DECOMPOSE_OPTIONS, first = true) {
-    const { object } = {
-        ...DEFAULT_DECOMPOSE_OPTIONS,
-        ...options,
-    };
-    const canAddObjectKeys = object === 'both' || object === 'object';
-    const canAddKeys = object === 'both' || object === 'key';
-    const _prev = prev ? prev + DELIMITER : '';
-    const output = [];
-    const isArray = Array.isArray(arg);
-    if (isArray) {
-        if (canAddObjectKeys && !first)
-            output.push([`${prev}`, arg]);
-        arg.forEach((item, index) => {
-            const values = ddecompose(item, `${_prev}${LEFT_BRACKET}${index}${RIGHT_BRACKET}`, options, false);
-            output.push(...values);
-        });
-        return output;
-    }
-    const isPrimit = isPrimitive(arg);
-    if (isPrimit) {
-        const isFirst = !prev.includes(DELIMITER);
-        if (canAddKeys || isFirst)
-            output.push([`${prev}`, arg]);
-        return output;
-    }
-    if (canAddObjectKeys && prev !== '')
-        output.push([`${prev}`, arg]);
-    const entries1 = Object.entries(arg);
-    entries1.forEach(([key, value]) => {
-        const values = ddecompose(value, `${_prev}${key}`, options, false);
-        output.push(...values);
-    });
-    return output;
+import { DELIMITER, LEFT_BRACKET, RIGHT_BRACKET } from "./constants/strings.js";
+import { DEFAULT_DECOMPOSE_OPTIONS } from "./constants/objects.js";
+import { isPrimitive } from "./helpers.js";
+//#region src/decompose.ts
+function ddecompose(arg, prev = "", options = DEFAULT_DECOMPOSE_OPTIONS, first = true) {
+	const { object } = {
+		...DEFAULT_DECOMPOSE_OPTIONS,
+		...options
+	};
+	const canAddObjectKeys = object === "both" || object === "object";
+	const canAddKeys = object === "both" || object === "key";
+	const _prev = prev ? prev + DELIMITER : "";
+	const output = [];
+	if (Array.isArray(arg)) {
+		if (canAddObjectKeys && !first) output.push([`${prev}`, arg]);
+		arg.forEach((item, index) => {
+			const values = ddecompose(item, `${_prev}${LEFT_BRACKET}${index}${RIGHT_BRACKET}`, options, false);
+			output.push(...values);
+		});
+		return output;
+	}
+	if (isPrimitive(arg)) {
+		const isFirst = !prev.includes(DELIMITER);
+		if (canAddKeys || isFirst) output.push([`${prev}`, arg]);
+		return output;
+	}
+	if (canAddObjectKeys && prev !== "") output.push([`${prev}`, arg]);
+	Object.entries(arg).forEach(([key, value]) => {
+		const values = ddecompose(value, `${_prev}${key}`, options, false);
+		output.push(...values);
+	});
+	return output;
 }
 const _decompose = (val, options) => {
-    const entries1 = ddecompose(val, '', options);
-    const { sep, start } = {
-        ...DEFAULT_DECOMPOSE_OPTIONS,
-        ...options,
-    };
-    if (entries1.length == 0) {
-        if (Array.isArray(val))
-            return [];
-        return {};
-    }
-    const regexDel = new RegExp(DELIMITER, 'g');
-    const regexLeft = new RegExp(LEFT_BRACKET, 'g');
-    const regexRight = new RegExp(RIGHT_BRACKET, 'g');
-    const entries2 = entries1.map(([__key, value]) => {
-        const _key = __key
-            .replace(regexDel, sep)
-            .replace(regexLeft, `[`)
-            .replace(regexRight, `]`);
-        const key = start ? `${sep}${_key}` : _key;
-        return [key, value];
-    });
-    const output = Object.fromEntries(entries2);
-    return output;
+	const entries1 = ddecompose(val, "", options);
+	const { sep, start } = {
+		...DEFAULT_DECOMPOSE_OPTIONS,
+		...options
+	};
+	if (entries1.length == 0) {
+		if (Array.isArray(val)) return [];
+		return {};
+	}
+	const regexDel = new RegExp(DELIMITER, "g");
+	const regexLeft = new RegExp(LEFT_BRACKET, "g");
+	const regexRight = new RegExp(RIGHT_BRACKET, "g");
+	const entries2 = entries1.map(([__key, value]) => {
+		const _key = __key.replace(regexDel, sep).replace(regexLeft, `[`).replace(regexRight, `]`);
+		return [start ? `${sep}${_key}` : _key, value];
+	});
+	return Object.fromEntries(entries2);
 };
 /* v8 ignore next 1 */
 const decompose = (val, options) => _decompose(val, options);
 decompose.low = decompose;
 decompose.strict = decompose;
-
+//#endregion
 export { decompose };
-//# sourceMappingURL=decompose.js.map
+
+//# sourceMappingURL=decompose.js.map

package/lib/decompose.js.map

@@ -1 +1 @@
-{"version":3,"file":"decompose.js","sources":["../src/decompose.ts"],"sourcesContent":["import { DEFAULT_DECOMPOSE_OPTIONS } from './constants';\nimport {\n  DELIMITER,\n  LEFT_BRACKET,\n  RIGHT_BRACKET,\n} from './constants/strings';\nimport { isPrimitive } from './helpers';\nimport type { Decompose, DecomposeOptions } from './types.types';\n\nfunction ddecompose(\n  arg: any,\n  prev = '',\n  options: DecomposeOptions = DEFAULT_DECOMPOSE_OPTIONS,\n  first = true,\n) {\n  const { object } = {\n    ...DEFAULT_DECOMPOSE_OPTIONS,\n    ...options,\n  };\n  const canAddObjectKeys = object === 'both' || object === 'object';\n  const canAddKeys = object === 'both' || object === 'key';\n\n  const _prev = prev ? prev + DELIMITER : '';\n  const output: [string, any][] = [];\n\n  const isArray = Array.isArray(arg);\n  if (isArray) {\n    if (canAddObjectKeys && !first) output.push([`${prev}`, arg]);\n\n    arg.forEach((item, index) => {\n      const values = ddecompose(\n        item,\n        `${_prev}${LEFT_BRACKET}${index}${RIGHT_BRACKET}`,\n        options,\n        false,\n      );\n      output.push(...values);\n    });\n    return output;\n  }\n\n  const isPrimit = isPrimitive(arg);\n  if (isPrimit) {\n    const isFirst = !prev.includes(DELIMITER);\n    if (canAddKeys || isFirst) output.push([`${prev}`, arg]);\n    return output;\n  }\n\n  if (canAddObjectKeys && prev !== '') output.push([`${prev}`, arg]);\n\n  const entries1 = Object.entries(arg);\n  entries1.forEach(([key, value]) => {\n    const values = ddecompose(value, `${_prev}${key}`, options, false);\n    output.push(...values);\n  });\n\n  return output;\n}\n\ntype Decompose_F = <\n  T,\n  const O extends DecomposeOptions = typeof DEFAULT_DECOMPOSE_OPTIONS,\n>(\n  val: T,\n  options?: O,\n) => Decompose<T, O>;\ntype _Decompose_F = (val: any, options?: DecomposeOptions) => any;\n\nexport type Decomposer = Decompose_F & {\n  strict: Decompose_F;\n  low: _Decompose_F;\n};\n\nconst _decompose: _Decompose_F = (val, options) => {\n  const entries1 = ddecompose(val, '', options);\n\n  const { sep, start } = {\n    ...DEFAULT_DECOMPOSE_OPTIONS,\n    ...options,\n  };\n  if (entries1.length == 0) {\n    if (Array.isArray(val)) return [];\n    return {};\n  }\n\n  const regexDel = new RegExp(DELIMITER, 'g');\n  const regexLeft = new RegExp(LEFT_BRACKET, 'g');\n  const regexRight = new RegExp(RIGHT_BRACKET, 'g');\n  const entries2 = entries1.map(([__key, value]) => {\n    const _key = __key\n      .replace(regexDel, sep)\n      .replace(regexLeft, `[`)\n      .replace(regexRight, `]`);\n    const key = start ? `${sep}${_key}` : _key;\n    return [key, value];\n  });\n\n  const output = Object.fromEntries(entries2);\n  return output;\n};\n\n/* v8 ignore next 1 */\nexport const decompose: Decomposer = (val, options) =>\n  _decompose(val, options);\ndecompose.low = decompose;\ndecompose.strict = decompose;\n"],"names":[],"mappings":";;;;AASA,SAAS,UAAU,CACjB,GAAQ,EACR,IAAI,GAAG,EAAE,EACT,OAAA,GAA4B,yBAAyB,EACrD,KAAK,GAAG,IAAI,EAAA;IAEZ,MAAM,EAAE,MAAM,EAAE,GAAG;AACjB,QAAA,GAAG,yBAAyB;AAC5B,QAAA,GAAG,OAAO;KACX;IACD,MAAM,gBAAgB,GAAG,MAAM,KAAK,MAAM,IAAI,MAAM,KAAK,QAAQ;IACjE,MAAM,UAAU,GAAG,MAAM,KAAK,MAAM,IAAI,MAAM,KAAK,KAAK;AAExD,IAAA,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,SAAS,GAAG,EAAE;IAC1C,MAAM,MAAM,GAAoB,EAAE;IAElC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;IAClC,IAAI,OAAO,EAAE;QACX,IAAI,gBAAgB,IAAI,CAAC,KAAK;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA,EAAG,IAAI,CAAA,CAAE,EAAE,GAAG,CAAC,CAAC;QAE7D,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,KAAI;YAC1B,MAAM,MAAM,GAAG,UAAU,CACvB,IAAI,EACJ,CAAA,EAAG,KAAK,CAAA,EAAG,YAAY,GAAG,KAAK,CAAA,EAAG,aAAa,CAAA,CAAE,EACjD,OAAO,EACP,KAAK,CACN;AACD,YAAA,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AACxB,QAAA,CAAC,CAAC;AACF,QAAA,OAAO,MAAM;IACf;AAEA,IAAA,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC;IACjC,IAAI,QAAQ,EAAE;QACZ,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;QACzC,IAAI,UAAU,IAAI,OAAO;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA,EAAG,IAAI,CAAA,CAAE,EAAE,GAAG,CAAC,CAAC;AACxD,QAAA,OAAO,MAAM;IACf;AAEA,IAAA,IAAI,gBAAgB,IAAI,IAAI,KAAK,EAAE;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA,EAAG,IAAI,CAAA,CAAE,EAAE,GAAG,CAAC,CAAC;IAElE,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;IACpC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,KAAI;AAChC,QAAA,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,CAAA,EAAG,KAAK,CAAA,EAAG,GAAG,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC;AAClE,QAAA,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AACxB,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,MAAM;AACf;AAgBA,MAAM,UAAU,GAAiB,CAAC,GAAG,EAAE,OAAO,KAAI;IAChD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,EAAE,EAAE,EAAE,OAAO,CAAC;AAE7C,IAAA,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG;AACrB,QAAA,GAAG,yBAAyB;AAC5B,QAAA,GAAG,OAAO;KACX;AACD,IAAA,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE;AACxB,QAAA,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;AAAE,YAAA,OAAO,EAAE;AACjC,QAAA,OAAO,EAAE;IACX;IAEA,MAAM,QAAQ,GAAG,IAAI,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,MAAM,CAAC,YAAY,EAAE,GAAG,CAAC;IAC/C,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,aAAa,EAAE,GAAG,CAAC;AACjD,IAAA,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,KAAI;QAC/C,MAAM,IAAI,GAAG;AACV,aAAA,OAAO,CAAC,QAAQ,EAAE,GAAG;AACrB,aAAA,OAAO,CAAC,SAAS,EAAE,CAAA,CAAA,CAAG;AACtB,aAAA,OAAO,CAAC,UAAU,EAAE,CAAA,CAAA,CAAG,CAAC;AAC3B,QAAA,MAAM,GAAG,GAAG,KAAK,GAAG,CAAA,EAAG,GAAG,CAAA,EAAG,IAAI,CAAA,CAAE,GAAG,IAAI;AAC1C,QAAA,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC;AACrB,IAAA,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC;AAC3C,IAAA,OAAO,MAAM;AACf,CAAC;AAED;AACO,MAAM,SAAS,GAAe,CAAC,GAAG,EAAE,OAAO,KAChD,UAAU,CAAC,GAAG,EAAE,OAAO;AACzB,SAAS,CAAC,GAAG,GAAG,SAAS;AACzB,SAAS,CAAC,MAAM,GAAG,SAAS;;;;"}
+{"version":3,"file":"decompose.js","names":[],"sources":["../src/decompose.ts"],"sourcesContent":["import { DEFAULT_DECOMPOSE_OPTIONS } from './constants';\nimport {\n  DELIMITER,\n  LEFT_BRACKET,\n  RIGHT_BRACKET,\n} from './constants/strings';\nimport { isPrimitive } from './helpers';\nimport type { Decompose, DecomposeOptions } from './types.types';\n\nfunction ddecompose(\n  arg: any,\n  prev = '',\n  options: DecomposeOptions = DEFAULT_DECOMPOSE_OPTIONS,\n  first = true,\n) {\n  const { object } = {\n    ...DEFAULT_DECOMPOSE_OPTIONS,\n    ...options,\n  };\n  const canAddObjectKeys = object === 'both' || object === 'object';\n  const canAddKeys = object === 'both' || object === 'key';\n\n  const _prev = prev ? prev + DELIMITER : '';\n  const output: [string, any][] = [];\n\n  const isArray = Array.isArray(arg);\n  if (isArray) {\n    if (canAddObjectKeys && !first) output.push([`${prev}`, arg]);\n\n    arg.forEach((item, index) => {\n      const values = ddecompose(\n        item,\n        `${_prev}${LEFT_BRACKET}${index}${RIGHT_BRACKET}`,\n        options,\n        false,\n      );\n      output.push(...values);\n    });\n    return output;\n  }\n\n  const isPrimit = isPrimitive(arg);\n  if (isPrimit) {\n    const isFirst = !prev.includes(DELIMITER);\n    if (canAddKeys || isFirst) output.push([`${prev}`, arg]);\n    return output;\n  }\n\n  if (canAddObjectKeys && prev !== '') output.push([`${prev}`, arg]);\n\n  const entries1 = Object.entries(arg);\n  entries1.forEach(([key, value]) => {\n    const values = ddecompose(value, `${_prev}${key}`, options, false);\n    output.push(...values);\n  });\n\n  return output;\n}\n\ntype Decompose_F = <\n  T,\n  const O extends DecomposeOptions = typeof DEFAULT_DECOMPOSE_OPTIONS,\n>(\n  val: T,\n  options?: O,\n) => Decompose<T, O>;\ntype _Decompose_F = (val: any, options?: DecomposeOptions) => any;\n\nexport type Decomposer = Decompose_F & {\n  strict: Decompose_F;\n  low: _Decompose_F;\n};\n\nconst _decompose: _Decompose_F = (val, options) => {\n  const entries1 = ddecompose(val, '', options);\n\n  const { sep, start } = {\n    ...DEFAULT_DECOMPOSE_OPTIONS,\n    ...options,\n  };\n  if (entries1.length == 0) {\n    if (Array.isArray(val)) return [];\n    return {};\n  }\n\n  const regexDel = new RegExp(DELIMITER, 'g');\n  const regexLeft = new RegExp(LEFT_BRACKET, 'g');\n  const regexRight = new RegExp(RIGHT_BRACKET, 'g');\n  const entries2 = entries1.map(([__key, value]) => {\n    const _key = __key\n      .replace(regexDel, sep)\n      .replace(regexLeft, `[`)\n      .replace(regexRight, `]`);\n    const key = start ? `${sep}${_key}` : _key;\n    return [key, value];\n  });\n\n  const output = Object.fromEntries(entries2);\n  return output;\n};\n\n/* v8 ignore next 1 */\nexport const decompose: Decomposer = (val, options) =>\n  _decompose(val, options);\ndecompose.low = decompose;\ndecompose.strict = decompose;\n"],"mappings":";;;;AASA,SAAS,WACP,KACA,OAAO,IACP,UAA4B,2BAC5B,QAAQ,MACR;CACA,MAAM,EAAE,WAAW;EACjB,GAAG;EACH,GAAG;EACJ;CACD,MAAM,mBAAmB,WAAW,UAAU,WAAW;CACzD,MAAM,aAAa,WAAW,UAAU,WAAW;CAEnD,MAAM,QAAQ,OAAO,OAAO,YAAY;CACxC,MAAM,SAA0B,EAAE;AAGlC,KADgB,MAAM,QAAQ,IAAI,EACrB;AACX,MAAI,oBAAoB,CAAC,MAAO,QAAO,KAAK,CAAC,GAAG,QAAQ,IAAI,CAAC;AAE7D,MAAI,SAAS,MAAM,UAAU;GAC3B,MAAM,SAAS,WACb,MACA,GAAG,QAAQ,eAAe,QAAQ,iBAClC,SACA,MACD;AACD,UAAO,KAAK,GAAG,OAAO;IACtB;AACF,SAAO;;AAIT,KADiB,YAAY,IAAI,EACnB;EACZ,MAAM,UAAU,CAAC,KAAK,SAAS,UAAU;AACzC,MAAI,cAAc,QAAS,QAAO,KAAK,CAAC,GAAG,QAAQ,IAAI,CAAC;AACxD,SAAO;;AAGT,KAAI,oBAAoB,SAAS,GAAI,QAAO,KAAK,CAAC,GAAG,QAAQ,IAAI,CAAC;AAEjD,QAAO,QAAQ,IAAI,CAC3B,SAAS,CAAC,KAAK,WAAW;EACjC,MAAM,SAAS,WAAW,OAAO,GAAG,QAAQ,OAAO,SAAS,MAAM;AAClE,SAAO,KAAK,GAAG,OAAO;GACtB;AAEF,QAAO;;AAiBT,MAAM,cAA4B,KAAK,YAAY;CACjD,MAAM,WAAW,WAAW,KAAK,IAAI,QAAQ;CAE7C,MAAM,EAAE,KAAK,UAAU;EACrB,GAAG;EACH,GAAG;EACJ;AACD,KAAI,SAAS,UAAU,GAAG;AACxB,MAAI,MAAM,QAAQ,IAAI,CAAE,QAAO,EAAE;AACjC,SAAO,EAAE;;CAGX,MAAM,WAAW,IAAI,OAAO,WAAW,IAAI;CAC3C,MAAM,YAAY,IAAI,OAAO,cAAc,IAAI;CAC/C,MAAM,aAAa,IAAI,OAAO,eAAe,IAAI;CACjD,MAAM,WAAW,SAAS,KAAK,CAAC,OAAO,WAAW;EAChD,MAAM,OAAO,MACV,QAAQ,UAAU,IAAI,CACtB,QAAQ,WAAW,IAAI,CACvB,QAAQ,YAAY,IAAI;AAE3B,SAAO,CADK,QAAQ,GAAG,MAAM,SAAS,MACzB,MAAM;GACnB;AAGF,QADe,OAAO,YAAY,SAAS;;;AAK7C,MAAa,aAAyB,KAAK,YACzC,WAAW,KAAK,QAAQ;AAC1B,UAAU,MAAM;AAChB,UAAU,SAAS"}

package/lib/decomposeKeys.cjs

@@ -1,39 +1,33 @@
-'use strict';
-
-var types = require('@bemedev/types');
-var constants_strings = require('./constants/strings.cjs');
-var helpers = require('./helpers.cjs');
-var sortMap = require('./sortMap.cjs');
-
-function ddecomposeKeys(val, prev = '', addObjectKeys = true) {
-    const _prev = prev ? prev + constants_strings.DELIMITER : '';
-    const output = [];
-    const entries1 = Object.entries(val);
-    entries1.forEach(([key, value]) => {
-        const isPrimit = helpers.isPrimitive(value);
-        if (!isPrimit) {
-            if (addObjectKeys)
-                output.push(`${_prev}${key}`);
-            const values = ddecomposeKeys(value, `${_prev}${key}`, addObjectKeys);
-            output.push(...values);
-        }
-        else
-            output.push(`${_prev}${key}`);
-    });
-    return output;
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_sortMap = require("./sortMap.cjs");
+const require_constants_strings = require("./constants/strings.cjs");
+const require_helpers = require("./helpers.cjs");
+let _bemedev_types = require("@bemedev/types");
+//#region src/decomposeKeys.ts
+function ddecomposeKeys(val, prev = "", addObjectKeys = true) {
+	const _prev = prev ? prev + require_constants_strings.DELIMITER : "";
+	const output = [];
+	Object.entries(val).forEach(([key, value]) => {
+		if (!require_helpers.isPrimitive(value)) {
+			if (addObjectKeys) output.push(`${_prev}${key}`);
+			const values = ddecomposeKeys(value, `${_prev}${key}`, addObjectKeys);
+			output.push(...values);
+		} else output.push(`${_prev}${key}`);
+	});
+	return output;
 }
-const _decomposeKeys = (val, sorter = sortMap.sortMap, addObjectKeys = true) => {
-    const output1 = ddecomposeKeys(val, '', addObjectKeys);
-    output1.sort(sorter);
-    const regex = new RegExp(constants_strings.DELIMITER, 'g');
-    return output1.map(value => value.replace(regex, '.'));
+const _decomposeKeys = (val, sorter = require_sortMap.sortMap, addObjectKeys = true) => {
+	const output1 = ddecomposeKeys(val, "", addObjectKeys);
+	output1.sort(sorter);
+	const regex = new RegExp(require_constants_strings.DELIMITER, "g");
+	return output1.map((value) => value.replace(regex, "."));
 };
 const decomposeKeys = (val, sorter, addObjectKeys) => {
-    return types.castings.commons.any(_decomposeKeys(val, sorter, addObjectKeys));
+	return _bemedev_types.castings.commons.any(_decomposeKeys(val, sorter, addObjectKeys));
 };
 decomposeKeys.low = _decomposeKeys;
-decomposeKeys.strict =
-    types.castings.commons.unknown(_decomposeKeys);
-
+decomposeKeys.strict = _bemedev_types.castings.commons.unknown(_decomposeKeys);
+//#endregion
 exports.decomposeKeys = decomposeKeys;
-//# sourceMappingURL=decomposeKeys.cjs.map
+
+//# sourceMappingURL=decomposeKeys.cjs.map

package/lib/decomposeKeys.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"decomposeKeys.cjs","sources":["../src/decomposeKeys.ts"],"sourcesContent":["import { castings } from '@bemedev/types';\nimport { DELIMITER } from './constants/strings';\nimport { isPrimitive } from './helpers';\nimport { sortMap } from './sortMap';\nimport type { KeysMatching, Ru } from './types.types';\n\nfunction ddecomposeKeys(val: any, prev = '', addObjectKeys = true) {\n  const _prev = prev ? prev + DELIMITER : '';\n  const output: string[] = [];\n  const entries1 = Object.entries(val);\n  entries1.forEach(([key, value]) => {\n    const isPrimit = isPrimitive(value);\n    if (!isPrimit) {\n      if (addObjectKeys) output.push(`${_prev}${key}`);\n      const values = ddecomposeKeys(\n        value,\n        `${_prev}${key}`,\n        addObjectKeys,\n      );\n      output.push(...values);\n    } else output.push(`${_prev}${key}`);\n  });\n  return output;\n}\n\ntype DecomposeKeys_F = <\n  T extends Ru,\n  AddObjectKeys extends boolean = true,\n>(\n  val: T,\n  sorter?: typeof sortMap,\n  addObjectKeys?: AddObjectKeys,\n) => KeysMatching<T, AddObjectKeys>[];\n\ntype _DecomposeKeys_F = (\n  val: any,\n  sorter?: typeof sortMap,\n  addObjectKeys?: boolean,\n) => string[];\n\nexport type DecomposeKeys = DecomposeKeys_F & {\n  strict: DecomposeKeys_F;\n  low: _DecomposeKeys_F;\n};\n\nconst _decomposeKeys: _DecomposeKeys_F = (\n  val,\n  sorter = sortMap,\n  addObjectKeys = true,\n) => {\n  const output1 = ddecomposeKeys(val, '', addObjectKeys);\n  output1.sort(sorter);\n  const regex = new RegExp(DELIMITER, 'g');\n  return output1.map(value => value.replace(regex, '.'));\n};\n\nexport const decomposeKeys: DecomposeKeys = (\n  val,\n  sorter,\n  addObjectKeys,\n) => {\n  return castings.commons.any(_decomposeKeys(val, sorter, addObjectKeys));\n};\ndecomposeKeys.low = _decomposeKeys;\ndecomposeKeys.strict =\n  castings.commons.unknown<DecomposeKeys_F>(_decomposeKeys);\n"],"names":["DELIMITER","isPrimitive","sortMap","castings"],"mappings":";;;;;;;AAMA,SAAS,cAAc,CAAC,GAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,aAAa,GAAG,IAAI,EAAA;AAC/D,IAAA,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAGA,2BAAS,GAAG,EAAE;IAC1C,MAAM,MAAM,GAAa,EAAE;IAC3B,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;IACpC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,KAAI;AAChC,QAAA,MAAM,QAAQ,GAAGC,mBAAW,CAAC,KAAK,CAAC;QACnC,IAAI,CAAC,QAAQ,EAAE;AACb,YAAA,IAAI,aAAa;gBAAE,MAAM,CAAC,IAAI,CAAC,CAAA,EAAG,KAAK,CAAA,EAAG,GAAG,CAAA,CAAE,CAAC;AAChD,YAAA,MAAM,MAAM,GAAG,cAAc,CAC3B,KAAK,EACL,CAAA,EAAG,KAAK,CAAA,EAAG,GAAG,CAAA,CAAE,EAChB,aAAa,CACd;AACD,YAAA,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;QACxB;;YAAO,MAAM,CAAC,IAAI,CAAC,CAAA,EAAG,KAAK,CAAA,EAAG,GAAG,CAAA,CAAE,CAAC;AACtC,IAAA,CAAC,CAAC;AACF,IAAA,OAAO,MAAM;AACf;AAsBA,MAAM,cAAc,GAAqB,CACvC,GAAG,EACH,MAAM,GAAGC,eAAO,EAChB,aAAa,GAAG,IAAI,KAClB;IACF,MAAM,OAAO,GAAG,cAAc,CAAC,GAAG,EAAE,EAAE,EAAE,aAAa,CAAC;AACtD,IAAA,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;IACpB,MAAM,KAAK,GAAG,IAAI,MAAM,CAACF,2BAAS,EAAE,GAAG,CAAC;AACxC,IAAA,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AACxD,CAAC;AAEM,MAAM,aAAa,GAAkB,CAC1C,GAAG,EACH,MAAM,EACN,aAAa,KACX;AACF,IAAA,OAAOG,cAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;AACzE;AACA,aAAa,CAAC,GAAG,GAAG,cAAc;AAClC,aAAa,CAAC,MAAM;AAClB,IAAAA,cAAQ,CAAC,OAAO,CAAC,OAAO,CAAkB,cAAc,CAAC;;;;"}
+{"version":3,"file":"decomposeKeys.cjs","names":["DELIMITER","isPrimitive","sortMap","castings"],"sources":["../src/decomposeKeys.ts"],"sourcesContent":["import { castings } from '@bemedev/types';\nimport { DELIMITER } from './constants/strings';\nimport { isPrimitive } from './helpers';\nimport { sortMap } from './sortMap';\nimport type { KeysMatching, Ru } from './types.types';\n\nfunction ddecomposeKeys(val: any, prev = '', addObjectKeys = true) {\n  const _prev = prev ? prev + DELIMITER : '';\n  const output: string[] = [];\n  const entries1 = Object.entries(val);\n  entries1.forEach(([key, value]) => {\n    const isPrimit = isPrimitive(value);\n    if (!isPrimit) {\n      if (addObjectKeys) output.push(`${_prev}${key}`);\n      const values = ddecomposeKeys(\n        value,\n        `${_prev}${key}`,\n        addObjectKeys,\n      );\n      output.push(...values);\n    } else output.push(`${_prev}${key}`);\n  });\n  return output;\n}\n\ntype DecomposeKeys_F = <\n  T extends Ru,\n  AddObjectKeys extends boolean = true,\n>(\n  val: T,\n  sorter?: typeof sortMap,\n  addObjectKeys?: AddObjectKeys,\n) => KeysMatching<T, AddObjectKeys>[];\n\ntype _DecomposeKeys_F = (\n  val: any,\n  sorter?: typeof sortMap,\n  addObjectKeys?: boolean,\n) => string[];\n\nexport type DecomposeKeys = DecomposeKeys_F & {\n  strict: DecomposeKeys_F;\n  low: _DecomposeKeys_F;\n};\n\nconst _decomposeKeys: _DecomposeKeys_F = (\n  val,\n  sorter = sortMap,\n  addObjectKeys = true,\n) => {\n  const output1 = ddecomposeKeys(val, '', addObjectKeys);\n  output1.sort(sorter);\n  const regex = new RegExp(DELIMITER, 'g');\n  return output1.map(value => value.replace(regex, '.'));\n};\n\nexport const decomposeKeys: DecomposeKeys = (\n  val,\n  sorter,\n  addObjectKeys,\n) => {\n  return castings.commons.any(_decomposeKeys(val, sorter, addObjectKeys));\n};\ndecomposeKeys.low = _decomposeKeys;\ndecomposeKeys.strict =\n  castings.commons.unknown<DecomposeKeys_F>(_decomposeKeys);\n"],"mappings":";;;;;;AAMA,SAAS,eAAe,KAAU,OAAO,IAAI,gBAAgB,MAAM;CACjE,MAAM,QAAQ,OAAO,OAAOA,0BAAAA,YAAY;CACxC,MAAM,SAAmB,EAAE;AACV,QAAO,QAAQ,IAAI,CAC3B,SAAS,CAAC,KAAK,WAAW;AAEjC,MAAI,CADaC,gBAAAA,YAAY,MAAM,EACpB;AACb,OAAI,cAAe,QAAO,KAAK,GAAG,QAAQ,MAAM;GAChD,MAAM,SAAS,eACb,OACA,GAAG,QAAQ,OACX,cACD;AACD,UAAO,KAAK,GAAG,OAAO;QACjB,QAAO,KAAK,GAAG,QAAQ,MAAM;GACpC;AACF,QAAO;;AAuBT,MAAM,kBACJ,KACA,SAASC,gBAAAA,SACT,gBAAgB,SACb;CACH,MAAM,UAAU,eAAe,KAAK,IAAI,cAAc;AACtD,SAAQ,KAAK,OAAO;CACpB,MAAM,QAAQ,IAAI,OAAOF,0BAAAA,WAAW,IAAI;AACxC,QAAO,QAAQ,KAAI,UAAS,MAAM,QAAQ,OAAO,IAAI,CAAC;;AAGxD,MAAa,iBACX,KACA,QACA,kBACG;AACH,QAAOG,eAAAA,SAAS,QAAQ,IAAI,eAAe,KAAK,QAAQ,cAAc,CAAC;;AAEzE,cAAc,MAAM;AACpB,cAAc,SACZA,eAAAA,SAAS,QAAQ,QAAyB,eAAe"}

package/lib/decomposeKeys.js

@@ -1,37 +1,32 @@
-import { castings } from '@bemedev/types';
-import { DELIMITER } from './constants/strings.js';
-import { isPrimitive } from './helpers.js';
-import { sortMap } from './sortMap.js';
-
-function ddecomposeKeys(val, prev = '', addObjectKeys = true) {
-    const _prev = prev ? prev + DELIMITER : '';
-    const output = [];
-    const entries1 = Object.entries(val);
-    entries1.forEach(([key, value]) => {
-        const isPrimit = isPrimitive(value);
-        if (!isPrimit) {
-            if (addObjectKeys)
-                output.push(`${_prev}${key}`);
-            const values = ddecomposeKeys(value, `${_prev}${key}`, addObjectKeys);
-            output.push(...values);
-        }
-        else
-            output.push(`${_prev}${key}`);
-    });
-    return output;
+import { sortMap } from "./sortMap.js";
+import { DELIMITER } from "./constants/strings.js";
+import { isPrimitive } from "./helpers.js";
+import { castings } from "@bemedev/types";
+//#region src/decomposeKeys.ts
+function ddecomposeKeys(val, prev = "", addObjectKeys = true) {
+	const _prev = prev ? prev + DELIMITER : "";
+	const output = [];
+	Object.entries(val).forEach(([key, value]) => {
+		if (!isPrimitive(value)) {
+			if (addObjectKeys) output.push(`${_prev}${key}`);
+			const values = ddecomposeKeys(value, `${_prev}${key}`, addObjectKeys);
+			output.push(...values);
+		} else output.push(`${_prev}${key}`);
+	});
+	return output;
 }
 const _decomposeKeys = (val, sorter = sortMap, addObjectKeys = true) => {
-    const output1 = ddecomposeKeys(val, '', addObjectKeys);
-    output1.sort(sorter);
-    const regex = new RegExp(DELIMITER, 'g');
-    return output1.map(value => value.replace(regex, '.'));
+	const output1 = ddecomposeKeys(val, "", addObjectKeys);
+	output1.sort(sorter);
+	const regex = new RegExp(DELIMITER, "g");
+	return output1.map((value) => value.replace(regex, "."));
 };
 const decomposeKeys = (val, sorter, addObjectKeys) => {
-    return castings.commons.any(_decomposeKeys(val, sorter, addObjectKeys));
+	return castings.commons.any(_decomposeKeys(val, sorter, addObjectKeys));
 };
 decomposeKeys.low = _decomposeKeys;
-decomposeKeys.strict =
-    castings.commons.unknown(_decomposeKeys);
-
+decomposeKeys.strict = castings.commons.unknown(_decomposeKeys);
+//#endregion
 export { decomposeKeys };
-//# sourceMappingURL=decomposeKeys.js.map
+
+//# sourceMappingURL=decomposeKeys.js.map

package/lib/decomposeKeys.js.map

@@ -1 +1 @@
-{"version":3,"file":"decomposeKeys.js","sources":["../src/decomposeKeys.ts"],"sourcesContent":["import { castings } from '@bemedev/types';\nimport { DELIMITER } from './constants/strings';\nimport { isPrimitive } from './helpers';\nimport { sortMap } from './sortMap';\nimport type { KeysMatching, Ru } from './types.types';\n\nfunction ddecomposeKeys(val: any, prev = '', addObjectKeys = true) {\n  const _prev = prev ? prev + DELIMITER : '';\n  const output: string[] = [];\n  const entries1 = Object.entries(val);\n  entries1.forEach(([key, value]) => {\n    const isPrimit = isPrimitive(value);\n    if (!isPrimit) {\n      if (addObjectKeys) output.push(`${_prev}${key}`);\n      const values = ddecomposeKeys(\n        value,\n        `${_prev}${key}`,\n        addObjectKeys,\n      );\n      output.push(...values);\n    } else output.push(`${_prev}${key}`);\n  });\n  return output;\n}\n\ntype DecomposeKeys_F = <\n  T extends Ru,\n  AddObjectKeys extends boolean = true,\n>(\n  val: T,\n  sorter?: typeof sortMap,\n  addObjectKeys?: AddObjectKeys,\n) => KeysMatching<T, AddObjectKeys>[];\n\ntype _DecomposeKeys_F = (\n  val: any,\n  sorter?: typeof sortMap,\n  addObjectKeys?: boolean,\n) => string[];\n\nexport type DecomposeKeys = DecomposeKeys_F & {\n  strict: DecomposeKeys_F;\n  low: _DecomposeKeys_F;\n};\n\nconst _decomposeKeys: _DecomposeKeys_F = (\n  val,\n  sorter = sortMap,\n  addObjectKeys = true,\n) => {\n  const output1 = ddecomposeKeys(val, '', addObjectKeys);\n  output1.sort(sorter);\n  const regex = new RegExp(DELIMITER, 'g');\n  return output1.map(value => value.replace(regex, '.'));\n};\n\nexport const decomposeKeys: DecomposeKeys = (\n  val,\n  sorter,\n  addObjectKeys,\n) => {\n  return castings.commons.any(_decomposeKeys(val, sorter, addObjectKeys));\n};\ndecomposeKeys.low = _decomposeKeys;\ndecomposeKeys.strict =\n  castings.commons.unknown<DecomposeKeys_F>(_decomposeKeys);\n"],"names":[],"mappings":";;;;;AAMA,SAAS,cAAc,CAAC,GAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,aAAa,GAAG,IAAI,EAAA;AAC/D,IAAA,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,SAAS,GAAG,EAAE;IAC1C,MAAM,MAAM,GAAa,EAAE;IAC3B,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;IACpC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,KAAI;AAChC,QAAA,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC;QACnC,IAAI,CAAC,QAAQ,EAAE;AACb,YAAA,IAAI,aAAa;gBAAE,MAAM,CAAC,IAAI,CAAC,CAAA,EAAG,KAAK,CAAA,EAAG,GAAG,CAAA,CAAE,CAAC;AAChD,YAAA,MAAM,MAAM,GAAG,cAAc,CAC3B,KAAK,EACL,CAAA,EAAG,KAAK,CAAA,EAAG,GAAG,CAAA,CAAE,EAChB,aAAa,CACd;AACD,YAAA,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;QACxB;;YAAO,MAAM,CAAC,IAAI,CAAC,CAAA,EAAG,KAAK,CAAA,EAAG,GAAG,CAAA,CAAE,CAAC;AACtC,IAAA,CAAC,CAAC;AACF,IAAA,OAAO,MAAM;AACf;AAsBA,MAAM,cAAc,GAAqB,CACvC,GAAG,EACH,MAAM,GAAG,OAAO,EAChB,aAAa,GAAG,IAAI,KAClB;IACF,MAAM,OAAO,GAAG,cAAc,CAAC,GAAG,EAAE,EAAE,EAAE,aAAa,CAAC;AACtD,IAAA,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;IACpB,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC;AACxC,IAAA,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AACxD,CAAC;AAEM,MAAM,aAAa,GAAkB,CAC1C,GAAG,EACH,MAAM,EACN,aAAa,KACX;AACF,IAAA,OAAO,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;AACzE;AACA,aAAa,CAAC,GAAG,GAAG,cAAc;AAClC,aAAa,CAAC,MAAM;AAClB,IAAA,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAkB,cAAc,CAAC;;;;"}
+{"version":3,"file":"decomposeKeys.js","names":[],"sources":["../src/decomposeKeys.ts"],"sourcesContent":["import { castings } from '@bemedev/types';\nimport { DELIMITER } from './constants/strings';\nimport { isPrimitive } from './helpers';\nimport { sortMap } from './sortMap';\nimport type { KeysMatching, Ru } from './types.types';\n\nfunction ddecomposeKeys(val: any, prev = '', addObjectKeys = true) {\n  const _prev = prev ? prev + DELIMITER : '';\n  const output: string[] = [];\n  const entries1 = Object.entries(val);\n  entries1.forEach(([key, value]) => {\n    const isPrimit = isPrimitive(value);\n    if (!isPrimit) {\n      if (addObjectKeys) output.push(`${_prev}${key}`);\n      const values = ddecomposeKeys(\n        value,\n        `${_prev}${key}`,\n        addObjectKeys,\n      );\n      output.push(...values);\n    } else output.push(`${_prev}${key}`);\n  });\n  return output;\n}\n\ntype DecomposeKeys_F = <\n  T extends Ru,\n  AddObjectKeys extends boolean = true,\n>(\n  val: T,\n  sorter?: typeof sortMap,\n  addObjectKeys?: AddObjectKeys,\n) => KeysMatching<T, AddObjectKeys>[];\n\ntype _DecomposeKeys_F = (\n  val: any,\n  sorter?: typeof sortMap,\n  addObjectKeys?: boolean,\n) => string[];\n\nexport type DecomposeKeys = DecomposeKeys_F & {\n  strict: DecomposeKeys_F;\n  low: _DecomposeKeys_F;\n};\n\nconst _decomposeKeys: _DecomposeKeys_F = (\n  val,\n  sorter = sortMap,\n  addObjectKeys = true,\n) => {\n  const output1 = ddecomposeKeys(val, '', addObjectKeys);\n  output1.sort(sorter);\n  const regex = new RegExp(DELIMITER, 'g');\n  return output1.map(value => value.replace(regex, '.'));\n};\n\nexport const decomposeKeys: DecomposeKeys = (\n  val,\n  sorter,\n  addObjectKeys,\n) => {\n  return castings.commons.any(_decomposeKeys(val, sorter, addObjectKeys));\n};\ndecomposeKeys.low = _decomposeKeys;\ndecomposeKeys.strict =\n  castings.commons.unknown<DecomposeKeys_F>(_decomposeKeys);\n"],"mappings":";;;;;AAMA,SAAS,eAAe,KAAU,OAAO,IAAI,gBAAgB,MAAM;CACjE,MAAM,QAAQ,OAAO,OAAO,YAAY;CACxC,MAAM,SAAmB,EAAE;AACV,QAAO,QAAQ,IAAI,CAC3B,SAAS,CAAC,KAAK,WAAW;AAEjC,MAAI,CADa,YAAY,MAAM,EACpB;AACb,OAAI,cAAe,QAAO,KAAK,GAAG,QAAQ,MAAM;GAChD,MAAM,SAAS,eACb,OACA,GAAG,QAAQ,OACX,cACD;AACD,UAAO,KAAK,GAAG,OAAO;QACjB,QAAO,KAAK,GAAG,QAAQ,MAAM;GACpC;AACF,QAAO;;AAuBT,MAAM,kBACJ,KACA,SAAS,SACT,gBAAgB,SACb;CACH,MAAM,UAAU,eAAe,KAAK,IAAI,cAAc;AACtD,SAAQ,KAAK,OAAO;CACpB,MAAM,QAAQ,IAAI,OAAO,WAAW,IAAI;AACxC,QAAO,QAAQ,KAAI,UAAS,MAAM,QAAQ,OAAO,IAAI,CAAC;;AAGxD,MAAa,iBACX,KACA,QACA,kBACG;AACH,QAAO,SAAS,QAAQ,IAAI,eAAe,KAAK,QAAQ,cAAc,CAAC;;AAEzE,cAAc,MAAM;AACpB,cAAc,SACZ,SAAS,QAAQ,QAAyB,eAAe"}

package/lib/decomposeSV.cjs

@@ -1,35 +1,32 @@
-'use strict';
-
-var types = require('@bemedev/types');
-var constants_strings = require('./constants/strings.cjs');
-var sortMap = require('./sortMap.cjs');
-
-function ddecompose(val, prev = '') {
-    const output = [];
-    const _prev = prev ? prev + constants_strings.DELIMITER : '';
-    if (prev !== '')
-        output.push(prev);
-    if (typeof val === 'string') {
-        output.push(`${_prev}${val}`);
-    }
-    else {
-        const keys = Object.keys(val);
-        output.push(...keys.map(key => ddecompose(val[key], `${_prev}${key}`)).flat());
-    }
-    return output;
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_sortMap = require("./sortMap.cjs");
+const require_constants_strings = require("./constants/strings.cjs");
+let _bemedev_types = require("@bemedev/types");
+//#region src/decomposeSV.ts
+function ddecompose(val, prev = "") {
+	const output = [];
+	const _prev = prev ? prev + require_constants_strings.DELIMITER : "";
+	if (prev !== "") output.push(prev);
+	if (typeof val === "string") output.push(`${_prev}${val}`);
+	else {
+		const keys = Object.keys(val);
+		output.push(...keys.map((key) => ddecompose(val[key], `${_prev}${key}`)).flat());
+	}
+	return output;
 }
-const _decomposeSV = (val, sorter = sortMap.sortMap) => {
-    const output1 = ddecompose(val, '');
-    output1.sort(sorter);
-    const regex = new RegExp(constants_strings.DELIMITER, 'g');
-    return output1.map(value => value.replace(regex, '.'));
+const _decomposeSV = (val, sorter = require_sortMap.sortMap) => {
+	const output1 = ddecompose(val, "");
+	output1.sort(sorter);
+	const regex = new RegExp(require_constants_strings.DELIMITER, "g");
+	return output1.map((value) => value.replace(regex, "."));
 };
 /* v8 ignore next 3 */
 const decomposeSV = (val, sorter) => {
-    return types.castings.commons.any(_decomposeSV(val, sorter));
+	return _bemedev_types.castings.commons.any(_decomposeSV(val, sorter));
 };
 decomposeSV.low = _decomposeSV;
-decomposeSV.strict = types.castings.commons.unknown(_decomposeSV);
-
+decomposeSV.strict = _bemedev_types.castings.commons.unknown(_decomposeSV);
+//#endregion
 exports.decomposeSV = decomposeSV;
-//# sourceMappingURL=decomposeSV.cjs.map
+
+//# sourceMappingURL=decomposeSV.cjs.map

package/lib/decomposeSV.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"decomposeSV.cjs","sources":["../src/decomposeSV.ts"],"sourcesContent":["import { castings } from '@bemedev/types';\nimport { DELIMITER } from './constants/strings';\nimport { sortMap } from './sortMap';\nimport type { StateMatching, StateValue } from './types.types';\n\nfunction ddecompose(val: StateValue, prev = '') {\n  const output: string[] = [];\n\n  const _prev = prev ? prev + DELIMITER : '';\n  if (prev !== '') output.push(prev);\n\n  if (typeof val === 'string') {\n    output.push(`${_prev}${val}`);\n  } else {\n    const keys = Object.keys(val);\n    output.push(\n      ...keys.map(key => ddecompose(val[key], `${_prev}${key}`)).flat(),\n    );\n  }\n\n  return output;\n}\n\ntype DecomposeSV_F = <T extends StateValue>(\n  val: T,\n  sorter?: typeof sortMap,\n) => StateMatching<T>[];\n\ntype _DecomposeSV_F = (val: any, sorter?: typeof sortMap) => string[];\n\nexport type DecomposeSV = DecomposeSV_F & {\n  strict: DecomposeSV_F;\n  low: _DecomposeSV_F;\n};\n\nconst _decomposeSV: _DecomposeSV_F = (val, sorter = sortMap) => {\n  const output1 = ddecompose(val, '');\n  output1.sort(sorter);\n  const regex = new RegExp(DELIMITER, 'g');\n  return output1.map(value => value.replace(regex, '.'));\n};\n\n/* v8 ignore next 3 */\nexport const decomposeSV: DecomposeSV = (val, sorter) => {\n  return castings.commons.any(_decomposeSV(val, sorter));\n};\ndecomposeSV.low = _decomposeSV;\ndecomposeSV.strict = castings.commons.unknown<DecomposeSV_F>(_decomposeSV);\n"],"names":["DELIMITER","sortMap","castings"],"mappings":";;;;;;AAKA,SAAS,UAAU,CAAC,GAAe,EAAE,IAAI,GAAG,EAAE,EAAA;IAC5C,MAAM,MAAM,GAAa,EAAE;AAE3B,IAAA,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAGA,2BAAS,GAAG,EAAE;IAC1C,IAAI,IAAI,KAAK,EAAE;AAAE,QAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;AAElC,IAAA,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;QAC3B,MAAM,CAAC,IAAI,CAAC,CAAA,EAAG,KAAK,CAAA,EAAG,GAAG,CAAA,CAAE,CAAC;IAC/B;SAAO;QACL,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;AAC7B,QAAA,MAAM,CAAC,IAAI,CACT,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA,EAAG,KAAK,CAAA,EAAG,GAAG,CAAA,CAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAClE;IACH;AAEA,IAAA,OAAO,MAAM;AACf;AAcA,MAAM,YAAY,GAAmB,CAAC,GAAG,EAAE,MAAM,GAAGC,eAAO,KAAI;IAC7D,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,EAAE,EAAE,CAAC;AACnC,IAAA,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;IACpB,MAAM,KAAK,GAAG,IAAI,MAAM,CAACD,2BAAS,EAAE,GAAG,CAAC;AACxC,IAAA,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AACxD,CAAC;AAED;MACa,WAAW,GAAgB,CAAC,GAAG,EAAE,MAAM,KAAI;AACtD,IAAA,OAAOE,cAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;AACxD;AACA,WAAW,CAAC,GAAG,GAAG,YAAY;AAC9B,WAAW,CAAC,MAAM,GAAGA,cAAQ,CAAC,OAAO,CAAC,OAAO,CAAgB,YAAY,CAAC;;;;"}
+{"version":3,"file":"decomposeSV.cjs","names":["DELIMITER","sortMap","castings"],"sources":["../src/decomposeSV.ts"],"sourcesContent":["import { castings } from '@bemedev/types';\nimport { DELIMITER } from './constants/strings';\nimport { sortMap } from './sortMap';\nimport type { StateMatching, StateValue } from './types.types';\n\nfunction ddecompose(val: StateValue, prev = '') {\n  const output: string[] = [];\n\n  const _prev = prev ? prev + DELIMITER : '';\n  if (prev !== '') output.push(prev);\n\n  if (typeof val === 'string') {\n    output.push(`${_prev}${val}`);\n  } else {\n    const keys = Object.keys(val);\n    output.push(\n      ...keys.map(key => ddecompose(val[key], `${_prev}${key}`)).flat(),\n    );\n  }\n\n  return output;\n}\n\ntype DecomposeSV_F = <T extends StateValue>(\n  val: T,\n  sorter?: typeof sortMap,\n) => StateMatching<T>[];\n\ntype _DecomposeSV_F = (val: any, sorter?: typeof sortMap) => string[];\n\nexport type DecomposeSV = DecomposeSV_F & {\n  strict: DecomposeSV_F;\n  low: _DecomposeSV_F;\n};\n\nconst _decomposeSV: _DecomposeSV_F = (val, sorter = sortMap) => {\n  const output1 = ddecompose(val, '');\n  output1.sort(sorter);\n  const regex = new RegExp(DELIMITER, 'g');\n  return output1.map(value => value.replace(regex, '.'));\n};\n\n/* v8 ignore next 3 */\nexport const decomposeSV: DecomposeSV = (val, sorter) => {\n  return castings.commons.any(_decomposeSV(val, sorter));\n};\ndecomposeSV.low = _decomposeSV;\ndecomposeSV.strict = castings.commons.unknown<DecomposeSV_F>(_decomposeSV);\n"],"mappings":";;;;;AAKA,SAAS,WAAW,KAAiB,OAAO,IAAI;CAC9C,MAAM,SAAmB,EAAE;CAE3B,MAAM,QAAQ,OAAO,OAAOA,0BAAAA,YAAY;AACxC,KAAI,SAAS,GAAI,QAAO,KAAK,KAAK;AAElC,KAAI,OAAO,QAAQ,SACjB,QAAO,KAAK,GAAG,QAAQ,MAAM;MACxB;EACL,MAAM,OAAO,OAAO,KAAK,IAAI;AAC7B,SAAO,KACL,GAAG,KAAK,KAAI,QAAO,WAAW,IAAI,MAAM,GAAG,QAAQ,MAAM,CAAC,CAAC,MAAM,CAClE;;AAGH,QAAO;;AAeT,MAAM,gBAAgC,KAAK,SAASC,gBAAAA,YAAY;CAC9D,MAAM,UAAU,WAAW,KAAK,GAAG;AACnC,SAAQ,KAAK,OAAO;CACpB,MAAM,QAAQ,IAAI,OAAOD,0BAAAA,WAAW,IAAI;AACxC,QAAO,QAAQ,KAAI,UAAS,MAAM,QAAQ,OAAO,IAAI,CAAC;;;AAIxD,MAAa,eAA4B,KAAK,WAAW;AACvD,QAAOE,eAAAA,SAAS,QAAQ,IAAI,aAAa,KAAK,OAAO,CAAC;;AAExD,YAAY,MAAM;AAClB,YAAY,SAASA,eAAAA,SAAS,QAAQ,QAAuB,aAAa"}