| 1 | {"version":3,"file":"functions-b6202a08.js","sources":["../src/functions.js"],"sourcesContent":["/**\n * Created by Andy Likuski on 2017.02.26\n * Copyright (c) 2017 Andy Likuski\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\n */\n\n/*\n* Utility functions, which rely heavily on Ramda, data.task, and Ramda Fantasy types\n* These functions should all be pure. Equivalent throwing functions can\n* be found in throwingFunctions. throwingFunctions should only be used for coding errors,\n* such as improper function arguments or an invalid path within object.\n* I/O Errors should be handled using Maybe or Result and calling functions should expect them.\n* An I/O Error should always result in a valid state of an application, even if that valid\n* state is to show an error message, retryTask I/O, etc.\n*/\n\nimport * as R from 'ramda';\nimport * as Rm from 'ramda-maybe';\nimport * as Result from 'folktale/result';\n\n// https://stackoverflow.com/questions/17843691/javascript-regex-to-match-a-regex\nconst regexToMatchARegex = /\\/((?![*+?])(?:[^\\r\\n\\[/\\\\]|\\\\.|\\[(?:[^\\r\\n\\]\\\\]|\\\\.)*\\])+)\\/((?:g(?:im?|mi?)?|i(?:gm?|mg?)?|m(?:gi?|ig?)?)?)/;\n\n\n/**\n * We use this instead of isObject since it's possible to have something that is an object without\n * a prototype to make it an object type\n * @param {*} obj value to test\n * @return {boolean} True if R.is(Object, obj) or is not null and it a typeof 'object'\n */\nexport const isObject = obj => {\n return R.is(Object, obj) || (obj !== null && typeof obj === 'object');\n};\n\n/**\n * Return an empty string if the given entity is falsy\n * @param {Object} entity The entity to check\n * @returns {String|Object} The empty string or the Object\n * @sig orEmpty:: a -> a\n * :: a -> String\n */\nexport const orEmpty = entity => entity || '';\n\n/**\n * Removed null or undefined items from an iterable\n * @param [a] items Items that might have falsy values to remove\n * @returns The compacted items\n * @sig compact:: [a] -> [a]\n * @sig compact:: {k,v} -> {k,v}\n */\nexport const compact = R.reject(R.isNil);\n\n/**\n * Remove empty strings\n * @param [a] items Items that might have empty or null strings to remove\n * @returns The compacted items\n * @sig compactEmpty:: [a] -> [a]\n */\nexport const compactEmpty = R.reject(R.either(R.isNil, R.isEmpty));\n\n/**\n * Convert an empty value to null\n * @param a item Item that might be empty according to isEmpty\n * @returns the\n * @sig emptyToNull:: a -> a\n * :: a -> null\n */\nexport const emptyToNull = R.when(R.isEmpty, () => null);\n\n/**\n * Join elements, first remove null items and empty strings. If the result is empty make it null\n * @param connector Join connector string\n * @param [a] items Items to join that might be removed\n * @sig compactEmpty:: [a] -> String\n * :: [a] -> null\n */\nexport const compactJoin = R.compose(\n (connector, items) => R.pipe(compactEmpty, R.join(connector), emptyToNull)(items)\n);\n\n/**\n * Creates a partial mapping function that expects an iterable and maps each item of the iterable to the given property\n * @param {String} prop The prop of each object to map\n * @param {[Object]} items The objects to map\n * @returns {[Object]} The mapped objects\n * @sig mapProp :: String -> [{k, v}] -> [a]\n */\nexport const mapProp = R.curry((prop, objs) => R.pipe(R.prop, R.map)(prop)(objs));\n\n/**\n * Creates a partial function that maps an array of objects to an object keyed by the given prop of the object's\n * of the array, valued by the item. If the item is not an array, it leaves it alone, assuming it is already indexed\n * @param {String} prop The prop of each object to use as the key\n * @param {[Object]} items The items to map\n * @returns {Object} The returned object\n * @sig mapPropValueAsIndex:: String -> [{k, v}] -> {j, {k, v}}\n * @sig mapPropValueAsIndex:: String -> {k, v} -> {k, v}\n */\nexport const mapPropValueAsIndex = R.curry((prop, obj) =>\n R.when(\n Array.isArray,\n R.pipe(R.prop, R.indexBy)(prop)\n )(obj));\n\n/**\n * Merges a list of objects by the given key and returns the values, meaning all items that are\n * duplicate prop key value are removed from the final list\n * @returns {[Object]} The items without the duplicates\n * @sig removeDuplicateObjectsByProp:: String -> [{k, v}] -> [{k, v}]\n */\nexport const removeDuplicateObjectsByProp = R.curry((prop, list) =>\n R.pipe(\n mapPropValueAsIndex(prop),\n R.values\n )(list)\n);\n\n/**\n * Returns the id of the given value if it is an object or the value itself if it is not.\n * @param {Object|String|Number} objOrId\n * @returns {String|Number} an id\n * @sig idOrIdFromObj:: a -> a\n * :: {k, v} -> a\n */\nexport const idOrIdFromObj = R.when(\n objOrId => (typeof objOrId === 'object') && objOrId !== null,\n R.prop('id')\n);\n\n/**\n * Deep merge values that are objects but not arrays\n * based on https://github.com/ramda/ramda/pull/1088\n * @params {Object} l the 'left' side object to merge\n * @params {Object} r the 'right' side object to merge\n * @type {Immutable.Map<string, V>|__Cursor.Cursor|List<T>|Map<K, V>|*}\n * @returns {Object} The deep-merged object\n * @sig mergeDeep:: (<k, v>, <k, v>) -> <k, v>\n */\nexport const mergeDeep = R.mergeWith((l, r) => {\n // If either (hopefully both) items are arrays or not both objects\n // accept the right value\n return (\n // If either is a function take the last\n (R.is(Function, l) || R.is(Function, r)) ||\n // If either is an array take the last\n (l && l.concat && Array.isArray(l)) ||\n (r && r.concat && Array.isArray(r))) ||\n !(R.is(Object, l) && R.is(Object, r)) ?\n r :\n mergeDeep(l, r); // tail recursive\n});\n\n/**\n * mergeDeep any number of objects\n * @params {[Object]} objs Array of objects to reduce\n * @returns {Object} The deep-merged objects\n */\nexport const mergeDeepAll = R.reduce(mergeDeep, {});\n\n/**\n * Deep merge values with a custom function that are objects\n * based on https://github.com/ramda/ramda/pull/1088\n * @params {Function} fn The merge function left l, right r:: l -> r -> a\n * @params {Object} left the 'left' side object to merge\n * @params {Object} right the 'right' side object to morge\n * @returns {Object} The deep-merged objeck\n * @sig mergeDeep:: (<k, v>, <k, v>) -> <k, v>\n */\nexport const mergeDeepWith = R.curry((fn, left, right) => R.mergeWith((l, r) => {\n // If either (hopefully both) items are arrays or not both objects\n // accept the right value\n return (\n (l && l.concat && Array.isArray(l)) ||\n (r && r.concat && Array.isArray(r))\n ) ||\n !(R.all(isObject))([l, r]) ||\n R.any(R.is(Function))([l, r]) ?\n fn(l, r) :\n mergeDeepWith(fn, l, r); // tail recursive\n})(left, right));\n\n/**\n * Merge Deep that concats arrays of matching keys\n * @params {Object} left the 'left' side object to merge\n * @params {Object} right the 'right' side object to morge\n * @returns {Object} The deep-merged object\n * @sig mergeDeep:: (<k, v>, <k, v>) -> <k, v>\n */\nexport const mergeDeepWithConcatArrays = R.curry((left, right) => mergeDeepWith((l, r) => {\n return R.cond(\n [\n [R.all(R.allPass([R.identity, R.prop('concat'), Array.isArray])), R.apply(R.concat)],\n [R.complement(R.all)(isObject), R.last],\n [R.T, R.apply(mergeDeepWithConcatArrays)] // tail recursive\n ]\n )([l, r]);\n})(left, right));\n\n/**\n * Merge Deep and also apply the given function to array items with the same index\n * @params {Function} fn The merge function left l, right r, string k:: l -> r -> k -> a\n * @params {Object} left the 'left' side object to merge\n * @params {Object} right the 'right' side object to morge\n * @returns {Object} The deep-merged object\n * @sig mergeDeepWithRecurseArrayItems:: (<k, v>, <k, v>, k) -> <k, v>\n */\nexport const mergeDeepWithRecurseArrayItems = R.curry((fn, left, right) => R.cond(\n [\n // Arrays\n [R.all(R.allPass([R.identity, R.prop('concat'), Array.isArray])),\n ([l, r]) => {\n return R.zipWith((a, b) => mergeDeepWithRecurseArrayItems(fn, a, b), l, r);\n }\n ],\n // Primitives\n [R.complement(R.all)(isObject),\n ([l, r]) => {\n return fn(l, r);\n }],\n // Objects\n [R.T, ([l, r]) => {\n return R.mergeWith(mergeDeepWithRecurseArrayItems(fn), l, r);\n }]\n ]\n )([left, right])\n);\n\n/**\n * Like mergeDeepWithRecurseArrayItems but merges array items with a function itemMatchBy that determines\n * if an item from each array of left and right represents the same objects. The right object's array\n * items are returned but any left object item matching by itemMatchBy is deep merged with the matching right item.\n * There is no merge function for primitives, r is always returned\n * @params {Function} fn The item matching function, Arrays deep items in left and right. Called with the\n * item and current key/index\n * are merged. For example\n * item => R.when(isObject, R.propOr(v, 'id'))(item)\n * would match on id if item is an object and has an id\n * @params {Object} left the 'left' side object to merge\n * @params {Object} right the 'right' side object to merge\n * @params {String} [key] Optional key or index of the parent object/array item\n * @returns {Object} The deep-merged object\n */\nexport const mergeDeepWithRecurseArrayItemsByRight = R.curry((itemMatchBy, left, right) => {\n return _mergeDeepWithRecurseArrayItemsByRight(itemMatchBy, null, left, right, null);\n});\n\n/**\n * Like mergeDeepWithRecurseArrayItemsByRight but takes mergeObject to merge objects, rather than just taking the\n * right value. Primitives still resolve to the right value. the mergeObject function should handle internal array\n * merging by recursing on this function or similar\n * @params {Function} fn The item matching function, Arrays deep items in left and right. Called with the\n * item and current key/index\n * are merged. For example\n * item => R.when(isObject, R.propOr(v, 'id'))(item)\n * would match on id if item is an object and has an id\n * @params {Function} itemMatchBy Expects the left and right object that need to be merged\n * @params {Function} mergeObject Expects left and right when they are objects. mergeObject typically recurses\n * with mergeDeepWithRecurseArrayItemsByAndMergeObjectByRight on each item of left and right after doing something\n * special. This function was designed with the idea of being used in Apollo InMemory Cache Type Policy merge functions\n * to continue calling Apollowing merge function on objects, which in tern delegates back to this function\n * @params {Object} left the 'left' side object to merge\n * @params {Object} right the 'right' side object to merge\n * @params {String} [key] Optional key or index of the parent object/array item\n * @returns {Object} The deep-merged object\n */\nexport const mergeDeepWithRecurseArrayItemsByAndMergeObjectByRight = R.curry((itemMatchBy, mergeObject, left, right) => {\n return _mergeDeepWithRecurseArrayItemsByRight(itemMatchBy, mergeObject, left, right, null);\n});\n\nexport const _mergeDeepWithRecurseArrayItemsByRight = (itemMatchBy, mergeObject, left, right, key) => {\n return R.cond(\n [\n // Arrays\n [([l, r]) => {\n return R.any(R.allPass([R.identity, R.prop('concat'), Array.isArray]))([l, r]);\n },\n ([l, r]) => {\n // Null case, return the only array\n if (!l || !r) {\n return l || r;\n }\n // Create a lookup of l items\n const lItemsByValue = R.indexBy(li => itemMatchBy(li, key), l || []);\n // Map each item of r\n return R.addIndex(R.map)(\n (rItem, i) => {\n // If the lookup of the r item matches one of l items' itemMatchBy value,\n // recurse with both items. Else just return r\n const rItemValue = itemMatchBy(rItem, key);\n const hasMatchingLItem = R.has(rItemValue, lItemsByValue);\n return R.when(\n () => hasMatchingLItem,\n () => {\n // Pass the index as a key\n return _mergeDeepWithRecurseArrayItemsByRight(\n itemMatchBy,\n mergeObject,\n R.prop(rItemValue, lItemsByValue),\n rItem,\n i\n );\n }\n )(rItem);\n },\n r || []\n );\n }\n ],\n // Primitives. If either is an object skip, it means 1 is null\n [R.none(isObject),\n ([l, r]) => {\n return r;\n }\n ],\n // Objects and nulls\n [R.T,\n ([l, r]) => {\n return mergeObject ? mergeObject(l, r) : R.mergeWithKey(\n (kk, ll, rr) => {\n return _mergeDeepWithRecurseArrayItemsByRight(\n itemMatchBy,\n mergeObject,\n ll,\n rr,\n kk\n );\n },\n l || {},\n r || {}\n );\n }\n ]\n ]\n )([left, right]);\n};\n\n\n/**\n * mergeDeepWithRecurseArrayItems but passes obj as left and right so fn is called on every key\n * @params {Function} fn The merge function left l, right r, string k:: l -> r -> k -> a\n * @params {Object} left the 'left' side object to merge\n * @params {Object} right the 'right' side object to morge\n * @returns {Object} The deep-merged object\n * @sig mergeDeepWithRecurseArrayItems:: (<k, v>, <k, v>, k) -> <k, v>\n */\nexport const applyDeep = R.curry((fn, obj) => mergeDeepWithRecurseArrayItems(fn, obj, obj));\n\n\n/**\n * Merge Deep and also apply the given function to array items with the same index.\n * This adds another function that maps the object results to something else after the objects are recursed upon\n * @params {Function} fn The merge function left l, right r, string k:: l -> r -> k -> a\n * @params {Function} applyObj Function called with the current key and the result of each recursion that is an object.\n * @params {Object} left the 'left' side object to merge\n * @params {Object} right the 'right' side object to morge\n * @returns {Object} The deep-merged object\n * @sig mergeDeepWithRecurseArrayItems:: (<k, v>, <k, v>, k) -> <k, v>\n */\nexport const mergeDeepWithRecurseArrayItemsAndMapObjs = R.curry((fn, applyObj, left, right) =>\n _mergeDeepWithRecurseArrayItemsAndMapObjs(fn, applyObj, null, left, right)\n);\n\n/**\n * Same as mergeDeepWithRecurseArrayItemsAndMapObjs but sends the same left and right value so fn is called on every key\n * of ob * @params {Function} fn The merge function left l, right r, string k:: l -> r -> k -> a\n * @params {Function} applyObj Function called with the current key and the result of each recursion that is an object.\n * @params {Object} left the 'left' side object to merge\n * @params {Object} right the 'right' side object to morge\n * @returns {Object} The deep-merged object\n * @sig applyDeepAndMapObjs:: (<k, v>, <k, v>, k) -> <k, v>j\n */\nexport const applyDeepAndMapObjs = R.curry((fn, applyObj, obj) =>\n mergeDeepWithRecurseArrayItemsAndMapObjs(fn, applyObj, obj, obj)\n);\n\nconst _mergeDeepWithRecurseArrayItemsAndMapObjs = R.curry((fn, applyObj, key, left, right) => {\n return R.cond(\n [\n // Arrays\n [R.all(Array.isArray),\n // Recurse on each array item. We pass the key without the index\n lr => {\n return R.apply(\n R.zipWith(\n (l, r) => R.compose(\n // For array items, take key and the result and call the applyObj func, but only if res is an Object\n v => R.when(\n // When it's an object and not an array call applyObj\n // typeof x === 'object' check because sometimes values that are objects are not returning true\n R.both(\n vv => typeof vv === 'object',\n R.complement(R.is)(Array)\n ),\n res => applyObj(key, res)\n )(v),\n ([kk, ll, rr]) => _mergeDeepWithRecurseArrayItemsAndMapObjs(fn, applyObj, kk, ll, rr)\n )([key, l, r])\n )\n )(lr);\n }\n ],\n // Primitives: call the function with left and right as the first two args and key as the last\n [R.complement(R.all)(x => isObject(x)), lr => {\n return fn(...lr, key);\n }],\n // Always leave functions alone.\n [lr => R.all(R.is(Function), lr), ([l, _]) => {\n return l;\n }],\n // Objects\n [R.T,\n lr => {\n return R.apply(\n R.mergeWithKey(\n (k, l, r) => R.compose(\n // Take key and the result and call the applyObj func, but only if res is an Object\n v => R.when(\n // When it's an object and not an array call applyObj\n // typeof x === 'object' check because sometimes values that are objects are not returning true\n R.both(\n x => typeof x === 'object',\n R.complement(R.is)(Array)\n ),\n res => applyObj(k, res)\n )(v),\n // First recurse on l and r\n ([kk, ll, rr]) => R.apply(_mergeDeepWithRecurseArrayItemsAndMapObjs(fn, applyObj), [kk, ll, rr])\n )([k, l, r])\n ),\n lr\n );\n }\n ]\n ]\n )([left, right]);\n }\n);\n\n\n/**\n * http://stackoverflow.com/questions/40011725/point-free-style-capitalize-function-with-ramda\n * Capitalize the first letter\n * @param {String} str The string to capitalize\n * @returns {String} The capitalized string\n * @sig capitalize:: String -> String\n */\nexport const capitalize = str => R.compose(\n R.join(''),\n R.juxt([R.compose(R.toUpper, R.head), R.tail])\n)(str);\n\n/**\n * http://stackoverflow.com/questions/40011725/point-free-style-capitalize-function-with-ramda\n * Lowercase the first letter\n * @param {String} str The string to lowercase\n * @returns {String} The capitalized string\n * @sig capitalize:: String -> String\n */\nexport const lowercase = str => R.compose(\n R.join(''),\n R.juxt([R.compose(R.toLower, R.head), R.tail])\n)(str);\n\n/**\n * From https://github.com/substack/camelize/blob/master/index.js\n * @param {String} str The string to camelCase\n * @returns {String} The camel-cased string\n */\nexport const camelCase = str =>\n R.toLower(str).replace(\n /[_.-](\\w|$)/g,\n (_, x) => x.toUpperCase()\n );\n\n/**\n * Merge a list of objects using the given concat function\n * [{k: v}] → {k: v}\n * @returns {Object} The merged object\n * @sig mergeAllWithKey:: (String → a → a → a) → [{a}] → {a}\n */\nexport const mergeAllWithKey = R.curry((fn, [head, ...rest]) =>\n R.mergeWithKey( // call mergeWithKey on two objects at a time\n fn,\n head || {}, // first object is always the head\n R.ifElse( // second object is the merged object of the recursion\n R.isEmpty, // if no rest\n () => R.empty({}), // end case empty object\n mergeAllWithKey(fn) // else recurse with the rest\n )(rest)\n )\n);\n\n/**\n * Get a required path or return a helpful Error if it fails\n * @param {String} path A lensPath, e.g. ['a', 'b'] or ['a', 2, 'b']\n * @param {Object} obj The object to inspect\n * @returns {Result} Result the resolved value or an Error\n * @sig reqPath:: String -> {k: v} → Result\n */\nexport const reqPath = R.curry((path, obj) => {\n return R.compose(\n R.ifElse(\n // If path doesn't resolve\n maybe => maybe.isNothing,\n // Create a useful Error message\n () => Result.Error({\n resolved: R.reduceWhile(\n // Stop if the accumulated segments can't be resolved\n (segments, segment) => R.not(R.isNil(R.path(R.concat(segments, [segment]), obj))),\n // Accumulate segments\n (segments, segment) => R.concat(segments, [segment]),\n [],\n path\n ),\n path: path\n }),\n // Return the resolved value\n res => Result.Ok(res.value)\n ),\n // Try to resolve the value using the path and obj, returning Maybe\n Rm.path(path)\n )(obj);\n});\n\n/**\n * Expects a prop path and returns a function expecting props,\n * which resolves the prop indicated by the string. Returns Result.Error if there is not match\n * @param {String} str dot-separated prop path\n * @param {Object} props Object to resolve the path in\n * @return {Result} Result.Ok with the resolved value or Result.Error if the path doesn't exist or the\n * value is null\n */\nexport const reqStrPath = R.curry((str, props) => reqPath(R.split('.', str), props));\n\n/**\n * Expects a prop path and returns a function expecting props,\n * which resolves the prop indicated by the string. If not match is found it returns undefined\n * @param {String} str dot-separated prop path\n * @param {Object} props Object to resolve the path in\n * @return {Object} The resolved object or undefined\n */\nexport const strPath = R.curry((str, props) => {\n return R.view(R.lensPath(R.split('.', str)), props);\n});\n\n/**\n * Like strPath but defaults the given value\n * @param {Object} defaultValue. Default value if value is null undefined.\n * @param {String} str dot-separated prop path\n * @param {Object} props Object to resolve the path in\n * @return {function(*=)}\n */\nexport const strPathOr = R.curry((defaultValue, str, props) => {\n const result = R.view(R.lensPath(R.split('.', str)), props);\n return R.when(\n R.isNil,\n R.always(defaultValue)\n )(result);\n});\n\nexport const strPathOrNullOk = R.curry((defaultValue, str, props) => {\n const segments = R.split('.', str);\n const result = R.view(R.lensPath(R.init(segments)), props);\n return R.ifElse(\n R.isNil,\n R.always(defaultValue),\n r => {\n try {\n return R.when(v => typeof v === 'undefined', () => defaultValue)(R.prop(R.last(segments), r));\n } catch {\n return defaultValue;\n }\n }\n )(result);\n});\n\n/**\n * Returns true if the given string path is non-null\n * @param {String} str dot-separated prop path\n * @param {Object} props Object to resolve the path in\n * @returns {Boolean} true\n */\nexport const hasStrPath = R.curry((str, props) =>\n R.complement(R.isNil)(\n R.view(R.lensPath(R.split('.', str)), props)\n )\n);\n\n/**\n * Uses reqPath to resolve the path of an object and compares it to val\n * @param {String} path A lensPath, e.g. ['a', 'b'] or ['a', 2, 'b']\n * @param {*} val The val to do an equality check on\n * @param {Object} obj The object to inspect\n * @returns {Result} Result the resolved value or an Error\n * @sig reqPath:: String -> {k: v} → Result\n */\nexport const reqPathPropEq = R.curry((path, val, obj) =>\n // If the reqPath is valid map it to a comparison with val\n reqPath(path, obj).map(R.equals(val))\n);\n\n/**\n * From the cookbook: https://github.com/ramda/ramda/wiki/Cookbook#map-keys-of-an-object\n * Maps keys according to the given function\n * @returns {Object} The mapped keys of the object\n * @sig mapKeys :: (String -> String) -> Object -> Object\n */\nexport const mapKeys = R.curry(\n (fn, obj) => R.compose(\n R.fromPairs,\n pairs => R.map(\n // Apply fn to index 0 of pair\n pair => R.adjust(0, fn, pair),\n pairs\n ),\n R.toPairs\n )(obj)\n);\n\n\n/**\n * Uses a lens to map keys that are embedded in a data structure\n * The lens must indicate an object whose keys shall be mapped\n * @returns {Object} Object with the keys indicated by the given lens mapped\n * @sig mapKeysForLens :: Lens -> ((String -> String) -> Object -> Object\n */\nexport const mapKeysForLens = R.curry((lens, fn, obj) =>\n // Sets the lens-focused objects to a new object with keys mapped according to the function\n R.set(lens, mapKeys(fn, R.view(lens, obj)), obj)\n);\n\n/**\n * Converts default to desired name. Used for requiring defaults\n * @param {String} keyName The desired rename of 'default'\n * @param {Object} module A required module with a default key\n * @returns {Object} The import module with key default changed to keyName\n * @sig mapDefault :: String -> <k,v> -> <k,v>\n */\nexport const mapDefault = (keyName, module) => mapKeys(key => key === 'default' ? keyName : key, module);\n/**\n * Converts default to desired name and prefixes others.\n * Used for requiring defaults and renaming others\n * @param {String} defaultName The desired rename of 'default'\n * @param {String} prefix The desired prefix for others. Camel Case maintained\n * @param {Object} module A required module with a default key\n * @returns {Object} The import module with key default changed to keyName\n * @sig mapDefault :: String -> <k,v> -> <k,v>\n */\nexport const mapDefaultAndPrefixOthers = (defaultName, prefix, module) =>\n mapKeys(\n key => (key === 'default') ? defaultName : `${prefix}${capitalize(key)}`,\n module\n );\n\n/**\n * Maps an object with a function that returns pairs and create and object therefrom\n * Like R.mapObjIndexed, the function's first argument is the value of each item, and the seconds is the key if\n * iterating over objects\n * @params {Functor} f The mapping function\n * @params {Container} container Anything that can be mapped\n * @returns {Object} The mapped pairs made into key values\n * @sig mapKeysAndValues :: Functor F = (a -> [b,c]) -> F -> <k,v>\n */\nexport const mapKeysAndValues = R.curry((f, container) => R.fromPairs(mapObjToValues(f, container)));\n\n/**\n * https://github.com/ramda/ramda/wiki/Cookbook\n * Filter objects with values and keys. Null objs return as null\n * @param {Function} pred (value, key) => True|False\n * @param {Object} obj The object to filter\n * @returns {Object} The filtered object\n * @sig filterWithKeys:: (v -> k -> True|False) -> <k,v> -> <k,v>\n */\nexport const filterWithKeys = R.curry((pred, obj) => {\n if (!obj) {\n return obj;\n }\n return R.compose(\n R.fromPairs,\n R.filter(pair => R.apply(pred, R.reverse(pair))),\n R.toPairs\n )(obj);\n});\n\n/**\n * Transforms the keys of the given object with the given func\n * @param {Function} func The mapping function that expects the key\n * @param {Object} The object to map\n * @returns {Object} The object with transformed keys and the original values\n */\nexport const transformKeys = R.curry((func, obj) =>\n R.compose(\n R.fromPairs,\n R.map(([key, value]) =>\n [func(key), value]),\n R.toPairs\n )(obj)\n);\n\n/**\n * Renames the key of the object specified by the lens\n * @param {Function} lens A ramda lens that points to the object containing the key, not the key itself.\n * Use R.lensPath([]) to operate directly on obj\n * @param {String} from Key to rename\n * @param {String} to New name for the key\n * @param {Object} obj Object to traverse with the lens\n */\nexport const renameKey = R.curry((lens, from, to, obj) => R.over(\n lens,\n target => mapKeys(\n R.when(R.equals(from), R.always(to)),\n target),\n obj));\n\n/**\n * Duplicates the key of the object specified by the lens and key, to the given list of keys or single key.\n * A duplicate of the value at key will be added at each of the toKeys using R.clone\n * @param {Function} lens A ramda lens that points to the object containing the key, not the key itself\n * @param {String} key Key to duplicate the value of\n * @param {String|[String]} toKeys Array of new keys to make. New keys overwrite existing keys\n * @param {Object} obj Object to traverse with the lens\n */\nexport const duplicateKey = R.curry((lens, key, toKeys, obj) => R.over(\n lens,\n // convert the target of the lens to a merge of the target with copies of target[key]\n target => R.merge(\n target,\n R.fromPairs(\n R.map(\n toKey => [toKey, R.clone(target[key])],\n toArrayIfNot(toKeys)\n )\n )\n ),\n // take the lens of this obj\n obj)\n);\n\n/**\n * Converts a scalar value (!Array.isArray) to array an array\n * @param {*|[*]} arrayOrScalar An array or scalar\n * @returns {[*]} The scalar as an array or the untouched array\n */\nexport const toArrayIfNot = arrayOrScalar => {\n return R.unless(Array.isArray, Array.of)(arrayOrScalar);\n};\n\n/**\n * Like duplicateKey but removes the original key\n * @param {Function} lens A ramda lens that points to the object containing the key, not the key itself\n * @param {String} key Key to duplicate the value of\n * @param [{String}] toKeys Array of new keys to make. New keys overwrite existing keys\n * @param {Object} obj Object to traverse with the lens\n */\nexport const moveToKeys = R.curry((lens, key, toKeys, obj) => R.over(\n lens,\n // convert the target of the lens to a merge of the target with copies of target[key]\n // and with target[key] itself removed\n target => R.merge(\n R.omit([key], target),\n R.fromPairs(\n R.map(\n toKey => [toKey, R.clone(target[key])],\n toKeys\n )\n )\n ),\n // take the lens of this obj\n obj)\n);\n\n/**\n * Like R.find but expects only one match and works on both arrays and objects\n * Note this still iterates through the whole list or object, so this should be rewritten to quit when one is found\n * @param {Function} predicate\n * @param {Array|Object} obj Container that should only match once with predicate\n * @returns {Result} Result.Error if no matches or more than one, otherwise Result.Ok with the single matching item in an array/object\n */\nexport const findOne = R.curry((predicate, obj) =>\n R.ifElse(\n // If path doesn't resolve\n items => R.equals(R.length(R.keys(items)), 1),\n // Return the resolved single key/value object\n items => Result.Ok(items),\n // Create a useful Error message\n items => Result.Error({\n all: obj,\n matching: items\n })\n )(R.filter(predicate, obj))\n);\n\n/**\n * Version of find one that accepts all items of the given Container\n * @param {Array|Object} obj Container\n * @returns {Result} Result.Error if no items or more than one, otherwise Result.Ok with the single item in an array/object\n */\nexport const onlyOne = findOne(R.T);\n\n/**\n * Like onlyOne but extracts the value\n * @param {Array|Object|Result} obj Container that should have one value to extract. This currently expects\n * and array or object or Result, but it could be expanded to take Result, Maybe, or any other container where\n * the value can be extracted. Types like Tasks and Streams can't extract, I suppose\n * @returns {Result} Result.Error if no items or more than one, otherwise Result.Ok with the single value\n */\nexport const onlyOneValue = R.compose(\n // Use R.map to operate on the value of Result without extracting it\n R.map(R.head),\n R.map(R.values),\n findOne(R.T)\n);\n\n/**\n * Curryable Maps container values to the key and values of an object, applying f to each to make the value\n * @param {Function} f Transforms each item to a value\n * @param {Array} list Container to map to an object.\n * @sig mapToObjValue:: Functor a => (b -> c) -> <b, c>\n */\nexport const mapToObjValue = R.curry((f, obj) => R.compose(R.fromPairs, R.map(v => [v, f(v)]))(obj));\n\n\n/**\n * Finds an item that matches all the given props in params\n * @param {Object} params object key values to match\n * @param {Object|Array} items Object or Array that can produce values to search\n * @returns {Result} An Result.Ok containing the value or an Result.Error if no value is found\n */\nexport const findOneValueByParams = (params, items) => {\n return findOne(\n // Compare all the eqProps against each item\n R.allPass(\n // Create a eqProps for each prop of params\n R.map(prop => R.eqProps(prop, params),\n R.keys(params)\n )\n ),\n R.values(items)\n ).map(R.head);\n};\n\n/**\n * Returns the items matching all param key values\n * @param {Object} params Key values to match to items\n * @param {Object|Array} items Object with values of objects or array of objects that can produce values to search\n * @returns {[Object]} items that pass\n */\nexport const findByParams = (params, items) => {\n return R.filter(\n // Compare all the eqProps against each item\n R.allPass(\n // Create a eqProps for each prop of params\n R.map(prop => R.eqProps(prop, params),\n R.keys(params)\n )\n ),\n items\n );\n};\n\n/**\n * Returns the first mapped item that is not null\n * @param {Function} f The mapping function\n * @param {[*]} items The items\n * @returns {*} The first mapped item value that is not nil\n */\nexport const findMapped = (f, items) => {\n return R.reduceWhile(\n R.isNil,\n (_, i) => f(i),\n null,\n items\n );\n};\n\n/**\n * Converts the given value to an always function (that ignores all arguments) unless already a function\n * @param {Function} maybeFunc A function or something else\n * @return {Function} a function that always returns the non funcion value of maybeFunc, or maybeFunc\n * itself if maybeFunc is a functon\n */\nexport const alwaysFunc = maybeFunc => R.unless(R.is(Function), R.always)(maybeFunc);\n\n/**\n * Map the object with a function accepting a key, value, and the obj but return just the mapped values,\n * not the object\n * @param {Function} f Expects value, key, and obj\n * @param {Object} obj The object to map\n * @return {[Object]} Mapped values\n */\nexport const mapObjToValues = R.curry((f, obj) => {\n return R.values(R.mapObjIndexed(f, obj));\n});\n\n/**\n * Filter the given object and return the values, discarding the keys\n * @param {Function} f Receives each value and key\n * @param {Object} obj The object to filter\n * @return {Object} The filtered object values\n */\nexport const filterObjToValues = R.curry((f, obj) => {\n return R.values(filterWithKeys(f, obj));\n});\n/**\n * Like mapObjToValues but chains the values when an array is returned for each mapping\n * @param {Function} f Expects key, value, and obj\n * @param {Object} obj The object to chain\n * @return {[Object]} Mapped flattened values\n */\nexport const chainObjToValues = R.curry((f, obj) => {\n return R.chain(R.identity, mapObjToValues(f, obj));\n});\n\n\n/**\n *\n * This is a deep fromPairs. If it encounters a two element array it assumes it's a pair if the first\n * element is a string. If an array is not a pair it is iterated over and each element is recursed upon.\n * The 2nd element of each pair is also recursed upon. The end case for recursion is that an element is not an array.\n *\n * This method doesn't currently expect objects but could be easily modified to handle them\n * @param {[*]} deepPairs An array of deep pairs, with possibly other arrays at the top or lower levels\n * that aren't pairs but might contain them\n * @returns {Array|Object} All arrays of pairs are converted to objects. Arrays of non pairs are left as arrays\n */\nexport const fromPairsDeep = deepPairs => R.cond(\n [\n // It's array of pairs or some other array\n [Array.isArray, list =>\n R.ifElse(\n // Is the first item a two element array whose first item is a string?\n ([first]) => R.allPass(\n [\n Array.isArray,\n x => R.compose(R.equals(2), R.length)(x),\n x => R.compose(R.is(String), R.head)(x)\n ])(first),\n // Yes, return an object whose keys are the first element and values are the result of recursing on the second\n l => R.compose(R.fromPairs, R.map(([k, v]) => [k, fromPairsDeep(v)]))(l),\n // No, recurse on each array item\n l => R.map(v => fromPairsDeep(v), l)\n )(list)\n ],\n // End case, return the given value unadulterated\n [R.T, R.identity]\n ])(deepPairs);\n\n\n/**\n * At the given depth, object and array values are converted to the replacementString.\n * @param {Number} n Depth to replace at.\n * Depth 3 converts {a: {b: {c: 1}}} to {a: {b: {c: '...'}}}\n * Depth 2 converts {a: {b: {c: 1}}} to {a: {b: '...'}}\n * Depth 1 converts {a: {b: {c: 1}}} to {a: '...'}\n * Depth 0 converts {a: {b: {c: 1}}} to '...'\n * @param {String|Function} replaceStringOrFunc String such as '...' or a unary function that replaces the value\n * e.g. R.when(isObject, R.length(R.keys)) will count objects and arrays but leave primitives alone\n * @param {Object} obj Object to process\n * @returns {Object} with the above transformation. Use replaceValuesAtDepthAndStringify to get a string\n */\nexport function replaceValuesAtDepth(n, replaceStringOrFunc, obj) {\n return R.ifElse(\n // If we are above level 0 and we have an object\n R.both(R.always(R.lt(0, n)), isObject),\n // Then recurse on each object or array value\n o => R.map(oo => replaceValuesAtDepth(n - 1, replaceStringOrFunc, oo), o),\n // If at level 0 replace the value. If not an object or not at level 0, leave it alone\n o => R.when(R.always(R.equals(0, n)), alwaysFunc(replaceStringOrFunc))(o)\n )(obj);\n}\n\n/** *\n * replaceValuesAtDepth but stringifies result\n * @param {Number} n Depth to replace at.\n * Depth 3 converts {a: {b: {c: 1}}} to {a: {b: {c: '...'}}}\n * Depth 2 converts {a: {b: {c: 1}}} to {a: {b: '...'}}\n * Depth 1 converts {a: {b: {c: 1}}} to {a: '...'}\n * Depth 0 converts {a: {b: {c: 1}}} to '...'\n * @param {String|Function} replaceString String such as '...' or a unary function that replaces the value\n * e.g. R.when(isObject, R.length(R.keys)) will count objects and arrays but leave primitives alone\n * @param {Object} obj Object to process\n * @returns {String} after the above replacement\n */\nexport const replaceValuesAtDepthAndStringify = (n, replaceString, obj) => {\n return JSON.stringify(replaceValuesAtDepth(n, replaceString, obj));\n};\n\n/**\n * Convenient method to count objects and lists at the given depth but leave primitives alone\n * @param {Number} n Depth to replace at.\n * @param {Object} obj Object to process\n * @returns {Object} after the above replacement\n */\nexport const replaceValuesWithCountAtDepth = (n, obj) => {\n return replaceValuesAtDepth(\n n,\n R.when(\n isObject,\n o => R.compose(\n // Show arrays and objs different\n R.ifElse(R.always(Array.isArray(o)), c => `[...${c}]`, c => `{...${c}}`),\n R.length,\n R.keys)(o)\n ),\n obj);\n};\n\n/**\n * Convenient method to count objects and lists at the given depth but leave primitives alone and stringify result\n * @param {Number} n Depth to replace at.\n * @param {Object} obj Object to process\n * @returns {String} after the above replacement\n */\nexport const replaceValuesWithCountAtDepthAndStringify = (n, obj) => {\n return JSON.stringify(replaceValuesWithCountAtDepth(n, obj));\n};\n\n/**\n * Flattens an objects so deep keys and array indices become concatinated strings\n * E.g. {a: {b: [1, 3]}} => {'a.b.0': 1, 'a.b.1': 2}\n * @param {Object} obj The object to flattened\n * @returns {Object} The 1-D version of the object\n */\nexport const flattenObj = obj => {\n return R.fromPairs(_flattenObj({}, obj));\n};\n\n/**\n * Flatten objs until the predicate returns false. This is called recursively on each object and array\n * @param {Function} predicate Expects object, returns true when we should stop flatting on the current object\n * @param {Object} obj The object to flatten\n * @return {Object} The flattened object\n */\nexport const flattenObjUntil = (predicate, obj) => {\n return R.fromPairs(_flattenObj({predicate}, obj));\n};\n\nconst _flattenObj = (config, obj, keys = []) => {\n const predicate = R.propOr(null, 'predicate', config);\n return R.ifElse(\n // If we have an object\n o => R.both(\n isObject,\n oo => R.when(\n () => predicate,\n ooo => R.complement(predicate)(ooo)\n )(oo)\n )(o),\n // Then recurse on each object or array value\n o => chainObjToValues((oo, k) => _flattenObj(config, oo, R.concat(keys, [k])), o),\n // If not an object return flat pair\n o => [[R.join('.', keys), o]]\n )(obj);\n};\n\n/**\n * Converts a key string like 'foo.bar.0.wopper' to ['foo', 'bar', 0, 'wopper']\n * @param {String} keyString The dot-separated key string\n * @returns {[String]} The lens array containing string or integers\n */\nexport const keyStringToLensPath = keyString => R.map(\n R.when(R.compose(R.complement(R.equals)(NaN), parseInt), parseInt),\n R.split('.', keyString)\n);\n\n/**\n * Undoes the work of flattenObj. Does not allow number keys to become array indices\n * @param {Object} obj 1-D object in the form returned by flattenObj\n * @returns {Object} The original\n */\nexport const unflattenObjNoArrays = obj => {\n return _unflattenObj({allowArrays: false}, obj);\n};\n\n/**\n * Undoes the work of flattenObj\n * @param {Object} obj 1-D object in the form returned by flattenObj\n * @returns {Object} The original\n */\nexport const unflattenObj = obj => {\n return _unflattenObj({allowArrays: true}, obj);\n};\n\nexport const _unflattenObj = (config, obj) => {\n return R.compose(\n R.reduce(\n (accum, [keyString, value]) => {\n // Don't allow indices if allowArrays is false\n const itemKeyPath = R.map(\n key => {\n return R.when(\n () => R.not(R.prop('allowArrays', config)),\n k => k.toString()\n )(key);\n },\n keyStringToLensPath(keyString)\n );\n // Current item lens\n const itemLensPath = R.lensPath(itemKeyPath);\n // All but the last segment gives us the item container len\n const constainerKeyPath = R.init(itemKeyPath);\n const container = R.unless(\n // If the path has any length (not []) and the value is set, don't do anything\n R.both(R.always(R.length(constainerKeyPath)), R.view(R.lensPath(constainerKeyPath))),\n // Else we are at the top level, so use the existing accum or create a [] or {}\n // depending on if our item key is a number or not\n x => R.defaultTo(\n R.ifElse(\n v => R.both(() => R.prop('allowArrays', config), R.is(Number))(v),\n R.always([]),\n R.always({})\n )(R.head(itemKeyPath))\n )(x)\n )(accum);\n // Finally set the container at the itemLensPath\n return R.set(\n itemLensPath,\n value,\n container\n );\n },\n // null initial value\n null\n ),\n R.toPairs\n )(obj);\n};\n\n/**\n * Does something to every object\n * @param {Function} func Called on each object that is the child of another object. Called with the key that\n * points at it from the parent object and the object itself\n * @param {Object} obj The object to process\n */\nexport const overDeep = R.curry((func, obj) => mergeDeepWithRecurseArrayItemsAndMapObjs(\n // We are using a mergeDeepWithRecurseArrayItemsAndMapObjs but we only need the second function\n (l, r, k) => l,\n func,\n // Use obj twice so that all keys match and get called with the merge function\n obj,\n obj\n )\n);\n\n/**\n * Omit the given keys anywhere in a data structure. Objects and arrays are recursed and omit_deep is called\n * on each dictionary that hasn't been removed by omit_deep at a higher level\n */\nexport const omitDeep = R.curry(\n (omit_keys, obj) => omitDeepBy(\n (k, v) => R.includes(k, omit_keys),\n obj\n )\n);\n\n/**\n * Omit by the given function that is called with key and value. You can ignore the value if you only want to test the key\n * Objects and arrays are recursed and omit_deep is called\n * on each dictionary that hasn't been removed by omit_deep at a higher level\n * @param {Function} f Binary function accepting each key, value. Return non-nil to omit and false or nil to keep\n */\nexport const omitDeepBy = R.curry(\n (f, obj) => R.compose(\n o => applyDeepAndMapObjs(\n // If k is in omit_keys return {} to force the applyObj function to call. Otherwise take l since l and r are always the same\n // l and r are always the same value\n (l, r, kk) => R.ifElse(\n // Reject any function return value that isn't null or false\n k => R.anyPass([R.isNil, R.equals(false)])(f(k, l)),\n R.always(l),\n () => ({})\n )(kk),\n // Called as the result of each recursion. Removes the keys at any level except the topmost level\n (key, result) => filterWithKeys(\n (v, k) => R.anyPass([R.isNil, R.equals(false)])(f(k, v)),\n result\n ),\n o\n ),\n // Omit at the top level. We have to do this because applyObj of applyDeepAndMapObjs only gets called starting\n // on the object of each key\n // Reject any function return value that isn't null or false\n o => filterWithKeys(\n (v, k) => R.anyPass([R.isNil, R.equals(false)])(f(k, v)),\n o\n )\n )(obj)\n);\n\n/**\n * Given a predicate for eliminating an item based on paths, return the paths of item that don't pass the predicate.\n * keyOrIndex is the object key or array index that the item came from. We use it for the eliminateItemPredicate\n * test. If each paths current first segment matches keyOrIndex or equals '*', we consider that path.\n * With the considered paths\n * @param {Function} eliminateItemPredicate Accepts the remaining paths and optional item as a second argument.\n * Returns true if the item shall be eliminated\n * @param {[String]} paths Paths to caculate if they match the item\n * @param {*} item Item to test\n * @param {String|Number} keyOrIndex The key or index that the item belonged to of an object or array\n * @return {Object} {item: the item, paths: remaining paths with first segment removed}. Or null if eliminateItemPredicate\n * returns true\n * @private\n */\nconst _calculateRemainingPaths = (eliminateItemPredicate, paths, item, keyOrIndex) => {\n // Keep paths that match keyOrIndex as the first item. Remove other paths\n // since they can't match item or its descendants\n const tailPathsStillMatchingItemPath = compact(R.map(\n R.compose(\n R.ifElse(\n R.compose(\n aKeyOrIndex => {\n return R.ifElse(\n // if keyOrIndex is a string and matches the shape of a regex: /.../[gim]\n possibleRegex => R.both(R.is(String), str => R.test(regexToMatchARegex, str))(possibleRegex),\n // Construct the regex with one or two, the expression and options (gim)\n provenRegex => {\n const args = compactEmpty(R.split('/', provenRegex));\n return new RegExp(...args).test(keyOrIndex);\n },\n // If aKeyOrIndex is '*' or equals keyOrIndex always return true\n str => R.includes(str, ['*', keyOrIndex])\n )(aKeyOrIndex);\n },\n R.head\n ),\n // Matches the keyOrIndex at the head. Return the tail\n R.tail,\n // Mark null to remove from list\n R.always(null)),\n // Convert path to array with string keys and number indexes\n keyStringToLensPath\n ),\n paths\n ));\n // For omit:\n // If any path matches the path to the item return null so we can throw away the item\n // If no path is down to zero length return the item and the paths\n // For pick:\n // If no path matches the path to the item return null so we can throw away the item\n // If any path is not down to zero return the item and the paths, unless item is a primitive meaning it can't match\n // a path\n return R.ifElse(\n tailPaths => eliminateItemPredicate(tailPaths, item),\n R.always(null),\n p => ({item: item, paths: R.map(R.join('.'), p)})\n )(tailPathsStillMatchingItemPath);\n};\n\n// This predicate looks for any path that's zero length, meaning it matches the path to an item and we should\n// omit that item\nconst _omitDeepPathsEliminateItemPredicate = paths => R.any(R.compose(R.equals(0), R.length), paths);\n\n/**\n * Omit matching paths in a a structure. For instance omitDeepPaths(['a.b.c', 'a.0.1']) will omit keys\n * c in {a: {b: c: ...}}} and 'y' in {a: [['x', 'y']]}\n */\nexport const omitDeepPaths = R.curry((pathSet, obj) => R.cond([\n\n // Arrays\n [o => Array.isArray(o),\n list => {\n // Recurse on each array item that doesn't match the paths.\n // We pass the key without the index\n // If any path matches the path to the value we return the item and the matching paths\n const survivingItems = compact(R.addIndex(R.map)(\n (item, index) => _calculateRemainingPaths(_omitDeepPathsEliminateItemPredicate, pathSet, item, index),\n list\n ));\n return R.map(({paths, item}) => omitDeepPaths(paths, item), survivingItems);\n }\n ],\n // Primitives always pass.\n [R.complement(isObject), primitive => primitive],\n // Objects\n [R.T,\n o => {\n // Recurse on each object value that doesn't match the paths.\n const survivingItems = compact(R.mapObjIndexed(\n // If any path matches the path to the value we return the value and the matching paths\n // If no path matches it we know the value shouldn't be omitted so we don't recurse on it below\n (value, key) => _calculateRemainingPaths(_omitDeepPathsEliminateItemPredicate, pathSet, value, key),\n o\n ));\n // Only recurse on items from the object that are still eligible for omitting\n return R.map(({paths, item}) => omitDeepPaths(paths, item), survivingItems);\n }\n ]\n ]\n )(obj)\n);\n\n// This eliminate predicate returns true if no path is left matching the item's path so the item should not\n// be picked. It also returns true if the there are paths with length greater than 0\n// but item is a primitive, meaning it can't match a path\nconst _pickDeepPathsEliminateItemPredicate = (paths, item) => {\n return R.either(\n R.compose(R.equals(0), R.length),\n pths => {\n return R.both(\n // Item is not an object\n () => R.complement(R.is)(Object, item),\n ps => R.any(R.compose(R.lt(0), R.length), ps)\n )(pths);\n }\n )(paths);\n};\n/**\n * Pick matching paths in a a structure. For instance pickDeepPaths(['a.b.c', 'a.0.1']) will pick only keys\n * c in {a: {b: c: ...}}} and 'y' in {a: [['x', 'y']]}.\n * Use * in the path to capture all array items or keys, e.g. ['a.*.c./1|3/']\n * to get all items 0 or 3 of c that is in all items of a, whether a is an object or array\n */\nexport const pickDeepPaths = R.curry((pathSet, obj) => R.cond([\n // Arrays\n [o => Array.isArray(o),\n list => {\n // Recurse on each array item that doesn't match the paths. We pass the key without the index\n // We pass the key without the index\n // If any path matches the path to the value we return the item and the matching paths\n const survivingItemsEachWithRemainingPaths = compact(R.addIndex(R.map)(\n (item, index) => {\n return _calculateRemainingPaths(_pickDeepPathsEliminateItemPredicate, pathSet, item, index);\n },\n list\n ));\n return R.map(\n R.ifElse(\n // If the only paths are now empty we have a match with the items path and keep the item.\n // Otherwise we pick recursively\n ({paths}) => R.all(R.compose(R.equals(0), R.length), paths),\n ({item}) => item,\n ({item, paths}) => pickDeepPaths(paths, item)\n ),\n survivingItemsEachWithRemainingPaths\n );\n }\n ],\n // Primitives never match because we'd only get here if we have pathSets remaining and no path can match a primitive\n [R.complement(isObject),\n () => {\n throw new Error('pickDeepPaths encountered a value that is not an object or array at the top level. This should never happens and suggests a bug in this function');\n }\n ],\n // Objects\n [R.T,\n o => {\n // Recurse on each array item that doesn't match the paths. We pass the key without the index\n // If any path matches the path to the value we return the value and the matching paths\n // If no path matches it we know the value shouldn't be picked so we don't recurse on it below\n const survivingItems = compact(R.mapObjIndexed(\n (item, key) => _calculateRemainingPaths(_pickDeepPathsEliminateItemPredicate, pathSet, item, key),\n o\n ));\n return R.map(\n R.ifElse(\n // If the only path is now empty we have a match with the items path and keep the item.\n // Otherwise we pick recursively\n ({item, paths}) => R.all(R.compose(R.equals(0), R.length), paths),\n R.prop('item'),\n ({item, paths}) => pickDeepPaths(paths, item)\n ),\n survivingItems\n );\n }\n ]\n ]\n )(obj)\n);\n\n/**\n * splitAt that gives the split point item to both sides of the split\n * @param {Number} index The index\n * @param {String|[Object]} list A string or list\n * @returns {[Object]} A pair of results\n */\nexport const splitAtInclusive = (index, list) => {\n const pair = R.splitAt(index, list);\n return [\n R.concat(R.head(pair), R.slice(0, 1, R.last(pair))),\n R.last(pair)\n ];\n};\n\n/**\n * Whether the objects are equal at the given propStr. Null objects are never equal\n * @param {String} stringPath Path of props separated by dots\n * @param {Object|Array} obj1 The object to compare to obj2 at the propStr\n * @param {Object|Array} obj2 The object to compare to obj1 at the propStr\n * @returns {Boolean} True or false\n */\nexport const eqStrPath = R.curry((stringPath, obj1, obj2) => {\n return R.apply(R.equals, R.map(strPathOr(null, stringPath), [obj1, obj2]));\n});\n\n/**\n * Whether the objects are equal at the given strPaths. Null objects are never equal\n * @param [{String}] strPaths Paths of props separated by dots\n * @param {Object|Array} obj1 The object to compare to obj2 at the propStr\n * @param {Object|Array} obj2 The object to compare to obj1 at the propStr\n * @returns {Boolean} True or false\n */\nexport const eqStrPathsAll = R.curry(\n (strPaths, obj1, obj2) => R.all(prop => eqStrPath(prop, obj1, obj2), strPaths)\n);\n"],"names":["regexToMatchARegex","isObject","obj","R","Object","orEmpty","entity","compact","compactEmpty","emptyToNull","compactJoin","connector","items","mapProp","prop","objs","mapPropValueAsIndex","Array","isArray","removeDuplicateObjectsByProp","list","idOrIdFromObj","objOrId","mergeDeep","l","r","Function","concat","mergeDeepAll","mergeDeepWith","fn","left","right","mergeDeepWithConcatArrays","mergeDeepWithRecurseArrayItems","a","b","mergeDeepWithRecurseArrayItemsByRight","itemMatchBy","_mergeDeepWithRecurseArrayItemsByRight","mergeDeepWithRecurseArrayItemsByAndMergeObjectByRight","mergeObject","key","lItemsByValue","li","rItem","i","rItemValue","hasMatchingLItem","kk","ll","rr","applyDeep","mergeDeepWithRecurseArrayItemsAndMapObjs","applyObj","_mergeDeepWithRecurseArrayItemsAndMapObjs","applyDeepAndMapObjs","lr","v","vv","res","x","_","k","capitalize","str","lowercase","camelCase","replace","toUpperCase","mergeAllWithKey","head","rest","reqPath","path","maybe","isNothing","Result","resolved","segments","segment","value","Rm","reqStrPath","props","strPath","strPathOr","defaultValue","result","strPathOrNullOk","hasStrPath","reqPathPropEq","val","map","mapKeys","pairs","pair","mapKeysForLens","lens","mapDefault","keyName","module","mapDefaultAndPrefixOthers","defaultName","prefix","mapKeysAndValues","f","container","mapObjToValues","filterWithKeys","pred","transformKeys","func","renameKey","from","to","target","duplicateKey","toKeys","toKey","toArrayIfNot","arrayOrScalar","of","moveToKeys","findOne","predicate","all","matching","onlyOne","onlyOneValue","mapToObjValue","findOneValueByParams","params","findByParams","findMapped","alwaysFunc","maybeFunc","filterObjToValues","chainObjToValues","fromPairsDeep","deepPairs","first","String","replaceValuesAtDepth","n","replaceStringOrFunc","o","oo","replaceValuesAtDepthAndStringify","replaceString","JSON","stringify","replaceValuesWithCountAtDepth","c","replaceValuesWithCountAtDepthAndStringify","flattenObj","_flattenObj","flattenObjUntil","config","keys","ooo","keyStringToLensPath","keyString","NaN","parseInt","unflattenObjNoArrays","_unflattenObj","allowArrays","unflattenObj","accum","itemKeyPath","toString","itemLensPath","constainerKeyPath","Number","overDeep","omitDeep","omit_keys","omitDeepBy","_calculateRemainingPaths","eliminateItemPredicate","paths","item","keyOrIndex","tailPathsStillMatchingItemPath","aKeyOrIndex","possibleRegex","provenRegex","args","RegExp","test","tailPaths","p","_omitDeepPathsEliminateItemPredicate","omitDeepPaths","pathSet","survivingItems","index","primitive","_pickDeepPathsEliminateItemPredicate","pths","ps","pickDeepPaths","survivingItemsEachWithRemainingPaths","Error","splitAtInclusive","eqStrPath","stringPath","obj1","obj2","eqStrPathsAll","strPaths"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,IAAMA,kBAAkB,GAAG,+GAA3B;AAGA;;;;;;;IAMaC,QAAQ,GAAG,SAAXA,QAAW,CAAAC,GAAG,EAAI;AAC7B,SAAOC,IAAA,CAAKC,MAAL,EAAaF,GAAb,KAAsBA,GAAG,KAAK,IAAR,IAAgB,QAAOA,GAAP,MAAe,QAA5D;AACD;AAED;;;;;;;;IAOaG,OAAO,GAAG,SAAVA,OAAU,CAAAC,MAAM;AAAA,SAAIA,MAAM,IAAI,EAAd;AAAA;AAE7B;;;;;;;;IAOaC,OAAO,GAAGJ,QAAA,CAASA,OAAT;AAEvB;;;;;;;IAMaK,YAAY,GAAGL,QAAA,CAASA,QAAA,CAASA,OAAT,EAAkBA,SAAlB,CAAT;AAE5B;;;;;;;;IAOaM,WAAW,GAAGN,MAAA,CAAOA,SAAP,EAAkB;AAAA,SAAM,IAAN;AAAA,CAAlB;AAE3B;;;;;;;;IAOaO,WAAW,GAAGP,SAAA,CACzB,UAACQ,SAAD,EAAYC,KAAZ;AAAA,SAAsBT,MAAA,CAAOK,YAAP,EAAqBL,MAAA,CAAOQ,SAAP,CAArB,EAAwCF,WAAxC,EAAqDG,KAArD,CAAtB;AAAA,CADyB;AAI3B;;;;;;;;IAOaC,OAAO,GAAGV,OAAA,CAAQ,UAACW,IAAD,EAAOC,IAAP;AAAA,SAAgBZ,MAAA,CAAOA,MAAP,EAAeA,KAAf,EAAsBW,IAAtB,EAA4BC,IAA5B,CAAhB;AAAA,CAAR;AAEvB;;;;;;;;;;IASaC,mBAAmB,GAAGb,OAAA,CAAQ,UAACW,IAAD,EAAOZ,GAAP;AAAA,SACzCC,MAAA,CACEc,KAAK,CAACC,OADR,EAEEf,MAAA,CAAOA,MAAP,EAAeA,SAAf,EAA0BW,IAA1B,CAFF,EAGEZ,GAHF,CADyC;AAAA,CAAR;AAMnC;;;;;;;IAMaiB,4BAA4B,GAAGhB,OAAA,CAAQ,UAACW,IAAD,EAAOM,IAAP;AAAA,SAClDjB,MAAA,CACEa,mBAAmB,CAACF,IAAD,CADrB,EAEEX,QAFF,EAGEiB,IAHF,CADkD;AAAA,CAAR;AAO5C;;;;;;;;IAOaC,aAAa,GAAGlB,MAAA,CAC3B,UAAAmB,OAAO;AAAA,SAAK,QAAOA,OAAP,MAAmB,QAApB,IAAiCA,OAAO,KAAK,IAAjD;AAAA,CADoB,EAE3BnB,MAAA,CAAO,IAAP,CAF2B;AAK7B;;;;;;;;;;IASaoB,SAAS,GAAGpB,WAAA,CAAY,UAACqB,CAAD,EAAIC,CAAJ,EAAU;AAC7C;AACA;AACA;AAEGtB,IAAAA,IAAA,CAAKuB,QAAL,EAAeF,CAAf,KAAqBrB,IAAA,CAAKuB,QAAL,EAAeD,CAAf,CAAtB;AAECD,IAAAA,CAAC,IAAIA,CAAC,CAACG,MAAP,IAAiBV,KAAK,CAACC,OAAN,CAAcM,CAAd,CAFlB,IAGCC,CAAC,IAAIA,CAAC,CAACE,MAAP,IAAiBV,KAAK,CAACC,OAAN,CAAcO,CAAd,CALb,IAMP,EAAEtB,IAAA,CAAKC,MAAL,EAAaoB,CAAb,KAAmBrB,IAAA,CAAKC,MAAL,EAAaqB,CAAb,CAArB,CANO,GAOLA,CAPK,GAQLF,SAAS,CAACC,CAAD,EAAIC,CAAJ;AARX,IAH6C;AAY9C,CAZwB;AAczB;;;;;;IAKaG,YAAY,GAAGzB,QAAA,CAASoB,SAAT,EAAoB,EAApB;AAE5B;;;;;;;;;;IASaM,aAAa,GAAG1B,OAAA,CAAQ,UAAC2B,EAAD,EAAKC,IAAL,EAAWC,KAAX;AAAA,SAAqB7B,WAAA,CAAY,UAACqB,CAAD,EAAIC,CAAJ,EAAU;AAC9E;AACA;AACA,WACGD,CAAC,IAAIA,CAAC,CAACG,MAAP,IAAiBV,KAAK,CAACC,OAAN,CAAcM,CAAd,CAAlB,IACCC,CAAC,IAAIA,CAAC,CAACE,MAAP,IAAiBV,KAAK,CAACC,OAAN,CAAcO,CAAd,CAFb,IAIP,CAAEtB,KAAA,CAAMF,QAAN,CAAD,CAAkB,CAACuB,CAAD,EAAIC,CAAJ,CAAlB,CAJM,IAKPtB,KAAA,CAAMA,IAAA,CAAKuB,QAAL,CAAN,EAAsB,CAACF,CAAD,EAAIC,CAAJ,CAAtB,CALO,GAMLK,EAAE,CAACN,CAAD,EAAIC,CAAJ,CANG,GAOLI,aAAa,CAACC,EAAD,EAAKN,CAAL,EAAQC,CAAR,CAPf,CAH8E;AAW/E,GAXyD,EAWvDM,IAXuD,EAWjDC,KAXiD,CAArB;AAAA,CAAR;AAa7B;;;;;;;;IAOaC,yBAAyB,GAAG9B,OAAA,CAAQ,UAAC4B,IAAD,EAAOC,KAAP;AAAA,SAAiBH,aAAa,CAAC,UAACL,CAAD,EAAIC,CAAJ,EAAU;AACxF,WAAOtB,MAAA,CACL,CACE,CAACA,KAAA,CAAMA,SAAA,CAAU,CAACA,UAAD,EAAaA,MAAA,CAAO,QAAP,CAAb,EAA+Bc,KAAK,CAACC,OAArC,CAAV,CAAN,CAAD,EAAkEf,OAAA,CAAQA,QAAR,CAAlE,CADF,EAEE,CAACA,YAAA,CAAaA,KAAb,EAAoBF,QAApB,CAAD,EAAgCE,MAAhC,CAFF,EAGE,CAACA,GAAD,EAAMA,OAAA,CAAQ8B,yBAAR,CAAN,CAHF;AAAA,KADK,EAML,CAACT,CAAD,EAAIC,CAAJ,CANK,CAAP;AAOD,GAR8E,CAAb,CAQ/DM,IAR+D,EAQzDC,KARyD,CAAjB;AAAA,CAAR;AAUzC;;;;;;;;;IAQaE,8BAA8B,GAAG/B,OAAA,CAAQ,UAAC2B,EAAD,EAAKC,IAAL,EAAWC,KAAX;AAAA,SAAqB7B,MAAA,CACzE;AAEE,GAACA,KAAA,CAAMA,SAAA,CAAU,CAACA,UAAD,EAAaA,MAAA,CAAO,QAAP,CAAb,EAA+Bc,KAAK,CAACC,OAArC,CAAV,CAAN,CAAD,EACE,gBAAY;AAAA;AAAA,QAAVM,CAAU;AAAA,QAAPC,CAAO;;AACV,WAAOtB,SAAA,CAAU,UAACgC,CAAD,EAAIC,CAAJ;AAAA,aAAUF,8BAA8B,CAACJ,EAAD,EAAKK,CAAL,EAAQC,CAAR,CAAxC;AAAA,KAAV,EAA8DZ,CAA9D,EAAiEC,CAAjE,CAAP;AACD,GAHH,CAFF;AAQE,GAACtB,YAAA,CAAaA,KAAb,EAAoBF,QAApB,CAAD,EACE,iBAAY;AAAA;AAAA,QAAVuB,CAAU;AAAA,QAAPC,CAAO;;AACV,WAAOK,EAAE,CAACN,CAAD,EAAIC,CAAJ,CAAT;AACD,GAHH,CARF;AAaE,GAACtB,GAAD,EAAM,iBAAY;AAAA;AAAA,QAAVqB,CAAU;AAAA,QAAPC,CAAO;;AAChB,WAAOtB,WAAA,CAAY+B,8BAA8B,CAACJ,EAAD,CAA1C,EAAgDN,CAAhD,EAAmDC,CAAnD,CAAP;AACD,GAFD,CAbF,CADyE,EAkBvE,CAACM,IAAD,EAAOC,KAAP,CAlBuE,CAArB;AAAA,CAAR;AAqB9C;;;;;;;;;;;;;;;;IAeaK,qCAAqC,GAAGlC,OAAA,CAAQ,UAACmC,WAAD,EAAcP,IAAd,EAAoBC,KAApB,EAA8B;AACzF,SAAOO,sCAAsC,CAACD,WAAD,EAAc,IAAd,EAAoBP,IAApB,EAA0BC,KAA1B,EAAiC,IAAjC,CAA7C;AACD,CAFoD;AAIrD;;;;;;;;;;;;;;;;;;;;IAmBaQ,qDAAqD,GAAGrC,OAAA,CAAQ,UAACmC,WAAD,EAAcG,WAAd,EAA2BV,IAA3B,EAAiCC,KAAjC,EAA2C;AACtH,SAAOO,sCAAsC,CAACD,WAAD,EAAcG,WAAd,EAA2BV,IAA3B,EAAiCC,KAAjC,EAAwC,IAAxC,CAA7C;AACD,CAFoE;IAIxDO,sCAAsC,GAAG,SAAzCA,sCAAyC,CAACD,WAAD,EAAcG,WAAd,EAA2BV,IAA3B,EAAiCC,KAAjC,EAAwCU,GAAxC,EAAgD;AACpG,SAAOvC,MAAA,CACL;AAEE,GAAC,iBAAY;AAAA;AAAA,QAAVqB,CAAU;AAAA,QAAPC,CAAO;;AACX,WAAOtB,KAAA,CAAMA,SAAA,CAAU,CAACA,UAAD,EAAaA,MAAA,CAAO,QAAP,CAAb,EAA+Bc,KAAK,CAACC,OAArC,CAAV,CAAN,EAAgE,CAACM,CAAD,EAAIC,CAAJ,CAAhE,CAAP;AACD,GAFD,EAGE,iBAAY;AAAA;AAAA,QAAVD,CAAU;AAAA,QAAPC,CAAO;;AACV;AACA,QAAI,CAACD,CAAD,IAAM,CAACC,CAAX,EAAc;AACZ,aAAOD,CAAC,IAAIC,CAAZ;AACD,KAJS;;;AAMV,QAAMkB,aAAa,GAAGxC,SAAA,CAAU,UAAAyC,EAAE;AAAA,aAAIN,WAAW,CAACM,EAAD,EAAKF,GAAL,CAAf;AAAA,KAAZ,EAAsClB,CAAC,IAAI,EAA3C,CAAtB,CANU;;AAQV,WAAOrB,UAAA,CAAWA,KAAX,EACL,UAAC0C,KAAD,EAAQC,CAAR,EAAc;AACZ;AACA;AACA,UAAMC,UAAU,GAAGT,WAAW,CAACO,KAAD,EAAQH,GAAR,CAA9B;AACA,UAAMM,gBAAgB,GAAG7C,KAAA,CAAM4C,UAAN,EAAkBJ,aAAlB,CAAzB;AACA,aAAOxC,MAAA,CACL;AAAA,eAAM6C,gBAAN;AAAA,OADK,EAEL,YAAM;AACJ;AACA,eAAOT,sCAAsC,CAC3CD,WAD2C,EAE3CG,WAF2C,EAG3CtC,MAAA,CAAO4C,UAAP,EAAmBJ,aAAnB,CAH2C,EAI3CE,KAJ2C,EAK3CC,CAL2C,CAA7C;AAOD,OAXI,EAYLD,KAZK,CAAP;AAaD,KAnBI,EAoBLpB,CAAC,IAAI,EApBA,CAAP;AAsBD,GAjCH,CAFF;AAsCE,GAACtB,MAAA,CAAOF,QAAP,CAAD,EACE,kBAAY;AAAA;AAAA,QAAVuB,CAAU;AAAA,QAAPC,CAAO;;AACV,WAAOA,CAAP;AACD,GAHH,CAtCF;AA4CE,GAACtB,GAAD,EACE,kBAAY;AAAA;AAAA,QAAVqB,CAAU;AAAA,QAAPC,CAAO;;AACV,WAAOgB,WAAW,GAAGA,WAAW,CAACjB,CAAD,EAAIC,CAAJ,CAAd,GAAuBtB,cAAA,CACvC,UAAC8C,EAAD,EAAKC,EAAL,EAASC,EAAT,EAAgB;AACd,aAAOZ,sCAAsC,CAC3CD,WAD2C,EAE3CG,WAF2C,EAG3CS,EAH2C,EAI3CC,EAJ2C,EAK3CF,EAL2C,CAA7C;AAOD,KATsC,EAUvCzB,CAAC,IAAI,EAVkC,EAWvCC,CAAC,IAAI,EAXkC,CAAzC;AAaD,GAfH,CA5CF,CADK,EA+DL,CAACM,IAAD,EAAOC,KAAP,CA/DK,CAAP;AAgED;AAGD;;;;;;;;;IAQaoB,SAAS,GAAGjD,OAAA,CAAQ,UAAC2B,EAAD,EAAK5B,GAAL;AAAA,SAAagC,8BAA8B,CAACJ,EAAD,EAAK5B,GAAL,EAAUA,GAAV,CAA3C;AAAA,CAAR;AAGzB;;;;;;;;;;;IAUamD,wCAAwC,GAAGlD,OAAA,CAAQ,UAAC2B,EAAD,EAAKwB,QAAL,EAAevB,IAAf,EAAqBC,KAArB;AAAA,SAC9DuB,yCAAyC,CAACzB,EAAD,EAAKwB,QAAL,EAAe,IAAf,EAAqBvB,IAArB,EAA2BC,KAA3B,CADqB;AAAA,CAAR;AAIxD;;;;;;;;;;IASawB,mBAAmB,GAAGrD,OAAA,CAAQ,UAAC2B,EAAD,EAAKwB,QAAL,EAAepD,GAAf;AAAA,SACzCmD,wCAAwC,CAACvB,EAAD,EAAKwB,QAAL,EAAepD,GAAf,EAAoBA,GAApB,CADC;AAAA,CAAR;;AAInC,IAAMqD,yCAAyC,GAAGpD,OAAA,CAAQ,UAAC2B,EAAD,EAAKwB,QAAL,EAAeZ,GAAf,EAAoBX,IAApB,EAA0BC,KAA1B,EAAoC;AAC1F,SAAO7B,MAAA,CACL;AAEE,GAACA,KAAA,CAAMc,KAAK,CAACC,OAAZ,CAAD;AAEE,YAAAuC,EAAE,EAAI;AACJ,WAAOtD,OAAA,CACLA,SAAA,CACE,UAACqB,CAAD,EAAIC,CAAJ;AAAA,aAAUtB,SAAA;AAER,gBAAAuD,CAAC;AAAA,eAAIvD,MAAA;AAEH;AACAA,QAAAA,MAAA,CACE,UAAAwD,EAAE;AAAA,iBAAI,QAAOA,EAAP,MAAc,QAAlB;AAAA,SADJ,EAEExD,YAAA,CAAaA,IAAb,EAAmBc,KAAnB,CAFF,CAHG,EAOH,UAAA2C,GAAG;AAAA,iBAAIN,QAAQ,CAACZ,GAAD,EAAMkB,GAAN,CAAZ;AAAA,SAPA,EAQHF,CARG,CAAJ;AAAA,OAFO,EAWR;AAAA;AAAA,YAAET,EAAF;AAAA,YAAMC,EAAN;AAAA,YAAUC,EAAV;;AAAA,eAAkBI,yCAAyC,CAACzB,EAAD,EAAKwB,QAAL,EAAeL,EAAf,EAAmBC,EAAnB,EAAuBC,EAAvB,CAA3D;AAAA,OAXQ,EAYR,CAACT,GAAD,EAAMlB,CAAN,EAASC,CAAT,CAZQ,CAAV;AAAA,KADF,CADK,EAgBLgC,EAhBK,CAAP;AAiBD,GApBH,CAFF;AAyBE,GAACtD,YAAA,CAAaA,KAAb,EAAoB,UAAA0D,CAAC;AAAA,WAAI5D,QAAQ,CAAC4D,CAAD,CAAZ;AAAA,GAArB,CAAD,EAAwC,UAAAJ,EAAE,EAAI;AAC5C,WAAO3B,EAAE,MAAF,4BAAM2B,EAAN,UAAUf,GAAV,GAAP;AACD,GAFD,CAzBF;AA6BE,GAAC,UAAAe,EAAE;AAAA,WAAItD,KAAA,CAAMA,IAAA,CAAKuB,QAAL,CAAN,EAAsB+B,EAAtB,CAAJ;AAAA,GAAH,EAAkC,kBAAY;AAAA;AAAA,QAAVjC,CAAU;AAAA,QAAPsC,CAAO;;AAC5C,WAAOtC,CAAP;AACD,GAFD,CA7BF;AAiCE,GAACrB,GAAD,EACE,UAAAsD,EAAE,EAAI;AACJ,WAAOtD,OAAA,CACLA,cAAA,CACE,UAAC4D,CAAD,EAAIvC,CAAJ,EAAOC,CAAP;AAAA,aAAatB,SAAA;AAEX,gBAAAuD,CAAC;AAAA,eAAIvD,MAAA;AAEH;AACAA,QAAAA,MAAA,CACE,UAAA0D,CAAC;AAAA,iBAAI,QAAOA,CAAP,MAAa,QAAjB;AAAA,SADH,EAEE1D,YAAA,CAAaA,IAAb,EAAmBc,KAAnB,CAFF,CAHG,EAOH,UAAA2C,GAAG;AAAA,iBAAIN,QAAQ,CAACS,CAAD,EAAIH,GAAJ,CAAZ;AAAA,SAPA,EAQHF,CARG,CAAJ;AAAA,OAFU;AAYX;AAAA;AAAA,YAAET,EAAF;AAAA,YAAMC,EAAN;AAAA,YAAUC,EAAV;;AAAA,eAAkBhD,OAAA,CAAQoD,yCAAyC,CAACzB,EAAD,EAAKwB,QAAL,CAAjD,EAAiE,CAACL,EAAD,EAAKC,EAAL,EAASC,EAAT,CAAjE,CAAlB;AAAA,OAZW,EAaX,CAACY,CAAD,EAAIvC,CAAJ,EAAOC,CAAP,CAbW,CAAb;AAAA,KADF,CADK,EAiBLgC,EAjBK,CAAP;AAmBD,GArBH,CAjCF,CADK,EA0DL,CAAC1B,IAAD,EAAOC,KAAP,CA1DK,CAAP;AA2DD,CA5D+C,CAAlD;AAgEA;;;;;;;;;IAOagC,UAAU,GAAG,SAAbA,UAAa,CAAAC,GAAG;AAAA,SAAI9D,SAAA,CAC/BA,MAAA,CAAO,EAAP,CAD+B,EAE/BA,MAAA,CAAO,CAACA,SAAA,CAAUA,SAAV,EAAqBA,MAArB,CAAD,EAA+BA,MAA/B,CAAP,CAF+B,EAG/B8D,GAH+B,CAAJ;AAAA;AAK7B;;;;;;;;IAOaC,SAAS,GAAG,SAAZA,SAAY,CAAAD,GAAG;AAAA,SAAI9D,SAAA,CAC9BA,MAAA,CAAO,EAAP,CAD8B,EAE9BA,MAAA,CAAO,CAACA,SAAA,CAAUA,SAAV,EAAqBA,MAArB,CAAD,EAA+BA,MAA/B,CAAP,CAF8B,EAG9B8D,GAH8B,CAAJ;AAAA;AAK5B;;;;;;IAKaE,SAAS,GAAG,SAAZA,SAAY,CAAAF,GAAG;AAAA,SAC1B9D,SAAA,CAAU8D,GAAV,EAAeG,OAAf,CACE,cADF,EAEE,UAACN,CAAD,EAAID,CAAJ;AAAA,WAAUA,CAAC,CAACQ,WAAF,EAAV;AAAA,GAFF,CAD0B;AAAA;AAM5B;;;;;;;IAMaC,eAAe,GAAGnE,OAAA,CAAQ,UAAC2B,EAAD;AAAA;AAAA,MAAMyC,IAAN;AAAA,MAAeC,IAAf;;AAAA,SACrCrE,cAAA;AACE2B,EAAAA,EADF,EAEEyC,IAAI,IAAI,EAFV;AAGEpE,EAAAA,QAAA;AACEA,EAAAA,SADF;AAEE;AAAA,WAAMA,OAAA,CAAQ,EAAR,CAAN;AAAA,GAFF;AAGEmE,EAAAA,eAAe,CAACxC,EAAD,CAHjB;AAAA,IAIE0C,IAJF,CAHF,CADqC;AAAA,CAAR;AAY/B;;;;;;;;IAOaC,OAAO,GAAGtE,OAAA,CAAQ,UAACuE,IAAD,EAAOxE,GAAP,EAAe;AAC5C,SAAOC,SAAA,CACLA,QAAA;AAEE,YAAAwE,KAAK;AAAA,WAAIA,KAAK,CAACC,SAAV;AAAA,GAFP;AAIE;AAAA,WAAMC,YAAA,CAAa;AACjBC,MAAAA,QAAQ,EAAE3E,aAAA;AAER,gBAAC4E,QAAD,EAAWC,OAAX;AAAA,eAAuB7E,KAAA,CAAMA,OAAA,CAAQA,MAAA,CAAOA,QAAA,CAAS4E,QAAT,EAAmB,CAACC,OAAD,CAAnB,CAAP,EAAsC9E,GAAtC,CAAR,CAAN,CAAvB;AAAA,OAFQ;AAIR,gBAAC6E,QAAD,EAAWC,OAAX;AAAA,eAAuB7E,QAAA,CAAS4E,QAAT,EAAmB,CAACC,OAAD,CAAnB,CAAvB;AAAA,OAJQ,EAKR,EALQ,EAMRN,IANQ,CADO;AASjBA,MAAAA,IAAI,EAAEA;AATW,KAAb,CAAN;AAAA,GAJF;AAgBE,YAAAd,GAAG;AAAA,WAAIiB,SAAA,CAAUjB,GAAG,CAACqB,KAAd,CAAJ;AAAA,GAhBL,CADK;AAoBLC,EAAAA,OAAA,CAAQR,IAAR,CApBK,EAqBLxE,GArBK,CAAP;AAsBD,CAvBsB;AAyBvB;;;;;;;;;IAQaiF,UAAU,GAAGhF,OAAA,CAAQ,UAAC8D,GAAD,EAAMmB,KAAN;AAAA,SAAgBX,OAAO,CAACtE,OAAA,CAAQ,GAAR,EAAa8D,GAAb,CAAD,EAAoBmB,KAApB,CAAvB;AAAA,CAAR;AAE1B;;;;;;;;IAOaC,OAAO,GAAGlF,OAAA,CAAQ,UAAC8D,GAAD,EAAMmB,KAAN,EAAgB;AAC7C,SAAOjF,MAAA,CAAOA,UAAA,CAAWA,OAAA,CAAQ,GAAR,EAAa8D,GAAb,CAAX,CAAP,EAAsCmB,KAAtC,CAAP;AACD,CAFsB;AAIvB;;;;;;;;IAOaE,SAAS,GAAGnF,OAAA,CAAQ,UAACoF,YAAD,EAAetB,GAAf,EAAoBmB,KAApB,EAA8B;AAC7D,MAAMI,MAAM,GAAGrF,MAAA,CAAOA,UAAA,CAAWA,OAAA,CAAQ,GAAR,EAAa8D,GAAb,CAAX,CAAP,EAAsCmB,KAAtC,CAAf;AACA,SAAOjF,MAAA,CACLA,OADK,EAELA,QAAA,CAASoF,YAAT,CAFK,EAGLC,MAHK,CAAP;AAID,CANwB;IAQZC,eAAe,GAAGtF,OAAA,CAAQ,UAACoF,YAAD,EAAetB,GAAf,EAAoBmB,KAApB,EAA8B;AACnE,MAAML,QAAQ,GAAG5E,OAAA,CAAQ,GAAR,EAAa8D,GAAb,CAAjB;AACA,MAAMuB,MAAM,GAAGrF,MAAA,CAAOA,UAAA,CAAWA,MAAA,CAAO4E,QAAP,CAAX,CAAP,EAAqCK,KAArC,CAAf;AACA,SAAOjF,QAAA,CACLA,OADK,EAELA,QAAA,CAASoF,YAAT,CAFK,EAGL,UAAA9D,CAAC,EAAI;AACH,QAAI;AACF,aAAOtB,MAAA,CAAO,UAAAuD,CAAC;AAAA,eAAI,OAAOA,CAAP,KAAa,WAAjB;AAAA,OAAR,EAAsC;AAAA,eAAM6B,YAAN;AAAA,OAAtC,EAA0DpF,MAAA,CAAOA,MAAA,CAAO4E,QAAP,CAAP,EAAyBtD,CAAzB,CAA1D,CAAP;AACD,KAFD,CAEE,gBAAM;AACN,aAAO8D,YAAP;AACD;AACF,GATI,EAULC,MAVK,CAAP;AAWD,CAd8B;AAgB/B;;;;;;;IAMaE,UAAU,GAAGvF,OAAA,CAAQ,UAAC8D,GAAD,EAAMmB,KAAN;AAAA,SAChCjF,YAAA,CAAaA,OAAb,EACEA,MAAA,CAAOA,UAAA,CAAWA,OAAA,CAAQ,GAAR,EAAa8D,GAAb,CAAX,CAAP,EAAsCmB,KAAtC,CADF,CADgC;AAAA,CAAR;AAM1B;;;;;;;;;IAQaO,aAAa,GAAGxF,OAAA,CAAQ,UAACuE,IAAD,EAAOkB,GAAP,EAAY1F,GAAZ;AAAA;AAEnCuE,IAAAA,OAAO,CAACC,IAAD,EAAOxE,GAAP,CAAP,CAAmB2F,GAAnB,CAAuB1F,QAAA,CAASyF,GAAT,CAAvB;AAFmC;AAAA,CAAR;AAK7B;;;;;;;IAMaE,OAAO,GAAG3F,OAAA,CACrB,UAAC2B,EAAD,EAAK5B,GAAL;AAAA,SAAaC,SAAA,CACXA,WADW,EAEX,UAAA4F,KAAK;AAAA,WAAI5F,KAAA;AAEP,cAAA6F,IAAI;AAAA,aAAI7F,QAAA,CAAS,CAAT,EAAY2B,EAAZ,EAAgBkE,IAAhB,CAAJ;AAAA,KAFG,EAGPD,KAHO,CAAJ;AAAA,GAFM,EAOX5F,SAPW,EAQXD,GARW,CAAb;AAAA,CADqB;AAavB;;;;;;;IAMa+F,cAAc,GAAG9F,OAAA,CAAQ,UAAC+F,IAAD,EAAOpE,EAAP,EAAW5B,GAAX;AAAA;AAEpCC,IAAAA,KAAA,CAAM+F,IAAN,EAAYJ,OAAO,CAAChE,EAAD,EAAK3B,MAAA,CAAO+F,IAAP,EAAahG,GAAb,CAAL,CAAnB,EAA4CA,GAA5C;AAFoC;AAAA,CAAR;AAK9B;;;;;;;;IAOaiG,UAAU,GAAG,SAAbA,UAAa,CAACC,OAAD,EAAUC,MAAV;AAAA,SAAqBP,OAAO,CAAC,UAAApD,GAAG;AAAA,WAAIA,GAAG,KAAK,SAAR,GAAoB0D,OAApB,GAA8B1D,GAAlC;AAAA,GAAJ,EAA2C2D,MAA3C,CAA5B;AAAA;AAC1B;;;;;;;;;;IASaC,yBAAyB,GAAG,SAA5BA,yBAA4B,CAACC,WAAD,EAAcC,MAAd,EAAsBH,MAAtB;AAAA,SACvCP,OAAO,CACL,UAAApD,GAAG;AAAA,WAAKA,GAAG,KAAK,SAAT,GAAsB6D,WAAtB,aAAuCC,MAAvC,SAAgDxC,UAAU,CAACtB,GAAD,CAA1D,CAAJ;AAAA,GADE,EAEL2D,MAFK,CADgC;AAAA;AAMzC;;;;;;;;;;IASaI,gBAAgB,GAAGtG,OAAA,CAAQ,UAACuG,CAAD,EAAIC,SAAJ;AAAA,SAAkBxG,WAAA,CAAYyG,cAAc,CAACF,CAAD,EAAIC,SAAJ,CAA1B,CAAlB;AAAA,CAAR;AAEhC;;;;;;;;;IAQaE,cAAc,GAAG1G,OAAA,CAAQ,UAAC2G,IAAD,EAAO5G,GAAP,EAAe;AACnD,MAAI,CAACA,GAAL,EAAU;AACR,WAAOA,GAAP;AACD;;AACD,SAAOC,SAAA,CACLA,WADK,EAELA,QAAA,CAAS,UAAA6F,IAAI;AAAA,WAAI7F,OAAA,CAAQ2G,IAAR,EAAc3G,SAAA,CAAU6F,IAAV,CAAd,CAAJ;AAAA,GAAb,CAFK,EAGL7F,SAHK,EAILD,GAJK,CAAP;AAKD,CAT6B;AAW9B;;;;;;;IAMa6G,aAAa,GAAG5G,OAAA,CAAQ,UAAC6G,IAAD,EAAO9G,GAAP;AAAA,SACnCC,SAAA,CACEA,WADF,EAEEA,KAAA,CAAM;AAAA;AAAA,QAAEuC,GAAF;AAAA,QAAOuC,KAAP;;AAAA,WACJ,CAAC+B,IAAI,CAACtE,GAAD,CAAL,EAAYuC,KAAZ,CADI;AAAA,GAAN,CAFF,EAIE9E,SAJF,EAKED,GALF,CADmC;AAAA,CAAR;AAS7B;;;;;;;;;IAQa+G,SAAS,GAAG9G,OAAA,CAAQ,UAAC+F,IAAD,EAAOgB,IAAP,EAAaC,EAAb,EAAiBjH,GAAjB;AAAA,SAAyBC,MAAA,CACxD+F,IADwD,EAExD,UAAAkB,MAAM;AAAA,WAAItB,OAAO,CACf3F,MAAA,CAAOA,QAAA,CAAS+G,IAAT,CAAP,EAAuB/G,QAAA,CAASgH,EAAT,CAAvB,CADe,EAEfC,MAFe,CAAX;AAAA,GAFkD,EAKxDlH,GALwD,CAAzB;AAAA,CAAR;AAOzB;;;;;;;;;IAQamH,YAAY,GAAGlH,OAAA,CAAQ,UAAC+F,IAAD,EAAOxD,GAAP,EAAY4E,MAAZ,EAAoBpH,GAApB;AAAA,SAA4BC,MAAA,CAC9D+F,IAD8D;AAG9D,YAAAkB,MAAM;AAAA,WAAIjH,OAAA,CACRiH,MADQ,EAERjH,WAAA,CACEA,KAAA,CACE,UAAAoH,KAAK;AAAA,aAAI,CAACA,KAAD,EAAQpH,OAAA,CAAQiH,MAAM,CAAC1E,GAAD,CAAd,CAAR,CAAJ;AAAA,KADP,EAEE8E,YAAY,CAACF,MAAD,CAFd,CADF,CAFQ,CAAJ;AAAA,GAHwD;AAa9DpH,EAAAA,GAb8D,CAA5B;AAAA,CAAR;AAgB5B;;;;;;IAKasH,YAAY,GAAG,SAAfA,YAAe,CAAAC,aAAa,EAAI;AAC3C,SAAOtH,QAAA,CAASc,KAAK,CAACC,OAAf,EAAwBD,KAAK,CAACyG,EAA9B,EAAkCD,aAAlC,CAAP;AACD;AAED;;;;;;;;IAOaE,UAAU,GAAGxH,OAAA,CAAQ,UAAC+F,IAAD,EAAOxD,GAAP,EAAY4E,MAAZ,EAAoBpH,GAApB;AAAA,SAA4BC,MAAA,CAC5D+F,IAD4D;AAG5D;AACA,YAAAkB,MAAM;AAAA,WAAIjH,OAAA,CACRA,MAAA,CAAO,CAACuC,GAAD,CAAP,EAAc0E,MAAd,CADQ,EAERjH,WAAA,CACEA,KAAA,CACE,UAAAoH,KAAK;AAAA,aAAI,CAACA,KAAD,EAAQpH,OAAA,CAAQiH,MAAM,CAAC1E,GAAD,CAAd,CAAR,CAAJ;AAAA,KADP,EAEE4E,MAFF,CADF,CAFQ,CAAJ;AAAA,GAJsD;AAc5DpH,EAAAA,GAd4D,CAA5B;AAAA,CAAR;AAiB1B;;;;;;;;IAOa0H,OAAO,GAAGzH,OAAA,CAAQ,UAAC0H,SAAD,EAAY3H,GAAZ;AAAA,SAC7BC,QAAA;AAEE,YAAAS,KAAK;AAAA,WAAIT,QAAA,CAASA,QAAA,CAASA,MAAA,CAAOS,KAAP,CAAT,CAAT,EAAkC,CAAlC,CAAJ;AAAA,GAFP;AAIE,YAAAA,KAAK;AAAA,WAAIiE,SAAA,CAAUjE,KAAV,CAAJ;AAAA,GAJP;AAME,YAAAA,KAAK;AAAA,WAAIiE,YAAA,CAAa;AACpBiD,MAAAA,GAAG,EAAE5H,GADe;AAEpB6H,MAAAA,QAAQ,EAAEnH;AAFU,KAAb,CAAJ;AAAA,GANP,EAUET,QAAA,CAAS0H,SAAT,EAAoB3H,GAApB,CAVF,CAD6B;AAAA,CAAR;AAcvB;;;;;;IAKa8H,OAAO,GAAGJ,OAAO,CAACzH,GAAD;AAE9B;;;;;;;;IAOa8H,YAAY,GAAG9H,SAAA;AAE1BA,KAAA,CAAMA,MAAN,CAF0B,EAG1BA,KAAA,CAAMA,QAAN,CAH0B,EAI1ByH,OAAO,CAACzH,GAAD,CAJmB;AAO5B;;;;;;;IAMa+H,aAAa,GAAG/H,OAAA,CAAQ,UAACuG,CAAD,EAAIxG,GAAJ;AAAA,SAAYC,SAAA,CAAUA,WAAV,EAAuBA,KAAA,CAAM,UAAAuD,CAAC;AAAA,WAAI,CAACA,CAAD,EAAIgD,CAAC,CAAChD,CAAD,CAAL,CAAJ;AAAA,GAAP,CAAvB,EAA8CxD,GAA9C,CAAZ;AAAA,CAAR;AAG7B;;;;;;;IAMaiI,oBAAoB,GAAG,SAAvBA,oBAAuB,CAACC,MAAD,EAASxH,KAAT,EAAmB;AACrD,SAAOgH,OAAO;AAEZzH,EAAAA,SAAA;AAEEA,EAAAA,KAAA,CAAM,UAAAW,IAAI;AAAA,WAAIX,SAAA,CAAUW,IAAV,EAAgBsH,MAAhB,CAAJ;AAAA,GAAV,EACEjI,MAAA,CAAOiI,MAAP,CADF,CAFF,CAFY,EAQZjI,QAAA,CAASS,KAAT,CARY,CAAP,CASLiF,GATK,CASD1F,MATC,CAAP;AAUD;AAED;;;;;;;IAMakI,YAAY,GAAG,SAAfA,YAAe,CAACD,MAAD,EAASxH,KAAT,EAAmB;AAC7C,SAAOT,QAAA;AAELA,EAAAA,SAAA;AAEEA,EAAAA,KAAA,CAAM,UAAAW,IAAI;AAAA,WAAIX,SAAA,CAAUW,IAAV,EAAgBsH,MAAhB,CAAJ;AAAA,GAAV,EACEjI,MAAA,CAAOiI,MAAP,CADF,CAFF,CAFK,EAQLxH,KARK,CAAP;AAUD;AAED;;;;;;;IAMa0H,UAAU,GAAG,SAAbA,UAAa,CAAC5B,CAAD,EAAI9F,KAAJ,EAAc;AACtC,SAAOT,aAAA,CACLA,OADK,EAEL,UAAC2D,CAAD,EAAIhB,CAAJ;AAAA,WAAU4D,CAAC,CAAC5D,CAAD,CAAX;AAAA,GAFK,EAGL,IAHK,EAILlC,KAJK,CAAP;AAMD;AAED;;;;;;;IAMa2H,UAAU,GAAG,SAAbA,UAAa,CAAAC,SAAS;AAAA,SAAIrI,QAAA,CAASA,IAAA,CAAKuB,QAAL,CAAT,EAAyBvB,QAAzB,EAAmCqI,SAAnC,CAAJ;AAAA;AAEnC;;;;;;;;IAOa5B,cAAc,GAAGzG,OAAA,CAAQ,UAACuG,CAAD,EAAIxG,GAAJ,EAAY;AAChD,SAAOC,QAAA,CAASA,eAAA,CAAgBuG,CAAhB,EAAmBxG,GAAnB,CAAT,CAAP;AACD,CAF6B;AAI9B;;;;;;;IAMauI,iBAAiB,GAAGtI,OAAA,CAAQ,UAACuG,CAAD,EAAIxG,GAAJ,EAAY;AACnD,SAAOC,QAAA,CAAS0G,cAAc,CAACH,CAAD,EAAIxG,GAAJ,CAAvB,CAAP;AACD,CAFgC;AAGjC;;;;;;;IAMawI,gBAAgB,GAAGvI,OAAA,CAAQ,UAACuG,CAAD,EAAIxG,GAAJ,EAAY;AAClD,SAAOC,OAAA,CAAQA,UAAR,EAAoByG,cAAc,CAACF,CAAD,EAAIxG,GAAJ,CAAlC,CAAP;AACD,CAF+B;AAKhC;;;;;;;;;;;;IAWayI,aAAa,GAAG,SAAhBA,aAAgB,CAAAC,SAAS;AAAA,SAAIzI,MAAA,CACxC;AAEE,GAACc,KAAK,CAACC,OAAP,EAAgB,UAAAE,IAAI;AAAA,WAClBjB,QAAA;AAEE;AAAA;AAAA,UAAE0I,KAAF;;AAAA,aAAa1I,SAAA,CACX,CACEc,KAAK,CAACC,OADR,EAEE,UAAA2C,CAAC;AAAA,eAAI1D,SAAA,CAAUA,QAAA,CAAS,CAAT,CAAV,EAAuBA,QAAvB,EAAiC0D,CAAjC,CAAJ;AAAA,OAFH,EAGE,UAAAA,CAAC;AAAA,eAAI1D,SAAA,CAAUA,IAAA,CAAK2I,MAAL,CAAV,EAAwB3I,MAAxB,EAAgC0D,CAAhC,CAAJ;AAAA,OAHH,CADW,EAKRgF,KALQ,CAAb;AAAA,KAFF;AASE,cAAArH,CAAC;AAAA,aAAIrB,SAAA,CAAUA,WAAV,EAAuBA,KAAA,CAAM;AAAA;AAAA,YAAE4D,CAAF;AAAA,YAAKL,CAAL;;AAAA,eAAY,CAACK,CAAD,EAAI4E,aAAa,CAACjF,CAAD,CAAjB,CAAZ;AAAA,OAAN,CAAvB,EAAiElC,CAAjE,CAAJ;AAAA,KATH;AAWE,cAAAA,CAAC;AAAA,aAAIrB,KAAA,CAAM,UAAAuD,CAAC;AAAA,eAAIiF,aAAa,CAACjF,CAAD,CAAjB;AAAA,OAAP,EAA6BlC,CAA7B,CAAJ;AAAA,KAXH,EAYEJ,IAZF,CADkB;AAAA,GAApB,CAFF;AAkBE,GAACjB,GAAD,EAAMA,UAAN,CAlBF,CADwC,EAoBrCyI,SApBqC,CAAJ;AAAA;AAuBtC;;;;;;;;;;;;;AAYO,SAASG,oBAAT,CAA8BC,CAA9B,EAAiCC,mBAAjC,EAAsD/I,GAAtD,EAA2D;AAChE,SAAOC,QAAA;AAELA,EAAAA,MAAA,CAAOA,QAAA,CAASA,IAAA,CAAK,CAAL,EAAQ6I,CAAR,CAAT,CAAP,EAA6B/I,QAA7B,CAFK;AAIL,YAAAiJ,CAAC;AAAA,WAAI/I,KAAA,CAAM,UAAAgJ,EAAE;AAAA,aAAIJ,oBAAoB,CAACC,CAAC,GAAG,CAAL,EAAQC,mBAAR,EAA6BE,EAA7B,CAAxB;AAAA,KAAR,EAAkED,CAAlE,CAAJ;AAAA,GAJI;AAML,YAAAA,CAAC;AAAA,WAAI/I,MAAA,CAAOA,QAAA,CAASA,QAAA,CAAS,CAAT,EAAY6I,CAAZ,CAAT,CAAP,EAAiCT,UAAU,CAACU,mBAAD,CAA3C,EAAkEC,CAAlE,CAAJ;AAAA,GANI,EAOLhJ,GAPK,CAAP;AAQD;AAED;;;;;;;;;;;;;IAYakJ,gCAAgC,GAAG,SAAnCA,gCAAmC,CAACJ,CAAD,EAAIK,aAAJ,EAAmBnJ,GAAnB,EAA2B;AACzE,SAAOoJ,IAAI,CAACC,SAAL,CAAeR,oBAAoB,CAACC,CAAD,EAAIK,aAAJ,EAAmBnJ,GAAnB,CAAnC,CAAP;AACD;AAED;;;;;;;IAMasJ,6BAA6B,GAAG,SAAhCA,6BAAgC,CAACR,CAAD,EAAI9I,GAAJ,EAAY;AACvD,SAAO6I,oBAAoB,CACzBC,CADyB,EAEzB7I,MAAA,CACEF,QADF,EAEE,UAAAiJ,CAAC;AAAA,WAAI/I,SAAA;AAEHA,IAAAA,QAAA,CAASA,QAAA,CAASc,KAAK,CAACC,OAAN,CAAcgI,CAAd,CAAT,CAAT,EAAqC,UAAAO,CAAC;AAAA,2BAAWA,CAAX;AAAA,KAAtC,EAAuD,UAAAA,CAAC;AAAA,2BAAWA,CAAX;AAAA,KAAxD,CAFG,EAGHtJ,QAHG,EAIHA,MAJG,EAIK+I,CAJL,CAAJ;AAAA,GAFH,CAFyB,EAUzBhJ,GAVyB,CAA3B;AAWD;AAED;;;;;;;IAMawJ,yCAAyC,GAAG,SAA5CA,yCAA4C,CAACV,CAAD,EAAI9I,GAAJ,EAAY;AACnE,SAAOoJ,IAAI,CAACC,SAAL,CAAeC,6BAA6B,CAACR,CAAD,EAAI9I,GAAJ,CAA5C,CAAP;AACD;AAED;;;;;;;IAMayJ,UAAU,GAAG,SAAbA,UAAa,CAAAzJ,GAAG,EAAI;AAC/B,SAAOC,WAAA,CAAYyJ,WAAW,CAAC,EAAD,EAAK1J,GAAL,CAAvB,CAAP;AACD;AAED;;;;;;;IAMa2J,eAAe,GAAG,SAAlBA,eAAkB,CAAChC,SAAD,EAAY3H,GAAZ,EAAoB;AACjD,SAAOC,WAAA,CAAYyJ,WAAW,CAAC;AAAC/B,IAAAA,SAAS,EAATA;AAAD,GAAD,EAAc3H,GAAd,CAAvB,CAAP;AACD;;AAED,IAAM0J,WAAW,GAAG,SAAdA,WAAc,CAACE,MAAD,EAAS5J,GAAT,EAA4B;AAAA,MAAd6J,IAAc,uEAAP,EAAO;AAC9C,MAAMlC,SAAS,GAAG1H,QAAA,CAAS,IAAT,EAAe,WAAf,EAA4B2J,MAA5B,CAAlB;AACA,SAAO3J,QAAA;AAEL,YAAA+I,CAAC;AAAA,WAAI/I,MAAA,CACHF,QADG,EAEH,UAAAkJ,EAAE;AAAA,aAAIhJ,MAAA,CACJ;AAAA,eAAM0H,SAAN;AAAA,OADI,EAEJ,UAAAmC,GAAG;AAAA,eAAI7J,YAAA,CAAa0H,SAAb,EAAwBmC,GAAxB,CAAJ;AAAA,OAFC,EAGJb,EAHI,CAAJ;AAAA,KAFC,EAMHD,CANG,CAAJ;AAAA,GAFI;AAUL,YAAAA,CAAC;AAAA,WAAIR,gBAAgB,CAAC,UAACS,EAAD,EAAKpF,CAAL;AAAA,aAAW6F,WAAW,CAACE,MAAD,EAASX,EAAT,EAAahJ,QAAA,CAAS4J,IAAT,EAAe,CAAChG,CAAD,CAAf,CAAb,CAAtB;AAAA,KAAD,EAA0DmF,CAA1D,CAApB;AAAA,GAVI;AAYL,YAAAA,CAAC;AAAA,WAAI,CAAC,CAAC/I,MAAA,CAAO,GAAP,EAAY4J,IAAZ,CAAD,EAAoBb,CAApB,CAAD,CAAJ;AAAA,GAZI,EAaLhJ,GAbK,CAAP;AAcD,CAhBD;AAkBA;;;;;;;IAKa+J,mBAAmB,GAAG,SAAtBA,mBAAsB,CAAAC,SAAS;AAAA,SAAI/J,KAAA,CAC9CA,MAAA,CAAOA,SAAA,CAAUA,YAAA,CAAaA,QAAb,EAAuBgK,GAAvB,CAAV,EAAuCC,QAAvC,CAAP,EAAyDA,QAAzD,CAD8C,EAE9CjK,OAAA,CAAQ,GAAR,EAAa+J,SAAb,CAF8C,CAAJ;AAAA;AAK5C;;;;;;IAKaG,oBAAoB,GAAG,SAAvBA,oBAAuB,CAAAnK,GAAG,EAAI;AACzC,SAAOoK,aAAa,CAAC;AAACC,IAAAA,WAAW,EAAE;AAAd,GAAD,EAAuBrK,GAAvB,CAApB;AACD;AAED;;;;;;IAKasK,YAAY,GAAG,SAAfA,YAAe,CAAAtK,GAAG,EAAI;AACjC,SAAOoK,aAAa,CAAC;AAACC,IAAAA,WAAW,EAAE;AAAd,GAAD,EAAsBrK,GAAtB,CAApB;AACD;IAEYoK,aAAa,GAAG,SAAhBA,aAAgB,CAACR,MAAD,EAAS5J,GAAT,EAAiB;AAC5C,SAAOC,SAAA,CACLA,QAAA,CACE,UAACsK,KAAD,UAA+B;AAAA;AAAA,QAAtBP,SAAsB;AAAA,QAAXjF,KAAW;;AAC7B;AACA,QAAMyF,WAAW,GAAGvK,KAAA,CAClB,UAAAuC,GAAG,EAAI;AACL,aAAOvC,MAAA,CACL;AAAA,eAAMA,KAAA,CAAMA,MAAA,CAAO,aAAP,EAAsB2J,MAAtB,CAAN,CAAN;AAAA,OADK,EAEL,UAAA/F,CAAC;AAAA,eAAIA,CAAC,CAAC4G,QAAF,EAAJ;AAAA,OAFI,EAGLjI,GAHK,CAAP;AAID,KANiB,EAOlBuH,mBAAmB,CAACC,SAAD,CAPD,CAApB,CAF6B;;AAY7B,QAAMU,YAAY,GAAGzK,UAAA,CAAWuK,WAAX,CAArB,CAZ6B;;AAc7B,QAAMG,iBAAiB,GAAG1K,MAAA,CAAOuK,WAAP,CAA1B;AACA,QAAM/D,SAAS,GAAGxG,QAAA;AAEhBA,IAAAA,MAAA,CAAOA,QAAA,CAASA,QAAA,CAAS0K,iBAAT,CAAT,CAAP,EAA8C1K,MAAA,CAAOA,UAAA,CAAW0K,iBAAX,CAAP,CAA9C,CAFgB;AAIhB;AACA,cAAAhH,CAAC;AAAA,aAAI1D,WAAA,CACHA,QAAA,CACE,UAAAuD,CAAC;AAAA,eAAIvD,MAAA,CAAO;AAAA,iBAAMA,MAAA,CAAO,aAAP,EAAsB2J,MAAtB,CAAN;AAAA,SAAP,EAA4C3J,IAAA,CAAK2K,MAAL,CAA5C,EAA0DpH,CAA1D,CAAJ;AAAA,OADH,EAEEvD,QAAA,CAAS,EAAT,CAFF,EAGEA,QAAA,CAAS,EAAT,CAHF,EAIEA,MAAA,CAAOuK,WAAP,CAJF,CADG,EAMH7G,CANG,CAAJ;AAAA,KALe,EAYhB4G,KAZgB,CAAlB,CAf6B;;AA6B7B,WAAOtK,KAAA,CACLyK,YADK,EAEL3F,KAFK,EAGL0B,SAHK,CAAP;AAKD,GAnCH;AAqCE,MArCF,CADK,EAwCLxG,SAxCK,EAyCLD,GAzCK,CAAP;AA0CD;AAED;;;;;;;IAMa6K,QAAQ,GAAG5K,OAAA,CAAQ,UAAC6G,IAAD,EAAO9G,GAAP;AAAA,SAAemD,wCAAwC;AAErF,YAAC7B,CAAD,EAAIC,CAAJ,EAAOsC,CAAP;AAAA,WAAavC,CAAb;AAAA,GAFqF,EAGrFwF,IAHqF;AAKrF9G,EAAAA,GALqF,EAMrFA,GANqF,CAAvD;AAAA,CAAR;AAUxB;;;;;IAIa8K,QAAQ,GAAG7K,OAAA,CACtB,UAAC8K,SAAD,EAAY/K,GAAZ;AAAA,SAAoBgL,UAAU,CAC5B,UAACnH,CAAD,EAAIL,CAAJ;AAAA,WAAUvD,UAAA,CAAW4D,CAAX,EAAckH,SAAd,CAAV;AAAA,GAD4B,EAE5B/K,GAF4B,CAA9B;AAAA,CADsB;AAOxB;;;;;;;IAMagL,UAAU,GAAG/K,OAAA,CACxB,UAACuG,CAAD,EAAIxG,GAAJ;AAAA,SAAYC,SAAA,CACV,UAAA+I,CAAC;AAAA,WAAI1F,mBAAmB;AAEtB;AACA,cAAChC,CAAD,EAAIC,CAAJ,EAAOwB,EAAP;AAAA,aAAc9C,QAAA;AAEZ,gBAAA4D,CAAC;AAAA,eAAI5D,SAAA,CAAU,CAACA,OAAD,EAAUA,QAAA,CAAS,KAAT,CAAV,CAAV,EAAsCuG,CAAC,CAAC3C,CAAD,EAAIvC,CAAJ,CAAvC,CAAJ;AAAA,OAFW,EAGZrB,QAAA,CAASqB,CAAT,CAHY,EAIZ;AAAA,eAAO,EAAP;AAAA,OAJY,EAKZyB,EALY,CAAd;AAAA,KAHsB;AAUtB,cAACP,GAAD,EAAM8C,MAAN;AAAA,aAAiBqB,cAAc,CAC7B,UAACnD,CAAD,EAAIK,CAAJ;AAAA,eAAU5D,SAAA,CAAU,CAACA,OAAD,EAAUA,QAAA,CAAS,KAAT,CAAV,CAAV,EAAsCuG,CAAC,CAAC3C,CAAD,EAAIL,CAAJ,CAAvC,CAAV;AAAA,OAD6B,EAE7B8B,MAF6B,CAA/B;AAAA,KAVsB,EActB0D,CAdsB,CAAvB;AAAA,GADS;AAkBV;AACA;AACA,YAAAA,CAAC;AAAA,WAAIrC,cAAc,CACjB,UAACnD,CAAD,EAAIK,CAAJ;AAAA,aAAU5D,SAAA,CAAU,CAACA,OAAD,EAAUA,QAAA,CAAS,KAAT,CAAV,CAAV,EAAsCuG,CAAC,CAAC3C,CAAD,EAAIL,CAAJ,CAAvC,CAAV;AAAA,KADiB,EAEjBwF,CAFiB,CAAlB;AAAA,GApBS,EAwBVhJ,GAxBU,CAAZ;AAAA,CADwB;AA4B1B;;;;;;;;;;;;;;;AAcA,IAAMiL,wBAAwB,GAAG,SAA3BA,wBAA2B,CAACC,sBAAD,EAAyBC,KAAzB,EAAgCC,IAAhC,EAAsCC,UAAtC,EAAqD;AACpF;AACA;AACA,MAAMC,8BAA8B,GAAGjL,OAAO,CAACJ,KAAA,CAC7CA,SAAA,CACEA,QAAA,CACEA,SAAA,CACE,UAAAsL,WAAW,EAAI;AACb,WAAOtL,QAAA;AAEL,cAAAuL,aAAa;AAAA,aAAIvL,MAAA,CAAOA,IAAA,CAAK2I,MAAL,CAAP,EAAqB,UAAA7E,GAAG;AAAA,eAAI9D,MAAA,CAAOH,kBAAP,EAA2BiE,GAA3B,CAAJ;AAAA,OAAxB,EAA6DyH,aAA7D,CAAJ;AAAA,KAFR;AAIL,cAAAC,WAAW,EAAI;AACb,UAAMC,IAAI,GAAGpL,YAAY,CAACL,OAAA,CAAQ,GAAR,EAAawL,WAAb,CAAD,CAAzB;AACA,aAAO,WAAIE,MAAJ,qBAAcD,IAAd,GAAoBE,IAApB,CAAyBP,UAAzB,CAAP;AACD,KAPI;AASL,cAAAtH,GAAG;AAAA,aAAI9D,UAAA,CAAW8D,GAAX,EAAgB,CAAC,GAAD,EAAMsH,UAAN,CAAhB,CAAJ;AAAA,KATE,EAULE,WAVK,CAAP;AAWD,GAbH,EAcEtL,MAdF,CADF;AAkBEA,EAAAA,MAlBF;AAoBEA,EAAAA,QAAA,CAAS,IAAT,CApBF,CADF;AAuBE8J,EAAAA,mBAvBF,CAD6C,EA0B7CoB,KA1B6C,CAAD,CAA9C,CAHoF;AAgCpF;AACA;AACA;AACA;AACA;AACA;;AACA,SAAOlL,QAAA,CACL,UAAA4L,SAAS;AAAA,WAAIX,sBAAsB,CAACW,SAAD,EAAYT,IAAZ,CAA1B;AAAA,GADJ,EAELnL,QAAA,CAAS,IAAT,CAFK,EAGL,UAAA6L,CAAC;AAAA,WAAK;AAACV,MAAAA,IAAI,EAAEA,IAAP;AAAaD,MAAAA,KAAK,EAAElL,KAAA,CAAMA,MAAA,CAAO,GAAP,CAAN,EAAmB6L,CAAnB;AAApB,KAAL;AAAA,GAHI,EAILR,8BAJK,CAAP;AAKD,CA3CD;AA8CA;;;AACA,IAAMS,oCAAoC,GAAG,SAAvCA,oCAAuC,CAAAZ,KAAK;AAAA,SAAIlL,KAAA,CAAMA,SAAA,CAAUA,QAAA,CAAS,CAAT,CAAV,EAAuBA,QAAvB,CAAN,EAAwCkL,KAAxC,CAAJ;AAAA,CAAlD;AAEA;;;;;;IAIaa,aAAa,GAAG/L,OAAA,CAAQ,UAACgM,OAAD,EAAUjM,GAAV;AAAA,SAAkBC,MAAA,CAAO;AAG1D,GAAC,UAAA+I,CAAC;AAAA,WAAIjI,KAAK,CAACC,OAAN,CAAcgI,CAAd,CAAJ;AAAA,GAAF,EACE,UAAA9H,IAAI,EAAI;AACN;AACA;AACA;AACA,QAAMgL,cAAc,GAAG7L,OAAO,CAACJ,UAAA,CAAWA,KAAX,EAC7B,UAACmL,IAAD,EAAOe,KAAP;AAAA,aAAiBlB,wBAAwB,CAACc,oCAAD,EAAuCE,OAAvC,EAAgDb,IAAhD,EAAsDe,KAAtD,CAAzC;AAAA,KAD6B,EAE7BjL,IAF6B,CAAD,CAA9B;AAIA,WAAOjB,KAAA,CAAM;AAAA,UAAEkL,KAAF,UAAEA,KAAF;AAAA,UAASC,IAAT,UAASA,IAAT;AAAA,aAAmBY,aAAa,CAACb,KAAD,EAAQC,IAAR,CAAhC;AAAA,KAAN,EAAqDc,cAArD,CAAP;AACD,GAVH,CAH0D;AAgB1D,GAACjM,YAAA,CAAaF,QAAb,CAAD,EAAyB,UAAAqM,SAAS;AAAA,WAAIA,SAAJ;AAAA,GAAlC,CAhB0D;AAkB1D,GAACnM,GAAD,EACE,UAAA+I,CAAC,EAAI;AACH;AACA,QAAMkD,cAAc,GAAG7L,OAAO,CAACJ,eAAA;AAE7B;AACA,cAAC8E,KAAD,EAAQvC,GAAR;AAAA,aAAgByI,wBAAwB,CAACc,oCAAD,EAAuCE,OAAvC,EAAgDlH,KAAhD,EAAuDvC,GAAvD,CAAxC;AAAA,KAH6B,EAI7BwG,CAJ6B,CAAD,CAA9B,CAFG;;AASH,WAAO/I,KAAA,CAAM;AAAA,UAAEkL,KAAF,UAAEA,KAAF;AAAA,UAASC,IAAT,UAASA,IAAT;AAAA,aAAmBY,aAAa,CAACb,KAAD,EAAQC,IAAR,CAAhC;AAAA,KAAN,EAAqDc,cAArD,CAAP;AACD,GAXH,CAlB0D,CAAP,EAgCnDlM,GAhCmD,CAAlB;AAAA,CAAR;AAoC7B;AACA;;AACA,IAAMqM,oCAAoC,GAAG,SAAvCA,oCAAuC,CAAClB,KAAD,EAAQC,IAAR,EAAiB;AAC5D,SAAOnL,QAAA,CACLA,SAAA,CAAUA,QAAA,CAAS,CAAT,CAAV,EAAuBA,QAAvB,CADK,EAEL,UAAAqM,IAAI,EAAI;AACN,WAAOrM,MAAA;AAEL;AAAA,aAAMA,YAAA,CAAaA,IAAb,EAAmBC,MAAnB,EAA2BkL,IAA3B,CAAN;AAAA,KAFK,EAGL,UAAAmB,EAAE;AAAA,aAAItM,KAAA,CAAMA,SAAA,CAAUA,IAAA,CAAK,CAAL,CAAV,EAAmBA,QAAnB,CAAN,EAAoCsM,EAApC,CAAJ;AAAA,KAHG,EAILD,IAJK,CAAP;AAKD,GARI,EASLnB,KATK,CAAP;AAUD,CAXD;AAYA;;;;;;;;IAMaqB,aAAa,GAAGvM,OAAA,CAAQ,UAACgM,OAAD,EAAUjM,GAAV;AAAA,SAAkBC,MAAA,CAAO;AAE1D,GAAC,UAAA+I,CAAC;AAAA,WAAIjI,KAAK,CAACC,OAAN,CAAcgI,CAAd,CAAJ;AAAA,GAAF,EACE,UAAA9H,IAAI,EAAI;AACN;AACA;AACA;AACA,QAAMuL,oCAAoC,GAAGpM,OAAO,CAACJ,UAAA,CAAWA,KAAX,EACnD,UAACmL,IAAD,EAAOe,KAAP,EAAiB;AACf,aAAOlB,wBAAwB,CAACoB,oCAAD,EAAuCJ,OAAvC,EAAgDb,IAAhD,EAAsDe,KAAtD,CAA/B;AACD,KAHkD,EAInDjL,IAJmD,CAAD,CAApD;AAMA,WAAOjB,KAAA,CACLA,QAAA;AAEE;AACA;AAAA,UAAEkL,KAAF,UAAEA,KAAF;AAAA,aAAalL,KAAA,CAAMA,SAAA,CAAUA,QAAA,CAAS,CAAT,CAAV,EAAuBA,QAAvB,CAAN,EAAwCkL,KAAxC,CAAb;AAAA,KAHF,EAIE;AAAA,UAAEC,IAAF,UAAEA,IAAF;AAAA,aAAYA,IAAZ;AAAA,KAJF,EAKE;AAAA,UAAEA,IAAF,UAAEA,IAAF;AAAA,UAAQD,KAAR,UAAQA,KAAR;AAAA,aAAmBqB,aAAa,CAACrB,KAAD,EAAQC,IAAR,CAAhC;AAAA,KALF,CADK,EAQLqB,oCARK,CAAP;AAUD,GArBH,CAF0D;AA0B1D,GAACxM,YAAA,CAAaF,QAAb,CAAD,EACE,YAAM;AACJ,UAAM,IAAI2M,KAAJ,CAAU,kJAAV,CAAN;AACD,GAHH,CA1B0D;AAgC1D,GAACzM,GAAD,EACE,UAAA+I,CAAC,EAAI;AACH;AACA;AACA;AACA,QAAMkD,cAAc,GAAG7L,OAAO,CAACJ,eAAA,CAC7B,UAACmL,IAAD,EAAO5I,GAAP;AAAA,aAAeyI,wBAAwB,CAACoB,oCAAD,EAAuCJ,OAAvC,EAAgDb,IAAhD,EAAsD5I,GAAtD,CAAvC;AAAA,KAD6B,EAE7BwG,CAF6B,CAAD,CAA9B;AAIA,WAAO/I,KAAA,CACLA,QAAA;AAEE;AACA;AAAA,UAAEmL,IAAF,UAAEA,IAAF;AAAA,UAAQD,KAAR,UAAQA,KAAR;AAAA,aAAmBlL,KAAA,CAAMA,SAAA,CAAUA,QAAA,CAAS,CAAT,CAAV,EAAuBA,QAAvB,CAAN,EAAwCkL,KAAxC,CAAnB;AAAA,KAHF,EAIElL,MAAA,CAAO,MAAP,CAJF,EAKE;AAAA,UAAEmL,IAAF,UAAEA,IAAF;AAAA,UAAQD,KAAR,UAAQA,KAAR;AAAA,aAAmBqB,aAAa,CAACrB,KAAD,EAAQC,IAAR,CAAhC;AAAA,KALF,CADK,EAQLc,cARK,CAAP;AAUD,GAnBH,CAhC0D,CAAP,EAsDnDlM,GAtDmD,CAAlB;AAAA,CAAR;AAyD7B;;;;;;;IAMa2M,gBAAgB,GAAG,SAAnBA,gBAAmB,CAACR,KAAD,EAAQjL,IAAR,EAAiB;AAC/C,MAAM4E,IAAI,GAAG7F,SAAA,CAAUkM,KAAV,EAAiBjL,IAAjB,CAAb;AACA,SAAO,CACLjB,QAAA,CAASA,MAAA,CAAO6F,IAAP,CAAT,EAAuB7F,OAAA,CAAQ,CAAR,EAAW,CAAX,EAAcA,MAAA,CAAO6F,IAAP,CAAd,CAAvB,CADK,EAEL7F,MAAA,CAAO6F,IAAP,CAFK,CAAP;AAID;AAED;;;;;;;;IAOa8G,SAAS,GAAG3M,OAAA,CAAQ,UAAC4M,UAAD,EAAaC,IAAb,EAAmBC,IAAnB,EAA4B;AAC3D,SAAO9M,OAAA,CAAQA,QAAR,EAAkBA,KAAA,CAAMmF,SAAS,CAAC,IAAD,EAAOyH,UAAP,CAAf,EAAmC,CAACC,IAAD,EAAOC,IAAP,CAAnC,CAAlB,CAAP;AACD,CAFwB;AAIzB;;;;;;;;IAOaC,aAAa,GAAG/M,OAAA,CAC3B,UAACgN,QAAD,EAAWH,IAAX,EAAiBC,IAAjB;AAAA,SAA0B9M,KAAA,CAAM,UAAAW,IAAI;AAAA,WAAIgM,SAAS,CAAChM,IAAD,EAAOkM,IAAP,EAAaC,IAAb,CAAb;AAAA,GAAV,EAA2CE,QAA3C,CAA1B;AAAA,CAD2B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"} |