View difference between Paste ID: YHib4W57 and F6Ahw0ND

 /**
- *	Class: XORShiftPlus: "non-linear" PRNG
+ *  XORShiftPlus "non-linear" PRNG
- *	Author: k98kurz (@gmail)
+ *  Author: k98kurz (@gmail)
- *	License: MIT
+ *  License: MIT
- *	Description: Based upon the xorshift128+ generator, one of the fastest generators passing BigCrush.
+ *  Date: 2020-09-07
- *	Methods:
+ *  Description: Based upon the xorshift128+ generator, one of the fastest generators passing BigCrush.
- *		next(n)			returns Uint32Array of n random numbers
+ *  Methods:
- *		nextHex(n)		returns Array of n hexidecimal numbers
+ *      next(n)         returns Uint32Array of n random numbers
- *		bytes(n)		returns Uint8Array of n random bytes
+ *      nextHex(n)      returns Array of n hexidecimal numbers
- *		bytesHex(n)		returns Array of n random bytes in hexidecimal
+ *      bytes(n)        returns Uint8Array of n random bytes
- *		hex(n)			returns hexidecimal string of n bytes
+ *      bytesHex(n)     returns Array of n random bytes in hexidecimal
  *      hex(n)          returns hexidecimal string of n bytes
-function XORShiftPlus (seed) {
+ *  Note: This generates with higher periodicity and better random distribution than the linear XORShift.
-	var x = new Uint32Array(1), y = new Uint32Array(1), z = new Uint32Array(1), w = new Uint32Array(1);
+
-	x[0] = seed ? seed|0 : 317973455;
+class XORShiftPlus {
-	y[0] = x[0]<<362436069;
+  #booted = false;
-	z[0] = y[0]+x[0];
+  #x;
-	w[0] = z[0]^x[0]+y[0];
+  #y;
   #z;
-	function next () {
+  #w;
-		var t = new Uint32Array(1);
+
-		t[0] = x[0]^(x<<11);
+  constructor (seed) {
-		x[0] = y[0]; y[0] = z[0]; z[0] = w[0];
+    this.#x = new Uint32Array(1);
-		w[0] = w[0]^(w[0]>>19)^(t[0]^(t[0]>>8));
+    this.#y = new Uint32Array(1);
-		return w[0]+y[0];
+    this.#z = new Uint32Array(1);
-	}
+    this.#w = new Uint32Array(1);
     this.#x[0] = seed ? seed|0 : 317973455;
-	// discard the first numbers as they are somewhat predictable
+    this.#y[0] = this.#x[0]<<362436069;
-	for (var i=0, n=next(), j=next()%256; i<=j; next(), ++i);
+    this.#z[0] = this.#y[0]+this.#x[0];
     this.#w[0] = this.#z[0]^this.#x[0]+this.#y[0];
-	this.next = function (n, option) {
+  }
-		if (typeof n == 'undefined' || typeof n !== 'number')
+
-			var n = 1;
+  #next () {
-		var t; n |= 0; n = n>0 ? n : 1;
+    let t = new Uint32Array(1);
-		if (typeof option == 'undefined' || typeof n !== 'number')
+    t[0] = this.#x[0]^(this.#x[0]<<11);
-			var option = 0;
+    this.#x[0] = this.#y[0];
     this.#y[0] = this.#z[0];
-		// redundant code, but improved performance
+    this.#z[0] = this.#w[0];
-		switch (option) {
+    this.#w[0] = this.#w[0]^(this.#w[0]>>19)^(t[0]^(t[0]>>8));
-			// nextHex
+    return this.#w[0]+this.#y[0];
-			case 1:
+  }
-				t = [];
+
-				for (var i=0, il=n; i<il; t[i++] = next().toString(16));
+  #boot () {
-				break;
+    // if not booted, discard the first numbers as they are somewhat predictable
-			// bytes
+    if (this.#booted)
-			case 2:
+      return;
-				t = new Uint8Array(n);
+    for (let i=0, n=this.#next(), j=this.#next()%256; i<=j; this.#next(), ++i);
-				for (var i=0, il=n; i<il; t[i++] = next());
+    this.#booted = true;
-				break;
+  }
-			// bytesHex
+
-			case 3:
+  next (n, option) {
-				t = [];
+    this.#boot();
-				for (var i=0, il=n; i<il; t[i] = (next()%256).toString(16), t[i] = t[i].length%2 ? '0'+t[i] : t[i], ++i);
+    n = (n === undefined || typeof n !== 'number') ? 1 : n;
-				break;
+    let t; n |= 0; n = n>0 ? n : 1;
-			// hex
+    option = (option === undefined || typeof n !== 'number') ? 0 : option;
-			case 4:
+
-				t = [];
+    // redundant code, but improved performance
-				for (var i=0, il=n; i<il; t[i] = (next()%256).toString(16), t[i] = t[i].length%2 ? '0'+t[i] : t[i], ++i);
+    switch (option) {
-				t = t.join('');
+      // nextHex
-				break;
+      case 1:
-			// next
+        t = [];
-			default:
+        for (let i=0, il=n; i<il; t[i++] = this.#next().toString(16));
-				t = new Uint32Array(n);
+        break;
-				for (var i=0, il=n; i<il; t[i++] = next());
+      // bytes
-		}
+      case 2:
         t = new Uint8Array(n);
-		return t;
+        for (let i=0, il=n; i<il; t[i++] = this.#next());
-	};
+        break;
       // bytesHex
-	this.nextHex = function (n) { return this.next(n, 1); };
+      case 3:
         t = [];
-	this.bytes = function (n) { return this.next(n, 2); };
+        for (let i=0, il=n; i<il; t[i] = (this.#next()%256).toString(16), t[i] = t[i].length%2 ? '0'+t[i] : t[i], ++i);
         break;
-	this.bytesHex = function (n) { return this.next(n, 3); };
+      // hex
       case 4:
-	this.hex = function (n) { return this.next(n, 4); };
+        t = [];
         for (let i=0, il=n; i<il; t[i] = (this.#next()%256).toString(16), t[i] = t[i].length%2 ? '0'+t[i] : t[i], ++i);
-	this.nextMod = function (m, n) {
+        t = t.join('');
-		var t = this.next(n ? n|0 : 1, 0);
+        break;
-		if (typeof n == "number" && !isNaN(n) && n > 1) {
+      // next
-			m = (typeof m == "number") ? m|0 : Number.MAX_SAFE_INTEGER;
+      default:
-			for (var i=0, il=t.length; i<il; ++i) {
+        t = new Uint32Array(n);
-			    t[i] = t[i] % m;
+        for (let i=0, il=n; i<il; t[i++] = this.#next());
-			}
+    }
-			return t;
+    return t;
-		}
+  };
-		return m ? t % (m|0) : t;
+
-	}
+  nextHex (n) { return this.next(n, 1); };
 
   bytes (n) { return this.next(n, 2); };
 
   bytesHex (n) { return this.next(n, 3); };
 
   hex (n) { return this.next(n, 4); };
 }