@fluid-experimental/property-common 0.49.0 → 0.50.0-41540

package/lib/guidUtils.js

@@ -0,0 +1,297 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/* eslint-disable no-bitwise */
+/**
+ * @fileoverview Utility functions related to handling GUIDs
+ */
+import base64js from "base64-js";
+import { generateRandomUInt32Array } from "../platform-dependent";
+const UINT_32HASH_PRIME = 16777619;
+/**
+ * Fast high quality 32 bit RNG for consistent guid.
+ *
+ * Good "randomness" (distribution); Period is approximately equal to  3.11*10^37
+ * Implementation was take from "Numerical recipes. The Art of Scientific Computing.", 3rd edition.
+ * Page 357, algorithm name: Ranlim32
+ *
+ */
+const guidRNG = {
+    u: 0,
+    v: 0,
+    w1: 0,
+    w2: 0,
+    isInitialized: false,
+    /**
+     * Initialize RNG.
+     * This function need to be called once, before the first guid gets created.
+     *
+     * @param in_seed - Optional 32-bit seed for guid RNG;
+     *                           If no seed is given, a combination of system's
+     *                           local time and Math.random() is used.
+     * @param in_enforceReInitialization - Optionally enforce re-initialization with another seed
+     *
+     * @returns  The seed used to initialize the RNG;
+     *          If re-initialization is not enforced,
+     *          a zero indicates that the RNG was not re-seeded.
+     * @alias property-common.initializeGUIDGenerator
+     */
+    initialize(in_seed, in_enforceReInitialization = false) {
+        // Quit if the RNG has already been initialized and we do not
+        // want to enforce a re-initialization with a new seed
+        if (this.isInitialized && !in_enforceReInitialization) {
+            return 0;
+        }
+        else {
+            this.isInitialized = true;
+            if (in_seed === undefined) {
+                const randomValues = generateRandomUInt32Array(4);
+                this.u = randomValues[0];
+                this.v = randomValues[1];
+                this.w1 = randomValues[2];
+                this.w2 = randomValues[3];
+            }
+            else {
+                this.v = 224461437;
+                this.w1 = 521288629;
+                this.w2 = 362436069;
+                this.u = in_seed ^ this.v;
+                this.genRandUInt32();
+                this.v = this.u;
+                this.genRandUInt32();
+            }
+            return -1;
+        }
+    },
+    /**
+     * @returns 32-bit random number based on the RNGs internal state
+     */
+    genRandUInt32() {
+        this.u = multiply_uint32(this.u, 2891336453) + 1640531513;
+        this.v ^= this.v >>> 13;
+        this.v ^= this.v << 17;
+        this.v = ((this.v >>> 5) ^ this.v) >>> 0;
+        this.w1 = multiply_uint32(33378, (this.w1 & 0xffff)) + (this.w1 >>> 16);
+        this.w2 = multiply_uint32(57225, (this.w2 & 0xffff)) + (this.w2 >>> 16);
+        let x = this.u ^ (this.u << 9);
+        x ^= x >>> 17;
+        x ^= x << 6;
+        let y = this.w1 ^ (this.w1 << 17);
+        y ^= y >>> 15;
+        y ^= y << 5;
+        return (((x >>> 0) + this.v) ^ ((y >>> 0) + this.w2)) >>> 0;
+    },
+};
+/**
+ * Check if guid is base64 based on the length
+ * The length of base16 guid is 36, base64 - 22
+ *
+ * @param guid - Input guid
+ * @returns True if guid is base64
+ */
+const isBase64 = (guid) => guid.length === 22;
+/**
+ * Allows for 32-bit integer multiplication with C-like semantics
+ *
+ * @param a - unsigned int32 value
+ * @param b - unsigned int32 value
+ * @returns - result of unsigned integer multiplication
+ */
+function multiply_uint32(a, b) {
+    let n = a;
+    let m = b;
+    n >>>= 0;
+    m >>>= 0;
+    const nlo = n & 0xffff;
+    return (((n - nlo) * m >>> 0) + (nlo * m)) >>> 0;
+}
+/**
+ * Helper function to convert base64 encoding to url friendly format
+ *
+ * @param base64 - Base64 string
+ *
+ * @returns Url-friendly base64 encoding.
+ */
+const toUrlBase64 = (base64) => base64.replace(/\+/g, "-").replace(/\//g, "_").split("=")[0];
+/**
+ * Helper function to recover padding of base64 encoding
+ *
+ * @param x - Base64 string
+ *
+ * @returns Padded base64 encoding.
+ */
+const toPaddedBase64 = function (x) {
+    let base64 = x;
+    const padLength = 4 - base64.length % 4;
+    base64 += "=".repeat(padLength);
+    return base64;
+};
+/**
+ * Helper function to create a guid string from an array with 32Bit values
+ *
+ * @param in_guidArray - Array with the 32 bit values
+ * @param base64 - Use base64 encoding instead of standart guids
+ *
+ * @returns The guid
+ */
+const uint32x4ToGUID = function (in_guidArray, base64 = false) {
+    if (base64) {
+        const intArray = new Uint32Array(in_guidArray);
+        const byteArray = new Uint8Array(intArray.buffer);
+        const base64guid = base64js.fromByteArray(byteArray);
+        // return url-friendly base64
+        return toUrlBase64(base64guid);
+    }
+    else {
+        // Convert to hexadecimal string
+        let str = "";
+        for (let i = 0; i < 4; i++) {
+            const hex = in_guidArray[i].toString(16);
+            str += ("0".repeat(8 - hex.length) + hex);
+        }
+        // eslint-disable-next-line max-len
+        return `${str.substr(0, 8)}-${str.substr(8, 4)}-${str.substr(12, 4)}-${str.substr(16, 4)}-${str.substr(20, 12)}`;
+    }
+};
+/**
+ * Convert guid to four 32Bit values.
+ *
+ * @param in_guid - The guid to convert
+ * @param io_result - An optional array to write the result to;
+ *                                If no array is given, a new one gets created
+ * @returns Four 32-bit values
+ *
+ */
+const guidToUint32x4 = function (in_guid, result = new Uint32Array(4)) {
+    if (isBase64(in_guid)) {
+        const guid = toPaddedBase64(in_guid);
+        const bytes = base64js.toByteArray(guid);
+        const intArray = new Uint32Array(bytes.buffer);
+        result.set(intArray);
+    }
+    else {
+        result[0] = parseInt(`0x${in_guid.substr(0, 8)}`, 16);
+        result[1] = parseInt(`0x${in_guid.substr(9, 4)}${in_guid.substr(14, 4)}`, 16);
+        result[2] = parseInt(`0x${in_guid.substr(19, 4)}${in_guid.substr(24, 4)}`, 16);
+        result[3] = parseInt(`0x${in_guid.substr(28, 8)}`, 16);
+    }
+    return result;
+};
+/**
+ * Convert base64 guid into base16.
+ *
+ * @param in_guid - Base64 guid to convert
+ * @returns Base16 guid
+ *
+ */
+const base64Tobase16 = (in_guid) => uint32x4ToGUID(guidToUint32x4(in_guid));
+/**
+ * Convert base16 into base64 guid.
+ *
+ * @param in_guid - Base16 guid to convert
+ * @returns Base64 guid
+ *
+ */
+const base16ToBase64 = (in_guid) => uint32x4ToGUID(guidToUint32x4(in_guid), true);
+/**
+ * Based on the boolean parameter generate either
+ * a 128 bit base16 guid with the following format: xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxx
+ * or url-friendly base64 string guid of length 22
+ *
+ * This function is *not* thread safe!
+ *
+ * @param base64 - Use base64 encoding instead of standart guids
+ *
+ * @returns The guid
+ */
+const generateGUID = function (base64 = false) {
+    const rnds = new Uint32Array(4);
+    // Random numbers for guid (4x32 bit)
+    rnds[0] = guidRNG.genRandUInt32();
+    rnds[1] = guidRNG.genRandUInt32();
+    rnds[2] = guidRNG.genRandUInt32();
+    rnds[3] = guidRNG.genRandUInt32();
+    return uint32x4ToGUID(rnds, base64);
+};
+// The last character is checked this way because last 4 bits of 22nd character are ignored
+// by decoder, e.g. "+Q" and "+Z" result in the same decoding.
+// The only characters with last 4 bits set to 0 are A, Q, g, w.
+const reBase64 = (/^[\w-]{21}[AQgw]$/);
+// eslint-disable-next-line unicorn/no-unsafe-regex
+const reBase16 = (/^[\dA-Fa-f]{8}(?:-[\dA-Fa-f]{4}){3}-[\dA-Fa-f]{12}$/);
+/**
+ * Routine used to check whether the given string is a valid guid
+ *
+ * @param in_guid - The guid to test.
+ * @returns True if the parameter is a valid guid, false otherwise.
+ */
+const isGUID = (in_guid) => reBase16.test(in_guid) || reBase64.test(in_guid);
+/**
+ * Performs a hash combination operation on the two supplied Uint32 arrays of length 4 (using
+ * a variant of the algorithm from boost::hash_combine
+ *
+ * @param in_array1 - First array
+ * @param in_array2 - Second array
+ * @returns New combined hash
+ */
+const hashCombine4xUint32 = function (in_array1, in_array2, io_result) {
+    let accumulated = io_result;
+    if (accumulated === undefined) {
+        accumulated = new Uint32Array(in_array2);
+    }
+    else {
+        accumulated[0] = in_array2[0];
+        accumulated[1] = in_array2[1];
+        accumulated[2] = in_array2[2];
+        accumulated[3] = in_array2[3];
+    }
+    accumulated[0] += 0x9e3779b9;
+    accumulated[1] += 0x638f227;
+    accumulated[2] += 0x1aff2bad;
+    accumulated[3] += 0x3a8f05c5;
+    accumulated[0] += in_array1[3] << 6;
+    accumulated[1] += in_array1[0] << 6;
+    accumulated[2] += in_array1[1] << 6;
+    accumulated[3] += in_array1[2] << 6;
+    accumulated[0] += in_array1[2] >> 2;
+    accumulated[1] += in_array1[3] >> 2;
+    accumulated[2] += in_array1[0] >> 2;
+    accumulated[3] += in_array1[1] >> 2;
+    accumulated[0] = ((accumulated[0] ^ in_array1[1]) * UINT_32HASH_PRIME) >>> 0;
+    accumulated[1] = ((accumulated[1] ^ in_array1[2]) * UINT_32HASH_PRIME) >>> 0;
+    accumulated[2] = ((accumulated[2] ^ in_array1[3]) * UINT_32HASH_PRIME) >>> 0;
+    accumulated[3] = ((accumulated[3] ^ in_array1[0]) * UINT_32HASH_PRIME) >>> 0;
+    return accumulated;
+};
+/**
+ * Takes two guids and generates a new derived guid.
+ * Note: You should only use this helper function when you need only one combination.
+ *       Otherwise, it is more efficient to work on the uint8 arrays directly.
+ *
+ * @param in_guid1 - Input guid
+ * @param in_guid2 - Input guid
+ * @param base64 - Use base64 encoding instead of standart guids
+ * @returns Combined guid
+ */
+const combineGuids = function (in_guid1, in_guid2, base64 = false) {
+    const firstArray = guidToUint32x4(in_guid1);
+    const secondArray = guidToUint32x4(in_guid2);
+    const combined = hashCombine4xUint32(firstArray, secondArray);
+    return uint32x4ToGUID(combined, base64);
+};
+// Make sure the RNG is initialized
+guidRNG.initialize();
+const initializeGUIDGenerator = (...args) => { guidRNG.initialize(...args); };
+export const GuidUtils = {
+    uint32x4ToGUID,
+    guidToUint32x4,
+    base64Tobase16,
+    base16ToBase64,
+    initializeGUIDGenerator,
+    generateGUID,
+    isGUID,
+    combineGuids,
+    hashCombine4xUint32,
+};
+//# sourceMappingURL=guidUtils.js.map

package/lib/guidUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"guidUtils.js","sourceRoot":"","sources":["../src/guidUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,+BAA+B;AAE/B;;GAEG;AAEH,OAAO,QAAQ,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,yBAAyB,EAAE,MAAM,uBAAuB,CAAC;AAClE,MAAM,iBAAiB,GAAG,QAAQ,CAAC;AAEnC;;;;;;;GAOG;AACH,MAAM,OAAO,GAAG;IACZ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,aAAa,EAAE,KAAK;IAEpB;;;;;;;;;;;;;OAaG;IACH,UAAU,CAAC,OAAgB,EAAE,6BAAsC,KAAK;QACpE,6DAA6D;QAC7D,sDAAsD;QACtD,IAAI,IAAI,CAAC,aAAa,IAAI,CAAC,0BAA0B,EAAE;YACnD,OAAO,CAAC,CAAC;SACZ;aAAM;YACH,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;YAE1B,IAAI,OAAO,KAAK,SAAS,EAAE;gBACvB,MAAM,YAAY,GAAG,yBAAyB,CAAC,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;aAC7B;iBAAM;gBACH,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;aACxB;YACD,OAAO,CAAC,CAAC,CAAC;SACb;IACL,CAAC;IAED;;OAEG;IACH,aAAa;QACT,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,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACxE,IAAI,CAAC,EAAE,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAExE,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;IAChE,CAAC;CACJ,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;IACzC,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,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,GAAG,CAAC,MAAc,EAAU,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAE7G;;;;;;GAMG;AACH,MAAM,cAAc,GAAG,UAAS,CAAS;IACrC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,SAAS,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,cAAc,GAAG,UAAS,YAAiD,EAAE,SAAkB,KAAK;IACtG,IAAI,MAAM,EAAE;QACR,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,QAAQ,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACrD,6BAA6B;QAC7B,OAAO,WAAW,CAAC,UAAU,CAAC,CAAC;KAClC;SAAM;QACH,gCAAgC;QAChC,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACxB,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACzC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;SAC7C;QACD,mCAAmC;QACnC,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,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;KACpH;AACL,CAAC,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,cAAc,GAAG,UAAS,OAAe,EAAE,SAAsB,IAAI,WAAW,CAAC,CAAC,CAAC;IACrF,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE;QACnB,MAAM,IAAI,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,QAAQ,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;KACxB;SAAM;QACH,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;KAC1D;IACD,OAAO,MAAM,CAAC;AAClB,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,UAAS,MAAM,GAAG,KAAK;IACxC,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;AACxC,CAAC,CAAC;AAEF,2FAA2F;AAC3F,8DAA8D;AAC9D,gEAAgE;AAChE,MAAM,QAAQ,GAAG,CAAC,mBAAmB,CAAC,CAAC;AACvC,mDAAmD;AACnD,MAAM,QAAQ,GAAG,CAAC,qDAAqD,CAAC,CAAC;AAEzE;;;;;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,UACxB,SAAsB,EACtB,SAAsB,EACtB,SAAuB;IAEvB,IAAI,WAAW,GAAG,SAAS,CAAC;IAC5B,IAAI,WAAW,KAAK,SAAS,EAAE;QAC3B,WAAW,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;KAC5C;SAAM;QACH,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;KACjC;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;AACvB,CAAC,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,YAAY,GAAG,UAAS,QAAgB,EAAE,QAAgB,EAAE,MAAM,GAAG,KAAK;IAC5E,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;AAC5C,CAAC,CAAC;AAEF,mCAAmC;AACnC,OAAO,CAAC,UAAU,EAAE,CAAC;AAErB,MAAM,uBAAuB,GAAG,CAAC,GAAG,IAAI,EAAE,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAE9E,MAAM,CAAC,MAAM,SAAS,GAAG;IACrB,cAAc;IACd,cAAc;IACd,cAAc;IACd,cAAc;IACd,uBAAuB;IACvB,YAAY;IACZ,MAAM;IACN,YAAY;IACZ,mBAAmB;CACtB,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.11*10^37\n * Implementation was take from \"Numerical recipes. The Art of Scientific Computing.\", 3rd edition.\n * Page 357, algorithm name: Ranlim32\n *\n */\nconst guidRNG = {\n    u: 0,\n    v: 0,\n    w1: 0,\n    w2: 0,\n    isInitialized: false,\n\n    /**\n     * Initialize RNG.\n     * This function need to be called once, before the first guid gets created.\n     *\n     * @param in_seed - Optional 32-bit seed for guid RNG;\n     *                           If no seed is given, a combination of system's\n     *                           local time and Math.random() is used.\n     * @param in_enforceReInitialization - Optionally enforce re-initialization with another seed\n     *\n     * @returns  The seed used to initialize the RNG;\n     *          If re-initialization is not enforced,\n     *          a zero indicates that the RNG was not re-seeded.\n     * @alias property-common.initializeGUIDGenerator\n     */\n    initialize(in_seed?: number, in_enforceReInitialization: boolean = false): number {\n        // Quit if the RNG has already been initialized and we do not\n        // want to enforce a re-initialization with a new seed\n        if (this.isInitialized && !in_enforceReInitialization) {\n            return 0;\n        } else {\n            this.isInitialized = true;\n\n            if (in_seed === undefined) {\n                const randomValues = generateRandomUInt32Array(4);\n                this.u = randomValues[0];\n                this.v = randomValues[1];\n                this.w1 = randomValues[2];\n                this.w2 = randomValues[3];\n            } else {\n                this.v = 224461437;\n                this.w1 = 521288629;\n                this.w2 = 362436069;\n\n                this.u = in_seed ^ this.v;\n                this.genRandUInt32();\n                this.v = this.u;\n                this.genRandUInt32();\n            }\n            return -1;\n        }\n    },\n\n    /**\n     * @returns 32-bit random number based on the RNGs internal state\n     */\n    genRandUInt32(): number {\n        this.u = multiply_uint32(this.u, 2891336453) + 1640531513;\n        this.v ^= this.v >>> 13;\n        this.v ^= this.v << 17;\n        this.v = ((this.v >>> 5) ^ this.v) >>> 0;\n\n        this.w1 = multiply_uint32(33378, (this.w1 & 0xffff)) + (this.w1 >>> 16);\n        this.w2 = multiply_uint32(57225, (this.w2 & 0xffff)) + (this.w2 >>> 16);\n\n        let x = this.u ^ (this.u << 9);\n        x ^= x >>> 17;\n        x ^= x << 6;\n\n        let y = this.w1 ^ (this.w1 << 17);\n        y ^= y >>> 15;\n        y ^= y << 5;\n        return (((x >>> 0) + this.v) ^ ((y >>> 0) + this.w2)) >>> 0;\n    },\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    let n = a;\n    let m = b;\n\n    n >>>= 0;\n    m >>>= 0;\n    const nlo = n & 0xffff;\n    return (((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 => base64.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    let base64 = x;\n    const padLength = 4 - base64.length % 4;\n    base64 += \"=\".repeat(padLength);\n    return 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(in_guidArray: Uint32Array | Int32Array | number[], base64: boolean = false): string {\n    if (base64) {\n        const intArray = new Uint32Array(in_guidArray);\n        const byteArray = new Uint8Array(intArray.buffer);\n        const base64guid = base64js.fromByteArray(byteArray);\n        // return url-friendly base64\n        return toUrlBase64(base64guid);\n    } else {\n        // Convert to hexadecimal string\n        let str = \"\";\n        for (let i = 0; i < 4; i++) {\n            const hex = in_guidArray[i].toString(16);\n            str += (\"0\".repeat(8 - hex.length) + hex);\n        }\n        // eslint-disable-next-line max-len\n        return `${str.substr(0, 8)}-${str.substr(8, 4)}-${str.substr(12, 4)}-${str.substr(16, 4)}-${str.substr(20, 12)}`;\n    }\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(in_guid: string, result: Uint32Array = new Uint32Array(4)): Uint32Array {\n    if (isBase64(in_guid)) {\n        const guid = toPaddedBase64(in_guid);\n        const bytes = base64js.toByteArray(guid);\n        const intArray = new Uint32Array(bytes.buffer);\n        result.set(intArray);\n    } else {\n        result[0] = parseInt(`0x${in_guid.substr(0, 8)}`, 16);\n        result[1] = parseInt(`0x${in_guid.substr(9, 4)}${in_guid.substr(14, 4)}`, 16);\n        result[2] = parseInt(`0x${in_guid.substr(19, 4)}${in_guid.substr(24, 4)}`, 16);\n        result[3] = parseInt(`0x${in_guid.substr(28, 8)}`, 16);\n    }\n    return 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    const rnds = new Uint32Array(4);\n\n    // Random numbers for guid (4x32 bit)\n    rnds[0] = guidRNG.genRandUInt32();\n    rnds[1] = guidRNG.genRandUInt32();\n    rnds[2] = guidRNG.genRandUInt32();\n    rnds[3] = guidRNG.genRandUInt32();\n    return 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    in_array1: Uint32Array,\n    in_array2: Uint32Array,\n    io_result?: Uint32Array,\n): Uint32Array {\n    let accumulated = io_result;\n    if (accumulated === undefined) {\n        accumulated = new Uint32Array(in_array2);\n    } else {\n        accumulated[0] = in_array2[0];\n        accumulated[1] = in_array2[1];\n        accumulated[2] = in_array2[2];\n        accumulated[3] = in_array2[3];\n    }\n\n    accumulated[0] += 0x9e3779b9;\n    accumulated[1] += 0x638f227;\n    accumulated[2] += 0x1aff2bad;\n    accumulated[3] += 0x3a8f05c5;\n\n    accumulated[0] += in_array1[3] << 6;\n    accumulated[1] += in_array1[0] << 6;\n    accumulated[2] += in_array1[1] << 6;\n    accumulated[3] += in_array1[2] << 6;\n\n    accumulated[0] += in_array1[2] >> 2;\n    accumulated[1] += in_array1[3] >> 2;\n    accumulated[2] += in_array1[0] >> 2;\n    accumulated[3] += in_array1[1] >> 2;\n\n    accumulated[0] = ((accumulated[0] ^ in_array1[1]) * UINT_32HASH_PRIME) >>> 0;\n    accumulated[1] = ((accumulated[1] ^ in_array1[2]) * UINT_32HASH_PRIME) >>> 0;\n    accumulated[2] = ((accumulated[2] ^ in_array1[3]) * UINT_32HASH_PRIME) >>> 0;\n    accumulated[3] = ((accumulated[3] ^ in_array1[0]) * UINT_32HASH_PRIME) >>> 0;\n\n    return accumulated;\n};\n\n/**\n * Takes two guids and generates a new derived guid.\n * 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    const firstArray = guidToUint32x4(in_guid1);\n    const secondArray = guidToUint32x4(in_guid2);\n    const combined = hashCombine4xUint32(firstArray, secondArray);\n    return uint32x4ToGUID(combined, base64);\n};\n\n// Make sure the RNG is initialized\nguidRNG.initialize();\n\nconst initializeGUIDGenerator = (...args) => { guidRNG.initialize(...args); };\n\nexport const GuidUtils = {\n    uint32x4ToGUID,\n    guidToUint32x4,\n    base64Tobase16,\n    base16ToBase64,\n    initializeGUIDGenerator,\n    generateGUID,\n    isGUID,\n    combineGuids,\n    hashCombine4xUint32,\n};\n"]}

package/lib/hashCalculator.d.ts

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export declare function calculateHash(key: any, seed?: number): string;
+//# sourceMappingURL=hashCalculator.d.ts.map

package/lib/hashCalculator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hashCalculator.d.ts","sourceRoot":"","sources":["../src/hashCalculator.ts"],"names":[],"mappings":"AAAA;;;GAGG;AASH,wBAAgB,aAAa,CAAC,GAAG,KAAA,EAAE,IAAI,SAAI,UAG1C"}

package/lib/hashCalculator.js

@@ -0,0 +1,14 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * @fileoverview Utility class to compute an hash for a given set of variables
+ * using the murmur3 hash (see https://code.google.com/p/smhasher/)
+ */
+import murmurHash3 from "murmurhash3js";
+export function calculateHash(key, seed = 0) {
+    const str = murmurHash3.x86.hash128(key, seed);
+    return `${str.substr(0, 8)}-${str.substr(8, 4)}-${str.substr(12, 4)}-${str.substr(16, 4)}-${str.substr(20, 12)}`;
+}
+//# sourceMappingURL=hashCalculator.js.map

package/lib/hashCalculator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hashCalculator.js","sourceRoot":"","sources":["../src/hashCalculator.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;GAGG;AAEH,OAAO,WAAW,MAAM,eAAe,CAAC;AAExC,MAAM,UAAU,aAAa,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC;IACvC,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC/C,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,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;AACrH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * @fileoverview Utility class to compute an hash for a given set of variables\n * using the murmur3 hash (see https://code.google.com/p/smhasher/)\n */\n\nimport murmurHash3 from \"murmurhash3js\";\n\nexport function calculateHash(key, seed = 0) {\n    const str = murmurHash3.x86.hash128(key, seed);\n    return `${str.substr(0, 8)}-${str.substr(8, 4)}-${str.substr(12, 4)}-${str.substr(16, 4)}-${str.substr(20, 12)}`;\n}\n"]}

package/lib/index.d.ts

@@ -0,0 +1,16 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export * from "./constants";
+export * from "./consoleUtils";
+export * from "./chronometer";
+export * from "./joinPaths";
+export * from "./guidUtils";
+export * from "./error_objects";
+export * from "./deferredPromise";
+export * from "./deterministicRandomGenerator";
+export * from "./hashCalculator";
+export * from "./datastructures";
+export { EventEmitter } from "events";
+//# sourceMappingURL=index.d.ts.map

package/lib/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,eAAe,CAAC;AAC9B,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,gCAAgC,CAAC;AAC/C,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,YAAY,EAAE,MAAM,QAAQ,CAAC"}

package/lib/index.js

@@ -0,0 +1,16 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export * from "./constants";
+export * from "./consoleUtils";
+export * from "./chronometer";
+export * from "./joinPaths";
+export * from "./guidUtils";
+export * from "./error_objects";
+export * from "./deferredPromise";
+export * from "./deterministicRandomGenerator";
+export * from "./hashCalculator";
+export * from "./datastructures";
+export { EventEmitter } from "events";
+//# sourceMappingURL=index.js.map

package/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,eAAe,CAAC;AAC9B,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,gCAAgC,CAAC;AAC/C,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,YAAY,EAAE,MAAM,QAAQ,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport * from \"./constants\";\nexport * from \"./consoleUtils\";\nexport * from \"./chronometer\";\nexport * from \"./joinPaths\";\nexport * from \"./guidUtils\";\nexport * from \"./error_objects\";\nexport * from \"./deferredPromise\";\nexport * from \"./deterministicRandomGenerator\";\nexport * from \"./hashCalculator\";\nexport * from \"./datastructures\";\nexport { EventEmitter } from \"events\";\n"]}

package/lib/joinPaths.d.ts

@@ -0,0 +1,19 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * @fileoverview implements a joinPaths routine to merge two paths.
+ */
+/**
+ * Merges two strings with a separator. If one of the two is empty no separator will be added.
+ * No duplicated separators will be joined
+ *
+ * @param in_string1 - The first string to join
+ * @param in_string2 - The second string to join
+ * @param in_separator - The path separator
+ *
+ * @returns The joined path
+ */
+export declare function joinPaths(in_string1?: string, in_string2?: string, in_separator?: string): string;
+//# sourceMappingURL=joinPaths.d.ts.map

package/lib/joinPaths.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"joinPaths.d.ts","sourceRoot":"","sources":["../src/joinPaths.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AAEH;;;;;;;;;GASG;AACH,wBAAgB,SAAS,CAAC,UAAU,GAAE,MAAW,EAAE,UAAU,GAAE,MAAW,EAAE,YAAY,GAAE,MAAY,GAAG,MAAM,CAU9G"}

package/lib/joinPaths.js

@@ -0,0 +1,28 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * @fileoverview implements a joinPaths routine to merge two paths.
+ */
+/**
+ * Merges two strings with a separator. If one of the two is empty no separator will be added.
+ * No duplicated separators will be joined
+ *
+ * @param in_string1 - The first string to join
+ * @param in_string2 - The second string to join
+ * @param in_separator - The path separator
+ *
+ * @returns The joined path
+ */
+export function joinPaths(in_string1 = "", in_string2 = "", in_separator = "/") {
+    let separator = in_separator;
+    if (!in_string1 ||
+        !in_string2 ||
+        in_string1.substr(-in_separator.length) === in_separator ||
+        in_string2.substr(0, in_separator.length) === in_separator) {
+        separator = "";
+    }
+    return in_string1 + separator + in_string2;
+}
+//# sourceMappingURL=joinPaths.js.map

package/lib/joinPaths.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"joinPaths.js","sourceRoot":"","sources":["../src/joinPaths.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AAEH;;;;;;;;;GASG;AACH,MAAM,UAAU,SAAS,CAAC,aAAqB,EAAE,EAAE,aAAqB,EAAE,EAAE,eAAuB,GAAG;IAClG,IAAI,SAAS,GAAG,YAAY,CAAC;IAE7B,IAAI,CAAC,UAAU;QACX,CAAC,UAAU;QACX,UAAU,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,YAAY;QACxD,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,KAAK,YAAY,EAAE;QAC5D,SAAS,GAAG,EAAE,CAAC;KAClB;IACD,OAAO,UAAU,GAAG,SAAS,GAAG,UAAU,CAAC;AAC/C,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * @fileoverview implements a joinPaths routine to merge two paths.\n */\n\n/**\n * Merges two strings with a separator. If one of the two is empty no separator will be added.\n * No duplicated separators will be joined\n *\n * @param in_string1 - The first string to join\n * @param in_string2 - The second string to join\n * @param in_separator - The path separator\n *\n * @returns The joined path\n */\nexport function joinPaths(in_string1: string = \"\", in_string2: string = \"\", in_separator: string = \"/\"): string {\n    let separator = in_separator;\n\n    if (!in_string1 ||\n        !in_string2 ||\n        in_string1.substr(-in_separator.length) === in_separator ||\n        in_string2.substr(0, in_separator.length) === in_separator) {\n        separator = \"\";\n    }\n    return in_string1 + separator + in_string2;\n}\n"]}

package/lib/packageVersion.d.ts

@@ -0,0 +1,9 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ *
+ * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY
+ */
+export declare const pkgName = "@fluid-experimental/property-common";
+export declare const pkgVersion = "0.50.0-41540";
+//# sourceMappingURL=packageVersion.d.ts.map

package/lib/packageVersion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"packageVersion.d.ts","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,eAAO,MAAM,OAAO,wCAAwC,CAAC;AAC7D,eAAO,MAAM,UAAU,iBAAiB,CAAC"}

package/lib/packageVersion.js

@@ -0,0 +1,9 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ *
+ * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY
+ */
+export const pkgName = "@fluid-experimental/property-common";
+export const pkgVersion = "0.50.0-41540";
+//# sourceMappingURL=packageVersion.js.map

package/lib/packageVersion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,OAAO,GAAG,qCAAqC,CAAC;AAC7D,MAAM,CAAC,MAAM,UAAU,GAAG,cAAc,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluid-experimental/property-common\";\nexport const pkgVersion = \"0.50.0-41540\";\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fluid-experimental/property-common",
-  "version": "0.49.0",
+  "version": "0.50.0-41540",
   "description": "common functions used in properties",
   "homepage": "https://fluidframework.com",
   "repository": "https://github.com/microsoft/FluidFramework",
@@ -32,6 +32,26 @@
     "tsfmt": "tsfmt --verify",
     "tsfmt:fix": "tsfmt --replace"
   },
+  "nyc": {
+    "all": true,
+    "cache-dir": "nyc/.cache",
+    "exclude": [
+      "src/test/**/*.ts",
+      "dist/test/**/*.js"
+    ],
+    "exclude-after-remap": false,
+    "include": [
+      "src/**/*.ts",
+      "dist/**/*.js"
+    ],
+    "report-dir": "nyc/report",
+    "reporter": [
+      "cobertura",
+      "html",
+      "text"
+    ],
+    "temp-directory": "nyc/.nyc_output"
+  },
   "dependencies": {
     "ajv": "7.1.1",
     "async": "^3.2.0",
@@ -45,7 +65,7 @@
   "devDependencies": {
     "@fluidframework/build-common": "^0.23.0",
     "@fluidframework/eslint-config-fluid": "^0.23.0",
-    "@fluidframework/mocha-test-setup": "^0.49.0",
+    "@fluidframework/mocha-test-setup": "0.50.0-41540",
     "@microsoft/api-extractor": "^7.16.1",
     "@types/debug": "^4.1.5",
     "@types/mocha": "^8.2.2",

package/platform-dependent/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fluid-internal/platform-dependent",
-  "version": "0.49.0",
+  "version": "0.50.0-41540",
   "private": true,
   "description": "Helper package that separates code for browser and server.",
   "homepage": "https://fluidframework.com",

package/src/constants.ts

@@ -713,6 +713,11 @@ const PropertyError = {
     INSERT_NOT_A_PROP: "PR-141: In an array of properties, you can only insert instances of " +
         "properties. This value is not valid: ",
 
+    /**
+     * If a property is a reference, it cannot be changed.
+     */
+    MODIFICATION_OF_REFERENCED_PROPERTY: "PR-142: Modifications of referenced properties are not allowed.",
+
     /**
      * methods: Property.getValue
      * Property.getValue(in_ids) is a shortcut for Property.get(in_ids).getValue().

package/src/packageVersion.ts

@@ -6,4 +6,4 @@
  */
 
 export const pkgName = "@fluid-experimental/property-common";
-export const pkgVersion = "0.49.0";
+export const pkgVersion = "0.50.0-41540";