@medplum/core 2.0.23 → 2.0.25

package/dist/esm/fhirpath/utils.mjs

@@ -1,378 +0,0 @@
-import { PropertyType, isResource, getElementDefinition, buildTypeName } from '../types.mjs';
-import { capitalize, isEmpty } from '../utils.mjs';
-
-/**
- * Returns a single element array with a typed boolean value.
- * @param value The primitive boolean value.
- * @returns Single element array with a typed boolean value.
- */
-function booleanToTypedValue(value) {
-    return [{ type: PropertyType.boolean, value }];
-}
-/**
- * Returns a "best guess" TypedValue for a given value.
- * @param value The unknown value to check.
- * @returns A "best guess" TypedValue for the given value.
- */
-function toTypedValue(value) {
-    if (value === null || value === undefined) {
-        return { type: 'undefined', value: undefined };
-    }
-    else if (Number.isSafeInteger(value)) {
-        return { type: PropertyType.integer, value };
-    }
-    else if (typeof value === 'number') {
-        return { type: PropertyType.decimal, value };
-    }
-    else if (typeof value === 'boolean') {
-        return { type: PropertyType.boolean, value };
-    }
-    else if (typeof value === 'string') {
-        return { type: PropertyType.string, value };
-    }
-    else if (isQuantity(value)) {
-        return { type: PropertyType.Quantity, value };
-    }
-    else if (isResource(value)) {
-        return { type: value.resourceType, value };
-    }
-    else {
-        return { type: PropertyType.BackboneElement, value };
-    }
-}
-/**
- * Converts unknown object into a JavaScript boolean.
- * Note that this is different than the FHIRPath "toBoolean",
- * which has particular semantics around arrays, empty arrays, and type conversions.
- * @param obj Any value or array of values.
- * @returns The converted boolean value according to FHIRPath rules.
- */
-function toJsBoolean(obj) {
-    return obj.length === 0 ? false : !!obj[0].value;
-}
-/**
- * Returns the value of the property and the property type.
- * Some property definitions support multiple types.
- * For example, "Observation.value[x]" can be "valueString", "valueInteger", "valueQuantity", etc.
- * According to the spec, there can only be one property for a given element definition.
- * This function returns the value and the type.
- * @param input The base context (FHIR resource or backbone element).
- * @param path The property path.
- * @returns The value of the property and the property type.
- */
-function getTypedPropertyValue(input, path) {
-    if (!input?.value) {
-        return undefined;
-    }
-    const elementDefinition = getElementDefinition(input.type, path);
-    if (elementDefinition) {
-        const typedResult = getTypedPropertyValueWithSchema(input, path, elementDefinition);
-        if (typedResult) {
-            return typedResult;
-        }
-    }
-    return getTypedPropertyValueWithoutSchema(input, path);
-}
-/**
- * Returns the value of the property and the property type using a type schema.
- * @param input The base context (FHIR resource or backbone element).
- * @param path The property path.
- * @param property The property element definition.
- * @returns The value of the property and the property type.
- */
-function getTypedPropertyValueWithSchema(input, path, property) {
-    const types = property.type;
-    if (!types || types.length === 0) {
-        return undefined;
-    }
-    let resultValue = undefined;
-    let resultType = 'undefined';
-    if (types.length === 1) {
-        resultValue = input.value[path];
-        resultType = types[0].code;
-    }
-    else {
-        for (const type of types) {
-            const path2 = path.replace('[x]', '') + capitalize(type.code);
-            if (path2 in input.value) {
-                resultValue = input.value[path2];
-                resultType = type.code;
-                break;
-            }
-        }
-    }
-    if (isEmpty(resultValue)) {
-        return undefined;
-    }
-    if (resultType === 'Element' || resultType === 'BackboneElement') {
-        resultType = buildTypeName(property.path?.split('.'));
-    }
-    if (Array.isArray(resultValue)) {
-        return resultValue.map((element) => toTypedValueWithType(element, resultType));
-    }
-    else {
-        return toTypedValueWithType(resultValue, resultType);
-    }
-}
-function toTypedValueWithType(value, type) {
-    if (type === 'Resource' && isResource(value)) {
-        type = value.resourceType;
-    }
-    return { type, value };
-}
-/**
- * Returns the value of the property and the property type using a type schema.
- * Note that because the type schema is not available, this function may be inaccurate.
- * In some cases, that is the desired behavior.
- * @param typedValue The base context (FHIR resource or backbone element).
- * @param path The property path.
- * @returns The value of the property and the property type.
- */
-function getTypedPropertyValueWithoutSchema(typedValue, path) {
-    const input = typedValue.value;
-    if (!input || typeof input !== 'object') {
-        return undefined;
-    }
-    let result = undefined;
-    if (path in input) {
-        result = input[path];
-    }
-    else {
-        // Only support property names that would be valid types
-        // Examples:
-        // value + valueString = ok, because "string" is valid
-        // value + valueDecimal = ok, because "decimal" is valid
-        // id + identifier = not ok, because "entifier" is not a valid type
-        // resource + resourceType = not ok, because "type" is not a valid type
-        for (const propertyType in PropertyType) {
-            const propertyName = path + capitalize(propertyType);
-            if (propertyName in input) {
-                result = input[propertyName];
-                break;
-            }
-        }
-    }
-    if (isEmpty(result)) {
-        return undefined;
-    }
-    if (Array.isArray(result)) {
-        return result.map(toTypedValue);
-    }
-    else {
-        return toTypedValue(result);
-    }
-}
-/**
- * Removes duplicates in array using FHIRPath equality rules.
- * @param arr The input array.
- * @returns The result array with duplicates removed.
- */
-function removeDuplicates(arr) {
-    const result = [];
-    for (const i of arr) {
-        let found = false;
-        for (const j of result) {
-            if (toJsBoolean(fhirPathEquals(i, j))) {
-                found = true;
-                break;
-            }
-        }
-        if (!found) {
-            result.push(i);
-        }
-    }
-    return result;
-}
-/**
- * Returns a negated FHIRPath boolean expression.
- * @param input The input array.
- * @returns The negated type value array.
- */
-function fhirPathNot(input) {
-    return booleanToTypedValue(!toJsBoolean(input));
-}
-/**
- * Determines if two arrays are equal according to FHIRPath equality rules.
- * @param x The first array.
- * @param y The second array.
- * @returns FHIRPath true if the arrays are equal.
- */
-function fhirPathArrayEquals(x, y) {
-    if (x.length === 0 || y.length === 0) {
-        return [];
-    }
-    if (x.length !== y.length) {
-        return booleanToTypedValue(false);
-    }
-    return booleanToTypedValue(x.every((val, index) => toJsBoolean(fhirPathEquals(val, y[index]))));
-}
-/**
- * Determines if two values are equal according to FHIRPath equality rules.
- * @param x The first value.
- * @param y The second value.
- * @returns True if equal.
- */
-function fhirPathEquals(x, y) {
-    const xValue = x.value;
-    const yValue = y.value;
-    if (typeof xValue === 'number' && typeof yValue === 'number') {
-        return booleanToTypedValue(Math.abs(xValue - yValue) < 1e-8);
-    }
-    if (isQuantity(xValue) && isQuantity(yValue)) {
-        return booleanToTypedValue(isQuantityEquivalent(xValue, yValue));
-    }
-    if (typeof xValue === 'object' && typeof yValue === 'object') {
-        return booleanToTypedValue(deepEquals(x, y));
-    }
-    return booleanToTypedValue(xValue === yValue);
-}
-/**
- * Determines if two arrays are equivalent according to FHIRPath equality rules.
- * @param x The first array.
- * @param y The second array.
- * @returns FHIRPath true if the arrays are equivalent.
- */
-function fhirPathArrayEquivalent(x, y) {
-    if (x.length === 0 && y.length === 0) {
-        return booleanToTypedValue(true);
-    }
-    if (x.length !== y.length) {
-        return booleanToTypedValue(false);
-    }
-    x.sort(fhirPathEquivalentCompare);
-    y.sort(fhirPathEquivalentCompare);
-    return booleanToTypedValue(x.every((val, index) => toJsBoolean(fhirPathEquivalent(val, y[index]))));
-}
-/**
- * Determines if two values are equivalent according to FHIRPath equality rules.
- * @param x The first value.
- * @param y The second value.
- * @returns True if equivalent.
- */
-function fhirPathEquivalent(x, y) {
-    const xValue = x.value;
-    const yValue = y.value;
-    if (typeof xValue === 'number' && typeof yValue === 'number') {
-        // Use more generous threshold than equality
-        // Decimal: values must be equal, comparison is done on values rounded to the precision of the least precise operand.
-        // Trailing zeroes after the decimal are ignored in determining precision.
-        return booleanToTypedValue(Math.abs(xValue - yValue) < 0.01);
-    }
-    if (isQuantity(xValue) && isQuantity(yValue)) {
-        return booleanToTypedValue(isQuantityEquivalent(xValue, yValue));
-    }
-    if (typeof xValue === 'object' && typeof yValue === 'object') {
-        return booleanToTypedValue(deepEquals(xValue, yValue));
-    }
-    if (typeof xValue === 'string' && typeof yValue === 'string') {
-        // String: the strings must be the same, ignoring case and locale, and normalizing whitespace
-        // (see String Equivalence for more details).
-        return booleanToTypedValue(xValue.toLowerCase() === yValue.toLowerCase());
-    }
-    return booleanToTypedValue(xValue === yValue);
-}
-/**
- * Returns the sort order of two values for FHIRPath array equivalence.
- * @param x The first value.
- * @param y The second value.
- * @returns The sort order of the values.
- */
-function fhirPathEquivalentCompare(x, y) {
-    const xValue = x.value;
-    const yValue = y.value;
-    if (typeof xValue === 'number' && typeof yValue === 'number') {
-        return xValue - yValue;
-    }
-    if (typeof xValue === 'string' && typeof yValue === 'string') {
-        return xValue.localeCompare(yValue);
-    }
-    return 0;
-}
-/**
- * Determines if the typed value is the desired type.
- * @param typedValue The typed value to check.
- * @param desiredType The desired type name.
- * @returns True if the typed value is of the desired type.
- */
-function fhirPathIs(typedValue, desiredType) {
-    const { value } = typedValue;
-    if (value === undefined || value === null) {
-        return false;
-    }
-    switch (desiredType) {
-        case 'Boolean':
-            return typeof value === 'boolean';
-        case 'Decimal':
-        case 'Integer':
-            return typeof value === 'number';
-        case 'Date':
-            return typeof value === 'string' && !!value.match(/^\d{4}(-\d{2}(-\d{2})?)?/);
-        case 'DateTime':
-            return typeof value === 'string' && !!value.match(/^\d{4}(-\d{2}(-\d{2})?)?T/);
-        case 'Time':
-            return typeof value === 'string' && !!value.match(/^T\d/);
-        case 'Period':
-            return isPeriod(value);
-        case 'Quantity':
-            return isQuantity(value);
-        default:
-            return typeof value === 'object' && value?.resourceType === desiredType;
-    }
-}
-/**
- * Determines if the input is a Period object.
- * This is heuristic based, as we do not have strong typing at runtime.
- * @param input The input value.
- * @returns True if the input is a period.
- */
-function isPeriod(input) {
-    return !!(input && typeof input === 'object' && 'start' in input);
-}
-/**
- * Determines if the input is a Quantity object.
- * This is heuristic based, as we do not have strong typing at runtime.
- * @param input The input value.
- * @returns True if the input is a quantity.
- */
-function isQuantity(input) {
-    return !!(input && typeof input === 'object' && 'value' in input && typeof input.value === 'number');
-}
-function isQuantityEquivalent(x, y) {
-    return (Math.abs(x.value - y.value) < 0.01 &&
-        (x.unit === y.unit || x.code === y.code || x.unit === y.code || x.code === y.unit));
-}
-/**
- * Resource equality.
- * See: https://dmitripavlutin.com/how-to-compare-objects-in-javascript/#4-deep-equality
- * @param object1 The first object.
- * @param object2 The second object.
- * @returns True if the objects are equal.
- */
-function deepEquals(object1, object2) {
-    const keys1 = Object.keys(object1);
-    const keys2 = Object.keys(object2);
-    if (keys1.length !== keys2.length) {
-        return false;
-    }
-    for (const key of keys1) {
-        const val1 = object1[key];
-        const val2 = object2[key];
-        if (isObject(val1) && isObject(val2)) {
-            if (!deepEquals(val1, val2)) {
-                return false;
-            }
-        }
-        else {
-            if (val1 !== val2) {
-                return false;
-            }
-        }
-    }
-    return true;
-}
-function isObject(obj) {
-    return obj !== null && typeof obj === 'object';
-}
-
-export { booleanToTypedValue, fhirPathArrayEquals, fhirPathArrayEquivalent, fhirPathEquals, fhirPathEquivalent, fhirPathIs, fhirPathNot, getTypedPropertyValue, isPeriod, isQuantity, isQuantityEquivalent, removeDuplicates, toJsBoolean, toTypedValue };
-//# sourceMappingURL=utils.mjs.map

package/dist/esm/fhirpath/utils.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"utils.mjs","sources":["../../../src/fhirpath/utils.ts"],"sourcesContent":["import { ElementDefinition, Period, Quantity } from '@medplum/fhirtypes';\nimport { buildTypeName, getElementDefinition, isResource, PropertyType, TypedValue } from '../types';\nimport { capitalize, isEmpty } from '../utils';\n\n/**\n * Returns a single element array with a typed boolean value.\n * @param value The primitive boolean value.\n * @returns Single element array with a typed boolean value.\n */\nexport function booleanToTypedValue(value: boolean): [TypedValue] {\n  return [{ type: PropertyType.boolean, value }];\n}\n\n/**\n * Returns a \"best guess\" TypedValue for a given value.\n * @param value The unknown value to check.\n * @returns A \"best guess\" TypedValue for the given value.\n */\nexport function toTypedValue(value: unknown): TypedValue {\n  if (value === null || value === undefined) {\n    return { type: 'undefined', value: undefined };\n  } else if (Number.isSafeInteger(value)) {\n    return { type: PropertyType.integer, value };\n  } else if (typeof value === 'number') {\n    return { type: PropertyType.decimal, value };\n  } else if (typeof value === 'boolean') {\n    return { type: PropertyType.boolean, value };\n  } else if (typeof value === 'string') {\n    return { type: PropertyType.string, value };\n  } else if (isQuantity(value)) {\n    return { type: PropertyType.Quantity, value };\n  } else if (isResource(value)) {\n    return { type: value.resourceType, value };\n  } else {\n    return { type: PropertyType.BackboneElement, value };\n  }\n}\n\n/**\n * Converts unknown object into a JavaScript boolean.\n * Note that this is different than the FHIRPath \"toBoolean\",\n * which has particular semantics around arrays, empty arrays, and type conversions.\n * @param obj Any value or array of values.\n * @returns The converted boolean value according to FHIRPath rules.\n */\nexport function toJsBoolean(obj: TypedValue[]): boolean {\n  return obj.length === 0 ? false : !!obj[0].value;\n}\n\n/**\n * Returns the value of the property and the property type.\n * Some property definitions support multiple types.\n * For example, \"Observation.value[x]\" can be \"valueString\", \"valueInteger\", \"valueQuantity\", etc.\n * According to the spec, there can only be one property for a given element definition.\n * This function returns the value and the type.\n * @param input The base context (FHIR resource or backbone element).\n * @param path The property path.\n * @returns The value of the property and the property type.\n */\nexport function getTypedPropertyValue(input: TypedValue, path: string): TypedValue[] | TypedValue | undefined {\n  if (!input?.value) {\n    return undefined;\n  }\n\n  const elementDefinition = getElementDefinition(input.type, path);\n  if (elementDefinition) {\n    const typedResult = getTypedPropertyValueWithSchema(input, path, elementDefinition);\n    if (typedResult) {\n      return typedResult;\n    }\n  }\n\n  return getTypedPropertyValueWithoutSchema(input, path);\n}\n\n/**\n * Returns the value of the property and the property type using a type schema.\n * @param input The base context (FHIR resource or backbone element).\n * @param path The property path.\n * @param property The property element definition.\n * @returns The value of the property and the property type.\n */\nfunction getTypedPropertyValueWithSchema(\n  input: TypedValue,\n  path: string,\n  property: ElementDefinition\n): TypedValue[] | TypedValue | undefined {\n  const types = property.type;\n  if (!types || types.length === 0) {\n    return undefined;\n  }\n\n  let resultValue: any = undefined;\n  let resultType = 'undefined';\n\n  if (types.length === 1) {\n    resultValue = input.value[path];\n    resultType = types[0].code as string;\n  } else {\n    for (const type of types) {\n      const path2 = path.replace('[x]', '') + capitalize(type.code as string);\n      if (path2 in input.value) {\n        resultValue = input.value[path2];\n        resultType = type.code as string;\n        break;\n      }\n    }\n  }\n\n  if (isEmpty(resultValue)) {\n    return undefined;\n  }\n\n  if (resultType === 'Element' || resultType === 'BackboneElement') {\n    resultType = buildTypeName(property.path?.split('.') as string[]);\n  }\n\n  if (Array.isArray(resultValue)) {\n    return resultValue.map((element) => toTypedValueWithType(element, resultType));\n  } else {\n    return toTypedValueWithType(resultValue, resultType);\n  }\n}\n\nfunction toTypedValueWithType(value: any, type: string): TypedValue {\n  if (type === 'Resource' && isResource(value)) {\n    type = value.resourceType;\n  }\n  return { type, value };\n}\n\n/**\n * Returns the value of the property and the property type using a type schema.\n * Note that because the type schema is not available, this function may be inaccurate.\n * In some cases, that is the desired behavior.\n * @param typedValue The base context (FHIR resource or backbone element).\n * @param path The property path.\n * @returns The value of the property and the property type.\n */\nfunction getTypedPropertyValueWithoutSchema(\n  typedValue: TypedValue,\n  path: string\n): TypedValue[] | TypedValue | undefined {\n  const input = typedValue.value;\n  if (!input || typeof input !== 'object') {\n    return undefined;\n  }\n\n  let result: any = undefined;\n  if (path in input) {\n    result = (input as { [key: string]: unknown })[path];\n  } else {\n    // Only support property names that would be valid types\n    // Examples:\n    // value + valueString = ok, because \"string\" is valid\n    // value + valueDecimal = ok, because \"decimal\" is valid\n    // id + identifier = not ok, because \"entifier\" is not a valid type\n    // resource + resourceType = not ok, because \"type\" is not a valid type\n    for (const propertyType in PropertyType) {\n      const propertyName = path + capitalize(propertyType);\n      if (propertyName in input) {\n        result = (input as { [key: string]: unknown })[propertyName];\n        break;\n      }\n    }\n  }\n\n  if (isEmpty(result)) {\n    return undefined;\n  }\n\n  if (Array.isArray(result)) {\n    return result.map(toTypedValue);\n  } else {\n    return toTypedValue(result);\n  }\n}\n\n/**\n * Removes duplicates in array using FHIRPath equality rules.\n * @param arr The input array.\n * @returns The result array with duplicates removed.\n */\nexport function removeDuplicates(arr: TypedValue[]): TypedValue[] {\n  const result: TypedValue[] = [];\n  for (const i of arr) {\n    let found = false;\n    for (const j of result) {\n      if (toJsBoolean(fhirPathEquals(i, j))) {\n        found = true;\n        break;\n      }\n    }\n    if (!found) {\n      result.push(i);\n    }\n  }\n  return result;\n}\n\n/**\n * Returns a negated FHIRPath boolean expression.\n * @param input The input array.\n * @returns The negated type value array.\n */\nexport function fhirPathNot(input: TypedValue[]): TypedValue[] {\n  return booleanToTypedValue(!toJsBoolean(input));\n}\n\n/**\n * Determines if two arrays are equal according to FHIRPath equality rules.\n * @param x The first array.\n * @param y The second array.\n * @returns FHIRPath true if the arrays are equal.\n */\nexport function fhirPathArrayEquals(x: TypedValue[], y: TypedValue[]): TypedValue[] {\n  if (x.length === 0 || y.length === 0) {\n    return [];\n  }\n  if (x.length !== y.length) {\n    return booleanToTypedValue(false);\n  }\n  return booleanToTypedValue(x.every((val, index) => toJsBoolean(fhirPathEquals(val, y[index]))));\n}\n\n/**\n * Determines if two values are equal according to FHIRPath equality rules.\n * @param x The first value.\n * @param y The second value.\n * @returns True if equal.\n */\nexport function fhirPathEquals(x: TypedValue, y: TypedValue): TypedValue[] {\n  const xValue = x.value;\n  const yValue = y.value;\n  if (typeof xValue === 'number' && typeof yValue === 'number') {\n    return booleanToTypedValue(Math.abs(xValue - yValue) < 1e-8);\n  }\n  if (isQuantity(xValue) && isQuantity(yValue)) {\n    return booleanToTypedValue(isQuantityEquivalent(xValue, yValue));\n  }\n  if (typeof xValue === 'object' && typeof yValue === 'object') {\n    return booleanToTypedValue(deepEquals(x, y));\n  }\n  return booleanToTypedValue(xValue === yValue);\n}\n\n/**\n * Determines if two arrays are equivalent according to FHIRPath equality rules.\n * @param x The first array.\n * @param y The second array.\n * @returns FHIRPath true if the arrays are equivalent.\n */\nexport function fhirPathArrayEquivalent(x: TypedValue[], y: TypedValue[]): TypedValue[] {\n  if (x.length === 0 && y.length === 0) {\n    return booleanToTypedValue(true);\n  }\n  if (x.length !== y.length) {\n    return booleanToTypedValue(false);\n  }\n  x.sort(fhirPathEquivalentCompare);\n  y.sort(fhirPathEquivalentCompare);\n  return booleanToTypedValue(x.every((val, index) => toJsBoolean(fhirPathEquivalent(val, y[index]))));\n}\n\n/**\n * Determines if two values are equivalent according to FHIRPath equality rules.\n * @param x The first value.\n * @param y The second value.\n * @returns True if equivalent.\n */\nexport function fhirPathEquivalent(x: TypedValue, y: TypedValue): TypedValue[] {\n  const xValue = x.value;\n  const yValue = y.value;\n  if (typeof xValue === 'number' && typeof yValue === 'number') {\n    // Use more generous threshold than equality\n    // Decimal: values must be equal, comparison is done on values rounded to the precision of the least precise operand.\n    // Trailing zeroes after the decimal are ignored in determining precision.\n    return booleanToTypedValue(Math.abs(xValue - yValue) < 0.01);\n  }\n  if (isQuantity(xValue) && isQuantity(yValue)) {\n    return booleanToTypedValue(isQuantityEquivalent(xValue, yValue));\n  }\n  if (typeof xValue === 'object' && typeof yValue === 'object') {\n    return booleanToTypedValue(deepEquals(xValue, yValue));\n  }\n  if (typeof xValue === 'string' && typeof yValue === 'string') {\n    // String: the strings must be the same, ignoring case and locale, and normalizing whitespace\n    // (see String Equivalence for more details).\n    return booleanToTypedValue(xValue.toLowerCase() === yValue.toLowerCase());\n  }\n  return booleanToTypedValue(xValue === yValue);\n}\n\n/**\n * Returns the sort order of two values for FHIRPath array equivalence.\n * @param x The first value.\n * @param y The second value.\n * @returns The sort order of the values.\n */\nfunction fhirPathEquivalentCompare(x: TypedValue, y: TypedValue): number {\n  const xValue = x.value;\n  const yValue = y.value;\n  if (typeof xValue === 'number' && typeof yValue === 'number') {\n    return xValue - yValue;\n  }\n  if (typeof xValue === 'string' && typeof yValue === 'string') {\n    return xValue.localeCompare(yValue);\n  }\n  return 0;\n}\n\n/**\n * Determines if the typed value is the desired type.\n * @param typedValue The typed value to check.\n * @param desiredType The desired type name.\n * @returns True if the typed value is of the desired type.\n */\nexport function fhirPathIs(typedValue: TypedValue, desiredType: string): boolean {\n  const { value } = typedValue;\n  if (value === undefined || value === null) {\n    return false;\n  }\n\n  switch (desiredType) {\n    case 'Boolean':\n      return typeof value === 'boolean';\n    case 'Decimal':\n    case 'Integer':\n      return typeof value === 'number';\n    case 'Date':\n      return typeof value === 'string' && !!value.match(/^\\d{4}(-\\d{2}(-\\d{2})?)?/);\n    case 'DateTime':\n      return typeof value === 'string' && !!value.match(/^\\d{4}(-\\d{2}(-\\d{2})?)?T/);\n    case 'Time':\n      return typeof value === 'string' && !!value.match(/^T\\d/);\n    case 'Period':\n      return isPeriod(value);\n    case 'Quantity':\n      return isQuantity(value);\n    default:\n      return typeof value === 'object' && value?.resourceType === desiredType;\n  }\n}\n\n/**\n * Determines if the input is a Period object.\n * This is heuristic based, as we do not have strong typing at runtime.\n * @param input The input value.\n * @returns True if the input is a period.\n */\nexport function isPeriod(input: unknown): input is Period {\n  return !!(input && typeof input === 'object' && 'start' in input);\n}\n\n/**\n * Determines if the input is a Quantity object.\n * This is heuristic based, as we do not have strong typing at runtime.\n * @param input The input value.\n * @returns True if the input is a quantity.\n */\nexport function isQuantity(input: unknown): input is Quantity {\n  return !!(input && typeof input === 'object' && 'value' in input && typeof (input as Quantity).value === 'number');\n}\n\nexport function isQuantityEquivalent(x: Quantity, y: Quantity): boolean {\n  return (\n    Math.abs((x.value as number) - (y.value as number)) < 0.01 &&\n    (x.unit === y.unit || x.code === y.code || x.unit === y.code || x.code === y.unit)\n  );\n}\n\n/**\n * Resource equality.\n * See: https://dmitripavlutin.com/how-to-compare-objects-in-javascript/#4-deep-equality\n * @param object1 The first object.\n * @param object2 The second object.\n * @returns True if the objects are equal.\n */\nfunction deepEquals<T1 extends object, T2 extends object>(object1: T1, object2: T2): boolean {\n  const keys1 = Object.keys(object1) as (keyof T1)[];\n  const keys2 = Object.keys(object2) as (keyof T2)[];\n  if (keys1.length !== keys2.length) {\n    return false;\n  }\n  for (const key of keys1) {\n    const val1 = object1[key] as unknown;\n    const val2 = object2[key as unknown as keyof T2] as unknown;\n    if (isObject(val1) && isObject(val2)) {\n      if (!deepEquals(val1, val2)) {\n        return false;\n      }\n    } else {\n      if (val1 !== val2) {\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\nfunction isObject(obj: unknown): obj is object {\n  return obj !== null && typeof obj === 'object';\n}\n"],"names":[],"mappings":";;;AAIA;;;;AAIG;AACG,SAAU,mBAAmB,CAAC,KAAc,EAAA;IAChD,OAAO,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;AACjD,CAAC;AAED;;;;AAIG;AACG,SAAU,YAAY,CAAC,KAAc,EAAA;AACzC,IAAA,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE;QACzC,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;AAChD,KAAA;AAAM,SAAA,IAAI,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE;QACtC,OAAO,EAAE,IAAI,EAAE,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC;AAC9C,KAAA;AAAM,SAAA,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QACpC,OAAO,EAAE,IAAI,EAAE,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC;AAC9C,KAAA;AAAM,SAAA,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE;QACrC,OAAO,EAAE,IAAI,EAAE,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC;AAC9C,KAAA;AAAM,SAAA,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QACpC,OAAO,EAAE,IAAI,EAAE,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC;AAC7C,KAAA;AAAM,SAAA,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE;QAC5B,OAAO,EAAE,IAAI,EAAE,YAAY,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC;AAC/C,KAAA;AAAM,SAAA,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE;QAC5B,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,KAAK,EAAE,CAAC;AAC5C,KAAA;AAAM,SAAA;QACL,OAAO,EAAE,IAAI,EAAE,YAAY,CAAC,eAAe,EAAE,KAAK,EAAE,CAAC;AACtD,KAAA;AACH,CAAC;AAED;;;;;;AAMG;AACG,SAAU,WAAW,CAAC,GAAiB,EAAA;IAC3C,OAAO,GAAG,CAAC,MAAM,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AACnD,CAAC;AAED;;;;;;;;;AASG;AACa,SAAA,qBAAqB,CAAC,KAAiB,EAAE,IAAY,EAAA;AACnE,IAAA,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE;AACjB,QAAA,OAAO,SAAS,CAAC;AAClB,KAAA;IAED,MAAM,iBAAiB,GAAG,oBAAoB,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACjE,IAAA,IAAI,iBAAiB,EAAE;QACrB,MAAM,WAAW,GAAG,+BAA+B,CAAC,KAAK,EAAE,IAAI,EAAE,iBAAiB,CAAC,CAAC;AACpF,QAAA,IAAI,WAAW,EAAE;AACf,YAAA,OAAO,WAAW,CAAC;AACpB,SAAA;AACF,KAAA;AAED,IAAA,OAAO,kCAAkC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACzD,CAAC;AAED;;;;;;AAMG;AACH,SAAS,+BAA+B,CACtC,KAAiB,EACjB,IAAY,EACZ,QAA2B,EAAA;AAE3B,IAAA,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC;IAC5B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;AAChC,QAAA,OAAO,SAAS,CAAC;AAClB,KAAA;IAED,IAAI,WAAW,GAAQ,SAAS,CAAC;IACjC,IAAI,UAAU,GAAG,WAAW,CAAC;AAE7B,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;AACtB,QAAA,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AAChC,QAAA,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAc,CAAC;AACtC,KAAA;AAAM,SAAA;AACL,QAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AACxB,YAAA,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC;AACxE,YAAA,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE;AACxB,gBAAA,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACjC,gBAAA,UAAU,GAAG,IAAI,CAAC,IAAc,CAAC;gBACjC,MAAM;AACP,aAAA;AACF,SAAA;AACF,KAAA;AAED,IAAA,IAAI,OAAO,CAAC,WAAW,CAAC,EAAE;AACxB,QAAA,OAAO,SAAS,CAAC;AAClB,KAAA;AAED,IAAA,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,KAAK,iBAAiB,EAAE;AAChE,QAAA,UAAU,GAAG,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAa,CAAC,CAAC;AACnE,KAAA;AAED,IAAA,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;AAC9B,QAAA,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC,OAAO,KAAK,oBAAoB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC;AAChF,KAAA;AAAM,SAAA;AACL,QAAA,OAAO,oBAAoB,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;AACtD,KAAA;AACH,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAU,EAAE,IAAY,EAAA;IACpD,IAAI,IAAI,KAAK,UAAU,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE;AAC5C,QAAA,IAAI,GAAG,KAAK,CAAC,YAAY,CAAC;AAC3B,KAAA;AACD,IAAA,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACzB,CAAC;AAED;;;;;;;AAOG;AACH,SAAS,kCAAkC,CACzC,UAAsB,EACtB,IAAY,EAAA;AAEZ,IAAA,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC;AAC/B,IAAA,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;AACvC,QAAA,OAAO,SAAS,CAAC;AAClB,KAAA;IAED,IAAI,MAAM,GAAQ,SAAS,CAAC;IAC5B,IAAI,IAAI,IAAI,KAAK,EAAE;AACjB,QAAA,MAAM,GAAI,KAAoC,CAAC,IAAI,CAAC,CAAC;AACtD,KAAA;AAAM,SAAA;;;;;;;AAOL,QAAA,KAAK,MAAM,YAAY,IAAI,YAAY,EAAE;YACvC,MAAM,YAAY,GAAG,IAAI,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;YACrD,IAAI,YAAY,IAAI,KAAK,EAAE;AACzB,gBAAA,MAAM,GAAI,KAAoC,CAAC,YAAY,CAAC,CAAC;gBAC7D,MAAM;AACP,aAAA;AACF,SAAA;AACF,KAAA;AAED,IAAA,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE;AACnB,QAAA,OAAO,SAAS,CAAC;AAClB,KAAA;AAED,IAAA,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;AACzB,QAAA,OAAO,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;AACjC,KAAA;AAAM,SAAA;AACL,QAAA,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;AAC7B,KAAA;AACH,CAAC;AAED;;;;AAIG;AACG,SAAU,gBAAgB,CAAC,GAAiB,EAAA;IAChD,MAAM,MAAM,GAAiB,EAAE,CAAC;AAChC,IAAA,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE;QACnB,IAAI,KAAK,GAAG,KAAK,CAAC;AAClB,QAAA,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE;YACtB,IAAI,WAAW,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;gBACrC,KAAK,GAAG,IAAI,CAAC;gBACb,MAAM;AACP,aAAA;AACF,SAAA;QACD,IAAI,CAAC,KAAK,EAAE;AACV,YAAA,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAChB,SAAA;AACF,KAAA;AACD,IAAA,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;AAIG;AACG,SAAU,WAAW,CAAC,KAAmB,EAAA;IAC7C,OAAO,mBAAmB,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;AAClD,CAAC;AAED;;;;;AAKG;AACa,SAAA,mBAAmB,CAAC,CAAe,EAAE,CAAe,EAAA;IAClE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE;AACpC,QAAA,OAAO,EAAE,CAAC;AACX,KAAA;AACD,IAAA,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE;AACzB,QAAA,OAAO,mBAAmB,CAAC,KAAK,CAAC,CAAC;AACnC,KAAA;IACD,OAAO,mBAAmB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,KAAK,KAAK,WAAW,CAAC,cAAc,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClG,CAAC;AAED;;;;;AAKG;AACa,SAAA,cAAc,CAAC,CAAa,EAAE,CAAa,EAAA;AACzD,IAAA,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC;AACvB,IAAA,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC;IACvB,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;AAC5D,QAAA,OAAO,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC;AAC9D,KAAA;IACD,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE;QAC5C,OAAO,mBAAmB,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AAClE,KAAA;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;QAC5D,OAAO,mBAAmB,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9C,KAAA;AACD,IAAA,OAAO,mBAAmB,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;AAChD,CAAC;AAED;;;;;AAKG;AACa,SAAA,uBAAuB,CAAC,CAAe,EAAE,CAAe,EAAA;IACtE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE;AACpC,QAAA,OAAO,mBAAmB,CAAC,IAAI,CAAC,CAAC;AAClC,KAAA;AACD,IAAA,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE;AACzB,QAAA,OAAO,mBAAmB,CAAC,KAAK,CAAC,CAAC;AACnC,KAAA;AACD,IAAA,CAAC,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;AAClC,IAAA,CAAC,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;IAClC,OAAO,mBAAmB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,KAAK,KAAK,WAAW,CAAC,kBAAkB,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtG,CAAC;AAED;;;;;AAKG;AACa,SAAA,kBAAkB,CAAC,CAAa,EAAE,CAAa,EAAA;AAC7D,IAAA,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC;AACvB,IAAA,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC;IACvB,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;;;;AAI5D,QAAA,OAAO,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC;AAC9D,KAAA;IACD,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE;QAC5C,OAAO,mBAAmB,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AAClE,KAAA;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;QAC5D,OAAO,mBAAmB,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AACxD,KAAA;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;;;AAG5D,QAAA,OAAO,mBAAmB,CAAC,MAAM,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;AAC3E,KAAA;AACD,IAAA,OAAO,mBAAmB,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;AAChD,CAAC;AAED;;;;;AAKG;AACH,SAAS,yBAAyB,CAAC,CAAa,EAAE,CAAa,EAAA;AAC7D,IAAA,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC;AACvB,IAAA,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC;IACvB,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;QAC5D,OAAO,MAAM,GAAG,MAAM,CAAC;AACxB,KAAA;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;AAC5D,QAAA,OAAO,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;AACrC,KAAA;AACD,IAAA,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;AAKG;AACa,SAAA,UAAU,CAAC,UAAsB,EAAE,WAAmB,EAAA;AACpE,IAAA,MAAM,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC;AAC7B,IAAA,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;AACzC,QAAA,OAAO,KAAK,CAAC;AACd,KAAA;AAED,IAAA,QAAQ,WAAW;AACjB,QAAA,KAAK,SAAS;AACZ,YAAA,OAAO,OAAO,KAAK,KAAK,SAAS,CAAC;AACpC,QAAA,KAAK,SAAS,CAAC;AACf,QAAA,KAAK,SAAS;AACZ,YAAA,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC;AACnC,QAAA,KAAK,MAAM;AACT,YAAA,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;AAChF,QAAA,KAAK,UAAU;AACb,YAAA,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC;AACjF,QAAA,KAAK,MAAM;AACT,YAAA,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AAC5D,QAAA,KAAK,QAAQ;AACX,YAAA,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;AACzB,QAAA,KAAK,UAAU;AACb,YAAA,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC;AAC3B,QAAA;YACE,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,EAAE,YAAY,KAAK,WAAW,CAAC;AAC3E,KAAA;AACH,CAAC;AAED;;;;;AAKG;AACG,SAAU,QAAQ,CAAC,KAAc,EAAA;AACrC,IAAA,OAAO,CAAC,EAAE,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,CAAC,CAAC;AACpE,CAAC;AAED;;;;;AAKG;AACG,SAAU,UAAU,CAAC,KAAc,EAAA;IACvC,OAAO,CAAC,EAAE,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,IAAI,OAAQ,KAAkB,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC;AACrH,CAAC;AAEe,SAAA,oBAAoB,CAAC,CAAW,EAAE,CAAW,EAAA;AAC3D,IAAA,QACE,IAAI,CAAC,GAAG,CAAE,CAAC,CAAC,KAAgB,GAAI,CAAC,CAAC,KAAgB,CAAC,GAAG,IAAI;AAC1D,SAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,EAClF;AACJ,CAAC;AAED;;;;;;AAMG;AACH,SAAS,UAAU,CAAuC,OAAW,EAAE,OAAW,EAAA;IAChF,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAiB,CAAC;IACnD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAiB,CAAC;AACnD,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE;AACjC,QAAA,OAAO,KAAK,CAAC;AACd,KAAA;AACD,IAAA,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE;AACvB,QAAA,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAY,CAAC;AACrC,QAAA,MAAM,IAAI,GAAG,OAAO,CAAC,GAA0B,CAAY,CAAC;QAC5D,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE;AACpC,YAAA,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE;AAC3B,gBAAA,OAAO,KAAK,CAAC;AACd,aAAA;AACF,SAAA;AAAM,aAAA;YACL,IAAI,IAAI,KAAK,IAAI,EAAE;AACjB,gBAAA,OAAO,KAAK,CAAC;AACd,aAAA;AACF,SAAA;AACF,KAAA;AACD,IAAA,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,QAAQ,CAAC,GAAY,EAAA;IAC5B,OAAO,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,CAAC;AACjD;;;;"}

package/dist/esm/filter/parse.mjs

@@ -1,101 +0,0 @@
-import '../types.mjs';
-import '../utils.mjs';
-import { initFhirPathParserBuilder } from '../fhirpath/parse.mjs';
-import { OperationOutcomeError, badRequest } from '../outcomes.mjs';
-import { Operator } from '../search/search.mjs';
-import { tokenize } from './tokenize.mjs';
-import { FhirFilterNegation, FhirFilterComparison, FhirFilterConnective } from './types.mjs';
-
-/**
- * The operatorMap maps FHIR _filter operators to Medplum search operators.
- * See _filter operators: https://www.hl7.org/fhir/search_filter.html#ops
- */
-const operatorMap = {
-    // eq - an item in the set has an equal value
-    eq: Operator.EQUALS,
-    // ne - An item in the set has an unequal value
-    ne: Operator.NOT_EQUALS,
-    // co - An item in the set contains this value
-    co: Operator.CONTAINS,
-    // sw - An item in the set starts with this value
-    sw: undefined,
-    // ew - An item in the set ends with this value
-    ew: undefined,
-    // gt / lt / ge / le - A value in the set is (greater than, less than, greater or equal, less or equal) the given value
-    gt: Operator.GREATER_THAN,
-    lt: Operator.LESS_THAN,
-    ge: Operator.GREATER_THAN_OR_EQUALS,
-    le: Operator.LESS_THAN_OR_EQUALS,
-    // ap - A value in the set is approximately the same as this value.
-    // Note that the recommended value for the approximation is 10% of the stated value (or for a date, 10% of the gap between now and the date), but systems may choose other values where appropriate
-    ap: Operator.APPROXIMATELY,
-    // sa - The value starts after the specified value
-    sa: Operator.STARTS_AFTER,
-    // eb - The value ends before the specified value
-    eb: Operator.ENDS_BEFORE,
-    // pr - The set is empty or not (value is false or true)
-    pr: Operator.MISSING,
-    // po - True if a (implied) date period in the set overlaps with the implied period in the value
-    po: undefined,
-    // ss - True if the value subsumes a concept in the set
-    ss: undefined,
-    // sb - True if the value is subsumed by a concept in the set
-    sb: undefined,
-    // in - True if one of the concepts is in the nominated value set by URI, either a relative, literal or logical vs
-    in: Operator.IN,
-    // ni - True if none of the concepts are in the nominated value set by URI, either a relative, literal or logical vs
-    ni: Operator.NOT_IN,
-    // re - True if one of the references in set points to the given URL
-    re: undefined,
-    // identifier - True if the identifier is in the identifier set (Medplum extension)
-    identifier: Operator.IDENTIFIER,
-};
-function getOperator(value) {
-    const operator = operatorMap[value];
-    if (!operator) {
-        throw new OperationOutcomeError(badRequest('Invalid operator: ' + value));
-    }
-    return operator;
-}
-class FilterParameterParser {
-    constructor(parser) {
-        this.parser = parser;
-    }
-    parse() {
-        let result;
-        if (this.parser.peek()?.value === '(') {
-            this.parser.consume('(');
-            result = this.parse();
-            this.parser.consume(')');
-        }
-        else if (this.parser.peek()?.value === 'not') {
-            this.parser.consume('Symbol', 'not');
-            this.parser.consume('(');
-            result = new FhirFilterNegation(this.parse());
-            this.parser.consume(')');
-        }
-        else {
-            result = new FhirFilterComparison(this.parser.consume('Symbol').value, getOperator(this.parser.consume('Symbol').value), this.parser.consume().value);
-        }
-        const next = this.parser.peek()?.value;
-        if (next === 'and' || next === 'or') {
-            this.parser.consume('Symbol', next);
-            return new FhirFilterConnective(next, result, this.parse());
-        }
-        return result;
-    }
-}
-const fhirPathParserBuilder = initFhirPathParserBuilder();
-/**
- * Parses a FHIR _filter parameter expression into an AST.
- * @param input The FHIR _filter parameter expression.
- * @returns The AST representing the filters.
- */
-function parseFilterParameter(input) {
-    const parser = fhirPathParserBuilder.construct(tokenize(input));
-    parser.removeComments();
-    return new FilterParameterParser(parser).parse();
-}
-
-export { parseFilterParameter };
-//# sourceMappingURL=parse.mjs.map

package/dist/esm/filter/parse.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"parse.mjs","sources":["../../../src/filter/parse.ts"],"sourcesContent":["import { Parser } from '../fhirlexer';\nimport { initFhirPathParserBuilder } from '../fhirpath';\nimport { OperationOutcomeError, badRequest } from '../outcomes';\nimport { Operator } from '../search/search';\nimport { tokenize } from './tokenize';\nimport { FhirFilterComparison, FhirFilterConnective, FhirFilterExpression, FhirFilterNegation } from './types';\n\n/**\n * The operatorMap maps FHIR _filter operators to Medplum search operators.\n * See _filter operators: https://www.hl7.org/fhir/search_filter.html#ops\n */\nconst operatorMap: Record<string, Operator | undefined> = {\n  // eq - an item in the set has an equal value\n  eq: Operator.EQUALS,\n  // ne - An item in the set has an unequal value\n  ne: Operator.NOT_EQUALS,\n  // co - An item in the set contains this value\n  co: Operator.CONTAINS,\n  // sw - An item in the set starts with this value\n  sw: undefined,\n  // ew - An item in the set ends with this value\n  ew: undefined,\n  // gt / lt / ge / le - A value in the set is (greater than, less than, greater or equal, less or equal) the given value\n  gt: Operator.GREATER_THAN,\n  lt: Operator.LESS_THAN,\n  ge: Operator.GREATER_THAN_OR_EQUALS,\n  le: Operator.LESS_THAN_OR_EQUALS,\n  // ap - A value in the set is approximately the same as this value.\n  // Note that the recommended value for the approximation is 10% of the stated value (or for a date, 10% of the gap between now and the date), but systems may choose other values where appropriate\n  ap: Operator.APPROXIMATELY,\n  // sa - The value starts after the specified value\n  sa: Operator.STARTS_AFTER,\n  // eb - The value ends before the specified value\n  eb: Operator.ENDS_BEFORE,\n  // pr - The set is empty or not (value is false or true)\n  pr: Operator.MISSING,\n  // po - True if a (implied) date period in the set overlaps with the implied period in the value\n  po: undefined,\n  // ss - True if the value subsumes a concept in the set\n  ss: undefined,\n  // sb - True if the value is subsumed by a concept in the set\n  sb: undefined,\n  // in - True if one of the concepts is in the nominated value set by URI, either a relative, literal or logical vs\n  in: Operator.IN,\n  // ni - True if none of the concepts are in the nominated value set by URI, either a relative, literal or logical vs\n  ni: Operator.NOT_IN,\n  // re - True if one of the references in set points to the given URL\n  re: undefined,\n  // identifier - True if the identifier is in the identifier set (Medplum extension)\n  identifier: Operator.IDENTIFIER,\n};\n\nfunction getOperator(value: string): Operator {\n  const operator = operatorMap[value];\n  if (!operator) {\n    throw new OperationOutcomeError(badRequest('Invalid operator: ' + value));\n  }\n  return operator;\n}\n\nclass FilterParameterParser {\n  constructor(readonly parser: Parser) {}\n\n  parse(): FhirFilterExpression {\n    let result: FhirFilterExpression;\n\n    if (this.parser.peek()?.value === '(') {\n      this.parser.consume('(');\n      result = this.parse();\n      this.parser.consume(')');\n    } else if (this.parser.peek()?.value === 'not') {\n      this.parser.consume('Symbol', 'not');\n      this.parser.consume('(');\n      result = new FhirFilterNegation(this.parse());\n      this.parser.consume(')');\n    } else {\n      result = new FhirFilterComparison(\n        this.parser.consume('Symbol').value,\n        getOperator(this.parser.consume('Symbol').value),\n        this.parser.consume().value\n      );\n    }\n\n    const next = this.parser.peek()?.value;\n    if (next === 'and' || next === 'or') {\n      this.parser.consume('Symbol', next);\n      return new FhirFilterConnective(next, result, this.parse());\n    }\n\n    return result;\n  }\n}\n\nconst fhirPathParserBuilder = initFhirPathParserBuilder();\n\n/**\n * Parses a FHIR _filter parameter expression into an AST.\n * @param input The FHIR _filter parameter expression.\n * @returns The AST representing the filters.\n */\nexport function parseFilterParameter(input: string): FhirFilterExpression {\n  const parser = fhirPathParserBuilder.construct(tokenize(input));\n  parser.removeComments();\n  return new FilterParameterParser(parser).parse();\n}\n"],"names":[],"mappings":";;;;;;;;AAOA;;;AAGG;AACH,MAAM,WAAW,GAAyC;;IAExD,EAAE,EAAE,QAAQ,CAAC,MAAM;;IAEnB,EAAE,EAAE,QAAQ,CAAC,UAAU;;IAEvB,EAAE,EAAE,QAAQ,CAAC,QAAQ;;AAErB,IAAA,EAAE,EAAE,SAAS;;AAEb,IAAA,EAAE,EAAE,SAAS;;IAEb,EAAE,EAAE,QAAQ,CAAC,YAAY;IACzB,EAAE,EAAE,QAAQ,CAAC,SAAS;IACtB,EAAE,EAAE,QAAQ,CAAC,sBAAsB;IACnC,EAAE,EAAE,QAAQ,CAAC,mBAAmB;;;IAGhC,EAAE,EAAE,QAAQ,CAAC,aAAa;;IAE1B,EAAE,EAAE,QAAQ,CAAC,YAAY;;IAEzB,EAAE,EAAE,QAAQ,CAAC,WAAW;;IAExB,EAAE,EAAE,QAAQ,CAAC,OAAO;;AAEpB,IAAA,EAAE,EAAE,SAAS;;AAEb,IAAA,EAAE,EAAE,SAAS;;AAEb,IAAA,EAAE,EAAE,SAAS;;IAEb,EAAE,EAAE,QAAQ,CAAC,EAAE;;IAEf,EAAE,EAAE,QAAQ,CAAC,MAAM;;AAEnB,IAAA,EAAE,EAAE,SAAS;;IAEb,UAAU,EAAE,QAAQ,CAAC,UAAU;CAChC,CAAC;AAEF,SAAS,WAAW,CAAC,KAAa,EAAA;AAChC,IAAA,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,CAAC,QAAQ,EAAE;QACb,MAAM,IAAI,qBAAqB,CAAC,UAAU,CAAC,oBAAoB,GAAG,KAAK,CAAC,CAAC,CAAC;AAC3E,KAAA;AACD,IAAA,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,qBAAqB,CAAA;AACzB,IAAA,WAAA,CAAqB,MAAc,EAAA;QAAd,IAAM,CAAA,MAAA,GAAN,MAAM,CAAQ;KAAI;IAEvC,KAAK,GAAA;AACH,QAAA,IAAI,MAA4B,CAAC;QAEjC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,KAAK,KAAK,GAAG,EAAE;AACrC,YAAA,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;AACzB,YAAA,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;AACtB,YAAA,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;AAC1B,SAAA;aAAM,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,KAAK,KAAK,KAAK,EAAE;YAC9C,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AACrC,YAAA,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACzB,MAAM,GAAG,IAAI,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;AAC9C,YAAA,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;AAC1B,SAAA;AAAM,aAAA;AACL,YAAA,MAAM,GAAG,IAAI,oBAAoB,CAC/B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,KAAK,EACnC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,EAChD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,KAAK,CAC5B,CAAC;AACH,SAAA;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,KAAK,CAAC;AACvC,QAAA,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI,EAAE;YACnC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AACpC,YAAA,OAAO,IAAI,oBAAoB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;AAC7D,SAAA;AAED,QAAA,OAAO,MAAM,CAAC;KACf;AACF,CAAA;AAED,MAAM,qBAAqB,GAAG,yBAAyB,EAAE,CAAC;AAE1D;;;;AAIG;AACG,SAAU,oBAAoB,CAAC,KAAa,EAAA;IAChD,MAAM,MAAM,GAAG,qBAAqB,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAChE,MAAM,CAAC,cAAc,EAAE,CAAC;IACxB,OAAO,IAAI,qBAAqB,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC;AACnD;;;;"}

package/dist/esm/filter/tokenize.mjs

@@ -1,16 +0,0 @@
-import { Tokenizer } from '../fhirlexer/tokenize.mjs';
-import '../types.mjs';
-import '../utils.mjs';
-import '../fhirpath/parse.mjs';
-import { FHIRPATH_OPERATORS, FHIRPATH_KEYWORDS } from '../fhirpath/tokenize.mjs';
-
-const MAPPING_LANGUAGE_OPERATORS = [...FHIRPATH_OPERATORS, 'eq', 'ne', 'co'];
-function tokenize(str) {
-    return new Tokenizer(str, FHIRPATH_KEYWORDS, MAPPING_LANGUAGE_OPERATORS, {
-        dateTimeLiterals: true,
-        symbolRegex: /[^\s\])]/,
-    }).tokenize();
-}
-
-export { tokenize };
-//# sourceMappingURL=tokenize.mjs.map

package/dist/esm/filter/tokenize.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"tokenize.mjs","sources":["../../../src/filter/tokenize.ts"],"sourcesContent":["import { Token, Tokenizer } from '../fhirlexer';\nimport { FHIRPATH_KEYWORDS, FHIRPATH_OPERATORS } from '../fhirpath';\n\nconst MAPPING_LANGUAGE_OPERATORS = [...FHIRPATH_OPERATORS, 'eq', 'ne', 'co'];\n\nexport function tokenize(str: string): Token[] {\n  return new Tokenizer(str, FHIRPATH_KEYWORDS, MAPPING_LANGUAGE_OPERATORS, {\n    dateTimeLiterals: true,\n    symbolRegex: /[^\\s\\])]/,\n  }).tokenize();\n}\n"],"names":[],"mappings":";;;;;;AAGA,MAAM,0BAA0B,GAAG,CAAC,GAAG,kBAAkB,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AAEvE,SAAU,QAAQ,CAAC,GAAW,EAAA;IAClC,OAAO,IAAI,SAAS,CAAC,GAAG,EAAE,iBAAiB,EAAE,0BAA0B,EAAE;AACvE,QAAA,gBAAgB,EAAE,IAAI;AACtB,QAAA,WAAW,EAAE,UAAU;KACxB,CAAC,CAAC,QAAQ,EAAE,CAAC;AAChB;;;;"}

package/dist/esm/filter/types.mjs

@@ -1,34 +0,0 @@
-// See: https://hl7.org/fhir/search_filter.html
-/**
- * The FhirFilterComparison class represents a comparison expression.
- */
-class FhirFilterComparison {
-    constructor(path, operator, value) {
-        this.path = path;
-        this.operator = operator;
-        this.value = value;
-    }
-}
-/**
- * The FhirFilterNegation class represents a negation expression.
- * It contains a single child expression.
- */
-class FhirFilterNegation {
-    constructor(child) {
-        this.child = child;
-    }
-}
-/**
- * The FhirFilterConnective class represents a connective expression.
- * It contains a list of child expressions.
- */
-class FhirFilterConnective {
-    constructor(keyword, left, right) {
-        this.keyword = keyword;
-        this.left = left;
-        this.right = right;
-    }
-}
-
-export { FhirFilterComparison, FhirFilterConnective, FhirFilterNegation };
-//# sourceMappingURL=types.mjs.map

package/dist/esm/filter/types.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.mjs","sources":["../../../src/filter/types.ts"],"sourcesContent":["// See: https://hl7.org/fhir/search_filter.html\n\nimport { Operator } from '../search/search';\n\n/**\n * The FhirFilterExpression type is the base type of all filter expressions.\n */\nexport type FhirFilterExpression = FhirFilterComparison | FhirFilterNegation | FhirFilterConnective;\n\n/**\n * The FhirFilterComparison class represents a comparison expression.\n */\nexport class FhirFilterComparison {\n  constructor(readonly path: string, readonly operator: Operator, readonly value: string) {}\n}\n\n/**\n * The FhirFilterNegation class represents a negation expression.\n * It contains a single child expression.\n */\nexport class FhirFilterNegation {\n  constructor(readonly child: FhirFilterExpression) {}\n}\n\n/**\n * The FhirFilterConnective class represents a connective expression.\n * It contains a list of child expressions.\n */\nexport class FhirFilterConnective {\n  constructor(\n    readonly keyword: 'and' | 'or',\n    readonly left: FhirFilterExpression,\n    readonly right: FhirFilterExpression\n  ) {}\n}\n"],"names":[],"mappings":"AAAA;AASA;;AAEG;MACU,oBAAoB,CAAA;AAC/B,IAAA,WAAA,CAAqB,IAAY,EAAW,QAAkB,EAAW,KAAa,EAAA;QAAjE,IAAI,CAAA,IAAA,GAAJ,IAAI,CAAQ;QAAW,IAAQ,CAAA,QAAA,GAAR,QAAQ,CAAU;QAAW,IAAK,CAAA,KAAA,GAAL,KAAK,CAAQ;KAAI;AAC3F,CAAA;AAED;;;AAGG;MACU,kBAAkB,CAAA;AAC7B,IAAA,WAAA,CAAqB,KAA2B,EAAA;QAA3B,IAAK,CAAA,KAAA,GAAL,KAAK,CAAsB;KAAI;AACrD,CAAA;AAED;;;AAGG;MACU,oBAAoB,CAAA;AAC/B,IAAA,WAAA,CACW,OAAqB,EACrB,IAA0B,EAC1B,KAA2B,EAAA;QAF3B,IAAO,CAAA,OAAA,GAAP,OAAO,CAAc;QACrB,IAAI,CAAA,IAAA,GAAJ,IAAI,CAAsB;QAC1B,IAAK,CAAA,KAAA,GAAL,KAAK,CAAsB;KAClC;AACL;;;;"}