1 line
54 KiB
JSON
1 line
54 KiB
JSON
{"ast":null,"code":"/*\n * lib/jsprim.js: utilities for primitive JavaScript types\n */\nvar mod_assert = require('assert-plus');\n\nvar mod_util = require('util');\n\nvar mod_extsprintf = require('extsprintf');\n\nvar mod_verror = require('verror');\n\nvar mod_jsonschema = require('json-schema');\n/*\n * Public interface\n */\n\n\nexports.deepCopy = deepCopy;\nexports.deepEqual = deepEqual;\nexports.isEmpty = isEmpty;\nexports.hasKey = hasKey;\nexports.forEachKey = forEachKey;\nexports.pluck = pluck;\nexports.flattenObject = flattenObject;\nexports.flattenIter = flattenIter;\nexports.validateJsonObject = validateJsonObjectJS;\nexports.validateJsonObjectJS = validateJsonObjectJS;\nexports.randElt = randElt;\nexports.extraProperties = extraProperties;\nexports.mergeObjects = mergeObjects;\nexports.startsWith = startsWith;\nexports.endsWith = endsWith;\nexports.parseInteger = parseInteger;\nexports.iso8601 = iso8601;\nexports.rfc1123 = rfc1123;\nexports.parseDateTime = parseDateTime;\nexports.hrtimediff = hrtimeDiff;\nexports.hrtimeDiff = hrtimeDiff;\nexports.hrtimeAccum = hrtimeAccum;\nexports.hrtimeAdd = hrtimeAdd;\nexports.hrtimeNanosec = hrtimeNanosec;\nexports.hrtimeMicrosec = hrtimeMicrosec;\nexports.hrtimeMillisec = hrtimeMillisec;\n/*\n * Deep copy an acyclic *basic* Javascript object. This only handles basic\n * scalars (strings, numbers, booleans) and arbitrarily deep arrays and objects\n * containing these. This does *not* handle instances of other classes.\n */\n\nfunction deepCopy(obj) {\n var ret, key;\n var marker = '__deepCopy';\n if (obj && obj[marker]) throw new Error('attempted deep copy of cyclic object');\n\n if (obj && obj.constructor == Object) {\n ret = {};\n obj[marker] = true;\n\n for (key in obj) {\n if (key == marker) continue;\n ret[key] = deepCopy(obj[key]);\n }\n\n delete obj[marker];\n return ret;\n }\n\n if (obj && obj.constructor == Array) {\n ret = [];\n obj[marker] = true;\n\n for (key = 0; key < obj.length; key++) ret.push(deepCopy(obj[key]));\n\n delete obj[marker];\n return ret;\n }\n /*\n * It must be a primitive type -- just return it.\n */\n\n\n return obj;\n}\n\nfunction deepEqual(obj1, obj2) {\n if (typeof obj1 != typeof obj2) return false;\n if (obj1 === null || obj2 === null || typeof obj1 != 'object') return obj1 === obj2;\n if (obj1.constructor != obj2.constructor) return false;\n var k;\n\n for (k in obj1) {\n if (!obj2.hasOwnProperty(k)) return false;\n if (!deepEqual(obj1[k], obj2[k])) return false;\n }\n\n for (k in obj2) {\n if (!obj1.hasOwnProperty(k)) return false;\n }\n\n return true;\n}\n\nfunction isEmpty(obj) {\n var key;\n\n for (key in obj) return false;\n\n return true;\n}\n\nfunction hasKey(obj, key) {\n mod_assert.equal(typeof key, 'string');\n return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nfunction forEachKey(obj, callback) {\n for (var key in obj) {\n if (hasKey(obj, key)) {\n callback(key, obj[key]);\n }\n }\n}\n\nfunction pluck(obj, key) {\n mod_assert.equal(typeof key, 'string');\n return pluckv(obj, key);\n}\n\nfunction pluckv(obj, key) {\n if (obj === null || typeof obj !== 'object') return undefined;\n if (obj.hasOwnProperty(key)) return obj[key];\n var i = key.indexOf('.');\n if (i == -1) return undefined;\n var key1 = key.substr(0, i);\n if (!obj.hasOwnProperty(key1)) return undefined;\n return pluckv(obj[key1], key.substr(i + 1));\n}\n/*\n * Invoke callback(row) for each entry in the array that would be returned by\n * flattenObject(data, depth). This is just like flattenObject(data,\n * depth).forEach(callback), except that the intermediate array is never\n * created.\n */\n\n\nfunction flattenIter(data, depth, callback) {\n doFlattenIter(data, depth, [], callback);\n}\n\nfunction doFlattenIter(data, depth, accum, callback) {\n var each;\n var key;\n\n if (depth === 0) {\n each = accum.slice(0);\n each.push(data);\n callback(each);\n return;\n }\n\n mod_assert.ok(data !== null);\n mod_assert.equal(typeof data, 'object');\n mod_assert.equal(typeof depth, 'number');\n mod_assert.ok(depth >= 0);\n\n for (key in data) {\n each = accum.slice(0);\n each.push(key);\n doFlattenIter(data[key], depth - 1, each, callback);\n }\n}\n\nfunction flattenObject(data, depth) {\n if (depth === 0) return [data];\n mod_assert.ok(data !== null);\n mod_assert.equal(typeof data, 'object');\n mod_assert.equal(typeof depth, 'number');\n mod_assert.ok(depth >= 0);\n var rv = [];\n var key;\n\n for (key in data) {\n flattenObject(data[key], depth - 1).forEach(function (p) {\n rv.push([key].concat(p));\n });\n }\n\n return rv;\n}\n\nfunction startsWith(str, prefix) {\n return str.substr(0, prefix.length) == prefix;\n}\n\nfunction endsWith(str, suffix) {\n return str.substr(str.length - suffix.length, suffix.length) == suffix;\n}\n\nfunction iso8601(d) {\n if (typeof d == 'number') d = new Date(d);\n mod_assert.ok(d.constructor === Date);\n return mod_extsprintf.sprintf('%4d-%02d-%02dT%02d:%02d:%02d.%03dZ', d.getUTCFullYear(), d.getUTCMonth() + 1, d.getUTCDate(), d.getUTCHours(), d.getUTCMinutes(), d.getUTCSeconds(), d.getUTCMilliseconds());\n}\n\nvar RFC1123_MONTHS = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec'];\nvar RFC1123_DAYS = ['Sun', 'Mon', 'Tue', 'Wed', 'Thu', 'Fri', 'Sat'];\n\nfunction rfc1123(date) {\n return mod_extsprintf.sprintf('%s, %02d %s %04d %02d:%02d:%02d GMT', RFC1123_DAYS[date.getUTCDay()], date.getUTCDate(), RFC1123_MONTHS[date.getUTCMonth()], date.getUTCFullYear(), date.getUTCHours(), date.getUTCMinutes(), date.getUTCSeconds());\n}\n/*\n * Parses a date expressed as a string, as either a number of milliseconds since\n * the epoch or any string format that Date accepts, giving preference to the\n * former where these two sets overlap (e.g., small numbers).\n */\n\n\nfunction parseDateTime(str) {\n /*\n * This is irritatingly implicit, but significantly more concise than\n * alternatives. The \"+str\" will convert a string containing only a\n * number directly to a Number, or NaN for other strings. Thus, if the\n * conversion succeeds, we use it (this is the milliseconds-since-epoch\n * case). Otherwise, we pass the string directly to the Date\n * constructor to parse.\n */\n var numeric = +str;\n\n if (!isNaN(numeric)) {\n return new Date(numeric);\n } else {\n return new Date(str);\n }\n}\n/*\n * Number.*_SAFE_INTEGER isn't present before node v0.12, so we hardcode\n * the ES6 definitions here, while allowing for them to someday be higher.\n */\n\n\nvar MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER || 9007199254740991;\nvar MIN_SAFE_INTEGER = Number.MIN_SAFE_INTEGER || -9007199254740991;\n/*\n * Default options for parseInteger().\n */\n\nvar PI_DEFAULTS = {\n base: 10,\n allowSign: true,\n allowPrefix: false,\n allowTrailing: false,\n allowImprecise: false,\n trimWhitespace: false,\n leadingZeroIsOctal: false\n};\nvar CP_0 = 0x30;\nvar CP_9 = 0x39;\nvar CP_A = 0x41;\nvar CP_B = 0x42;\nvar CP_O = 0x4f;\nvar CP_T = 0x54;\nvar CP_X = 0x58;\nvar CP_Z = 0x5a;\nvar CP_a = 0x61;\nvar CP_b = 0x62;\nvar CP_o = 0x6f;\nvar CP_t = 0x74;\nvar CP_x = 0x78;\nvar CP_z = 0x7a;\nvar PI_CONV_DEC = 0x30;\nvar PI_CONV_UC = 0x37;\nvar PI_CONV_LC = 0x57;\n/*\n * A stricter version of parseInt() that provides options for changing what\n * is an acceptable string (for example, disallowing trailing characters).\n */\n\nfunction parseInteger(str, uopts) {\n mod_assert.string(str, 'str');\n mod_assert.optionalObject(uopts, 'options');\n var baseOverride = false;\n var options = PI_DEFAULTS;\n\n if (uopts) {\n baseOverride = hasKey(uopts, 'base');\n options = mergeObjects(options, uopts);\n mod_assert.number(options.base, 'options.base');\n mod_assert.ok(options.base >= 2, 'options.base >= 2');\n mod_assert.ok(options.base <= 36, 'options.base <= 36');\n mod_assert.bool(options.allowSign, 'options.allowSign');\n mod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n mod_assert.bool(options.allowTrailing, 'options.allowTrailing');\n mod_assert.bool(options.allowImprecise, 'options.allowImprecise');\n mod_assert.bool(options.trimWhitespace, 'options.trimWhitespace');\n mod_assert.bool(options.leadingZeroIsOctal, 'options.leadingZeroIsOctal');\n\n if (options.leadingZeroIsOctal) {\n mod_assert.ok(!baseOverride, '\"base\" and \"leadingZeroIsOctal\" are ' + 'mutually exclusive');\n }\n }\n\n var c;\n var pbase = -1;\n var base = options.base;\n var start;\n var mult = 1;\n var value = 0;\n var idx = 0;\n var len = str.length;\n /* Trim any whitespace on the left side. */\n\n if (options.trimWhitespace) {\n while (idx < len && isSpace(str.charCodeAt(idx))) {\n ++idx;\n }\n }\n /* Check the number for a leading sign. */\n\n\n if (options.allowSign) {\n if (str[idx] === '-') {\n idx += 1;\n mult = -1;\n } else if (str[idx] === '+') {\n idx += 1;\n }\n }\n /* Parse the base-indicating prefix if there is one. */\n\n\n if (str[idx] === '0') {\n if (options.allowPrefix) {\n pbase = prefixToBase(str.charCodeAt(idx + 1));\n\n if (pbase !== -1 && (!baseOverride || pbase === base)) {\n base = pbase;\n idx += 2;\n }\n }\n\n if (pbase === -1 && options.leadingZeroIsOctal) {\n base = 8;\n }\n }\n /* Parse the actual digits. */\n\n\n for (start = idx; idx < len; ++idx) {\n c = translateDigit(str.charCodeAt(idx));\n\n if (c !== -1 && c < base) {\n value *= base;\n value += c;\n } else {\n break;\n }\n }\n /* If we didn't parse any digits, we have an invalid number. */\n\n\n if (start === idx) {\n return new Error('invalid number: ' + JSON.stringify(str));\n }\n /* Trim any whitespace on the right side. */\n\n\n if (options.trimWhitespace) {\n while (idx < len && isSpace(str.charCodeAt(idx))) {\n ++idx;\n }\n }\n /* Check for trailing characters. */\n\n\n if (idx < len && !options.allowTrailing) {\n return new Error('trailing characters after number: ' + JSON.stringify(str.slice(idx)));\n }\n /* If our value is 0, we return now, to avoid returning -0. */\n\n\n if (value === 0) {\n return 0;\n }\n /* Calculate our final value. */\n\n\n var result = value * mult;\n /*\n * If the string represents a value that cannot be precisely represented\n * by JavaScript, then we want to check that:\n *\n * - We never increased the value past MAX_SAFE_INTEGER\n * - We don't make the result negative and below MIN_SAFE_INTEGER\n *\n * Because we only ever increment the value during parsing, there's no\n * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n * again, losing precision in the process. This means that we only need\n * to do our checks here, at the end.\n */\n\n if (!options.allowImprecise && (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n return new Error('number is outside of the supported range: ' + JSON.stringify(str.slice(start, idx)));\n }\n\n return result;\n}\n/*\n * Interpret a character code as a base-36 digit.\n */\n\n\nfunction translateDigit(d) {\n if (d >= CP_0 && d <= CP_9) {\n /* '0' to '9' -> 0 to 9 */\n return d - PI_CONV_DEC;\n } else if (d >= CP_A && d <= CP_Z) {\n /* 'A' - 'Z' -> 10 to 35 */\n return d - PI_CONV_UC;\n } else if (d >= CP_a && d <= CP_z) {\n /* 'a' - 'z' -> 10 to 35 */\n return d - PI_CONV_LC;\n } else {\n /* Invalid character code */\n return -1;\n }\n}\n/*\n * Test if a value matches the ECMAScript definition of trimmable whitespace.\n */\n\n\nfunction isSpace(c) {\n return c === 0x20 || c >= 0x0009 && c <= 0x000d || c === 0x00a0 || c === 0x1680 || c === 0x180e || c >= 0x2000 && c <= 0x200a || c === 0x2028 || c === 0x2029 || c === 0x202f || c === 0x205f || c === 0x3000 || c === 0xfeff;\n}\n/*\n * Determine which base a character indicates (e.g., 'x' indicates hex).\n */\n\n\nfunction prefixToBase(c) {\n if (c === CP_b || c === CP_B) {\n /* 0b/0B (binary) */\n return 2;\n } else if (c === CP_o || c === CP_O) {\n /* 0o/0O (octal) */\n return 8;\n } else if (c === CP_t || c === CP_T) {\n /* 0t/0T (decimal) */\n return 10;\n } else if (c === CP_x || c === CP_X) {\n /* 0x/0X (hexadecimal) */\n return 16;\n } else {\n /* Not a meaningful character */\n return -1;\n }\n}\n\nfunction validateJsonObjectJS(schema, input) {\n var report = mod_jsonschema.validate(input, schema);\n if (report.errors.length === 0) return null;\n /* Currently, we only do anything useful with the first error. */\n\n var error = report.errors[0];\n /* The failed property is given by a URI with an irrelevant prefix. */\n\n var propname = error['property'];\n var reason = error['message'].toLowerCase();\n var i, j;\n /*\n * There's at least one case where the property error message is\n * confusing at best. We work around this here.\n */\n\n if ((i = reason.indexOf('the property ')) != -1 && (j = reason.indexOf(' is not defined in the schema and the ' + 'schema does not allow additional properties')) != -1) {\n i += 'the property '.length;\n if (propname === '') propname = reason.substr(i, j - i);else propname = propname + '.' + reason.substr(i, j - i);\n reason = 'unsupported property';\n }\n\n var rv = new mod_verror.VError('property \"%s\": %s', propname, reason);\n rv.jsv_details = error;\n return rv;\n}\n\nfunction randElt(arr) {\n mod_assert.ok(Array.isArray(arr) && arr.length > 0, 'randElt argument must be a non-empty array');\n return arr[Math.floor(Math.random() * arr.length)];\n}\n\nfunction assertHrtime(a) {\n mod_assert.ok(a[0] >= 0 && a[1] >= 0, 'negative numbers not allowed in hrtimes');\n mod_assert.ok(a[1] < 1e9, 'nanoseconds column overflow');\n}\n/*\n * Compute the time elapsed between hrtime readings A and B, where A is later\n * than B. hrtime readings come from Node's process.hrtime(). There is no\n * defined way to represent negative deltas, so it's illegal to diff B from A\n * where the time denoted by B is later than the time denoted by A. If this\n * becomes valuable, we can define a representation and extend the\n * implementation to support it.\n */\n\n\nfunction hrtimeDiff(a, b) {\n assertHrtime(a);\n assertHrtime(b);\n mod_assert.ok(a[0] > b[0] || a[0] == b[0] && a[1] >= b[1], 'negative differences not allowed');\n var rv = [a[0] - b[0], 0];\n\n if (a[1] >= b[1]) {\n rv[1] = a[1] - b[1];\n } else {\n rv[0]--;\n rv[1] = 1e9 - (b[1] - a[1]);\n }\n\n return rv;\n}\n/*\n * Convert a hrtime reading from the array format returned by Node's\n * process.hrtime() into a scalar number of nanoseconds.\n */\n\n\nfunction hrtimeNanosec(a) {\n assertHrtime(a);\n return Math.floor(a[0] * 1e9 + a[1]);\n}\n/*\n * Convert a hrtime reading from the array format returned by Node's\n * process.hrtime() into a scalar number of microseconds.\n */\n\n\nfunction hrtimeMicrosec(a) {\n assertHrtime(a);\n return Math.floor(a[0] * 1e6 + a[1] / 1e3);\n}\n/*\n * Convert a hrtime reading from the array format returned by Node's\n * process.hrtime() into a scalar number of milliseconds.\n */\n\n\nfunction hrtimeMillisec(a) {\n assertHrtime(a);\n return Math.floor(a[0] * 1e3 + a[1] / 1e6);\n}\n/*\n * Add two hrtime readings A and B, overwriting A with the result of the\n * addition. This function is useful for accumulating several hrtime intervals\n * into a counter. Returns A.\n */\n\n\nfunction hrtimeAccum(a, b) {\n assertHrtime(a);\n assertHrtime(b);\n /*\n * Accumulate the nanosecond component.\n */\n\n a[1] += b[1];\n\n if (a[1] >= 1e9) {\n /*\n * The nanosecond component overflowed, so carry to the seconds\n * field.\n */\n a[0]++;\n a[1] -= 1e9;\n }\n /*\n * Accumulate the seconds component.\n */\n\n\n a[0] += b[0];\n return a;\n}\n/*\n * Add two hrtime readings A and B, returning the result as a new hrtime array.\n * Does not modify either input argument.\n */\n\n\nfunction hrtimeAdd(a, b) {\n assertHrtime(a);\n var rv = [a[0], a[1]];\n return hrtimeAccum(rv, b);\n}\n/*\n * Check an object for unexpected properties. Accepts the object to check, and\n * an array of allowed property names (strings). Returns an array of key names\n * that were found on the object, but did not appear in the list of allowed\n * properties. If no properties were found, the returned array will be of\n * zero length.\n */\n\n\nfunction extraProperties(obj, allowed) {\n mod_assert.ok(typeof obj === 'object' && obj !== null, 'obj argument must be a non-null object');\n mod_assert.ok(Array.isArray(allowed), 'allowed argument must be an array of strings');\n\n for (var i = 0; i < allowed.length; i++) {\n mod_assert.ok(typeof allowed[i] === 'string', 'allowed argument must be an array of strings');\n }\n\n return Object.keys(obj).filter(function (key) {\n return allowed.indexOf(key) === -1;\n });\n}\n/*\n * Given three sets of properties \"provided\" (may be undefined), \"overrides\"\n * (required), and \"defaults\" (may be undefined), construct an object containing\n * the union of these sets with \"overrides\" overriding \"provided\", and\n * \"provided\" overriding \"defaults\". None of the input objects are modified.\n */\n\n\nfunction mergeObjects(provided, overrides, defaults) {\n var rv, k;\n rv = {};\n\n if (defaults) {\n for (k in defaults) rv[k] = defaults[k];\n }\n\n if (provided) {\n for (k in provided) rv[k] = provided[k];\n }\n\n if (overrides) {\n for (k in overrides) rv[k] = overrides[k];\n }\n\n return rv;\n}","map":{"version":3,"sources":["/Users/tylerkoenig/Code/personal/react-scss2/node_modules/jsprim/lib/jsprim.js"],"names":["mod_assert","require","mod_util","mod_extsprintf","mod_verror","mod_jsonschema","exports","deepCopy","deepEqual","isEmpty","hasKey","forEachKey","pluck","flattenObject","flattenIter","validateJsonObject","validateJsonObjectJS","randElt","extraProperties","mergeObjects","startsWith","endsWith","parseInteger","iso8601","rfc1123","parseDateTime","hrtimediff","hrtimeDiff","hrtimeAccum","hrtimeAdd","hrtimeNanosec","hrtimeMicrosec","hrtimeMillisec","obj","ret","key","marker","Error","constructor","Object","Array","length","push","obj1","obj2","k","hasOwnProperty","equal","prototype","call","callback","pluckv","undefined","i","indexOf","key1","substr","data","depth","doFlattenIter","accum","each","slice","ok","rv","forEach","p","concat","str","prefix","suffix","d","Date","sprintf","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","getUTCMilliseconds","RFC1123_MONTHS","RFC1123_DAYS","date","getUTCDay","numeric","isNaN","MAX_SAFE_INTEGER","Number","MIN_SAFE_INTEGER","PI_DEFAULTS","base","allowSign","allowPrefix","allowTrailing","allowImprecise","trimWhitespace","leadingZeroIsOctal","CP_0","CP_9","CP_A","CP_B","CP_O","CP_T","CP_X","CP_Z","CP_a","CP_b","CP_o","CP_t","CP_x","CP_z","PI_CONV_DEC","PI_CONV_UC","PI_CONV_LC","uopts","string","optionalObject","baseOverride","options","number","bool","c","pbase","start","mult","value","idx","len","isSpace","charCodeAt","prefixToBase","translateDigit","JSON","stringify","result","schema","input","report","validate","errors","error","propname","reason","toLowerCase","j","VError","jsv_details","arr","isArray","Math","floor","random","assertHrtime","a","b","allowed","keys","filter","provided","overrides","defaults"],"mappings":"AAAA;AACA;AACA;AAEA,IAAIA,UAAU,GAAGC,OAAO,CAAC,aAAD,CAAxB;;AACA,IAAIC,QAAQ,GAAGD,OAAO,CAAC,MAAD,CAAtB;;AAEA,IAAIE,cAAc,GAAGF,OAAO,CAAC,YAAD,CAA5B;;AACA,IAAIG,UAAU,GAAGH,OAAO,CAAC,QAAD,CAAxB;;AACA,IAAII,cAAc,GAAGJ,OAAO,CAAC,aAAD,CAA5B;AAEA;AACA;AACA;;;AACAK,OAAO,CAACC,QAAR,GAAmBA,QAAnB;AACAD,OAAO,CAACE,SAAR,GAAoBA,SAApB;AACAF,OAAO,CAACG,OAAR,GAAkBA,OAAlB;AACAH,OAAO,CAACI,MAAR,GAAiBA,MAAjB;AACAJ,OAAO,CAACK,UAAR,GAAqBA,UAArB;AACAL,OAAO,CAACM,KAAR,GAAgBA,KAAhB;AACAN,OAAO,CAACO,aAAR,GAAwBA,aAAxB;AACAP,OAAO,CAACQ,WAAR,GAAsBA,WAAtB;AACAR,OAAO,CAACS,kBAAR,GAA6BC,oBAA7B;AACAV,OAAO,CAACU,oBAAR,GAA+BA,oBAA/B;AACAV,OAAO,CAACW,OAAR,GAAkBA,OAAlB;AACAX,OAAO,CAACY,eAAR,GAA0BA,eAA1B;AACAZ,OAAO,CAACa,YAAR,GAAuBA,YAAvB;AAEAb,OAAO,CAACc,UAAR,GAAqBA,UAArB;AACAd,OAAO,CAACe,QAAR,GAAmBA,QAAnB;AAEAf,OAAO,CAACgB,YAAR,GAAuBA,YAAvB;AAEAhB,OAAO,CAACiB,OAAR,GAAkBA,OAAlB;AACAjB,OAAO,CAACkB,OAAR,GAAkBA,OAAlB;AACAlB,OAAO,CAACmB,aAAR,GAAwBA,aAAxB;AAEAnB,OAAO,CAACoB,UAAR,GAAqBC,UAArB;AACArB,OAAO,CAACqB,UAAR,GAAqBA,UAArB;AACArB,OAAO,CAACsB,WAAR,GAAsBA,WAAtB;AACAtB,OAAO,CAACuB,SAAR,GAAoBA,SAApB;AACAvB,OAAO,CAACwB,aAAR,GAAwBA,aAAxB;AACAxB,OAAO,CAACyB,cAAR,GAAyBA,cAAzB;AACAzB,OAAO,CAAC0B,cAAR,GAAyBA,cAAzB;AAGA;AACA;AACA;AACA;AACA;;AACA,SAASzB,QAAT,CAAkB0B,GAAlB,EACA;AACC,MAAIC,GAAJ,EAASC,GAAT;AACA,MAAIC,MAAM,GAAG,YAAb;AAEA,MAAIH,GAAG,IAAIA,GAAG,CAACG,MAAD,CAAd,EACC,MAAO,IAAIC,KAAJ,CAAU,sCAAV,CAAP;;AAED,MAAIJ,GAAG,IAAIA,GAAG,CAACK,WAAJ,IAAmBC,MAA9B,EAAsC;AACrCL,IAAAA,GAAG,GAAG,EAAN;AACAD,IAAAA,GAAG,CAACG,MAAD,CAAH,GAAc,IAAd;;AAEA,SAAKD,GAAL,IAAYF,GAAZ,EAAiB;AAChB,UAAIE,GAAG,IAAIC,MAAX,EACC;AAEDF,MAAAA,GAAG,CAACC,GAAD,CAAH,GAAW5B,QAAQ,CAAC0B,GAAG,CAACE,GAAD,CAAJ,CAAnB;AACA;;AAED,WAAQF,GAAG,CAACG,MAAD,CAAX;AACA,WAAQF,GAAR;AACA;;AAED,MAAID,GAAG,IAAIA,GAAG,CAACK,WAAJ,IAAmBE,KAA9B,EAAqC;AACpCN,IAAAA,GAAG,GAAG,EAAN;AACAD,IAAAA,GAAG,CAACG,MAAD,CAAH,GAAc,IAAd;;AAEA,SAAKD,GAAG,GAAG,CAAX,EAAcA,GAAG,GAAGF,GAAG,CAACQ,MAAxB,EAAgCN,GAAG,EAAnC,EACCD,GAAG,CAACQ,IAAJ,CAASnC,QAAQ,CAAC0B,GAAG,CAACE,GAAD,CAAJ,CAAjB;;AAED,WAAQF,GAAG,CAACG,MAAD,CAAX;AACA,WAAQF,GAAR;AACA;AAED;AACD;AACA;;;AACC,SAAQD,GAAR;AACA;;AAED,SAASzB,SAAT,CAAmBmC,IAAnB,EAAyBC,IAAzB,EACA;AACC,MAAI,OAAQD,IAAR,IAAiB,OAAQC,IAA7B,EACC,OAAQ,KAAR;AAED,MAAID,IAAI,KAAK,IAAT,IAAiBC,IAAI,KAAK,IAA1B,IAAkC,OAAQD,IAAR,IAAiB,QAAvD,EACC,OAAQA,IAAI,KAAKC,IAAjB;AAED,MAAID,IAAI,CAACL,WAAL,IAAoBM,IAAI,CAACN,WAA7B,EACC,OAAQ,KAAR;AAED,MAAIO,CAAJ;;AACA,OAAKA,CAAL,IAAUF,IAAV,EAAgB;AACf,QAAI,CAACC,IAAI,CAACE,cAAL,CAAoBD,CAApB,CAAL,EACC,OAAQ,KAAR;AAED,QAAI,CAACrC,SAAS,CAACmC,IAAI,CAACE,CAAD,CAAL,EAAUD,IAAI,CAACC,CAAD,CAAd,CAAd,EACC,OAAQ,KAAR;AACD;;AAED,OAAKA,CAAL,IAAUD,IAAV,EAAgB;AACf,QAAI,CAACD,IAAI,CAACG,cAAL,CAAoBD,CAApB,CAAL,EACC,OAAQ,KAAR;AACD;;AAED,SAAQ,IAAR;AACA;;AAED,SAASpC,OAAT,CAAiBwB,GAAjB,EACA;AACC,MAAIE,GAAJ;;AACA,OAAKA,GAAL,IAAYF,GAAZ,EACC,OAAQ,KAAR;;AACD,SAAQ,IAAR;AACA;;AAED,SAASvB,MAAT,CAAgBuB,GAAhB,EAAqBE,GAArB,EACA;AACCnC,EAAAA,UAAU,CAAC+C,KAAX,CAAiB,OAAQZ,GAAzB,EAA+B,QAA/B;AACA,SAAQI,MAAM,CAACS,SAAP,CAAiBF,cAAjB,CAAgCG,IAAhC,CAAqChB,GAArC,EAA0CE,GAA1C,CAAR;AACA;;AAED,SAASxB,UAAT,CAAoBsB,GAApB,EAAyBiB,QAAzB,EACA;AACC,OAAK,IAAIf,GAAT,IAAgBF,GAAhB,EAAqB;AACpB,QAAIvB,MAAM,CAACuB,GAAD,EAAME,GAAN,CAAV,EAAsB;AACrBe,MAAAA,QAAQ,CAACf,GAAD,EAAMF,GAAG,CAACE,GAAD,CAAT,CAAR;AACA;AACD;AACD;;AAED,SAASvB,KAAT,CAAeqB,GAAf,EAAoBE,GAApB,EACA;AACCnC,EAAAA,UAAU,CAAC+C,KAAX,CAAiB,OAAQZ,GAAzB,EAA+B,QAA/B;AACA,SAAQgB,MAAM,CAAClB,GAAD,EAAME,GAAN,CAAd;AACA;;AAED,SAASgB,MAAT,CAAgBlB,GAAhB,EAAqBE,GAArB,EACA;AACC,MAAIF,GAAG,KAAK,IAAR,IAAgB,OAAQA,GAAR,KAAiB,QAArC,EACC,OAAQmB,SAAR;AAED,MAAInB,GAAG,CAACa,cAAJ,CAAmBX,GAAnB,CAAJ,EACC,OAAQF,GAAG,CAACE,GAAD,CAAX;AAED,MAAIkB,CAAC,GAAGlB,GAAG,CAACmB,OAAJ,CAAY,GAAZ,CAAR;AACA,MAAID,CAAC,IAAI,CAAC,CAAV,EACC,OAAQD,SAAR;AAED,MAAIG,IAAI,GAAGpB,GAAG,CAACqB,MAAJ,CAAW,CAAX,EAAcH,CAAd,CAAX;AACA,MAAI,CAACpB,GAAG,CAACa,cAAJ,CAAmBS,IAAnB,CAAL,EACC,OAAQH,SAAR;AAED,SAAQD,MAAM,CAAClB,GAAG,CAACsB,IAAD,CAAJ,EAAYpB,GAAG,CAACqB,MAAJ,CAAWH,CAAC,GAAG,CAAf,CAAZ,CAAd;AACA;AAED;AACA;AACA;AACA;AACA;AACA;;;AACA,SAASvC,WAAT,CAAqB2C,IAArB,EAA2BC,KAA3B,EAAkCR,QAAlC,EACA;AACCS,EAAAA,aAAa,CAACF,IAAD,EAAOC,KAAP,EAAc,EAAd,EAAkBR,QAAlB,CAAb;AACA;;AAED,SAASS,aAAT,CAAuBF,IAAvB,EAA6BC,KAA7B,EAAoCE,KAApC,EAA2CV,QAA3C,EACA;AACC,MAAIW,IAAJ;AACA,MAAI1B,GAAJ;;AAEA,MAAIuB,KAAK,KAAK,CAAd,EAAiB;AAChBG,IAAAA,IAAI,GAAGD,KAAK,CAACE,KAAN,CAAY,CAAZ,CAAP;AACAD,IAAAA,IAAI,CAACnB,IAAL,CAAUe,IAAV;AACAP,IAAAA,QAAQ,CAACW,IAAD,CAAR;AACA;AACA;;AAED7D,EAAAA,UAAU,CAAC+D,EAAX,CAAcN,IAAI,KAAK,IAAvB;AACAzD,EAAAA,UAAU,CAAC+C,KAAX,CAAiB,OAAQU,IAAzB,EAAgC,QAAhC;AACAzD,EAAAA,UAAU,CAAC+C,KAAX,CAAiB,OAAQW,KAAzB,EAAiC,QAAjC;AACA1D,EAAAA,UAAU,CAAC+D,EAAX,CAAcL,KAAK,IAAI,CAAvB;;AAEA,OAAKvB,GAAL,IAAYsB,IAAZ,EAAkB;AACjBI,IAAAA,IAAI,GAAGD,KAAK,CAACE,KAAN,CAAY,CAAZ,CAAP;AACAD,IAAAA,IAAI,CAACnB,IAAL,CAAUP,GAAV;AACAwB,IAAAA,aAAa,CAACF,IAAI,CAACtB,GAAD,CAAL,EAAYuB,KAAK,GAAG,CAApB,EAAuBG,IAAvB,EAA6BX,QAA7B,CAAb;AACA;AACD;;AAED,SAASrC,aAAT,CAAuB4C,IAAvB,EAA6BC,KAA7B,EACA;AACC,MAAIA,KAAK,KAAK,CAAd,EACC,OAAQ,CAAED,IAAF,CAAR;AAEDzD,EAAAA,UAAU,CAAC+D,EAAX,CAAcN,IAAI,KAAK,IAAvB;AACAzD,EAAAA,UAAU,CAAC+C,KAAX,CAAiB,OAAQU,IAAzB,EAAgC,QAAhC;AACAzD,EAAAA,UAAU,CAAC+C,KAAX,CAAiB,OAAQW,KAAzB,EAAiC,QAAjC;AACA1D,EAAAA,UAAU,CAAC+D,EAAX,CAAcL,KAAK,IAAI,CAAvB;AAEA,MAAIM,EAAE,GAAG,EAAT;AACA,MAAI7B,GAAJ;;AAEA,OAAKA,GAAL,IAAYsB,IAAZ,EAAkB;AACjB5C,IAAAA,aAAa,CAAC4C,IAAI,CAACtB,GAAD,CAAL,EAAYuB,KAAK,GAAG,CAApB,CAAb,CAAoCO,OAApC,CAA4C,UAAUC,CAAV,EAAa;AACxDF,MAAAA,EAAE,CAACtB,IAAH,CAAQ,CAAEP,GAAF,EAAQgC,MAAR,CAAeD,CAAf,CAAR;AACA,KAFD;AAGA;;AAED,SAAQF,EAAR;AACA;;AAED,SAAS5C,UAAT,CAAoBgD,GAApB,EAAyBC,MAAzB,EACA;AACC,SAAQD,GAAG,CAACZ,MAAJ,CAAW,CAAX,EAAca,MAAM,CAAC5B,MAArB,KAAgC4B,MAAxC;AACA;;AAED,SAAShD,QAAT,CAAkB+C,GAAlB,EAAuBE,MAAvB,EACA;AACC,SAAQF,GAAG,CAACZ,MAAJ,CACJY,GAAG,CAAC3B,MAAJ,GAAa6B,MAAM,CAAC7B,MADhB,EACwB6B,MAAM,CAAC7B,MAD/B,KAC0C6B,MADlD;AAEA;;AAED,SAAS/C,OAAT,CAAiBgD,CAAjB,EACA;AACC,MAAI,OAAQA,CAAR,IAAc,QAAlB,EACCA,CAAC,GAAG,IAAIC,IAAJ,CAASD,CAAT,CAAJ;AACDvE,EAAAA,UAAU,CAAC+D,EAAX,CAAcQ,CAAC,CAACjC,WAAF,KAAkBkC,IAAhC;AACA,SAAQrE,cAAc,CAACsE,OAAf,CAAuB,oCAAvB,EACJF,CAAC,CAACG,cAAF,EADI,EACgBH,CAAC,CAACI,WAAF,KAAkB,CADlC,EACqCJ,CAAC,CAACK,UAAF,EADrC,EAEJL,CAAC,CAACM,WAAF,EAFI,EAEaN,CAAC,CAACO,aAAF,EAFb,EAEgCP,CAAC,CAACQ,aAAF,EAFhC,EAGJR,CAAC,CAACS,kBAAF,EAHI,CAAR;AAIA;;AAED,IAAIC,cAAc,GAAG,CACjB,KADiB,EACV,KADU,EACH,KADG,EACI,KADJ,EACW,KADX,EACkB,KADlB,EAEjB,KAFiB,EAEV,KAFU,EAEH,KAFG,EAEI,KAFJ,EAEW,KAFX,EAEkB,KAFlB,CAArB;AAGA,IAAIC,YAAY,GAAG,CACf,KADe,EACR,KADQ,EACD,KADC,EACM,KADN,EACa,KADb,EACoB,KADpB,EAC2B,KAD3B,CAAnB;;AAGA,SAAS1D,OAAT,CAAiB2D,IAAjB,EAAuB;AACtB,SAAQhF,cAAc,CAACsE,OAAf,CAAuB,qCAAvB,EACJS,YAAY,CAACC,IAAI,CAACC,SAAL,EAAD,CADR,EAC4BD,IAAI,CAACP,UAAL,EAD5B,EAEJK,cAAc,CAACE,IAAI,CAACR,WAAL,EAAD,CAFV,EAEgCQ,IAAI,CAACT,cAAL,EAFhC,EAGJS,IAAI,CAACN,WAAL,EAHI,EAGgBM,IAAI,CAACL,aAAL,EAHhB,EAIJK,IAAI,CAACJ,aAAL,EAJI,CAAR;AAKA;AAED;AACA;AACA;AACA;AACA;;;AACA,SAAStD,aAAT,CAAuB2C,GAAvB,EACA;AACC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACC,MAAIiB,OAAO,GAAG,CAACjB,GAAf;;AACA,MAAI,CAACkB,KAAK,CAACD,OAAD,CAAV,EAAqB;AACpB,WAAQ,IAAIb,IAAJ,CAASa,OAAT,CAAR;AACA,GAFD,MAEO;AACN,WAAQ,IAAIb,IAAJ,CAASJ,GAAT,CAAR;AACA;AACD;AAGD;AACA;AACA;AACA;;;AACA,IAAImB,gBAAgB,GAAGC,MAAM,CAACD,gBAAP,IAA2B,gBAAlD;AACA,IAAIE,gBAAgB,GAAGD,MAAM,CAACC,gBAAP,IAA2B,CAAC,gBAAnD;AAGA;AACA;AACA;;AACA,IAAIC,WAAW,GAAG;AACjBC,EAAAA,IAAI,EAAE,EADW;AAEjBC,EAAAA,SAAS,EAAE,IAFM;AAGjBC,EAAAA,WAAW,EAAE,KAHI;AAIjBC,EAAAA,aAAa,EAAE,KAJE;AAKjBC,EAAAA,cAAc,EAAE,KALC;AAMjBC,EAAAA,cAAc,EAAE,KANC;AAOjBC,EAAAA,kBAAkB,EAAE;AAPH,CAAlB;AAUA,IAAIC,IAAI,GAAG,IAAX;AACA,IAAIC,IAAI,GAAG,IAAX;AAEA,IAAIC,IAAI,GAAG,IAAX;AACA,IAAIC,IAAI,GAAG,IAAX;AACA,IAAIC,IAAI,GAAG,IAAX;AACA,IAAIC,IAAI,GAAG,IAAX;AACA,IAAIC,IAAI,GAAG,IAAX;AACA,IAAIC,IAAI,GAAG,IAAX;AAEA,IAAIC,IAAI,GAAG,IAAX;AACA,IAAIC,IAAI,GAAG,IAAX;AACA,IAAIC,IAAI,GAAG,IAAX;AACA,IAAIC,IAAI,GAAG,IAAX;AACA,IAAIC,IAAI,GAAG,IAAX;AACA,IAAIC,IAAI,GAAG,IAAX;AAEA,IAAIC,WAAW,GAAG,IAAlB;AACA,IAAIC,UAAU,GAAG,IAAjB;AACA,IAAIC,UAAU,GAAG,IAAjB;AAGA;AACA;AACA;AACA;;AACA,SAAS5F,YAAT,CAAsB8C,GAAtB,EAA2B+C,KAA3B,EACA;AACCnH,EAAAA,UAAU,CAACoH,MAAX,CAAkBhD,GAAlB,EAAuB,KAAvB;AACApE,EAAAA,UAAU,CAACqH,cAAX,CAA0BF,KAA1B,EAAiC,SAAjC;AAEA,MAAIG,YAAY,GAAG,KAAnB;AACA,MAAIC,OAAO,GAAG7B,WAAd;;AAEA,MAAIyB,KAAJ,EAAW;AACVG,IAAAA,YAAY,GAAG5G,MAAM,CAACyG,KAAD,EAAQ,MAAR,CAArB;AACAI,IAAAA,OAAO,GAAGpG,YAAY,CAACoG,OAAD,EAAUJ,KAAV,CAAtB;AACAnH,IAAAA,UAAU,CAACwH,MAAX,CAAkBD,OAAO,CAAC5B,IAA1B,EAAgC,cAAhC;AACA3F,IAAAA,UAAU,CAAC+D,EAAX,CAAcwD,OAAO,CAAC5B,IAAR,IAAgB,CAA9B,EAAiC,mBAAjC;AACA3F,IAAAA,UAAU,CAAC+D,EAAX,CAAcwD,OAAO,CAAC5B,IAAR,IAAgB,EAA9B,EAAkC,oBAAlC;AACA3F,IAAAA,UAAU,CAACyH,IAAX,CAAgBF,OAAO,CAAC3B,SAAxB,EAAmC,mBAAnC;AACA5F,IAAAA,UAAU,CAACyH,IAAX,CAAgBF,OAAO,CAAC1B,WAAxB,EAAqC,qBAArC;AACA7F,IAAAA,UAAU,CAACyH,IAAX,CAAgBF,OAAO,CAACzB,aAAxB,EACI,uBADJ;AAEA9F,IAAAA,UAAU,CAACyH,IAAX,CAAgBF,OAAO,CAACxB,cAAxB,EACI,wBADJ;AAEA/F,IAAAA,UAAU,CAACyH,IAAX,CAAgBF,OAAO,CAACvB,cAAxB,EACI,wBADJ;AAEAhG,IAAAA,UAAU,CAACyH,IAAX,CAAgBF,OAAO,CAACtB,kBAAxB,EACI,4BADJ;;AAGA,QAAIsB,OAAO,CAACtB,kBAAZ,EAAgC;AAC/BjG,MAAAA,UAAU,CAAC+D,EAAX,CAAc,CAACuD,YAAf,EACI,yCACA,oBAFJ;AAGA;AACD;;AAED,MAAII,CAAJ;AACA,MAAIC,KAAK,GAAG,CAAC,CAAb;AACA,MAAIhC,IAAI,GAAG4B,OAAO,CAAC5B,IAAnB;AACA,MAAIiC,KAAJ;AACA,MAAIC,IAAI,GAAG,CAAX;AACA,MAAIC,KAAK,GAAG,CAAZ;AACA,MAAIC,GAAG,GAAG,CAAV;AACA,MAAIC,GAAG,GAAG5D,GAAG,CAAC3B,MAAd;AAEA;;AACA,MAAI8E,OAAO,CAACvB,cAAZ,EAA4B;AAC3B,WAAO+B,GAAG,GAAGC,GAAN,IAAaC,OAAO,CAAC7D,GAAG,CAAC8D,UAAJ,CAAeH,GAAf,CAAD,CAA3B,EAAkD;AACjD,QAAEA,GAAF;AACA;AACD;AAED;;;AACA,MAAIR,OAAO,CAAC3B,SAAZ,EAAuB;AACtB,QAAIxB,GAAG,CAAC2D,GAAD,CAAH,KAAa,GAAjB,EAAsB;AACrBA,MAAAA,GAAG,IAAI,CAAP;AACAF,MAAAA,IAAI,GAAG,CAAC,CAAR;AACA,KAHD,MAGO,IAAIzD,GAAG,CAAC2D,GAAD,CAAH,KAAa,GAAjB,EAAsB;AAC5BA,MAAAA,GAAG,IAAI,CAAP;AACA;AACD;AAED;;;AACA,MAAI3D,GAAG,CAAC2D,GAAD,CAAH,KAAa,GAAjB,EAAsB;AACrB,QAAIR,OAAO,CAAC1B,WAAZ,EAAyB;AACxB8B,MAAAA,KAAK,GAAGQ,YAAY,CAAC/D,GAAG,CAAC8D,UAAJ,CAAeH,GAAG,GAAG,CAArB,CAAD,CAApB;;AACA,UAAIJ,KAAK,KAAK,CAAC,CAAX,KAAiB,CAACL,YAAD,IAAiBK,KAAK,KAAKhC,IAA5C,CAAJ,EAAuD;AACtDA,QAAAA,IAAI,GAAGgC,KAAP;AACAI,QAAAA,GAAG,IAAI,CAAP;AACA;AACD;;AAED,QAAIJ,KAAK,KAAK,CAAC,CAAX,IAAgBJ,OAAO,CAACtB,kBAA5B,EAAgD;AAC/CN,MAAAA,IAAI,GAAG,CAAP;AACA;AACD;AAED;;;AACA,OAAKiC,KAAK,GAAGG,GAAb,EAAkBA,GAAG,GAAGC,GAAxB,EAA6B,EAAED,GAA/B,EAAoC;AACnCL,IAAAA,CAAC,GAAGU,cAAc,CAAChE,GAAG,CAAC8D,UAAJ,CAAeH,GAAf,CAAD,CAAlB;;AACA,QAAIL,CAAC,KAAK,CAAC,CAAP,IAAYA,CAAC,GAAG/B,IAApB,EAA0B;AACzBmC,MAAAA,KAAK,IAAInC,IAAT;AACAmC,MAAAA,KAAK,IAAIJ,CAAT;AACA,KAHD,MAGO;AACN;AACA;AACD;AAED;;;AACA,MAAIE,KAAK,KAAKG,GAAd,EAAmB;AAClB,WAAQ,IAAI1F,KAAJ,CAAU,qBAAqBgG,IAAI,CAACC,SAAL,CAAelE,GAAf,CAA/B,CAAR;AACA;AAED;;;AACA,MAAImD,OAAO,CAACvB,cAAZ,EAA4B;AAC3B,WAAO+B,GAAG,GAAGC,GAAN,IAAaC,OAAO,CAAC7D,GAAG,CAAC8D,UAAJ,CAAeH,GAAf,CAAD,CAA3B,EAAkD;AACjD,QAAEA,GAAF;AACA;AACD;AAED;;;AACA,MAAIA,GAAG,GAAGC,GAAN,IAAa,CAACT,OAAO,CAACzB,aAA1B,EAAyC;AACxC,WAAQ,IAAIzD,KAAJ,CAAU,uCACdgG,IAAI,CAACC,SAAL,CAAelE,GAAG,CAACN,KAAJ,CAAUiE,GAAV,CAAf,CADI,CAAR;AAEA;AAED;;;AACA,MAAID,KAAK,KAAK,CAAd,EAAiB;AAChB,WAAQ,CAAR;AACA;AAED;;;AACA,MAAIS,MAAM,GAAGT,KAAK,GAAGD,IAArB;AAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACC,MAAI,CAACN,OAAO,CAACxB,cAAT,KACC+B,KAAK,GAAGvC,gBAAR,IAA4BgD,MAAM,GAAG9C,gBADtC,CAAJ,EAC6D;AAC5D,WAAQ,IAAIpD,KAAJ,CAAU,+CACdgG,IAAI,CAACC,SAAL,CAAelE,GAAG,CAACN,KAAJ,CAAU8D,KAAV,EAAiBG,GAAjB,CAAf,CADI,CAAR;AAEA;;AAED,SAAQQ,MAAR;AACA;AAGD;AACA;AACA;;;AACA,SAASH,cAAT,CAAwB7D,CAAxB,EACA;AACC,MAAIA,CAAC,IAAI2B,IAAL,IAAa3B,CAAC,IAAI4B,IAAtB,EAA4B;AAC3B;AACA,WAAQ5B,CAAC,GAAGyC,WAAZ;AACA,GAHD,MAGO,IAAIzC,CAAC,IAAI6B,IAAL,IAAa7B,CAAC,IAAIkC,IAAtB,EAA4B;AAClC;AACA,WAAQlC,CAAC,GAAG0C,UAAZ;AACA,GAHM,MAGA,IAAI1C,CAAC,IAAImC,IAAL,IAAanC,CAAC,IAAIwC,IAAtB,EAA4B;AAClC;AACA,WAAQxC,CAAC,GAAG2C,UAAZ;AACA,GAHM,MAGA;AACN;AACA,WAAQ,CAAC,CAAT;AACA;AACD;AAGD;AACA;AACA;;;AACA,SAASe,OAAT,CAAiBP,CAAjB,EACA;AACC,SAAQA,CAAC,KAAK,IAAP,IACFA,CAAC,IAAI,MAAL,IAAeA,CAAC,IAAI,MADlB,IAEFA,CAAC,KAAK,MAFJ,IAGFA,CAAC,KAAK,MAHJ,IAIFA,CAAC,KAAK,MAJJ,IAKFA,CAAC,IAAI,MAAL,IAAeA,CAAC,IAAI,MALlB,IAMFA,CAAC,KAAK,MANJ,IAOFA,CAAC,KAAK,MAPJ,IAQFA,CAAC,KAAK,MARJ,IASFA,CAAC,KAAK,MATJ,IAUFA,CAAC,KAAK,MAVJ,IAWFA,CAAC,KAAK,MAXX;AAYA;AAGD;AACA;AACA;;;AACA,SAASS,YAAT,CAAsBT,CAAtB,EACA;AACC,MAAIA,CAAC,KAAKf,IAAN,IAAce,CAAC,KAAKrB,IAAxB,EAA8B;AAC7B;AACA,WAAQ,CAAR;AACA,GAHD,MAGO,IAAIqB,CAAC,KAAKd,IAAN,IAAcc,CAAC,KAAKpB,IAAxB,EAA8B;AACpC;AACA,WAAQ,CAAR;AACA,GAHM,MAGA,IAAIoB,CAAC,KAAKb,IAAN,IAAca,CAAC,KAAKnB,IAAxB,EAA8B;AACpC;AACA,WAAQ,EAAR;AACA,GAHM,MAGA,IAAImB,CAAC,KAAKZ,IAAN,IAAcY,CAAC,KAAKlB,IAAxB,EAA8B;AACpC;AACA,WAAQ,EAAR;AACA,GAHM,MAGA;AACN;AACA,WAAQ,CAAC,CAAT;AACA;AACD;;AAGD,SAASxF,oBAAT,CAA8BwH,MAA9B,EAAsCC,KAAtC,EACA;AACC,MAAIC,MAAM,GAAGrI,cAAc,CAACsI,QAAf,CAAwBF,KAAxB,EAA+BD,MAA/B,CAAb;AAEA,MAAIE,MAAM,CAACE,MAAP,CAAcnG,MAAd,KAAyB,CAA7B,EACC,OAAQ,IAAR;AAED;;AACA,MAAIoG,KAAK,GAAGH,MAAM,CAACE,MAAP,CAAc,CAAd,CAAZ;AAEA;;AACA,MAAIE,QAAQ,GAAGD,KAAK,CAAC,UAAD,CAApB;AACA,MAAIE,MAAM,GAAGF,KAAK,CAAC,SAAD,CAAL,CAAiBG,WAAjB,EAAb;AACA,MAAI3F,CAAJ,EAAO4F,CAAP;AAEA;AACD;AACA;AACA;;AACC,MAAI,CAAC5F,CAAC,GAAG0F,MAAM,CAACzF,OAAP,CAAe,eAAf,CAAL,KAAyC,CAAC,CAA1C,IACA,CAAC2F,CAAC,GAAGF,MAAM,CAACzF,OAAP,CAAe,2CACpB,6CADK,CAAL,KACmD,CAAC,CAFxD,EAE2D;AAC1DD,IAAAA,CAAC,IAAI,gBAAgBZ,MAArB;AACA,QAAIqG,QAAQ,KAAK,EAAjB,EACCA,QAAQ,GAAGC,MAAM,CAACvF,MAAP,CAAcH,CAAd,EAAiB4F,CAAC,GAAG5F,CAArB,CAAX,CADD,KAGCyF,QAAQ,GAAGA,QAAQ,GAAG,GAAX,GAAiBC,MAAM,CAACvF,MAAP,CAAcH,CAAd,EAAiB4F,CAAC,GAAG5F,CAArB,CAA5B;AAED0F,IAAAA,MAAM,GAAG,sBAAT;AACA;;AAED,MAAI/E,EAAE,GAAG,IAAI5D,UAAU,CAAC8I,MAAf,CAAsB,mBAAtB,EAA2CJ,QAA3C,EAAqDC,MAArD,CAAT;AACA/E,EAAAA,EAAE,CAACmF,WAAH,GAAiBN,KAAjB;AACA,SAAQ7E,EAAR;AACA;;AAED,SAAS/C,OAAT,CAAiBmI,GAAjB,EACA;AACCpJ,EAAAA,UAAU,CAAC+D,EAAX,CAAcvB,KAAK,CAAC6G,OAAN,CAAcD,GAAd,KAAsBA,GAAG,CAAC3G,MAAJ,GAAa,CAAjD,EACI,4CADJ;AAGA,SAAQ2G,GAAG,CAACE,IAAI,CAACC,KAAL,CAAWD,IAAI,CAACE,MAAL,KAAgBJ,GAAG,CAAC3G,MAA/B,CAAD,CAAX;AACA;;AAED,SAASgH,YAAT,CAAsBC,CAAtB,EACA;AACC1J,EAAAA,UAAU,CAAC+D,EAAX,CAAc2F,CAAC,CAAC,CAAD,CAAD,IAAQ,CAAR,IAAaA,CAAC,CAAC,CAAD,CAAD,IAAQ,CAAnC,EACI,yCADJ;AAEA1J,EAAAA,UAAU,CAAC+D,EAAX,CAAc2F,CAAC,CAAC,CAAD,CAAD,GAAO,GAArB,EAA0B,6BAA1B;AACA;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AACA,SAAS/H,UAAT,CAAoB+H,CAApB,EAAuBC,CAAvB,EACA;AACCF,EAAAA,YAAY,CAACC,CAAD,CAAZ;AACAD,EAAAA,YAAY,CAACE,CAAD,CAAZ;AACA3J,EAAAA,UAAU,CAAC+D,EAAX,CAAc2F,CAAC,CAAC,CAAD,CAAD,GAAOC,CAAC,CAAC,CAAD,CAAR,IAAgBD,CAAC,CAAC,CAAD,CAAD,IAAQC,CAAC,CAAC,CAAD,CAAT,IAAgBD,CAAC,CAAC,CAAD,CAAD,IAAQC,CAAC,CAAC,CAAD,CAAvD,EACI,kCADJ;AAGA,MAAI3F,EAAE,GAAG,CAAE0F,CAAC,CAAC,CAAD,CAAD,GAAOC,CAAC,CAAC,CAAD,CAAV,EAAe,CAAf,CAAT;;AAEA,MAAID,CAAC,CAAC,CAAD,CAAD,IAAQC,CAAC,CAAC,CAAD,CAAb,EAAkB;AACjB3F,IAAAA,EAAE,CAAC,CAAD,CAAF,GAAQ0F,CAAC,CAAC,CAAD,CAAD,GAAOC,CAAC,CAAC,CAAD,CAAhB;AACA,GAFD,MAEO;AACN3F,IAAAA,EAAE,CAAC,CAAD,CAAF;AACAA,IAAAA,EAAE,CAAC,CAAD,CAAF,GAAQ,OAAO2F,CAAC,CAAC,CAAD,CAAD,GAAOD,CAAC,CAAC,CAAD,CAAf,CAAR;AACA;;AAED,SAAQ1F,EAAR;AACA;AAED;AACA;AACA;AACA;;;AACA,SAASlC,aAAT,CAAuB4H,CAAvB,EACA;AACCD,EAAAA,YAAY,CAACC,CAAD,CAAZ;AAEA,SAAQJ,IAAI,CAACC,KAAL,CAAWG,CAAC,CAAC,CAAD,CAAD,GAAO,GAAP,GAAaA,CAAC,CAAC,CAAD,CAAzB,CAAR;AACA;AAED;AACA;AACA;AACA;;;AACA,SAAS3H,cAAT,CAAwB2H,CAAxB,EACA;AACCD,EAAAA,YAAY,CAACC,CAAD,CAAZ;AAEA,SAAQJ,IAAI,CAACC,KAAL,CAAWG,CAAC,CAAC,CAAD,CAAD,GAAO,GAAP,GAAaA,CAAC,CAAC,CAAD,CAAD,GAAO,GAA/B,CAAR;AACA;AAED;AACA;AACA;AACA;;;AACA,SAAS1H,cAAT,CAAwB0H,CAAxB,EACA;AACCD,EAAAA,YAAY,CAACC,CAAD,CAAZ;AAEA,SAAQJ,IAAI,CAACC,KAAL,CAAWG,CAAC,CAAC,CAAD,CAAD,GAAO,GAAP,GAAaA,CAAC,CAAC,CAAD,CAAD,GAAO,GAA/B,CAAR;AACA;AAED;AACA;AACA;AACA;AACA;;;AACA,SAAS9H,WAAT,CAAqB8H,CAArB,EAAwBC,CAAxB,EACA;AACCF,EAAAA,YAAY,CAACC,CAAD,CAAZ;AACAD,EAAAA,YAAY,CAACE,CAAD,CAAZ;AAEA;AACD;AACA;;AACCD,EAAAA,CAAC,CAAC,CAAD,CAAD,IAAQC,CAAC,CAAC,CAAD,CAAT;;AACA,MAAID,CAAC,CAAC,CAAD,CAAD,IAAQ,GAAZ,EAAiB;AAChB;AACF;AACA;AACA;AACEA,IAAAA,CAAC,CAAC,CAAD,CAAD;AACAA,IAAAA,CAAC,CAAC,CAAD,CAAD,IAAQ,GAAR;AACA;AAED;AACD;AACA;;;AACCA,EAAAA,CAAC,CAAC,CAAD,CAAD,IAAQC,CAAC,CAAC,CAAD,CAAT;AAEA,SAAQD,CAAR;AACA;AAED;AACA;AACA;AACA;;;AACA,SAAS7H,SAAT,CAAmB6H,CAAnB,EAAsBC,CAAtB,EACA;AACCF,EAAAA,YAAY,CAACC,CAAD,CAAZ;AAEA,MAAI1F,EAAE,GAAG,CAAE0F,CAAC,CAAC,CAAD,CAAH,EAAQA,CAAC,CAAC,CAAD,CAAT,CAAT;AAEA,SAAQ9H,WAAW,CAACoC,EAAD,EAAK2F,CAAL,CAAnB;AACA;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;;;AACA,SAASzI,eAAT,CAAyBe,GAAzB,EAA8B2H,OAA9B,EACA;AACC5J,EAAAA,UAAU,CAAC+D,EAAX,CAAc,OAAQ9B,GAAR,KAAiB,QAAjB,IAA6BA,GAAG,KAAK,IAAnD,EACI,wCADJ;AAEAjC,EAAAA,UAAU,CAAC+D,EAAX,CAAcvB,KAAK,CAAC6G,OAAN,CAAcO,OAAd,CAAd,EACI,8CADJ;;AAEA,OAAK,IAAIvG,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGuG,OAAO,CAACnH,MAA5B,EAAoCY,CAAC,EAArC,EAAyC;AACxCrD,IAAAA,UAAU,CAAC+D,EAAX,CAAc,OAAQ6F,OAAO,CAACvG,CAAD,CAAf,KAAwB,QAAtC,EACI,8CADJ;AAEA;;AAED,SAAQd,MAAM,CAACsH,IAAP,CAAY5H,GAAZ,EAAiB6H,MAAjB,CAAwB,UAAU3H,GAAV,EAAe;AAC9C,WAAQyH,OAAO,CAACtG,OAAR,CAAgBnB,GAAhB,MAAyB,CAAC,CAAlC;AACA,GAFO,CAAR;AAGA;AAED;AACA;AACA;AACA;AACA;AACA;;;AACA,SAAShB,YAAT,CAAsB4I,QAAtB,EAAgCC,SAAhC,EAA2CC,QAA3C,EACA;AACC,MAAIjG,EAAJ,EAAQnB,CAAR;AAEAmB,EAAAA,EAAE,GAAG,EAAL;;AACA,MAAIiG,QAAJ,EAAc;AACb,SAAKpH,CAAL,IAAUoH,QAAV,EACCjG,EAAE,CAACnB,CAAD,CAAF,GAAQoH,QAAQ,CAACpH,CAAD,CAAhB;AACD;;AAED,MAAIkH,QAAJ,EAAc;AACb,SAAKlH,CAAL,IAAUkH,QAAV,EACC/F,EAAE,CAACnB,CAAD,CAAF,GAAQkH,QAAQ,CAAClH,CAAD,CAAhB;AACD;;AAED,MAAImH,SAAJ,EAAe;AACd,SAAKnH,CAAL,IAAUmH,SAAV,EACChG,EAAE,CAACnB,CAAD,CAAF,GAAQmH,SAAS,CAACnH,CAAD,CAAjB;AACD;;AAED,SAAQmB,EAAR;AACA","sourcesContent":["/*\n * lib/jsprim.js: utilities for primitive JavaScript types\n */\n\nvar mod_assert = require('assert-plus');\nvar mod_util = require('util');\n\nvar mod_extsprintf = require('extsprintf');\nvar mod_verror = require('verror');\nvar mod_jsonschema = require('json-schema');\n\n/*\n * Public interface\n */\nexports.deepCopy = deepCopy;\nexports.deepEqual = deepEqual;\nexports.isEmpty = isEmpty;\nexports.hasKey = hasKey;\nexports.forEachKey = forEachKey;\nexports.pluck = pluck;\nexports.flattenObject = flattenObject;\nexports.flattenIter = flattenIter;\nexports.validateJsonObject = validateJsonObjectJS;\nexports.validateJsonObjectJS = validateJsonObjectJS;\nexports.randElt = randElt;\nexports.extraProperties = extraProperties;\nexports.mergeObjects = mergeObjects;\n\nexports.startsWith = startsWith;\nexports.endsWith = endsWith;\n\nexports.parseInteger = parseInteger;\n\nexports.iso8601 = iso8601;\nexports.rfc1123 = rfc1123;\nexports.parseDateTime = parseDateTime;\n\nexports.hrtimediff = hrtimeDiff;\nexports.hrtimeDiff = hrtimeDiff;\nexports.hrtimeAccum = hrtimeAccum;\nexports.hrtimeAdd = hrtimeAdd;\nexports.hrtimeNanosec = hrtimeNanosec;\nexports.hrtimeMicrosec = hrtimeMicrosec;\nexports.hrtimeMillisec = hrtimeMillisec;\n\n\n/*\n * Deep copy an acyclic *basic* Javascript object. This only handles basic\n * scalars (strings, numbers, booleans) and arbitrarily deep arrays and objects\n * containing these. This does *not* handle instances of other classes.\n */\nfunction deepCopy(obj)\n{\n\tvar ret, key;\n\tvar marker = '__deepCopy';\n\n\tif (obj && obj[marker])\n\t\tthrow (new Error('attempted deep copy of cyclic object'));\n\n\tif (obj && obj.constructor == Object) {\n\t\tret = {};\n\t\tobj[marker] = true;\n\n\t\tfor (key in obj) {\n\t\t\tif (key == marker)\n\t\t\t\tcontinue;\n\n\t\t\tret[key] = deepCopy(obj[key]);\n\t\t}\n\n\t\tdelete (obj[marker]);\n\t\treturn (ret);\n\t}\n\n\tif (obj && obj.constructor == Array) {\n\t\tret = [];\n\t\tobj[marker] = true;\n\n\t\tfor (key = 0; key < obj.length; key++)\n\t\t\tret.push(deepCopy(obj[key]));\n\n\t\tdelete (obj[marker]);\n\t\treturn (ret);\n\t}\n\n\t/*\n\t * It must be a primitive type -- just return it.\n\t */\n\treturn (obj);\n}\n\nfunction deepEqual(obj1, obj2)\n{\n\tif (typeof (obj1) != typeof (obj2))\n\t\treturn (false);\n\n\tif (obj1 === null || obj2 === null || typeof (obj1) != 'object')\n\t\treturn (obj1 === obj2);\n\n\tif (obj1.constructor != obj2.constructor)\n\t\treturn (false);\n\n\tvar k;\n\tfor (k in obj1) {\n\t\tif (!obj2.hasOwnProperty(k))\n\t\t\treturn (false);\n\n\t\tif (!deepEqual(obj1[k], obj2[k]))\n\t\t\treturn (false);\n\t}\n\n\tfor (k in obj2) {\n\t\tif (!obj1.hasOwnProperty(k))\n\t\t\treturn (false);\n\t}\n\n\treturn (true);\n}\n\nfunction isEmpty(obj)\n{\n\tvar key;\n\tfor (key in obj)\n\t\treturn (false);\n\treturn (true);\n}\n\nfunction hasKey(obj, key)\n{\n\tmod_assert.equal(typeof (key), 'string');\n\treturn (Object.prototype.hasOwnProperty.call(obj, key));\n}\n\nfunction forEachKey(obj, callback)\n{\n\tfor (var key in obj) {\n\t\tif (hasKey(obj, key)) {\n\t\t\tcallback(key, obj[key]);\n\t\t}\n\t}\n}\n\nfunction pluck(obj, key)\n{\n\tmod_assert.equal(typeof (key), 'string');\n\treturn (pluckv(obj, key));\n}\n\nfunction pluckv(obj, key)\n{\n\tif (obj === null || typeof (obj) !== 'object')\n\t\treturn (undefined);\n\n\tif (obj.hasOwnProperty(key))\n\t\treturn (obj[key]);\n\n\tvar i = key.indexOf('.');\n\tif (i == -1)\n\t\treturn (undefined);\n\n\tvar key1 = key.substr(0, i);\n\tif (!obj.hasOwnProperty(key1))\n\t\treturn (undefined);\n\n\treturn (pluckv(obj[key1], key.substr(i + 1)));\n}\n\n/*\n * Invoke callback(row) for each entry in the array that would be returned by\n * flattenObject(data, depth). This is just like flattenObject(data,\n * depth).forEach(callback), except that the intermediate array is never\n * created.\n */\nfunction flattenIter(data, depth, callback)\n{\n\tdoFlattenIter(data, depth, [], callback);\n}\n\nfunction doFlattenIter(data, depth, accum, callback)\n{\n\tvar each;\n\tvar key;\n\n\tif (depth === 0) {\n\t\teach = accum.slice(0);\n\t\teach.push(data);\n\t\tcallback(each);\n\t\treturn;\n\t}\n\n\tmod_assert.ok(data !== null);\n\tmod_assert.equal(typeof (data), 'object');\n\tmod_assert.equal(typeof (depth), 'number');\n\tmod_assert.ok(depth >= 0);\n\n\tfor (key in data) {\n\t\teach = accum.slice(0);\n\t\teach.push(key);\n\t\tdoFlattenIter(data[key], depth - 1, each, callback);\n\t}\n}\n\nfunction flattenObject(data, depth)\n{\n\tif (depth === 0)\n\t\treturn ([ data ]);\n\n\tmod_assert.ok(data !== null);\n\tmod_assert.equal(typeof (data), 'object');\n\tmod_assert.equal(typeof (depth), 'number');\n\tmod_assert.ok(depth >= 0);\n\n\tvar rv = [];\n\tvar key;\n\n\tfor (key in data) {\n\t\tflattenObject(data[key], depth - 1).forEach(function (p) {\n\t\t\trv.push([ key ].concat(p));\n\t\t});\n\t}\n\n\treturn (rv);\n}\n\nfunction startsWith(str, prefix)\n{\n\treturn (str.substr(0, prefix.length) == prefix);\n}\n\nfunction endsWith(str, suffix)\n{\n\treturn (str.substr(\n\t str.length - suffix.length, suffix.length) == suffix);\n}\n\nfunction iso8601(d)\n{\n\tif (typeof (d) == 'number')\n\t\td = new Date(d);\n\tmod_assert.ok(d.constructor === Date);\n\treturn (mod_extsprintf.sprintf('%4d-%02d-%02dT%02d:%02d:%02d.%03dZ',\n\t d.getUTCFullYear(), d.getUTCMonth() + 1, d.getUTCDate(),\n\t d.getUTCHours(), d.getUTCMinutes(), d.getUTCSeconds(),\n\t d.getUTCMilliseconds()));\n}\n\nvar RFC1123_MONTHS = [\n 'Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun',\n 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec'];\nvar RFC1123_DAYS = [\n 'Sun', 'Mon', 'Tue', 'Wed', 'Thu', 'Fri', 'Sat'];\n\nfunction rfc1123(date) {\n\treturn (mod_extsprintf.sprintf('%s, %02d %s %04d %02d:%02d:%02d GMT',\n\t RFC1123_DAYS[date.getUTCDay()], date.getUTCDate(),\n\t RFC1123_MONTHS[date.getUTCMonth()], date.getUTCFullYear(),\n\t date.getUTCHours(), date.getUTCMinutes(),\n\t date.getUTCSeconds()));\n}\n\n/*\n * Parses a date expressed as a string, as either a number of milliseconds since\n * the epoch or any string format that Date accepts, giving preference to the\n * former where these two sets overlap (e.g., small numbers).\n */\nfunction parseDateTime(str)\n{\n\t/*\n\t * This is irritatingly implicit, but significantly more concise than\n\t * alternatives. The \"+str\" will convert a string containing only a\n\t * number directly to a Number, or NaN for other strings. Thus, if the\n\t * conversion succeeds, we use it (this is the milliseconds-since-epoch\n\t * case). Otherwise, we pass the string directly to the Date\n\t * constructor to parse.\n\t */\n\tvar numeric = +str;\n\tif (!isNaN(numeric)) {\n\t\treturn (new Date(numeric));\n\t} else {\n\t\treturn (new Date(str));\n\t}\n}\n\n\n/*\n * Number.*_SAFE_INTEGER isn't present before node v0.12, so we hardcode\n * the ES6 definitions here, while allowing for them to someday be higher.\n */\nvar MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER || 9007199254740991;\nvar MIN_SAFE_INTEGER = Number.MIN_SAFE_INTEGER || -9007199254740991;\n\n\n/*\n * Default options for parseInteger().\n */\nvar PI_DEFAULTS = {\n\tbase: 10,\n\tallowSign: true,\n\tallowPrefix: false,\n\tallowTrailing: false,\n\tallowImprecise: false,\n\ttrimWhitespace: false,\n\tleadingZeroIsOctal: false\n};\n\nvar CP_0 = 0x30;\nvar CP_9 = 0x39;\n\nvar CP_A = 0x41;\nvar CP_B = 0x42;\nvar CP_O = 0x4f;\nvar CP_T = 0x54;\nvar CP_X = 0x58;\nvar CP_Z = 0x5a;\n\nvar CP_a = 0x61;\nvar CP_b = 0x62;\nvar CP_o = 0x6f;\nvar CP_t = 0x74;\nvar CP_x = 0x78;\nvar CP_z = 0x7a;\n\nvar PI_CONV_DEC = 0x30;\nvar PI_CONV_UC = 0x37;\nvar PI_CONV_LC = 0x57;\n\n\n/*\n * A stricter version of parseInt() that provides options for changing what\n * is an acceptable string (for example, disallowing trailing characters).\n */\nfunction parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}\n\n\n/*\n * Interpret a character code as a base-36 digit.\n */\nfunction translateDigit(d)\n{\n\tif (d >= CP_0 && d <= CP_9) {\n\t\t/* '0' to '9' -> 0 to 9 */\n\t\treturn (d - PI_CONV_DEC);\n\t} else if (d >= CP_A && d <= CP_Z) {\n\t\t/* 'A' - 'Z' -> 10 to 35 */\n\t\treturn (d - PI_CONV_UC);\n\t} else if (d >= CP_a && d <= CP_z) {\n\t\t/* 'a' - 'z' -> 10 to 35 */\n\t\treturn (d - PI_CONV_LC);\n\t} else {\n\t\t/* Invalid character code */\n\t\treturn (-1);\n\t}\n}\n\n\n/*\n * Test if a value matches the ECMAScript definition of trimmable whitespace.\n */\nfunction isSpace(c)\n{\n\treturn (c === 0x20) ||\n\t (c >= 0x0009 && c <= 0x000d) ||\n\t (c === 0x00a0) ||\n\t (c === 0x1680) ||\n\t (c === 0x180e) ||\n\t (c >= 0x2000 && c <= 0x200a) ||\n\t (c === 0x2028) ||\n\t (c === 0x2029) ||\n\t (c === 0x202f) ||\n\t (c === 0x205f) ||\n\t (c === 0x3000) ||\n\t (c === 0xfeff);\n}\n\n\n/*\n * Determine which base a character indicates (e.g., 'x' indicates hex).\n */\nfunction prefixToBase(c)\n{\n\tif (c === CP_b || c === CP_B) {\n\t\t/* 0b/0B (binary) */\n\t\treturn (2);\n\t} else if (c === CP_o || c === CP_O) {\n\t\t/* 0o/0O (octal) */\n\t\treturn (8);\n\t} else if (c === CP_t || c === CP_T) {\n\t\t/* 0t/0T (decimal) */\n\t\treturn (10);\n\t} else if (c === CP_x || c === CP_X) {\n\t\t/* 0x/0X (hexadecimal) */\n\t\treturn (16);\n\t} else {\n\t\t/* Not a meaningful character */\n\t\treturn (-1);\n\t}\n}\n\n\nfunction validateJsonObjectJS(schema, input)\n{\n\tvar report = mod_jsonschema.validate(input, schema);\n\n\tif (report.errors.length === 0)\n\t\treturn (null);\n\n\t/* Currently, we only do anything useful with the first error. */\n\tvar error = report.errors[0];\n\n\t/* The failed property is given by a URI with an irrelevant prefix. */\n\tvar propname = error['property'];\n\tvar reason = error['message'].toLowerCase();\n\tvar i, j;\n\n\t/*\n\t * There's at least one case where the property error message is\n\t * confusing at best. We work around this here.\n\t */\n\tif ((i = reason.indexOf('the property ')) != -1 &&\n\t (j = reason.indexOf(' is not defined in the schema and the ' +\n\t 'schema does not allow additional properties')) != -1) {\n\t\ti += 'the property '.length;\n\t\tif (propname === '')\n\t\t\tpropname = reason.substr(i, j - i);\n\t\telse\n\t\t\tpropname = propname + '.' + reason.substr(i, j - i);\n\n\t\treason = 'unsupported property';\n\t}\n\n\tvar rv = new mod_verror.VError('property \"%s\": %s', propname, reason);\n\trv.jsv_details = error;\n\treturn (rv);\n}\n\nfunction randElt(arr)\n{\n\tmod_assert.ok(Array.isArray(arr) && arr.length > 0,\n\t 'randElt argument must be a non-empty array');\n\n\treturn (arr[Math.floor(Math.random() * arr.length)]);\n}\n\nfunction assertHrtime(a)\n{\n\tmod_assert.ok(a[0] >= 0 && a[1] >= 0,\n\t 'negative numbers not allowed in hrtimes');\n\tmod_assert.ok(a[1] < 1e9, 'nanoseconds column overflow');\n}\n\n/*\n * Compute the time elapsed between hrtime readings A and B, where A is later\n * than B. hrtime readings come from Node's process.hrtime(). There is no\n * defined way to represent negative deltas, so it's illegal to diff B from A\n * where the time denoted by B is later than the time denoted by A. If this\n * becomes valuable, we can define a representation and extend the\n * implementation to support it.\n */\nfunction hrtimeDiff(a, b)\n{\n\tassertHrtime(a);\n\tassertHrtime(b);\n\tmod_assert.ok(a[0] > b[0] || (a[0] == b[0] && a[1] >= b[1]),\n\t 'negative differences not allowed');\n\n\tvar rv = [ a[0] - b[0], 0 ];\n\n\tif (a[1] >= b[1]) {\n\t\trv[1] = a[1] - b[1];\n\t} else {\n\t\trv[0]--;\n\t\trv[1] = 1e9 - (b[1] - a[1]);\n\t}\n\n\treturn (rv);\n}\n\n/*\n * Convert a hrtime reading from the array format returned by Node's\n * process.hrtime() into a scalar number of nanoseconds.\n */\nfunction hrtimeNanosec(a)\n{\n\tassertHrtime(a);\n\n\treturn (Math.floor(a[0] * 1e9 + a[1]));\n}\n\n/*\n * Convert a hrtime reading from the array format returned by Node's\n * process.hrtime() into a scalar number of microseconds.\n */\nfunction hrtimeMicrosec(a)\n{\n\tassertHrtime(a);\n\n\treturn (Math.floor(a[0] * 1e6 + a[1] / 1e3));\n}\n\n/*\n * Convert a hrtime reading from the array format returned by Node's\n * process.hrtime() into a scalar number of milliseconds.\n */\nfunction hrtimeMillisec(a)\n{\n\tassertHrtime(a);\n\n\treturn (Math.floor(a[0] * 1e3 + a[1] / 1e6));\n}\n\n/*\n * Add two hrtime readings A and B, overwriting A with the result of the\n * addition. This function is useful for accumulating several hrtime intervals\n * into a counter. Returns A.\n */\nfunction hrtimeAccum(a, b)\n{\n\tassertHrtime(a);\n\tassertHrtime(b);\n\n\t/*\n\t * Accumulate the nanosecond component.\n\t */\n\ta[1] += b[1];\n\tif (a[1] >= 1e9) {\n\t\t/*\n\t\t * The nanosecond component overflowed, so carry to the seconds\n\t\t * field.\n\t\t */\n\t\ta[0]++;\n\t\ta[1] -= 1e9;\n\t}\n\n\t/*\n\t * Accumulate the seconds component.\n\t */\n\ta[0] += b[0];\n\n\treturn (a);\n}\n\n/*\n * Add two hrtime readings A and B, returning the result as a new hrtime array.\n * Does not modify either input argument.\n */\nfunction hrtimeAdd(a, b)\n{\n\tassertHrtime(a);\n\n\tvar rv = [ a[0], a[1] ];\n\n\treturn (hrtimeAccum(rv, b));\n}\n\n\n/*\n * Check an object for unexpected properties. Accepts the object to check, and\n * an array of allowed property names (strings). Returns an array of key names\n * that were found on the object, but did not appear in the list of allowed\n * properties. If no properties were found, the returned array will be of\n * zero length.\n */\nfunction extraProperties(obj, allowed)\n{\n\tmod_assert.ok(typeof (obj) === 'object' && obj !== null,\n\t 'obj argument must be a non-null object');\n\tmod_assert.ok(Array.isArray(allowed),\n\t 'allowed argument must be an array of strings');\n\tfor (var i = 0; i < allowed.length; i++) {\n\t\tmod_assert.ok(typeof (allowed[i]) === 'string',\n\t\t 'allowed argument must be an array of strings');\n\t}\n\n\treturn (Object.keys(obj).filter(function (key) {\n\t\treturn (allowed.indexOf(key) === -1);\n\t}));\n}\n\n/*\n * Given three sets of properties \"provided\" (may be undefined), \"overrides\"\n * (required), and \"defaults\" (may be undefined), construct an object containing\n * the union of these sets with \"overrides\" overriding \"provided\", and\n * \"provided\" overriding \"defaults\". None of the input objects are modified.\n */\nfunction mergeObjects(provided, overrides, defaults)\n{\n\tvar rv, k;\n\n\trv = {};\n\tif (defaults) {\n\t\tfor (k in defaults)\n\t\t\trv[k] = defaults[k];\n\t}\n\n\tif (provided) {\n\t\tfor (k in provided)\n\t\t\trv[k] = provided[k];\n\t}\n\n\tif (overrides) {\n\t\tfor (k in overrides)\n\t\t\trv[k] = overrides[k];\n\t}\n\n\treturn (rv);\n}\n"]},"metadata":{},"sourceType":"script"} |