@oracle/oraclejet-preact 14.0.6 → 14.0.7

package/amd/utils/UNSAFE_interpolations/text.js

@@ -1,2 +1,30 @@
-define(["exports","css!./text.css","../../keys-5d739900","../../_curry1-8acb7bd9","../../_has-eb5860ac"],function(t,e,s,i,n){"use strict";const l={start:"vw6uro",end:"_69k3p0",right:"_1ex1wvj"},r={textAlign:l},a=s.keys_1(l),o={textAlign:({textAlign:t})=>void 0===t?{}:{class:l[t]}};t.textAlignStyles=l,t.textAligns=a,t.textInterpolations=o,t.textStyles=r,Object.defineProperty(t,"__esModule",{value:!0})});
+/* @oracle/oraclejet-preact: 14.0.7 */
+define(['exports', "css!./text.css", '../../keys-a09501ab', '../../_curry1-645b9927', '../../_has-cce283ad'], (function (exports, linaria, keys, _curry1, _has) { 'use strict';
+
+    const textAlignStyles = {
+      start: "start-1bqzizz",
+      end: "end-1fo5g2i",
+      right: "right-mzb3ko"
+    };
+    const textStyles = {
+      textAlign: textAlignStyles
+    };
+    const textAligns = keys.keys_1(textAlignStyles);
+    const textInterpolations = {
+      textAlign: ({
+        textAlign
+      }) => textAlign === undefined ? {} : {
+        class: textAlignStyles[textAlign]
+      }
+    };
+
+    exports.textAlignStyles = textAlignStyles;
+    exports.textAligns = textAligns;
+    exports.textInterpolations = textInterpolations;
+    exports.textStyles = textStyles;
+
+    Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
+/*  */
 //# sourceMappingURL=text.js.map

package/amd/utils/UNSAFE_interpolations/text.js.map

@@ -1 +1 @@
-{"version":3,"file":"text.js","sources":["../../../../src/utils/UNSAFE_interpolations/text/text.ts"],"sourcesContent":["import { cssProps } from '@oracle/oraclejet-cssprops';\nimport keys from 'ramda/src/keys';\n\nconst textAlignStyles = {\n  start: cssProps`${{\n    textAlign: 'start'\n  }}`,\n\n  end: cssProps`${{\n    textAlign: 'end'\n  }}`,\n\n  right: cssProps`${{\n    textAlign: 'right'\n  }}`\n};\n\nconst textStyles = {\n  textAlign: textAlignStyles\n};\n\nconst textAligns = keys(textAlignStyles);\n\n// See https://stackoverflow.com/questions/55377365/what-does-keyof-typeof-mean-in-typescript\n// typeof operator gives you the type of an object\n// then keyof operator gives you the literal type union\n// derive the types of each property from the implementation\nexport type TextProps = {\n  textAlign?: keyof typeof textAlignStyles;\n};\n\nconst textInterpolations = {\n  textAlign: ({ textAlign }: Pick<TextProps, 'textAlign'>) =>\n    textAlign === undefined ? {} : { class: textAlignStyles[textAlign] }\n};\n\nexport { textAligns, textAlignStyles, textInterpolations, textStyles };\n"],"names":["textAlignStyles","textStyles","textAlign","textAligns","keys","keys_1","textInterpolations"],"mappings":"mIAGA,MAAAA,EAAA,OAAA,aAAA,4BAcAC,EAAA,CACEC,UAAAF,GAGFG,EAAAC,EAAAC,OAAAL,GAUAM,EAAA"}
+{"version":3,"file":"text.js","sources":["../../../../src/utils/UNSAFE_interpolations/text/text.ts"],"sourcesContent":["import { cssProps } from '@oracle/oraclejet-cssprops';\nimport keys from 'ramda/src/keys';\n\nconst textAlignStyles = {\n  start: cssProps`${{\n    textAlign: 'start'\n  }}`,\n\n  end: cssProps`${{\n    textAlign: 'end'\n  }}`,\n\n  right: cssProps`${{\n    textAlign: 'right'\n  }}`\n};\n\nconst textStyles = {\n  textAlign: textAlignStyles\n};\n\nconst textAligns = keys(textAlignStyles);\n\n// See https://stackoverflow.com/questions/55377365/what-does-keyof-typeof-mean-in-typescript\n// typeof operator gives you the type of an object\n// then keyof operator gives you the literal type union\n// derive the types of each property from the implementation\nexport type TextProps = {\n  textAlign?: keyof typeof textAlignStyles;\n};\n\nconst textInterpolations = {\n  textAlign: ({ textAlign }: Pick<TextProps, 'textAlign'>) =>\n    textAlign === undefined ? {} : { class: textAlignStyles[textAlign] }\n};\n\nexport { textAligns, textAlignStyles, textInterpolations, textStyles };\n"],"names":["textAlignStyles","textStyles","textAlign","textAligns","keys","textInterpolations"],"mappings":";;;AAGA,UAAAA,eAAA,GAAA;aAAA,eAAA;WAAA,aAAA;;IAAA,EAAA;AAcA,UAAAC,UAAA,GAAA;IACEC,EAAAA,SAAA,EAAAF,eAAAA;IADF,EAAA;AAIA,UAAAG,UAAA,GAAAC,WAAA,CAAAJ,eAAA,EAAA;AAUA,UAAAK,kBAAA,GAAA;;;;;;IAAA;;;;;;;;;;;;;;;;"}

package/amd/utils/UNSAFE_keys.js

@@ -1,2 +1,81 @@
-define(["exports"],function(e){"use strict";e.addKey=(e,l)=>{if(e.all&&e.deletedKeys.has(l)){const s=new Set(e.deletedKeys.values());s.delete(l),e={all:!0,deletedKeys:s}}else if(!e.all&&!e.keys.has(l)){const s=new Set(e.keys.values());s.add(l),e={all:!1,keys:s}}return e},e.containsKey=(e,l)=>null!=e&&(e.all?!e.deletedKeys.has(l):e.keys.has(l)),e.isKeyDefined=e=>null!=e,e.removeKey=(e,l,s)=>{if(e.all&&!e.deletedKeys.has(l)){const s=new Set(e.deletedKeys.values());s.add(l),e={all:!0,deletedKeys:s}}else if(!e.all&&e.keys.has(l)&&(!s||e.keys.size>1)){const s=new Set(e.keys.values());s.delete(l),e={all:!1,keys:s}}return e},Object.defineProperty(e,"__esModule",{value:!0})});
+/* @oracle/oraclejet-preact: 14.0.7 */
+define(['exports'], (function (exports) { 'use strict';
+
+    /**
+     * @license
+     * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.
+     * The Universal Permissive License (UPL), Version 1.0
+     * as shown at https://oss.oracle.com/licenses/upl/
+     * @ignore
+     */
+    /**
+     * Returns true if the key is contains in keys, false otherwise
+     */
+    const containsKey = (keys, key) => {
+        if (keys == null) {
+            return false;
+        }
+        if (!keys.all) {
+            return keys.keys.has(key);
+        }
+        return !keys.deletedKeys.has(key);
+    };
+    /**
+     * Returns a new Keys that includes the specified key.
+     * If the key is already in keys, then just return keys.
+     */
+    const addKey = (keys, key) => {
+        if (keys.all && keys.deletedKeys.has(key)) {
+            const keySet = new Set(keys.deletedKeys.values());
+            keySet.delete(key);
+            keys = { all: true, deletedKeys: keySet };
+        }
+        else if (!keys.all && !keys.keys.has(key)) {
+            const keySet = new Set(keys.keys.values());
+            keySet.add(key);
+            keys = { all: false, keys: keySet };
+        }
+        return keys;
+    };
+    /**
+     * Returns a new Keys that excludes the specified key.
+     * If the key is already in keys, then just return keys.
+     * disallowEmpty if set to true, will ensure that the returning keys will not be empty.
+     */
+    const removeKey = (keys, key, disallowEmpty) => {
+        if (keys.all && !keys.deletedKeys.has(key)) {
+            const keySet = new Set(keys.deletedKeys.values());
+            keySet.add(key);
+            keys = { all: true, deletedKeys: keySet };
+        }
+        else if (!keys.all && keys.keys.has(key) && (!disallowEmpty || keys.keys.size > 1)) {
+            const keySet = new Set(keys.keys.values());
+            keySet.delete(key);
+            keys = { all: false, keys: keySet };
+        }
+        return keys;
+    };
+    /**
+     * Helper function for checking for an undefined key
+     * Keys can be null or undefined when not set, but falsey check is not appropriate for this as 0 is a legitimate key
+     */
+    const isKeyDefined = (key) => key !== undefined && key !== null;
+
+    /**
+     * @license
+     * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.
+     * The Universal Permissive License (UPL), Version 1.0
+     * as shown at https://oss.oracle.com/licenses/upl/
+     * @ignore
+     */
+
+    exports.addKey = addKey;
+    exports.containsKey = containsKey;
+    exports.isKeyDefined = isKeyDefined;
+    exports.removeKey = removeKey;
+
+    Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
+/*  */
 //# sourceMappingURL=UNSAFE_keys.js.map

package/amd/utils/UNSAFE_keys.js.map

@@ -1 +1 @@
-{"version":3,"file":"UNSAFE_keys.js","sources":["../../../src/utils/UNSAFE_keys/keys.ts"],"sourcesContent":["/**\n * @license\n * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.\n * The Universal Permissive License (UPL), Version 1.0\n * as shown at https://oss.oracle.com/licenses/upl/\n * @ignore\n */\n\nexport type ImmutableSet<V> = {\n  size: number;\n  has(value: V): boolean;\n  values(): IterableIterator<V>;\n};\n\n/**\n * Type for key set used mainly for selection and expansion\n */\nexport type Keys<K> =\n  | {\n      all: true;\n      keys?: never;\n      deletedKeys: ImmutableSet<K>;\n    }\n  | {\n      all: false;\n      keys: ImmutableSet<K>;\n      deletedKeys?: never;\n    };\n\n/**\n * Returns true if the key is contains in keys, false otherwise\n */\nexport const containsKey = <K>(keys: Keys<K>, key: K) => {\n  if (keys == null) {\n    return false;\n  }\n  if (!keys.all) {\n    return keys.keys.has(key);\n  }\n  return !keys.deletedKeys.has(key);\n};\n\n/**\n * Returns a new Keys that includes the specified key.\n * If the key is already in keys, then just return keys.\n */\nexport const addKey = <K>(keys: Keys<K>, key: K) => {\n  if (keys.all && keys.deletedKeys.has(key)) {\n    const keySet = new Set(keys.deletedKeys.values());\n    keySet.delete(key);\n    keys = { all: true, deletedKeys: keySet };\n  } else if (!keys.all && !keys.keys.has(key)) {\n    const keySet = new Set(keys.keys.values());\n    keySet.add(key);\n    keys = { all: false, keys: keySet };\n  }\n  return keys;\n};\n\n/**\n * Returns a new Keys that excludes the specified key.\n * If the key is already in keys, then just return keys.\n * disallowEmpty if set to true, will ensure that the returning keys will not be empty.\n */\nexport const removeKey = <K>(keys: Keys<K>, key: K, disallowEmpty: boolean) => {\n  if (keys.all && !keys.deletedKeys.has(key)) {\n    const keySet = new Set(keys.deletedKeys.values());\n    keySet.add(key);\n    keys = { all: true, deletedKeys: keySet };\n  } else if (!keys.all && keys.keys.has(key) && (!disallowEmpty || keys.keys.size > 1)) {\n    const keySet = new Set(keys.keys.values());\n    keySet.delete(key);\n    keys = { all: false, keys: keySet };\n  }\n  return keys;\n};\n\n/**\n * Helper function for checking for an undefined key\n * Keys can be null or undefined when not set, but falsey check is not appropriate for this as 0 is a legitimate key\n */\nexport const isKeyDefined = <K>(key: K) => key !== undefined && key !== null;\n"],"names":["keys","key","all","deletedKeys","has","keySet","Set","values","delete","add","disallowEmpty","size"],"mappings":"qDA8CsB,CAAIA,EAAeC,KACvC,GAAID,EAAKE,KAAOF,EAAKG,YAAYC,IAAIH,GAAM,CACzC,MAAMI,EAAS,IAAIC,IAAIN,EAAKG,YAAYI,UACxCF,EAAOG,OAAOP,GACdD,EAAO,CAAEE,KAAK,EAAMC,YAAaE,QAC5B,IAAKL,EAAKE,MAAQF,EAAKA,KAAKI,IAAIH,GAAM,CAC3C,MAAMI,EAAS,IAAIC,IAAIN,EAAKA,KAAKO,UACjCF,EAAOI,IAAIR,GACXD,EAAO,CAAEE,KAAK,EAAOF,KAAMK,GAE7B,OAAOL,iBAxBkB,CAAIA,EAAeC,IAChC,MAARD,IAGCA,EAAKE,KAGFF,EAAKG,YAAYC,IAAIH,GAFpBD,EAAKA,KAAKI,IAAIH,mBA4COA,GAAWA,MAAAA,cAjBlB,CAAID,EAAeC,EAAQS,KAClD,GAAIV,EAAKE,MAAQF,EAAKG,YAAYC,IAAIH,GAAM,CAC1C,MAAMI,EAAS,IAAIC,IAAIN,EAAKG,YAAYI,UACxCF,EAAOI,IAAIR,GACXD,EAAO,CAAEE,KAAK,EAAMC,YAAaE,QAC5B,IAAKL,EAAKE,KAAOF,EAAKA,KAAKI,IAAIH,MAAUS,GAAiBV,EAAKA,KAAKW,KAAO,GAAI,CACpF,MAAMN,EAAS,IAAIC,IAAIN,EAAKA,KAAKO,UACjCF,EAAOG,OAAOP,GACdD,EAAO,CAAEE,KAAK,EAAOF,KAAMK,GAE7B,OAAOL"}
+{"version":3,"file":"UNSAFE_keys.js","sources":["../../../src/utils/UNSAFE_keys/keys.ts","../../../src/utils/UNSAFE_keys/index.ts"],"sourcesContent":["/**\n * @license\n * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.\n * The Universal Permissive License (UPL), Version 1.0\n * as shown at https://oss.oracle.com/licenses/upl/\n * @ignore\n */\n\nexport type ImmutableSet<V> = {\n  size: number;\n  has(value: V): boolean;\n  values(): IterableIterator<V>;\n};\n\n/**\n * Type for key set used mainly for selection and expansion\n */\nexport type Keys<K> =\n  | {\n      all: true;\n      keys?: never;\n      deletedKeys: ImmutableSet<K>;\n    }\n  | {\n      all: false;\n      keys: ImmutableSet<K>;\n      deletedKeys?: never;\n    };\n\n/**\n * Returns true if the key is contains in keys, false otherwise\n */\nexport const containsKey = <K>(keys: Keys<K>, key: K) => {\n  if (keys == null) {\n    return false;\n  }\n  if (!keys.all) {\n    return keys.keys.has(key);\n  }\n  return !keys.deletedKeys.has(key);\n};\n\n/**\n * Returns a new Keys that includes the specified key.\n * If the key is already in keys, then just return keys.\n */\nexport const addKey = <K>(keys: Keys<K>, key: K) => {\n  if (keys.all && keys.deletedKeys.has(key)) {\n    const keySet = new Set(keys.deletedKeys.values());\n    keySet.delete(key);\n    keys = { all: true, deletedKeys: keySet };\n  } else if (!keys.all && !keys.keys.has(key)) {\n    const keySet = new Set(keys.keys.values());\n    keySet.add(key);\n    keys = { all: false, keys: keySet };\n  }\n  return keys;\n};\n\n/**\n * Returns a new Keys that excludes the specified key.\n * If the key is already in keys, then just return keys.\n * disallowEmpty if set to true, will ensure that the returning keys will not be empty.\n */\nexport const removeKey = <K>(keys: Keys<K>, key: K, disallowEmpty: boolean) => {\n  if (keys.all && !keys.deletedKeys.has(key)) {\n    const keySet = new Set(keys.deletedKeys.values());\n    keySet.add(key);\n    keys = { all: true, deletedKeys: keySet };\n  } else if (!keys.all && keys.keys.has(key) && (!disallowEmpty || keys.keys.size > 1)) {\n    const keySet = new Set(keys.keys.values());\n    keySet.delete(key);\n    keys = { all: false, keys: keySet };\n  }\n  return keys;\n};\n\n/**\n * Helper function for checking for an undefined key\n * Keys can be null or undefined when not set, but falsey check is not appropriate for this as 0 is a legitimate key\n */\nexport const isKeyDefined = <K>(key: K) => key !== undefined && key !== null;\n","/**\n * @license\n * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.\n * The Universal Permissive License (UPL), Version 1.0\n * as shown at https://oss.oracle.com/licenses/upl/\n * @ignore\n */\nexport * from './keys';\n"],"names":[],"mappings":";;;IAAA;;;;;;IAMG;IAuBH;;IAEG;UACU,WAAW,GAAG,CAAI,IAAa,EAAE,GAAM,KAAI;QACtD,IAAI,IAAI,IAAI,IAAI,EAAE;IAChB,QAAA,OAAO,KAAK,CAAC;IACd,KAAA;IACD,IAAA,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;YACb,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,KAAA;QACD,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpC,EAAE;IAEF;;;IAGG;UACU,MAAM,GAAG,CAAI,IAAa,EAAE,GAAM,KAAI;IACjD,IAAA,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;IACzC,QAAA,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;IAClD,QAAA,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACnB,IAAI,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;IAC3C,KAAA;IAAM,SAAA,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;IAC3C,QAAA,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAC3C,QAAA,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,IAAI,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IACrC,KAAA;IACD,IAAA,OAAO,IAAI,CAAC;IACd,EAAE;IAEF;;;;IAIG;AACU,UAAA,SAAS,GAAG,CAAI,IAAa,EAAE,GAAM,EAAE,aAAsB,KAAI;IAC5E,IAAA,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;IAC1C,QAAA,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;IAClD,QAAA,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,IAAI,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;IAC3C,KAAA;aAAM,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE;IACpF,QAAA,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAC3C,QAAA,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACnB,IAAI,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IACrC,KAAA;IACD,IAAA,OAAO,IAAI,CAAC;IACd,EAAE;IAEF;;;IAGG;AACU,UAAA,YAAY,GAAG,CAAI,GAAM,KAAK,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK;;ICjFxE;;;;;;IAMG;;;;;;;;;;;;;;;;"}

package/amd/utils/UNSAFE_lengthFilter.js

@@ -1,2 +1,72 @@
-define(["exports"],function(e){"use strict";function t(e,t="codeUnit"){if(!e)return 0;const n=e.length;let r,o=0;if("codePoint"===t){for(let t=0;t<n;t++)55296==(63488&e.charCodeAt(t))&&(o+=1);r=n-o/2}else r=n;return r}e.calcLength=t,e.filter=function(e,n,r){if(null==n)return e;if(n<1)throw new Error(`length filter's max option cannot be less than 1. max option is ${n}`);return t(e,r)<=n?e:e.slice(0,n)},Object.defineProperty(e,"__esModule",{value:!0})});
+/* @oracle/oraclejet-preact: 14.0.7 */
+define(['exports'], (function (exports) { 'use strict';
+
+    /**
+     * @license
+     * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.
+     * Licensed under The Universal Permissive License (UPL), Version 1.0
+     * as shown at https://oss.oracle.com/licenses/upl/
+     * @ignore
+     */
+    function calcLength(text, countBy = 'codeUnit') {
+        if (!text) {
+            return 0;
+        }
+        const codeUnitLength = text.length;
+        let length;
+        let surrogateLength = 0;
+        switch (countBy) {
+            case 'codePoint':
+                // if countBy is "codePoint", then count supplementary characters as length of one
+                // For UTF-16, a "Unicode  surrogate pair" represents a single supplementary character.
+                // The first (high) surrogate is a 16-bit code value in the range U+D800 to U+DBFF.
+                // The second (low) surrogate is a 16-bit code value in the range U+DC00 to U+DFFF.
+                // This code figures out if a charCode is a high or low surrogate and if so,
+                // increments surrogateLength
+                for (let i = 0; i < codeUnitLength; i++) {
+                    // eslint-disable-next-line no-bitwise
+                    if ((text.charCodeAt(i) & 0xf800) === 0xd800) {
+                        surrogateLength += 1;
+                    }
+                }
+                // e.g., if the string is two supplementary characters, codeUnitLength is 4, and the
+                // surrogateLength is 4, so we will return two.
+                // oj.Assert.assert(surrogateLength % 2 === 0,
+                // 'the number of surrogate chars must be an even number.');
+                length = codeUnitLength - surrogateLength / 2;
+                break;
+            case 'codeUnit':
+            default:
+                // Javascript's length function counts # of code units.
+                // A supplementary character has a length of 2 code units.
+                length = codeUnitLength;
+        }
+        return length;
+    }
+    /**
+     * Filters the text based on the maximum length allowed.
+     *
+     * @param proposedText The proposed displayValue
+     * @param max The max characters allowed
+     * @param countBy The unit to be used for counting
+     * @returns The filtered display value
+     */
+    function filter(proposedText, max, countBy) {
+        if (max == null) {
+            // No length filter
+            return proposedText;
+        }
+        if (max < 1) {
+            throw new Error(`length filter's max option cannot be less than 1. max option is ${max}`);
+        }
+        return calcLength(proposedText, countBy) <= max ? proposedText : proposedText.slice(0, max);
+    }
+
+    exports.calcLength = calcLength;
+    exports.filter = filter;
+
+    Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
+/*  */
 //# sourceMappingURL=UNSAFE_lengthFilter.js.map

package/amd/utils/UNSAFE_lengthFilter.js.map

@@ -1 +1 @@
-{"version":3,"file":"UNSAFE_lengthFilter.js","sources":["../../../src/utils/UNSAFE_lengthFilter/lengthFilter.ts"],"sourcesContent":["/**\n * @license\n * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.\n * Licensed under The Universal Permissive License (UPL), Version 1.0\n * as shown at https://oss.oracle.com/licenses/upl/\n * @ignore\n */\n\nexport type CountUnit = 'codePoint' | 'codeUnit';\n\nexport function calcLength(text: string, countBy: CountUnit = 'codeUnit'): number {\n  if (!text) {\n    return 0;\n  }\n  const codeUnitLength = text.length;\n  let length: number;\n  let surrogateLength = 0;\n\n  switch (countBy) {\n    case 'codePoint':\n      // if countBy is \"codePoint\", then count supplementary characters as length of one\n      // For UTF-16, a \"Unicode  surrogate pair\" represents a single supplementary character.\n      // The first (high) surrogate is a 16-bit code value in the range U+D800 to U+DBFF.\n      // The second (low) surrogate is a 16-bit code value in the range U+DC00 to U+DFFF.\n      // This code figures out if a charCode is a high or low surrogate and if so,\n      // increments surrogateLength\n      for (let i = 0; i < codeUnitLength; i++) {\n        // eslint-disable-next-line no-bitwise\n        if ((text.charCodeAt(i) & 0xf800) === 0xd800) {\n          surrogateLength += 1;\n        }\n      }\n      // e.g., if the string is two supplementary characters, codeUnitLength is 4, and the\n      // surrogateLength is 4, so we will return two.\n      // oj.Assert.assert(surrogateLength % 2 === 0,\n      // 'the number of surrogate chars must be an even number.');\n      length = codeUnitLength - surrogateLength / 2;\n      break;\n    case 'codeUnit':\n    default:\n      // Javascript's length function counts # of code units.\n      // A supplementary character has a length of 2 code units.\n      length = codeUnitLength;\n  }\n  return length;\n}\n\n/**\n * Filters the text based on the maximum length allowed.\n *\n * @param proposedText The proposed displayValue\n * @param max The max characters allowed\n * @param countBy The unit to be used for counting\n * @returns The filtered display value\n */\nexport function filter(proposedText: string, max?: number, countBy?: CountUnit) {\n  if (max == null) {\n    // No length filter\n    return proposedText;\n  }\n\n  if (max < 1) {\n    throw new Error(`length filter's max option cannot be less than 1. max option is ${max}`);\n  }\n\n  return calcLength(proposedText, countBy) <= max ? proposedText : proposedText.slice(0, max);\n}\n"],"names":["calcLength","text","countBy","codeUnitLength","length","surrogateLength","i","charCodeAt","proposedText","max","Error","slice"],"mappings":"qDAUgBA,EAAWC,EAAcC,EAAqB,YAC5D,IAAKD,EACH,OAAO,EAET,MAAME,EAAiBF,EAAKG,OAC5B,IAAIA,EACAC,EAAkB,EAEtB,GACO,cADCH,EACN,CAOE,IAAK,IAAII,EAAI,EAAGA,EAAIH,EAAgBG,IAEI,QAAZ,MAArBL,EAAKM,WAAWD,MACnBD,GAAmB,GAOvBD,EAASD,EAAiBE,EAAkB,OAM5CD,EAASD,EAEb,OAAOC,mCAWcI,EAAsBC,EAAcP,GACzD,GAAW,MAAPO,EAEF,OAAOD,EAGT,GAAIC,EAAM,EACR,MAAM,IAAIC,MAAM,mEAAmED,KAGrF,OAAOT,EAAWQ,EAAcN,IAAYO,EAAMD,EAAeA,EAAaG,MAAM,EAAGF"}
+{"version":3,"file":"UNSAFE_lengthFilter.js","sources":["../../../src/utils/UNSAFE_lengthFilter/lengthFilter.ts"],"sourcesContent":["/**\n * @license\n * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.\n * Licensed under The Universal Permissive License (UPL), Version 1.0\n * as shown at https://oss.oracle.com/licenses/upl/\n * @ignore\n */\n\nexport type CountUnit = 'codePoint' | 'codeUnit';\n\nexport function calcLength(text: string, countBy: CountUnit = 'codeUnit'): number {\n  if (!text) {\n    return 0;\n  }\n  const codeUnitLength = text.length;\n  let length: number;\n  let surrogateLength = 0;\n\n  switch (countBy) {\n    case 'codePoint':\n      // if countBy is \"codePoint\", then count supplementary characters as length of one\n      // For UTF-16, a \"Unicode  surrogate pair\" represents a single supplementary character.\n      // The first (high) surrogate is a 16-bit code value in the range U+D800 to U+DBFF.\n      // The second (low) surrogate is a 16-bit code value in the range U+DC00 to U+DFFF.\n      // This code figures out if a charCode is a high or low surrogate and if so,\n      // increments surrogateLength\n      for (let i = 0; i < codeUnitLength; i++) {\n        // eslint-disable-next-line no-bitwise\n        if ((text.charCodeAt(i) & 0xf800) === 0xd800) {\n          surrogateLength += 1;\n        }\n      }\n      // e.g., if the string is two supplementary characters, codeUnitLength is 4, and the\n      // surrogateLength is 4, so we will return two.\n      // oj.Assert.assert(surrogateLength % 2 === 0,\n      // 'the number of surrogate chars must be an even number.');\n      length = codeUnitLength - surrogateLength / 2;\n      break;\n    case 'codeUnit':\n    default:\n      // Javascript's length function counts # of code units.\n      // A supplementary character has a length of 2 code units.\n      length = codeUnitLength;\n  }\n  return length;\n}\n\n/**\n * Filters the text based on the maximum length allowed.\n *\n * @param proposedText The proposed displayValue\n * @param max The max characters allowed\n * @param countBy The unit to be used for counting\n * @returns The filtered display value\n */\nexport function filter(proposedText: string, max?: number, countBy?: CountUnit) {\n  if (max == null) {\n    // No length filter\n    return proposedText;\n  }\n\n  if (max < 1) {\n    throw new Error(`length filter's max option cannot be less than 1. max option is ${max}`);\n  }\n\n  return calcLength(proposedText, countBy) <= max ? proposedText : proposedText.slice(0, max);\n}\n"],"names":[],"mappings":";;;IAAA;;;;;;IAMG;aAIa,UAAU,CAAC,IAAY,EAAE,UAAqB,UAAU,EAAA;QACtE,IAAI,CAAC,IAAI,EAAE;IACT,QAAA,OAAO,CAAC,CAAC;IACV,KAAA;IACD,IAAA,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC;IACnC,IAAA,IAAI,MAAc,CAAC;QACnB,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,IAAA,QAAQ,OAAO;IACb,QAAA,KAAK,WAAW;;;;;;;gBAOd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE;;IAEvC,gBAAA,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,MAAM,MAAM,EAAE;wBAC5C,eAAe,IAAI,CAAC,CAAC;IACtB,iBAAA;IACF,aAAA;;;;;IAKD,YAAA,MAAM,GAAG,cAAc,GAAG,eAAe,GAAG,CAAC,CAAC;gBAC9C,MAAM;IACR,QAAA,KAAK,UAAU,CAAC;IAChB,QAAA;;;gBAGE,MAAM,GAAG,cAAc,CAAC;IAC3B,KAAA;IACD,IAAA,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;IAOG;aACa,MAAM,CAAC,YAAoB,EAAE,GAAY,EAAE,OAAmB,EAAA;QAC5E,IAAI,GAAG,IAAI,IAAI,EAAE;;IAEf,QAAA,OAAO,YAAY,CAAC;IACrB,KAAA;QAED,IAAI,GAAG,GAAG,CAAC,EAAE;IACX,QAAA,MAAM,IAAI,KAAK,CAAC,mEAAmE,GAAG,CAAA,CAAE,CAAC,CAAC;IAC3F,KAAA;QAED,OAAO,UAAU,CAAC,YAAY,EAAE,OAAO,CAAC,IAAI,GAAG,GAAG,YAAY,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC9F;;;;;;;;;;;;;;"}

package/amd/utils/UNSAFE_logger.js

@@ -1,2 +1,65 @@
-define(["exports","../_curry1-8acb7bd9","../_curry2-217feee5"],function(e,r,n){"use strict";const o=(0,n._curry2_1)(function(e,r){for(var n={},o=0;o<e.length;)e[o]in r&&(n[e[o]]=r[e[o]]),o+=1;return n})(["error","warn","info","log"],console);e.Logger=o,Object.defineProperty(e,"__esModule",{value:!0})});
+/* @oracle/oraclejet-preact: 14.0.7 */
+define(['exports', '../_curry1-645b9927', '../_curry2-93924f19'], (function (exports, _curry1, _curry2$1) { 'use strict';
+
+  var _curry2 = _curry2$1._curry2_1;
+  /**
+   * Returns a partial copy of an object containing only the keys specified. If
+   * the key does not exist, the property is ignored.
+   *
+   * @func
+   * @memberOf R
+   * @since v0.1.0
+   * @category Object
+   * @sig [k] -> {k: v} -> {k: v}
+   * @param {Array} names an array of String property names to copy onto a new object
+   * @param {Object} obj The object to copy from
+   * @return {Object} A new object with only properties from `names` on it.
+   * @see R.omit, R.props
+   * @example
+   *
+   *      R.pick(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}
+   *      R.pick(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1}
+   */
+
+  var pick = /*#__PURE__*/_curry2(function pick(names, obj) {
+    var result = {};
+    var idx = 0;
+
+    while (idx < names.length) {
+      if (names[idx] in obj) {
+        result[names[idx]] = obj[names[idx]];
+      }
+
+      idx += 1;
+    }
+
+    return result;
+  });
+
+  var pick_1 = pick;
+
+  /**
+   * @license
+   * Copyright (c) 2011 %CURRENT_YEAR%, Oracle and/or its affiliates.
+   * Licensed under The Universal Permissive License (UPL), Version 1.0
+   * as shown at https://oss.oracle.com/licenses/upl/
+   * @ignore
+   */
+  // TODO: fully implement Logger
+  const Logger = pick_1(['error', 'warn', 'info', 'log'], console);
+
+  /**
+   * @license
+   * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.
+   * Licensed under The Universal Permissive License (UPL), Version 1.0
+   * as shown at https://oss.oracle.com/licenses/upl/
+   * @ignore
+   */
+
+  exports.Logger = Logger;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
+/*  */
 //# sourceMappingURL=UNSAFE_logger.js.map

package/amd/utils/UNSAFE_logger.js.map

@@ -1 +1 @@
-{"version":3,"file":"UNSAFE_logger.js","sources":["../../../src/utils/UNSAFE_logger/logger.ts","../../../../node_modules/ramda/src/pick.js"],"sourcesContent":["/**\n * @license\n * Copyright (c) 2011 %CURRENT_YEAR%, Oracle and/or its affiliates.\n * Licensed under The Universal Permissive License (UPL), Version 1.0\n * as shown at https://oss.oracle.com/licenses/upl/\n * @ignore\n */\nimport pick from 'ramda/src/pick';\n\n// TODO: fully implement Logger\nexport const Logger = pick(['error', 'warn', 'info', 'log'], console);\n","var _curry2 =\n/*#__PURE__*/\nrequire(\"./internal/_curry2\");\n/**\n * Returns a partial copy of an object containing only the keys specified. If\n * the key does not exist, the property is ignored.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> {k: v}\n * @param {Array} names an array of String property names to copy onto a new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties from `names` on it.\n * @see R.omit, R.props\n * @example\n *\n *      R.pick(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}\n *      R.pick(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1}\n */\n\n\nvar pick =\n/*#__PURE__*/\n_curry2(function pick(names, obj) {\n  var result = {};\n  var idx = 0;\n\n  while (idx < names.length) {\n    if (names[idx] in obj) {\n      result[names[idx]] = obj[names[idx]];\n    }\n\n    idx += 1;\n  }\n\n  return result;\n});\n\nmodule.exports = pick;"],"names":["Logger","_curry2","require$$0","names","obj","result","idx","length","pick","console"],"mappings":"4FAUa,MAAAA,GCebC,EAvBAC,EAAAA,WAuBQ,SAAcC,EAAOC,GAI3B,IAHA,IAAIC,EAAS,GACTC,EAAM,EAEHA,EAAMH,EAAMI,QACbJ,EAAMG,KAAQF,IAChBC,EAAOF,EAAMG,IAAQF,EAAID,EAAMG,KAGjCA,GAAO,EAGT,OAAOD,GD3BaG,CAAK,CAAC,QAAS,OAAQ,OAAQ,OAAQC"}
+{"version":3,"file":"UNSAFE_logger.js","sources":["../../../../node_modules/ramda/src/pick.js","../../../src/utils/UNSAFE_logger/logger.ts","../../../src/utils/UNSAFE_logger/index.ts"],"sourcesContent":["var _curry2 =\n/*#__PURE__*/\nrequire(\"./internal/_curry2\");\n/**\n * Returns a partial copy of an object containing only the keys specified. If\n * the key does not exist, the property is ignored.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> {k: v}\n * @param {Array} names an array of String property names to copy onto a new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties from `names` on it.\n * @see R.omit, R.props\n * @example\n *\n *      R.pick(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}\n *      R.pick(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1}\n */\n\n\nvar pick =\n/*#__PURE__*/\n_curry2(function pick(names, obj) {\n  var result = {};\n  var idx = 0;\n\n  while (idx < names.length) {\n    if (names[idx] in obj) {\n      result[names[idx]] = obj[names[idx]];\n    }\n\n    idx += 1;\n  }\n\n  return result;\n});\n\nmodule.exports = pick;","/**\n * @license\n * Copyright (c) 2011 %CURRENT_YEAR%, Oracle and/or its affiliates.\n * Licensed under The Universal Permissive License (UPL), Version 1.0\n * as shown at https://oss.oracle.com/licenses/upl/\n * @ignore\n */\nimport pick from 'ramda/src/pick';\n\n// TODO: fully implement Logger\nexport const Logger = pick(['error', 'warn', 'info', 'log'], console);\n","/**\n * @license\n * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.\n * Licensed under The Universal Permissive License (UPL), Version 1.0\n * as shown at https://oss.oracle.com/licenses/upl/\n * @ignore\n */\nexport * from './logger';\n"],"names":["_curry2","require$$0","pick","names","obj","result","idx","length","pick_1"],"mappings":";;;EAAA,IAAIA,OAAO,GAEXC,mBAFA,CAAA;EAGA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAGA,IAAIC,IAAI,gBAERF,OAAO,CAAC,SAASE,IAAT,CAAcC,KAAd,EAAqBC,GAArB,EAA0B;IAChC,IAAIC,MAAM,GAAG,EAAb,CAAA;IACA,IAAIC,GAAG,GAAG,CAAV,CAAA;;EAEA,EAAA,OAAOA,GAAG,GAAGH,KAAK,CAACI,MAAnB,EAA2B;EACzB,IAAA,IAAIJ,KAAK,CAACG,GAAD,CAAL,IAAcF,GAAlB,EAAuB;EACrBC,MAAAA,MAAM,CAACF,KAAK,CAACG,GAAD,CAAN,CAAN,GAAqBF,GAAG,CAACD,KAAK,CAACG,GAAD,CAAN,CAAxB,CAAA;EACD,KAAA;;EAEDA,IAAAA,GAAG,IAAI,CAAP,CAAA;EACD,GAAA;;EAED,EAAA,OAAOD,MAAP,CAAA;EACD,CAbM,CAFP,CAAA;;EAiBA,IAAAG,MAAc,GAAGN,IAAjB;;ECxCA;;;;;;EAMG;EAGH;AACa,QAAA,MAAM,GAAGA,MAAI,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO;;ECVpE;;;;;;EAMG;;;;;;;;;;;;;"}

package/amd/utils/UNSAFE_matchTranslationBundle.js

@@ -1,2 +1,58 @@
-define(["exports"],function(n){"use strict";function t(n,t){let e=null;const l=n.split("-");for(;null===e&&l.length>1;){l.pop();const n=l.join("-");t.has(n)&&(e=n)}return e}n.matchTranslationBundle=function(n,e){let l=null;for(let o=0;null===l&&o<n.length;o++){const u=n[o];l=e.has(u)?u:t(u,e)}return l},Object.defineProperty(n,"__esModule",{value:!0})});
+/* @oracle/oraclejet-preact: 14.0.7 */
+define(['exports'], (function (exports) { 'use strict';
+
+    /**
+     * @license
+     * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.
+     * The Universal Permissive License (UPL), Version 1.0
+     * as shown at https://oss.oracle.com/licenses/upl/
+     * @ignore
+     */
+    /**
+     * @returns the best match for user's preferred locale or null if none is found
+     * @param preferredLocales - a list of user's preferred locales ordered from the most preferred to the least preferred
+     * @param supportedLocales - a set of locales supported by the application
+     * @ignore
+     */
+    function matchTranslationBundle(preferredLocales, supportedLocales) {
+        let match = null;
+        for (let l = 0; match === null && l < preferredLocales.length; l++) {
+            const locale = preferredLocales[l];
+            if (supportedLocales.has(locale)) {
+                match = locale;
+            }
+            else {
+                match = _findPartialMatch(locale, supportedLocales);
+            }
+        }
+        return match;
+    }
+    function _findPartialMatch(locale, supportedLocales) {
+        let match = null;
+        const sep = '-';
+        const parts = locale.split(sep);
+        while (match === null && parts.length > 1) {
+            parts.pop();
+            const partial = parts.join(sep);
+            if (supportedLocales.has(partial)) {
+                match = partial;
+            }
+        }
+        return match;
+    }
+
+    /**
+     * @license
+     * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.
+     * The Universal Permissive License (UPL), Version 1.0
+     * as shown at https://oss.oracle.com/licenses/upl/
+     * @ignore
+     */
+
+    exports.matchTranslationBundle = matchTranslationBundle;
+
+    Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
+/*  */
 //# sourceMappingURL=UNSAFE_matchTranslationBundle.js.map

package/amd/utils/UNSAFE_matchTranslationBundle.js.map

@@ -1 +1 @@
-{"version":3,"file":"UNSAFE_matchTranslationBundle.js","sources":["../../../src/utils/UNSAFE_matchTranslationBundle/matchTranslationBundle.ts"],"sourcesContent":["/**\n * @license\n * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.\n * The Universal Permissive License (UPL), Version 1.0\n * as shown at https://oss.oracle.com/licenses/upl/\n * @ignore\n */\n\n/**\n * @returns the best match for user's preferred locale or null if none is found\n * @param preferredLocales - a list of user's preferred locales ordered from the most preferred to the least preferred\n * @param supportedLocales - a set of locales supported by the application\n * @ignore\n */\nexport function matchTranslationBundle(\n  preferredLocales: Readonly<Array<string>>,\n  supportedLocales: Set<string>\n): string | null {\n  let match = null;\n\n  for (let l = 0; match === null && l < preferredLocales.length; l++) {\n    const locale = preferredLocales[l];\n    if (supportedLocales.has(locale)) {\n      match = locale;\n    } else {\n      match = _findPartialMatch(locale, supportedLocales);\n    }\n  }\n  return match;\n}\n\nfunction _findPartialMatch(locale: string, supportedLocales: Set<string>): string | null {\n  let match = null;\n  const sep = '-';\n  const parts = locale.split(sep);\n\n  while (match === null && parts.length > 1) {\n    parts.pop();\n    const partial = parts.join(sep);\n    if (supportedLocales.has(partial)) {\n      match = partial;\n    }\n  }\n\n  return match;\n}\n"],"names":["_findPartialMatch","locale","supportedLocales","match","parts","split","length","pop","partial","join","has","preferredLocales","l"],"mappings":"4CA+BA,SAASA,EAAkBC,EAAgBC,GACzC,IAAIC,EAAQ,KACZ,MACMC,EAAQH,EAAOI,MADT,KAGZ,KAAiB,OAAVF,GAAkBC,EAAME,OAAS,GAAG,CACzCF,EAAMG,MACN,MAAMC,EAAUJ,EAAMK,KALZ,KAMNP,EAAiBQ,IAAIF,KACvBL,EAAQK,GAIZ,OAAOL,2BA9BO,SACdQ,EACAT,GAEA,IAAIC,EAAQ,KAEZ,IAAK,IAAIS,EAAI,EAAa,OAAVT,GAAkBS,EAAID,EAAiBL,OAAQM,IAAK,CAClE,MAAMX,EAASU,EAAiBC,GAE9BT,EADED,EAAiBQ,IAAIT,GACfA,EAEAD,EAAkBC,EAAQC,GAGtC,OAAOC"}
+{"version":3,"file":"UNSAFE_matchTranslationBundle.js","sources":["../../../src/utils/UNSAFE_matchTranslationBundle/matchTranslationBundle.ts","../../../src/utils/UNSAFE_matchTranslationBundle/index.ts"],"sourcesContent":["/**\n * @license\n * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.\n * The Universal Permissive License (UPL), Version 1.0\n * as shown at https://oss.oracle.com/licenses/upl/\n * @ignore\n */\n\n/**\n * @returns the best match for user's preferred locale or null if none is found\n * @param preferredLocales - a list of user's preferred locales ordered from the most preferred to the least preferred\n * @param supportedLocales - a set of locales supported by the application\n * @ignore\n */\nexport function matchTranslationBundle(\n  preferredLocales: Readonly<Array<string>>,\n  supportedLocales: Set<string>\n): string | null {\n  let match = null;\n\n  for (let l = 0; match === null && l < preferredLocales.length; l++) {\n    const locale = preferredLocales[l];\n    if (supportedLocales.has(locale)) {\n      match = locale;\n    } else {\n      match = _findPartialMatch(locale, supportedLocales);\n    }\n  }\n  return match;\n}\n\nfunction _findPartialMatch(locale: string, supportedLocales: Set<string>): string | null {\n  let match = null;\n  const sep = '-';\n  const parts = locale.split(sep);\n\n  while (match === null && parts.length > 1) {\n    parts.pop();\n    const partial = parts.join(sep);\n    if (supportedLocales.has(partial)) {\n      match = partial;\n    }\n  }\n\n  return match;\n}\n","/**\n * @license\n * Copyright (c) %FIRST_YEAR% %CURRENT_YEAR%, Oracle and/or its affiliates.\n * The Universal Permissive License (UPL), Version 1.0\n * as shown at https://oss.oracle.com/licenses/upl/\n * @ignore\n */\nexport * from './matchTranslationBundle';\n"],"names":[],"mappings":";;;IAAA;;;;;;IAMG;IAEH;;;;;IAKG;IACa,SAAA,sBAAsB,CACpC,gBAAyC,EACzC,gBAA6B,EAAA;QAE7B,IAAI,KAAK,GAAG,IAAI,CAAC;IAEjB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IAClE,QAAA,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACnC,QAAA,IAAI,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;gBAChC,KAAK,GAAG,MAAM,CAAC;IAChB,SAAA;IAAM,aAAA;IACL,YAAA,KAAK,GAAG,iBAAiB,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACrD,SAAA;IACF,KAAA;IACD,IAAA,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS,iBAAiB,CAAC,MAAc,EAAE,gBAA6B,EAAA;QACtE,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,MAAM,GAAG,GAAG,GAAG,CAAC;QAChB,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEhC,OAAO,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACzC,KAAK,CAAC,GAAG,EAAE,CAAC;YACZ,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,QAAA,IAAI,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;gBACjC,KAAK,GAAG,OAAO,CAAC;IACjB,SAAA;IACF,KAAA;IAED,IAAA,OAAO,KAAK,CAAC;IACf;;IC7CA;;;;;;IAMG;;;;;;;;;;;;;"}

package/amd/utils/UNSAFE_mergeInterpolations.js

@@ -1,2 +1,112 @@
-define(["exports","./UNSAFE_classNames","../_curry1-8acb7bd9","../_curry3-3b4923a5","../_has-eb5860ac","../classNames-14cea078","../_curry2-217feee5"],function(e,r,c,t,n,s,a){"use strict";var u=function(e){return"[object Object]"===Object.prototype.toString.call(e)},o=t._curry3_1,_=n._has_1,i=o(function(e,r,c){var t,n={};for(t in r)_(t,r)&&(n[t]=_(t,c)?e(t,r[t],c[t]):r[t]);for(t in c)_(t,c)&&!_(t,n)&&(n[t]=c[t]);return n}),f=t._curry3_1,l=u,b=i,y=f(function e(r,c,t){return b(function(c,t,n){return l(t)&&l(n)?e(r,t,n):r(c,t,n)},c,t)});const d=(e,r,c)=>"class"===e?s.classNames([r,c]):c;e.mergeInterpolations=e=>r=>e.reduce((e,c)=>y(d,e,c(r)),{}),Object.defineProperty(e,"__esModule",{value:!0})});
+/* @oracle/oraclejet-preact: 14.0.7 */
+define(['exports', './UNSAFE_classNames', '../_curry1-645b9927', '../_curry3-4cc6f6ba', '../_has-cce283ad', '../classNames-027de734', '../_curry2-93924f19'], (function (exports, utils_UNSAFE_classNames, _curry1, _curry3$2, _has$1, classNames, _curry2) { 'use strict';
+
+  function _isObject$1(x) {
+    return Object.prototype.toString.call(x) === '[object Object]';
+  }
+
+  var _isObject_1 = _isObject$1;
+
+  var _curry3$1 = _curry3$2._curry3_1;
+  var _has = _has$1._has_1;
+  /**
+   * Creates a new object with the own properties of the two provided objects. If
+   * a key exists in both objects, the provided function is applied to the key
+   * and the values associated with the key in each object, with the result being
+   * used as the value associated with the key in the returned object.
+   *
+   * @func
+   * @memberOf R
+   * @since v0.19.0
+   * @category Object
+   * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}
+   * @param {Function} fn
+   * @param {Object} l
+   * @param {Object} r
+   * @return {Object}
+   * @see R.mergeDeepWithKey, R.merge, R.mergeWith
+   * @example
+   *
+   *      let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r
+   *      R.mergeWithKey(concatValues,
+   *                     { a: true, thing: 'foo', values: [10, 20] },
+   *                     { b: true, thing: 'bar', values: [15, 35] });
+   *      //=> { a: true, b: true, thing: 'bar', values: [10, 20, 15, 35] }
+   * @symb R.mergeWithKey(f, { x: 1, y: 2 }, { y: 5, z: 3 }) = { x: 1, y: f('y', 2, 5), z: 3 }
+   */
+
+  var mergeWithKey$1 = /*#__PURE__*/_curry3$1(function mergeWithKey(fn, l, r) {
+    var result = {};
+    var k;
+
+    for (k in l) {
+      if (_has(k, l)) {
+        result[k] = _has(k, r) ? fn(k, l[k], r[k]) : l[k];
+      }
+    }
+
+    for (k in r) {
+      if (_has(k, r) && !_has(k, result)) {
+        result[k] = r[k];
+      }
+    }
+
+    return result;
+  });
+
+  var mergeWithKey_1 = mergeWithKey$1;
+
+  var _curry3 = _curry3$2._curry3_1;
+  var _isObject = _isObject_1;
+  var mergeWithKey = mergeWithKey_1;
+  /**
+   * Creates a new object with the own properties of the two provided objects.
+   * If a key exists in both objects:
+   * - and both associated values are also objects then the values will be
+   *   recursively merged.
+   * - otherwise the provided function is applied to the key and associated values
+   *   using the resulting value as the new value associated with the key.
+   * If a key only exists in one object, the value will be associated with the key
+   * of the resulting object.
+   *
+   * @func
+   * @memberOf R
+   * @since v0.24.0
+   * @category Object
+   * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}
+   * @param {Function} fn
+   * @param {Object} lObj
+   * @param {Object} rObj
+   * @return {Object}
+   * @see R.mergeWithKey, R.mergeDeepWith
+   * @example
+   *
+   *      let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r
+   *      R.mergeDeepWithKey(concatValues,
+   *                         { a: true, c: { thing: 'foo', values: [10, 20] }},
+   *                         { b: true, c: { thing: 'bar', values: [15, 35] }});
+   *      //=> { a: true, b: true, c: { thing: 'bar', values: [10, 20, 15, 35] }}
+   */
+
+  var mergeDeepWithKey = /*#__PURE__*/_curry3(function mergeDeepWithKey(fn, lObj, rObj) {
+    return mergeWithKey(function (k, lVal, rVal) {
+      if (_isObject(lVal) && _isObject(rVal)) {
+        return mergeDeepWithKey(fn, lVal, rVal);
+      } else {
+        return fn(k, lVal, rVal);
+      }
+    }, lObj, rObj);
+  });
+
+  var mergeDeepWithKey_1 = mergeDeepWithKey;
+
+  const combineClassNames = (key, l, r) => key === 'class' ? classNames.classNames([l, r]) : r;
+  const mergeInterpolations = (interpolations) => (props) => interpolations.reduce((acc, fn) => mergeDeepWithKey_1(combineClassNames, acc, fn(props)), {});
+
+  exports.mergeInterpolations = mergeInterpolations;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
+/*  */
 //# sourceMappingURL=UNSAFE_mergeInterpolations.js.map

package/amd/utils/UNSAFE_mergeInterpolations.js.map

@@ -1 +1 @@
-{"version":3,"file":"UNSAFE_mergeInterpolations.js","sources":["../../../../node_modules/ramda/src/internal/_isObject.js","../../../../node_modules/ramda/src/mergeWithKey.js","../../../../node_modules/ramda/src/mergeDeepWithKey.js","../../../src/utils/UNSAFE_mergeInterpolations/mergeInterpolations.ts"],"sourcesContent":["function _isObject(x) {\n  return Object.prototype.toString.call(x) === '[object Object]';\n}\n\nmodule.exports = _isObject;","var _curry3 =\n/*#__PURE__*/\nrequire(\"./internal/_curry3\");\n\nvar _has =\n/*#__PURE__*/\nrequire(\"./internal/_has\");\n/**\n * Creates a new object with the own properties of the two provided objects. If\n * a key exists in both objects, the provided function is applied to the key\n * and the values associated with the key in each object, with the result being\n * used as the value associated with the key in the returned object.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.mergeDeepWithKey, R.merge, R.mergeWith\n * @example\n *\n *      let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r\n *      R.mergeWithKey(concatValues,\n *                     { a: true, thing: 'foo', values: [10, 20] },\n *                     { b: true, thing: 'bar', values: [15, 35] });\n *      //=> { a: true, b: true, thing: 'bar', values: [10, 20, 15, 35] }\n * @symb R.mergeWithKey(f, { x: 1, y: 2 }, { y: 5, z: 3 }) = { x: 1, y: f('y', 2, 5), z: 3 }\n */\n\n\nvar mergeWithKey =\n/*#__PURE__*/\n_curry3(function mergeWithKey(fn, l, r) {\n  var result = {};\n  var k;\n\n  for (k in l) {\n    if (_has(k, l)) {\n      result[k] = _has(k, r) ? fn(k, l[k], r[k]) : l[k];\n    }\n  }\n\n  for (k in r) {\n    if (_has(k, r) && !_has(k, result)) {\n      result[k] = r[k];\n    }\n  }\n\n  return result;\n});\n\nmodule.exports = mergeWithKey;","var _curry3 =\n/*#__PURE__*/\nrequire(\"./internal/_curry3\");\n\nvar _isObject =\n/*#__PURE__*/\nrequire(\"./internal/_isObject\");\n\nvar mergeWithKey =\n/*#__PURE__*/\nrequire(\"./mergeWithKey\");\n/**\n * Creates a new object with the own properties of the two provided objects.\n * If a key exists in both objects:\n * - and both associated values are also objects then the values will be\n *   recursively merged.\n * - otherwise the provided function is applied to the key and associated values\n *   using the resulting value as the new value associated with the key.\n * If a key only exists in one object, the value will be associated with the key\n * of the resulting object.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Object\n * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} lObj\n * @param {Object} rObj\n * @return {Object}\n * @see R.mergeWithKey, R.mergeDeepWith\n * @example\n *\n *      let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r\n *      R.mergeDeepWithKey(concatValues,\n *                         { a: true, c: { thing: 'foo', values: [10, 20] }},\n *                         { b: true, c: { thing: 'bar', values: [15, 35] }});\n *      //=> { a: true, b: true, c: { thing: 'bar', values: [10, 20, 15, 35] }}\n */\n\n\nvar mergeDeepWithKey =\n/*#__PURE__*/\n_curry3(function mergeDeepWithKey(fn, lObj, rObj) {\n  return mergeWithKey(function (k, lVal, rVal) {\n    if (_isObject(lVal) && _isObject(rVal)) {\n      return mergeDeepWithKey(fn, lVal, rVal);\n    } else {\n      return fn(k, lVal, rVal);\n    }\n  }, lObj, rObj);\n});\n\nmodule.exports = mergeDeepWithKey;","import { classNames } from '../UNSAFE_classNames';\nimport mergeDeepWithKey from 'ramda/src/mergeDeepWithKey';\n\ntype Obj = Record<string, unknown>;\ntype Interpolation<P> = (props: P) => Record<string, string> | object;\n\nconst combineClassNames = (key: string, l: any, r: any) =>\n  key === 'class' ? classNames([l, r]) : r;\n\nconst mergeInterpolations =\n  <P extends Obj>(interpolations: Interpolation<P>[]) =>\n  (props: P) =>\n    interpolations.reduce(\n      (acc, fn) => mergeDeepWithKey(combineClassNames, acc, fn(props)),\n      {} as Record<string, string>\n    );\n\nexport { mergeInterpolations };\n"],"names":["_isObject_1","x","Object","prototype","toString","call","_curry3","require$$0","_has","require$$1","mergeWithKey_1","fn","l","r","k","result","_isObject","mergeWithKey","require$$2","mergeDeepWithKey_1","mergeDeepWithKey","lObj","rObj","lVal","rVal","combineClassNames","key","classNames","interpolations","props","reduce","acc"],"mappings":"4LAIA,IAAAA,EAJA,SAAmBC,GACjB,MAA6C,oBAAtCC,OAAOC,UAAUC,SAASC,KAAKJ,ICDpCK,EAEJC,EAAAA,UAEIC,EAEJC,EAAAA,OAiDAC,EAnBAJ,EAAQ,SAAsBK,EAAIC,EAAGC,GACnC,IACIC,EADAC,EAAS,GAGb,IAAKD,KAAKF,EACJJ,EAAKM,EAAGF,KACVG,EAAOD,GAAKN,EAAKM,EAAGD,GAAKF,EAAGG,EAAGF,EAAEE,GAAID,EAAEC,IAAMF,EAAEE,IAInD,IAAKA,KAAKD,EACJL,EAAKM,EAAGD,KAAOL,EAAKM,EAAGC,KACzBA,EAAOD,GAAKD,EAAEC,IAIlB,OAAOC,ICpDLT,EAEJC,EAAAA,UAEIS,EAEJP,EAEIQ,EAEJC,EA2CAC,EAVAb,EAAQ,SAASc,EAAiBT,EAAIU,EAAMC,GAC1C,OAAOL,EAAa,SAAUH,EAAGS,EAAMC,GACrC,OAAIR,EAAUO,IAASP,EAAUQ,GACxBJ,EAAiBT,EAAIY,EAAMC,GAE3Bb,EAAGG,EAAGS,EAAMC,IAEpBH,EAAMC,KC5CX,MAAMG,EAAoB,CAACC,EAAad,EAAQC,IACtC,UAARa,EAAkBC,EAAAA,WAAW,CAACf,EAAGC,IAAMA,wBAGvBe,GACfC,GACCD,EAAeE,OACb,CAACC,EAAKpB,IAAOS,EAAiBK,EAAmBM,EAAKpB,EAAGkB,IACzD"}
+{"version":3,"file":"UNSAFE_mergeInterpolations.js","sources":["../../../../node_modules/ramda/src/internal/_isObject.js","../../../../node_modules/ramda/src/mergeWithKey.js","../../../../node_modules/ramda/src/mergeDeepWithKey.js","../../../src/utils/UNSAFE_mergeInterpolations/mergeInterpolations.ts"],"sourcesContent":["function _isObject(x) {\n  return Object.prototype.toString.call(x) === '[object Object]';\n}\n\nmodule.exports = _isObject;","var _curry3 =\n/*#__PURE__*/\nrequire(\"./internal/_curry3\");\n\nvar _has =\n/*#__PURE__*/\nrequire(\"./internal/_has\");\n/**\n * Creates a new object with the own properties of the two provided objects. If\n * a key exists in both objects, the provided function is applied to the key\n * and the values associated with the key in each object, with the result being\n * used as the value associated with the key in the returned object.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.mergeDeepWithKey, R.merge, R.mergeWith\n * @example\n *\n *      let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r\n *      R.mergeWithKey(concatValues,\n *                     { a: true, thing: 'foo', values: [10, 20] },\n *                     { b: true, thing: 'bar', values: [15, 35] });\n *      //=> { a: true, b: true, thing: 'bar', values: [10, 20, 15, 35] }\n * @symb R.mergeWithKey(f, { x: 1, y: 2 }, { y: 5, z: 3 }) = { x: 1, y: f('y', 2, 5), z: 3 }\n */\n\n\nvar mergeWithKey =\n/*#__PURE__*/\n_curry3(function mergeWithKey(fn, l, r) {\n  var result = {};\n  var k;\n\n  for (k in l) {\n    if (_has(k, l)) {\n      result[k] = _has(k, r) ? fn(k, l[k], r[k]) : l[k];\n    }\n  }\n\n  for (k in r) {\n    if (_has(k, r) && !_has(k, result)) {\n      result[k] = r[k];\n    }\n  }\n\n  return result;\n});\n\nmodule.exports = mergeWithKey;","var _curry3 =\n/*#__PURE__*/\nrequire(\"./internal/_curry3\");\n\nvar _isObject =\n/*#__PURE__*/\nrequire(\"./internal/_isObject\");\n\nvar mergeWithKey =\n/*#__PURE__*/\nrequire(\"./mergeWithKey\");\n/**\n * Creates a new object with the own properties of the two provided objects.\n * If a key exists in both objects:\n * - and both associated values are also objects then the values will be\n *   recursively merged.\n * - otherwise the provided function is applied to the key and associated values\n *   using the resulting value as the new value associated with the key.\n * If a key only exists in one object, the value will be associated with the key\n * of the resulting object.\n *\n * @func\n * @memberOf R\n * @since v0.24.0\n * @category Object\n * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} lObj\n * @param {Object} rObj\n * @return {Object}\n * @see R.mergeWithKey, R.mergeDeepWith\n * @example\n *\n *      let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r\n *      R.mergeDeepWithKey(concatValues,\n *                         { a: true, c: { thing: 'foo', values: [10, 20] }},\n *                         { b: true, c: { thing: 'bar', values: [15, 35] }});\n *      //=> { a: true, b: true, c: { thing: 'bar', values: [10, 20, 15, 35] }}\n */\n\n\nvar mergeDeepWithKey =\n/*#__PURE__*/\n_curry3(function mergeDeepWithKey(fn, lObj, rObj) {\n  return mergeWithKey(function (k, lVal, rVal) {\n    if (_isObject(lVal) && _isObject(rVal)) {\n      return mergeDeepWithKey(fn, lVal, rVal);\n    } else {\n      return fn(k, lVal, rVal);\n    }\n  }, lObj, rObj);\n});\n\nmodule.exports = mergeDeepWithKey;","import { classNames } from '../UNSAFE_classNames';\nimport mergeDeepWithKey from 'ramda/src/mergeDeepWithKey';\n\ntype Obj = Record<string, unknown>;\ntype Interpolation<P> = (props: P) => Record<string, string> | object;\n\nconst combineClassNames = (key: string, l: any, r: any) =>\n  key === 'class' ? classNames([l, r]) : r;\n\nconst mergeInterpolations =\n  <P extends Obj>(interpolations: Interpolation<P>[]) =>\n  (props: P) =>\n    interpolations.reduce(\n      (acc, fn) => mergeDeepWithKey(combineClassNames, acc, fn(props)),\n      {} as Record<string, string>\n    );\n\nexport { mergeInterpolations };\n"],"names":["_isObject","x","Object","prototype","toString","call","_isObject_1","_curry3","require$$0","_has","require$$1","mergeWithKey","fn","l","r","result","k","mergeWithKey_1","require$$2","mergeDeepWithKey","lObj","rObj","lVal","rVal","mergeDeepWithKey_1","classNames"],"mappings":";;;EAAA,SAASA,WAAT,CAAmBC,CAAnB,EAAsB;IACpB,OAAOC,MAAM,CAACC,SAAP,CAAiBC,QAAjB,CAA0BC,IAA1B,CAA+BJ,CAA/B,CAAA,KAAsC,iBAA7C,CAAA;EACD,CAAA;;EAED,IAAAK,WAAc,GAAGN,WAAjB;;ECJA,IAAIO,SAAO,GAEXC,mBAFA,CAAA;EAIA,IAAIC,IAAI,GAERC,aAFA,CAAA;EAGA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAGA,IAAIC,cAAY,gBAEhBJ,SAAO,CAAC,SAASI,YAAT,CAAsBC,EAAtB,EAA0BC,CAA1B,EAA6BC,CAA7B,EAAgC;IACtC,IAAIC,MAAM,GAAG,EAAb,CAAA;EACA,EAAA,IAAIC,CAAJ,CAAA;;IAEA,KAAKA,CAAL,IAAUH,CAAV,EAAa;EACX,IAAA,IAAIJ,IAAI,CAACO,CAAD,EAAIH,CAAJ,CAAR,EAAgB;EACdE,MAAAA,MAAM,CAACC,CAAD,CAAN,GAAYP,IAAI,CAACO,CAAD,EAAIF,CAAJ,CAAJ,GAAaF,EAAE,CAACI,CAAD,EAAIH,CAAC,CAACG,CAAD,CAAL,EAAUF,CAAC,CAACE,CAAD,CAAX,CAAf,GAAiCH,CAAC,CAACG,CAAD,CAA9C,CAAA;EACD,KAAA;EACF,GAAA;;IAED,KAAKA,CAAL,IAAUF,CAAV,EAAa;EACX,IAAA,IAAIL,IAAI,CAACO,CAAD,EAAIF,CAAJ,CAAJ,IAAc,CAACL,IAAI,CAACO,CAAD,EAAID,MAAJ,CAAvB,EAAoC;EAClCA,MAAAA,MAAM,CAACC,CAAD,CAAN,GAAYF,CAAC,CAACE,CAAD,CAAb,CAAA;EACD,KAAA;EACF,GAAA;;EAED,EAAA,OAAOD,MAAP,CAAA;EACD,CAjBM,CAFP,CAAA;;EAqBA,IAAAE,cAAc,GAAGN,cAAjB;;ECvDA,IAAIJ,OAAO,GAEXC,mBAFA,CAAA;EAIA,IAAIR,SAAS,GAEbU,WAFA,CAAA;EAIA,IAAIC,YAAY,GAEhBO,cAFA,CAAA;EAGA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAGA,IAAIC,gBAAgB,gBAEpBZ,OAAO,CAAC,SAASY,gBAAT,CAA0BP,EAA1B,EAA8BQ,IAA9B,EAAoCC,IAApC,EAA0C;IAChD,OAAOV,YAAY,CAAC,UAAUK,CAAV,EAAaM,IAAb,EAAmBC,IAAnB,EAAyB;MAC3C,IAAIvB,SAAS,CAACsB,IAAD,CAAT,IAAmBtB,SAAS,CAACuB,IAAD,CAAhC,EAAwC;EACtC,MAAA,OAAOJ,gBAAgB,CAACP,EAAD,EAAKU,IAAL,EAAWC,IAAX,CAAvB,CAAA;EACD,KAFD,MAEO;EACL,MAAA,OAAOX,EAAE,CAACI,CAAD,EAAIM,IAAJ,EAAUC,IAAV,CAAT,CAAA;EACD,KAAA;EACF,GANkB,EAMhBH,IANgB,EAMVC,IANU,CAAnB,CAAA;EAOD,CARM,CAFP,CAAA;;EAYA,IAAAG,kBAAc,GAAGL,gBAAjB;;EC/CA,MAAM,iBAAiB,GAAG,CAAC,GAAW,EAAE,CAAM,EAAE,CAAM,KACpD,GAAG,KAAK,OAAO,GAAGM,qBAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAE3C,QAAM,mBAAmB,GACvB,CAAgB,cAAkC,KAClD,CAAC,KAAQ,KACP,cAAc,CAAC,MAAM,CACnB,CAAC,GAAG,EAAE,EAAE,KAAKN,kBAAgB,CAAC,iBAAiB,EAAE,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAChE,EAA4B;;;;;;;;;;;;;"}