@rsconcept/domain 1.0.0 → 1.1.0

package/dist/value-B8UtCqaK.js

@@ -0,0 +1,366 @@
+import { generateStub } from "./shared/hash.js";
+import "./shared/index.js";
+import { TypeID } from "./rslang/semantic/typification.js";
+//#region src/rslang/eval/value-api.ts
+/** Cartesian product of factor sets. */
+function cartesianProduct(factors) {
+	const cardinality = factors.reduce((acc, f) => acc * f.length, 1);
+	if (cardinality > 1e7) return null;
+	if (cardinality === 0 || factors.length === 0) return EmptySetV;
+	let accumulator = [[]];
+	for (const factor of factors) {
+		const next = [];
+		for (const prefix of accumulator) for (const value of factor) next.push([...prefix, value]);
+		accumulator = next;
+	}
+	return accumulator.map(tuple);
+}
+/** Boolean power set ℬ(X). No cache - materialized. */
+function boolean(base) {
+	if (base.length > 18) return null;
+	return powerset(base);
+}
+/** Powerset of array. */
+function powerset(arr) {
+	const result = [[]];
+	if (arr.length === 0) return result;
+	let current = [[]];
+	let maxIndex = [-1];
+	while (current.length > 0) {
+		const next = [];
+		const nextMaxIndex = [];
+		for (let i = 0; i < current.length; i++) for (let j = maxIndex[i] + 1; j < arr.length; j++) {
+			const subset = [...current[i], arr[j]];
+			result.push(subset);
+			if (j < arr.length - 1) {
+				next.push(subset);
+				nextMaxIndex.push(j);
+			}
+		}
+		current = next;
+		maxIndex = nextMaxIndex;
+	}
+	return result;
+}
+/** Check if set contains element. */
+function contains(setData, element) {
+	let left = 0;
+	let right = setData.length - 1;
+	while (left <= right) {
+		const mid = Math.floor((left + right) / 2);
+		const cmp = compare(setData[mid], element);
+		if (cmp === 0) return true;
+		else if (cmp < 0) left = mid + 1;
+		else right = mid - 1;
+	}
+	return false;
+}
+/** Is A ⊆ B. */
+function isSubsetOrEq(a, b) {
+	let i = 0, j = 0;
+	while (i < a.length && j < b.length) {
+		const cmp = compare(a[i], b[j]);
+		if (cmp === 0) {
+			i++;
+			j++;
+		} else if (cmp > 0) j++;
+		else return false;
+	}
+	return i === a.length;
+}
+/** Reduce: flatten double boolean to single boolean. */
+function reduce(target) {
+	const result = [];
+	for (const element of target) result.push(...element);
+	return set(result);
+}
+/** Union A ∪ B. */
+function setUnion(set1, set2) {
+	const result = [];
+	let i = 0, j = 0;
+	while (i < set1.length && j < set2.length) {
+		const cmp = compare(set1[i], set2[j]);
+		if (cmp < 0) {
+			result.push(set1[i]);
+			i++;
+		} else if (cmp > 0) {
+			result.push(set2[j]);
+			j++;
+		} else {
+			result.push(set1[i]);
+			i++;
+			j++;
+		}
+	}
+	while (i < set1.length) {
+		result.push(set1[i]);
+		i++;
+	}
+	while (j < set2.length) {
+		result.push(set2[j]);
+		j++;
+	}
+	return result;
+}
+/** Intersection A ∩ B. */
+function setIntersection(set1, set2) {
+	const result = [];
+	for (let i = 0, j = 0; i < set1.length && j < set2.length;) {
+		const cmp = compare(set1[i], set2[j]);
+		if (cmp < 0) i++;
+		else if (cmp > 0) j++;
+		else {
+			result.push(set1[i]);
+			i++;
+			j++;
+		}
+	}
+	return result;
+}
+/** Difference A \ B. */
+function setDiff(set1, set2) {
+	const result = [];
+	let i = 0, j = 0;
+	while (i < set1.length && j < set2.length) {
+		const cmp = compare(set1[i], set2[j]);
+		if (cmp < 0) {
+			result.push(set1[i]);
+			i++;
+		} else if (cmp > 0) j++;
+		else {
+			i++;
+			j++;
+		}
+	}
+	while (i < set1.length) {
+		result.push(set1[i]);
+		i++;
+	}
+	return result;
+}
+/** Symmetric difference A ∆ B. */
+function setSymDiff(set1, set2) {
+	const result = [];
+	let i = 0, j = 0;
+	while (i < set1.length && j < set2.length) {
+		const cmp = compare(set1[i], set2[j]);
+		if (cmp < 0) {
+			result.push(set1[i]);
+			i++;
+		} else if (cmp > 0) {
+			result.push(set2[j]);
+			j++;
+		} else {
+			i++;
+			j++;
+		}
+	}
+	while (i < set1.length) {
+		result.push(set1[i]);
+		i++;
+	}
+	while (j < set2.length) {
+		result.push(set2[j]);
+		j++;
+	}
+	return result;
+}
+/** Projection of set by indices (BigPr). */
+function projection(target, indices) {
+	return set(target.map((element) => {
+		const newComponents = indices.map((idx) => element[idx]);
+		return indices.length === 1 ? newComponents[0] : tuple(newComponents);
+	}));
+}
+/** Condensed string representation. */
+function printValue(data) {
+	if (!Array.isArray(data)) return String(data);
+	const len = data.length;
+	if (data.length === 0) return "{}";
+	const isTuple = data[0] === TUPLE_ID;
+	const start = isTuple ? 1 : 0;
+	let result = isTuple ? "(" : "{";
+	for (let i = start; i < len; i++) {
+		if (i > start) result += ", ";
+		result += printValue(data[i]);
+	}
+	result += isTuple ? ")" : "}";
+	return result;
+}
+/** Generates stub ID for value. */
+function valueStub(value) {
+	if (value == null) return "";
+	return generateStub(printValue(value));
+}
+/** Checks if value is a set representation, not a tuple representation. */
+function isSetValue(data) {
+	return Array.isArray(data) && (data.length === 0 || data[0] !== -111);
+}
+/** Checks if value is a tuple representation. */
+function isTupleValue(data) {
+	return Array.isArray(data) && data.length > 1 && data[0] === -111;
+}
+/** Normalize unsorted array of values. */
+function normalizeValue(data) {
+	if (!Array.isArray(data) || data.length === 0) return;
+	if (data[0] === -111) {
+		for (let i = 1; i < data.length; i++) normalizeValue(data[i]);
+		return;
+	}
+	for (const item of data) normalizeValue(item);
+	data.sort((a, b) => compare(a, b));
+	let i = 1;
+	while (i < data.length) if (compare(data[i - 1], data[i]) === 0) data.splice(i, 1);
+	else i++;
+}
+/** Validates value for {@link ExpressionType} and value of basic sets. */
+function validateValue(value, type, basics) {
+	switch (type.typeID) {
+		case TypeID.integer: return typeof value === "number";
+		case TypeID.logic:
+			if (typeof value !== "number") return false;
+			return value === 1 || value === 0;
+		case TypeID.basic: {
+			if (typeof value !== "number") return false;
+			const domain = basics.get(type.baseID);
+			return !!domain && Array.isArray(domain) && domain.includes(value);
+		}
+		case TypeID.tuple:
+			if (!Array.isArray(value) || value.length !== type.factors.length + 1 || value[0] !== -111) return false;
+			for (let i = 0; i < type.factors.length; i++) if (!validateValue(value[i + 1], type.factors[i], basics)) return false;
+			return true;
+		case TypeID.collection:
+			if (!isSetValue(value)) return false;
+			for (const item of value) if (!validateValue(item, type.base, basics)) return false;
+			return true;
+		case TypeID.anyTypification:
+		case TypeID.predicate:
+		case TypeID.function: return false;
+	}
+}
+/** Converts value path to type path. */
+function convertPathToType(path, type) {
+	const result = [];
+	if (path.length === 0) return result;
+	let curType = type;
+	let index = 0;
+	while (index < path.length) switch (curType.typeID) {
+		case TypeID.collection:
+			result.push(0);
+			curType = curType.base;
+			index++;
+			break;
+		case TypeID.tuple: {
+			const tupleIdx = path[index];
+			if (typeof tupleIdx !== "number" || tupleIdx < 1 || tupleIdx > curType.factors.length) return null;
+			result.push(tupleIdx);
+			curType = curType.factors[tupleIdx - 1];
+			index++;
+			break;
+		}
+		case TypeID.basic:
+		case TypeID.integer:
+		case TypeID.anyTypification: return null;
+	}
+	return result;
+}
+/** Extracts value from a target by path. */
+function extractValue(target, path) {
+	let current = target;
+	let i = 0;
+	while (i < path.length) {
+		if (!Array.isArray(current) || current.length <= path[i]) return null;
+		current = current[path[i]];
+		i++;
+	}
+	return current;
+}
+/** Makes default value for a type. */
+function makeDefaultValue(type) {
+	switch (type.typeID) {
+		case TypeID.anyTypification:
+		case TypeID.integer:
+		case TypeID.basic: return -1;
+		case TypeID.collection: return [];
+		case TypeID.tuple: return tuple(type.factors.map((item) => makeDefaultValue(item)));
+	}
+}
+/** Perform immutable deep copy update. */
+function setNestedValue(target, path, newVal) {
+	if (path.length === 0) return newVal;
+	const [head, ...rest] = path;
+	const arr = Array.isArray(target) ? [...target] : [];
+	arr[head] = setNestedValue(arr[head], makeValuePath(rest), newVal);
+	return arr;
+}
+/** Test if value contains invalid elements. */
+function testInvalid(value) {
+	const stack = [value];
+	while (stack.length > 0) {
+		const current = stack.pop();
+		if (current === -1) return true;
+		if (Array.isArray(current)) for (const element of current) stack.push(element);
+	}
+	return false;
+}
+//#endregion
+//#region src/rslang/eval/value.ts
+/** Tuple ID for array distinction. */
+const TUPLE_ID = -111;
+/** Invalid value for structured data. */
+const INVALID_ELEMENT = -1;
+/** Boolean values: true. */
+const VALUE_TRUE = 1;
+/** Boolean values: false. */
+const VALUE_FALSE = 0;
+/** Cardinality threshold for "infinite" sets (e.g. Z). */
+const SET_INFINITY = 1e7;
+/** Cardinality threshold for Boolean power set. */
+const BOOL_INFINITY = 18;
+/** Creates value path. */
+function makeValuePath(path) {
+	return path;
+}
+/** Empty set ∅. */
+const EmptySetV = [];
+/** Compare two structured data without recursive calls. */
+function compare(v1, v2) {
+	const stack1 = [v1];
+	const stack2 = [v2];
+	while (stack1.length > 0 && stack2.length > 0) {
+		const el1 = stack1.pop();
+		const el2 = stack2.pop();
+		if (el1 === el2) continue;
+		if (typeof el1 === "number" && typeof el2 === "number") {
+			const numDiff = el1 - el2;
+			if (numDiff !== 0) return numDiff;
+			continue;
+		}
+		if (!Array.isArray(el1) || !Array.isArray(el2)) throw new Error(`Cannot compare different types ${printValue(el1)} and ${printValue(el2)}`);
+		const arr1 = el1;
+		const arr2 = el2;
+		const len1 = arr1.length;
+		const len2 = arr2.length;
+		if (len1 !== len2) return len1 - len2;
+		for (let i = len1 - 1; i >= 0; i--) {
+			stack1.push(arr1[i]);
+			stack2.push(arr2[i]);
+		}
+	}
+	return 0;
+}
+/** Tuple from components. */
+function tuple(components) {
+	return [TUPLE_ID, ...components];
+}
+/** Set from elements (unique). Value[] - materialized. */
+function set(elements) {
+	const sorted = [...elements].sort(compare);
+	for (let i = 1; i < sorted.length;) if (compare(sorted[i - 1], sorted[i]) === 0) sorted.splice(i, 1);
+	else i++;
+	return sorted;
+}
+//#endregion
+export { testInvalid as A, projection as C, setNestedValue as D, setIntersection as E, valueStub as M, setSymDiff as O, printValue as S, setDiff as T, isSetValue as _, TUPLE_ID as a, makeDefaultValue as b, compare as c, tuple as d, boolean as f, extractValue as g, convertPathToType as h, SET_INFINITY as i, validateValue as j, setUnion as k, makeValuePath as l, contains as m, EmptySetV as n, VALUE_FALSE as o, cartesianProduct as p, INVALID_ELEMENT as r, VALUE_TRUE as s, BOOL_INFINITY as t, set as u, isSubsetOrEq as v, reduce as w, normalizeValue as x, isTupleValue as y };
+
+//# sourceMappingURL=value-B8UtCqaK.js.map

package/dist/value-B8UtCqaK.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"value-B8UtCqaK.js","names":[],"sources":["../src/rslang/eval/value-api.ts","../src/rslang/eval/value.ts"],"sourcesContent":["import { generateStub } from '../../shared';\nimport { type ExpressionType, TypeID, type TypePath, type Typification } from '../semantic/typification';\n\nimport {\n  BOOL_INFINITY,\n  compare,\n  EmptySetV,\n  INVALID_ELEMENT,\n  makeValuePath,\n  set,\n  SET_INFINITY,\n  tuple,\n  TUPLE_ID,\n  type Value,\n  VALUE_FALSE,\n  VALUE_TRUE,\n  type ValueContext,\n  type ValuePath\n} from './value';\n\n/** Cartesian product of factor sets. */\nexport function cartesianProduct(factors: Value[][]): Value[] | null {\n  const cardinality = factors.reduce((acc, f) => acc * f.length, 1);\n  if (cardinality > SET_INFINITY) {\n    return null;\n  }\n  if (cardinality === 0 || factors.length === 0) {\n    return EmptySetV;\n  }\n\n  let accumulator: Value[][] = [[]];\n  for (const factor of factors) {\n    const next: Value[][] = [];\n    for (const prefix of accumulator) {\n      for (const value of factor) {\n        next.push([...prefix, value]);\n      }\n    }\n    accumulator = next;\n  }\n  return accumulator.map(tuple);\n}\n\n/** Boolean power set ℬ(X). No cache - materialized. */\nexport function boolean(base: Value[]): Value[] | null {\n  if (base.length > BOOL_INFINITY) {\n    return null;\n  }\n  return powerset(base);\n}\n\n/** Powerset of array. */\nfunction powerset(arr: readonly Value[]): Value[][] {\n  const result: Value[][] = [[]];\n  if (arr.length === 0) {\n    return result;\n  }\n\n  let current: Value[][] = [[]];\n  let maxIndex: number[] = [-1];\n  while (current.length > 0) {\n    const next: Value[][] = [];\n    const nextMaxIndex: number[] = [];\n    for (let i = 0; i < current.length; i++) {\n      for (let j = maxIndex[i] + 1; j < arr.length; j++) {\n        const subset = [...current[i], arr[j]];\n        result.push(subset);\n        if (j < arr.length - 1) {\n          next.push(subset);\n          nextMaxIndex.push(j);\n        }\n      }\n    }\n    current = next;\n    maxIndex = nextMaxIndex;\n  }\n  return result;\n}\n\n/** Check if set contains element. */\nexport function contains(setData: Value[], element: Value): boolean {\n  let left = 0;\n  let right = setData.length - 1;\n  while (left <= right) {\n    const mid = Math.floor((left + right) / 2);\n    const cmp = compare(setData[mid], element);\n    if (cmp === 0) {\n      return true;\n    } else if (cmp < 0) {\n      left = mid + 1;\n    } else {\n      right = mid - 1;\n    }\n  }\n  return false;\n}\n\n/** Is A ⊆ B. */\nexport function isSubsetOrEq(a: Value[], b: Value[]): boolean {\n  let i = 0,\n    j = 0;\n  while (i < a.length && j < b.length) {\n    const cmp = compare(a[i], b[j]);\n    if (cmp === 0) {\n      i++;\n      j++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      return false;\n    }\n  }\n  return i === a.length;\n}\n\n/** Reduce: flatten double boolean to single boolean. */\nexport function reduce(target: Value[][]): Value[] {\n  const result: Value[] = [];\n  for (const element of target) {\n    result.push(...element);\n  }\n  return set(result);\n}\n\n/** Union A ∪ B. */\nexport function setUnion(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      result.push(set2[j]);\n      j++;\n    } else {\n      result.push(set1[i]);\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  while (j < set2.length) {\n    result.push(set2[j]);\n    j++;\n  }\n  return result;\n}\n\n/** Intersection A ∩ B. */\nexport function setIntersection(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  for (let i = 0, j = 0; i < set1.length && j < set2.length; ) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      i++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      result.push(set1[i]);\n      i++;\n      j++;\n    }\n  }\n  return result;\n}\n\n/** Difference A \\ B. */\nexport function setDiff(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  return result;\n}\n\n/** Symmetric difference A ∆ B. */\nexport function setSymDiff(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      result.push(set2[j]);\n      j++;\n    } else {\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  while (j < set2.length) {\n    result.push(set2[j]);\n    j++;\n  }\n  return result;\n}\n\n/** Projection of set by indices (BigPr). */\nexport function projection(target: Value[][], indices: number[]): Value[] {\n  const projectedElements: Value[] = target.map(element => {\n    const newComponents = indices.map(idx => element[idx]);\n    return indices.length === 1 ? newComponents[0] : tuple(newComponents);\n  });\n  return set(projectedElements);\n}\n\n/** Condensed string representation. */\nexport function printValue(data: Value | null): string {\n  if (!Array.isArray(data)) {\n    return String(data);\n  }\n  const len = data.length;\n  if (data.length === 0) {\n    return '{}';\n  }\n\n  const isTuple = data[0] === TUPLE_ID;\n  const start = isTuple ? 1 : 0;\n\n  let result = isTuple ? '(' : '{';\n  for (let i = start; i < len; i++) {\n    if (i > start) result += ', ';\n    result += printValue(data[i]);\n  }\n  result += isTuple ? ')' : '}';\n  return result;\n}\n\n/** Generates stub ID for value. */\nexport function valueStub(value: Value | null): string {\n  if (value == null) {\n    return '';\n  }\n  const str = printValue(value);\n  return generateStub(str);\n}\n\n/** Checks if value is a set representation, not a tuple representation. */\nexport function isSetValue(data: Value | null): data is Value[] {\n  return Array.isArray(data) && (data.length === 0 || data[0] !== TUPLE_ID);\n}\n\n/** Checks if value is a tuple representation. */\nexport function isTupleValue(data: Value | null): data is Value[] {\n  return Array.isArray(data) && data.length > 1 && data[0] === TUPLE_ID;\n}\n\n/** Normalize unsorted array of values. */\nexport function normalizeValue(data: Value): void {\n  if (!Array.isArray(data) || data.length === 0) {\n    return;\n  }\n\n  if (data[0] === TUPLE_ID) {\n    for (let i = 1; i < data.length; i++) {\n      normalizeValue(data[i]);\n    }\n    return;\n  }\n\n  for (const item of data) {\n    normalizeValue(item);\n  }\n\n  data.sort((a, b) => compare(a, b));\n  let i = 1;\n  while (i < data.length) {\n    if (compare(data[i - 1], data[i]) === 0) {\n      data.splice(i, 1);\n    } else {\n      i++;\n    }\n  }\n}\n\n/** Validates value for {@link ExpressionType} and value of basic sets. */\nexport function validateValue(value: Value, type: ExpressionType, basics: ValueContext): boolean {\n  switch (type.typeID) {\n    case TypeID.integer:\n      return typeof value === 'number';\n    case TypeID.logic: {\n      if (typeof value !== 'number') {\n        return false;\n      }\n      return value === VALUE_TRUE || value === VALUE_FALSE;\n    }\n    case TypeID.basic: {\n      if (typeof value !== 'number') {\n        return false;\n      }\n      const domain = basics.get(type.baseID);\n      return !!domain && Array.isArray(domain) && domain.includes(value);\n    }\n\n    case TypeID.tuple: {\n      if (!Array.isArray(value) || value.length !== type.factors.length + 1 || value[0] !== TUPLE_ID) {\n        return false;\n      }\n      for (let i = 0; i < type.factors.length; i++) {\n        if (!validateValue(value[i + 1], type.factors[i], basics)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    case TypeID.collection: {\n      if (!isSetValue(value)) {\n        return false;\n      }\n      for (const item of value) {\n        if (!validateValue(item, type.base, basics)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    case TypeID.anyTypification:\n    case TypeID.predicate:\n    case TypeID.function:\n      return false;\n  }\n}\n\n/** Converts value path to type path. */\nexport function convertPathToType(path: ValuePath, type: Typification): TypePath | null {\n  const result: number[] = [];\n  if (path.length === 0) {\n    return result as TypePath;\n  }\n\n  let curType = type;\n  let index = 0;\n  while (index < path.length) {\n    switch (curType.typeID) {\n      case TypeID.collection: {\n        result.push(0);\n        curType = curType.base;\n        index++;\n        break;\n      }\n      case TypeID.tuple: {\n        const tupleIdx = path[index];\n        if (typeof tupleIdx !== 'number' || tupleIdx < 1 || tupleIdx > curType.factors.length) {\n          return null;\n        }\n        result.push(tupleIdx);\n        curType = curType.factors[tupleIdx - 1];\n        index++;\n        break;\n      }\n      case TypeID.basic:\n      case TypeID.integer:\n      case TypeID.anyTypification:\n        return null;\n    }\n  }\n  return result as TypePath;\n}\n\n/** Extracts value from a target by path. */\nexport function extractValue(target: Value, path: ValuePath): Value | null {\n  let current: Value = target;\n  let i = 0;\n  while (i < path.length) {\n    if (!Array.isArray(current) || current.length <= path[i]) {\n      return null;\n    }\n    current = current[path[i]];\n    i++;\n  }\n  return current;\n}\n\n/** Makes default value for a type. */\nexport function makeDefaultValue(type: Typification): Value {\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n    case TypeID.integer:\n    case TypeID.basic:\n      return INVALID_ELEMENT;\n    case TypeID.collection:\n      return [];\n    case TypeID.tuple:\n      return tuple(type.factors.map(item => makeDefaultValue(item)));\n  }\n}\n\n/** Perform immutable deep copy update. */\nexport function setNestedValue(target: Value | null, path: ValuePath, newVal: Value): Value {\n  if (path.length === 0) {\n    return newVal;\n  }\n  const [head, ...rest] = path;\n  const arr = Array.isArray(target) ? [...target] : [];\n  arr[head] = setNestedValue(arr[head], makeValuePath(rest), newVal);\n  return arr;\n}\n\n/** Test if value contains invalid elements. */\nexport function testInvalid(value: Value): boolean {\n  const stack = [value];\n  while (stack.length > 0) {\n    const current = stack.pop();\n    if (current === INVALID_ELEMENT) {\n      return true;\n    }\n    if (Array.isArray(current)) {\n      for (const element of current) {\n        stack.push(element);\n      }\n    }\n  }\n  return false;\n}\n","/**\n * Module: Structured data for RSLang expression evaluation.\n */\n\nimport { type Branded } from '../../shared';\n\nimport { printValue } from './value-api';\n\n/** Tuple ID for array distinction. */\nexport const TUPLE_ID = -111;\n\n/** Invalid value for structured data. */\nexport const INVALID_ELEMENT = -1;\n\n/** Boolean values: true. */\nexport const VALUE_TRUE = 1;\n\n/** Boolean values: false. */\nexport const VALUE_FALSE = 0;\n\n/** Cardinality threshold for \"infinite\" sets (e.g. Z). */\nexport const SET_INFINITY = 10_000_000;\n\n/** Cardinality threshold for Boolean power set. */\nexport const BOOL_INFINITY = 18;\n\n/** Expression evaluation result: structured data. */\nexport type Value = number | Value[];\n\n/** Values context. */\nexport type ValueContext = Map<string, Value>;\n\n/** Value extraction path. */\nexport type ValuePath = Branded<number[], 'ValuePath'>;\n\n/** Creates value path. */\nexport function makeValuePath(path: number[]): ValuePath {\n  return path as ValuePath;\n}\n\n/** Empty set ∅. */\nexport const EmptySetV = [];\n\n/** Compare two structured data without recursive calls. */\nexport function compare(v1: Value, v2: Value): number {\n  const stack1: Value[] = [v1];\n  const stack2: Value[] = [v2];\n\n  while (stack1.length > 0 && stack2.length > 0) {\n    const el1 = stack1.pop();\n    const el2 = stack2.pop();\n    if (el1 === el2) {\n      continue;\n    }\n\n    const type1 = typeof el1;\n    const type2 = typeof el2;\n    if (type1 === 'number' && type2 === 'number') {\n      const numDiff = (el1 as number) - (el2 as number);\n      if (numDiff !== 0) return numDiff;\n      continue;\n    }\n\n    const isArray1 = Array.isArray(el1);\n    const isArray2 = Array.isArray(el2);\n    if (!isArray1 || !isArray2) {\n      throw new Error(`Cannot compare different types ${printValue(el1!)} and ${printValue(el2!)}`);\n    }\n\n    const arr1 = el1;\n    const arr2 = el2;\n    const len1 = arr1.length;\n    const len2 = arr2.length;\n    if (len1 !== len2) {\n      return len1 - len2;\n    }\n\n    for (let i = len1 - 1; i >= 0; i--) {\n      stack1.push(arr1[i]);\n      stack2.push(arr2[i]);\n    }\n  }\n  return 0;\n}\n\n/** Tuple from components. */\nexport function tuple(components: Value[]): Value {\n  return [TUPLE_ID, ...components];\n}\n\n/** Set from elements (unique). Value[] - materialized. */\nexport function set(elements: Value[]): Value[] {\n  const sorted = [...elements].sort(compare);\n  for (let i = 1; i < sorted.length; ) {\n    if (compare(sorted[i - 1], sorted[i]) === 0) {\n      sorted.splice(i, 1);\n    } else {\n      i++;\n    }\n  }\n  return sorted;\n}\n"],"mappings":";;;;;AAqBA,SAAgB,iBAAiB,SAAoC;CACnE,MAAM,cAAc,QAAQ,QAAQ,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC;CAChE,IAAI,cAAA,KACF,OAAO;CAET,IAAI,gBAAgB,KAAK,QAAQ,WAAW,GAC1C,OAAO;CAGT,IAAI,cAAyB,CAAC,CAAC,CAAC;CAChC,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,OAAkB,CAAC;EACzB,KAAK,MAAM,UAAU,aACnB,KAAK,MAAM,SAAS,QAClB,KAAK,KAAK,CAAC,GAAG,QAAQ,KAAK,CAAC;EAGhC,cAAc;CAChB;CACA,OAAO,YAAY,IAAI,KAAK;AAC9B;;AAGA,SAAgB,QAAQ,MAA+B;CACrD,IAAI,KAAK,SAAA,IACP,OAAO;CAET,OAAO,SAAS,IAAI;AACtB;;AAGA,SAAS,SAAS,KAAkC;CAClD,MAAM,SAAoB,CAAC,CAAC,CAAC;CAC7B,IAAI,IAAI,WAAW,GACjB,OAAO;CAGT,IAAI,UAAqB,CAAC,CAAC,CAAC;CAC5B,IAAI,WAAqB,CAAC,EAAE;CAC5B,OAAO,QAAQ,SAAS,GAAG;EACzB,MAAM,OAAkB,CAAC;EACzB,MAAM,eAAyB,CAAC;EAChC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,KAAK,IAAI,IAAI,SAAS,KAAK,GAAG,IAAI,IAAI,QAAQ,KAAK;GACjD,MAAM,SAAS,CAAC,GAAG,QAAQ,IAAI,IAAI,EAAE;GACrC,OAAO,KAAK,MAAM;GAClB,IAAI,IAAI,IAAI,SAAS,GAAG;IACtB,KAAK,KAAK,MAAM;IAChB,aAAa,KAAK,CAAC;GACrB;EACF;EAEF,UAAU;EACV,WAAW;CACb;CACA,OAAO;AACT;;AAGA,SAAgB,SAAS,SAAkB,SAAyB;CAClE,IAAI,OAAO;CACX,IAAI,QAAQ,QAAQ,SAAS;CAC7B,OAAO,QAAQ,OAAO;EACpB,MAAM,MAAM,KAAK,OAAO,OAAO,SAAS,CAAC;EACzC,MAAM,MAAM,QAAQ,QAAQ,MAAM,OAAO;EACzC,IAAI,QAAQ,GACV,OAAO;OACF,IAAI,MAAM,GACf,OAAO,MAAM;OAEb,QAAQ,MAAM;CAElB;CACA,OAAO;AACT;;AAGA,SAAgB,aAAa,GAAY,GAAqB;CAC5D,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,EAAE,UAAU,IAAI,EAAE,QAAQ;EACnC,MAAM,MAAM,QAAQ,EAAE,IAAI,EAAE,EAAE;EAC9B,IAAI,QAAQ,GAAG;GACb;GACA;EACF,OAAO,IAAI,MAAM,GACf;OAEA,OAAO;CAEX;CACA,OAAO,MAAM,EAAE;AACjB;;AAGA,SAAgB,OAAO,QAA4B;CACjD,MAAM,SAAkB,CAAC;CACzB,KAAK,MAAM,WAAW,QACpB,OAAO,KAAK,GAAG,OAAO;CAExB,OAAO,IAAI,MAAM;AACnB;;AAGA,SAAgB,SAAS,MAAe,MAAwB;CAC9D,MAAM,SAAkB,CAAC;CACzB,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ;EACzC,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GAAG;GACX,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO,IAAI,MAAM,GAAG;GAClB,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO;GACL,OAAO,KAAK,KAAK,EAAE;GACnB;GACA;EACF;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,gBAAgB,MAAe,MAAwB;CACrE,MAAM,SAAkB,CAAC;CACzB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,UAAU,IAAI,KAAK,SAAU;EAC3D,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GACR;OACK,IAAI,MAAM,GACf;OACK;GACL,OAAO,KAAK,KAAK,EAAE;GACnB;GACA;EACF;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,QAAQ,MAAe,MAAwB;CAC7D,MAAM,SAAkB,CAAC;CACzB,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ;EACzC,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GAAG;GACX,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO,IAAI,MAAM,GACf;OACK;GACL;GACA;EACF;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,WAAW,MAAe,MAAwB;CAChE,MAAM,SAAkB,CAAC;CACzB,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ;EACzC,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GAAG;GACX,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO,IAAI,MAAM,GAAG;GAClB,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO;GACL;GACA;EACF;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,WAAW,QAAmB,SAA4B;CAKxE,OAAO,IAJ4B,OAAO,KAAI,YAAW;EACvD,MAAM,gBAAgB,QAAQ,KAAI,QAAO,QAAQ,IAAI;EACrD,OAAO,QAAQ,WAAW,IAAI,cAAc,KAAK,MAAM,aAAa;CACtE,CACW,CAAiB;AAC9B;;AAGA,SAAgB,WAAW,MAA4B;CACrD,IAAI,CAAC,MAAM,QAAQ,IAAI,GACrB,OAAO,OAAO,IAAI;CAEpB,MAAM,MAAM,KAAK;CACjB,IAAI,KAAK,WAAW,GAClB,OAAO;CAGT,MAAM,UAAU,KAAK,OAAO;CAC5B,MAAM,QAAQ,UAAU,IAAI;CAE5B,IAAI,SAAS,UAAU,MAAM;CAC7B,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK;EAChC,IAAI,IAAI,OAAO,UAAU;EACzB,UAAU,WAAW,KAAK,EAAE;CAC9B;CACA,UAAU,UAAU,MAAM;CAC1B,OAAO;AACT;;AAGA,SAAgB,UAAU,OAA6B;CACrD,IAAI,SAAS,MACX,OAAO;CAGT,OAAO,aADK,WAAW,KACH,CAAG;AACzB;;AAGA,SAAgB,WAAW,MAAqC;CAC9D,OAAO,MAAM,QAAQ,IAAI,MAAM,KAAK,WAAW,KAAK,KAAK,OAAA;AAC3D;;AAGA,SAAgB,aAAa,MAAqC;CAChE,OAAO,MAAM,QAAQ,IAAI,KAAK,KAAK,SAAS,KAAK,KAAK,OAAA;AACxD;;AAGA,SAAgB,eAAe,MAAmB;CAChD,IAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,KAAK,WAAW,GAC1C;CAGF,IAAI,KAAK,OAAA,MAAiB;EACxB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,eAAe,KAAK,EAAE;EAExB;CACF;CAEA,KAAK,MAAM,QAAQ,MACjB,eAAe,IAAI;CAGrB,KAAK,MAAM,GAAG,MAAM,QAAQ,GAAG,CAAC,CAAC;CACjC,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,QACd,IAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,EAAE,MAAM,GACpC,KAAK,OAAO,GAAG,CAAC;MAEhB;AAGN;;AAGA,SAAgB,cAAc,OAAc,MAAsB,QAA+B;CAC/F,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,SACV,OAAO,OAAO,UAAU;EAC1B,KAAK,OAAO;GACV,IAAI,OAAO,UAAU,UACnB,OAAO;GAET,OAAO,UAAA,KAAwB,UAAA;EAEjC,KAAK,OAAO,OAAO;GACjB,IAAI,OAAO,UAAU,UACnB,OAAO;GAET,MAAM,SAAS,OAAO,IAAI,KAAK,MAAM;GACrC,OAAO,CAAC,CAAC,UAAU,MAAM,QAAQ,MAAM,KAAK,OAAO,SAAS,KAAK;EACnE;EAEA,KAAK,OAAO;GACV,IAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,KAAK,QAAQ,SAAS,KAAK,MAAM,OAAA,MAC7E,OAAO;GAET,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KACvC,IAAI,CAAC,cAAc,MAAM,IAAI,IAAI,KAAK,QAAQ,IAAI,MAAM,GACtD,OAAO;GAGX,OAAO;EAGT,KAAK,OAAO;GACV,IAAI,CAAC,WAAW,KAAK,GACnB,OAAO;GAET,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,cAAc,MAAM,KAAK,MAAM,MAAM,GACxC,OAAO;GAGX,OAAO;EAGT,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,UACV,OAAO;CACX;AACF;;AAGA,SAAgB,kBAAkB,MAAiB,MAAqC;CACtF,MAAM,SAAmB,CAAC;CAC1B,IAAI,KAAK,WAAW,GAClB,OAAO;CAGT,IAAI,UAAU;CACd,IAAI,QAAQ;CACZ,OAAO,QAAQ,KAAK,QAClB,QAAQ,QAAQ,QAAhB;EACE,KAAK,OAAO;GACV,OAAO,KAAK,CAAC;GACb,UAAU,QAAQ;GAClB;GACA;EAEF,KAAK,OAAO,OAAO;GACjB,MAAM,WAAW,KAAK;GACtB,IAAI,OAAO,aAAa,YAAY,WAAW,KAAK,WAAW,QAAQ,QAAQ,QAC7E,OAAO;GAET,OAAO,KAAK,QAAQ;GACpB,UAAU,QAAQ,QAAQ,WAAW;GACrC;GACA;EACF;EACA,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,iBACV,OAAO;CACX;CAEF,OAAO;AACT;;AAGA,SAAgB,aAAa,QAAe,MAA+B;CACzE,IAAI,UAAiB;CACrB,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,QAAQ;EACtB,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,UAAU,KAAK,IACpD,OAAO;EAET,UAAU,QAAQ,KAAK;EACvB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,iBAAiB,MAA2B;CAC1D,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,OACV,OAAA;EACF,KAAK,OAAO,YACV,OAAO,CAAC;EACV,KAAK,OAAO,OACV,OAAO,MAAM,KAAK,QAAQ,KAAI,SAAQ,iBAAiB,IAAI,CAAC,CAAC;CACjE;AACF;;AAGA,SAAgB,eAAe,QAAsB,MAAiB,QAAsB;CAC1F,IAAI,KAAK,WAAW,GAClB,OAAO;CAET,MAAM,CAAC,MAAM,GAAG,QAAQ;CACxB,MAAM,MAAM,MAAM,QAAQ,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC;CACnD,IAAI,QAAQ,eAAe,IAAI,OAAO,cAAc,IAAI,GAAG,MAAM;CACjE,OAAO;AACT;;AAGA,SAAgB,YAAY,OAAuB;CACjD,MAAM,QAAQ,CAAC,KAAK;CACpB,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,UAAU,MAAM,IAAI;EAC1B,IAAI,YAAA,IACF,OAAO;EAET,IAAI,MAAM,QAAQ,OAAO,GACvB,KAAK,MAAM,WAAW,SACpB,MAAM,KAAK,OAAO;CAGxB;CACA,OAAO;AACT;;;;AClbA,MAAa,WAAW;;AAGxB,MAAa,kBAAkB;;AAG/B,MAAa,aAAa;;AAG1B,MAAa,cAAc;;AAG3B,MAAa,eAAe;;AAG5B,MAAa,gBAAgB;;AAY7B,SAAgB,cAAc,MAA2B;CACvD,OAAO;AACT;;AAGA,MAAa,YAAY,CAAC;;AAG1B,SAAgB,QAAQ,IAAW,IAAmB;CACpD,MAAM,SAAkB,CAAC,EAAE;CAC3B,MAAM,SAAkB,CAAC,EAAE;CAE3B,OAAO,OAAO,SAAS,KAAK,OAAO,SAAS,GAAG;EAC7C,MAAM,MAAM,OAAO,IAAI;EACvB,MAAM,MAAM,OAAO,IAAI;EACvB,IAAI,QAAQ,KACV;EAKF,IAAI,OAFiB,QAEP,YAAY,OADL,QACe,UAAU;GAC5C,MAAM,UAAW,MAAkB;GACnC,IAAI,YAAY,GAAG,OAAO;GAC1B;EACF;EAIA,IAAI,CAFa,MAAM,QAAQ,GAE1B,KAAY,CADA,MAAM,QAAQ,GACb,GAChB,MAAM,IAAI,MAAM,kCAAkC,WAAW,GAAI,EAAE,OAAO,WAAW,GAAI,GAAG;EAG9F,MAAM,OAAO;EACb,MAAM,OAAO;EACb,MAAM,OAAO,KAAK;EAClB,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,MACX,OAAO,OAAO;EAGhB,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,GAAG,KAAK;GAClC,OAAO,KAAK,KAAK,EAAE;GACnB,OAAO,KAAK,KAAK,EAAE;EACrB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,MAAM,YAA4B;CAChD,OAAO,CAAC,UAAU,GAAG,UAAU;AACjC;;AAGA,SAAgB,IAAI,UAA4B;CAC9C,MAAM,SAAS,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK,OAAO;CACzC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,SACzB,IAAI,QAAQ,OAAO,IAAI,IAAI,OAAO,EAAE,MAAM,GACxC,OAAO,OAAO,GAAG,CAAC;MAElB;CAGJ,OAAO;AACT"}

package/dist/value-CTjX6825.d.ts

@@ -0,0 +1,33 @@
+import { t as Branded } from "./branded-ZlzIcxzu.js";
+//#region src/rslang/eval/value.d.ts
+/** Tuple ID for array distinction. */
+declare const TUPLE_ID = -111;
+/** Invalid value for structured data. */
+declare const INVALID_ELEMENT = -1;
+/** Boolean values: true. */
+declare const VALUE_TRUE = 1;
+/** Boolean values: false. */
+declare const VALUE_FALSE = 0;
+/** Cardinality threshold for "infinite" sets (e.g. Z). */
+declare const SET_INFINITY = 10000000;
+/** Cardinality threshold for Boolean power set. */
+declare const BOOL_INFINITY = 18;
+/** Expression evaluation result: structured data. */
+type Value = number | Value[];
+/** Values context. */
+type ValueContext = Map<string, Value>;
+/** Value extraction path. */
+type ValuePath = Branded<number[], 'ValuePath'>;
+/** Creates value path. */
+declare function makeValuePath(path: number[]): ValuePath;
+/** Empty set ∅. */
+declare const EmptySetV: never[];
+/** Compare two structured data without recursive calls. */
+declare function compare(v1: Value, v2: Value): number;
+/** Tuple from components. */
+declare function tuple(components: Value[]): Value;
+/** Set from elements (unique). Value[] - materialized. */
+declare function set(elements: Value[]): Value[];
+//#endregion
+export { TUPLE_ID as a, Value as c, compare as d, makeValuePath as f, SET_INFINITY as i, ValueContext as l, tuple as m, EmptySetV as n, VALUE_FALSE as o, set as p, INVALID_ELEMENT as r, VALUE_TRUE as s, BOOL_INFINITY as t, ValuePath as u };
+//# sourceMappingURL=value-CTjX6825.d.ts.map

package/dist/value-api-Bw-SgaYY.d.ts

@@ -0,0 +1,49 @@
+import { b as Typification, f as ExpressionType, y as TypePath } from "./typification-Dk-fisgO.js";
+import { c as Value, l as ValueContext, u as ValuePath } from "./value-CTjX6825.js";
+
+//#region src/rslang/eval/value-api.d.ts
+/** Cartesian product of factor sets. */
+declare function cartesianProduct(factors: Value[][]): Value[] | null;
+/** Boolean power set ℬ(X). No cache - materialized. */
+declare function boolean(base: Value[]): Value[] | null;
+/** Check if set contains element. */
+declare function contains(setData: Value[], element: Value): boolean;
+/** Is A ⊆ B. */
+declare function isSubsetOrEq(a: Value[], b: Value[]): boolean;
+/** Reduce: flatten double boolean to single boolean. */
+declare function reduce(target: Value[][]): Value[];
+/** Union A ∪ B. */
+declare function setUnion(set1: Value[], set2: Value[]): Value[];
+/** Intersection A ∩ B. */
+declare function setIntersection(set1: Value[], set2: Value[]): Value[];
+/** Difference A \ B. */
+declare function setDiff(set1: Value[], set2: Value[]): Value[];
+/** Symmetric difference A ∆ B. */
+declare function setSymDiff(set1: Value[], set2: Value[]): Value[];
+/** Projection of set by indices (BigPr). */
+declare function projection(target: Value[][], indices: number[]): Value[];
+/** Condensed string representation. */
+declare function printValue(data: Value | null): string;
+/** Generates stub ID for value. */
+declare function valueStub(value: Value | null): string;
+/** Checks if value is a set representation, not a tuple representation. */
+declare function isSetValue(data: Value | null): data is Value[];
+/** Checks if value is a tuple representation. */
+declare function isTupleValue(data: Value | null): data is Value[];
+/** Normalize unsorted array of values. */
+declare function normalizeValue(data: Value): void;
+/** Validates value for {@link ExpressionType} and value of basic sets. */
+declare function validateValue(value: Value, type: ExpressionType, basics: ValueContext): boolean;
+/** Converts value path to type path. */
+declare function convertPathToType(path: ValuePath, type: Typification): TypePath | null;
+/** Extracts value from a target by path. */
+declare function extractValue(target: Value, path: ValuePath): Value | null;
+/** Makes default value for a type. */
+declare function makeDefaultValue(type: Typification): Value;
+/** Perform immutable deep copy update. */
+declare function setNestedValue(target: Value | null, path: ValuePath, newVal: Value): Value;
+/** Test if value contains invalid elements. */
+declare function testInvalid(value: Value): boolean;
+//#endregion
+export { setSymDiff as _, extractValue as a, validateValue as b, isTupleValue as c, printValue as d, projection as f, setNestedValue as g, setIntersection as h, convertPathToType as i, makeDefaultValue as l, setDiff as m, cartesianProduct as n, isSetValue as o, reduce as p, contains as r, isSubsetOrEq as s, boolean as t, normalizeValue as u, setUnion as v, valueStub as x, testInvalid as y };
+//# sourceMappingURL=value-api-Bw-SgaYY.d.ts.map

package/dist/value-class-CNI-lqXJ.d.ts

@@ -0,0 +1,12 @@
+//#region src/rslang/semantic/value-class.d.ts
+/** Represents computability class. */
+declare const ValueClass: {
+  readonly VALUE: "value";
+  readonly PROPERTY: "property";
+};
+type ValueClass = (typeof ValueClass)[keyof typeof ValueClass];
+/** ValueClass context. */
+type ValueClassContext = Map<string, ValueClass>;
+//#endregion
+export { ValueClassContext as n, ValueClass as t };
+//# sourceMappingURL=value-class-CNI-lqXJ.d.ts.map

package/package.json

@@ -1,12 +1,12 @@
 {
   "name": "@rsconcept/domain",
-  "version": "1.0.0",
+  "version": "1.1.0",
   "description": "Shared TypeScript domain for RS language, RSForm, RSModel, RSEngine, OSS, and concept-text helpers.",
   "license": "MIT",
   "author": "IRBorisov",
   "repository": {
     "type": "git",
-    "url": "git+https://github.com/IRBorisov/ConceptPortal.git",
+    "url": "git+https://github.com/IRBorisov/ConceptPortal",
     "directory": "rsconcept/domain"
   },
   "homepage": "https://portal.acconcept.ru",
@@ -152,7 +152,7 @@
   ],
   "scripts": {
     "generate": "lezer-generator src/rslang/parser/rslang.grammar -o src/rslang/parser/parser.ts",
-    "build": "tsup",
+    "build": "tsdown",
     "typecheck": "tsc -p tsconfig.json --noEmit",
     "test": "vitest run",
     "lint": "eslint . --report-unused-disable-directives --max-warnings 0",
@@ -167,16 +167,16 @@
   },
   "devDependencies": {
     "@lezer/generator": "^1.8.0",
-    "@types/node": "^25.9.1",
+    "@types/node": "^25.9.3",
     "@typescript-eslint/parser": "^8.0.1",
     "eslint": "^9.39.4",
     "eslint-plugin-simple-import-sort": "^13.0.0",
     "globals": "^17.6.0",
-    "prettier": "^3.8.3",
-    "tsup": "^8.5.0",
+    "prettier": "^3.8.4",
+    "tsdown": "^0.22.2",
     "typescript": "^6.0.3",
-    "typescript-eslint": "^8.59.4",
-    "vitest": "^4.1.5"
+    "typescript-eslint": "^8.61.0",
+    "vitest": "^4.1.8"
   },
   "publishConfig": {
     "access": "public"

package/src/library/rsform-api.test.ts

@@ -0,0 +1,24 @@
+import { describe, expect, it } from 'vitest';
+
+import { CstType } from './rsform';
+import { validateAliasFormat } from './rsform-api';
+
+describe('validateAliasFormat', () => {
+  it('accepts alias with type prefix and numeric suffix', () => {
+    expect(validateAliasFormat('X1', CstType.BASE)).toBe(true);
+    expect(validateAliasFormat('D12', CstType.TERM)).toBe(true);
+  });
+
+  it('rejects alias with wrong prefix for type', () => {
+    expect(validateAliasFormat('D1', CstType.BASE)).toBe(false);
+  });
+
+  it('rejects alias without numeric suffix', () => {
+    expect(validateAliasFormat('X', CstType.BASE)).toBe(false);
+    expect(validateAliasFormat('XA', CstType.BASE)).toBe(false);
+  });
+
+  it('rejects duplicate-looking aliases with non-digit suffix', () => {
+    expect(validateAliasFormat('X1a', CstType.BASE)).toBe(false);
+  });
+});

package/src/library/rsform-api.ts

@@ -257,8 +257,8 @@ export function canHaveManualTypification(type: CstType): boolean {
   }
 }
 
-/** Validate new alias against {@link CstType} and {@link RSForm}. */
-export function validateNewAlias(alias: string, type: CstType, schema: RSForm): boolean {
+/** Validate alias format for a given {@link CstType} (prefix + digits, min length 2). */
+export function validateAliasFormat(alias: string, type: CstType): boolean {
   if (alias.length < 2) {
     return false;
   }
@@ -266,10 +266,18 @@ export function validateNewAlias(alias: string, type: CstType, schema: RSForm):
   if (!alias.startsWith(prefix)) {
     return false;
   }
-  if (schema.cstByAlias.has(alias)) {
+  if (!/^\d+$/.exec(alias.substring(prefix.length))) {
     return false;
   }
-  if (!/^\d+$/.exec(alias.substring(prefix.length))) {
+  return true;
+}
+
+/** Validate new alias against {@link CstType} and {@link RSForm}. */
+export function validateNewAlias(alias: string, type: CstType, schema: RSForm): boolean {
+  if (!validateAliasFormat(alias, type)) {
+    return false;
+  }
+  if (schema.cstByAlias.has(alias)) {
     return false;
   }
   return true;

package/dist/cctext/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/cctext/language.ts"],"sourcesContent":["/**\n * Module: Natural language model declarations.\n */\n\n/** Represents single unit of language Morphology. */\n// prettier-ignore\nexport const Grammeme = {\n  // Число\n  sing: 'sing', plur: 'plur',\n\n  // Падеж\n  nomn: 'nomn', gent: 'gent', datv: 'datv',\n  accs: 'accs', ablt: 'ablt', loct: 'loct',\n} as const;\nexport type Grammeme = (typeof Grammeme)[keyof typeof Grammeme];\n\n/** Represents case language concept. */\nexport const Case: Grammeme[] = [\n  Grammeme.nomn,\n  Grammeme.gent,\n  Grammeme.datv,\n  Grammeme.accs,\n  Grammeme.ablt,\n  Grammeme.loct\n] as const;\n\n/** Represents plurality language concept. */\nexport const Plurality: Grammeme[] = [Grammeme.sing, Grammeme.plur] as const;\n\n/** Represents specific wordform attached to {@link Grammeme}s. */\nexport interface WordForm {\n  text: string;\n  grams: Grammeme[];\n}\n\n/** Represents a term available for text reference resolution. */\nexport interface TermContextItem {\n  nominal: string;\n  forms?: WordForm[];\n}\n\n/** Represents term lookup context keyed by entity alias. */\nexport type TermContext = Record<string, TermContextItem>;\n\n/**\n * Represents list of {@link Grammeme}s available in reference construction.\n */\n// prettier-ignore\nexport const supportedGrammemes = [\n  Grammeme.sing, Grammeme.plur,\n  Grammeme.nomn, Grammeme.gent, Grammeme.datv,\n  Grammeme.accs, Grammeme.ablt, Grammeme.loct,\n] as const;\n\n// ====== Reference resolution =====\n\n/** Represents text reference type. */\nexport const ReferenceType = {\n  ENTITY: 'entity',\n  SYNTACTIC: 'syntax'\n} as const;\nexport type ReferenceType = (typeof ReferenceType)[keyof typeof ReferenceType];\n\n/** Represents entity reference payload. */\nexport interface EntityReference {\n  entity: string;\n  tags: Grammeme[];\n}\n\n/** Represents syntactic reference payload. */\nexport interface SyntacticReference {\n  offset: number;\n  nominal: string;\n}\n\n/** Represents abstract reference data. */\nexport interface IReference {\n  type: ReferenceType;\n  data: EntityReference | SyntacticReference;\n}\n"],"mappings":";AAMO,IAAM,WAAW;AAAA;AAAA,EAEtB,MAAM;AAAA,EAAQ,MAAM;AAAA;AAAA,EAGpB,MAAM;AAAA,EAAQ,MAAM;AAAA,EAAQ,MAAM;AAAA,EAClC,MAAM;AAAA,EAAQ,MAAM;AAAA,EAAQ,MAAM;AACpC;AAIO,IAAM,OAAmB;AAAA,EAC9B,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AACX;AAGO,IAAM,YAAwB,CAAC,SAAS,MAAM,SAAS,IAAI;AAqB3D,IAAM,qBAAqB;AAAA,EAChC,SAAS;AAAA,EAAM,SAAS;AAAA,EACxB,SAAS;AAAA,EAAM,SAAS;AAAA,EAAM,SAAS;AAAA,EACvC,SAAS;AAAA,EAAM,SAAS;AAAA,EAAM,SAAS;AACzC;AAKO,IAAM,gBAAgB;AAAA,EAC3B,QAAQ;AAAA,EACR,WAAW;AACb;","names":[]}