@itwin/core-bentley 3.6.0-dev.11 → 3.6.0-dev.21

package/lib/esm/JsonUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"JsonUtils.js","sourceRoot":"","sources":["../../src/JsonUtils.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;GAEG;AACH,MAAM,KAAW,SAAS,CA2IzB;AA3ID,WAAiB,SAAS;IACxB;;;;OAIG;IACH,SAAgB,MAAM,CAAC,IAAS,EAAE,UAAU,GAAG,KAAK;QAClD,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACvD,CAAC;IAFe,gBAAM,SAErB,CAAA;IACD;;;;OAIG;IACH,SAAgB,KAAK,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC;QAC7C,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;IACpE,CAAC;IAFe,eAAK,QAEpB,CAAA;IACD;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC;QAChD,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;IACxD,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IACD;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,EAAE;QACjD,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;IAChE,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IAED;;;OAGG;IACH,SAAgB,OAAO,CAAC,IAAS;QAC/B,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IAChD,CAAC;IAFe,iBAAO,UAEtB,CAAA;IAED;;;OAGG;IACH,SAAgB,QAAQ,CAAC,IAAS;QAChC,OAAO,QAAQ,KAAK,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACrD,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,iBAAiB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAW,EAAE,UAAkB;QACvF,IAAI,GAAG,KAAK,UAAU;YACpB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;YAEjB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACpB,CAAC;IALe,2BAAiB,oBAKhC,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,kBAAkB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAY,EAAE,UAAmB;QAC1F,IAAI,GAAG,KAAK,UAAU;YACpB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;YAEjB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACpB,CAAC;IALe,4BAAkB,qBAKjC,CAAA;IAED;;;OAGG;IACH,SAAgB,aAAa,CAAC,IAAS;QACrC,OAAO,QAAQ,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IACpE,CAAC;IAFe,uBAAa,gBAE5B,CAAA;IAED;;;OAGG;IACH,SAAgB,wBAAwB,CAAC,IAAS;QAChD,OAAO,SAAS,KAAK,IAAI,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC;IAFe,kCAAwB,2BAEvC,CAAA;IAED,SAAS,iBAAiB,CAAC,IAAS;QAClC,OAAO,IAAI,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACH,SAAgB,gBAAgB,CAAC,KAAU;QACzC,OAAO,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAFe,0BAAgB,mBAE/B,CAAA;IAED;;;OAGG;IACH,SAAgB,QAAQ,CAAC,GAAQ;QAC/B,IAAI,OAAO,GAAG,KAAK,SAAS,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,QAAQ;YAChF,OAAO,GAAG,CAAC;QAEb,IAAI,OAAO,GAAG,KAAK,QAAQ;YACzB,OAAO,SAAS,CAAC;QAEnB,mDAAmD;QACnD,IAAI,OAAO,GAAG,CAAC,MAAM,KAAK,WAAW;YACnC,OAAO,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAEhC,yCAAyC;QACzC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;YACtB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,OAAO,GAAG,CAAC;SACZ;QAED,wBAAwB;QACxB,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,MAAM,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAC/C,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YACzC,IAAI,YAAY,KAAK,SAAS;gBAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,OAAO,GAAG,CAAC;IACb,CAAC;IA3Be,kBAAQ,WA2BvB,CAAA;AAEH,CAAC,EA3IgB,SAAS,KAAT,SAAS,QA2IzB","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Json\r\n */\r\n\r\n/** Utility functions for converting from JSON objects, with default values.\r\n * @public\r\n */\r\nexport namespace JsonUtils {\r\n  /** Get a value as a boolean.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to boolean\r\n   * @returns the value of json as a boolean, or default value\r\n   */\r\n  export function asBool(json: any, defaultVal = false): boolean {\r\n    return isNullOrUndefined(json) ? defaultVal : !!json;\r\n  }\r\n  /** Get a value as an integer.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to integer\r\n   * @returns the value of json as an integer, or default value\r\n   */\r\n  export function asInt(json: any, defaultVal = 0): number {\r\n    return (typeof json === \"number\") ? Math.trunc(json) : defaultVal;\r\n  }\r\n  /** Get a value as a double.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to double\r\n   * @returns the value of json as a double, or default value\r\n   */\r\n  export function asDouble(json: any, defaultVal = 0): number {\r\n    return (typeof json === \"number\") ? json : defaultVal;\r\n  }\r\n  /** Get a value as a string.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to string\r\n   * @returns the value of json as a string, or default value\r\n   */\r\n  export function asString(json: any, defaultVal = \"\"): string {\r\n    return isNullOrUndefined(json) ? defaultVal : json.toString();\r\n  }\r\n\r\n  /** Get a value as an array.\r\n   * @param json the input JSON object\r\n   * @returns the input JSON object if it is an array, otherwise undefined\r\n   */\r\n  export function asArray(json: any): any {\r\n    return Array.isArray(json) ? json : undefined;\r\n  }\r\n\r\n  /** Get a value as an object.\r\n   * @param json the input JSON object\r\n   * @returns the input JSON object if it is an object, otherwise undefined\r\n   */\r\n  export function asObject(json: any): any {\r\n    return \"object\" === typeof json ? json : undefined;\r\n  }\r\n\r\n  /** Set or remove a number on a json object, given a key name, a value, and a default value. Sets `json[key] = val` if val is *not* equal to the default,\r\n   * otherwise `delete json[key]`. This is used to omit values from JSON strings that are of known defaults.\r\n   * @param json the JSON object to affect\r\n   * @param key the name of the member to set or remove\r\n   * @param val the value to set\r\n   * @param defaultVal the default value.\r\n   */\r\n  export function setOrRemoveNumber(json: any, key: string, val: number, defaultVal: number) {\r\n    if (val === defaultVal)\r\n      delete json[key];\r\n    else\r\n      json[key] = val;\r\n  }\r\n\r\n  /** Set or remove a boolean on a json object, given a key name, a value, and a default value. Sets `json[key] = val` if val is *not* equal to the default,\r\n   * otherwise `delete json[key]`. This is used to omit values from JSON strings that are of known defaults.\r\n   * @param json the JSON object to affect\r\n   * @param key the name of the member to set or remove\r\n   * @param val the value to set\r\n   * @param defaultVal the default value.\r\n   */\r\n  export function setOrRemoveBoolean(json: any, key: string, val: boolean, defaultVal: boolean) {\r\n    if (val === defaultVal)\r\n      delete json[key];\r\n    else\r\n      json[key] = val;\r\n  }\r\n\r\n  /** Determine if a Javascript object is equivalent to `{}`.\r\n   * @param json The JSON object to test.\r\n   * @returns true if `json` is an Object with no keys.\r\n   */\r\n  export function isEmptyObject(json: any): boolean {\r\n    return \"object\" === typeof json && 0 === Object.keys(json).length;\r\n  }\r\n\r\n  /** Determine if the input is undefined or an empty Javascript object.\r\n   * @param json The JSON object to test.\r\n   * @returns true if `json` is undefined or is an Object with no keys (equivalent to `{}`).\r\n   */\r\n  export function isEmptyObjectOrUndefined(json: any): boolean {\r\n    return undefined === json || isEmptyObject(json);\r\n  }\r\n\r\n  function isNullOrUndefined(json: any): boolean {\r\n    return null === json || undefined === json;\r\n  }\r\n\r\n  /** Determine if the input is a non-empty Javascript object.\r\n   * @param value The value to test.\r\n   * @returns true if `value` is an Object with at least one key.\r\n   */\r\n  export function isNonEmptyObject(value: any): value is Object {\r\n    return !isEmptyObjectOrUndefined(value);\r\n  }\r\n\r\n  /**\r\n   * Convert the input object into a \"pure\" JavaScript object, with only instances of \"object\" or primitives in the returned value.\r\n   * Works recursively for object members, and over arrays entries. Calls \"toJSON\" on any members that implement it.\r\n   */\r\n  export function toObject(val: any): any {\r\n    if (typeof val === \"boolean\" || typeof val === \"number\" || typeof val === \"string\")\r\n      return val;\r\n\r\n    if (typeof val !== \"object\")\r\n      return undefined;\r\n\r\n    // See if the object has toJSON() function defined.\r\n    if (typeof val.toJSON !== \"undefined\")\r\n      return toObject(val.toJSON());\r\n\r\n    // if it's an array, convert each member.\r\n    if (Array.isArray(val)) {\r\n      const arr = new Array(val.length);\r\n      val.forEach((el, i) => arr[i] = toObject(el));\r\n      return arr;\r\n    }\r\n\r\n    // Convert each property\r\n    const out: any = {};\r\n    Object.getOwnPropertyNames(val).forEach((prop) => {\r\n      const transformVal = toObject(val[prop]);\r\n      if (transformVal !== undefined)\r\n        out[prop] = transformVal;\r\n    });\r\n\r\n    return out;\r\n  }\r\n\r\n}\r\n"]}
+{"version":3,"file":"JsonUtils.js","sourceRoot":"","sources":["../../src/JsonUtils.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;GAEG;AACH,MAAM,KAAW,SAAS,CA2IzB;AA3ID,WAAiB,SAAS;IACxB;;;;OAIG;IACH,SAAgB,MAAM,CAAC,IAAS,EAAE,UAAU,GAAG,KAAK;QAClD,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACvD,CAAC;IAFe,gBAAM,SAErB,CAAA;IACD;;;;OAIG;IACH,SAAgB,KAAK,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC;QAC7C,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;IACpE,CAAC;IAFe,eAAK,QAEpB,CAAA;IACD;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC;QAChD,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;IACxD,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IACD;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,EAAE;QACjD,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;IAChE,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IAED;;;OAGG;IACH,SAAgB,OAAO,CAAC,IAAS;QAC/B,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IAChD,CAAC;IAFe,iBAAO,UAEtB,CAAA;IAED;;;OAGG;IACH,SAAgB,QAAQ,CAAC,IAAS;QAChC,OAAO,QAAQ,KAAK,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACrD,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,iBAAiB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAW,EAAE,UAAkB;QACvF,IAAI,GAAG,KAAK,UAAU;YACpB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;YAEjB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACpB,CAAC;IALe,2BAAiB,oBAKhC,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,kBAAkB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAY,EAAE,UAAmB;QAC1F,IAAI,GAAG,KAAK,UAAU;YACpB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;YAEjB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACpB,CAAC;IALe,4BAAkB,qBAKjC,CAAA;IAED;;;OAGG;IACH,SAAgB,aAAa,CAAC,IAAS;QACrC,OAAO,QAAQ,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IACpE,CAAC;IAFe,uBAAa,gBAE5B,CAAA;IAED;;;OAGG;IACH,SAAgB,wBAAwB,CAAC,IAAS;QAChD,OAAO,SAAS,KAAK,IAAI,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC;IAFe,kCAAwB,2BAEvC,CAAA;IAED,SAAS,iBAAiB,CAAC,IAAS;QAClC,OAAO,IAAI,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACH,SAAgB,gBAAgB,CAAC,KAAU;QACzC,OAAO,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAFe,0BAAgB,mBAE/B,CAAA;IAED;;;OAGG;IACH,SAAgB,QAAQ,CAAC,GAAQ;QAC/B,IAAI,OAAO,GAAG,KAAK,SAAS,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,QAAQ;YAChF,OAAO,GAAG,CAAC;QAEb,IAAI,OAAO,GAAG,KAAK,QAAQ;YACzB,OAAO,SAAS,CAAC;QAEnB,mDAAmD;QACnD,IAAI,OAAO,GAAG,CAAC,MAAM,KAAK,WAAW;YACnC,OAAO,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAEhC,yCAAyC;QACzC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;YACtB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,OAAO,GAAG,CAAC;SACZ;QAED,wBAAwB;QACxB,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,MAAM,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAC/C,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YACzC,IAAI,YAAY,KAAK,SAAS;gBAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,OAAO,GAAG,CAAC;IACb,CAAC;IA3Be,kBAAQ,WA2BvB,CAAA;AAEH,CAAC,EA3IgB,SAAS,KAAT,SAAS,QA2IzB","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Json\n */\n\n/** Utility functions for converting from JSON objects, with default values.\n * @public\n */\nexport namespace JsonUtils {\n  /** Get a value as a boolean.\n   * @param json the input JSON object\n   * @param defaultVal default value if json cannot be converted to boolean\n   * @returns the value of json as a boolean, or default value\n   */\n  export function asBool(json: any, defaultVal = false): boolean {\n    return isNullOrUndefined(json) ? defaultVal : !!json;\n  }\n  /** Get a value as an integer.\n   * @param json the input JSON object\n   * @param defaultVal default value if json cannot be converted to integer\n   * @returns the value of json as an integer, or default value\n   */\n  export function asInt(json: any, defaultVal = 0): number {\n    return (typeof json === \"number\") ? Math.trunc(json) : defaultVal;\n  }\n  /** Get a value as a double.\n   * @param json the input JSON object\n   * @param defaultVal default value if json cannot be converted to double\n   * @returns the value of json as a double, or default value\n   */\n  export function asDouble(json: any, defaultVal = 0): number {\n    return (typeof json === \"number\") ? json : defaultVal;\n  }\n  /** Get a value as a string.\n   * @param json the input JSON object\n   * @param defaultVal default value if json cannot be converted to string\n   * @returns the value of json as a string, or default value\n   */\n  export function asString(json: any, defaultVal = \"\"): string {\n    return isNullOrUndefined(json) ? defaultVal : json.toString();\n  }\n\n  /** Get a value as an array.\n   * @param json the input JSON object\n   * @returns the input JSON object if it is an array, otherwise undefined\n   */\n  export function asArray(json: any): any {\n    return Array.isArray(json) ? json : undefined;\n  }\n\n  /** Get a value as an object.\n   * @param json the input JSON object\n   * @returns the input JSON object if it is an object, otherwise undefined\n   */\n  export function asObject(json: any): any {\n    return \"object\" === typeof json ? json : undefined;\n  }\n\n  /** Set or remove a number on a json object, given a key name, a value, and a default value. Sets `json[key] = val` if val is *not* equal to the default,\n   * otherwise `delete json[key]`. This is used to omit values from JSON strings that are of known defaults.\n   * @param json the JSON object to affect\n   * @param key the name of the member to set or remove\n   * @param val the value to set\n   * @param defaultVal the default value.\n   */\n  export function setOrRemoveNumber(json: any, key: string, val: number, defaultVal: number) {\n    if (val === defaultVal)\n      delete json[key];\n    else\n      json[key] = val;\n  }\n\n  /** Set or remove a boolean on a json object, given a key name, a value, and a default value. Sets `json[key] = val` if val is *not* equal to the default,\n   * otherwise `delete json[key]`. This is used to omit values from JSON strings that are of known defaults.\n   * @param json the JSON object to affect\n   * @param key the name of the member to set or remove\n   * @param val the value to set\n   * @param defaultVal the default value.\n   */\n  export function setOrRemoveBoolean(json: any, key: string, val: boolean, defaultVal: boolean) {\n    if (val === defaultVal)\n      delete json[key];\n    else\n      json[key] = val;\n  }\n\n  /** Determine if a Javascript object is equivalent to `{}`.\n   * @param json The JSON object to test.\n   * @returns true if `json` is an Object with no keys.\n   */\n  export function isEmptyObject(json: any): boolean {\n    return \"object\" === typeof json && 0 === Object.keys(json).length;\n  }\n\n  /** Determine if the input is undefined or an empty Javascript object.\n   * @param json The JSON object to test.\n   * @returns true if `json` is undefined or is an Object with no keys (equivalent to `{}`).\n   */\n  export function isEmptyObjectOrUndefined(json: any): boolean {\n    return undefined === json || isEmptyObject(json);\n  }\n\n  function isNullOrUndefined(json: any): boolean {\n    return null === json || undefined === json;\n  }\n\n  /** Determine if the input is a non-empty Javascript object.\n   * @param value The value to test.\n   * @returns true if `value` is an Object with at least one key.\n   */\n  export function isNonEmptyObject(value: any): value is Object {\n    return !isEmptyObjectOrUndefined(value);\n  }\n\n  /**\n   * Convert the input object into a \"pure\" JavaScript object, with only instances of \"object\" or primitives in the returned value.\n   * Works recursively for object members, and over arrays entries. Calls \"toJSON\" on any members that implement it.\n   */\n  export function toObject(val: any): any {\n    if (typeof val === \"boolean\" || typeof val === \"number\" || typeof val === \"string\")\n      return val;\n\n    if (typeof val !== \"object\")\n      return undefined;\n\n    // See if the object has toJSON() function defined.\n    if (typeof val.toJSON !== \"undefined\")\n      return toObject(val.toJSON());\n\n    // if it's an array, convert each member.\n    if (Array.isArray(val)) {\n      const arr = new Array(val.length);\n      val.forEach((el, i) => arr[i] = toObject(el));\n      return arr;\n    }\n\n    // Convert each property\n    const out: any = {};\n    Object.getOwnPropertyNames(val).forEach((prop) => {\n      const transformVal = toObject(val[prop]);\n      if (transformVal !== undefined)\n        out[prop] = transformVal;\n    });\n\n    return out;\n  }\n\n}\n"]}

package/lib/esm/LRUMap.d.ts

@@ -1,130 +1,130 @@
-/** @packageDocumentation
- * @module Collections
- */
-import { OrderedComparator } from "./Compare";
-/**
- * Derived from:
- * Licensed under MIT. Copyright (c) 2010 Rasmus Andersson <http://hunch.se/>
- * See README.md at https://github.com/rsms/js-lru for details.
- */
-/** An entry holds the key and value, and pointers to any older and newer entries.
- * @public
- */
-export declare class Entry<K, V> {
-    key: K;
-    value: V;
-    newer?: Entry<K, V>;
-    older?: Entry<K, V>;
-    constructor(key: K, value: V);
-}
-/** The interface that must be satisfied by the underlying container type used by a LRUCache.
- * Compatible with a [[Dictionary]] or a standard Map.
- * @public
- */
-export interface EntryContainer<K, V> {
-    readonly size: number;
-    clear(): void;
-    get(key: K): Entry<K, V> | undefined;
-    set(key: K, value: Entry<K, V>): void;
-    has(key: K): boolean;
-    delete(key: K): void;
-}
-/**
- * A mapping of a key/value pairs, where the size of the cache can be limited.
- *
- * When entries are inserted, if the cache is "full", the
- * least-recently-used (LRU) value is dropped. When entries are retrieved, they are moved to the front of the LRU list.
- *
- * Illustration of the design:
- *
- * ```
- *
- *       entry             entry             entry             entry
- *       ______            ______            ______            ______
- *      | head |.newer => |      |.newer => |      |.newer => | tail |
- *      |  A   |          |  B   |          |  C   |          |  D   |
- *      |______| <= older.|______| <= older.|______| <= older.|______|
- *
- *  removed  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  added
- * ```
- * @public
- */
-export declare class LRUCache<K, V> {
-    private _container;
-    /** Current number of items */
-    size: number;
-    /** Maximum number of items this cache can hold */
-    limit: number;
-    /** Least recently-used entry. Invalidated when cache is modified. */
-    oldest?: Entry<K, V>;
-    /** Most recently-used entry. Invalidated when cache is modified. */
-    newest?: Entry<K, V>;
-    /**
-     * Construct a new LRUCache to hold up to `limit` entries.
-     */
-    constructor(limit: number, container: EntryContainer<K, V>);
-    private markEntryAsUsed;
-    /**  Replace all values in this cache with key-value pairs (2-element Arrays) from provided iterable. */
-    assign(entries: Iterable<[K, V]>): void;
-    /** Get and register recent use of <key>.
-     *  Returns the value associated with <key> or undefined if not in cache.
-     */
-    get(key: K): V | undefined;
-    /** Put <value> into the cache associated with <key>. Replaces any existing entry with the same key.
-     *  @returns `this`.
-     */
-    set(key: K, value: V): LRUCache<K, V>;
-    /**  Purge the least recently used (oldest) entry from the cache.
-     *  @returns The removed entry or undefined if the cache was empty.
-     */
-    shift(): [K, V] | undefined;
-    /** Access value for `key` without registering recent use. Useful if you do not
-     *  want to change the state of the cache, but only "peek" at it.
-     *  @returns The value associated with `key` if found, or undefined if not found.
-     */
-    find(key: K): V | undefined;
-    /** Check if there's a value for key in the cache without registering recent use. */
-    has(key: K): boolean;
-    /**  Remove entry `key` from cache and return its value.
-     *  @returns The removed value, or undefined if not found.
-     */
-    delete(key: K): V | undefined;
-    /**  Removes all entries */
-    clear(): void;
-    /** Returns an iterator over all keys, starting with the oldest. */
-    keys(): Iterator<K | undefined> | undefined;
-    /** Returns an iterator over all values, starting with the oldest. */
-    values(): Iterator<V | undefined> | undefined;
-    /** Returns an iterator over all entries, starting with the oldest. */
-    entries(): Iterator<[K, V] | undefined> | undefined;
-    /**  Call `fun` for each entry, starting with the oldest entry. */
-    forEach(fun: (value: V, key: K, m: LRUCache<K, V>) => void, thisObj?: any): void;
-    /** Returns a JSON (array) representation */
-    toJSON(): Array<{
-        key: K;
-        value: V;
-    }>;
-    /** Returns a String representation */
-    toString(): string;
-}
-/** A [[LRUCache]] using a standard Map as its internal storage.
- * @public
- */
-export declare class LRUMap<K, V> extends LRUCache<K, V> {
-    /**
-     * Construct a new LRUMap to hold up to `limit` entries.
-     */
-    constructor(limit: number);
-}
-/** A [[LRUCache]] using a [[Dictionary]] as its internal storage, permitting custom key comparison logic.
- * @public
- */
-export declare class LRUDictionary<K, V> extends LRUCache<K, V> {
-    /**
-     * Construct a new LRUDictionary to hold up to `limit` entries.
-     * @param limit The maximum number of entries permitted in the dictionary.
-     * @param compareKeys The function used to compare keys within the dictionary.
-     */
-    constructor(limit: number, compareKeys: OrderedComparator<K>);
-}
+/** @packageDocumentation
+ * @module Collections
+ */
+import { OrderedComparator } from "./Compare";
+/**
+ * Derived from:
+ * Licensed under MIT. Copyright (c) 2010 Rasmus Andersson <http://hunch.se/>
+ * See README.md at https://github.com/rsms/js-lru for details.
+ */
+/** An entry holds the key and value, and pointers to any older and newer entries.
+ * @public
+ */
+export declare class Entry<K, V> {
+    key: K;
+    value: V;
+    newer?: Entry<K, V>;
+    older?: Entry<K, V>;
+    constructor(key: K, value: V);
+}
+/** The interface that must be satisfied by the underlying container type used by a LRUCache.
+ * Compatible with a [[Dictionary]] or a standard Map.
+ * @public
+ */
+export interface EntryContainer<K, V> {
+    readonly size: number;
+    clear(): void;
+    get(key: K): Entry<K, V> | undefined;
+    set(key: K, value: Entry<K, V>): void;
+    has(key: K): boolean;
+    delete(key: K): void;
+}
+/**
+ * A mapping of a key/value pairs, where the size of the cache can be limited.
+ *
+ * When entries are inserted, if the cache is "full", the
+ * least-recently-used (LRU) value is dropped. When entries are retrieved, they are moved to the front of the LRU list.
+ *
+ * Illustration of the design:
+ *
+ * ```
+ *
+ *       entry             entry             entry             entry
+ *       ______            ______            ______            ______
+ *      | head |.newer => |      |.newer => |      |.newer => | tail |
+ *      |  A   |          |  B   |          |  C   |          |  D   |
+ *      |______| <= older.|______| <= older.|______| <= older.|______|
+ *
+ *  removed  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  added
+ * ```
+ * @public
+ */
+export declare class LRUCache<K, V> {
+    private _container;
+    /** Current number of items */
+    size: number;
+    /** Maximum number of items this cache can hold */
+    limit: number;
+    /** Least recently-used entry. Invalidated when cache is modified. */
+    oldest?: Entry<K, V>;
+    /** Most recently-used entry. Invalidated when cache is modified. */
+    newest?: Entry<K, V>;
+    /**
+     * Construct a new LRUCache to hold up to `limit` entries.
+     */
+    constructor(limit: number, container: EntryContainer<K, V>);
+    private markEntryAsUsed;
+    /**  Replace all values in this cache with key-value pairs (2-element Arrays) from provided iterable. */
+    assign(entries: Iterable<[K, V]>): void;
+    /** Get and register recent use of <key>.
+     *  Returns the value associated with <key> or undefined if not in cache.
+     */
+    get(key: K): V | undefined;
+    /** Put <value> into the cache associated with <key>. Replaces any existing entry with the same key.
+     *  @returns `this`.
+     */
+    set(key: K, value: V): LRUCache<K, V>;
+    /**  Purge the least recently used (oldest) entry from the cache.
+     *  @returns The removed entry or undefined if the cache was empty.
+     */
+    shift(): [K, V] | undefined;
+    /** Access value for `key` without registering recent use. Useful if you do not
+     *  want to change the state of the cache, but only "peek" at it.
+     *  @returns The value associated with `key` if found, or undefined if not found.
+     */
+    find(key: K): V | undefined;
+    /** Check if there's a value for key in the cache without registering recent use. */
+    has(key: K): boolean;
+    /**  Remove entry `key` from cache and return its value.
+     *  @returns The removed value, or undefined if not found.
+     */
+    delete(key: K): V | undefined;
+    /**  Removes all entries */
+    clear(): void;
+    /** Returns an iterator over all keys, starting with the oldest. */
+    keys(): Iterator<K | undefined> | undefined;
+    /** Returns an iterator over all values, starting with the oldest. */
+    values(): Iterator<V | undefined> | undefined;
+    /** Returns an iterator over all entries, starting with the oldest. */
+    entries(): Iterator<[K, V] | undefined> | undefined;
+    /**  Call `fun` for each entry, starting with the oldest entry. */
+    forEach(fun: (value: V, key: K, m: LRUCache<K, V>) => void, thisObj?: any): void;
+    /** Returns a JSON (array) representation */
+    toJSON(): Array<{
+        key: K;
+        value: V;
+    }>;
+    /** Returns a String representation */
+    toString(): string;
+}
+/** A [[LRUCache]] using a standard Map as its internal storage.
+ * @public
+ */
+export declare class LRUMap<K, V> extends LRUCache<K, V> {
+    /**
+     * Construct a new LRUMap to hold up to `limit` entries.
+     */
+    constructor(limit: number);
+}
+/** A [[LRUCache]] using a [[Dictionary]] as its internal storage, permitting custom key comparison logic.
+ * @public
+ */
+export declare class LRUDictionary<K, V> extends LRUCache<K, V> {
+    /**
+     * Construct a new LRUDictionary to hold up to `limit` entries.
+     * @param limit The maximum number of entries permitted in the dictionary.
+     * @param compareKeys The function used to compare keys within the dictionary.
+     */
+    constructor(limit: number, compareKeys: OrderedComparator<K>);
+}
 //# sourceMappingURL=LRUMap.d.ts.map