npm - @fluid-experimental/property-common - Versions diffs - 2.0.0-internal.6.3.2 → 2.0.0-internal.6.4.0 - Mend

@fluid-experimental/property-common 2.0.0-internal.6.3.2 → 2.0.0-internal.6.4.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (37) hide show

package/CHANGELOG.md +4 -0
package/dist/constants.d.ts +13 -3
package/dist/constants.d.ts.map +1 -1
package/dist/constants.js +13 -3
package/dist/constants.js.map +1 -1
package/dist/datastructures/collection.d.ts +2 -2
package/dist/datastructures/collection.js +2 -2
package/dist/datastructures/collection.js.map +1 -1
package/dist/datastructures/dataArray.d.ts +1 -1
package/dist/datastructures/dataArray.js +1 -1
package/dist/datastructures/dataArray.js.map +1 -1
package/dist/datastructures/integer64.js +1 -1
package/dist/datastructures/integer64.js.map +1 -1
package/dist/guidUtils.js +1 -1
package/dist/guidUtils.js.map +1 -1
package/lib/constants.d.ts +13 -3
package/lib/constants.d.ts.map +1 -1
package/lib/constants.js +13 -3
package/lib/constants.js.map +1 -1
package/lib/datastructures/collection.d.ts +2 -2
package/lib/datastructures/collection.js +2 -2
package/lib/datastructures/collection.js.map +1 -1
package/lib/datastructures/dataArray.d.ts +1 -1
package/lib/datastructures/dataArray.js +1 -1
package/lib/datastructures/dataArray.js.map +1 -1
package/lib/datastructures/integer64.js +1 -1
package/lib/datastructures/integer64.js.map +1 -1
package/lib/guidUtils.js +1 -1
package/lib/guidUtils.js.map +1 -1
package/package.json +2 -2
package/platform-dependent/CHANGELOG.md +4 -0
package/platform-dependent/package.json +1 -1
package/src/constants.ts +13 -3
package/src/datastructures/collection.ts +2 -2
package/src/datastructures/dataArray.ts +1 -1
package/src/datastructures/integer64.ts +1 -1
package/src/guidUtils.ts +1 -1

package/dist/datastructures/collection.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"collection.js","sourceRoot":"","sources":["../../src/datastructures/collection.ts"],"names":[],"mappings":";;;;;;AAAA;;;GAGG;AACH,4DAA4D;AAC5D;;GAEG;AACH,oDAAuB;AAEvB,MAAM,IAAI,GAAG;IACZ,aAAa,EAAE,0CAA0C;IACzD,kBAAkB,EAAE,iCAAiC;IACrD,kBAAkB,EAAE,mDAAmD;IACvE,aAAa,EAAE,yBAAyB;IACxC,eAAe,EAAE,2BAA2B;IAC5C,aAAa,EAAE,sCAAsC;CACrD,CAAC;AAEF,MAAa,UAAU;IAItB;;;;;OAKG;IACH,YAAsB,QAAQ,qBAAqB,EAAY,KAAqB;QAA9D,UAAK,GAAL,KAAK,CAAwB;QAAY,UAAK,GAAL,KAAK,CAAgB;QAT1E,WAAM,GAAyB,EAAE,CAAC;QAClC,WAAM,GAAwB,EAAE,CAAC;IAQ4C,CAAC;IAExF,4BAA4B;IAC5B,KAAK,CAAC,MAAM,EAAE,QAAQ,IAAG,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,QAAQ,IAAG,CAAC;IAC7B,OAAO,CAAC,QAAQ,IAAG,CAAC;IAEpB,IAAW,KAAK;QACf,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,IAAW,IAAI;QACd,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,MAAuB,EAAE,QAAW;QACvC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC1B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAE5B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEzB,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAE7B,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;;;;;;OAOG;IACK,UAAU,CAAC,QAAW;QAC7B,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,QAAQ,YAAY,IAAI,CAAC,KAAK,CAAC,EAAE;YACpD,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;SACpC;aAAM;YACN,OAAO,IAAI,CAAC;SACZ;IACF,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,QAA8B;QACrC,gBAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YAC9B,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,QAA8B;QACxC,gBAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;SAGK;IACL,OAAO;QACN,OAAO,gBAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;;SAGK;IACL,YAAY;QACX,MAAM,KAAK,GAAG,gBAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnC,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACzD,CAAC;IAED;;;SAGK;IACL,WAAW;QACV,MAAM,KAAK,GAAG,gBAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAClC,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACH,OAAO;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,OAAO;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,iBAAoD;QAC1D,MAAM,GAAG,GAAG,IAAI,UAAU,EAAK,CAAC;QAEhC,MAAM,QAAQ,GAAG,UAAU,MAAM,EAAE,OAAO;YACzC,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YAClD,IAAI,MAAM,EAAE;gBACX,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;aACzB;QACF,CAAC,CAAC;QAEF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAEvB,OAAO,GAAG,CAAC;IACZ,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,YAA+B;QAC1C,MAAM,GAAG,GAAG,IAAI,UAAU,EAAK,CAAC;QAEhC,MAAM,QAAQ,GAAG,gBAAC,CAAC,OAAO,CAAC,YAAY,CAAC;YACvC,CAAC,CAAC,UAAU,MAAM,EAAE,OAAO;gBACzB,IAAI,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;oBAClC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;iBACzB;YACD,CAAC;YACH,CAAC,CAAC,UAAU,MAAM,EAAE,OAAO;gBACzB,IAAI,MAAM,KAAK,YAAY,EAAE;oBAC5B,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;iBACzB;YACD,CAAC,CAAC;QAEL,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAEvB,OAAO,GAAG,CAAC;IACZ,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,cAAiB;QAC9B,MAAM,GAAG,GAAG,IAAI,UAAU,EAAK,CAAC;QAEhC,MAAM,QAAQ,GAAG,UAAU,MAAM,EAAE,OAAO;YACzC,IAAI,OAAO,KAAK,cAAc,EAAE;gBAC/B,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;aACzB;QACF,CAAC,CAAC;QAEF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAEvB,OAAO,GAAG,CAAC;IACZ,CAAC;IAED;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,MAAuB;QAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACtB,OAAO,KAAK,CAAC;SACb;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAErC,gEAAgE;QAChE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAEnD,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAEhC,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,QAAQ;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACH,UAAU;QACT,MAAM,MAAM,GAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;SACxC;QAED,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,GAAG,CAAC,MAAuB;QAC1B,OAAO,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClE,CAAC;IAED;;;;;OAKG;IACH,IAAI,CAAC,MAAuB;QAC3B,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACK,cAAc,CAAC,MAAuB;QAC7C,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACrB,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,kBAAkB,IAAI,MAAM,EAAE,CAAC,CAAC;SACxD;QAED,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;OAIG;IACK,eAAe,CAAC,MAAuB;QAC9C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACtB,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,kBAAkB,IAAI,MAAM,EAAE,CAAC,CAAC;SACxD;QAED,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACH,GAAG,CAAC,MAAc,EAAE,QAAW;QAC9B,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAE7B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC;QAE/B,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,WAAW;QAClB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE;YAC9B,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,OAAO,KAAK,KAAK,EAAE;gBACtB,MAAM;aACN;SACD;IACF,CAAC;IAED;;;;;OAKG;IACH,eAAe,CAAC,WAAW;QAC1B,IAAI,GAAG,CAAC;QACR,IAAI,OAAO,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACjD,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7C,IAAI,OAAO,KAAK,KAAK,EAAE;gBACtB,MAAM;aACN;SACD;IACF,CAAC;IAED;;OAEG;IACH,QAAQ;QACP,MAAM,MAAM,GAAG,EAAE,CAAC;QAElB,gBAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,IAAI,EAAE,GAAG;YACtC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACpB,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,OAAO;QACN,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,IAAI;QACH,OAAO;YACN,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACjC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;SACnB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK;QACJ,IAAI,gBAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YAC3B,OAAO,IAAI,CAAC;SACZ;QAED,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAE1B,uEAAuE;QACvE,uBAAuB;QAEvB,gBAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE;YAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACH,KAAK;QACJ,MAAM,MAAM,GAAG,IAAI,UAAU,CAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,aAA4B;QAChC,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC;QAEhC,gBAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YACzB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;CACD;AA5ZD,gCA4ZC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n/ eslint accessor-pairs: [2, { \"getWithoutSet\": false }] /\n/\n @fileoverview Collection class definition\n /\nimport _ from \"lodash\";\n\nconst MSGS = {\n\tTYPE_MISMATCH: \"Type does not match this collection type\",\n\tKEY_ALREADY_EXISTS: \"Collection key already exists. \",\n\tKEY_DOES_NOT_EXIST: \"Collection key does not exist in this collection.\",\n\tMUST_GIVE_KEY: \"Collection missing key.\",\n\tMUST_GIVE_VALUE: \"Collection missing value.\",\n\tKEY_NOT_VALID: \"Key must be of type String or Number\",\n};\n\nexport class Collection<T> {\n\tprotected _items: { [key: string]: T } = {};\n\tprotected _order: (string \| number)[] = [];\n\n\t/\n\t @param _name - a friendly name to describe this collection. If undefined\n\t * the collection will have a default \"Untitled Collection\" assigned to its name.\n\t * @param _type - optional parameter pointing to the constructor\n\t * of a type this Collection will host.\n\t /\n\tconstructor(protected _name = \"Untitled Collection\", protected _type?: new () => any) {}\n\n\t// Pass-thru binding handles\n\tonAdd(in_key, in_value) {}\n\tonRemove(in_key, in_value) {}\n\tonClear(in_items) {}\n\n\tpublic get items() {\n\t\treturn this._items;\n\t}\n\n\tpublic get keys() {\n\t\treturn Object.keys(this._items);\n\t}\n\n\t/\n\t @param in_key - Key to store the value under\n\t * @param in_value - Value to store in the collection\n\t * @returns Return the value passed in\n\t /\n\tadd(in_key: number \| string, in_value: T): T {\n\t\tthis._checkType(in_value);\n\t\tthis._checkIsNewKey(in_key);\n\n\t\tthis._items[in_key] = in_value;\n\t\tthis._order.push(in_key);\n\n\t\tthis.onAdd(in_key, in_value);\n\n\t\treturn in_value;\n\t}\n\n\t/\n\t Checks if in_value's type is equal to this Collection type. If this collection\n\t * has no type set, the check will pass.\n\t \n\t @param in_value - A value that is equal to the type managed by this collection.\n\t * @returns Return true if the type is a valid type for this\n\t * collection, throw otherwise.\n\t /\n\tprivate _checkType(in_value: T) {\n\t\tif (this._type && !(in_value instanceof this._type)) {\n\t\t\tthrow new Error(MSGS.TYPE_MISMATCH);\n\t\t} else {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\t/\n\t Bulk add items.\n\t * @param in_items - List of key-value pairs to be stored in the collection\n\t * @returns this collection after add\n\t /\n\tbulkAdd(in_items: { [key: string]: T }) {\n\t\t_.each(in_items, (item, key) => {\n\t\t\tthis.add(key, item);\n\t\t});\n\t\treturn this;\n\t}\n\n\t/\n\t Bulk remove items.\n\t * @param in_items - List of key-value items to be removed\n\t * @returns this collection after add\n\t /\n\tbulkRemove(in_items: { [key: string]: T }) {\n\t\t_.each(in_items, (item, key) => {\n\t\t\tthis.remove(key);\n\t\t});\n\n\t\treturn this;\n\t}\n\n\t/\n\t Test if this collection is empty\n\t * @returns true if empty, false otherwise\n\t * /\n\tisEmpty() {\n\t\treturn _.isEmpty(this._items);\n\t}\n\n\t/\n\t Return the first item in the collection, null if empty\n\t * @returns first item, or undefined if empty\n\t * /\n\tgetFirstItem(): T \| undefined {\n\t\tconst index = _.first(this._order);\n\t\treturn index === undefined ? index : this._items[index];\n\t}\n\n\t/\n\t Return the last item in the collection, null if empty\n\t * @returns - last item, or undefined if empty\n\t * /\n\tgetLastItem(): T \| undefined {\n\t\tconst index = _.last(this._order);\n\t\treturn index === undefined ? index : this._items[index];\n\t}\n\n\t/\n\t @returns Returns the type of collection (Array, etc.)\n\t /\n\tgetType() {\n\t\treturn this._type;\n\t}\n\n\t/\n\t @returns Returns the name of the collection\n\t /\n\tgetName(): string {\n\t\treturn this._name;\n\t}\n\n\t/\n\t Filter out by function\n\t * @param in_filterFunction - with arguments key and item\n\t * @returns A new filtered collection\n\t /\n\tfilter(in_filterFunction: (key: string, item: T) => boolean): Collection<T> {\n\t\tconst rtn = new Collection<T>();\n\n\t\tconst filterCb = function (in_key, in_item) {\n\t\t\tconst keeper = in_filterFunction(in_key, in_item);\n\t\t\tif (keeper) {\n\t\t\t\trtn.add(in_key, in_item);\n\t\t\t}\n\t\t};\n\n\t\tthis.iterate(filterCb);\n\n\t\treturn rtn;\n\t}\n\n\t/\n\t Filter out all keys NOT matching the in_filterKey\n\t * @param in_filterKey - a single key or an array of keys, if the\n\t * item matches any of the keys it will be filtered in.\n\t * @returns New filtered collection with all the items\n\t * matching at least one key.\n\t /\n\tfilterByKey(in_filterKey: string \| string[]): Collection<T> {\n\t\tconst rtn = new Collection<T>();\n\n\t\tconst filterCb = _.isArray(in_filterKey)\n\t\t\t? function (in_key, in_item) {\n\t\t\t\t\tif (in_filterKey.includes(in_key)) {\n\t\t\t\t\t\trtn.add(in_key, in_item);\n\t\t\t\t\t}\n\t\t\t }\n\t\t\t: function (in_key, in_item) {\n\t\t\t\t\tif (in_key === in_filterKey) {\n\t\t\t\t\t\trtn.add(in_key, in_item);\n\t\t\t\t\t}\n\t\t\t };\n\n\t\tthis.iterate(filterCb);\n\n\t\treturn rtn;\n\t}\n\n\t/\n\t Filter out all keys NOT matching the in_filterValue\n\t * @param in_filterValue - Value to filter on\n\t * @returns Return a filtered collection\n\t /\n\tfilterByValue(in_filterValue: T): Collection<T> {\n\t\tconst rtn = new Collection<T>();\n\n\t\tconst filterCb = function (in_key, in_item) {\n\t\t\tif (in_item === in_filterValue) {\n\t\t\t\trtn.add(in_key, in_item);\n\t\t\t}\n\t\t};\n\n\t\tthis.iterate(filterCb);\n\n\t\treturn rtn;\n\t}\n\n\t/\n\t Remove an item from this Collection. This method returns a Boolean indicating\n\t * the success or failure of the removal. This is practical because if we were\n\t * to throw an error when the key doesn't exist, it would require additional\n\t * checks by the caller to make sure this key exists prior to removal. Which\n\t * would make the attempt of removal more verbose and also costly because the\n\t * caller would have to keep a list – somewhere else – of the things he can\n\t * and cannot remove.\n\t \n\t @param in_key - the key we wish to remove\n\t * @returns true if the key exists and was removed, false otherwise.\n\t /\n\tremove(in_key: number \| string): boolean {\n\t\tif (!this.has(in_key)) {\n\t\t\treturn false;\n\t\t}\n\n\t\tconst remember = this._items[in_key];\n\n\t\t// eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n\t\tdelete this._items[in_key];\n\t\tthis._order.splice(this._order.indexOf(in_key), 1);\n\n\t\tthis.onRemove(in_key, remember);\n\n\t\treturn true;\n\t}\n\n\t/\n\t Return the number of items in this Collection\n\t * @returns the number of items in the collection\n\t /\n\tgetCount(): number {\n\t\treturn this._order.length;\n\t}\n\n\t/\n\t Returns this collection as an ordered Array\n\t * @returns Array including the values\n\t /\n\tgetAsArray() {\n\t\tconst rtnArr: T[] = new Array(this.getCount());\n\n\t\tfor (let i = 0; i < this._order.length; i++) {\n\t\t\trtnArr[i] = this._items[this._order[i]];\n\t\t}\n\n\t\treturn rtnArr;\n\t}\n\n\t/\n\t @param in_key - the key we are looking for\n\t * @returns true if the item exists\n\t /\n\thas(in_key: string \| number): boolean {\n\t\treturn Object.prototype.hasOwnProperty.call(this._items, in_key);\n\t}\n\n\t/\n\t Return an item associated with the given key\n\t * @param in_key - the key for the item in this\n\t * Collection\n\t * @returns The item\n\t /\n\titem(in_key: number \| string) {\n\t\treturn this._items[in_key];\n\t}\n\n\t/\n\t Checks if this is a new key in the collection. Throw if already exists.\n\t * @param in_key - The key to check against\n\t * @returns true if key is new\n\t /\n\tprivate _checkIsNewKey(in_key: number \| string) {\n\t\tif (this.has(in_key)) {\n\t\t\tthrow new Error(`${MSGS.KEY_ALREADY_EXISTS} ${in_key}`);\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t Checks if the key exists in the collection. Throw if not.\n\t * @param in_key - the key to check against\n\t * @returns true if key exists\n\t /\n\tprivate _checkKeyExists(in_key: number \| string) {\n\t\tif (!this.has(in_key)) {\n\t\t\tthrow new Error(`${MSGS.KEY_DOES_NOT_EXIST} ${in_key}`);\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t Set an existing key to a value. If key doesn't exist this call will throw\n\t * an error.\n\t * @param in_key - The key we want to modify\n\t * @param in_value - The value we are to set at this key\n\t * @returns The value passed in\n\t /\n\tset(in_key: string, in_value: T) {\n\t\tthis._checkKeyExists(in_key);\n\n\t\tthis._items[in_key] = in_value;\n\n\t\treturn in_value;\n\t}\n\n\t/\n\t Iterate over this collection and run the callback with passing the key and\n\t * item in the iteration loop.\n\t * @param in_callback - A function that we will call on each item\n\t * of this collection. If the callback returns false then the iteration will exit early.\n\t /\n\titerate(in_callback) {\n\t\tfor (const key of this._order) {\n\t\t\tconst continu = in_callback(key, this._items[key]);\n\t\t\tif (continu === false) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t Iterate over this collection starting from the tail and run the callback with passing the key and\n\t * item in the iteration loop.\n\t * @param in_callback - a function that we will call on each item\n\t * of this collection. If the callback returns false then the iteration will exit early.\n\t /\n\titerateFromTail(in_callback) {\n\t\tlet key;\n\t\tlet continu;\n\t\tfor (let i = this._order.length - 1; i >= 0; i--) {\n\t\t\tkey = this._order[i];\n\t\t\tcontinu = in_callback(key, this._items[key]);\n\t\t\tif (continu === false) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t @returns Return an object containing the items of this collection\n\t /\n\tgetItems(): { [key: string]: T } {\n\t\tconst result = {};\n\n\t\t_.each(this._items, function (item, key) {\n\t\t\tresult[key] = item;\n\t\t});\n\n\t\treturn result;\n\t}\n\n\t/\n\t Return the list of keys\n\t * @returns List of keys\n\t /\n\tgetKeys(): string[] {\n\t\treturn Object.keys(this._items);\n\t}\n\n\t/\n\t Method used to get the first element in the collection along with its key.\n\t /\n\tpeak() {\n\t\treturn {\n\t\t\titem: this._items[this._order[0]],\n\t\t\tkey: this._order[0],\n\t\t};\n\t}\n\n\t/\n\t Clear this collection\n\t * @returns this collection\n\t /\n\tclear() {\n\t\tif (_.isEmpty(this._items)) {\n\t\t\treturn this;\n\t\t}\n\n\t\tthis.onClear(this._items);\n\n\t\t// Best to just iterate through and remove everything, so that OnRemove\n\t\t// handlers are called.\n\n\t\t_.each(this.getKeys(), (key) => {\n\t\t\tthis.remove(key);\n\t\t});\n\n\t\treturn this;\n\t}\n\n\t/\n\t Copy the items of in_collection to this collection.\n\t * @param in_collection - the collection we want to\n\t * copy from.\n\t * @returns new Collection\n\t /\n\tclone(): Collection<T> {\n\t\tconst newCol = new Collection<T>(this._name, this._type);\n\t\tnewCol.bulkAdd(this._items);\n\t\treturn newCol;\n\t}\n\n\t/\n\t Copy the items of in_collection to this collection.\n\t * @param in_collection - the collection we want to\n\t * copy from.\n\t */\n\tcopy(in_collection: Collection<T>) {\n\t\tthis.clear();\n\t\tconst its = in_collection.items;\n\n\t\t_.each(its, (item, key) => {\n\t\t\tthis.add(key, item);\n\t\t});\n\t}\n\n\tget values() {\n\t\treturn this.getAsArray();\n\t}\n}\n"]}
1	+ {"version":3,"file":"collection.js","sourceRoot":"","sources":["../../src/datastructures/collection.ts"],"names":[],"mappings":";;;;;;AAAA;;;GAGG;AACH,4DAA4D;AAC5D;;GAEG;AACH,oDAAuB;AAEvB,MAAM,IAAI,GAAG;IACZ,aAAa,EAAE,0CAA0C;IACzD,kBAAkB,EAAE,iCAAiC;IACrD,kBAAkB,EAAE,mDAAmD;IACvE,aAAa,EAAE,yBAAyB;IACxC,eAAe,EAAE,2BAA2B;IAC5C,aAAa,EAAE,sCAAsC;CACrD,CAAC;AAEF,MAAa,UAAU;IAItB;;;;;OAKG;IACH,YAAsB,QAAQ,qBAAqB,EAAY,KAAqB;QAA9D,UAAK,GAAL,KAAK,CAAwB;QAAY,UAAK,GAAL,KAAK,CAAgB;QAT1E,WAAM,GAAyB,EAAE,CAAC;QAClC,WAAM,GAAwB,EAAE,CAAC;IAQ4C,CAAC;IAExF,4BAA4B;IAC5B,KAAK,CAAC,MAAM,EAAE,QAAQ,IAAG,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,QAAQ,IAAG,CAAC;IAC7B,OAAO,CAAC,QAAQ,IAAG,CAAC;IAEpB,IAAW,KAAK;QACf,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,IAAW,IAAI;QACd,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,MAAuB,EAAE,QAAW;QACvC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC1B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAE5B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEzB,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAE7B,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;;;;;;OAOG;IACK,UAAU,CAAC,QAAW;QAC7B,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,QAAQ,YAAY,IAAI,CAAC,KAAK,CAAC,EAAE;YACpD,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;SACpC;aAAM;YACN,OAAO,IAAI,CAAC;SACZ;IACF,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,QAA8B;QACrC,gBAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YAC9B,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,QAA8B;QACxC,gBAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;SAGK;IACL,OAAO;QACN,OAAO,gBAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;;SAGK;IACL,YAAY;QACX,MAAM,KAAK,GAAG,gBAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnC,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACzD,CAAC;IAED;;;SAGK;IACL,WAAW;QACV,MAAM,KAAK,GAAG,gBAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAClC,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACH,OAAO;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,OAAO;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,iBAAoD;QAC1D,MAAM,GAAG,GAAG,IAAI,UAAU,EAAK,CAAC;QAEhC,MAAM,QAAQ,GAAG,UAAU,MAAM,EAAE,OAAO;YACzC,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YAClD,IAAI,MAAM,EAAE;gBACX,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;aACzB;QACF,CAAC,CAAC;QAEF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAEvB,OAAO,GAAG,CAAC;IACZ,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,YAA+B;QAC1C,MAAM,GAAG,GAAG,IAAI,UAAU,EAAK,CAAC;QAEhC,MAAM,QAAQ,GAAG,gBAAC,CAAC,OAAO,CAAC,YAAY,CAAC;YACvC,CAAC,CAAC,UAAU,MAAM,EAAE,OAAO;gBACzB,IAAI,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;oBAClC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;iBACzB;YACD,CAAC;YACH,CAAC,CAAC,UAAU,MAAM,EAAE,OAAO;gBACzB,IAAI,MAAM,KAAK,YAAY,EAAE;oBAC5B,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;iBACzB;YACD,CAAC,CAAC;QAEL,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAEvB,OAAO,GAAG,CAAC;IACZ,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,cAAiB;QAC9B,MAAM,GAAG,GAAG,IAAI,UAAU,EAAK,CAAC;QAEhC,MAAM,QAAQ,GAAG,UAAU,MAAM,EAAE,OAAO;YACzC,IAAI,OAAO,KAAK,cAAc,EAAE;gBAC/B,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;aACzB;QACF,CAAC,CAAC;QAEF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAEvB,OAAO,GAAG,CAAC;IACZ,CAAC;IAED;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,MAAuB;QAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACtB,OAAO,KAAK,CAAC;SACb;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAErC,gEAAgE;QAChE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAEnD,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAEhC,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,QAAQ;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACH,UAAU;QACT,MAAM,MAAM,GAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;SACxC;QAED,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,GAAG,CAAC,MAAuB;QAC1B,OAAO,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClE,CAAC;IAED;;;;;OAKG;IACH,IAAI,CAAC,MAAuB;QAC3B,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACK,cAAc,CAAC,MAAuB;QAC7C,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACrB,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,kBAAkB,IAAI,MAAM,EAAE,CAAC,CAAC;SACxD;QAED,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;OAIG;IACK,eAAe,CAAC,MAAuB;QAC9C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACtB,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,kBAAkB,IAAI,MAAM,EAAE,CAAC,CAAC;SACxD;QAED,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACH,GAAG,CAAC,MAAc,EAAE,QAAW;QAC9B,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAE7B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC;QAE/B,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,WAAW;QAClB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE;YAC9B,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,OAAO,KAAK,KAAK,EAAE;gBACtB,MAAM;aACN;SACD;IACF,CAAC;IAED;;;;;OAKG;IACH,eAAe,CAAC,WAAW;QAC1B,IAAI,GAAG,CAAC;QACR,IAAI,OAAO,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACjD,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7C,IAAI,OAAO,KAAK,KAAK,EAAE;gBACtB,MAAM;aACN;SACD;IACF,CAAC;IAED;;OAEG;IACH,QAAQ;QACP,MAAM,MAAM,GAAG,EAAE,CAAC;QAElB,gBAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,IAAI,EAAE,GAAG;YACtC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACpB,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,OAAO;QACN,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,IAAI;QACH,OAAO;YACN,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACjC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;SACnB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK;QACJ,IAAI,gBAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YAC3B,OAAO,IAAI,CAAC;SACZ;QAED,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAE1B,uEAAuE;QACvE,uBAAuB;QAEvB,gBAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE;YAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACH,KAAK;QACJ,MAAM,MAAM,GAAG,IAAI,UAAU,CAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,aAA4B;QAChC,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC;QAEhC,gBAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YACzB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;CACD;AA5ZD,gCA4ZC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n/ eslint accessor-pairs: [2, { \"getWithoutSet\": false }] /\n/\n @fileoverview Collection class definition\n /\nimport _ from \"lodash\";\n\nconst MSGS = {\n\tTYPE_MISMATCH: \"Type does not match this collection type\",\n\tKEY_ALREADY_EXISTS: \"Collection key already exists. \",\n\tKEY_DOES_NOT_EXIST: \"Collection key does not exist in this collection.\",\n\tMUST_GIVE_KEY: \"Collection missing key.\",\n\tMUST_GIVE_VALUE: \"Collection missing value.\",\n\tKEY_NOT_VALID: \"Key must be of type String or Number\",\n};\n\nexport class Collection<T> {\n\tprotected _items: { [key: string]: T } = {};\n\tprotected _order: (string \| number)[] = [];\n\n\t/\n\t @param _name - a friendly name to describe this collection. If undefined\n\t * the collection will have a default \"Untitled Collection\" assigned to its name.\n\t * @param _type - optional parameter pointing to the constructor\n\t * of a type this Collection will host.\n\t /\n\tconstructor(protected _name = \"Untitled Collection\", protected _type?: new () => any) {}\n\n\t// Pass-thru binding handles\n\tonAdd(in_key, in_value) {}\n\tonRemove(in_key, in_value) {}\n\tonClear(in_items) {}\n\n\tpublic get items() {\n\t\treturn this._items;\n\t}\n\n\tpublic get keys() {\n\t\treturn Object.keys(this._items);\n\t}\n\n\t/\n\t @param in_key - Key to store the value under\n\t * @param in_value - Value to store in the collection\n\t * @returns Return the value passed in\n\t /\n\tadd(in_key: number \| string, in_value: T): T {\n\t\tthis._checkType(in_value);\n\t\tthis._checkIsNewKey(in_key);\n\n\t\tthis._items[in_key] = in_value;\n\t\tthis._order.push(in_key);\n\n\t\tthis.onAdd(in_key, in_value);\n\n\t\treturn in_value;\n\t}\n\n\t/\n\t Checks if in_value's type is equal to this Collection type. If this collection\n\t * has no type set, the check will pass.\n\t \n\t @param in_value - A value that is equal to the type managed by this collection.\n\t * @returns Return true if the type is a valid type for this\n\t * collection, throw otherwise.\n\t /\n\tprivate _checkType(in_value: T) {\n\t\tif (this._type && !(in_value instanceof this._type)) {\n\t\t\tthrow new Error(MSGS.TYPE_MISMATCH);\n\t\t} else {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\t/\n\t Bulk add items.\n\t * @param in_items - List of key-value pairs to be stored in the collection\n\t * @returns this collection after add\n\t /\n\tbulkAdd(in_items: { [key: string]: T }) {\n\t\t_.each(in_items, (item, key) => {\n\t\t\tthis.add(key, item);\n\t\t});\n\t\treturn this;\n\t}\n\n\t/\n\t Bulk remove items.\n\t * @param in_items - List of key-value items to be removed\n\t * @returns this collection after add\n\t /\n\tbulkRemove(in_items: { [key: string]: T }) {\n\t\t_.each(in_items, (item, key) => {\n\t\t\tthis.remove(key);\n\t\t});\n\n\t\treturn this;\n\t}\n\n\t/\n\t Test if this collection is empty\n\t * @returns true if empty, false otherwise\n\t * /\n\tisEmpty() {\n\t\treturn _.isEmpty(this._items);\n\t}\n\n\t/\n\t Return the first item in the collection, null if empty\n\t * @returns first item, or undefined if empty\n\t * /\n\tgetFirstItem(): T \| undefined {\n\t\tconst index = _.first(this._order);\n\t\treturn index === undefined ? index : this._items[index];\n\t}\n\n\t/\n\t Return the last item in the collection, undefined if empty\n\t * @returns The last item, or undefined if empty\n\t * /\n\tgetLastItem(): T \| undefined {\n\t\tconst index = _.last(this._order);\n\t\treturn index === undefined ? index : this._items[index];\n\t}\n\n\t/\n\t @returns Returns the type of collection (Array, etc.)\n\t /\n\tgetType() {\n\t\treturn this._type;\n\t}\n\n\t/\n\t @returns Returns the name of the collection\n\t /\n\tgetName(): string {\n\t\treturn this._name;\n\t}\n\n\t/\n\t Filter out by function\n\t * @param in_filterFunction - with arguments key and item\n\t * @returns A new filtered collection\n\t /\n\tfilter(in_filterFunction: (key: string, item: T) => boolean): Collection<T> {\n\t\tconst rtn = new Collection<T>();\n\n\t\tconst filterCb = function (in_key, in_item) {\n\t\t\tconst keeper = in_filterFunction(in_key, in_item);\n\t\t\tif (keeper) {\n\t\t\t\trtn.add(in_key, in_item);\n\t\t\t}\n\t\t};\n\n\t\tthis.iterate(filterCb);\n\n\t\treturn rtn;\n\t}\n\n\t/\n\t Filter out all keys NOT matching the in_filterKey\n\t * @param in_filterKey - a single key or an array of keys, if the\n\t * item matches any of the keys it will be filtered in.\n\t * @returns New filtered collection with all the items\n\t * matching at least one key.\n\t /\n\tfilterByKey(in_filterKey: string \| string[]): Collection<T> {\n\t\tconst rtn = new Collection<T>();\n\n\t\tconst filterCb = _.isArray(in_filterKey)\n\t\t\t? function (in_key, in_item) {\n\t\t\t\t\tif (in_filterKey.includes(in_key)) {\n\t\t\t\t\t\trtn.add(in_key, in_item);\n\t\t\t\t\t}\n\t\t\t }\n\t\t\t: function (in_key, in_item) {\n\t\t\t\t\tif (in_key === in_filterKey) {\n\t\t\t\t\t\trtn.add(in_key, in_item);\n\t\t\t\t\t}\n\t\t\t };\n\n\t\tthis.iterate(filterCb);\n\n\t\treturn rtn;\n\t}\n\n\t/\n\t Filter out all keys NOT matching the in_filterValue\n\t * @param in_filterValue - Value to filter on\n\t * @returns Return a filtered collection\n\t /\n\tfilterByValue(in_filterValue: T): Collection<T> {\n\t\tconst rtn = new Collection<T>();\n\n\t\tconst filterCb = function (in_key, in_item) {\n\t\t\tif (in_item === in_filterValue) {\n\t\t\t\trtn.add(in_key, in_item);\n\t\t\t}\n\t\t};\n\n\t\tthis.iterate(filterCb);\n\n\t\treturn rtn;\n\t}\n\n\t/\n\t Remove an item from this Collection. This method returns a Boolean indicating\n\t * the success or failure of the removal. This is practical because if we were\n\t * to throw an error when the key doesn't exist, it would require additional\n\t * checks by the caller to make sure this key exists prior to removal. Which\n\t * would make the attempt of removal more verbose and also costly because the\n\t * caller would have to keep a list – somewhere else – of the things he can\n\t * and cannot remove.\n\t \n\t @param in_key - the key we wish to remove\n\t * @returns true if the key exists and was removed, false otherwise.\n\t /\n\tremove(in_key: number \| string): boolean {\n\t\tif (!this.has(in_key)) {\n\t\t\treturn false;\n\t\t}\n\n\t\tconst remember = this._items[in_key];\n\n\t\t// eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n\t\tdelete this._items[in_key];\n\t\tthis._order.splice(this._order.indexOf(in_key), 1);\n\n\t\tthis.onRemove(in_key, remember);\n\n\t\treturn true;\n\t}\n\n\t/\n\t Return the number of items in this Collection\n\t * @returns the number of items in the collection\n\t /\n\tgetCount(): number {\n\t\treturn this._order.length;\n\t}\n\n\t/\n\t Returns this collection as an ordered Array\n\t * @returns Array including the values\n\t /\n\tgetAsArray() {\n\t\tconst rtnArr: T[] = new Array(this.getCount());\n\n\t\tfor (let i = 0; i < this._order.length; i++) {\n\t\t\trtnArr[i] = this._items[this._order[i]];\n\t\t}\n\n\t\treturn rtnArr;\n\t}\n\n\t/\n\t @param in_key - the key we are looking for\n\t * @returns true if the item exists\n\t /\n\thas(in_key: string \| number): boolean {\n\t\treturn Object.prototype.hasOwnProperty.call(this._items, in_key);\n\t}\n\n\t/\n\t Return an item associated with the given key\n\t * @param in_key - the key for the item in this\n\t * Collection\n\t * @returns The item\n\t /\n\titem(in_key: number \| string) {\n\t\treturn this._items[in_key];\n\t}\n\n\t/\n\t Checks if this is a new key in the collection. Throw if already exists.\n\t * @param in_key - The key to check against\n\t * @returns true if key is new\n\t /\n\tprivate _checkIsNewKey(in_key: number \| string) {\n\t\tif (this.has(in_key)) {\n\t\t\tthrow new Error(`${MSGS.KEY_ALREADY_EXISTS} ${in_key}`);\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t Checks if the key exists in the collection. Throw if not.\n\t * @param in_key - the key to check against\n\t * @returns true if key exists\n\t /\n\tprivate _checkKeyExists(in_key: number \| string) {\n\t\tif (!this.has(in_key)) {\n\t\t\tthrow new Error(`${MSGS.KEY_DOES_NOT_EXIST} ${in_key}`);\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t Set an existing key to a value. If key doesn't exist this call will throw\n\t * an error.\n\t * @param in_key - The key we want to modify\n\t * @param in_value - The value we are to set at this key\n\t * @returns The value passed in\n\t /\n\tset(in_key: string, in_value: T) {\n\t\tthis._checkKeyExists(in_key);\n\n\t\tthis._items[in_key] = in_value;\n\n\t\treturn in_value;\n\t}\n\n\t/\n\t Iterate over this collection and run the callback with passing the key and\n\t * item in the iteration loop.\n\t * @param in_callback - A function that we will call on each item\n\t * of this collection. If the callback returns false then the iteration will exit early.\n\t /\n\titerate(in_callback) {\n\t\tfor (const key of this._order) {\n\t\t\tconst continu = in_callback(key, this._items[key]);\n\t\t\tif (continu === false) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t Iterate over this collection starting from the tail and run the callback with passing the key and\n\t * item in the iteration loop.\n\t * @param in_callback - a function that we will call on each item\n\t * of this collection. If the callback returns false then the iteration will exit early.\n\t /\n\titerateFromTail(in_callback) {\n\t\tlet key;\n\t\tlet continu;\n\t\tfor (let i = this._order.length - 1; i >= 0; i--) {\n\t\t\tkey = this._order[i];\n\t\t\tcontinu = in_callback(key, this._items[key]);\n\t\t\tif (continu === false) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t @returns Return an object containing the items of this collection\n\t /\n\tgetItems(): { [key: string]: T } {\n\t\tconst result = {};\n\n\t\t_.each(this._items, function (item, key) {\n\t\t\tresult[key] = item;\n\t\t});\n\n\t\treturn result;\n\t}\n\n\t/\n\t Return the list of keys\n\t * @returns List of keys\n\t /\n\tgetKeys(): string[] {\n\t\treturn Object.keys(this._items);\n\t}\n\n\t/\n\t Method used to get the first element in the collection along with its key.\n\t /\n\tpeak() {\n\t\treturn {\n\t\t\titem: this._items[this._order[0]],\n\t\t\tkey: this._order[0],\n\t\t};\n\t}\n\n\t/\n\t Clear this collection\n\t * @returns this collection\n\t /\n\tclear() {\n\t\tif (_.isEmpty(this._items)) {\n\t\t\treturn this;\n\t\t}\n\n\t\tthis.onClear(this._items);\n\n\t\t// Best to just iterate through and remove everything, so that OnRemove\n\t\t// handlers are called.\n\n\t\t_.each(this.getKeys(), (key) => {\n\t\t\tthis.remove(key);\n\t\t});\n\n\t\treturn this;\n\t}\n\n\t/\n\t Copy the items of in_collection to this collection.\n\t * @param in_collection - the collection we want to\n\t * copy from.\n\t * @returns new Collection\n\t /\n\tclone(): Collection<T> {\n\t\tconst newCol = new Collection<T>(this._name, this._type);\n\t\tnewCol.bulkAdd(this._items);\n\t\treturn newCol;\n\t}\n\n\t/\n\t Copy the items of in_collection to this collection.\n\t * @param in_collection - the collection we want to\n\t * copy from.\n\t */\n\tcopy(in_collection: Collection<T>) {\n\t\tthis.clear();\n\t\tconst its = in_collection.items;\n\n\t\t_.each(its, (item, key) => {\n\t\t\tthis.add(key, item);\n\t\t});\n\t}\n\n\tget values() {\n\t\treturn this.getAsArray();\n\t}\n}\n"]}

package/dist/datastructures/dataArray.d.ts CHANGED Viewed

@@ -21,7 +21,7 @@ declare class BaseDataArray {
     constructor(bufferConstructor: any, size: number);
     /**
      * Get the value at an index. If no index is passed, return zeroth item.
-     * @param in_idx -  The specific item in the data array.
+     * @param in_idx - The specific item in the data array.
      * @returns The value at that index.
      */
     getValue(in_idx?: number): any;

package/dist/datastructures/dataArray.js CHANGED Viewed

@@ -30,7 +30,7 @@ class BaseDataArray {
     }
     /**
      * Get the value at an index. If no index is passed, return zeroth item.
-     * @param in_idx -  The specific item in the data array.
+     * @param in_idx - The specific item in the data array.
      * @returns The value at that index.
      */
     getValue(in_idx = 0) {

package/dist/datastructures/dataArray.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"dataArray.js","sourceRoot":"","sources":["../../src/datastructures/dataArray.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,wDAAwD;AACxD,4DAA4D;AAE5D;;GAEG;AAEH;;;GAGG;AACH,MAAM,aAAa;IAYlB,YAAY,CAAC,EAAE,CAAE;QAChB,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;YAC1B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACd,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;SAC9C;aAAM;YACN,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;SACd;QACD,6DAA6D;QAC7D,mDAAmD;QACnD,IAAI,CAAC,OAAO,GAAG,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,MAAM,GAAG,CAAC;QAClB,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE;YACtC,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;SACnD;QAED,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,WAAmB,EAAE,SAAiB;QACnD,IAAI,WAAW,IAAI,IAAI,CAAC,IAAI,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,IAAI,WAAW,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE;YAC1F,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;SACnD;QAED,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACtD,CAAC;IAED;;;OAGG;IACH,SAAS;QACR,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACxD,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,aAAa;QACxB,MAAM,MAAM,GAAG,aAAa,CAAC;QAC7B,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC;QACpC,IAAI,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE;YACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;SACnB;QACD,IAAI,CAAC,CAAC;QACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;SAC5B;IACF,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,MAAc,EAAE,QAAQ;QAChC,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YACjC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC;SAChC;aAAM;YACN,OAAO,CAAC,KAAK,CAAC,6CAA6C,CAAC,CAAC;SAC7D;IACF,CAAC;IAED;;;;;;OAMG;IACK,wBAAwB,CAAC,MAAM,EAAE,SAAiB,EAAE,cAAsB;QACjF,uCAAuC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,GAAG,cAAc,CAAC;QAC3C,MAAM,YAAY,GAAG,IAAI,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACrD,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QAChD,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,GAAG,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC;QACpF,OAAO,YAAY,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,cAAsB;QACpD,IAAI,SAAS,GAAG,cAAc,GAAI,IAAI,CAAC,OAAO,CAAC,MAAiB,GAAG,CAAC,EAAE;YACrE,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;YACtF,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,cAAc,CAAC;SACvC;aAAM;YACN,OAAO,CAAC,KAAK,CAAC,oEAAoE,CAAC,CAAC;SACpF;IACF,CAAC;IAED;;;;;;OAMG;IACK,OAAO,CAAC,MAAM,EAAE,SAAiB,EAAE,aAAa;QACvD,uCAAuC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,GAAI,aAAa,CAAC,MAAiB,CAAC;QAC7D,MAAM,aAAa,GAAG,IAAI,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACtD,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QACjD,aAAa,CAAC,GAAG,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;QAC5C,aAAa,CAAC,GAAG,CAChB,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,EACrC,SAAS,GAAI,aAAa,CAAC,MAAiB,CAC5C,CAAC;QACF,OAAO,aAAa,CAAC;IACtB,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,QAAQ;QACtC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC/D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAI,QAAQ,CAAC,MAAiB,CAAC;IACrD,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,SAAiB,EAAE,QAAQ;QAC9B,IACC,QAAQ,YAAY,WAAW;YAC/B,QAAQ,YAAY,KAAK;YACzB,QAAQ,YAAY,IAAI,CAAC,aAAa,EAAE,EACvC;YACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;SACtC;aAAM,IAAI,QAAQ,YAAY,aAAa,EAAE;YAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,SAAS,CAAC,CAAC;SAClD;aAAM;YACN,OAAO,CAAC,KAAK,CAAC,oEAAoE,CAAC,CAAC;SACpF;IACF,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,QAAQ;QACZ,iCAAiC;QACjC,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QACzC,IAAI,IAAI,CAAC,IAAI,GAAG,YAAY,GAAG,CAAC,EAAE;YACjC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,yBAAyB;SAC1D;QACD,gCAAgC;QAChC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,EAAE,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,SAAS;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,aAAa;QACZ,OAAO,IAAI,CAAC,iBAAiB,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,KAAK;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC3B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;SACvB;IACF,CAAC;IAED;;;;;;OAMG;IACK,YAAY,CAAC,aAAa,EAAE,SAAS,EAAE,UAAkB;QAChE,0CAA0C;QAC1C,6DAA6D;QAC7D,mDAAmD;QACnD,MAAM,SAAS,GAAG,IAAI,aAAa,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC;QACjC,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,OAAO,GAAG,UAAU,CAAC;QACzC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAC3E,OAAO,SAAS,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACO,MAAM,CAAC,IAAY;QAC5B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,iBAAiB,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC7E,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,IAAY;QAClB,wBAAwB;QACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,OAAO,IAAI,CAAC;IACb,CAAC;IAED,IAAI;QACH,YAAY;QACZ,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,mCAAmC;QAC5F,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5B,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,IAAI,CAAC;IAClB,CAAC;CACD;AAiSA,sCAAa;AA/Rd,MAAM,aAAc,SAAQ,aAAa;IACxC,YAAY,IAAY;QACvB,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC;CACD;AA8RA,sCAAa;AA5Rd,MAAM,cAAe,SAAQ,aAAa;IACzC,YAAY,IAAY;QACvB,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;CACD;AAyRA,wCAAc;AAvRf,MAAM,cAAe,SAAQ,aAAa;IACzC,YAAY,IAAY;QACvB,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;CACD;AAoRA,wCAAc;AAlRf,MAAM,cAAe,SAAQ,aAAa;IACzC,YAAY,IAAY;QACvB,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;CACD;AA+QA,wCAAc;AA7Qf,MAAM,eAAgB,SAAQ,aAAa;IAC1C,YAAY,IAAY;QACvB,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAC1B,CAAC;CACD;AA0QA,0CAAe;AAxQhB,MAAM,eAAgB,SAAQ,aAAa;IAC1C,YAAY,IAAY;QACvB,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAC1B,CAAC;CACD;AAqQA,0CAAe;AAnQhB,MAAM,gBAAiB,SAAQ,aAAa;IAC3C,YAAY,IAAY;QACvB,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IAC3B,CAAC;CACD;AAwPA,4CAAgB;AAtPjB,MAAM,gBAAiB,SAAQ,aAAa;IAC3C,YAAY,IAAY;QACvB,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IAC3B,CAAC;CACD;AAmPA,4CAAgB;AAjPjB;;;;GAIG;AACH,MAAM,kBAAmB,SAAQ,aAAa;IAG7C,YAAY,CAAE,EAAE,CAAE;QACjB,IAAI,CAAC,KAAK,SAAS,EAAE;YACpB,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;SAChB;aAAM;YACN,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACZ;IACF,CAAC;IAED;;;;;;OAMG;IACK,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC;QACzC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,CAAC,OAAO,CAAC,UAAU,KAAK;YAC7B,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC;YAC9B,KAAK,EAAE,CAAC;QACT,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,QAAe;QAC7C,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3E,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,cAAsB;QACpD,IAAI,SAAS,GAAG,cAAc,GAAI,IAAI,CAAC,OAAO,CAAC,MAAiB,GAAG,CAAC,EAAE;YACrE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;YAC/C,IAAI,CAAC,IAAI,IAAI,cAAc,CAAC;SAC5B;aAAM;YACN,MAAM,KAAK,CAAC,oEAAoE,CAAC,CAAC;SAClF;IACF,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,SAAiB,EAAE,QAAQ;QAC9B,IACC,QAAQ,YAAY,WAAW;YAC/B,QAAQ,YAAY,KAAK;YACzB,QAAQ,YAAY,IAAI,CAAC,aAAa,EAAE,EACvC;YACD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;SACjD;aAAM,IAAI,QAAQ,YAAY,aAAa,EAAE;YAC7C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,SAAS,EAAE,EAAE,SAAS,CAAC,CAAC;SAC7D;aAAM;YACN,OAAO,CAAC,KAAK,CAAC,oEAAoE,CAAC,CAAC;SACpF;IACF,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,WAAmB,EAAE,SAAiB;QACnD,IAAI,WAAW,IAAI,IAAI,CAAC,IAAI,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,IAAI,WAAW,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE;YAC1F,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;SACnD;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IAED;;;;;OAKG;IACK,iBAAiB,CAAC,SAAS,EAAE,UAAU;QAC9C,0CAA0C;QAC1C,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC;QACjC,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,OAAO,GAAG,UAAU,CAAC;QACzC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACnF,OAAO,SAAS,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACO,MAAM,CAAC,IAAY;QAC5B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC1D,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AAsIA,gDAAkB;AApInB;;GAEG;AACH,MAAM,eAAgB,SAAQ,aAAa;IAC1C;QACC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,SAAiB;QAC/C,IAAI,CAAC,OAAO,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CACpF,SAAS,CACT,EAAE,CAAC;QACJ,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC;IAC1C,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,cAAsB;QACpD,IAAI,SAAS,GAAG,cAAc,GAAI,IAAI,CAAC,OAAO,CAAC,MAAiB,GAAG,CAAC,EAAE;YACrE,IAAI,CAAC,OAAO,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CACxE,SAAS,GAAG,cAAc,CAC1B,EAAE,CAAC;YACJ,IAAI,CAAC,IAAI,IAAI,cAAc,CAAC;SAC5B;aAAM;YACN,MAAM,KAAK,CAAC,oEAAoE,CAAC,CAAC;SAClF;IACF,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,SAAiB,EAAE,SAAiB;QACvC,IAAI,CAAC,OAAO,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CACpF,SAAS,GAAG,SAAS,CAAC,MAAM,CAC5B,EAAE,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,WAAmB,EAAE,SAAiB;QACnD,IAAI,WAAW,IAAI,IAAI,CAAC,IAAI,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,IAAI,WAAW,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE;YAC1F,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;SACnD;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IAED,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC5B,CAAC;CACD;AAqEA,0CAAe;AAnEhB;;GAEG;AACH,MAAM,aAAc,SAAQ,kBAAkB;IAC7C;;OAEG;IACH,YAAY,IAAY;QACvB,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACK,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC;QAC7C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,CAAC,OAAO,CAAC,UAAU,KAAK;YAC7B,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAE,KAAiB,CAAC;YAC7C,KAAK,EAAE,CAAC;QACT,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,QAAe;QAC7C,MAAM,SAAS,GAAU,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAE,GAAe,CAAC,CAAC;QACnE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAC5E,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,SAAiB,EAAE,QAAQ;QAC9B,IACC,QAAQ,YAAY,WAAW;YAC/B,QAAQ,YAAY,KAAK;YACzB,QAAQ,YAAY,IAAI,CAAC,aAAa,EAAE,EACvC;YACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;SACrD;aAAM,IAAI,QAAQ,YAAY,aAAa,EAAE;YAC7C,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,SAAS,EAAE,EAAE,SAAS,CAAC,CAAC;SACjE;aAAM;YACN,OAAO,CAAC,KAAK,CAAC,oEAAoE,CAAC,CAAC;SACpF;IACF,CAAC;CACD;AAcA,sCAAa","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\n/ eslint-disable @typescript-eslint/no-unsafe-return /\n/ eslint accessor-pairs: [2, { \"getWithoutSet\": false }] /\n\n/\n The data arrays definition file.\n /\n\n/\n A typed data container that is persistable, high-performance, and can be used\n * as a backing store for collaborative property sets.\n /\nclass BaseDataArray {\n\tprotected _buffer: any;\n\tprivate readonly bufferConstructor;\n\tprotected size: number;\n\n\tconstructor(size: number);\n\n\t/\n\t @param bufferConstructor - This is the constructor to be used to setup the internal buffer of the DataArray.\n\t * @param size - The initial size with which to allocate the array.\n\t /\n\tconstructor(bufferConstructor: any, size: number);\n\tconstructor(a, b?) {\n\t\tif (typeof a === \"number\") {\n\t\t\tthis.size = a;\n\t\t\tthis.bufferConstructor = this.getBufferCtor();\n\t\t} else {\n\t\t\tthis.bufferConstructor = a;\n\t\t\tthis.size = b;\n\t\t}\n\t\t// The 'eslint-...' is used to disable the rule that requires\n\t\t// constructors to start with a capitalized letter.\n\t\tthis._buffer = new this.bufferConstructor(this.size);\n\t}\n\n\t/\n\t Get the value at an index. If no index is passed, return zeroth item.\n\t * @param in_idx - The specific item in the data array.\n\t * @returns The value at that index.\n\t /\n\tgetValue(in_idx = 0): any {\n\t\tif (in_idx >= this.size \|\| in_idx < 0) {\n\t\t\tthrow new Error(\"Trying to access out of bounds!\");\n\t\t}\n\n\t\treturn this._buffer[in_idx];\n\t}\n\n\t/\n\t Return a range of values in the array.\n\t * @param in_idxStart - the starting index\n\t * @param in_idxEnd - the end index\n\t * @returns the array of values in the range\n\t /\n\tgetValueRange(in_idxStart: number, in_idxEnd: number) {\n\t\tif (in_idxStart >= this.size \|\| in_idxEnd > this.size \|\| in_idxStart < 0 \|\| in_idxEnd < 0) {\n\t\t\tthrow new Error(\"Trying to access out of bounds!\");\n\t\t}\n\n\t\treturn this._buffer.subarray(in_idxStart, in_idxEnd);\n\t}\n\n\t/\n\t Return the serialized form of Data Arrays.\n\t * @returns An object containing an array of the values.\n\t /\n\tserialize(): number[] {\n\t\treturn Array.from(this._buffer.subarray(0, this.size));\n\t}\n\n\t/\n\t Deserialize data from a serialized representation\n\t * @param in_serialized - the serialized representation\n\t /\n\tdeserialize(in_serialized) {\n\t\tconst values = in_serialized;\n\t\tconst length = in_serialized.length;\n\t\tif (length !== this.size) {\n\t\t\tthis.resize(length);\n\t\t\tthis.size = length;\n\t\t}\n\t\tlet i;\n\t\tfor (i = 0; i < length; i++) {\n\t\t\tthis._buffer[i] = values[i];\n\t\t}\n\t}\n\n\t/\n\t Set value at an index.\n\t * @param in_idx - the index\n\t * @param in_value - the value we want to set at index\n\t /\n\tsetValue(in_idx: number, in_value) {\n\t\tif (in_idx < this._buffer.length) {\n\t\t\tthis._buffer[in_idx] = in_value;\n\t\t} else {\n\t\t\tconsole.error(\"DataArray setValue in_idx is out of bounds.\");\n\t\t}\n\t}\n\n\t/\n\t creates a copy of a typed array with removed elements\n\t * @param in_arr - the input array (won't be modified)\n\t * @param in_offset - starting index of range that will be removed\n\t * @param in_deleteCount - number of removed elements\n\t * @returns a copy of the input array without the selected range\n\t /\n\tprivate _removeElementsFromArray(in_arr, in_offset: number, in_deleteCount: number) {\n\t\t// TODO: this function can be optimized\n\t\tconst newSize = this.size - in_deleteCount;\n\t\tconst splicedArray = new in_arr.constructor(newSize);\n\t\tsplicedArray.set(in_arr.subarray(0, in_offset));\n\t\tsplicedArray.set(in_arr.subarray(in_offset + in_deleteCount, this.size), in_offset);\n\t\treturn splicedArray;\n\t}\n\n\t/\n\t remove a range of elements from the array\n\t * @param in_offset - start of the range\n\t * @param in_deleteCount - number of elements to be removed\n\t /\n\tremoveRange(in_offset: number, in_deleteCount: number) {\n\t\tif (in_offset + in_deleteCount < (this._buffer.length as number) + 1) {\n\t\t\tthis._buffer = this._removeElementsFromArray(this._buffer, in_offset, in_deleteCount);\n\t\t\tthis.size = this.size - in_deleteCount;\n\t\t} else {\n\t\t\tconsole.error(\"DataArray removeRange in_offset + in_deleteCount is out of bounds.\");\n\t\t}\n\t}\n\n\t/\n\t copy an array with elements inserted into the copy\n\t * @param in_arr - the input array (won't be modified)\n\t * @param in_offset - the index where the new elements will be inserted\n\t * @param in_addedArray - the array with the elements that will be added\n\t * @returns the combined array\n\t /\n\tprivate _insert(in_arr, in_offset: number, in_addedArray) {\n\t\t// TODO: this function can be optimized\n\t\tconst newSize = this.size + (in_addedArray.length as number);\n\t\tconst insertedArray = new in_arr.constructor(newSize);\n\t\tinsertedArray.set(in_arr.subarray(0, in_offset));\n\t\tinsertedArray.set(in_addedArray, in_offset);\n\t\tinsertedArray.set(\n\t\t\tin_arr.subarray(in_offset, this.size),\n\t\t\tin_offset + (in_addedArray.length as number),\n\t\t);\n\t\treturn insertedArray;\n\t}\n\n\t/\n\t insert the content of an array into the DataArray\n\t * @param in_offset - the target index\n\t * @param in_array - the array to be inserted\n\t /\n\tinsertRange(in_offset: number, in_array) {\n\t\tthis._buffer = this._insert(this._buffer, in_offset, in_array);\n\t\tthis.size = this.size + (in_array.length as number);\n\t}\n\n\t/\n\t Set this array values to be equal to in_array values.\n\t * @param in_offset - An optional offset in this array to begin start setting this arrays values to in_array values.\n\t * @param in_array - The input array.\n\t /\n\tset(in_offset: number, in_array) {\n\t\tif (\n\t\t\tin_array instanceof ArrayBuffer \|\|\n\t\t\tin_array instanceof Array \|\|\n\t\t\tin_array instanceof this.getBufferCtor()\n\t\t) {\n\t\t\tthis._buffer.set(in_array, in_offset);\n\t\t} else if (in_array instanceof BaseDataArray) {\n\t\t\tthis._buffer.set(in_array.getBuffer(), in_offset);\n\t\t} else {\n\t\t\tconsole.error(\"DataArray set() must be called with Array, TypedArray or DataArray\");\n\t\t}\n\t}\n\n\t/\n\t Insert a value at the end of the array, creates a new element at the end and sets the value.\n\t * @param in_value - The new value.\n\t /\n\tpush(in_value) {\n\t\t// Adjust the buffer if necessary\n\t\tconst bufferLength = this._buffer.length;\n\t\tif (this.size > bufferLength - 1) {\n\t\t\tthis._alloc(this.size 2 \|\| 1); // grow by a factor of 2x\n\t\t}\n\t\t// set the value and update size\n\t\tthis.setValue(this.size, in_value);\n\t\tthis.size++;\n\t}\n\n\t/*\n\t Get direct access to the data (for performance reasons) this should be uses read only.\n\t * @returns The (read only) raw data.\n\t /\n\tgetBuffer() {\n\t\treturn this._buffer;\n\t}\n\n\t/\n\t Get the constructor of the underlying `TypedArray`.\n\t * @returns The constructor for the data buffer.\n\t /\n\tgetBufferCtor() {\n\t\treturn this.bufferConstructor;\n\t}\n\n\t/\n\t Apply a given function to all elements of the array.\n\t * @param in_fn - The function that will be applied to every element.\n\t /\n\titerate(in_fn) {\n\t\tconst l = this.size;\n\t\tfor (let i = 0; i < l; i++) {\n\t\t\tin_fn(this._buffer[i]);\n\t\t}\n\t}\n\n\t/\n\t Tet a resized buffer copy.\n\t * @param in_bufferCtor - The constructor for the returned buffer.\n\t * @param in_buffer - The input buffer (won't be modified).\n\t * @param in_newSize - The target size.\n\t * @returns The buffer with the new size.\n\t /\n\tprivate resizeBuffer(in_bufferCtor, in_buffer, in_newSize: number) {\n\t\t// target buffer with the desired new size\n\t\t// The 'eslint-...' is used to disable the rule that requires\n\t\t// constructors to start with a capitalized letter.\n\t\tconst newBuffer = new in_bufferCtor(in_newSize);\n\t\tconst oldSize = in_buffer.length;\n\t\tconst oldBuffer = in_buffer;\n\t\tconst isShrinking = oldSize > in_newSize;\n\t\tnewBuffer.set(isShrinking ? oldBuffer.subarray(0, in_newSize) : oldBuffer);\n\t\treturn newBuffer;\n\t}\n\n\t/\n\t Allocate memory for the array (for performance reasons, you can allocate more space than the current length,\n\t * which makes pushes to the array less expensive later).\n\t * @param size - The target allocated space.\n\t * @returns The DataArray itself.\n\t /\n\tprotected _alloc(size: number): any {\n\t\tthis._buffer = this.resizeBuffer(this.bufferConstructor, this._buffer, size);\n\t\treturn this;\n\t}\n\n\t/\n\t Change the size of the array\n\t * @param size - The target size\n\t * @returns The DataArray itself\n\t /\n\tresize(size: number) {\n\t\t// this can be costly!!!\n\t\tthis._alloc(size);\n\t\tthis.size = size;\n\t\treturn this;\n\t}\n\n\tcopy() {\n\t\t// and this!\n\t\tconst newBuffer = new this.bufferConstructor(this.size); // buffer with the desired new size\n\t\tnewBuffer.set(this._buffer);\n\t\treturn newBuffer;\n\t}\n\n\tget length() {\n\t\treturn this.size;\n\t}\n}\n\nclass Int8DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Int8Array, size);\n\t}\n}\n\nclass Int16DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Int16Array, size);\n\t}\n}\n\nclass Int32DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Int32Array, size);\n\t}\n}\n\nclass Uint8DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Uint8Array, size);\n\t}\n}\n\nclass Uint16DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Uint16Array, size);\n\t}\n}\n\nclass Uint32DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Uint32Array, size);\n\t}\n}\n\nclass Float32DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Float32Array, size);\n\t}\n}\n\nclass Float64DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Float64Array, size);\n\t}\n}\n\n/\n A data container that can contain every native type\n \n @param size - The initial size with which to allocate the array.\n /\nclass UniversalDataArray extends BaseDataArray {\n\tconstructor(bufferConstructor: any, size: number);\n\tconstructor(size: number);\n\tconstructor(a?, b?) {\n\t\tif (b === undefined) {\n\t\t\tsuper(Array, a);\n\t\t} else {\n\t\t\tsuper(a, b);\n\t\t}\n\t}\n\n\t/\n\t Helper function to write array values into another array at a given offset.\n\t \n\t @param array - The target array.\n\t * @param values - The values we need to write.\n\t * @param offset - The starting index in target array.\n\t /\n\tprivate arraySet(array, values, offset = 0) {\n\t\tlet index = 0;\n\t\tvalues.forEach(function (value) {\n\t\t\tarray[index + offset] = value;\n\t\t\tindex++;\n\t\t});\n\t}\n\n\t/\n\t Insert the content of an array into the DataArray.\n\t * @param in_offset - The target index.\n\t * @param in_array - The array to be inserted.\n\t /\n\tinsertRange(in_offset: number, in_array: any[]) {\n\t\tthis._buffer.splice.call(this._buffer, ...[in_offset, 0].concat(in_array));\n\t\tthis.size = this.size + in_array.length;\n\t}\n\n\t/\n\t Eemove a range of elements from the array.\n\t * @param in_offset - The start of the range.\n\t * @param in_deleteCount - The number of elements to be removed.\n\t /\n\tremoveRange(in_offset: number, in_deleteCount: number) {\n\t\tif (in_offset + in_deleteCount < (this._buffer.length as number) + 1) {\n\t\t\tthis._buffer.splice(in_offset, in_deleteCount);\n\t\t\tthis.size -= in_deleteCount;\n\t\t} else {\n\t\t\tthrow Error(\"DataArray removeRange in_offset + in_deleteCount is out of bounds.\");\n\t\t}\n\t}\n\n\t/\n\t Set this array values to be equal to in_array values.\n\t * @param in_offset - An optional offset in this array to begin start\n\t * setting this arrays values to in_array values.\n\t * @param in_array - The input array.\n\t /\n\tset(in_offset: number, in_array) {\n\t\tif (\n\t\t\tin_array instanceof ArrayBuffer \|\|\n\t\t\tin_array instanceof Array \|\|\n\t\t\tin_array instanceof this.getBufferCtor()\n\t\t) {\n\t\t\tthis.arraySet(this._buffer, in_array, in_offset);\n\t\t} else if (in_array instanceof BaseDataArray) {\n\t\t\tthis.arraySet(this._buffer, in_array.getBuffer(), in_offset);\n\t\t} else {\n\t\t\tconsole.error(\"DataArray set() must be called with Array, TypedArray or DataArray\");\n\t\t}\n\t}\n\n\t/\n\t Return a range of values in the array.\n\t * @param in_idxStart - the starting index\n\t * @param in_idxEnd - the end index - this offset is exclusive\n\t * @returns the array of values in the range\n\t /\n\tgetValueRange(in_idxStart: number, in_idxEnd: number) {\n\t\tif (in_idxStart >= this.size \|\| in_idxEnd > this.size \|\| in_idxStart < 0 \|\| in_idxEnd < 0) {\n\t\t\tthrow new Error(\"Trying to access out of bounds!\");\n\t\t}\n\t\treturn this._buffer.slice(in_idxStart, in_idxEnd);\n\t}\n\n\t/\n\t change the size of a javascript array and keep the content, if possible. Keeps the input buffer.\n\t * @param in_buffer - input buffer - not changed\n\t * @param in_newSize - target size\n\t * @returns an Array of the new size\n\t /\n\tprivate resizeBufferArray(in_buffer, in_newSize) {\n\t\t// target buffer with the desired new size\n\t\tconst newBuffer = new Array(in_newSize);\n\t\tconst oldSize = in_buffer.length;\n\t\tconst oldBuffer = in_buffer;\n\t\tconst isShrinking = oldSize > in_newSize;\n\t\tthis.arraySet(newBuffer, isShrinking ? oldBuffer.slice(0, in_newSize) : oldBuffer);\n\t\treturn newBuffer;\n\t}\n\n\t/\n\t allocate memory for the array (for performance reasons, you can allocate more space than the current length,\n\t * which makes pushes to the array less expensive later)\n\t * @param size - the target allocated space\n\t * @returns the DataArray itself\n\t /\n\tprotected _alloc(size: number): any {\n\t\tthis._buffer = this.resizeBufferArray(this._buffer, size);\n\t\treturn this;\n\t}\n}\n\n/\n A data container that contains a string\n /\nclass StringDataArray extends BaseDataArray {\n\tconstructor() {\n\t\tsuper(String, 0);\n\t\tthis.size = 0;\n\t\tthis._buffer = \"\";\n\t}\n\t/\n\t insert the content of a string into the StringDataArray\n\t * @param in_offset - the target index\n\t * @param in_string - the string to be inserted\n\t /\n\tinsertRange(in_offset: number, in_string: string) {\n\t\tthis._buffer = `${this._buffer.substr(0, in_offset)}${in_string}${this._buffer.substr(\n\t\t\tin_offset,\n\t\t)}`;\n\t\tthis.size = this.size + in_string.length;\n\t}\n\n\t/\n\t remove a range of elements from the string\n\t * @param in_offset - start of the range\n\t * @param in_deleteCount - number of elements to be removed\n\t /\n\tremoveRange(in_offset: number, in_deleteCount: number) {\n\t\tif (in_offset + in_deleteCount < (this._buffer.length as number) + 1) {\n\t\t\tthis._buffer = `${this._buffer.substr(0, in_offset)}${this._buffer.substr(\n\t\t\t\tin_offset + in_deleteCount,\n\t\t\t)}`;\n\t\t\tthis.size -= in_deleteCount;\n\t\t} else {\n\t\t\tthrow Error(\"DataArray removeRange in_offset + in_deleteCount is out of bounds.\");\n\t\t}\n\t}\n\n\t/\n\t Set this array values to be equal to in_string values.\n\t * @param in_offset - The offset in this array to begin start setting this arrays values to in_string values.\n\t * @param in_string - The input string.\n\t /\n\tset(in_offset: number, in_string: string) {\n\t\tthis._buffer = `${this._buffer.substr(0, in_offset)}${in_string}${this._buffer.substr(\n\t\t\tin_offset + in_string.length,\n\t\t)}`;\n\t}\n\n\t/\n\t Return a range of characters in the string.\n\t * @param in_idxStart - the starting index\n\t * @param in_idxEnd - the end index - this offset is exclusive\n\t * @returns the characters in the range\n\t /\n\tgetValueRange(in_idxStart: number, in_idxEnd: number): string {\n\t\tif (in_idxStart >= this.size \|\| in_idxEnd > this.size \|\| in_idxStart < 0 \|\| in_idxEnd < 0) {\n\t\t\tthrow new Error(\"Trying to access out of bounds!\");\n\t\t}\n\t\treturn this._buffer.slice(in_idxStart, in_idxEnd);\n\t}\n\n\tget length() {\n\t\treturn this._buffer.length;\n\t}\n}\n\n/\n A data container that can contain boolean type\n /\nclass BoolDataArray extends UniversalDataArray {\n\t/\n\t @param size - The initial size with which to allocate the array.\n\t /\n\tconstructor(size: number) {\n\t\tsuper(Array, size);\n\t}\n\n\t/\n\t helper function to write and cast to boolean array values into another array at a given offset\n\t * @param array - target array\n\t * @param values - the values we need to write\n\t * @param offset - starting index in target array\n\t /\n\tprivate arraySetBool(array, values, offset = 0) {\n\t\tlet index = 0;\n\t\tvalues.forEach(function (value) {\n\t\t\tarray[index + offset] = !!(value as boolean);\n\t\t\tindex++;\n\t\t});\n\t}\n\n\t/\n\t insert the content of an array into the DataArray\n\t * @param in_offset - the target index\n\t * @param in_array - the array to be inserted\n\t /\n\tinsertRange(in_offset: number, in_array: any[]) {\n\t\tconst toBeAdded: any[] = in_array.map((val) => !!(val as boolean));\n\t\tthis._buffer.splice.call(this._buffer, ...[in_offset, 0].concat(toBeAdded));\n\t\tthis.size = this.size + in_array.length;\n\t}\n\n\t/\n\t Set this array values to be equal to in_array values.\n\t * @param in_offset - An optional offset in this array to begin start setting this arrays values to in_array values.\n\t * @param in_array - The input array.\n\t */\n\tset(in_offset: number, in_array) {\n\t\tif (\n\t\t\tin_array instanceof ArrayBuffer \|\|\n\t\t\tin_array instanceof Array \|\|\n\t\t\tin_array instanceof this.getBufferCtor()\n\t\t) {\n\t\t\tthis.arraySetBool(this._buffer, in_array, in_offset);\n\t\t} else if (in_array instanceof BaseDataArray) {\n\t\t\tthis.arraySetBool(this._buffer, in_array.getBuffer(), in_offset);\n\t\t} else {\n\t\t\tconsole.error(\"DataArray set() must be called with Array, TypedArray or DataArray\");\n\t\t}\n\t}\n}\n\nexport {\n\tBaseDataArray,\n\tFloat32DataArray,\n\tFloat64DataArray,\n\tInt8DataArray,\n\tInt16DataArray,\n\tInt32DataArray,\n\tUint8DataArray,\n\tUint16DataArray,\n\tUint32DataArray,\n\tUniversalDataArray,\n\tStringDataArray,\n\tBoolDataArray,\n};\n"]}
1	+ {"version":3,"file":"dataArray.js","sourceRoot":"","sources":["../../src/datastructures/dataArray.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,wDAAwD;AACxD,4DAA4D;AAE5D;;GAEG;AAEH;;;GAGG;AACH,MAAM,aAAa;IAYlB,YAAY,CAAC,EAAE,CAAE;QAChB,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;YAC1B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACd,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;SAC9C;aAAM;YACN,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;SACd;QACD,6DAA6D;QAC7D,mDAAmD;QACnD,IAAI,CAAC,OAAO,GAAG,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,MAAM,GAAG,CAAC;QAClB,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE;YACtC,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;SACnD;QAED,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,WAAmB,EAAE,SAAiB;QACnD,IAAI,WAAW,IAAI,IAAI,CAAC,IAAI,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,IAAI,WAAW,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE;YAC1F,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;SACnD;QAED,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACtD,CAAC;IAED;;;OAGG;IACH,SAAS;QACR,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACxD,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,aAAa;QACxB,MAAM,MAAM,GAAG,aAAa,CAAC;QAC7B,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC;QACpC,IAAI,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE;YACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;SACnB;QACD,IAAI,CAAC,CAAC;QACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;SAC5B;IACF,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,MAAc,EAAE,QAAQ;QAChC,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YACjC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC;SAChC;aAAM;YACN,OAAO,CAAC,KAAK,CAAC,6CAA6C,CAAC,CAAC;SAC7D;IACF,CAAC;IAED;;;;;;OAMG;IACK,wBAAwB,CAAC,MAAM,EAAE,SAAiB,EAAE,cAAsB;QACjF,uCAAuC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,GAAG,cAAc,CAAC;QAC3C,MAAM,YAAY,GAAG,IAAI,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACrD,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QAChD,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,GAAG,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC;QACpF,OAAO,YAAY,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,cAAsB;QACpD,IAAI,SAAS,GAAG,cAAc,GAAI,IAAI,CAAC,OAAO,CAAC,MAAiB,GAAG,CAAC,EAAE;YACrE,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;YACtF,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,cAAc,CAAC;SACvC;aAAM;YACN,OAAO,CAAC,KAAK,CAAC,oEAAoE,CAAC,CAAC;SACpF;IACF,CAAC;IAED;;;;;;OAMG;IACK,OAAO,CAAC,MAAM,EAAE,SAAiB,EAAE,aAAa;QACvD,uCAAuC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,GAAI,aAAa,CAAC,MAAiB,CAAC;QAC7D,MAAM,aAAa,GAAG,IAAI,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACtD,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QACjD,aAAa,CAAC,GAAG,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;QAC5C,aAAa,CAAC,GAAG,CAChB,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,EACrC,SAAS,GAAI,aAAa,CAAC,MAAiB,CAC5C,CAAC;QACF,OAAO,aAAa,CAAC;IACtB,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,QAAQ;QACtC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC/D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAI,QAAQ,CAAC,MAAiB,CAAC;IACrD,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,SAAiB,EAAE,QAAQ;QAC9B,IACC,QAAQ,YAAY,WAAW;YAC/B,QAAQ,YAAY,KAAK;YACzB,QAAQ,YAAY,IAAI,CAAC,aAAa,EAAE,EACvC;YACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;SACtC;aAAM,IAAI,QAAQ,YAAY,aAAa,EAAE;YAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,SAAS,CAAC,CAAC;SAClD;aAAM;YACN,OAAO,CAAC,KAAK,CAAC,oEAAoE,CAAC,CAAC;SACpF;IACF,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,QAAQ;QACZ,iCAAiC;QACjC,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QACzC,IAAI,IAAI,CAAC,IAAI,GAAG,YAAY,GAAG,CAAC,EAAE;YACjC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,yBAAyB;SAC1D;QACD,gCAAgC;QAChC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,EAAE,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,SAAS;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,aAAa;QACZ,OAAO,IAAI,CAAC,iBAAiB,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,KAAK;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC3B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;SACvB;IACF,CAAC;IAED;;;;;;OAMG;IACK,YAAY,CAAC,aAAa,EAAE,SAAS,EAAE,UAAkB;QAChE,0CAA0C;QAC1C,6DAA6D;QAC7D,mDAAmD;QACnD,MAAM,SAAS,GAAG,IAAI,aAAa,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC;QACjC,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,OAAO,GAAG,UAAU,CAAC;QACzC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAC3E,OAAO,SAAS,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACO,MAAM,CAAC,IAAY;QAC5B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,iBAAiB,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC7E,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,IAAY;QAClB,wBAAwB;QACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,OAAO,IAAI,CAAC;IACb,CAAC;IAED,IAAI;QACH,YAAY;QACZ,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,mCAAmC;QAC5F,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5B,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,IAAI,CAAC;IAClB,CAAC;CACD;AAiSA,sCAAa;AA/Rd,MAAM,aAAc,SAAQ,aAAa;IACxC,YAAY,IAAY;QACvB,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC;CACD;AA8RA,sCAAa;AA5Rd,MAAM,cAAe,SAAQ,aAAa;IACzC,YAAY,IAAY;QACvB,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;CACD;AAyRA,wCAAc;AAvRf,MAAM,cAAe,SAAQ,aAAa;IACzC,YAAY,IAAY;QACvB,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;CACD;AAoRA,wCAAc;AAlRf,MAAM,cAAe,SAAQ,aAAa;IACzC,YAAY,IAAY;QACvB,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;CACD;AA+QA,wCAAc;AA7Qf,MAAM,eAAgB,SAAQ,aAAa;IAC1C,YAAY,IAAY;QACvB,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAC1B,CAAC;CACD;AA0QA,0CAAe;AAxQhB,MAAM,eAAgB,SAAQ,aAAa;IAC1C,YAAY,IAAY;QACvB,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAC1B,CAAC;CACD;AAqQA,0CAAe;AAnQhB,MAAM,gBAAiB,SAAQ,aAAa;IAC3C,YAAY,IAAY;QACvB,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IAC3B,CAAC;CACD;AAwPA,4CAAgB;AAtPjB,MAAM,gBAAiB,SAAQ,aAAa;IAC3C,YAAY,IAAY;QACvB,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IAC3B,CAAC;CACD;AAmPA,4CAAgB;AAjPjB;;;;GAIG;AACH,MAAM,kBAAmB,SAAQ,aAAa;IAG7C,YAAY,CAAE,EAAE,CAAE;QACjB,IAAI,CAAC,KAAK,SAAS,EAAE;YACpB,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;SAChB;aAAM;YACN,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACZ;IACF,CAAC;IAED;;;;;;OAMG;IACK,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC;QACzC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,CAAC,OAAO,CAAC,UAAU,KAAK;YAC7B,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC;YAC9B,KAAK,EAAE,CAAC;QACT,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,QAAe;QAC7C,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3E,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,cAAsB;QACpD,IAAI,SAAS,GAAG,cAAc,GAAI,IAAI,CAAC,OAAO,CAAC,MAAiB,GAAG,CAAC,EAAE;YACrE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;YAC/C,IAAI,CAAC,IAAI,IAAI,cAAc,CAAC;SAC5B;aAAM;YACN,MAAM,KAAK,CAAC,oEAAoE,CAAC,CAAC;SAClF;IACF,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,SAAiB,EAAE,QAAQ;QAC9B,IACC,QAAQ,YAAY,WAAW;YAC/B,QAAQ,YAAY,KAAK;YACzB,QAAQ,YAAY,IAAI,CAAC,aAAa,EAAE,EACvC;YACD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;SACjD;aAAM,IAAI,QAAQ,YAAY,aAAa,EAAE;YAC7C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,SAAS,EAAE,EAAE,SAAS,CAAC,CAAC;SAC7D;aAAM;YACN,OAAO,CAAC,KAAK,CAAC,oEAAoE,CAAC,CAAC;SACpF;IACF,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,WAAmB,EAAE,SAAiB;QACnD,IAAI,WAAW,IAAI,IAAI,CAAC,IAAI,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,IAAI,WAAW,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE;YAC1F,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;SACnD;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IAED;;;;;OAKG;IACK,iBAAiB,CAAC,SAAS,EAAE,UAAU;QAC9C,0CAA0C;QAC1C,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC;QACjC,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,OAAO,GAAG,UAAU,CAAC;QACzC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACnF,OAAO,SAAS,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACO,MAAM,CAAC,IAAY;QAC5B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC1D,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AAsIA,gDAAkB;AApInB;;GAEG;AACH,MAAM,eAAgB,SAAQ,aAAa;IAC1C;QACC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,SAAiB;QAC/C,IAAI,CAAC,OAAO,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CACpF,SAAS,CACT,EAAE,CAAC;QACJ,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC;IAC1C,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,cAAsB;QACpD,IAAI,SAAS,GAAG,cAAc,GAAI,IAAI,CAAC,OAAO,CAAC,MAAiB,GAAG,CAAC,EAAE;YACrE,IAAI,CAAC,OAAO,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CACxE,SAAS,GAAG,cAAc,CAC1B,EAAE,CAAC;YACJ,IAAI,CAAC,IAAI,IAAI,cAAc,CAAC;SAC5B;aAAM;YACN,MAAM,KAAK,CAAC,oEAAoE,CAAC,CAAC;SAClF;IACF,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,SAAiB,EAAE,SAAiB;QACvC,IAAI,CAAC,OAAO,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CACpF,SAAS,GAAG,SAAS,CAAC,MAAM,CAC5B,EAAE,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,WAAmB,EAAE,SAAiB;QACnD,IAAI,WAAW,IAAI,IAAI,CAAC,IAAI,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,IAAI,WAAW,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE;YAC1F,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;SACnD;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IAED,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC5B,CAAC;CACD;AAqEA,0CAAe;AAnEhB;;GAEG;AACH,MAAM,aAAc,SAAQ,kBAAkB;IAC7C;;OAEG;IACH,YAAY,IAAY;QACvB,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACK,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC;QAC7C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,CAAC,OAAO,CAAC,UAAU,KAAK;YAC7B,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAE,KAAiB,CAAC;YAC7C,KAAK,EAAE,CAAC;QACT,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,SAAiB,EAAE,QAAe;QAC7C,MAAM,SAAS,GAAU,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAE,GAAe,CAAC,CAAC;QACnE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAC5E,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,SAAiB,EAAE,QAAQ;QAC9B,IACC,QAAQ,YAAY,WAAW;YAC/B,QAAQ,YAAY,KAAK;YACzB,QAAQ,YAAY,IAAI,CAAC,aAAa,EAAE,EACvC;YACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;SACrD;aAAM,IAAI,QAAQ,YAAY,aAAa,EAAE;YAC7C,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,SAAS,EAAE,EAAE,SAAS,CAAC,CAAC;SACjE;aAAM;YACN,OAAO,CAAC,KAAK,CAAC,oEAAoE,CAAC,CAAC;SACpF;IACF,CAAC;CACD;AAcA,sCAAa","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\n/ eslint-disable @typescript-eslint/no-unsafe-return /\n/ eslint accessor-pairs: [2, { \"getWithoutSet\": false }] /\n\n/\n The data arrays definition file.\n /\n\n/\n A typed data container that is persistable, high-performance, and can be used\n * as a backing store for collaborative property sets.\n /\nclass BaseDataArray {\n\tprotected _buffer: any;\n\tprivate readonly bufferConstructor;\n\tprotected size: number;\n\n\tconstructor(size: number);\n\n\t/\n\t @param bufferConstructor - This is the constructor to be used to setup the internal buffer of the DataArray.\n\t * @param size - The initial size with which to allocate the array.\n\t /\n\tconstructor(bufferConstructor: any, size: number);\n\tconstructor(a, b?) {\n\t\tif (typeof a === \"number\") {\n\t\t\tthis.size = a;\n\t\t\tthis.bufferConstructor = this.getBufferCtor();\n\t\t} else {\n\t\t\tthis.bufferConstructor = a;\n\t\t\tthis.size = b;\n\t\t}\n\t\t// The 'eslint-...' is used to disable the rule that requires\n\t\t// constructors to start with a capitalized letter.\n\t\tthis._buffer = new this.bufferConstructor(this.size);\n\t}\n\n\t/\n\t Get the value at an index. If no index is passed, return zeroth item.\n\t * @param in_idx - The specific item in the data array.\n\t * @returns The value at that index.\n\t /\n\tgetValue(in_idx = 0): any {\n\t\tif (in_idx >= this.size \|\| in_idx < 0) {\n\t\t\tthrow new Error(\"Trying to access out of bounds!\");\n\t\t}\n\n\t\treturn this._buffer[in_idx];\n\t}\n\n\t/\n\t Return a range of values in the array.\n\t * @param in_idxStart - the starting index\n\t * @param in_idxEnd - the end index\n\t * @returns the array of values in the range\n\t /\n\tgetValueRange(in_idxStart: number, in_idxEnd: number) {\n\t\tif (in_idxStart >= this.size \|\| in_idxEnd > this.size \|\| in_idxStart < 0 \|\| in_idxEnd < 0) {\n\t\t\tthrow new Error(\"Trying to access out of bounds!\");\n\t\t}\n\n\t\treturn this._buffer.subarray(in_idxStart, in_idxEnd);\n\t}\n\n\t/\n\t Return the serialized form of Data Arrays.\n\t * @returns An object containing an array of the values.\n\t /\n\tserialize(): number[] {\n\t\treturn Array.from(this._buffer.subarray(0, this.size));\n\t}\n\n\t/\n\t Deserialize data from a serialized representation\n\t * @param in_serialized - the serialized representation\n\t /\n\tdeserialize(in_serialized) {\n\t\tconst values = in_serialized;\n\t\tconst length = in_serialized.length;\n\t\tif (length !== this.size) {\n\t\t\tthis.resize(length);\n\t\t\tthis.size = length;\n\t\t}\n\t\tlet i;\n\t\tfor (i = 0; i < length; i++) {\n\t\t\tthis._buffer[i] = values[i];\n\t\t}\n\t}\n\n\t/\n\t Set value at an index.\n\t * @param in_idx - the index\n\t * @param in_value - the value we want to set at index\n\t /\n\tsetValue(in_idx: number, in_value) {\n\t\tif (in_idx < this._buffer.length) {\n\t\t\tthis._buffer[in_idx] = in_value;\n\t\t} else {\n\t\t\tconsole.error(\"DataArray setValue in_idx is out of bounds.\");\n\t\t}\n\t}\n\n\t/\n\t creates a copy of a typed array with removed elements\n\t * @param in_arr - the input array (won't be modified)\n\t * @param in_offset - starting index of range that will be removed\n\t * @param in_deleteCount - number of removed elements\n\t * @returns a copy of the input array without the selected range\n\t /\n\tprivate _removeElementsFromArray(in_arr, in_offset: number, in_deleteCount: number) {\n\t\t// TODO: this function can be optimized\n\t\tconst newSize = this.size - in_deleteCount;\n\t\tconst splicedArray = new in_arr.constructor(newSize);\n\t\tsplicedArray.set(in_arr.subarray(0, in_offset));\n\t\tsplicedArray.set(in_arr.subarray(in_offset + in_deleteCount, this.size), in_offset);\n\t\treturn splicedArray;\n\t}\n\n\t/\n\t remove a range of elements from the array\n\t * @param in_offset - start of the range\n\t * @param in_deleteCount - number of elements to be removed\n\t /\n\tremoveRange(in_offset: number, in_deleteCount: number) {\n\t\tif (in_offset + in_deleteCount < (this._buffer.length as number) + 1) {\n\t\t\tthis._buffer = this._removeElementsFromArray(this._buffer, in_offset, in_deleteCount);\n\t\t\tthis.size = this.size - in_deleteCount;\n\t\t} else {\n\t\t\tconsole.error(\"DataArray removeRange in_offset + in_deleteCount is out of bounds.\");\n\t\t}\n\t}\n\n\t/\n\t copy an array with elements inserted into the copy\n\t * @param in_arr - the input array (won't be modified)\n\t * @param in_offset - the index where the new elements will be inserted\n\t * @param in_addedArray - the array with the elements that will be added\n\t * @returns the combined array\n\t /\n\tprivate _insert(in_arr, in_offset: number, in_addedArray) {\n\t\t// TODO: this function can be optimized\n\t\tconst newSize = this.size + (in_addedArray.length as number);\n\t\tconst insertedArray = new in_arr.constructor(newSize);\n\t\tinsertedArray.set(in_arr.subarray(0, in_offset));\n\t\tinsertedArray.set(in_addedArray, in_offset);\n\t\tinsertedArray.set(\n\t\t\tin_arr.subarray(in_offset, this.size),\n\t\t\tin_offset + (in_addedArray.length as number),\n\t\t);\n\t\treturn insertedArray;\n\t}\n\n\t/\n\t insert the content of an array into the DataArray\n\t * @param in_offset - the target index\n\t * @param in_array - the array to be inserted\n\t /\n\tinsertRange(in_offset: number, in_array) {\n\t\tthis._buffer = this._insert(this._buffer, in_offset, in_array);\n\t\tthis.size = this.size + (in_array.length as number);\n\t}\n\n\t/\n\t Set this array values to be equal to in_array values.\n\t * @param in_offset - An optional offset in this array to begin start setting this arrays values to in_array values.\n\t * @param in_array - The input array.\n\t /\n\tset(in_offset: number, in_array) {\n\t\tif (\n\t\t\tin_array instanceof ArrayBuffer \|\|\n\t\t\tin_array instanceof Array \|\|\n\t\t\tin_array instanceof this.getBufferCtor()\n\t\t) {\n\t\t\tthis._buffer.set(in_array, in_offset);\n\t\t} else if (in_array instanceof BaseDataArray) {\n\t\t\tthis._buffer.set(in_array.getBuffer(), in_offset);\n\t\t} else {\n\t\t\tconsole.error(\"DataArray set() must be called with Array, TypedArray or DataArray\");\n\t\t}\n\t}\n\n\t/\n\t Insert a value at the end of the array, creates a new element at the end and sets the value.\n\t * @param in_value - The new value.\n\t /\n\tpush(in_value) {\n\t\t// Adjust the buffer if necessary\n\t\tconst bufferLength = this._buffer.length;\n\t\tif (this.size > bufferLength - 1) {\n\t\t\tthis._alloc(this.size 2 \|\| 1); // grow by a factor of 2x\n\t\t}\n\t\t// set the value and update size\n\t\tthis.setValue(this.size, in_value);\n\t\tthis.size++;\n\t}\n\n\t/*\n\t Get direct access to the data (for performance reasons) this should be uses read only.\n\t * @returns The (read only) raw data.\n\t /\n\tgetBuffer() {\n\t\treturn this._buffer;\n\t}\n\n\t/\n\t Get the constructor of the underlying `TypedArray`.\n\t * @returns The constructor for the data buffer.\n\t /\n\tgetBufferCtor() {\n\t\treturn this.bufferConstructor;\n\t}\n\n\t/\n\t Apply a given function to all elements of the array.\n\t * @param in_fn - The function that will be applied to every element.\n\t /\n\titerate(in_fn) {\n\t\tconst l = this.size;\n\t\tfor (let i = 0; i < l; i++) {\n\t\t\tin_fn(this._buffer[i]);\n\t\t}\n\t}\n\n\t/\n\t Tet a resized buffer copy.\n\t * @param in_bufferCtor - The constructor for the returned buffer.\n\t * @param in_buffer - The input buffer (won't be modified).\n\t * @param in_newSize - The target size.\n\t * @returns The buffer with the new size.\n\t /\n\tprivate resizeBuffer(in_bufferCtor, in_buffer, in_newSize: number) {\n\t\t// target buffer with the desired new size\n\t\t// The 'eslint-...' is used to disable the rule that requires\n\t\t// constructors to start with a capitalized letter.\n\t\tconst newBuffer = new in_bufferCtor(in_newSize);\n\t\tconst oldSize = in_buffer.length;\n\t\tconst oldBuffer = in_buffer;\n\t\tconst isShrinking = oldSize > in_newSize;\n\t\tnewBuffer.set(isShrinking ? oldBuffer.subarray(0, in_newSize) : oldBuffer);\n\t\treturn newBuffer;\n\t}\n\n\t/\n\t Allocate memory for the array (for performance reasons, you can allocate more space than the current length,\n\t * which makes pushes to the array less expensive later).\n\t * @param size - The target allocated space.\n\t * @returns The DataArray itself.\n\t /\n\tprotected _alloc(size: number): any {\n\t\tthis._buffer = this.resizeBuffer(this.bufferConstructor, this._buffer, size);\n\t\treturn this;\n\t}\n\n\t/\n\t Change the size of the array\n\t * @param size - The target size\n\t * @returns The DataArray itself\n\t /\n\tresize(size: number) {\n\t\t// this can be costly!!!\n\t\tthis._alloc(size);\n\t\tthis.size = size;\n\t\treturn this;\n\t}\n\n\tcopy() {\n\t\t// and this!\n\t\tconst newBuffer = new this.bufferConstructor(this.size); // buffer with the desired new size\n\t\tnewBuffer.set(this._buffer);\n\t\treturn newBuffer;\n\t}\n\n\tget length() {\n\t\treturn this.size;\n\t}\n}\n\nclass Int8DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Int8Array, size);\n\t}\n}\n\nclass Int16DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Int16Array, size);\n\t}\n}\n\nclass Int32DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Int32Array, size);\n\t}\n}\n\nclass Uint8DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Uint8Array, size);\n\t}\n}\n\nclass Uint16DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Uint16Array, size);\n\t}\n}\n\nclass Uint32DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Uint32Array, size);\n\t}\n}\n\nclass Float32DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Float32Array, size);\n\t}\n}\n\nclass Float64DataArray extends BaseDataArray {\n\tconstructor(size: number) {\n\t\tsuper(Float64Array, size);\n\t}\n}\n\n/\n A data container that can contain every native type\n \n @param size - The initial size with which to allocate the array.\n /\nclass UniversalDataArray extends BaseDataArray {\n\tconstructor(bufferConstructor: any, size: number);\n\tconstructor(size: number);\n\tconstructor(a?, b?) {\n\t\tif (b === undefined) {\n\t\t\tsuper(Array, a);\n\t\t} else {\n\t\t\tsuper(a, b);\n\t\t}\n\t}\n\n\t/\n\t Helper function to write array values into another array at a given offset.\n\t \n\t @param array - The target array.\n\t * @param values - The values we need to write.\n\t * @param offset - The starting index in target array.\n\t /\n\tprivate arraySet(array, values, offset = 0) {\n\t\tlet index = 0;\n\t\tvalues.forEach(function (value) {\n\t\t\tarray[index + offset] = value;\n\t\t\tindex++;\n\t\t});\n\t}\n\n\t/\n\t Insert the content of an array into the DataArray.\n\t * @param in_offset - The target index.\n\t * @param in_array - The array to be inserted.\n\t /\n\tinsertRange(in_offset: number, in_array: any[]) {\n\t\tthis._buffer.splice.call(this._buffer, ...[in_offset, 0].concat(in_array));\n\t\tthis.size = this.size + in_array.length;\n\t}\n\n\t/\n\t Eemove a range of elements from the array.\n\t * @param in_offset - The start of the range.\n\t * @param in_deleteCount - The number of elements to be removed.\n\t /\n\tremoveRange(in_offset: number, in_deleteCount: number) {\n\t\tif (in_offset + in_deleteCount < (this._buffer.length as number) + 1) {\n\t\t\tthis._buffer.splice(in_offset, in_deleteCount);\n\t\t\tthis.size -= in_deleteCount;\n\t\t} else {\n\t\t\tthrow Error(\"DataArray removeRange in_offset + in_deleteCount is out of bounds.\");\n\t\t}\n\t}\n\n\t/\n\t Set this array values to be equal to in_array values.\n\t * @param in_offset - An optional offset in this array to begin start\n\t * setting this arrays values to in_array values.\n\t * @param in_array - The input array.\n\t /\n\tset(in_offset: number, in_array) {\n\t\tif (\n\t\t\tin_array instanceof ArrayBuffer \|\|\n\t\t\tin_array instanceof Array \|\|\n\t\t\tin_array instanceof this.getBufferCtor()\n\t\t) {\n\t\t\tthis.arraySet(this._buffer, in_array, in_offset);\n\t\t} else if (in_array instanceof BaseDataArray) {\n\t\t\tthis.arraySet(this._buffer, in_array.getBuffer(), in_offset);\n\t\t} else {\n\t\t\tconsole.error(\"DataArray set() must be called with Array, TypedArray or DataArray\");\n\t\t}\n\t}\n\n\t/\n\t Return a range of values in the array.\n\t * @param in_idxStart - the starting index\n\t * @param in_idxEnd - the end index - this offset is exclusive\n\t * @returns the array of values in the range\n\t /\n\tgetValueRange(in_idxStart: number, in_idxEnd: number) {\n\t\tif (in_idxStart >= this.size \|\| in_idxEnd > this.size \|\| in_idxStart < 0 \|\| in_idxEnd < 0) {\n\t\t\tthrow new Error(\"Trying to access out of bounds!\");\n\t\t}\n\t\treturn this._buffer.slice(in_idxStart, in_idxEnd);\n\t}\n\n\t/\n\t change the size of a javascript array and keep the content, if possible. Keeps the input buffer.\n\t * @param in_buffer - input buffer - not changed\n\t * @param in_newSize - target size\n\t * @returns an Array of the new size\n\t /\n\tprivate resizeBufferArray(in_buffer, in_newSize) {\n\t\t// target buffer with the desired new size\n\t\tconst newBuffer = new Array(in_newSize);\n\t\tconst oldSize = in_buffer.length;\n\t\tconst oldBuffer = in_buffer;\n\t\tconst isShrinking = oldSize > in_newSize;\n\t\tthis.arraySet(newBuffer, isShrinking ? oldBuffer.slice(0, in_newSize) : oldBuffer);\n\t\treturn newBuffer;\n\t}\n\n\t/\n\t allocate memory for the array (for performance reasons, you can allocate more space than the current length,\n\t * which makes pushes to the array less expensive later)\n\t * @param size - the target allocated space\n\t * @returns the DataArray itself\n\t /\n\tprotected _alloc(size: number): any {\n\t\tthis._buffer = this.resizeBufferArray(this._buffer, size);\n\t\treturn this;\n\t}\n}\n\n/\n A data container that contains a string\n /\nclass StringDataArray extends BaseDataArray {\n\tconstructor() {\n\t\tsuper(String, 0);\n\t\tthis.size = 0;\n\t\tthis._buffer = \"\";\n\t}\n\t/\n\t insert the content of a string into the StringDataArray\n\t * @param in_offset - the target index\n\t * @param in_string - the string to be inserted\n\t /\n\tinsertRange(in_offset: number, in_string: string) {\n\t\tthis._buffer = `${this._buffer.substr(0, in_offset)}${in_string}${this._buffer.substr(\n\t\t\tin_offset,\n\t\t)}`;\n\t\tthis.size = this.size + in_string.length;\n\t}\n\n\t/\n\t remove a range of elements from the string\n\t * @param in_offset - start of the range\n\t * @param in_deleteCount - number of elements to be removed\n\t /\n\tremoveRange(in_offset: number, in_deleteCount: number) {\n\t\tif (in_offset + in_deleteCount < (this._buffer.length as number) + 1) {\n\t\t\tthis._buffer = `${this._buffer.substr(0, in_offset)}${this._buffer.substr(\n\t\t\t\tin_offset + in_deleteCount,\n\t\t\t)}`;\n\t\t\tthis.size -= in_deleteCount;\n\t\t} else {\n\t\t\tthrow Error(\"DataArray removeRange in_offset + in_deleteCount is out of bounds.\");\n\t\t}\n\t}\n\n\t/\n\t Set this array values to be equal to in_string values.\n\t * @param in_offset - The offset in this array to begin start setting this arrays values to in_string values.\n\t * @param in_string - The input string.\n\t /\n\tset(in_offset: number, in_string: string) {\n\t\tthis._buffer = `${this._buffer.substr(0, in_offset)}${in_string}${this._buffer.substr(\n\t\t\tin_offset + in_string.length,\n\t\t)}`;\n\t}\n\n\t/\n\t Return a range of characters in the string.\n\t * @param in_idxStart - the starting index\n\t * @param in_idxEnd - the end index - this offset is exclusive\n\t * @returns the characters in the range\n\t /\n\tgetValueRange(in_idxStart: number, in_idxEnd: number): string {\n\t\tif (in_idxStart >= this.size \|\| in_idxEnd > this.size \|\| in_idxStart < 0 \|\| in_idxEnd < 0) {\n\t\t\tthrow new Error(\"Trying to access out of bounds!\");\n\t\t}\n\t\treturn this._buffer.slice(in_idxStart, in_idxEnd);\n\t}\n\n\tget length() {\n\t\treturn this._buffer.length;\n\t}\n}\n\n/\n A data container that can contain boolean type\n /\nclass BoolDataArray extends UniversalDataArray {\n\t/\n\t @param size - The initial size with which to allocate the array.\n\t /\n\tconstructor(size: number) {\n\t\tsuper(Array, size);\n\t}\n\n\t/\n\t helper function to write and cast to boolean array values into another array at a given offset\n\t * @param array - target array\n\t * @param values - the values we need to write\n\t * @param offset - starting index in target array\n\t /\n\tprivate arraySetBool(array, values, offset = 0) {\n\t\tlet index = 0;\n\t\tvalues.forEach(function (value) {\n\t\t\tarray[index + offset] = !!(value as boolean);\n\t\t\tindex++;\n\t\t});\n\t}\n\n\t/\n\t insert the content of an array into the DataArray\n\t * @param in_offset - the target index\n\t * @param in_array - the array to be inserted\n\t /\n\tinsertRange(in_offset: number, in_array: any[]) {\n\t\tconst toBeAdded: any[] = in_array.map((val) => !!(val as boolean));\n\t\tthis._buffer.splice.call(this._buffer, ...[in_offset, 0].concat(toBeAdded));\n\t\tthis.size = this.size + in_array.length;\n\t}\n\n\t/\n\t Set this array values to be equal to in_array values.\n\t * @param in_offset - An optional offset in this array to begin start setting this arrays values to in_array values.\n\t * @param in_array - The input array.\n\t */\n\tset(in_offset: number, in_array) {\n\t\tif (\n\t\t\tin_array instanceof ArrayBuffer \|\|\n\t\t\tin_array instanceof Array \|\|\n\t\t\tin_array instanceof this.getBufferCtor()\n\t\t) {\n\t\t\tthis.arraySetBool(this._buffer, in_array, in_offset);\n\t\t} else if (in_array instanceof BaseDataArray) {\n\t\t\tthis.arraySetBool(this._buffer, in_array.getBuffer(), in_offset);\n\t\t} else {\n\t\t\tconsole.error(\"DataArray set() must be called with Array, TypedArray or DataArray\");\n\t\t}\n\t}\n}\n\nexport {\n\tBaseDataArray,\n\tFloat32DataArray,\n\tFloat64DataArray,\n\tInt8DataArray,\n\tInt16DataArray,\n\tInt32DataArray,\n\tUint8DataArray,\n\tUint16DataArray,\n\tUint32DataArray,\n\tUniversalDataArray,\n\tStringDataArray,\n\tBoolDataArray,\n};\n"]}

package/dist/datastructures/integer64.js CHANGED Viewed

@@ -89,7 +89,7 @@ function _stringToInt64(in_signed, in_string, in_radix = 10) {
     let negative = false;
     let high = 0;
     let low = 0;
-    if (string[0] === "-") {
+    if (string.startsWith("-")) {
         negative = true;
         position += 1;
     }

package/dist/datastructures/integer64.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"integer64.js","sourceRoot":"","sources":["../../src/datastructures/integer64.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;AAEH;;GAEG;AAEH,oDAAuB;AACvB,kDAA+C;AAC/C,4CAAyC;AAEzC,MAAM,KAAK,GAAG,UAAU,CAAC;AACzB,MAAM,EAAE,GAAG,EAAE,GAAG,qBAAS,CAAC;AAE1B;;;;;;;;;;GAUG;AACH,MAAa,SAAS;IACrB,YAAsB,MAAM,CAAC,EAAY,OAAO,CAAC;QAA3B,QAAG,GAAH,GAAG,CAAI;QAAY,SAAI,GAAJ,IAAI,CAAI;IAAG,CAAC;IAErD;;OAEG;IACH,YAAY;QACX,OAAO,IAAI,CAAC,IAAI,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,WAAW;QACV,OAAO,IAAI,CAAC,GAAG,CAAC;IACjB,CAAC;IAES,cAAc,CAAC,QAAiB,EAAE,QAAQ,GAAG,EAAE;QACxD,2BAAY,CAAC,MAAM,CAAC,gBAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,GAAG,GAAG,CAAC,uBAAuB,IAAI,QAAQ,EAAE,CAAC,CAAC;QACxF,2BAAY,CAAC,MAAM,CAClB,QAAQ,IAAI,CAAC,IAAI,EAAE,IAAI,QAAQ,EAC/B,GAAG,GAAG,CAAC,iBAAiB,IAAI,QAAQ,EAAE,CACtC,CAAC;QAEF,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QAC/B,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAC7B,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,iCAAiC;QACjF,IAAI,IAAI,EAAE;YACT,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,iCAAiC;YAC/C,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC;SAClB;QACD,GAAG;YACF,MAAM,GAAG,GAAG,CAAC,IAAI,GAAG,QAAQ,CAAC,GAAG,KAAK,GAAG,GAAG,CAAC;YAC5C,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC;YACnC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC;YACjC,MAAM,GAAG,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC;SACtD,QAAQ,IAAI,IAAI,GAAG,EAAE;QAEtB,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;IACrC,CAAC;CACD;AAzCD,8BAyCC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,cAAc,CAAC,SAAkB,EAAE,SAAiB,EAAE,QAAQ,GAAG,EAAE;IAC3E,2BAAY,CAAC,MAAM,CAAC,gBAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,wBAAwB,GAAG,SAAS,CAAC,CAAC;IACrF,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC;IAEhC,2BAAY,CAAC,MAAM,CAAC,gBAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,GAAG,GAAG,CAAC,qBAAqB,KAAK,QAAQ,EAAE,CAAC,CAAC;IACvF,2BAAY,CAAC,MAAM,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,IAAI,QAAQ,EAAE,GAAG,GAAG,CAAC,iBAAiB,IAAI,QAAQ,EAAE,CAAC,CAAC;IAE7F,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,MAAM,CAAC,~~CAAC~~,CAAC,~~KAAK,~~GAAG,EAAE;~~QACtB~~,QAAQ,GAAG,IAAI,CAAC;QAChB,QAAQ,IAAI,CAAC,CAAC;KACd;IAED,2BAAY,CAAC,MAAM,CAAC,CAAC,QAAQ,IAAI,SAAS,EAAE,GAAG,CAAC,yBAAyB,GAAG,MAAM,CAAC,CAAC;IAEpF,OAAO,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE;QAChC,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE;YACjB,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,+BAA+B,GAAG,MAAM,CAAC,CAAC;SAClE;QACD,GAAG,GAAG,GAAG,GAAG,QAAQ,GAAG,KAAK,CAAC;QAC7B,IAAI,GAAG,IAAI,GAAG,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;QACjD,GAAG,IAAI,KAAK,CAAC;KACb;IAED,IAAI,QAAQ,EAAE;QACb,sCAAsC;QACtC,IAAI,GAAG,CAAC,IAAI,CAAC;QACb,IAAI,GAAG,EAAE;YACR,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC;SAClB;aAAM;YACN,IAAI,IAAI,CAAC,CAAC;SACV;KACD;IAED,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AACpB,CAAC;AAED;;GAEG;AACH,MAAa,KAAM,SAAQ,SAAS;IAMnC,KAAK;QACJ,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,QAAQ,CAAC,KAAK,GAAG,EAAE;QAClB,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;;AAZF,sBAaC;AAZO,gBAAU,GAAG,UAAU,SAAiB,EAAE,KAAK,GAAG,EAAE;IAC1D,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAC3D,OAAO,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC7B,CAAC,CAAC;AAWH;;GAEG;AACH,MAAa,MAAO,SAAQ,SAAS;IACpC,MAAM,CAAC,UAAU,CAAC,SAAiB,EAAE,QAAQ,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC1E,OAAO,IAAI,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,KAAK;QACJ,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IAED,QAAQ,CAAC,KAAK;QACb,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC1C,CAAC;CACD;AAbD,wBAaC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\n/\n @fileoverview implements (U)Int64 Datastructures\n /\n\nimport _ from \"lodash\";\nimport { ConsoleUtils } from \"../consoleUtils\";\nimport { constants } from \"../constants\";\n\nconst BIT32 = 4294967296;\nconst { MSG } = constants;\n\n/\n A data representation class for 64 bit integer types.\n \n @remarks This is necessary since js doesn't support 64bit integers natively yet.\n \n Please note this class is immutable.\n * There are and there won't be set functions! (see javascript String class)\n \n @param low - Lower 32 bit\n * @param high - Higher 32 bit\n /\nexport class Integer64 {\n\tconstructor(protected low = 0, protected high = 0) {}\n\n\t/\n\t @returns The higher 32 bit integer part\n\t /\n\tgetValueHigh() {\n\t\treturn this.high;\n\t}\n\n\t/\n\t @returns The lower 32 bit integer part\n\t /\n\tgetValueLow() {\n\t\treturn this.low;\n\t}\n\n\tprotected _int64toString(isSigned: boolean, in_radix = 10): string {\n\t\tConsoleUtils.assert(_.isNumber(in_radix), `${MSG.IN_RADIX_MUST_BE_NUMBER} ${in_radix}`);\n\t\tConsoleUtils.assert(\n\t\t\tin_radix >= 2 && 36 >= in_radix,\n\t\t\t`${MSG.BASE_OUT_OF_RANGE} ${in_radix}`,\n\t\t);\n\n\t\tlet high = this.getValueHigh();\n\t\tlet low = this.getValueLow();\n\t\tlet result = \"\";\n\t\tconst sign = !!(isSigned && high & 0x80000000); // eslint-disable-line no-bitwise\n\t\tif (sign) {\n\t\t\thigh = ~high; // eslint-disable-line no-bitwise\n\t\t\tlow = BIT32 - low;\n\t\t}\n\t\tdo {\n\t\t\tconst mod = (high % in_radix) BIT32 + low;\n\t\t\thigh = Math.floor(high / in_radix);\n\t\t\tlow = Math.floor(mod / in_radix);\n\t\t\tresult = (mod % in_radix).toString(in_radix) + result;\n\t\t} while (high \|\| low);\n\n\t\treturn sign ? `-${result}` : result;\n\t}\n}\n\n/*\n stringToInt function parses a string argument updates object's lower and higher 32 bit integer parts.\n \n @param in_signed - If the expect response should be signed or unsigned.\n * @param in_string - The value to parse. Leading whitespace in the string argument is ignored.\n * @param in_radix - An integer between 2 and 36 that represents the\n * radix (the base in mathematical numeral systems) of the above mentioned string.\n \n @throws If `in_string` is not a string.\n * @throws If `in_radix` is entered but is not a number between 2 and 36.\n * @throws If the property is a `Uint64` property and `in_string` is a negative number.\n * @throws If `in_string` contains characters other than numbers.\n \n @returns Low and high bits of `Int64`.\n /\nfunction _stringToInt64(in_signed: boolean, in_string: string, in_radix = 10): number[] {\n\tConsoleUtils.assert(_.isString(in_string), MSG.IN_STRING_MUST_BE_STRING + in_string);\n\tconst string = in_string.trim();\n\n\tConsoleUtils.assert(_.isNumber(in_radix), `${MSG.IN_RADIX_BETWEEN_2_36} ${in_radix}`);\n\tConsoleUtils.assert(in_radix >= 2 && 36 >= in_radix, `${MSG.BASE_OUT_OF_RANGE} ${in_radix}`);\n\n\tlet position = 0;\n\tlet negative = false;\n\tlet high = 0;\n\tlet low = 0;\n\tif (string~~[0] ===~~ \"-\") {\n\t\tnegative = true;\n\t\tposition += 1;\n\t}\n\n\tConsoleUtils.assert(!negative \|\| in_signed, MSG.CANNOT_UPDATE_TO_NEGATIVE + string);\n\n\twhile (position < string.length) {\n\t\tconst digit = parseInt(string[position++], in_radix);\n\t\tif (isNaN(digit)) {\n\t\t\tthrow new TypeError(MSG.CANNOT_PARSE_INVALID_CHARACTERS + string);\n\t\t}\n\t\tlow = low in_radix + digit;\n\t\thigh = high * in_radix + Math.floor(low / BIT32);\n\t\tlow %= BIT32;\n\t}\n\n\tif (negative) {\n\t\t// eslint-disable-next-line no-bitwise\n\t\thigh = ~high;\n\t\tif (low) {\n\t\t\tlow = BIT32 - low;\n\t\t} else {\n\t\t\thigh += 1;\n\t\t}\n\t}\n\n\treturn [low, high];\n}\n\n/*\n A data representation class for the signed 64 bit integer type\n /\nexport class Int64 extends Integer64 {\n\tstatic fromString = function (in_string: string, radix = 10) {\n\t\tconst [low, high] = _stringToInt64(true, in_string, radix);\n\t\treturn new Int64(low, high);\n\t};\n\n\tclone() {\n\t\treturn new Int64(this.low, this.high);\n\t}\n\n\ttoString(radix = 10) {\n\t\treturn this._int64toString(true, radix);\n\t}\n}\n\n/\n A data representation class for the unsigned 64 bit integer type\n */\nexport class Uint64 extends Integer64 {\n\tstatic fromString(in_string: string, in_radix = 10) {\n\t\tconst [low, high] = _stringToInt64.call(this, false, in_string, in_radix);\n\t\treturn new Uint64(low, high);\n\t}\n\n\tclone() {\n\t\treturn new Uint64(this.low, this.high);\n\t}\n\n\ttoString(radix) {\n\t\treturn this._int64toString(false, radix);\n\t}\n}\n"]}
1	+ {"version":3,"file":"integer64.js","sourceRoot":"","sources":["../../src/datastructures/integer64.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;AAEH;;GAEG;AAEH,oDAAuB;AACvB,kDAA+C;AAC/C,4CAAyC;AAEzC,MAAM,KAAK,GAAG,UAAU,CAAC;AACzB,MAAM,EAAE,GAAG,EAAE,GAAG,qBAAS,CAAC;AAE1B;;;;;;;;;;GAUG;AACH,MAAa,SAAS;IACrB,YAAsB,MAAM,CAAC,EAAY,OAAO,CAAC;QAA3B,QAAG,GAAH,GAAG,CAAI;QAAY,SAAI,GAAJ,IAAI,CAAI;IAAG,CAAC;IAErD;;OAEG;IACH,YAAY;QACX,OAAO,IAAI,CAAC,IAAI,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,WAAW;QACV,OAAO,IAAI,CAAC,GAAG,CAAC;IACjB,CAAC;IAES,cAAc,CAAC,QAAiB,EAAE,QAAQ,GAAG,EAAE;QACxD,2BAAY,CAAC,MAAM,CAAC,gBAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,GAAG,GAAG,CAAC,uBAAuB,IAAI,QAAQ,EAAE,CAAC,CAAC;QACxF,2BAAY,CAAC,MAAM,CAClB,QAAQ,IAAI,CAAC,IAAI,EAAE,IAAI,QAAQ,EAC/B,GAAG,GAAG,CAAC,iBAAiB,IAAI,QAAQ,EAAE,CACtC,CAAC;QAEF,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QAC/B,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAC7B,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,iCAAiC;QACjF,IAAI,IAAI,EAAE;YACT,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,iCAAiC;YAC/C,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC;SAClB;QACD,GAAG;YACF,MAAM,GAAG,GAAG,CAAC,IAAI,GAAG,QAAQ,CAAC,GAAG,KAAK,GAAG,GAAG,CAAC;YAC5C,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC;YACnC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC;YACjC,MAAM,GAAG,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC;SACtD,QAAQ,IAAI,IAAI,GAAG,EAAE;QAEtB,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;IACrC,CAAC;CACD;AAzCD,8BAyCC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,cAAc,CAAC,SAAkB,EAAE,SAAiB,EAAE,QAAQ,GAAG,EAAE;IAC3E,2BAAY,CAAC,MAAM,CAAC,gBAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,wBAAwB,GAAG,SAAS,CAAC,CAAC;IACrF,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC;IAEhC,2BAAY,CAAC,MAAM,CAAC,gBAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,GAAG,GAAG,CAAC,qBAAqB,KAAK,QAAQ,EAAE,CAAC,CAAC;IACvF,2BAAY,CAAC,MAAM,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,IAAI,QAAQ,EAAE,GAAG,GAAG,CAAC,iBAAiB,IAAI,QAAQ,EAAE,CAAC,CAAC;IAE7F,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;QAC3B,QAAQ,GAAG,IAAI,CAAC;QAChB,QAAQ,IAAI,CAAC,CAAC;KACd;IAED,2BAAY,CAAC,MAAM,CAAC,CAAC,QAAQ,IAAI,SAAS,EAAE,GAAG,CAAC,yBAAyB,GAAG,MAAM,CAAC,CAAC;IAEpF,OAAO,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE;QAChC,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE;YACjB,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,+BAA+B,GAAG,MAAM,CAAC,CAAC;SAClE;QACD,GAAG,GAAG,GAAG,GAAG,QAAQ,GAAG,KAAK,CAAC;QAC7B,IAAI,GAAG,IAAI,GAAG,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;QACjD,GAAG,IAAI,KAAK,CAAC;KACb;IAED,IAAI,QAAQ,EAAE;QACb,sCAAsC;QACtC,IAAI,GAAG,CAAC,IAAI,CAAC;QACb,IAAI,GAAG,EAAE;YACR,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC;SAClB;aAAM;YACN,IAAI,IAAI,CAAC,CAAC;SACV;KACD;IAED,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AACpB,CAAC;AAED;;GAEG;AACH,MAAa,KAAM,SAAQ,SAAS;IAMnC,KAAK;QACJ,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,QAAQ,CAAC,KAAK,GAAG,EAAE;QAClB,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;;AAZF,sBAaC;AAZO,gBAAU,GAAG,UAAU,SAAiB,EAAE,KAAK,GAAG,EAAE;IAC1D,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAC3D,OAAO,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC7B,CAAC,CAAC;AAWH;;GAEG;AACH,MAAa,MAAO,SAAQ,SAAS;IACpC,MAAM,CAAC,UAAU,CAAC,SAAiB,EAAE,QAAQ,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC1E,OAAO,IAAI,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,KAAK;QACJ,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IAED,QAAQ,CAAC,KAAK;QACb,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC1C,CAAC;CACD;AAbD,wBAaC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\n/\n @fileoverview implements (U)Int64 Datastructures\n /\n\nimport _ from \"lodash\";\nimport { ConsoleUtils } from \"../consoleUtils\";\nimport { constants } from \"../constants\";\n\nconst BIT32 = 4294967296;\nconst { MSG } = constants;\n\n/\n A data representation class for 64 bit integer types.\n \n @remarks This is necessary since js doesn't support 64bit integers natively yet.\n \n Please note this class is immutable.\n * There are and there won't be set functions! (see javascript String class)\n \n @param low - Lower 32 bit\n * @param high - Higher 32 bit\n /\nexport class Integer64 {\n\tconstructor(protected low = 0, protected high = 0) {}\n\n\t/\n\t @returns The higher 32 bit integer part\n\t /\n\tgetValueHigh() {\n\t\treturn this.high;\n\t}\n\n\t/\n\t @returns The lower 32 bit integer part\n\t /\n\tgetValueLow() {\n\t\treturn this.low;\n\t}\n\n\tprotected _int64toString(isSigned: boolean, in_radix = 10): string {\n\t\tConsoleUtils.assert(_.isNumber(in_radix), `${MSG.IN_RADIX_MUST_BE_NUMBER} ${in_radix}`);\n\t\tConsoleUtils.assert(\n\t\t\tin_radix >= 2 && 36 >= in_radix,\n\t\t\t`${MSG.BASE_OUT_OF_RANGE} ${in_radix}`,\n\t\t);\n\n\t\tlet high = this.getValueHigh();\n\t\tlet low = this.getValueLow();\n\t\tlet result = \"\";\n\t\tconst sign = !!(isSigned && high & 0x80000000); // eslint-disable-line no-bitwise\n\t\tif (sign) {\n\t\t\thigh = ~high; // eslint-disable-line no-bitwise\n\t\t\tlow = BIT32 - low;\n\t\t}\n\t\tdo {\n\t\t\tconst mod = (high % in_radix) BIT32 + low;\n\t\t\thigh = Math.floor(high / in_radix);\n\t\t\tlow = Math.floor(mod / in_radix);\n\t\t\tresult = (mod % in_radix).toString(in_radix) + result;\n\t\t} while (high \|\| low);\n\n\t\treturn sign ? `-${result}` : result;\n\t}\n}\n\n/*\n stringToInt function parses a string argument updates object's lower and higher 32 bit integer parts.\n \n @param in_signed - If the expect response should be signed or unsigned.\n * @param in_string - The value to parse. Leading whitespace in the string argument is ignored.\n * @param in_radix - An integer between 2 and 36 that represents the\n * radix (the base in mathematical numeral systems) of the above mentioned string.\n \n @throws If `in_string` is not a string.\n * @throws If `in_radix` is entered but is not a number between 2 and 36.\n * @throws If the property is a `Uint64` property and `in_string` is a negative number.\n * @throws If `in_string` contains characters other than numbers.\n \n @returns Low and high bits of `Int64`.\n /\nfunction _stringToInt64(in_signed: boolean, in_string: string, in_radix = 10): number[] {\n\tConsoleUtils.assert(_.isString(in_string), MSG.IN_STRING_MUST_BE_STRING + in_string);\n\tconst string = in_string.trim();\n\n\tConsoleUtils.assert(_.isNumber(in_radix), `${MSG.IN_RADIX_BETWEEN_2_36} ${in_radix}`);\n\tConsoleUtils.assert(in_radix >= 2 && 36 >= in_radix, `${MSG.BASE_OUT_OF_RANGE} ${in_radix}`);\n\n\tlet position = 0;\n\tlet negative = false;\n\tlet high = 0;\n\tlet low = 0;\n\tif (string.startsWith(\"-\")) {\n\t\tnegative = true;\n\t\tposition += 1;\n\t}\n\n\tConsoleUtils.assert(!negative \|\| in_signed, MSG.CANNOT_UPDATE_TO_NEGATIVE + string);\n\n\twhile (position < string.length) {\n\t\tconst digit = parseInt(string[position++], in_radix);\n\t\tif (isNaN(digit)) {\n\t\t\tthrow new TypeError(MSG.CANNOT_PARSE_INVALID_CHARACTERS + string);\n\t\t}\n\t\tlow = low in_radix + digit;\n\t\thigh = high * in_radix + Math.floor(low / BIT32);\n\t\tlow %= BIT32;\n\t}\n\n\tif (negative) {\n\t\t// eslint-disable-next-line no-bitwise\n\t\thigh = ~high;\n\t\tif (low) {\n\t\t\tlow = BIT32 - low;\n\t\t} else {\n\t\t\thigh += 1;\n\t\t}\n\t}\n\n\treturn [low, high];\n}\n\n/*\n A data representation class for the signed 64 bit integer type\n /\nexport class Int64 extends Integer64 {\n\tstatic fromString = function (in_string: string, radix = 10) {\n\t\tconst [low, high] = _stringToInt64(true, in_string, radix);\n\t\treturn new Int64(low, high);\n\t};\n\n\tclone() {\n\t\treturn new Int64(this.low, this.high);\n\t}\n\n\ttoString(radix = 10) {\n\t\treturn this._int64toString(true, radix);\n\t}\n}\n\n/\n A data representation class for the unsigned 64 bit integer type\n */\nexport class Uint64 extends Integer64 {\n\tstatic fromString(in_string: string, in_radix = 10) {\n\t\tconst [low, high] = _stringToInt64.call(this, false, in_string, in_radix);\n\t\treturn new Uint64(low, high);\n\t}\n\n\tclone() {\n\t\treturn new Uint64(this.low, this.high);\n\t}\n\n\ttoString(radix) {\n\t\treturn this._int64toString(false, radix);\n\t}\n}\n"]}

package/dist/guidUtils.js CHANGED Viewed

@@ -100,7 +100,7 @@ const isBase64 = (GUID) => GUID.length === 22;
  *
  * @param a - unsigned int32 value
  * @param b - unsigned int32 value
- * @returns - result of unsigned integer multiplication
+ * @returns The result of the unsigned integer multiplication.
  */
 function multiply_uint32(a, b) {
     let n = a;

package/dist/guidUtils.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"guidUtils.js","sourceRoot":"","sources":["../src/guidUtils.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;AAEH,+BAA+B;AAE/B;;GAEG;AAEH,0DAAiC;AACjC,8DAAkE;AAClE,MAAM,iBAAiB,GAAG,QAAQ,CAAC;AAEnC;;;;;;GAMG;AACH,MAAM,OAAO,GAAG;IACf,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,aAAa,EAAE,KAAK;IAEpB;;;;;;;;;;;;OAYG;IACH,UAAU,CAAC,OAAgB,EAAE,6BAAsC,KAAK;QACvE,6DAA6D;QAC7D,sDAAsD;QACtD,IAAI,IAAI,CAAC,aAAa,IAAI,CAAC,0BAA0B,EAAE;YACtD,OAAO,CAAC,CAAC;SACT;aAAM;YACN,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;YAE1B,IAAI,OAAO,KAAK,SAAS,EAAE;gBAC1B,MAAM,YAAY,GAAG,IAAA,8CAAyB,EAAC,CAAC,CAAC,CAAC;gBAClD,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,CAAC,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;aAC1B;iBAAM;gBACN,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;gBACnB,IAAI,CAAC,EAAE,GAAG,SAAS,CAAC;gBACpB,IAAI,CAAC,EAAE,GAAG,SAAS,CAAC;gBAEpB,IAAI,CAAC,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC;gBAC1B,IAAI,CAAC,aAAa,EAAE,CAAC;gBACrB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBAChB,IAAI,CAAC,aAAa,EAAE,CAAC;aACrB;YACD,OAAO,CAAC,CAAC,CAAC;SACV;IACF,CAAC;IAED;;OAEG;IACH,aAAa;QACZ,IAAI,CAAC,CAAC,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,UAAU,CAAC;QAC1D,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAEzC,IAAI,CAAC,EAAE,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACtE,IAAI,CAAC,EAAE,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAEtE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/B,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEZ,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAClC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACZ,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC7D,CAAC;CACD,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC;AAE/D;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,CAAS,EAAE,CAAS;IAC5C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,CAAC,MAAM,CAAC,CAAC;IACT,CAAC,MAAM,CAAC,CAAC;IACT,MAAM,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC;IACvB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAClD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,GAAG,CAAC,MAAc,EAAU,EAAE,CAC9C,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAE9D;;;;;;GAMG;AACH,MAAM,cAAc,GAAG,UAAU,CAAS;IACzC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC;AACf,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,cAAc,GAAG,UACtB,YAAiD,EACjD,SAAkB,KAAK;IAEvB,IAAI,MAAM,EAAE;QACX,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,YAAY,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,UAAU,GAAG,mBAAQ,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACrD,6BAA6B;QAC7B,OAAO,WAAW,CAAC,UAAU,CAAC,CAAC;KAC/B;SAAM;QACN,gCAAgC;QAChC,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC3B,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACzC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC;SACxC;QACD,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAChF,EAAE,EACF,CAAC,CACD,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;KAC1B;AACF,CAAC,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,cAAc,GAAG,UACtB,OAAe,EACf,SAAsB,IAAI,WAAW,CAAC,CAAC,CAAC;IAExC,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE;QACtB,MAAM,IAAI,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;KACrB;SAAM;QACN,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtD,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9E,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;KACvD;IACD,OAAO,MAAM,CAAC;AACf,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,cAAc,GAAG,CAAC,OAAe,EAAE,EAAE,CAAC,cAAc,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;AAEpF;;;;;;GAMG;AACH,MAAM,cAAc,GAAG,CAAC,OAAe,EAAE,EAAE,CAAC,cAAc,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC;AAE1F;;;;;;;;;;GAUG;AACH,MAAM,YAAY,GAAG,UAAU,MAAM,GAAG,KAAK;IAC5C,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAEhC,qCAAqC;IACrC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAClC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAClC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAClC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAClC,OAAO,cAAc,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AACrC,CAAC,CAAC;AAEF,2FAA2F;AAC3F,8DAA8D;AAC9D,gEAAgE;AAChE,MAAM,QAAQ,GAAG,mBAAmB,CAAC;AACrC,mDAAmD;AACnD,MAAM,QAAQ,GAAG,qDAAqD,CAAC;AAEvE;;;;;GAKG;AACH,MAAM,MAAM,GAAG,CAAC,OAAe,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAErF;;;;;;;GAOG;AACH,MAAM,mBAAmB,GAAG,UAC3B,SAAsB,EACtB,SAAsB,EACtB,SAAuB;IAEvB,IAAI,WAAW,GAAG,SAAS,CAAC;IAC5B,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,WAAW,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;KACzC;SAAM;QACN,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;KAC9B;IAED,WAAW,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC;IAC7B,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;IAC5B,WAAW,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC;IAC7B,WAAW,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC;IAE7B,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAEpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAEpC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC7E,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC7E,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC7E,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE7E,OAAO,WAAW,CAAC;AACpB,CAAC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,MAAM,YAAY,GAAG,UAAU,QAAgB,EAAE,QAAgB,EAAE,MAAM,GAAG,KAAK;IAChF,MAAM,UAAU,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IAC5C,MAAM,WAAW,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;IAC9D,OAAO,cAAc,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AACzC,CAAC,CAAC;AAEF,mCAAmC;AACnC,OAAO,CAAC,UAAU,EAAE,CAAC;AAErB,MAAM,uBAAuB,GAAG,CAAC,GAAG,IAAI,EAAE,EAAE;IAC3C,OAAO,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,CAAC;AAC7B,CAAC,CAAC;AAEW,QAAA,SAAS,GAAG;IACxB,cAAc;IACd,cAAc;IACd,cAAc;IACd,cAAc;IACd,uBAAuB;IACvB,YAAY;IACZ,MAAM;IACN,YAAY;IACZ,mBAAmB;CACnB,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\n/ eslint-disable no-bitwise /\n\n/\n @fileoverview Utility functions related to handling GUIDs\n /\n\nimport base64js from \"base64-js\";\nimport { generateRandomUInt32Array } from \"../platform-dependent\";\nconst UINT_32HASH_PRIME = 16777619;\n\n/\n Fast high quality 32 bit RNG for consistent GUID.\n \n Good \"randomness\" (distribution); Period is approximately equal to 3.1110^37\n Implementation was take from \"Numerical recipes. The Art of Scientific Computing.\", 3rd edition.\n * Page 357, algorithm name: Ranlim32\n /\nconst guidRNG = {\n\tu: 0,\n\tv: 0,\n\tw1: 0,\n\tw2: 0,\n\tisInitialized: false,\n\n\t/\n\t Initialize RNG.\n\t * This function need to be called once, before the first GUID gets created.\n\t \n\t @param in_seed - Optional 32-bit seed for GUID RNG.\n\t * If no seed is given, a combination of system's local time and `Math.random()` is used.\n\t * @param in_enforceReInitialization - Optionally enforce re-initialization with another seed.\n\t \n\t @returns The seed used to initialize the RNG;\n\t * If re-initialization is not enforced, a zero indicates that the RNG was not re-seeded.\n\t \n\t @alias property-common.initializeGUIDGenerator\n\t /\n\tinitialize(in_seed?: number, in_enforceReInitialization: boolean = false): number {\n\t\t// Quit if the RNG has already been initialized and we do not\n\t\t// want to enforce a re-initialization with a new seed\n\t\tif (this.isInitialized && !in_enforceReInitialization) {\n\t\t\treturn 0;\n\t\t} else {\n\t\t\tthis.isInitialized = true;\n\n\t\t\tif (in_seed === undefined) {\n\t\t\t\tconst randomValues = generateRandomUInt32Array(4);\n\t\t\t\tthis.u = randomValues[0];\n\t\t\t\tthis.v = randomValues[1];\n\t\t\t\tthis.w1 = randomValues[2];\n\t\t\t\tthis.w2 = randomValues[3];\n\t\t\t} else {\n\t\t\t\tthis.v = 224461437;\n\t\t\t\tthis.w1 = 521288629;\n\t\t\t\tthis.w2 = 362436069;\n\n\t\t\t\tthis.u = in_seed ^ this.v;\n\t\t\t\tthis.genRandUInt32();\n\t\t\t\tthis.v = this.u;\n\t\t\t\tthis.genRandUInt32();\n\t\t\t}\n\t\t\treturn -1;\n\t\t}\n\t},\n\n\t/\n\t @returns 32-bit random number based on the RNGs internal state\n\t /\n\tgenRandUInt32(): number {\n\t\tthis.u = multiply_uint32(this.u, 2891336453) + 1640531513;\n\t\tthis.v ^= this.v >>> 13;\n\t\tthis.v ^= this.v << 17;\n\t\tthis.v = ((this.v >>> 5) ^ this.v) >>> 0;\n\n\t\tthis.w1 = multiply_uint32(33378, this.w1 & 0xffff) + (this.w1 >>> 16);\n\t\tthis.w2 = multiply_uint32(57225, this.w2 & 0xffff) + (this.w2 >>> 16);\n\n\t\tlet x = this.u ^ (this.u << 9);\n\t\tx ^= x >>> 17;\n\t\tx ^= x << 6;\n\n\t\tlet y = this.w1 ^ (this.w1 << 17);\n\t\ty ^= y >>> 15;\n\t\ty ^= y << 5;\n\t\treturn (((x >>> 0) + this.v) ^ ((y >>> 0) + this.w2)) >>> 0;\n\t},\n};\n\n/\n Check if GUID is base64 based on the length\n * The length of base16 GUID is 36, base64 - 22\n \n @param GUID - Input GUID\n * @returns True if GUID is base64\n /\nconst isBase64 = (GUID: string): boolean => GUID.length === 22;\n\n/\n Allows for 32-bit integer multiplication with C-like semantics\n \n @param a - unsigned int32 value\n * @param b - unsigned int32 value\n * @returns - result of unsigned integer multiplication\n /\nfunction multiply_uint32(a: number, b: number): number {\n\tlet n = a;\n\tlet m = b;\n\n\tn >>>= 0;\n\tm >>>= 0;\n\tconst nlo = n & 0xffff;\n\treturn ((((n - nlo) m) >>> 0) + nlo * m) >>> 0;\n}\n\n/*\n Helper function to convert base64 encoding to url friendly format\n \n @param base64 - Base64 string\n \n @returns Url-friendly base64 encoding.\n /\nconst toUrlBase64 = (base64: string): string =>\n\tbase64.replace(/\\+/g, \"-\").replace(/\\//g, \"_\").split(\"=\")[0];\n\n/\n Helper function to recover padding of base64 encoding\n \n @param x - Base64 string\n \n @returns Padded base64 encoding.\n /\nconst toPaddedBase64 = function (x: string): string {\n\tlet base64 = x;\n\tconst padLength = 4 - (base64.length % 4);\n\tbase64 += \"=\".repeat(padLength);\n\treturn base64;\n};\n\n/\n Helper function to create a GUID string from an array with 32Bit values\n \n @param in_guidArray - Array with the 32 bit values\n * @param base64 - Use base64 encoding instead of standart guids\n \n @returns The GUID\n /\nconst uint32x4ToGUID = function (\n\tin_guidArray: Uint32Array \| Int32Array \| number[],\n\tbase64: boolean = false,\n): string {\n\tif (base64) {\n\t\tconst intArray = new Uint32Array(in_guidArray);\n\t\tconst byteArray = new Uint8Array(intArray.buffer);\n\t\tconst base64guid = base64js.fromByteArray(byteArray);\n\t\t// return url-friendly base64\n\t\treturn toUrlBase64(base64guid);\n\t} else {\n\t\t// Convert to hexadecimal string\n\t\tlet str = \"\";\n\t\tfor (let i = 0; i < 4; i++) {\n\t\t\tconst hex = in_guidArray[i].toString(16);\n\t\t\tstr += \"0\".repeat(8 - hex.length) + hex;\n\t\t}\n\t\treturn `${str.substr(0, 8)}-${str.substr(8, 4)}-${str.substr(12, 4)}-${str.substr(\n\t\t\t16,\n\t\t\t4,\n\t\t)}-${str.substr(20, 12)}`;\n\t}\n};\n\n/\n Convert GUID to four 32Bit values.\n \n @param in_guid - The GUID to convert\n * @param io_result - An optional array to write the result to.\n * If no array is given, a new one gets created.\n * @returns Four 32-bit values\n \n /\nconst guidToUint32x4 = function (\n\tin_guid: string,\n\tresult: Uint32Array = new Uint32Array(4),\n): Uint32Array {\n\tif (isBase64(in_guid)) {\n\t\tconst GUID = toPaddedBase64(in_guid);\n\t\tconst bytes = base64js.toByteArray(GUID);\n\t\tconst intArray = new Uint32Array(bytes.buffer);\n\t\tresult.set(intArray);\n\t} else {\n\t\tresult[0] = parseInt(`0x${in_guid.substr(0, 8)}`, 16);\n\t\tresult[1] = parseInt(`0x${in_guid.substr(9, 4)}${in_guid.substr(14, 4)}`, 16);\n\t\tresult[2] = parseInt(`0x${in_guid.substr(19, 4)}${in_guid.substr(24, 4)}`, 16);\n\t\tresult[3] = parseInt(`0x${in_guid.substr(28, 8)}`, 16);\n\t}\n\treturn result;\n};\n\n/*\n Convert base64 GUID into base16.\n \n @param in_guid - Base64 GUID to convert\n * @returns Base16 GUID\n \n /\nconst base64Tobase16 = (in_guid: string) => uint32x4ToGUID(guidToUint32x4(in_guid));\n\n/*\n Convert base16 into base64 GUID.\n \n @param in_guid - Base16 GUID to convert\n * @returns Base64 GUID\n \n /\nconst base16ToBase64 = (in_guid: string) => uint32x4ToGUID(guidToUint32x4(in_guid), true);\n\n/*\n Based on the boolean parameter generate either\n * a 128 bit base16 GUID with the following format: xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxx\n * or url-friendly base64 string GUID of length 22\n \n This function is not thread safe!\n \n @param base64 - Use base64 encoding instead of standart guids\n \n @returns The GUID\n /\nconst generateGUID = function (base64 = false): string {\n\tconst rnds = new Uint32Array(4);\n\n\t// Random numbers for GUID (4x32 bit)\n\trnds[0] = guidRNG.genRandUInt32();\n\trnds[1] = guidRNG.genRandUInt32();\n\trnds[2] = guidRNG.genRandUInt32();\n\trnds[3] = guidRNG.genRandUInt32();\n\treturn uint32x4ToGUID(rnds, base64);\n};\n\n// The last character is checked this way because last 4 bits of 22nd character are ignored\n// by decoder, e.g. \"+Q\" and \"+Z\" result in the same decoding.\n// The only characters with last 4 bits set to 0 are A, Q, g, w.\nconst reBase64 = /^[\\w-]{21}[AQgw]$/;\n// eslint-disable-next-line unicorn/no-unsafe-regex\nconst reBase16 = /^[\\dA-Fa-f]{8}(?:-[\\dA-Fa-f]{4}){3}-[\\dA-Fa-f]{12}$/;\n\n/\n Routine used to check whether the given string is a valid GUID\n \n @param in_guid - The GUID to test.\n * @returns True if the parameter is a valid GUID, false otherwise.\n /\nconst isGUID = (in_guid: string) => reBase16.test(in_guid) \|\| reBase64.test(in_guid);\n\n/\n Performs a hash combination operation on the two supplied Uint32 arrays of length 4 (using\n * a variant of the algorithm from boost::hash_combine\n \n @param in_array1 - First array\n * @param in_array2 - Second array\n * @returns New combined hash\n /\nconst hashCombine4xUint32 = function (\n\tin_array1: Uint32Array,\n\tin_array2: Uint32Array,\n\tio_result?: Uint32Array,\n): Uint32Array {\n\tlet accumulated = io_result;\n\tif (accumulated === undefined) {\n\t\taccumulated = new Uint32Array(in_array2);\n\t} else {\n\t\taccumulated[0] = in_array2[0];\n\t\taccumulated[1] = in_array2[1];\n\t\taccumulated[2] = in_array2[2];\n\t\taccumulated[3] = in_array2[3];\n\t}\n\n\taccumulated[0] += 0x9e3779b9;\n\taccumulated[1] += 0x638f227;\n\taccumulated[2] += 0x1aff2bad;\n\taccumulated[3] += 0x3a8f05c5;\n\n\taccumulated[0] += in_array1[3] << 6;\n\taccumulated[1] += in_array1[0] << 6;\n\taccumulated[2] += in_array1[1] << 6;\n\taccumulated[3] += in_array1[2] << 6;\n\n\taccumulated[0] += in_array1[2] >> 2;\n\taccumulated[1] += in_array1[3] >> 2;\n\taccumulated[2] += in_array1[0] >> 2;\n\taccumulated[3] += in_array1[1] >> 2;\n\n\taccumulated[0] = ((accumulated[0] ^ in_array1[1]) UINT_32HASH_PRIME) >>> 0;\n\taccumulated[1] = ((accumulated[1] ^ in_array1[2]) * UINT_32HASH_PRIME) >>> 0;\n\taccumulated[2] = ((accumulated[2] ^ in_array1[3]) * UINT_32HASH_PRIME) >>> 0;\n\taccumulated[3] = ((accumulated[3] ^ in_array1[0]) * UINT_32HASH_PRIME) >>> 0;\n\n\treturn accumulated;\n};\n\n/*\n Takes two guids and generates a new derived GUID.\n \n @remarks Note: You should only use this helper function when you need only one combination.\n * Otherwise, it is more efficient to work on the uint8 arrays directly.\n \n @param in_guid1 - Input GUID\n * @param in_guid2 - Input GUID\n * @param base64 - Use base64 encoding instead of standart GUIDs\n * @returns Combined GUID\n */\nconst combineGuids = function (in_guid1: string, in_guid2: string, base64 = false): string {\n\tconst firstArray = guidToUint32x4(in_guid1);\n\tconst secondArray = guidToUint32x4(in_guid2);\n\tconst combined = hashCombine4xUint32(firstArray, secondArray);\n\treturn uint32x4ToGUID(combined, base64);\n};\n\n// Make sure the RNG is initialized\nguidRNG.initialize();\n\nconst initializeGUIDGenerator = (...args) => {\n\tguidRNG.initialize(...args);\n};\n\nexport const GuidUtils = {\n\tuint32x4ToGUID,\n\tguidToUint32x4,\n\tbase64Tobase16,\n\tbase16ToBase64,\n\tinitializeGUIDGenerator,\n\tgenerateGUID,\n\tisGUID,\n\tcombineGuids,\n\thashCombine4xUint32,\n};\n"]}
1	+ {"version":3,"file":"guidUtils.js","sourceRoot":"","sources":["../src/guidUtils.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;AAEH,+BAA+B;AAE/B;;GAEG;AAEH,0DAAiC;AACjC,8DAAkE;AAClE,MAAM,iBAAiB,GAAG,QAAQ,CAAC;AAEnC;;;;;;GAMG;AACH,MAAM,OAAO,GAAG;IACf,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,aAAa,EAAE,KAAK;IAEpB;;;;;;;;;;;;OAYG;IACH,UAAU,CAAC,OAAgB,EAAE,6BAAsC,KAAK;QACvE,6DAA6D;QAC7D,sDAAsD;QACtD,IAAI,IAAI,CAAC,aAAa,IAAI,CAAC,0BAA0B,EAAE;YACtD,OAAO,CAAC,CAAC;SACT;aAAM;YACN,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;YAE1B,IAAI,OAAO,KAAK,SAAS,EAAE;gBAC1B,MAAM,YAAY,GAAG,IAAA,8CAAyB,EAAC,CAAC,CAAC,CAAC;gBAClD,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,CAAC,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;aAC1B;iBAAM;gBACN,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;gBACnB,IAAI,CAAC,EAAE,GAAG,SAAS,CAAC;gBACpB,IAAI,CAAC,EAAE,GAAG,SAAS,CAAC;gBAEpB,IAAI,CAAC,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC;gBAC1B,IAAI,CAAC,aAAa,EAAE,CAAC;gBACrB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBAChB,IAAI,CAAC,aAAa,EAAE,CAAC;aACrB;YACD,OAAO,CAAC,CAAC,CAAC;SACV;IACF,CAAC;IAED;;OAEG;IACH,aAAa;QACZ,IAAI,CAAC,CAAC,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,UAAU,CAAC;QAC1D,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAEzC,IAAI,CAAC,EAAE,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACtE,IAAI,CAAC,EAAE,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAEtE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/B,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEZ,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAClC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACZ,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC7D,CAAC;CACD,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC;AAE/D;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,CAAS,EAAE,CAAS;IAC5C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,CAAC,MAAM,CAAC,CAAC;IACT,CAAC,MAAM,CAAC,CAAC;IACT,MAAM,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC;IACvB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAClD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,GAAG,CAAC,MAAc,EAAU,EAAE,CAC9C,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAE9D;;;;;;GAMG;AACH,MAAM,cAAc,GAAG,UAAU,CAAS;IACzC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC;AACf,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,cAAc,GAAG,UACtB,YAAiD,EACjD,SAAkB,KAAK;IAEvB,IAAI,MAAM,EAAE;QACX,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,YAAY,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,UAAU,GAAG,mBAAQ,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACrD,6BAA6B;QAC7B,OAAO,WAAW,CAAC,UAAU,CAAC,CAAC;KAC/B;SAAM;QACN,gCAAgC;QAChC,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC3B,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACzC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC;SACxC;QACD,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAChF,EAAE,EACF,CAAC,CACD,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;KAC1B;AACF,CAAC,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,cAAc,GAAG,UACtB,OAAe,EACf,SAAsB,IAAI,WAAW,CAAC,CAAC,CAAC;IAExC,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE;QACtB,MAAM,IAAI,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;KACrB;SAAM;QACN,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtD,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9E,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;KACvD;IACD,OAAO,MAAM,CAAC;AACf,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,cAAc,GAAG,CAAC,OAAe,EAAE,EAAE,CAAC,cAAc,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;AAEpF;;;;;;GAMG;AACH,MAAM,cAAc,GAAG,CAAC,OAAe,EAAE,EAAE,CAAC,cAAc,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC;AAE1F;;;;;;;;;;GAUG;AACH,MAAM,YAAY,GAAG,UAAU,MAAM,GAAG,KAAK;IAC5C,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAEhC,qCAAqC;IACrC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAClC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAClC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAClC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAClC,OAAO,cAAc,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AACrC,CAAC,CAAC;AAEF,2FAA2F;AAC3F,8DAA8D;AAC9D,gEAAgE;AAChE,MAAM,QAAQ,GAAG,mBAAmB,CAAC;AACrC,mDAAmD;AACnD,MAAM,QAAQ,GAAG,qDAAqD,CAAC;AAEvE;;;;;GAKG;AACH,MAAM,MAAM,GAAG,CAAC,OAAe,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAErF;;;;;;;GAOG;AACH,MAAM,mBAAmB,GAAG,UAC3B,SAAsB,EACtB,SAAsB,EACtB,SAAuB;IAEvB,IAAI,WAAW,GAAG,SAAS,CAAC;IAC5B,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,WAAW,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;KACzC;SAAM;QACN,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;KAC9B;IAED,WAAW,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC;IAC7B,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;IAC5B,WAAW,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC;IAC7B,WAAW,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC;IAE7B,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAEpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAEpC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC7E,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC7E,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC7E,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE7E,OAAO,WAAW,CAAC;AACpB,CAAC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,MAAM,YAAY,GAAG,UAAU,QAAgB,EAAE,QAAgB,EAAE,MAAM,GAAG,KAAK;IAChF,MAAM,UAAU,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IAC5C,MAAM,WAAW,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;IAC9D,OAAO,cAAc,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AACzC,CAAC,CAAC;AAEF,mCAAmC;AACnC,OAAO,CAAC,UAAU,EAAE,CAAC;AAErB,MAAM,uBAAuB,GAAG,CAAC,GAAG,IAAI,EAAE,EAAE;IAC3C,OAAO,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,CAAC;AAC7B,CAAC,CAAC;AAEW,QAAA,SAAS,GAAG;IACxB,cAAc;IACd,cAAc;IACd,cAAc;IACd,cAAc;IACd,uBAAuB;IACvB,YAAY;IACZ,MAAM;IACN,YAAY;IACZ,mBAAmB;CACnB,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\n/ eslint-disable no-bitwise /\n\n/\n @fileoverview Utility functions related to handling GUIDs\n /\n\nimport base64js from \"base64-js\";\nimport { generateRandomUInt32Array } from \"../platform-dependent\";\nconst UINT_32HASH_PRIME = 16777619;\n\n/\n Fast high quality 32 bit RNG for consistent GUID.\n \n Good \"randomness\" (distribution); Period is approximately equal to 3.1110^37\n Implementation was take from \"Numerical recipes. The Art of Scientific Computing.\", 3rd edition.\n * Page 357, algorithm name: Ranlim32\n /\nconst guidRNG = {\n\tu: 0,\n\tv: 0,\n\tw1: 0,\n\tw2: 0,\n\tisInitialized: false,\n\n\t/\n\t Initialize RNG.\n\t * This function need to be called once, before the first GUID gets created.\n\t \n\t @param in_seed - Optional 32-bit seed for GUID RNG.\n\t * If no seed is given, a combination of system's local time and `Math.random()` is used.\n\t * @param in_enforceReInitialization - Optionally enforce re-initialization with another seed.\n\t \n\t @returns The seed used to initialize the RNG;\n\t * If re-initialization is not enforced, a zero indicates that the RNG was not re-seeded.\n\t \n\t @alias property-common.initializeGUIDGenerator\n\t /\n\tinitialize(in_seed?: number, in_enforceReInitialization: boolean = false): number {\n\t\t// Quit if the RNG has already been initialized and we do not\n\t\t// want to enforce a re-initialization with a new seed\n\t\tif (this.isInitialized && !in_enforceReInitialization) {\n\t\t\treturn 0;\n\t\t} else {\n\t\t\tthis.isInitialized = true;\n\n\t\t\tif (in_seed === undefined) {\n\t\t\t\tconst randomValues = generateRandomUInt32Array(4);\n\t\t\t\tthis.u = randomValues[0];\n\t\t\t\tthis.v = randomValues[1];\n\t\t\t\tthis.w1 = randomValues[2];\n\t\t\t\tthis.w2 = randomValues[3];\n\t\t\t} else {\n\t\t\t\tthis.v = 224461437;\n\t\t\t\tthis.w1 = 521288629;\n\t\t\t\tthis.w2 = 362436069;\n\n\t\t\t\tthis.u = in_seed ^ this.v;\n\t\t\t\tthis.genRandUInt32();\n\t\t\t\tthis.v = this.u;\n\t\t\t\tthis.genRandUInt32();\n\t\t\t}\n\t\t\treturn -1;\n\t\t}\n\t},\n\n\t/\n\t @returns 32-bit random number based on the RNGs internal state\n\t /\n\tgenRandUInt32(): number {\n\t\tthis.u = multiply_uint32(this.u, 2891336453) + 1640531513;\n\t\tthis.v ^= this.v >>> 13;\n\t\tthis.v ^= this.v << 17;\n\t\tthis.v = ((this.v >>> 5) ^ this.v) >>> 0;\n\n\t\tthis.w1 = multiply_uint32(33378, this.w1 & 0xffff) + (this.w1 >>> 16);\n\t\tthis.w2 = multiply_uint32(57225, this.w2 & 0xffff) + (this.w2 >>> 16);\n\n\t\tlet x = this.u ^ (this.u << 9);\n\t\tx ^= x >>> 17;\n\t\tx ^= x << 6;\n\n\t\tlet y = this.w1 ^ (this.w1 << 17);\n\t\ty ^= y >>> 15;\n\t\ty ^= y << 5;\n\t\treturn (((x >>> 0) + this.v) ^ ((y >>> 0) + this.w2)) >>> 0;\n\t},\n};\n\n/\n Check if GUID is base64 based on the length\n * The length of base16 GUID is 36, base64 - 22\n \n @param GUID - Input GUID\n * @returns True if GUID is base64\n /\nconst isBase64 = (GUID: string): boolean => GUID.length === 22;\n\n/\n Allows for 32-bit integer multiplication with C-like semantics\n \n @param a - unsigned int32 value\n * @param b - unsigned int32 value\n * @returns The result of the unsigned integer multiplication.\n /\nfunction multiply_uint32(a: number, b: number): number {\n\tlet n = a;\n\tlet m = b;\n\n\tn >>>= 0;\n\tm >>>= 0;\n\tconst nlo = n & 0xffff;\n\treturn ((((n - nlo) m) >>> 0) + nlo * m) >>> 0;\n}\n\n/*\n Helper function to convert base64 encoding to url friendly format\n \n @param base64 - Base64 string\n \n @returns Url-friendly base64 encoding.\n /\nconst toUrlBase64 = (base64: string): string =>\n\tbase64.replace(/\\+/g, \"-\").replace(/\\//g, \"_\").split(\"=\")[0];\n\n/\n Helper function to recover padding of base64 encoding\n \n @param x - Base64 string\n \n @returns Padded base64 encoding.\n /\nconst toPaddedBase64 = function (x: string): string {\n\tlet base64 = x;\n\tconst padLength = 4 - (base64.length % 4);\n\tbase64 += \"=\".repeat(padLength);\n\treturn base64;\n};\n\n/\n Helper function to create a GUID string from an array with 32Bit values\n \n @param in_guidArray - Array with the 32 bit values\n * @param base64 - Use base64 encoding instead of standart guids\n \n @returns The GUID\n /\nconst uint32x4ToGUID = function (\n\tin_guidArray: Uint32Array \| Int32Array \| number[],\n\tbase64: boolean = false,\n): string {\n\tif (base64) {\n\t\tconst intArray = new Uint32Array(in_guidArray);\n\t\tconst byteArray = new Uint8Array(intArray.buffer);\n\t\tconst base64guid = base64js.fromByteArray(byteArray);\n\t\t// return url-friendly base64\n\t\treturn toUrlBase64(base64guid);\n\t} else {\n\t\t// Convert to hexadecimal string\n\t\tlet str = \"\";\n\t\tfor (let i = 0; i < 4; i++) {\n\t\t\tconst hex = in_guidArray[i].toString(16);\n\t\t\tstr += \"0\".repeat(8 - hex.length) + hex;\n\t\t}\n\t\treturn `${str.substr(0, 8)}-${str.substr(8, 4)}-${str.substr(12, 4)}-${str.substr(\n\t\t\t16,\n\t\t\t4,\n\t\t)}-${str.substr(20, 12)}`;\n\t}\n};\n\n/\n Convert GUID to four 32Bit values.\n \n @param in_guid - The GUID to convert\n * @param io_result - An optional array to write the result to.\n * If no array is given, a new one gets created.\n * @returns Four 32-bit values\n \n /\nconst guidToUint32x4 = function (\n\tin_guid: string,\n\tresult: Uint32Array = new Uint32Array(4),\n): Uint32Array {\n\tif (isBase64(in_guid)) {\n\t\tconst GUID = toPaddedBase64(in_guid);\n\t\tconst bytes = base64js.toByteArray(GUID);\n\t\tconst intArray = new Uint32Array(bytes.buffer);\n\t\tresult.set(intArray);\n\t} else {\n\t\tresult[0] = parseInt(`0x${in_guid.substr(0, 8)}`, 16);\n\t\tresult[1] = parseInt(`0x${in_guid.substr(9, 4)}${in_guid.substr(14, 4)}`, 16);\n\t\tresult[2] = parseInt(`0x${in_guid.substr(19, 4)}${in_guid.substr(24, 4)}`, 16);\n\t\tresult[3] = parseInt(`0x${in_guid.substr(28, 8)}`, 16);\n\t}\n\treturn result;\n};\n\n/*\n Convert base64 GUID into base16.\n \n @param in_guid - Base64 GUID to convert\n * @returns Base16 GUID\n \n /\nconst base64Tobase16 = (in_guid: string) => uint32x4ToGUID(guidToUint32x4(in_guid));\n\n/*\n Convert base16 into base64 GUID.\n \n @param in_guid - Base16 GUID to convert\n * @returns Base64 GUID\n \n /\nconst base16ToBase64 = (in_guid: string) => uint32x4ToGUID(guidToUint32x4(in_guid), true);\n\n/*\n Based on the boolean parameter generate either\n * a 128 bit base16 GUID with the following format: xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxx\n * or url-friendly base64 string GUID of length 22\n \n This function is not thread safe!\n \n @param base64 - Use base64 encoding instead of standart guids\n \n @returns The GUID\n /\nconst generateGUID = function (base64 = false): string {\n\tconst rnds = new Uint32Array(4);\n\n\t// Random numbers for GUID (4x32 bit)\n\trnds[0] = guidRNG.genRandUInt32();\n\trnds[1] = guidRNG.genRandUInt32();\n\trnds[2] = guidRNG.genRandUInt32();\n\trnds[3] = guidRNG.genRandUInt32();\n\treturn uint32x4ToGUID(rnds, base64);\n};\n\n// The last character is checked this way because last 4 bits of 22nd character are ignored\n// by decoder, e.g. \"+Q\" and \"+Z\" result in the same decoding.\n// The only characters with last 4 bits set to 0 are A, Q, g, w.\nconst reBase64 = /^[\\w-]{21}[AQgw]$/;\n// eslint-disable-next-line unicorn/no-unsafe-regex\nconst reBase16 = /^[\\dA-Fa-f]{8}(?:-[\\dA-Fa-f]{4}){3}-[\\dA-Fa-f]{12}$/;\n\n/\n Routine used to check whether the given string is a valid GUID\n \n @param in_guid - The GUID to test.\n * @returns True if the parameter is a valid GUID, false otherwise.\n /\nconst isGUID = (in_guid: string) => reBase16.test(in_guid) \|\| reBase64.test(in_guid);\n\n/\n Performs a hash combination operation on the two supplied Uint32 arrays of length 4 (using\n * a variant of the algorithm from boost::hash_combine\n \n @param in_array1 - First array\n * @param in_array2 - Second array\n * @returns New combined hash\n /\nconst hashCombine4xUint32 = function (\n\tin_array1: Uint32Array,\n\tin_array2: Uint32Array,\n\tio_result?: Uint32Array,\n): Uint32Array {\n\tlet accumulated = io_result;\n\tif (accumulated === undefined) {\n\t\taccumulated = new Uint32Array(in_array2);\n\t} else {\n\t\taccumulated[0] = in_array2[0];\n\t\taccumulated[1] = in_array2[1];\n\t\taccumulated[2] = in_array2[2];\n\t\taccumulated[3] = in_array2[3];\n\t}\n\n\taccumulated[0] += 0x9e3779b9;\n\taccumulated[1] += 0x638f227;\n\taccumulated[2] += 0x1aff2bad;\n\taccumulated[3] += 0x3a8f05c5;\n\n\taccumulated[0] += in_array1[3] << 6;\n\taccumulated[1] += in_array1[0] << 6;\n\taccumulated[2] += in_array1[1] << 6;\n\taccumulated[3] += in_array1[2] << 6;\n\n\taccumulated[0] += in_array1[2] >> 2;\n\taccumulated[1] += in_array1[3] >> 2;\n\taccumulated[2] += in_array1[0] >> 2;\n\taccumulated[3] += in_array1[1] >> 2;\n\n\taccumulated[0] = ((accumulated[0] ^ in_array1[1]) UINT_32HASH_PRIME) >>> 0;\n\taccumulated[1] = ((accumulated[1] ^ in_array1[2]) * UINT_32HASH_PRIME) >>> 0;\n\taccumulated[2] = ((accumulated[2] ^ in_array1[3]) * UINT_32HASH_PRIME) >>> 0;\n\taccumulated[3] = ((accumulated[3] ^ in_array1[0]) * UINT_32HASH_PRIME) >>> 0;\n\n\treturn accumulated;\n};\n\n/*\n Takes two guids and generates a new derived GUID.\n \n @remarks Note: You should only use this helper function when you need only one combination.\n * Otherwise, it is more efficient to work on the uint8 arrays directly.\n \n @param in_guid1 - Input GUID\n * @param in_guid2 - Input GUID\n * @param base64 - Use base64 encoding instead of standart GUIDs\n * @returns Combined GUID\n */\nconst combineGuids = function (in_guid1: string, in_guid2: string, base64 = false): string {\n\tconst firstArray = guidToUint32x4(in_guid1);\n\tconst secondArray = guidToUint32x4(in_guid2);\n\tconst combined = hashCombine4xUint32(firstArray, secondArray);\n\treturn uint32x4ToGUID(combined, base64);\n};\n\n// Make sure the RNG is initialized\nguidRNG.initialize();\n\nconst initializeGUIDGenerator = (...args) => {\n\tguidRNG.initialize(...args);\n};\n\nexport const GuidUtils = {\n\tuint32x4ToGUID,\n\tguidToUint32x4,\n\tbase64Tobase16,\n\tbase16ToBase64,\n\tinitializeGUIDGenerator,\n\tgenerateGUID,\n\tisGUID,\n\tcombineGuids,\n\thashCombine4xUint32,\n};\n"]}

package/lib/constants.d.ts CHANGED Viewed

@@ -145,6 +145,7 @@ export declare const constants: {
          * Your property template should include a typeid attribute.
          *
          * @example
+         *
          *```json
          * {
          *  "typeid": "my.example:point2d-1.0.0",
@@ -161,7 +162,9 @@ export declare const constants: {
          *
          * Typeid should contain a template version number.
          *
-         * @example “typeid: my.example:point2d-1.0.0”
+         * @example
+         *
+         * “typeid: my.example:point2d-1.0.0”
          */
         MISSING_VERSION: string;
         /**
@@ -308,6 +311,7 @@ export declare const constants: {
          * When using ‘inherits’ in your property template, it must be a string or an array.
          *
          * @example
+         *
          * ```json
          * {
          * typeid:'my.example:point2d-1.0.0',
@@ -471,6 +475,7 @@ export declare const constants: {
          * You need a ‘typeid’ field in your template schema.
          *
          * @example
+         *
          * ```json
          * {
          *   ‘typeid’: 'autodesk.test:set.set-1.0.0',
@@ -496,6 +501,7 @@ export declare const constants: {
          * Each entry in your enum property array must have an id.
          *
          * @example
+         *
          * ```json
          * {
          *   "typeid": "Adsk.Core:Units.Metric-1.0.0",
@@ -516,6 +522,7 @@ export declare const constants: {
          * Each entry in your enum property must have a value that is a number.
          *
          * @example
+         *
          * ```json
          * {
          *   "typeid": "Adsk.Core:Units.Metric-1.0.0",
@@ -871,6 +878,7 @@ export declare const constants: {
          * Workspace.get and Property.get take in an id (string or number) or an array of ids.
          *
          * @example
+         *
          * ```typescript
          *.get(‘position’).get(‘x’) or .get([‘property’, ‘x’])
          * ```
@@ -1236,12 +1244,14 @@ export declare const constants: {
          * The token DEREFERENCE_TOKEN should only be used with .get when the in_ids passed to .get is an array.
          * the DEREFERENCE_TOKEN should follow a path to a reference.
          *
-         * @example Valid:
+         * @example Valid
+         *
          * ```typescript
          * myProp.get(['myReference', TOKENS.DEREFERENCE_TOKEN])
          * ```
          *
-         * @example Not valid:
+         * @example Not valid
+         *
          * ```typescript
          * myProp.get('myReference').get(TOKENS.DEREFERENCE_TOKEN)
          * ```

package/lib/constants.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"constants.d.ts","sourceRoot":"","sources":["../src/constants.ts"],"names":[],"mappings":"AAAA;;;GAGG;~~AA0rDH~~,eAAO,MAAM,SAAS;;QA1LrB;;WAEG;;QAGH;;WAEG;;~~QAn4CH~~;;WAEG;;;~~QAk6CH~~;;;;;WAKG;;QAGH;;WAEG;;QAIH;;WAEG;;QAGH;;;WAGG;;QAGH;;;WAGG;;QAGH;;;WAGG;;QAGH;;;WAGG;;QAKH;;WAEG;;QAGH;;WAEG;;QAIH;;WAEG;;QAIH;;WAEG;;QAIH;;WAEG;;QAIH;;WAEG;;QAIH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QAIH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;~~QAlqDH~~;;;;;;;;WAQG;;QAIH;;;;;WAKG;;QAGH;;;;WAIG;;QAGH~~;;;;;;;;;;;;;;;WAeG~~;;QAIH~~;;;;;;WAMG~~;;QAGH;;;;;;;;;;;WAWG;;QAGH;;;;;;;WAOG;;QAIH;;;;WAIG;;QAGH;;;;WAIG;;QAIH;;WAEG;;QAGH;;;;WAIG;;QAIH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;~~QAs0CH~~;;;;;WAKG;;QAGH;;;;;WAKG;;QAIH;;;;;WAKG;;QAGH;;WAEG;;QAGH;;WAEG;;QAGH;;;;WAIG;;QAGH;;;WAGG;;QAGH;;WAEG;;QAGH;;WAEG;;~~QA1fH~~;;;;;;WAMG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;QAGH;;;;WAIG;;QAIH~~;;;;;;;;;;;;;;;;;;;;;WAqBG~~;;QAIH;;;;WAIG;;QAGH;;;;;;WAMG;;QAGH;;;;;;WAMG;;QAIH;;;;;WAKG;;QAKH;;;;WAIG;;QAGH;;;;;;;WAOG;;QAGH;;;;WAIG;;QAGH;;;;WAIG;;QAIH;;;;WAIG;;QAGH;;;;;;WAMG;;QAIH;;;;WAIG;;QAGH;;;;WAIG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;;QAKH;;WAEG;;QAIH;;WAEG;;QAIH;;WAEG;;QAGH;;;;;WAKG;;QAGH;;;;WAIG;;QAGH;;;;WAIG;;QAGH;;;;WAIG;;QAGH~~;;;;;;;;;;;;;;;;;WAiBG~~;;QAKH;;;;WAIG;;QAGH~~;;;;;;;;;;;;;;;;;;WAkBG~~;;QAGH~~;;;;;;;;;;;;;;;;;;WAkBG~~;;QAGH;;;;;;;WAOG;;QAGH;;;;;;WAMG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAGH;;;;;WAKG;;;QAOH;;;;;WAKG;;QAIH;;;;;WAKG;;QAIH;;;;WAIG;;QAGH;;;;WAIG;;QAIH;;;;WAIG;;QAGH;;;;;WAKG;;QAIH;;;;;WAKG;;QAKH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;WAEG;;;~~QAnzCH~~;;;;WAIG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAIH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;QAIH;;;;;;WAMG;;QAGH;;;;;;WAMG;;QAKH;;;;WAIG;;QAGH;;;;WAIG;;QAKH;;;;;;WAMG;;QAGH;;;;;;WAMG;;QAKH;;;;WAIG;;QAGH;;;;WAIG;;QAKH;;WAEG;;QAGH;;;;;WAKG;;QAIH;;;;;;;;;;;;;;;WAeG;;QAGH;;;;;;WAMG;;QAGH;;;;;;WAMG;;QAIH;;;;WAIG;;QAIH;;;;;;WAMG;;QAKH;;WAEG;;QAGH;;;;WAIG;;QAIH;;;;;;;;;;;WAWG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;QAGH~~;;;;;;;;;WASG~~;;QAIH;;;;WAIG;;QAGH;;;;;WAKG;;QAKH;;;;;WAKG;;QAKH;;;;WAIG;;QAIH;;;;;;;;;;WAUG;;QAGH;;;;WAIG;;QAIH;;;;;;WAMG;;QAGH;;;;WAIG;;QAKH;;;;WAIG;;QAKH;;;;WAIG;;QAKH;;;;;WAKG;;QAIH;;;;;WAKG;;QAKH;;;;;;WAMG;;QAKH;;;;;WAKG;;QAKH;;;;WAIG;;QAKH;;;;;WAKG;;QAIH;;;;;WAKG;;QAKH;;;;;;;;;WASG;;QAKH;;;;;;;;;WASG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAMH;;;;WAIG;;QAKH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAGH;;;;;;;WAOG;;QAGH;;;;;;WAMG;;QAIH;;;;;WAKG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAIH;;WAEG;;QAIH;;;;;WAKG;;QAGH;;;;WAIG;;QAGH;;;;;;WAMG;;QAIH;;;;;;WAMG;;QAGH;;;;WAIG;;QAGH;;;;;;WAMG;;QAIH;;;;;WAKG;;QAIH;;;;;;WAMG;;QAGH;;;;;WAKG;;QAKH;;WAEG;;QAIH;;;;;WAKG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAGH;;;;;;;WAOG;;QAGH;;;;;;WAMG;;QAIH~~;;;;;;;;;;;;;;;WAeG~~;;QAGH;;;;;WAKG;;QAGH;;;;;;;;WAQG;;QAGH;;;;;WAKG;;QAIH;;;;;;WAMG;;QAIH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;;;;WAKG;;QAGH;;;;WAIG;;QAIH;;;;WAIG;;QAGH;;;;WAIG;;;QAKH;;;;WAIG;;QAGH;;;;;;WAMG;;QAIH;;;;;;;WAOG;;;;~~QAqhBH~~;;WAEG;;QAGH;;WAEG;;QAGH;;;WAGG;;;;;;;CAoKH,CAAC"}
1	+ {"version":3,"file":"constants.d.ts","sourceRoot":"","sources":["../src/constants.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAosDH,eAAO,MAAM,SAAS;;QA1LrB;;WAEG;;QAGH;;WAEG;;QA14CH;;WAEG;;;QAy6CH;;;;;WAKG;;QAGH;;WAEG;;QAIH;;WAEG;;QAGH;;;WAGG;;QAGH;;;WAGG;;QAGH;;;WAGG;;QAGH;;;WAGG;;QAKH;;WAEG;;QAGH;;WAEG;;QAIH;;WAEG;;QAIH;;WAEG;;QAIH;;WAEG;;QAIH;;WAEG;;QAIH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QAIH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QA5qDH;;;;;;;;WAQG;;QAIH;;;;;WAKG;;QAGH;;;;WAIG;;QAGH;;;;;;;;;;;;;;;;WAgBG;;QAIH;;;;;;;;WAQG;;QAGH;;;;;;;;;;;WAWG;;QAGH;;;;;;;WAOG;;QAIH;;;;WAIG;;QAGH;;;;WAIG;;QAIH;;WAEG;;QAGH;;;;WAIG;;QAIH;;WAEG;;QAGH;;WAEG;;QAGH;;WAEG;;QA60CH;;;;;WAKG;;QAGH;;;;;WAKG;;QAIH;;;;;WAKG;;QAGH;;WAEG;;QAGH;;WAEG;;QAGH;;;;WAIG;;QAGH;;;WAGG;;QAGH;;WAEG;;QAGH;;WAEG;;QA9fH;;;;;;WAMG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;QAGH;;;;WAIG;;QAIH;;;;;;;;;;;;;;;;;;;;;;WAsBG;;QAIH;;;;WAIG;;QAGH;;;;;;WAMG;;QAGH;;;;;;WAMG;;QAIH;;;;;WAKG;;QAKH;;;;WAIG;;QAGH;;;;;;;WAOG;;QAGH;;;;WAIG;;QAGH;;;;WAIG;;QAIH;;;;WAIG;;QAGH;;;;;;WAMG;;QAIH;;;;WAIG;;QAGH;;;;WAIG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;;QAKH;;WAEG;;QAIH;;WAEG;;QAIH;;WAEG;;QAGH;;;;;WAKG;;QAGH;;;;WAIG;;QAGH;;;;WAIG;;QAGH;;;;WAIG;;QAGH;;;;;;;;;;;;;;;;;;WAkBG;;QAKH;;;;WAIG;;QAGH;;;;;;;;;;;;;;;;;;;WAmBG;;QAGH;;;;;;;;;;;;;;;;;;;WAmBG;;QAGH;;;;;;;WAOG;;QAGH;;;;;;WAMG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAGH;;;;;WAKG;;;QAOH;;;;;WAKG;;QAIH;;;;;WAKG;;QAIH;;;;WAIG;;QAGH;;;;WAIG;;QAIH;;;;WAIG;;QAGH;;;;;WAKG;;QAIH;;;;;WAKG;;QAKH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;WAEG;;;QA1zCH;;;;WAIG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAIH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;QAIH;;;;;;WAMG;;QAGH;;;;;;WAMG;;QAKH;;;;WAIG;;QAGH;;;;WAIG;;QAKH;;;;;;WAMG;;QAGH;;;;;;WAMG;;QAKH;;;;WAIG;;QAGH;;;;WAIG;;QAKH;;WAEG;;QAGH;;;;;WAKG;;QAIH;;;;;;;;;;;;;;;WAeG;;QAGH;;;;;;WAMG;;QAGH;;;;;;WAMG;;QAIH;;;;WAIG;;QAIH;;;;;;WAMG;;QAKH;;WAEG;;QAGH;;;;WAIG;;QAIH;;;;;;;;;;;WAWG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;QAGH;;;;;;;;;;WAUG;;QAIH;;;;WAIG;;QAGH;;;;;WAKG;;QAKH;;;;;WAKG;;QAKH;;;;WAIG;;QAIH;;;;;;;;;;WAUG;;QAGH;;;;WAIG;;QAIH;;;;;;WAMG;;QAGH;;;;WAIG;;QAKH;;;;WAIG;;QAKH;;;;WAIG;;QAKH;;;;;WAKG;;QAIH;;;;;WAKG;;QAKH;;;;;;WAMG;;QAKH;;;;;WAKG;;QAKH;;;;WAIG;;QAKH;;;;;WAKG;;QAIH;;;;;WAKG;;QAKH;;;;;;;;;WASG;;QAKH;;;;;;;;;WASG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAMH;;;;WAIG;;QAKH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAGH;;;;;;;WAOG;;QAGH;;;;;;WAMG;;QAIH;;;;;WAKG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAGH;;;;WAIG;;QAGH;;;;;WAKG;;QAIH;;WAEG;;QAIH;;;;;WAKG;;QAGH;;;;WAIG;;QAGH;;;;;;WAMG;;QAIH;;;;;;WAMG;;QAGH;;;;WAIG;;QAGH;;;;;;WAMG;;QAIH;;;;;WAKG;;QAIH;;;;;;WAMG;;QAGH;;;;;WAKG;;QAKH;;WAEG;;QAIH;;;;;WAKG;;QAGH;;;;;WAKG;;QAGH;;;;;;WAMG;;QAGH;;;;;;;WAOG;;QAGH;;;;;;WAMG;;QAIH;;;;;;;;;;;;;;;;;WAiBG;;QAGH;;;;;WAKG;;QAGH;;;;;;;;WAQG;;QAGH;;;;;WAKG;;QAIH;;;;;;WAMG;;QAIH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;;;WAIG;;QAIH;;;;;WAKG;;QAGH;;;;WAIG;;QAIH;;;;WAIG;;QAGH;;;;WAIG;;;QAKH;;;;WAIG;;QAGH;;;;;;WAMG;;QAIH;;;;;;;WAOG;;;;QAyhBH;;WAEG;;QAGH;;WAEG;;QAGH;;;WAGG;;;;;;;CAoKH,CAAC"}

package/lib/constants.js CHANGED Viewed

@@ -35,6 +35,7 @@ const SchemaValidatorError = {
      * Your property template should include a typeid attribute.
      *
      * @example
+     *
      *```json
      * {
      *  "typeid": "my.example:point2d-1.0.0",
@@ -51,7 +52,9 @@ const SchemaValidatorError = {
      *
      * Typeid should contain a template version number.
      *
-     * @example “typeid: my.example:point2d-1.0.0”
+     * @example
+     *
+     * “typeid: my.example:point2d-1.0.0”
      */
     MISSING_VERSION: "SV-005: Missing template version in 'typeid' attribute: ",
     /**
@@ -350,6 +353,7 @@ const PropertyError = {
      * Workspace.get and Property.get take in an id (string or number) or an array of ids.
      *
      * @example
+     *
      * ```typescript
      *.get(‘position’).get(‘x’) or .get([‘property’, ‘x’])
      * ```
@@ -730,12 +734,14 @@ const PropertyError = {
      * The token DEREFERENCE_TOKEN should only be used with .get when the in_ids passed to .get is an array.
      * the DEREFERENCE_TOKEN should follow a path to a reference.
      *
-     * @example Valid:
+     * @example Valid
+     *
      * ```typescript
      * myProp.get(['myReference', TOKENS.DEREFERENCE_TOKEN])
      * ```
      *
-     * @example Not valid:
+     * @example Not valid
+     *
      * ```typescript
      * myProp.get('myReference').get(TOKENS.DEREFERENCE_TOKEN)
      * ```
@@ -896,6 +902,7 @@ const PropertyFactoryError = {
      * When using ‘inherits’ in your property template, it must be a string or an array.
      *
      * @example
+     *
      * ```json
      * {
      * typeid:'my.example:point2d-1.0.0',
@@ -1060,6 +1067,7 @@ const PropertyFactoryError = {
      * You need a ‘typeid’ field in your template schema.
      *
      * @example
+     *
      * ```json
      * {
      *   ‘typeid’: 'autodesk.test:set.set-1.0.0',
@@ -1086,6 +1094,7 @@ const PropertyFactoryError = {
      * Each entry in your enum property array must have an id.
      *
      * @example
+     *
      * ```json
      * {
      *   "typeid": "Adsk.Core:Units.Metric-1.0.0",
@@ -1106,6 +1115,7 @@ const PropertyFactoryError = {
      * Each entry in your enum property must have a value that is a number.
      *
      * @example
+     *
      * ```json
      * {
      *   "typeid": "Adsk.Core:Units.Metric-1.0.0",