implemented frontend including separate message system; started to implement backend

yjs-poll/node_modules/lib0/dist/prng/Mt19937.d.ts

@@ -0,0 +1,29 @@
+/**
+ * This is a port of Shawn Cokus's implementation of the original Mersenne Twister algorithm (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/CODES/MTARCOK/mt19937ar-cok.c).
+ * MT has a very high period of 2^19937. Though the authors of xorshift describe that a high period is not
+ * very relevant (http://vigna.di.unimi.it/xorshift/). It is four times slower than xoroshiro128plus and
+ * needs to recompute its state after generating 624 numbers.
+ *
+ * ```js
+ * const gen = new Mt19937(new Date().getTime())
+ * console.log(gen.next())
+ * ```
+ *
+ * @public
+ */
+export class Mt19937 {
+    /**
+     * @param {number} seed Unsigned 32 bit number
+     */
+    constructor(seed: number);
+    seed: number;
+    _state: Uint32Array<ArrayBuffer>;
+    _i: number;
+    /**
+     * Generate a random signed integer.
+     *
+     * @return {Number} A 32 bit signed integer.
+     */
+    next(): number;
+}
+//# sourceMappingURL=Mt19937.d.ts.map

yjs-poll/node_modules/lib0/dist/prng/Mt19937.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Mt19937.d.ts","sourceRoot":"","sources":["../../prng/Mt19937.js"],"names":[],"mappings":"AA8BA;;;;;;;;;;;;GAYG;AACH;IACE;;OAEG;IACH,kBAFW,MAAM,EAYhB;IATC,aAAgB;IAMhB,iCAAmB;IACnB,WAAW;IAIb;;;;OAIG;IACH,eAYC;CACF"}

yjs-poll/node_modules/lib0/dist/prng/Xoroshiro128plus.d.ts

@@ -0,0 +1,27 @@
+/**
+ * This is a variant of xoroshiro128plus - the fastest full-period generator passing BigCrush without systematic failures.
+ *
+ * This implementation follows the idea of the original xoroshiro128plus implementation,
+ * but is optimized for the JavaScript runtime. I.e.
+ * * The operations are performed on 32bit integers (the original implementation works with 64bit values).
+ * * The initial 128bit state is computed based on a 32bit seed and Xorshift32.
+ * * This implementation returns two 32bit values based on the 64bit value that is computed by xoroshiro128plus.
+ *   Caution: The last addition step works slightly different than in the original implementation - the add carry of the
+ *   first 32bit addition is not carried over to the last 32bit.
+ *
+ * [Reference implementation](http://vigna.di.unimi.it/xorshift/xoroshiro128plus.c)
+ */
+export class Xoroshiro128plus {
+    /**
+     * @param {number} seed Unsigned 32 bit number
+     */
+    constructor(seed: number);
+    seed: number;
+    state: Uint32Array<ArrayBuffer>;
+    _fresh: boolean;
+    /**
+     * @return {number} Float/Double in [0,1)
+     */
+    next(): number;
+}
+//# sourceMappingURL=Xoroshiro128plus.d.ts.map

yjs-poll/node_modules/lib0/dist/prng/Xoroshiro128plus.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Xoroshiro128plus.d.ts","sourceRoot":"","sources":["../../prng/Xoroshiro128plus.js"],"names":[],"mappings":"AAOA;;;;;;;;;;;;GAYG;AACH;IACE;;OAEG;IACH,kBAFW,MAAM,EAWhB;IARC,aAAgB;IAGhB,gCAA+B;IAI/B,gBAAkB;IAGpB;;OAEG;IACH,QAFY,MAAM,CA4BjB;CACF"}

yjs-poll/node_modules/lib0/dist/prng/Xorshift32.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Xorshift32 is a very simple but elegang PRNG with a period of `2^32-1`.
+ */
+export class Xorshift32 {
+    /**
+     * @param {number} seed Unsigned 32 bit number
+     */
+    constructor(seed: number);
+    seed: number;
+    /**
+     * @type {number}
+     */
+    _state: number;
+    /**
+     * Generate a random signed integer.
+     *
+     * @return {Number} A 32 bit signed integer.
+     */
+    next(): number;
+}
+//# sourceMappingURL=Xorshift32.d.ts.map

yjs-poll/node_modules/lib0/dist/prng/Xorshift32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Xorshift32.d.ts","sourceRoot":"","sources":["../../prng/Xorshift32.js"],"names":[],"mappings":"AAMA;;GAEG;AACH;IACE;;OAEG;IACH,kBAFW,MAAM,EAQhB;IALC,aAAgB;IAChB;;OAEG;IACH,QAFU,MAAM,CAEE;IAGpB;;;;OAIG;IACH,eAOC;CACF"}