Change endpoint from persons to people

2025-06-27 09:03:02 +02:00 · 2025-03-23 21:00:08 +01:00
parent 4ae263662c
commit d005193f63
7158 changed files with 700476 additions and 735 deletions
--- a/backend/apis/nodejs/node_modules/pure-rand/CHANGELOG.md
+++ b/backend/apis/nodejs/node_modules/pure-rand/CHANGELOG.md
@ -0,0 +1,94 @@
+# CHANGELOG 6.X
+
+## 6.1.0
+
+### Features
+
+- [c60c828](https://github.com/dubzzz/pure-rand/commit/c60c828) ✨ Clone from state on `xorshift128plus` (#697)
+- [6a16bfe](https://github.com/dubzzz/pure-rand/commit/6a16bfe) ✨ Clone from state on `mersenne` (#698)
+- [fb78e2d](https://github.com/dubzzz/pure-rand/commit/fb78e2d) ✨ Clone from state on `xoroshiro128plus` (#699)
+- [a7dd56c](https://github.com/dubzzz/pure-rand/commit/a7dd56c) ✨ Clone from state on congruential32 (#696)
+- [1f6c3a5](https://github.com/dubzzz/pure-rand/commit/1f6c3a5) 🏷️ Expose internal state of generators (#694)
+
+### Fixes
+
+- [30d439a](https://github.com/dubzzz/pure-rand/commit/30d439a) 💚 Fix broken lock file (#695)
+- [9f935ae](https://github.com/dubzzz/pure-rand/commit/9f935ae) 👷 Speed-up CI with better cache (#677)
+
+## 6.0.4
+
+### Fixes
+
+- [716e073](https://github.com/dubzzz/pure-rand/commit/716e073) 🐛 Fix typings for node native esm (#649)
+
+## 6.0.3
+
+### Fixes
+
+- [9aca792](https://github.com/dubzzz/pure-rand/commit/9aca792) 🏷️ Better declare ESM's types (#634)
+
+## 6.0.2
+
+### Fixes
+
+- [6d05e8f](https://github.com/dubzzz/pure-rand/commit/6d05e8f) 🔐 Sign published packages (#591)
+- [8b4e165](https://github.com/dubzzz/pure-rand/commit/8b4e165) 👷 Switch default to Node 18 in CI (#578)
+
+## 6.0.1
+
+### Fixes
+
+- [05421f2](https://github.com/dubzzz/pure-rand/commit/05421f2) 🚨 Reformat README.md (#563)
+- [ffacfbd](https://github.com/dubzzz/pure-rand/commit/ffacfbd) 📝 Give simple seed computation example (#562)
+- [e432d59](https://github.com/dubzzz/pure-rand/commit/e432d59) 📝 Add extra keywords (#561)
+- [f5b18d4](https://github.com/dubzzz/pure-rand/commit/f5b18d4) 🐛 Declare types first for package (#560)
+- [a5b30db](https://github.com/dubzzz/pure-rand/commit/a5b30db) 📝 Final clean-up of the README (#559)
+- [5254ee0](https://github.com/dubzzz/pure-rand/commit/5254ee0) 📝 Fix simple examples not fully working (#558)
+- [8daf460](https://github.com/dubzzz/pure-rand/commit/8daf460) 📝 Clarify the README (#556)
+- [a915b6a](https://github.com/dubzzz/pure-rand/commit/a915b6a) 📝 Fix url error in README for logo (#554)
+- [f94885c](https://github.com/dubzzz/pure-rand/commit/f94885c) 📝 Rework README header with logo (#553)
+- [5f7645e](https://github.com/dubzzz/pure-rand/commit/5f7645e) 📝 Typo in link to comparison SVG (#551)
+- [61726af](https://github.com/dubzzz/pure-rand/commit/61726af) 📝 Better keywords for NPM (#550)
+- [6001e5a](https://github.com/dubzzz/pure-rand/commit/6001e5a) 📝 Update performance section with recent stats (#549)
+- [556ec33](https://github.com/dubzzz/pure-rand/commit/556ec33) ⚗️ Rewrite not uniform of pure-rand (#547)
+- [b3dfea5](https://github.com/dubzzz/pure-rand/commit/b3dfea5) ⚗️ Add more libraries to the experiment (#546)
+- [ac8b85d](https://github.com/dubzzz/pure-rand/commit/ac8b85d) ⚗️ Add some more non-uniform versions (#543)
+- [44af2ad](https://github.com/dubzzz/pure-rand/commit/44af2ad) ⚗️ Add some more self comparisons (#542)
+- [6d3342d](https://github.com/dubzzz/pure-rand/commit/6d3342d) 📝 Add some more details on the algorithms in compare (#541)
+- [359e214](https://github.com/dubzzz/pure-rand/commit/359e214) 📝 Fix some typos in README (#540)
+- [28a7bfe](https://github.com/dubzzz/pure-rand/commit/28a7bfe) 📝 Document some performance stats (#539)
+- [81860b7](https://github.com/dubzzz/pure-rand/commit/81860b7) ⚗️ Measure performance against other libraries (#538)
+- [114c2c7](https://github.com/dubzzz/pure-rand/commit/114c2c7) 📝 Publish changelogs from 3.X to 6.X (#537)
+
+## 6.0.0
+
+### Breaking Changes
+
+- [c45912f](https://github.com/dubzzz/pure-rand/commit/c45912f) 💥 Require generators uniform in int32 (#513)
+- [0bde03e](https://github.com/dubzzz/pure-rand/commit/0bde03e) 💥 Drop congruencial generator (#511)
+
+### Features
+
+- [7587984](https://github.com/dubzzz/pure-rand/commit/7587984) ⚡️ Faster uniform distribution on bigint (#517)
+- [464960a](https://github.com/dubzzz/pure-rand/commit/464960a) ⚡️ Faster uniform distribution on small ranges (#516)
+- [b4852a8](https://github.com/dubzzz/pure-rand/commit/b4852a8) ⚡️ Faster Congruencial 32bits (#512)
+- [fdb6ec8](https://github.com/dubzzz/pure-rand/commit/fdb6ec8) ⚡️ Faster Mersenne-Twister (#510)
+- [bb69be5](https://github.com/dubzzz/pure-rand/commit/bb69be5) ⚡️ Drop infinite loop for explicit loop (#507)
+
+### Fixes
+
+- [00fc62b](https://github.com/dubzzz/pure-rand/commit/00fc62b) 🔨 Add missing benchType to the script (#522)
+- [db4a0a6](https://github.com/dubzzz/pure-rand/commit/db4a0a6) 🔨 Add more options to benchmark (#521)
+- [5c1ca0e](https://github.com/dubzzz/pure-rand/commit/5c1ca0e) 🔨 Fix typo in benchmark code (#520)
+- [36c965f](https://github.com/dubzzz/pure-rand/commit/36c965f) 👷 Define a benchmark workflow (#519)
+- [0281cfd](https://github.com/dubzzz/pure-rand/commit/0281cfd) 🔨 More customizable benchmark (#518)
+- [a7e19a8](https://github.com/dubzzz/pure-rand/commit/a7e19a8) 🔥 Clean internals of uniform distribution (#515)
+- [520cca7](https://github.com/dubzzz/pure-rand/commit/520cca7) 🔨 Add some more benchmarks (#514)
+- [c2d6ee6](https://github.com/dubzzz/pure-rand/commit/c2d6ee6) 🔨 Fix typo in bench for large reference (#509)
+- [2dd7280](https://github.com/dubzzz/pure-rand/commit/2dd7280) 🔥 Clean useless variable (#506)
+- [dd621c9](https://github.com/dubzzz/pure-rand/commit/dd621c9) 🔨 Adapt benchmarks to make them reliable (#505)
+- [122f968](https://github.com/dubzzz/pure-rand/commit/122f968) 👷 Drop dependabot
+- [f11d2e8](https://github.com/dubzzz/pure-rand/commit/f11d2e8) 💸 Add GitHub sponsors in repository's configuration
+- [6a23e48](https://github.com/dubzzz/pure-rand/commit/6a23e48) 👷 Stop running tests against node 12 (#486)
+- [cbefd3e](https://github.com/dubzzz/pure-rand/commit/cbefd3e) 🔧 Better configuration of prettier (#474)
+- [c6712d3](https://github.com/dubzzz/pure-rand/commit/c6712d3) 🔧 Configure Renovate (#470)
--- a/backend/apis/nodejs/node_modules/pure-rand/LICENSE
+++ b/backend/apis/nodejs/node_modules/pure-rand/LICENSE
@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Nicolas DUBIEN
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
--- a/backend/apis/nodejs/node_modules/pure-rand/README.md
+++ b/backend/apis/nodejs/node_modules/pure-rand/README.md
@ -0,0 +1,208 @@
+<h1>
+  <img src="https://raw.githubusercontent.com/dubzzz/pure-rand/main/assets/logo.svg" alt="pure-rand logo" />
+</h1>
+
+Fast Pseudorandom number generators (aka PRNG) with purity in mind!
+
+[![Build Status](https://github.com/dubzzz/pure-rand/workflows/Build%20Status/badge.svg?branch=main)](https://github.com/dubzzz/pure-rand/actions)
+[![NPM Version](https://badge.fury.io/js/pure-rand.svg)](https://badge.fury.io/js/pure-rand)
+[![Monthly Downloads](https://img.shields.io/npm/dm/pure-rand)](https://www.npmjs.com/package/pure-rand)
+
+[![Codecov](https://codecov.io/gh/dubzzz/pure-rand/branch/main/graph/badge.svg)](https://codecov.io/gh/dubzzz/pure-rand)
+[![Package Quality](https://packagequality.com/shield/pure-rand.svg)](https://packagequality.com/#?package=pure-rand)
+[![Snyk Package Quality](https://snyk.io/advisor/npm-package/pure-rand/badge.svg)](https://snyk.io/advisor/npm-package/pure-rand)
+
+[![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](https://github.com/dubzzz/pure-rand/labels/good%20first%20issue)
+[![License](https://img.shields.io/npm/l/pure-rand.svg)](https://github.com/dubzzz/pure-rand/blob/main/LICENSE)
+[![Twitter](https://img.shields.io/twitter/url/https/github.com/dubzzz/pure-rand.svg?style=social)](https://twitter.com/intent/tweet?text=Check%20out%20pure-rand%20by%20%40ndubien%20https%3A%2F%2Fgithub.com%2Fdubzzz%2Fpure-rand%20%F0%9F%91%8D)
+
+## Getting started
+
+**Install it in node via:**
+
+`npm install pure-rand` or `yarn add pure-rand`
+
+**Use it in browser by doing:**
+
+`import * as prand from 'https://unpkg.com/pure-rand/lib/esm/pure-rand.js';`
+
+## Usage
+
+**Simple usage**
+
+```javascript
+import prand from 'pure-rand';
+
+const seed = 42;
+const rng = prand.xoroshiro128plus(seed);
+const firstDiceValue = prand.unsafeUniformIntDistribution(1, 6, rng); // value in {1..6}, here: 2
+const secondDiceValue = prand.unsafeUniformIntDistribution(1, 6, rng); // value in {1..6}, here: 4
+const thirdDiceValue = prand.unsafeUniformIntDistribution(1, 6, rng); // value in {1..6}, here: 6
+```
+
+**Pure usage**
+
+Pure means that the instance `rng` will never be altered in-place. It can be called again and again and it will always return the same value. But it will also return the next `rng`. Here is an example showing how the code above can be translated into its pure version:
+
+```javascript
+import prand from 'pure-rand';
+
+const seed = 42;
+const rng1 = prand.xoroshiro128plus(seed);
+const [firstDiceValue, rng2] = prand.uniformIntDistribution(1, 6, rng1); // value in {1..6}, here: 2
+const [secondDiceValue, rng3] = prand.uniformIntDistribution(1, 6, rng2); // value in {1..6}, here: 4
+const [thirdDiceValue, rng4] = prand.uniformIntDistribution(1, 6, rng3); // value in {1..6}, here: 6
+
+// You can call: prand.uniformIntDistribution(1, 6, rng1);
+// over and over it will always give you back the same value along with a new rng (always producing the same values too).
+```
+
+**Independent simulations**
+
+In order to produce independent simulations it can be tempting to instanciate several PRNG based on totally different seeds. While it would produce distinct set of values, the best way to ensure fully unrelated sequences is rather to use jumps. Jump just consists into moving far away from the current position in the generator (eg.: jumping in Xoroshiro 128+ will move you 2<sup>64</sup> generations away from the current one on a generator having a sequence of 2<sup>128</sup> elements).
+
+```javascript
+import prand from 'pure-rand';
+
+const seed = 42;
+const rngSimulation1 = prand.xoroshiro128plus(seed);
+const rngSimulation2 = rngSimulation1.jump(); // not in-place, creates a new instance
+const rngSimulation3 = rngSimulation2.jump(); // not in-place, creates a new instance
+
+const diceSim1Value = prand.unsafeUniformIntDistribution(1, 6, rngSimulation1); // value in {1..6}, here: 2
+const diceSim2Value = prand.unsafeUniformIntDistribution(1, 6, rngSimulation2); // value in {1..6}, here: 5
+const diceSim3Value = prand.unsafeUniformIntDistribution(1, 6, rngSimulation3); // value in {1..6}, here: 6
+```
+
+**Non-uniform usage**
+
+While not recommended as non-uniform distribution implies that one or several values from the range will be more likely than others, it might be tempting for people wanting to maximize the throughput.
+
+```javascript
+import prand from 'pure-rand';
+
+const seed = 42;
+const rng = prand.xoroshiro128plus(seed);
+const rand = (min, max) => {
+  const out = (rng.unsafeNext() >>> 0) / 0x100000000;
+  return min + Math.floor(out * (max - min + 1));
+};
+const firstDiceValue = rand(1, 6); // value in {1..6}, here: 6
+```
+
+**Select your seed**
+
+While not perfect, here is a rather simple way to generate a seed for your PNRG.
+
+```javascript
+const seed = Date.now() ^ (Math.random() * 0x100000000);
+```
+
+## Documentation
+
+### Pseudorandom number generators
+
+In computer science most random number generators<sup>(1)</sup> are [pseudorandom number generators](https://en.wikipedia.org/wiki/Pseudorandom_number_generator) (abbreviated: PRNG). In other words, they are fully deterministic and given the original seed one can rebuild the whole sequence.
+
+Each PRNG algorithm has to deal with tradeoffs in terms of randomness quality, speed, length of the sequence<sup>(2)</sup>... In other words, it's important to compare relative speed of libraries with that in mind. Indeed, a Mersenne Twister PRNG will not have the same strenghts and weaknesses as a Xoroshiro PRNG, so depending on what you need exactly you might prefer one PRNG over another even if it will be slower.
+
+4 PRNGs come with pure-rand:
+
+- `congruential32`: Linear Congruential generator — \[[more](https://en.wikipedia.org/wiki/Linear_congruential_generator)\]
+- `mersenne`: Mersenne Twister generator — \[[more](https://en.wikipedia.org/wiki/Mersenne_Twister)\]
+- `xorshift128plus`: Xorshift 128+ generator — \[[more](https://en.wikipedia.org/wiki/Xorshift)\]
+- `xoroshiro128plus`: Xoroshiro 128+ generator — \[[more](https://en.wikipedia.org/wiki/Xorshift)\]
+
+Our recommendation is `xoroshiro128plus`. But if you want to use another one, you can replace it by any other PRNG provided by pure-rand in the examples above.
+
+### Distributions
+
+Once you are able to generate random values, next step is to scale them into the range you want. Indeed, you probably don't want a floating point value between 0 (included) and 1 (excluded) but rather an integer value between 1 and 6 if you emulate a dice or any other range based on your needs.
+
+At this point, simple way would be to do `min + floor(random() * (max - min + 1))` but actually it will not generate the values with equal probabilities even if you use the best PRNG in the world to back `random()`. In order to have equal probabilities you need to rely on uniform distributions<sup>(3)</sup> which comes built-in in some PNRG libraries.
+
+pure-rand provides 3 built-in functions for uniform distributions of values:
+
+- `uniformIntDistribution(min, max, rng)`
+- `uniformBigIntDistribution(min, max, rng)` - with `min` and `max` being `bigint`
+- `uniformArrayIntDistribution(min, max, rng)` - with `min` and `max` being instances of `ArrayInt = {sign, data}` ie. sign either 1 or -1 and data an array of numbers between 0 (included) and 0xffffffff (included)
+
+And their unsafe equivalents to change the PRNG in-place.
+
+### Extra helpers
+
+Some helpers are also provided in order to ease the use of `RandomGenerator` instances:
+
+- `prand.generateN(rng: RandomGenerator, num: number): [number[], RandomGenerator]`: generates `num` random values using `rng` and return the next `RandomGenerator`
+- `prand.skipN(rng: RandomGenerator, num: number): RandomGenerator`: skips `num` random values and return the next `RandomGenerator`
+
+## Comparison
+
+### Summary
+
+The chart has been split into three sections:
+
+- section 1: native `Math.random()`
+- section 2: without uniform distribution of values
+- section 3: with uniform distribution of values (not supported by all libraries)
+
+<img src="https://raw.githubusercontent.com/dubzzz/pure-rand/main/perf/comparison.svg" alt="Comparison against other libraries" />
+
+### Process
+
+In order to compare the performance of the libraries, we aked them to shuffle an array containing 1,000,000 items (see [code](https://github.com/dubzzz/pure-rand/blob/556ec331c68091c5d56e9da1266112e8ea222b2e/perf/compare.cjs)).
+
+We then split the measurements into two sections:
+
+- one for non-uniform distributions — _known to be slower as it implies re-asking for other values to the PRNG until the produced value fall into the acceptable range of values_
+- one for uniform distributions
+
+The recommended setup for pure-rand is to rely on our Xoroshiro128+. It provides a long enough sequence of random values, has built-in support for jump, is really efficient while providing a very good quality of randomness.
+
+### Performance
+
+**Non-Uniform**
+
+| Library                  | Algorithm         | Mean time (ms) | Compared to pure-rand |
+| ------------------------ | ----------------- | -------------- | --------------------- |
+| native \(node 16.19.1\)  | Xorshift128+      | 33.3           | 1.4x slower           |
+| **pure-rand _@6.0.0_**   | **Xoroshiro128+** | **24.5**       | **reference**         |
+| pure-rand _@6.0.0_       | Xorshift128+      | 25.0           | similar               |
+| pure-rand _@6.0.0_       | Mersenne Twister  | 30.8           | 1.3x slower           |
+| pure-rand _@6.0.0_       | Congruential‍     | 22.6           | 1.1x faster           |
+| seedrandom _@3.0.5_      | Alea              | 28.1           | 1.1x slower           |
+| seedrandom _@3.0.5_      | Xorshift128       | 28.8           | 1.2x slower           |
+| seedrandom _@3.0.5_      | Tyche-i           | 28.6           | 1.2x slower           |
+| seedrandom _@3.0.5_      | Xorwow            | 32.0           | 1.3x slower           |
+| seedrandom _@3.0.5_      | Xor4096           | 32.2           | 1.3x slower           |
+| seedrandom _@3.0.5_      | Xorshift7         | 33.5           | 1.4x slower           |
+| @faker-js/faker _@7.6.0_ | Mersenne Twister  | 109.1          | 4.5x slower           |
+| chance _@1.1.10_         | Mersenne Twister  | 142.9          | 5.8x slower           |
+
+**Uniform**
+
+| Library                | Algorithm         | Mean time (ms) | Compared to pure-rand |
+| ---------------------- | ----------------- | -------------- | --------------------- |
+| **pure-rand _@6.0.0_** | **Xoroshiro128+** | **53.5**       | **reference**         |
+| pure-rand _@6.0.0_     | Xorshift128+      | 52.2           | similar               |
+| pure-rand _@6.0.0_     | Mersenne Twister  | 61.6           | 1.2x slower           |
+| pure-rand _@6.0.0_     | Congruential‍     | 57.6           | 1.1x slower           |
+| random-js @2.1.0       | Mersenne Twister  | 119.6          | 2.2x slower           |
+
+> System details:
+>
+> - OS: Linux 5.15 Ubuntu 22.04.2 LTS 22.04.2 LTS (Jammy Jellyfish)
+> - CPU: (2) x64 Intel(R) Xeon(R) Platinum 8272CL CPU @ 2.60GHz
+> - Memory: 5.88 GB / 6.78 GB
+> - Container: Yes
+> - Node: 16.19.1 - /opt/hostedtoolcache/node/16.19.1/x64/bin/node
+>
+> _Executed on default runners provided by GitHub Actions_
+
+---
+
+(1) — Not all as there are also [hardware-based random number generator](https://en.wikipedia.org/wiki/Hardware_random_number_generator).
+
+(2) — How long it takes to reapeat itself?
+
+(3) — While most users don't really think of it, uniform distribution is key! Without it entries might be biased towards some values and make some others less probable. The naive `rand() % numValues` is a good example of biased version as if `rand()` is uniform in `0, 1, 2` and `numValues` is `2`, the probabilities are: `P(0) = 67%`, `P(1) = 33%` causing `1` to be less probable than `0`
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/Distribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/Distribution.js
@ -0,0 +1,2 @@
+"use strict";
+exports.__esModule = true;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UniformArrayIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UniformArrayIntDistribution.js
@ -0,0 +1,15 @@
+"use strict";
+exports.__esModule = true;
+exports.uniformArrayIntDistribution = void 0;
+var UnsafeUniformArrayIntDistribution_1 = require("./UnsafeUniformArrayIntDistribution");
+function uniformArrayIntDistribution(from, to, rng) {
+    if (rng != null) {
+        var nextRng = rng.clone();
+        return [(0, UnsafeUniformArrayIntDistribution_1.unsafeUniformArrayIntDistribution)(from, to, nextRng), nextRng];
+    }
+    return function (rng) {
+        var nextRng = rng.clone();
+        return [(0, UnsafeUniformArrayIntDistribution_1.unsafeUniformArrayIntDistribution)(from, to, nextRng), nextRng];
+    };
+}
+exports.uniformArrayIntDistribution = uniformArrayIntDistribution;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UniformBigIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UniformBigIntDistribution.js
@ -0,0 +1,15 @@
+"use strict";
+exports.__esModule = true;
+exports.uniformBigIntDistribution = void 0;
+var UnsafeUniformBigIntDistribution_1 = require("./UnsafeUniformBigIntDistribution");
+function uniformBigIntDistribution(from, to, rng) {
+    if (rng != null) {
+        var nextRng = rng.clone();
+        return [(0, UnsafeUniformBigIntDistribution_1.unsafeUniformBigIntDistribution)(from, to, nextRng), nextRng];
+    }
+    return function (rng) {
+        var nextRng = rng.clone();
+        return [(0, UnsafeUniformBigIntDistribution_1.unsafeUniformBigIntDistribution)(from, to, nextRng), nextRng];
+    };
+}
+exports.uniformBigIntDistribution = uniformBigIntDistribution;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UniformIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UniformIntDistribution.js
@ -0,0 +1,15 @@
+"use strict";
+exports.__esModule = true;
+exports.uniformIntDistribution = void 0;
+var UnsafeUniformIntDistribution_1 = require("./UnsafeUniformIntDistribution");
+function uniformIntDistribution(from, to, rng) {
+    if (rng != null) {
+        var nextRng = rng.clone();
+        return [(0, UnsafeUniformIntDistribution_1.unsafeUniformIntDistribution)(from, to, nextRng), nextRng];
+    }
+    return function (rng) {
+        var nextRng = rng.clone();
+        return [(0, UnsafeUniformIntDistribution_1.unsafeUniformIntDistribution)(from, to, nextRng), nextRng];
+    };
+}
+exports.uniformIntDistribution = uniformIntDistribution;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UnsafeUniformArrayIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UnsafeUniformArrayIntDistribution.js
@ -0,0 +1,12 @@
+"use strict";
+exports.__esModule = true;
+exports.unsafeUniformArrayIntDistribution = void 0;
+var ArrayInt_1 = require("./internals/ArrayInt");
+var UnsafeUniformArrayIntDistributionInternal_1 = require("./internals/UnsafeUniformArrayIntDistributionInternal");
+function unsafeUniformArrayIntDistribution(from, to, rng) {
+    var rangeSize = (0, ArrayInt_1.trimArrayIntInplace)((0, ArrayInt_1.addOneToPositiveArrayInt)((0, ArrayInt_1.substractArrayIntToNew)(to, from)));
+    var emptyArrayIntData = rangeSize.data.slice(0);
+    var g = (0, UnsafeUniformArrayIntDistributionInternal_1.unsafeUniformArrayIntDistributionInternal)(emptyArrayIntData, rangeSize.data, rng);
+    return (0, ArrayInt_1.trimArrayIntInplace)((0, ArrayInt_1.addArrayIntToNew)({ sign: 1, data: g }, from));
+}
+exports.unsafeUniformArrayIntDistribution = unsafeUniformArrayIntDistribution;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UnsafeUniformBigIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UnsafeUniformBigIntDistribution.js
@ -0,0 +1,28 @@
+"use strict";
+exports.__esModule = true;
+exports.unsafeUniformBigIntDistribution = void 0;
+var SBigInt = typeof BigInt !== 'undefined' ? BigInt : undefined;
+function unsafeUniformBigIntDistribution(from, to, rng) {
+    var diff = to - from + SBigInt(1);
+    var MinRng = SBigInt(-0x80000000);
+    var NumValues = SBigInt(0x100000000);
+    var FinalNumValues = NumValues;
+    var NumIterations = 1;
+    while (FinalNumValues < diff) {
+        FinalNumValues *= NumValues;
+        ++NumIterations;
+    }
+    var MaxAcceptedRandom = FinalNumValues - (FinalNumValues % diff);
+    while (true) {
+        var value = SBigInt(0);
+        for (var num = 0; num !== NumIterations; ++num) {
+            var out = rng.unsafeNext();
+            value = NumValues * value + (SBigInt(out) - MinRng);
+        }
+        if (value < MaxAcceptedRandom) {
+            var inDiff = value % diff;
+            return inDiff + from;
+        }
+    }
+}
+exports.unsafeUniformBigIntDistribution = unsafeUniformBigIntDistribution;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UnsafeUniformIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/UnsafeUniformIntDistribution.js
@ -0,0 +1,34 @@
+"use strict";
+exports.__esModule = true;
+exports.unsafeUniformIntDistribution = void 0;
+var UnsafeUniformIntDistributionInternal_1 = require("./internals/UnsafeUniformIntDistributionInternal");
+var ArrayInt_1 = require("./internals/ArrayInt");
+var UnsafeUniformArrayIntDistributionInternal_1 = require("./internals/UnsafeUniformArrayIntDistributionInternal");
+var safeNumberMaxSafeInteger = Number.MAX_SAFE_INTEGER;
+var sharedA = { sign: 1, data: [0, 0] };
+var sharedB = { sign: 1, data: [0, 0] };
+var sharedC = { sign: 1, data: [0, 0] };
+var sharedData = [0, 0];
+function uniformLargeIntInternal(from, to, rangeSize, rng) {
+    var rangeSizeArrayIntValue = rangeSize <= safeNumberMaxSafeInteger
+        ? (0, ArrayInt_1.fromNumberToArrayInt64)(sharedC, rangeSize)
+        : (0, ArrayInt_1.substractArrayInt64)(sharedC, (0, ArrayInt_1.fromNumberToArrayInt64)(sharedA, to), (0, ArrayInt_1.fromNumberToArrayInt64)(sharedB, from));
+    if (rangeSizeArrayIntValue.data[1] === 0xffffffff) {
+        rangeSizeArrayIntValue.data[0] += 1;
+        rangeSizeArrayIntValue.data[1] = 0;
+    }
+    else {
+        rangeSizeArrayIntValue.data[1] += 1;
+    }
+    (0, UnsafeUniformArrayIntDistributionInternal_1.unsafeUniformArrayIntDistributionInternal)(sharedData, rangeSizeArrayIntValue.data, rng);
+    return sharedData[0] * 0x100000000 + sharedData[1] + from;
+}
+function unsafeUniformIntDistribution(from, to, rng) {
+    var rangeSize = to - from;
+    if (rangeSize <= 0xffffffff) {
+        var g = (0, UnsafeUniformIntDistributionInternal_1.unsafeUniformIntDistributionInternal)(rangeSize + 1, rng);
+        return g + from;
+    }
+    return uniformLargeIntInternal(from, to, rangeSize, rng);
+}
+exports.unsafeUniformIntDistribution = unsafeUniformIntDistribution;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/internals/ArrayInt.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/internals/ArrayInt.js
@ -0,0 +1,141 @@
+"use strict";
+exports.__esModule = true;
+exports.substractArrayInt64 = exports.fromNumberToArrayInt64 = exports.trimArrayIntInplace = exports.substractArrayIntToNew = exports.addOneToPositiveArrayInt = exports.addArrayIntToNew = void 0;
+function addArrayIntToNew(arrayIntA, arrayIntB) {
+    if (arrayIntA.sign !== arrayIntB.sign) {
+        return substractArrayIntToNew(arrayIntA, { sign: -arrayIntB.sign, data: arrayIntB.data });
+    }
+    var data = [];
+    var reminder = 0;
+    var dataA = arrayIntA.data;
+    var dataB = arrayIntB.data;
+    for (var indexA = dataA.length - 1, indexB = dataB.length - 1; indexA >= 0 || indexB >= 0; --indexA, --indexB) {
+        var vA = indexA >= 0 ? dataA[indexA] : 0;
+        var vB = indexB >= 0 ? dataB[indexB] : 0;
+        var current = vA + vB + reminder;
+        data.push(current >>> 0);
+        reminder = ~~(current / 0x100000000);
+    }
+    if (reminder !== 0) {
+        data.push(reminder);
+    }
+    return { sign: arrayIntA.sign, data: data.reverse() };
+}
+exports.addArrayIntToNew = addArrayIntToNew;
+function addOneToPositiveArrayInt(arrayInt) {
+    arrayInt.sign = 1;
+    var data = arrayInt.data;
+    for (var index = data.length - 1; index >= 0; --index) {
+        if (data[index] === 0xffffffff) {
+            data[index] = 0;
+        }
+        else {
+            data[index] += 1;
+            return arrayInt;
+        }
+    }
+    data.unshift(1);
+    return arrayInt;
+}
+exports.addOneToPositiveArrayInt = addOneToPositiveArrayInt;
+function isStrictlySmaller(dataA, dataB) {
+    var maxLength = Math.max(dataA.length, dataB.length);
+    for (var index = 0; index < maxLength; ++index) {
+        var indexA = index + dataA.length - maxLength;
+        var indexB = index + dataB.length - maxLength;
+        var vA = indexA >= 0 ? dataA[indexA] : 0;
+        var vB = indexB >= 0 ? dataB[indexB] : 0;
+        if (vA < vB)
+            return true;
+        if (vA > vB)
+            return false;
+    }
+    return false;
+}
+function substractArrayIntToNew(arrayIntA, arrayIntB) {
+    if (arrayIntA.sign !== arrayIntB.sign) {
+        return addArrayIntToNew(arrayIntA, { sign: -arrayIntB.sign, data: arrayIntB.data });
+    }
+    var dataA = arrayIntA.data;
+    var dataB = arrayIntB.data;
+    if (isStrictlySmaller(dataA, dataB)) {
+        var out = substractArrayIntToNew(arrayIntB, arrayIntA);
+        out.sign = -out.sign;
+        return out;
+    }
+    var data = [];
+    var reminder = 0;
+    for (var indexA = dataA.length - 1, indexB = dataB.length - 1; indexA >= 0 || indexB >= 0; --indexA, --indexB) {
+        var vA = indexA >= 0 ? dataA[indexA] : 0;
+        var vB = indexB >= 0 ? dataB[indexB] : 0;
+        var current = vA - vB - reminder;
+        data.push(current >>> 0);
+        reminder = current < 0 ? 1 : 0;
+    }
+    return { sign: arrayIntA.sign, data: data.reverse() };
+}
+exports.substractArrayIntToNew = substractArrayIntToNew;
+function trimArrayIntInplace(arrayInt) {
+    var data = arrayInt.data;
+    var firstNonZero = 0;
+    for (; firstNonZero !== data.length && data[firstNonZero] === 0; ++firstNonZero) { }
+    if (firstNonZero === data.length) {
+        arrayInt.sign = 1;
+        arrayInt.data = [0];
+        return arrayInt;
+    }
+    data.splice(0, firstNonZero);
+    return arrayInt;
+}
+exports.trimArrayIntInplace = trimArrayIntInplace;
+function fromNumberToArrayInt64(out, n) {
+    if (n < 0) {
+        var posN = -n;
+        out.sign = -1;
+        out.data[0] = ~~(posN / 0x100000000);
+        out.data[1] = posN >>> 0;
+    }
+    else {
+        out.sign = 1;
+        out.data[0] = ~~(n / 0x100000000);
+        out.data[1] = n >>> 0;
+    }
+    return out;
+}
+exports.fromNumberToArrayInt64 = fromNumberToArrayInt64;
+function substractArrayInt64(out, arrayIntA, arrayIntB) {
+    var lowA = arrayIntA.data[1];
+    var highA = arrayIntA.data[0];
+    var signA = arrayIntA.sign;
+    var lowB = arrayIntB.data[1];
+    var highB = arrayIntB.data[0];
+    var signB = arrayIntB.sign;
+    out.sign = 1;
+    if (signA === 1 && signB === -1) {
+        var low_1 = lowA + lowB;
+        var high = highA + highB + (low_1 > 0xffffffff ? 1 : 0);
+        out.data[0] = high >>> 0;
+        out.data[1] = low_1 >>> 0;
+        return out;
+    }
+    var lowFirst = lowA;
+    var highFirst = highA;
+    var lowSecond = lowB;
+    var highSecond = highB;
+    if (signA === -1) {
+        lowFirst = lowB;
+        highFirst = highB;
+        lowSecond = lowA;
+        highSecond = highA;
+    }
+    var reminderLow = 0;
+    var low = lowFirst - lowSecond;
+    if (low < 0) {
+        reminderLow = 1;
+        low = low >>> 0;
+    }
+    out.data[0] = highFirst - highSecond - reminderLow;
+    out.data[1] = low;
+    return out;
+}
+exports.substractArrayInt64 = substractArrayInt64;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/internals/UnsafeUniformArrayIntDistributionInternal.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/internals/UnsafeUniformArrayIntDistributionInternal.js
@ -0,0 +1,25 @@
+"use strict";
+exports.__esModule = true;
+exports.unsafeUniformArrayIntDistributionInternal = void 0;
+var UnsafeUniformIntDistributionInternal_1 = require("./UnsafeUniformIntDistributionInternal");
+function unsafeUniformArrayIntDistributionInternal(out, rangeSize, rng) {
+    var rangeLength = rangeSize.length;
+    while (true) {
+        for (var index = 0; index !== rangeLength; ++index) {
+            var indexRangeSize = index === 0 ? rangeSize[0] + 1 : 0x100000000;
+            var g = (0, UnsafeUniformIntDistributionInternal_1.unsafeUniformIntDistributionInternal)(indexRangeSize, rng);
+            out[index] = g;
+        }
+        for (var index = 0; index !== rangeLength; ++index) {
+            var current = out[index];
+            var currentInRange = rangeSize[index];
+            if (current < currentInRange) {
+                return out;
+            }
+            else if (current > currentInRange) {
+                break;
+            }
+        }
+    }
+}
+exports.unsafeUniformArrayIntDistributionInternal = unsafeUniformArrayIntDistributionInternal;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/internals/UnsafeUniformIntDistributionInternal.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/distribution/internals/UnsafeUniformIntDistributionInternal.js
@ -0,0 +1,12 @@
+"use strict";
+exports.__esModule = true;
+exports.unsafeUniformIntDistributionInternal = void 0;
+function unsafeUniformIntDistributionInternal(rangeSize, rng) {
+    var MaxAllowed = rangeSize > 2 ? ~~(0x100000000 / rangeSize) * rangeSize : 0x100000000;
+    var deltaV = rng.unsafeNext() + 0x80000000;
+    while (deltaV >= MaxAllowed) {
+        deltaV = rng.unsafeNext() + 0x80000000;
+    }
+    return deltaV % rangeSize;
+}
+exports.unsafeUniformIntDistributionInternal = unsafeUniformIntDistributionInternal;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/Distribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/Distribution.js
@ -0,0 +1 @@
+export {};
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UniformArrayIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UniformArrayIntDistribution.js
@ -0,0 +1,12 @@
+import { unsafeUniformArrayIntDistribution } from './UnsafeUniformArrayIntDistribution.js';
+function uniformArrayIntDistribution(from, to, rng) {
+    if (rng != null) {
+        var nextRng = rng.clone();
+        return [unsafeUniformArrayIntDistribution(from, to, nextRng), nextRng];
+    }
+    return function (rng) {
+        var nextRng = rng.clone();
+        return [unsafeUniformArrayIntDistribution(from, to, nextRng), nextRng];
+    };
+}
+export { uniformArrayIntDistribution };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UniformBigIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UniformBigIntDistribution.js
@ -0,0 +1,12 @@
+import { unsafeUniformBigIntDistribution } from './UnsafeUniformBigIntDistribution.js';
+function uniformBigIntDistribution(from, to, rng) {
+    if (rng != null) {
+        var nextRng = rng.clone();
+        return [unsafeUniformBigIntDistribution(from, to, nextRng), nextRng];
+    }
+    return function (rng) {
+        var nextRng = rng.clone();
+        return [unsafeUniformBigIntDistribution(from, to, nextRng), nextRng];
+    };
+}
+export { uniformBigIntDistribution };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UniformIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UniformIntDistribution.js
@ -0,0 +1,12 @@
+import { unsafeUniformIntDistribution } from './UnsafeUniformIntDistribution.js';
+function uniformIntDistribution(from, to, rng) {
+    if (rng != null) {
+        var nextRng = rng.clone();
+        return [unsafeUniformIntDistribution(from, to, nextRng), nextRng];
+    }
+    return function (rng) {
+        var nextRng = rng.clone();
+        return [unsafeUniformIntDistribution(from, to, nextRng), nextRng];
+    };
+}
+export { uniformIntDistribution };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UnsafeUniformArrayIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UnsafeUniformArrayIntDistribution.js
@ -0,0 +1,8 @@
+import { addArrayIntToNew, addOneToPositiveArrayInt, substractArrayIntToNew, trimArrayIntInplace, } from './internals/ArrayInt.js';
+import { unsafeUniformArrayIntDistributionInternal } from './internals/UnsafeUniformArrayIntDistributionInternal.js';
+export function unsafeUniformArrayIntDistribution(from, to, rng) {
+    var rangeSize = trimArrayIntInplace(addOneToPositiveArrayInt(substractArrayIntToNew(to, from)));
+    var emptyArrayIntData = rangeSize.data.slice(0);
+    var g = unsafeUniformArrayIntDistributionInternal(emptyArrayIntData, rangeSize.data, rng);
+    return trimArrayIntInplace(addArrayIntToNew({ sign: 1, data: g }, from));
+}
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UnsafeUniformBigIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UnsafeUniformBigIntDistribution.js
@ -0,0 +1,24 @@
+var SBigInt = typeof BigInt !== 'undefined' ? BigInt : undefined;
+export function unsafeUniformBigIntDistribution(from, to, rng) {
+    var diff = to - from + SBigInt(1);
+    var MinRng = SBigInt(-0x80000000);
+    var NumValues = SBigInt(0x100000000);
+    var FinalNumValues = NumValues;
+    var NumIterations = 1;
+    while (FinalNumValues < diff) {
+        FinalNumValues *= NumValues;
+        ++NumIterations;
+    }
+    var MaxAcceptedRandom = FinalNumValues - (FinalNumValues % diff);
+    while (true) {
+        var value = SBigInt(0);
+        for (var num = 0; num !== NumIterations; ++num) {
+            var out = rng.unsafeNext();
+            value = NumValues * value + (SBigInt(out) - MinRng);
+        }
+        if (value < MaxAcceptedRandom) {
+            var inDiff = value % diff;
+            return inDiff + from;
+        }
+    }
+}
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UnsafeUniformIntDistribution.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/UnsafeUniformIntDistribution.js
@ -0,0 +1,30 @@
+import { unsafeUniformIntDistributionInternal } from './internals/UnsafeUniformIntDistributionInternal.js';
+import { fromNumberToArrayInt64, substractArrayInt64 } from './internals/ArrayInt.js';
+import { unsafeUniformArrayIntDistributionInternal } from './internals/UnsafeUniformArrayIntDistributionInternal.js';
+var safeNumberMaxSafeInteger = Number.MAX_SAFE_INTEGER;
+var sharedA = { sign: 1, data: [0, 0] };
+var sharedB = { sign: 1, data: [0, 0] };
+var sharedC = { sign: 1, data: [0, 0] };
+var sharedData = [0, 0];
+function uniformLargeIntInternal(from, to, rangeSize, rng) {
+    var rangeSizeArrayIntValue = rangeSize <= safeNumberMaxSafeInteger
+        ? fromNumberToArrayInt64(sharedC, rangeSize)
+        : substractArrayInt64(sharedC, fromNumberToArrayInt64(sharedA, to), fromNumberToArrayInt64(sharedB, from));
+    if (rangeSizeArrayIntValue.data[1] === 0xffffffff) {
+        rangeSizeArrayIntValue.data[0] += 1;
+        rangeSizeArrayIntValue.data[1] = 0;
+    }
+    else {
+        rangeSizeArrayIntValue.data[1] += 1;
+    }
+    unsafeUniformArrayIntDistributionInternal(sharedData, rangeSizeArrayIntValue.data, rng);
+    return sharedData[0] * 0x100000000 + sharedData[1] + from;
+}
+export function unsafeUniformIntDistribution(from, to, rng) {
+    var rangeSize = to - from;
+    if (rangeSize <= 0xffffffff) {
+        var g = unsafeUniformIntDistributionInternal(rangeSize + 1, rng);
+        return g + from;
+    }
+    return uniformLargeIntInternal(from, to, rangeSize, rng);
+}
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/internals/ArrayInt.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/internals/ArrayInt.js
@ -0,0 +1,132 @@
+export function addArrayIntToNew(arrayIntA, arrayIntB) {
+    if (arrayIntA.sign !== arrayIntB.sign) {
+        return substractArrayIntToNew(arrayIntA, { sign: -arrayIntB.sign, data: arrayIntB.data });
+    }
+    var data = [];
+    var reminder = 0;
+    var dataA = arrayIntA.data;
+    var dataB = arrayIntB.data;
+    for (var indexA = dataA.length - 1, indexB = dataB.length - 1; indexA >= 0 || indexB >= 0; --indexA, --indexB) {
+        var vA = indexA >= 0 ? dataA[indexA] : 0;
+        var vB = indexB >= 0 ? dataB[indexB] : 0;
+        var current = vA + vB + reminder;
+        data.push(current >>> 0);
+        reminder = ~~(current / 0x100000000);
+    }
+    if (reminder !== 0) {
+        data.push(reminder);
+    }
+    return { sign: arrayIntA.sign, data: data.reverse() };
+}
+export function addOneToPositiveArrayInt(arrayInt) {
+    arrayInt.sign = 1;
+    var data = arrayInt.data;
+    for (var index = data.length - 1; index >= 0; --index) {
+        if (data[index] === 0xffffffff) {
+            data[index] = 0;
+        }
+        else {
+            data[index] += 1;
+            return arrayInt;
+        }
+    }
+    data.unshift(1);
+    return arrayInt;
+}
+function isStrictlySmaller(dataA, dataB) {
+    var maxLength = Math.max(dataA.length, dataB.length);
+    for (var index = 0; index < maxLength; ++index) {
+        var indexA = index + dataA.length - maxLength;
+        var indexB = index + dataB.length - maxLength;
+        var vA = indexA >= 0 ? dataA[indexA] : 0;
+        var vB = indexB >= 0 ? dataB[indexB] : 0;
+        if (vA < vB)
+            return true;
+        if (vA > vB)
+            return false;
+    }
+    return false;
+}
+export function substractArrayIntToNew(arrayIntA, arrayIntB) {
+    if (arrayIntA.sign !== arrayIntB.sign) {
+        return addArrayIntToNew(arrayIntA, { sign: -arrayIntB.sign, data: arrayIntB.data });
+    }
+    var dataA = arrayIntA.data;
+    var dataB = arrayIntB.data;
+    if (isStrictlySmaller(dataA, dataB)) {
+        var out = substractArrayIntToNew(arrayIntB, arrayIntA);
+        out.sign = -out.sign;
+        return out;
+    }
+    var data = [];
+    var reminder = 0;
+    for (var indexA = dataA.length - 1, indexB = dataB.length - 1; indexA >= 0 || indexB >= 0; --indexA, --indexB) {
+        var vA = indexA >= 0 ? dataA[indexA] : 0;
+        var vB = indexB >= 0 ? dataB[indexB] : 0;
+        var current = vA - vB - reminder;
+        data.push(current >>> 0);
+        reminder = current < 0 ? 1 : 0;
+    }
+    return { sign: arrayIntA.sign, data: data.reverse() };
+}
+export function trimArrayIntInplace(arrayInt) {
+    var data = arrayInt.data;
+    var firstNonZero = 0;
+    for (; firstNonZero !== data.length && data[firstNonZero] === 0; ++firstNonZero) { }
+    if (firstNonZero === data.length) {
+        arrayInt.sign = 1;
+        arrayInt.data = [0];
+        return arrayInt;
+    }
+    data.splice(0, firstNonZero);
+    return arrayInt;
+}
+export function fromNumberToArrayInt64(out, n) {
+    if (n < 0) {
+        var posN = -n;
+        out.sign = -1;
+        out.data[0] = ~~(posN / 0x100000000);
+        out.data[1] = posN >>> 0;
+    }
+    else {
+        out.sign = 1;
+        out.data[0] = ~~(n / 0x100000000);
+        out.data[1] = n >>> 0;
+    }
+    return out;
+}
+export function substractArrayInt64(out, arrayIntA, arrayIntB) {
+    var lowA = arrayIntA.data[1];
+    var highA = arrayIntA.data[0];
+    var signA = arrayIntA.sign;
+    var lowB = arrayIntB.data[1];
+    var highB = arrayIntB.data[0];
+    var signB = arrayIntB.sign;
+    out.sign = 1;
+    if (signA === 1 && signB === -1) {
+        var low_1 = lowA + lowB;
+        var high = highA + highB + (low_1 > 0xffffffff ? 1 : 0);
+        out.data[0] = high >>> 0;
+        out.data[1] = low_1 >>> 0;
+        return out;
+    }
+    var lowFirst = lowA;
+    var highFirst = highA;
+    var lowSecond = lowB;
+    var highSecond = highB;
+    if (signA === -1) {
+        lowFirst = lowB;
+        highFirst = highB;
+        lowSecond = lowA;
+        highSecond = highA;
+    }
+    var reminderLow = 0;
+    var low = lowFirst - lowSecond;
+    if (low < 0) {
+        reminderLow = 1;
+        low = low >>> 0;
+    }
+    out.data[0] = highFirst - highSecond - reminderLow;
+    out.data[1] = low;
+    return out;
+}
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/internals/UnsafeUniformArrayIntDistributionInternal.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/internals/UnsafeUniformArrayIntDistributionInternal.js
@ -0,0 +1,21 @@
+import { unsafeUniformIntDistributionInternal } from './UnsafeUniformIntDistributionInternal.js';
+export function unsafeUniformArrayIntDistributionInternal(out, rangeSize, rng) {
+    var rangeLength = rangeSize.length;
+    while (true) {
+        for (var index = 0; index !== rangeLength; ++index) {
+            var indexRangeSize = index === 0 ? rangeSize[0] + 1 : 0x100000000;
+            var g = unsafeUniformIntDistributionInternal(indexRangeSize, rng);
+            out[index] = g;
+        }
+        for (var index = 0; index !== rangeLength; ++index) {
+            var current = out[index];
+            var currentInRange = rangeSize[index];
+            if (current < currentInRange) {
+                return out;
+            }
+            else if (current > currentInRange) {
+                break;
+            }
+        }
+    }
+}
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/internals/UnsafeUniformIntDistributionInternal.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/distribution/internals/UnsafeUniformIntDistributionInternal.js
@ -0,0 +1,8 @@
+export function unsafeUniformIntDistributionInternal(rangeSize, rng) {
+    var MaxAllowed = rangeSize > 2 ? ~~(0x100000000 / rangeSize) * rangeSize : 0x100000000;
+    var deltaV = rng.unsafeNext() + 0x80000000;
+    while (deltaV >= MaxAllowed) {
+        deltaV = rng.unsafeNext() + 0x80000000;
+    }
+    return deltaV % rangeSize;
+}
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/generator/LinearCongruential.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/generator/LinearCongruential.js
@ -0,0 +1,47 @@
+var MULTIPLIER = 0x000343fd;
+var INCREMENT = 0x00269ec3;
+var MASK = 0xffffffff;
+var MASK_2 = (1 << 31) - 1;
+var computeNextSeed = function (seed) {
+    return (seed * MULTIPLIER + INCREMENT) & MASK;
+};
+var computeValueFromNextSeed = function (nextseed) {
+    return (nextseed & MASK_2) >> 16;
+};
+var LinearCongruential32 = (function () {
+    function LinearCongruential32(seed) {
+        this.seed = seed;
+    }
+    LinearCongruential32.prototype.clone = function () {
+        return new LinearCongruential32(this.seed);
+    };
+    LinearCongruential32.prototype.next = function () {
+        var nextRng = new LinearCongruential32(this.seed);
+        var out = nextRng.unsafeNext();
+        return [out, nextRng];
+    };
+    LinearCongruential32.prototype.unsafeNext = function () {
+        var s1 = computeNextSeed(this.seed);
+        var v1 = computeValueFromNextSeed(s1);
+        var s2 = computeNextSeed(s1);
+        var v2 = computeValueFromNextSeed(s2);
+        this.seed = computeNextSeed(s2);
+        var v3 = computeValueFromNextSeed(this.seed);
+        var vnext = v3 + ((v2 + (v1 << 15)) << 15);
+        return vnext | 0;
+    };
+    LinearCongruential32.prototype.getState = function () {
+        return [this.seed];
+    };
+    return LinearCongruential32;
+}());
+function fromState(state) {
+    var valid = state.length === 1;
+    if (!valid) {
+        throw new Error('The state must have been produced by a congruential32 RandomGenerator');
+    }
+    return new LinearCongruential32(state[0]);
+}
+export var congruential32 = Object.assign(function (seed) {
+    return new LinearCongruential32(seed);
+}, { fromState: fromState });
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/generator/MersenneTwister.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/generator/MersenneTwister.js
@ -0,0 +1,107 @@
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+};
+var MersenneTwister = (function () {
+    function MersenneTwister(states, index) {
+        this.states = states;
+        this.index = index;
+    }
+    MersenneTwister.twist = function (prev) {
+        var mt = prev.slice();
+        for (var idx = 0; idx !== MersenneTwister.N - MersenneTwister.M; ++idx) {
+            var y_1 = (mt[idx] & MersenneTwister.MASK_UPPER) + (mt[idx + 1] & MersenneTwister.MASK_LOWER);
+            mt[idx] = mt[idx + MersenneTwister.M] ^ (y_1 >>> 1) ^ (-(y_1 & 1) & MersenneTwister.A);
+        }
+        for (var idx = MersenneTwister.N - MersenneTwister.M; idx !== MersenneTwister.N - 1; ++idx) {
+            var y_2 = (mt[idx] & MersenneTwister.MASK_UPPER) + (mt[idx + 1] & MersenneTwister.MASK_LOWER);
+            mt[idx] = mt[idx + MersenneTwister.M - MersenneTwister.N] ^ (y_2 >>> 1) ^ (-(y_2 & 1) & MersenneTwister.A);
+        }
+        var y = (mt[MersenneTwister.N - 1] & MersenneTwister.MASK_UPPER) + (mt[0] & MersenneTwister.MASK_LOWER);
+        mt[MersenneTwister.N - 1] = mt[MersenneTwister.M - 1] ^ (y >>> 1) ^ (-(y & 1) & MersenneTwister.A);
+        return mt;
+    };
+    MersenneTwister.seeded = function (seed) {
+        var out = Array(MersenneTwister.N);
+        out[0] = seed;
+        for (var idx = 1; idx !== MersenneTwister.N; ++idx) {
+            var xored = out[idx - 1] ^ (out[idx - 1] >>> 30);
+            out[idx] = (Math.imul(MersenneTwister.F, xored) + idx) | 0;
+        }
+        return out;
+    };
+    MersenneTwister.from = function (seed) {
+        return new MersenneTwister(MersenneTwister.twist(MersenneTwister.seeded(seed)), 0);
+    };
+    MersenneTwister.prototype.clone = function () {
+        return new MersenneTwister(this.states, this.index);
+    };
+    MersenneTwister.prototype.next = function () {
+        var nextRng = new MersenneTwister(this.states, this.index);
+        var out = nextRng.unsafeNext();
+        return [out, nextRng];
+    };
+    MersenneTwister.prototype.unsafeNext = function () {
+        var y = this.states[this.index];
+        y ^= this.states[this.index] >>> MersenneTwister.U;
+        y ^= (y << MersenneTwister.S) & MersenneTwister.B;
+        y ^= (y << MersenneTwister.T) & MersenneTwister.C;
+        y ^= y >>> MersenneTwister.L;
+        if (++this.index >= MersenneTwister.N) {
+            this.states = MersenneTwister.twist(this.states);
+            this.index = 0;
+        }
+        return y;
+    };
+    MersenneTwister.prototype.getState = function () {
+        return __spreadArray([this.index], __read(this.states), false);
+    };
+    MersenneTwister.fromState = function (state) {
+        var valid = state.length === MersenneTwister.N + 1 && state[0] >= 0 && state[0] < MersenneTwister.N;
+        if (!valid) {
+            throw new Error('The state must have been produced by a mersenne RandomGenerator');
+        }
+        return new MersenneTwister(state.slice(1), state[0]);
+    };
+    MersenneTwister.N = 624;
+    MersenneTwister.M = 397;
+    MersenneTwister.R = 31;
+    MersenneTwister.A = 0x9908b0df;
+    MersenneTwister.F = 1812433253;
+    MersenneTwister.U = 11;
+    MersenneTwister.S = 7;
+    MersenneTwister.B = 0x9d2c5680;
+    MersenneTwister.T = 15;
+    MersenneTwister.C = 0xefc60000;
+    MersenneTwister.L = 18;
+    MersenneTwister.MASK_LOWER = Math.pow(2, MersenneTwister.R) - 1;
+    MersenneTwister.MASK_UPPER = Math.pow(2, MersenneTwister.R);
+    return MersenneTwister;
+}());
+function fromState(state) {
+    return MersenneTwister.fromState(state);
+}
+export default Object.assign(function (seed) {
+    return MersenneTwister.from(seed);
+}, { fromState: fromState });
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/generator/RandomGenerator.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/generator/RandomGenerator.js
@ -0,0 +1,22 @@
+export function unsafeGenerateN(rng, num) {
+    var out = [];
+    for (var idx = 0; idx != num; ++idx) {
+        out.push(rng.unsafeNext());
+    }
+    return out;
+}
+export function generateN(rng, num) {
+    var nextRng = rng.clone();
+    var out = unsafeGenerateN(nextRng, num);
+    return [out, nextRng];
+}
+export function unsafeSkipN(rng, num) {
+    for (var idx = 0; idx != num; ++idx) {
+        rng.unsafeNext();
+    }
+}
+export function skipN(rng, num) {
+    var nextRng = rng.clone();
+    unsafeSkipN(nextRng, num);
+    return nextRng;
+}
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/generator/XorShift.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/generator/XorShift.js
@ -0,0 +1,69 @@
+var XorShift128Plus = (function () {
+    function XorShift128Plus(s01, s00, s11, s10) {
+        this.s01 = s01;
+        this.s00 = s00;
+        this.s11 = s11;
+        this.s10 = s10;
+    }
+    XorShift128Plus.prototype.clone = function () {
+        return new XorShift128Plus(this.s01, this.s00, this.s11, this.s10);
+    };
+    XorShift128Plus.prototype.next = function () {
+        var nextRng = new XorShift128Plus(this.s01, this.s00, this.s11, this.s10);
+        var out = nextRng.unsafeNext();
+        return [out, nextRng];
+    };
+    XorShift128Plus.prototype.unsafeNext = function () {
+        var a0 = this.s00 ^ (this.s00 << 23);
+        var a1 = this.s01 ^ ((this.s01 << 23) | (this.s00 >>> 9));
+        var b0 = a0 ^ this.s10 ^ ((a0 >>> 18) | (a1 << 14)) ^ ((this.s10 >>> 5) | (this.s11 << 27));
+        var b1 = a1 ^ this.s11 ^ (a1 >>> 18) ^ (this.s11 >>> 5);
+        var out = (this.s00 + this.s10) | 0;
+        this.s01 = this.s11;
+        this.s00 = this.s10;
+        this.s11 = b1;
+        this.s10 = b0;
+        return out;
+    };
+    XorShift128Plus.prototype.jump = function () {
+        var nextRng = new XorShift128Plus(this.s01, this.s00, this.s11, this.s10);
+        nextRng.unsafeJump();
+        return nextRng;
+    };
+    XorShift128Plus.prototype.unsafeJump = function () {
+        var ns01 = 0;
+        var ns00 = 0;
+        var ns11 = 0;
+        var ns10 = 0;
+        var jump = [0x635d2dff, 0x8a5cd789, 0x5c472f96, 0x121fd215];
+        for (var i = 0; i !== 4; ++i) {
+            for (var mask = 1; mask; mask <<= 1) {
+                if (jump[i] & mask) {
+                    ns01 ^= this.s01;
+                    ns00 ^= this.s00;
+                    ns11 ^= this.s11;
+                    ns10 ^= this.s10;
+                }
+                this.unsafeNext();
+            }
+        }
+        this.s01 = ns01;
+        this.s00 = ns00;
+        this.s11 = ns11;
+        this.s10 = ns10;
+    };
+    XorShift128Plus.prototype.getState = function () {
+        return [this.s01, this.s00, this.s11, this.s10];
+    };
+    return XorShift128Plus;
+}());
+function fromState(state) {
+    var valid = state.length === 4;
+    if (!valid) {
+        throw new Error('The state must have been produced by a xorshift128plus RandomGenerator');
+    }
+    return new XorShift128Plus(state[0], state[1], state[2], state[3]);
+}
+export var xorshift128plus = Object.assign(function (seed) {
+    return new XorShift128Plus(-1, ~seed, seed | 0, 0);
+}, { fromState: fromState });
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/generator/XoroShiro.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/generator/XoroShiro.js
@ -0,0 +1,69 @@
+var XoroShiro128Plus = (function () {
+    function XoroShiro128Plus(s01, s00, s11, s10) {
+        this.s01 = s01;
+        this.s00 = s00;
+        this.s11 = s11;
+        this.s10 = s10;
+    }
+    XoroShiro128Plus.prototype.clone = function () {
+        return new XoroShiro128Plus(this.s01, this.s00, this.s11, this.s10);
+    };
+    XoroShiro128Plus.prototype.next = function () {
+        var nextRng = new XoroShiro128Plus(this.s01, this.s00, this.s11, this.s10);
+        var out = nextRng.unsafeNext();
+        return [out, nextRng];
+    };
+    XoroShiro128Plus.prototype.unsafeNext = function () {
+        var out = (this.s00 + this.s10) | 0;
+        var a0 = this.s10 ^ this.s00;
+        var a1 = this.s11 ^ this.s01;
+        var s00 = this.s00;
+        var s01 = this.s01;
+        this.s00 = (s00 << 24) ^ (s01 >>> 8) ^ a0 ^ (a0 << 16);
+        this.s01 = (s01 << 24) ^ (s00 >>> 8) ^ a1 ^ ((a1 << 16) | (a0 >>> 16));
+        this.s10 = (a1 << 5) ^ (a0 >>> 27);
+        this.s11 = (a0 << 5) ^ (a1 >>> 27);
+        return out;
+    };
+    XoroShiro128Plus.prototype.jump = function () {
+        var nextRng = new XoroShiro128Plus(this.s01, this.s00, this.s11, this.s10);
+        nextRng.unsafeJump();
+        return nextRng;
+    };
+    XoroShiro128Plus.prototype.unsafeJump = function () {
+        var ns01 = 0;
+        var ns00 = 0;
+        var ns11 = 0;
+        var ns10 = 0;
+        var jump = [0xd8f554a5, 0xdf900294, 0x4b3201fc, 0x170865df];
+        for (var i = 0; i !== 4; ++i) {
+            for (var mask = 1; mask; mask <<= 1) {
+                if (jump[i] & mask) {
+                    ns01 ^= this.s01;
+                    ns00 ^= this.s00;
+                    ns11 ^= this.s11;
+                    ns10 ^= this.s10;
+                }
+                this.unsafeNext();
+            }
+        }
+        this.s01 = ns01;
+        this.s00 = ns00;
+        this.s11 = ns11;
+        this.s10 = ns10;
+    };
+    XoroShiro128Plus.prototype.getState = function () {
+        return [this.s01, this.s00, this.s11, this.s10];
+    };
+    return XoroShiro128Plus;
+}());
+function fromState(state) {
+    var valid = state.length === 4;
+    if (!valid) {
+        throw new Error('The state must have been produced by a xoroshiro128plus RandomGenerator');
+    }
+    return new XoroShiro128Plus(state[0], state[1], state[2], state[3]);
+}
+export var xoroshiro128plus = Object.assign(function (seed) {
+    return new XoroShiro128Plus(-1, ~seed, seed | 0, 0);
+}, { fromState: fromState });
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/package.json
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/package.json
@ -0,0 +1,3 @@
+{
+  "type": "module"
+}
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/pure-rand-default.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/pure-rand-default.js
@ -0,0 +1,15 @@
+import { generateN, skipN, unsafeGenerateN, unsafeSkipN } from './generator/RandomGenerator.js';
+import { congruential32 } from './generator/LinearCongruential.js';
+import mersenne from './generator/MersenneTwister.js';
+import { xorshift128plus } from './generator/XorShift.js';
+import { xoroshiro128plus } from './generator/XoroShiro.js';
+import { uniformArrayIntDistribution } from './distribution/UniformArrayIntDistribution.js';
+import { uniformBigIntDistribution } from './distribution/UniformBigIntDistribution.js';
+import { uniformIntDistribution } from './distribution/UniformIntDistribution.js';
+import { unsafeUniformArrayIntDistribution } from './distribution/UnsafeUniformArrayIntDistribution.js';
+import { unsafeUniformBigIntDistribution } from './distribution/UnsafeUniformBigIntDistribution.js';
+import { unsafeUniformIntDistribution } from './distribution/UnsafeUniformIntDistribution.js';
+var __type = 'module';
+var __version = '6.1.0';
+var __commitHash = 'a413dd2b721516be2ef29adffb515c5ae67bfbad';
+export { __type, __version, __commitHash, generateN, skipN, unsafeGenerateN, unsafeSkipN, congruential32, mersenne, xorshift128plus, xoroshiro128plus, uniformArrayIntDistribution, uniformBigIntDistribution, uniformIntDistribution, unsafeUniformArrayIntDistribution, unsafeUniformBigIntDistribution, unsafeUniformIntDistribution, };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/pure-rand.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/pure-rand.js
@ -0,0 +1,3 @@
+import * as prand from './pure-rand-default.js';
+export default prand;
+export * from './pure-rand-default.js';
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/Distribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/Distribution.d.ts
@ -0,0 +1,2 @@
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+export type Distribution<T> = (rng: RandomGenerator) => [T, RandomGenerator];
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UniformArrayIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UniformArrayIntDistribution.d.ts
@ -0,0 +1,6 @@
+import { Distribution } from './Distribution.js';
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+import { ArrayInt } from './internals/ArrayInt.js';
+declare function uniformArrayIntDistribution(from: ArrayInt, to: ArrayInt): Distribution<ArrayInt>;
+declare function uniformArrayIntDistribution(from: ArrayInt, to: ArrayInt, rng: RandomGenerator): [ArrayInt, RandomGenerator];
+export { uniformArrayIntDistribution };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UniformBigIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UniformBigIntDistribution.d.ts
@ -0,0 +1,5 @@
+import { Distribution } from './Distribution.js';
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+declare function uniformBigIntDistribution(from: bigint, to: bigint): Distribution<bigint>;
+declare function uniformBigIntDistribution(from: bigint, to: bigint, rng: RandomGenerator): [bigint, RandomGenerator];
+export { uniformBigIntDistribution };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UniformIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UniformIntDistribution.d.ts
@ -0,0 +1,5 @@
+import { Distribution } from './Distribution.js';
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+declare function uniformIntDistribution(from: number, to: number): Distribution<number>;
+declare function uniformIntDistribution(from: number, to: number, rng: RandomGenerator): [number, RandomGenerator];
+export { uniformIntDistribution };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UnsafeUniformArrayIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UnsafeUniformArrayIntDistribution.d.ts
@ -0,0 +1,3 @@
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+import { ArrayInt } from './internals/ArrayInt.js';
+export declare function unsafeUniformArrayIntDistribution(from: ArrayInt, to: ArrayInt, rng: RandomGenerator): ArrayInt;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UnsafeUniformBigIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UnsafeUniformBigIntDistribution.d.ts
@ -0,0 +1,2 @@
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+export declare function unsafeUniformBigIntDistribution(from: bigint, to: bigint, rng: RandomGenerator): bigint;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UnsafeUniformIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/UnsafeUniformIntDistribution.d.ts
@ -0,0 +1,2 @@
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+export declare function unsafeUniformIntDistribution(from: number, to: number, rng: RandomGenerator): number;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/internals/ArrayInt.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/internals/ArrayInt.d.ts
@ -0,0 +1,13 @@
+export type ArrayInt = {
+    sign: -1 | 1;
+    data: number[];
+};
+export declare function addArrayIntToNew(arrayIntA: ArrayInt, arrayIntB: ArrayInt): ArrayInt;
+export declare function addOneToPositiveArrayInt(arrayInt: ArrayInt): ArrayInt;
+export declare function substractArrayIntToNew(arrayIntA: ArrayInt, arrayIntB: ArrayInt): ArrayInt;
+export declare function trimArrayIntInplace(arrayInt: ArrayInt): ArrayInt;
+export type ArrayInt64 = Required<ArrayInt> & {
+    data: [number, number];
+};
+export declare function fromNumberToArrayInt64(out: ArrayInt64, n: number): ArrayInt64;
+export declare function substractArrayInt64(out: ArrayInt64, arrayIntA: ArrayInt64, arrayIntB: ArrayInt64): ArrayInt64;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/internals/UnsafeUniformArrayIntDistributionInternal.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/internals/UnsafeUniformArrayIntDistributionInternal.d.ts
@ -0,0 +1,3 @@
+import { RandomGenerator } from '../../generator/RandomGenerator.js';
+import { ArrayInt } from './ArrayInt.js';
+export declare function unsafeUniformArrayIntDistributionInternal(out: ArrayInt['data'], rangeSize: ArrayInt['data'], rng: RandomGenerator): ArrayInt['data'];
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/internals/UnsafeUniformIntDistributionInternal.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/distribution/internals/UnsafeUniformIntDistributionInternal.d.ts
@ -0,0 +1,2 @@
+import { RandomGenerator } from '../../generator/RandomGenerator.js';
+export declare function unsafeUniformIntDistributionInternal(rangeSize: number, rng: RandomGenerator): number;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/generator/LinearCongruential.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/generator/LinearCongruential.d.ts
@ -0,0 +1,6 @@
+import { RandomGenerator } from './RandomGenerator.js';
+declare function fromState(state: readonly number[]): RandomGenerator;
+export declare const congruential32: ((seed: number) => RandomGenerator) & {
+    fromState: typeof fromState;
+};
+export {};
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/generator/MersenneTwister.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/generator/MersenneTwister.d.ts
@ -0,0 +1,6 @@
+import { RandomGenerator } from './RandomGenerator.js';
+declare function fromState(state: readonly number[]): RandomGenerator;
+declare const _default: ((seed: number) => RandomGenerator) & {
+    fromState: typeof fromState;
+};
+export default _default;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/generator/RandomGenerator.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/generator/RandomGenerator.d.ts
@ -0,0 +1,12 @@
+export interface RandomGenerator {
+    clone(): RandomGenerator;
+    next(): [number, RandomGenerator];
+    jump?(): RandomGenerator;
+    unsafeNext(): number;
+    unsafeJump?(): void;
+    getState?(): readonly number[];
+}
+export declare function unsafeGenerateN(rng: RandomGenerator, num: number): number[];
+export declare function generateN(rng: RandomGenerator, num: number): [number[], RandomGenerator];
+export declare function unsafeSkipN(rng: RandomGenerator, num: number): void;
+export declare function skipN(rng: RandomGenerator, num: number): RandomGenerator;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/generator/XorShift.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/generator/XorShift.d.ts
@ -0,0 +1,6 @@
+import { RandomGenerator } from './RandomGenerator.js';
+declare function fromState(state: readonly number[]): RandomGenerator;
+export declare const xorshift128plus: ((seed: number) => RandomGenerator) & {
+    fromState: typeof fromState;
+};
+export {};
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/generator/XoroShiro.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/generator/XoroShiro.d.ts
@ -0,0 +1,6 @@
+import { RandomGenerator } from './RandomGenerator.js';
+declare function fromState(state: readonly number[]): RandomGenerator;
+export declare const xoroshiro128plus: ((seed: number) => RandomGenerator) & {
+    fromState: typeof fromState;
+};
+export {};
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/pure-rand-default.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/pure-rand-default.d.ts
@ -0,0 +1,16 @@
+import { RandomGenerator, generateN, skipN, unsafeGenerateN, unsafeSkipN } from './generator/RandomGenerator.js';
+import { congruential32 } from './generator/LinearCongruential.js';
+import mersenne from './generator/MersenneTwister.js';
+import { xorshift128plus } from './generator/XorShift.js';
+import { xoroshiro128plus } from './generator/XoroShiro.js';
+import { Distribution } from './distribution/Distribution.js';
+import { uniformArrayIntDistribution } from './distribution/UniformArrayIntDistribution.js';
+import { uniformBigIntDistribution } from './distribution/UniformBigIntDistribution.js';
+import { uniformIntDistribution } from './distribution/UniformIntDistribution.js';
+import { unsafeUniformArrayIntDistribution } from './distribution/UnsafeUniformArrayIntDistribution.js';
+import { unsafeUniformBigIntDistribution } from './distribution/UnsafeUniformBigIntDistribution.js';
+import { unsafeUniformIntDistribution } from './distribution/UnsafeUniformIntDistribution.js';
+declare const __type: string;
+declare const __version: string;
+declare const __commitHash: string;
+export { __type, __version, __commitHash, RandomGenerator, generateN, skipN, unsafeGenerateN, unsafeSkipN, congruential32, mersenne, xorshift128plus, xoroshiro128plus, Distribution, uniformArrayIntDistribution, uniformBigIntDistribution, uniformIntDistribution, unsafeUniformArrayIntDistribution, unsafeUniformBigIntDistribution, unsafeUniformIntDistribution, };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/pure-rand.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/esm/types/pure-rand.d.ts
@ -0,0 +1,3 @@
+import * as prand from './pure-rand-default.js';
+export default prand;
+export * from './pure-rand-default.js';
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/generator/LinearCongruential.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/generator/LinearCongruential.js
@ -0,0 +1,50 @@
+"use strict";
+exports.__esModule = true;
+exports.congruential32 = void 0;
+var MULTIPLIER = 0x000343fd;
+var INCREMENT = 0x00269ec3;
+var MASK = 0xffffffff;
+var MASK_2 = (1 << 31) - 1;
+var computeNextSeed = function (seed) {
+    return (seed * MULTIPLIER + INCREMENT) & MASK;
+};
+var computeValueFromNextSeed = function (nextseed) {
+    return (nextseed & MASK_2) >> 16;
+};
+var LinearCongruential32 = (function () {
+    function LinearCongruential32(seed) {
+        this.seed = seed;
+    }
+    LinearCongruential32.prototype.clone = function () {
+        return new LinearCongruential32(this.seed);
+    };
+    LinearCongruential32.prototype.next = function () {
+        var nextRng = new LinearCongruential32(this.seed);
+        var out = nextRng.unsafeNext();
+        return [out, nextRng];
+    };
+    LinearCongruential32.prototype.unsafeNext = function () {
+        var s1 = computeNextSeed(this.seed);
+        var v1 = computeValueFromNextSeed(s1);
+        var s2 = computeNextSeed(s1);
+        var v2 = computeValueFromNextSeed(s2);
+        this.seed = computeNextSeed(s2);
+        var v3 = computeValueFromNextSeed(this.seed);
+        var vnext = v3 + ((v2 + (v1 << 15)) << 15);
+        return vnext | 0;
+    };
+    LinearCongruential32.prototype.getState = function () {
+        return [this.seed];
+    };
+    return LinearCongruential32;
+}());
+function fromState(state) {
+    var valid = state.length === 1;
+    if (!valid) {
+        throw new Error('The state must have been produced by a congruential32 RandomGenerator');
+    }
+    return new LinearCongruential32(state[0]);
+}
+exports.congruential32 = Object.assign(function (seed) {
+    return new LinearCongruential32(seed);
+}, { fromState: fromState });
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/generator/MersenneTwister.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/generator/MersenneTwister.js
@ -0,0 +1,109 @@
+"use strict";
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+};
+exports.__esModule = true;
+var MersenneTwister = (function () {
+    function MersenneTwister(states, index) {
+        this.states = states;
+        this.index = index;
+    }
+    MersenneTwister.twist = function (prev) {
+        var mt = prev.slice();
+        for (var idx = 0; idx !== MersenneTwister.N - MersenneTwister.M; ++idx) {
+            var y_1 = (mt[idx] & MersenneTwister.MASK_UPPER) + (mt[idx + 1] & MersenneTwister.MASK_LOWER);
+            mt[idx] = mt[idx + MersenneTwister.M] ^ (y_1 >>> 1) ^ (-(y_1 & 1) & MersenneTwister.A);
+        }
+        for (var idx = MersenneTwister.N - MersenneTwister.M; idx !== MersenneTwister.N - 1; ++idx) {
+            var y_2 = (mt[idx] & MersenneTwister.MASK_UPPER) + (mt[idx + 1] & MersenneTwister.MASK_LOWER);
+            mt[idx] = mt[idx + MersenneTwister.M - MersenneTwister.N] ^ (y_2 >>> 1) ^ (-(y_2 & 1) & MersenneTwister.A);
+        }
+        var y = (mt[MersenneTwister.N - 1] & MersenneTwister.MASK_UPPER) + (mt[0] & MersenneTwister.MASK_LOWER);
+        mt[MersenneTwister.N - 1] = mt[MersenneTwister.M - 1] ^ (y >>> 1) ^ (-(y & 1) & MersenneTwister.A);
+        return mt;
+    };
+    MersenneTwister.seeded = function (seed) {
+        var out = Array(MersenneTwister.N);
+        out[0] = seed;
+        for (var idx = 1; idx !== MersenneTwister.N; ++idx) {
+            var xored = out[idx - 1] ^ (out[idx - 1] >>> 30);
+            out[idx] = (Math.imul(MersenneTwister.F, xored) + idx) | 0;
+        }
+        return out;
+    };
+    MersenneTwister.from = function (seed) {
+        return new MersenneTwister(MersenneTwister.twist(MersenneTwister.seeded(seed)), 0);
+    };
+    MersenneTwister.prototype.clone = function () {
+        return new MersenneTwister(this.states, this.index);
+    };
+    MersenneTwister.prototype.next = function () {
+        var nextRng = new MersenneTwister(this.states, this.index);
+        var out = nextRng.unsafeNext();
+        return [out, nextRng];
+    };
+    MersenneTwister.prototype.unsafeNext = function () {
+        var y = this.states[this.index];
+        y ^= this.states[this.index] >>> MersenneTwister.U;
+        y ^= (y << MersenneTwister.S) & MersenneTwister.B;
+        y ^= (y << MersenneTwister.T) & MersenneTwister.C;
+        y ^= y >>> MersenneTwister.L;
+        if (++this.index >= MersenneTwister.N) {
+            this.states = MersenneTwister.twist(this.states);
+            this.index = 0;
+        }
+        return y;
+    };
+    MersenneTwister.prototype.getState = function () {
+        return __spreadArray([this.index], __read(this.states), false);
+    };
+    MersenneTwister.fromState = function (state) {
+        var valid = state.length === MersenneTwister.N + 1 && state[0] >= 0 && state[0] < MersenneTwister.N;
+        if (!valid) {
+            throw new Error('The state must have been produced by a mersenne RandomGenerator');
+        }
+        return new MersenneTwister(state.slice(1), state[0]);
+    };
+    MersenneTwister.N = 624;
+    MersenneTwister.M = 397;
+    MersenneTwister.R = 31;
+    MersenneTwister.A = 0x9908b0df;
+    MersenneTwister.F = 1812433253;
+    MersenneTwister.U = 11;
+    MersenneTwister.S = 7;
+    MersenneTwister.B = 0x9d2c5680;
+    MersenneTwister.T = 15;
+    MersenneTwister.C = 0xefc60000;
+    MersenneTwister.L = 18;
+    MersenneTwister.MASK_LOWER = Math.pow(2, MersenneTwister.R) - 1;
+    MersenneTwister.MASK_UPPER = Math.pow(2, MersenneTwister.R);
+    return MersenneTwister;
+}());
+function fromState(state) {
+    return MersenneTwister.fromState(state);
+}
+exports["default"] = Object.assign(function (seed) {
+    return MersenneTwister.from(seed);
+}, { fromState: fromState });
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/generator/RandomGenerator.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/generator/RandomGenerator.js
@ -0,0 +1,29 @@
+"use strict";
+exports.__esModule = true;
+exports.skipN = exports.unsafeSkipN = exports.generateN = exports.unsafeGenerateN = void 0;
+function unsafeGenerateN(rng, num) {
+    var out = [];
+    for (var idx = 0; idx != num; ++idx) {
+        out.push(rng.unsafeNext());
+    }
+    return out;
+}
+exports.unsafeGenerateN = unsafeGenerateN;
+function generateN(rng, num) {
+    var nextRng = rng.clone();
+    var out = unsafeGenerateN(nextRng, num);
+    return [out, nextRng];
+}
+exports.generateN = generateN;
+function unsafeSkipN(rng, num) {
+    for (var idx = 0; idx != num; ++idx) {
+        rng.unsafeNext();
+    }
+}
+exports.unsafeSkipN = unsafeSkipN;
+function skipN(rng, num) {
+    var nextRng = rng.clone();
+    unsafeSkipN(nextRng, num);
+    return nextRng;
+}
+exports.skipN = skipN;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/generator/XorShift.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/generator/XorShift.js
@ -0,0 +1,72 @@
+"use strict";
+exports.__esModule = true;
+exports.xorshift128plus = void 0;
+var XorShift128Plus = (function () {
+    function XorShift128Plus(s01, s00, s11, s10) {
+        this.s01 = s01;
+        this.s00 = s00;
+        this.s11 = s11;
+        this.s10 = s10;
+    }
+    XorShift128Plus.prototype.clone = function () {
+        return new XorShift128Plus(this.s01, this.s00, this.s11, this.s10);
+    };
+    XorShift128Plus.prototype.next = function () {
+        var nextRng = new XorShift128Plus(this.s01, this.s00, this.s11, this.s10);
+        var out = nextRng.unsafeNext();
+        return [out, nextRng];
+    };
+    XorShift128Plus.prototype.unsafeNext = function () {
+        var a0 = this.s00 ^ (this.s00 << 23);
+        var a1 = this.s01 ^ ((this.s01 << 23) | (this.s00 >>> 9));
+        var b0 = a0 ^ this.s10 ^ ((a0 >>> 18) | (a1 << 14)) ^ ((this.s10 >>> 5) | (this.s11 << 27));
+        var b1 = a1 ^ this.s11 ^ (a1 >>> 18) ^ (this.s11 >>> 5);
+        var out = (this.s00 + this.s10) | 0;
+        this.s01 = this.s11;
+        this.s00 = this.s10;
+        this.s11 = b1;
+        this.s10 = b0;
+        return out;
+    };
+    XorShift128Plus.prototype.jump = function () {
+        var nextRng = new XorShift128Plus(this.s01, this.s00, this.s11, this.s10);
+        nextRng.unsafeJump();
+        return nextRng;
+    };
+    XorShift128Plus.prototype.unsafeJump = function () {
+        var ns01 = 0;
+        var ns00 = 0;
+        var ns11 = 0;
+        var ns10 = 0;
+        var jump = [0x635d2dff, 0x8a5cd789, 0x5c472f96, 0x121fd215];
+        for (var i = 0; i !== 4; ++i) {
+            for (var mask = 1; mask; mask <<= 1) {
+                if (jump[i] & mask) {
+                    ns01 ^= this.s01;
+                    ns00 ^= this.s00;
+                    ns11 ^= this.s11;
+                    ns10 ^= this.s10;
+                }
+                this.unsafeNext();
+            }
+        }
+        this.s01 = ns01;
+        this.s00 = ns00;
+        this.s11 = ns11;
+        this.s10 = ns10;
+    };
+    XorShift128Plus.prototype.getState = function () {
+        return [this.s01, this.s00, this.s11, this.s10];
+    };
+    return XorShift128Plus;
+}());
+function fromState(state) {
+    var valid = state.length === 4;
+    if (!valid) {
+        throw new Error('The state must have been produced by a xorshift128plus RandomGenerator');
+    }
+    return new XorShift128Plus(state[0], state[1], state[2], state[3]);
+}
+exports.xorshift128plus = Object.assign(function (seed) {
+    return new XorShift128Plus(-1, ~seed, seed | 0, 0);
+}, { fromState: fromState });
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/generator/XoroShiro.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/generator/XoroShiro.js
@ -0,0 +1,72 @@
+"use strict";
+exports.__esModule = true;
+exports.xoroshiro128plus = void 0;
+var XoroShiro128Plus = (function () {
+    function XoroShiro128Plus(s01, s00, s11, s10) {
+        this.s01 = s01;
+        this.s00 = s00;
+        this.s11 = s11;
+        this.s10 = s10;
+    }
+    XoroShiro128Plus.prototype.clone = function () {
+        return new XoroShiro128Plus(this.s01, this.s00, this.s11, this.s10);
+    };
+    XoroShiro128Plus.prototype.next = function () {
+        var nextRng = new XoroShiro128Plus(this.s01, this.s00, this.s11, this.s10);
+        var out = nextRng.unsafeNext();
+        return [out, nextRng];
+    };
+    XoroShiro128Plus.prototype.unsafeNext = function () {
+        var out = (this.s00 + this.s10) | 0;
+        var a0 = this.s10 ^ this.s00;
+        var a1 = this.s11 ^ this.s01;
+        var s00 = this.s00;
+        var s01 = this.s01;
+        this.s00 = (s00 << 24) ^ (s01 >>> 8) ^ a0 ^ (a0 << 16);
+        this.s01 = (s01 << 24) ^ (s00 >>> 8) ^ a1 ^ ((a1 << 16) | (a0 >>> 16));
+        this.s10 = (a1 << 5) ^ (a0 >>> 27);
+        this.s11 = (a0 << 5) ^ (a1 >>> 27);
+        return out;
+    };
+    XoroShiro128Plus.prototype.jump = function () {
+        var nextRng = new XoroShiro128Plus(this.s01, this.s00, this.s11, this.s10);
+        nextRng.unsafeJump();
+        return nextRng;
+    };
+    XoroShiro128Plus.prototype.unsafeJump = function () {
+        var ns01 = 0;
+        var ns00 = 0;
+        var ns11 = 0;
+        var ns10 = 0;
+        var jump = [0xd8f554a5, 0xdf900294, 0x4b3201fc, 0x170865df];
+        for (var i = 0; i !== 4; ++i) {
+            for (var mask = 1; mask; mask <<= 1) {
+                if (jump[i] & mask) {
+                    ns01 ^= this.s01;
+                    ns00 ^= this.s00;
+                    ns11 ^= this.s11;
+                    ns10 ^= this.s10;
+                }
+                this.unsafeNext();
+            }
+        }
+        this.s01 = ns01;
+        this.s00 = ns00;
+        this.s11 = ns11;
+        this.s10 = ns10;
+    };
+    XoroShiro128Plus.prototype.getState = function () {
+        return [this.s01, this.s00, this.s11, this.s10];
+    };
+    return XoroShiro128Plus;
+}());
+function fromState(state) {
+    var valid = state.length === 4;
+    if (!valid) {
+        throw new Error('The state must have been produced by a xoroshiro128plus RandomGenerator');
+    }
+    return new XoroShiro128Plus(state[0], state[1], state[2], state[3]);
+}
+exports.xoroshiro128plus = Object.assign(function (seed) {
+    return new XoroShiro128Plus(-1, ~seed, seed | 0, 0);
+}, { fromState: fromState });
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/pure-rand-default.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/pure-rand-default.js
@ -0,0 +1,34 @@
+"use strict";
+exports.__esModule = true;
+exports.unsafeUniformIntDistribution = exports.unsafeUniformBigIntDistribution = exports.unsafeUniformArrayIntDistribution = exports.uniformIntDistribution = exports.uniformBigIntDistribution = exports.uniformArrayIntDistribution = exports.xoroshiro128plus = exports.xorshift128plus = exports.mersenne = exports.congruential32 = exports.unsafeSkipN = exports.unsafeGenerateN = exports.skipN = exports.generateN = exports.__commitHash = exports.__version = exports.__type = void 0;
+var RandomGenerator_1 = require("./generator/RandomGenerator");
+exports.generateN = RandomGenerator_1.generateN;
+exports.skipN = RandomGenerator_1.skipN;
+exports.unsafeGenerateN = RandomGenerator_1.unsafeGenerateN;
+exports.unsafeSkipN = RandomGenerator_1.unsafeSkipN;
+var LinearCongruential_1 = require("./generator/LinearCongruential");
+exports.congruential32 = LinearCongruential_1.congruential32;
+var MersenneTwister_1 = require("./generator/MersenneTwister");
+exports.mersenne = MersenneTwister_1["default"];
+var XorShift_1 = require("./generator/XorShift");
+exports.xorshift128plus = XorShift_1.xorshift128plus;
+var XoroShiro_1 = require("./generator/XoroShiro");
+exports.xoroshiro128plus = XoroShiro_1.xoroshiro128plus;
+var UniformArrayIntDistribution_1 = require("./distribution/UniformArrayIntDistribution");
+exports.uniformArrayIntDistribution = UniformArrayIntDistribution_1.uniformArrayIntDistribution;
+var UniformBigIntDistribution_1 = require("./distribution/UniformBigIntDistribution");
+exports.uniformBigIntDistribution = UniformBigIntDistribution_1.uniformBigIntDistribution;
+var UniformIntDistribution_1 = require("./distribution/UniformIntDistribution");
+exports.uniformIntDistribution = UniformIntDistribution_1.uniformIntDistribution;
+var UnsafeUniformArrayIntDistribution_1 = require("./distribution/UnsafeUniformArrayIntDistribution");
+exports.unsafeUniformArrayIntDistribution = UnsafeUniformArrayIntDistribution_1.unsafeUniformArrayIntDistribution;
+var UnsafeUniformBigIntDistribution_1 = require("./distribution/UnsafeUniformBigIntDistribution");
+exports.unsafeUniformBigIntDistribution = UnsafeUniformBigIntDistribution_1.unsafeUniformBigIntDistribution;
+var UnsafeUniformIntDistribution_1 = require("./distribution/UnsafeUniformIntDistribution");
+exports.unsafeUniformIntDistribution = UnsafeUniformIntDistribution_1.unsafeUniformIntDistribution;
+var __type = 'commonjs';
+exports.__type = __type;
+var __version = '6.1.0';
+exports.__version = __version;
+var __commitHash = 'a413dd2b721516be2ef29adffb515c5ae67bfbad';
+exports.__commitHash = __commitHash;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/pure-rand.js
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/pure-rand.js
@ -0,0 +1,19 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+exports.__esModule = true;
+var prand = require("./pure-rand-default");
+exports["default"] = prand;
+__exportStar(require("./pure-rand-default"), exports);
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/Distribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/Distribution.d.ts
@ -0,0 +1,2 @@
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+export type Distribution<T> = (rng: RandomGenerator) => [T, RandomGenerator];
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UniformArrayIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UniformArrayIntDistribution.d.ts
@ -0,0 +1,6 @@
+import { Distribution } from './Distribution.js';
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+import { ArrayInt } from './internals/ArrayInt.js';
+declare function uniformArrayIntDistribution(from: ArrayInt, to: ArrayInt): Distribution<ArrayInt>;
+declare function uniformArrayIntDistribution(from: ArrayInt, to: ArrayInt, rng: RandomGenerator): [ArrayInt, RandomGenerator];
+export { uniformArrayIntDistribution };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UniformBigIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UniformBigIntDistribution.d.ts
@ -0,0 +1,5 @@
+import { Distribution } from './Distribution.js';
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+declare function uniformBigIntDistribution(from: bigint, to: bigint): Distribution<bigint>;
+declare function uniformBigIntDistribution(from: bigint, to: bigint, rng: RandomGenerator): [bigint, RandomGenerator];
+export { uniformBigIntDistribution };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UniformIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UniformIntDistribution.d.ts
@ -0,0 +1,5 @@
+import { Distribution } from './Distribution.js';
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+declare function uniformIntDistribution(from: number, to: number): Distribution<number>;
+declare function uniformIntDistribution(from: number, to: number, rng: RandomGenerator): [number, RandomGenerator];
+export { uniformIntDistribution };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UnsafeUniformArrayIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UnsafeUniformArrayIntDistribution.d.ts
@ -0,0 +1,3 @@
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+import { ArrayInt } from './internals/ArrayInt.js';
+export declare function unsafeUniformArrayIntDistribution(from: ArrayInt, to: ArrayInt, rng: RandomGenerator): ArrayInt;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UnsafeUniformBigIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UnsafeUniformBigIntDistribution.d.ts
@ -0,0 +1,2 @@
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+export declare function unsafeUniformBigIntDistribution(from: bigint, to: bigint, rng: RandomGenerator): bigint;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UnsafeUniformIntDistribution.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/UnsafeUniformIntDistribution.d.ts
@ -0,0 +1,2 @@
+import { RandomGenerator } from '../generator/RandomGenerator.js';
+export declare function unsafeUniformIntDistribution(from: number, to: number, rng: RandomGenerator): number;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/internals/ArrayInt.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/internals/ArrayInt.d.ts
@ -0,0 +1,13 @@
+export type ArrayInt = {
+    sign: -1 | 1;
+    data: number[];
+};
+export declare function addArrayIntToNew(arrayIntA: ArrayInt, arrayIntB: ArrayInt): ArrayInt;
+export declare function addOneToPositiveArrayInt(arrayInt: ArrayInt): ArrayInt;
+export declare function substractArrayIntToNew(arrayIntA: ArrayInt, arrayIntB: ArrayInt): ArrayInt;
+export declare function trimArrayIntInplace(arrayInt: ArrayInt): ArrayInt;
+export type ArrayInt64 = Required<ArrayInt> & {
+    data: [number, number];
+};
+export declare function fromNumberToArrayInt64(out: ArrayInt64, n: number): ArrayInt64;
+export declare function substractArrayInt64(out: ArrayInt64, arrayIntA: ArrayInt64, arrayIntB: ArrayInt64): ArrayInt64;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/internals/UnsafeUniformArrayIntDistributionInternal.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/internals/UnsafeUniformArrayIntDistributionInternal.d.ts
@ -0,0 +1,3 @@
+import { RandomGenerator } from '../../generator/RandomGenerator.js';
+import { ArrayInt } from './ArrayInt.js';
+export declare function unsafeUniformArrayIntDistributionInternal(out: ArrayInt['data'], rangeSize: ArrayInt['data'], rng: RandomGenerator): ArrayInt['data'];
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/internals/UnsafeUniformIntDistributionInternal.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/distribution/internals/UnsafeUniformIntDistributionInternal.d.ts
@ -0,0 +1,2 @@
+import { RandomGenerator } from '../../generator/RandomGenerator.js';
+export declare function unsafeUniformIntDistributionInternal(rangeSize: number, rng: RandomGenerator): number;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/generator/LinearCongruential.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/generator/LinearCongruential.d.ts
@ -0,0 +1,6 @@
+import { RandomGenerator } from './RandomGenerator.js';
+declare function fromState(state: readonly number[]): RandomGenerator;
+export declare const congruential32: ((seed: number) => RandomGenerator) & {
+    fromState: typeof fromState;
+};
+export {};
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/generator/MersenneTwister.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/generator/MersenneTwister.d.ts
@ -0,0 +1,6 @@
+import { RandomGenerator } from './RandomGenerator.js';
+declare function fromState(state: readonly number[]): RandomGenerator;
+declare const _default: ((seed: number) => RandomGenerator) & {
+    fromState: typeof fromState;
+};
+export default _default;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/generator/RandomGenerator.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/generator/RandomGenerator.d.ts
@ -0,0 +1,12 @@
+export interface RandomGenerator {
+    clone(): RandomGenerator;
+    next(): [number, RandomGenerator];
+    jump?(): RandomGenerator;
+    unsafeNext(): number;
+    unsafeJump?(): void;
+    getState?(): readonly number[];
+}
+export declare function unsafeGenerateN(rng: RandomGenerator, num: number): number[];
+export declare function generateN(rng: RandomGenerator, num: number): [number[], RandomGenerator];
+export declare function unsafeSkipN(rng: RandomGenerator, num: number): void;
+export declare function skipN(rng: RandomGenerator, num: number): RandomGenerator;
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/generator/XorShift.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/generator/XorShift.d.ts
@ -0,0 +1,6 @@
+import { RandomGenerator } from './RandomGenerator.js';
+declare function fromState(state: readonly number[]): RandomGenerator;
+export declare const xorshift128plus: ((seed: number) => RandomGenerator) & {
+    fromState: typeof fromState;
+};
+export {};
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/generator/XoroShiro.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/generator/XoroShiro.d.ts
@ -0,0 +1,6 @@
+import { RandomGenerator } from './RandomGenerator.js';
+declare function fromState(state: readonly number[]): RandomGenerator;
+export declare const xoroshiro128plus: ((seed: number) => RandomGenerator) & {
+    fromState: typeof fromState;
+};
+export {};
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/pure-rand-default.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/pure-rand-default.d.ts
@ -0,0 +1,16 @@
+import { RandomGenerator, generateN, skipN, unsafeGenerateN, unsafeSkipN } from './generator/RandomGenerator.js';
+import { congruential32 } from './generator/LinearCongruential.js';
+import mersenne from './generator/MersenneTwister.js';
+import { xorshift128plus } from './generator/XorShift.js';
+import { xoroshiro128plus } from './generator/XoroShiro.js';
+import { Distribution } from './distribution/Distribution.js';
+import { uniformArrayIntDistribution } from './distribution/UniformArrayIntDistribution.js';
+import { uniformBigIntDistribution } from './distribution/UniformBigIntDistribution.js';
+import { uniformIntDistribution } from './distribution/UniformIntDistribution.js';
+import { unsafeUniformArrayIntDistribution } from './distribution/UnsafeUniformArrayIntDistribution.js';
+import { unsafeUniformBigIntDistribution } from './distribution/UnsafeUniformBigIntDistribution.js';
+import { unsafeUniformIntDistribution } from './distribution/UnsafeUniformIntDistribution.js';
+declare const __type: string;
+declare const __version: string;
+declare const __commitHash: string;
+export { __type, __version, __commitHash, RandomGenerator, generateN, skipN, unsafeGenerateN, unsafeSkipN, congruential32, mersenne, xorshift128plus, xoroshiro128plus, Distribution, uniformArrayIntDistribution, uniformBigIntDistribution, uniformIntDistribution, unsafeUniformArrayIntDistribution, unsafeUniformBigIntDistribution, unsafeUniformIntDistribution, };
--- a/backend/apis/nodejs/node_modules/pure-rand/lib/types/pure-rand.d.ts
+++ b/backend/apis/nodejs/node_modules/pure-rand/lib/types/pure-rand.d.ts
@ -0,0 +1,3 @@
+import * as prand from './pure-rand-default.js';
+export default prand;
+export * from './pure-rand-default.js';
--- a/backend/apis/nodejs/node_modules/pure-rand/package.json
+++ b/backend/apis/nodejs/node_modules/pure-rand/package.json
@ -0,0 +1,85 @@
+{
+  "name": "pure-rand",
+  "version": "6.1.0",
+  "description": " Pure random number generator written in TypeScript",
+  "type": "commonjs",
+  "main": "lib/pure-rand.js",
+  "exports": {
+    "./package.json": "./package.json",
+    ".": {
+      "require": {
+        "types": "./lib/types/pure-rand.d.ts",
+        "default": "./lib/pure-rand.js"
+      },
+      "import": {
+        "types": "./lib/esm/types/pure-rand.d.ts",
+        "default": "./lib/esm/pure-rand.js"
+      }
+    }
+  },
+  "module": "lib/esm/pure-rand.js",
+  "types": "lib/types/pure-rand.d.ts",
+  "files": [
+    "lib"
+  ],
+  "sideEffects": false,
+  "packageManager": "yarn@4.1.1",
+  "scripts": {
+    "format:check": "prettier --list-different .",
+    "format": "prettier --write .",
+    "build": "tsc && tsc -p ./tsconfig.declaration.json",
+    "build:esm": "tsc --module es2015 --outDir lib/esm --moduleResolution node && tsc -p ./tsconfig.declaration.json --outDir lib/esm/types && cp package.esm-template.json lib/esm/package.json",
+    "build:prod": "yarn build && yarn build:esm && node postbuild/main.cjs",
+    "build:prod-ci": "cross-env EXPECT_GITHUB_SHA=true yarn build:prod",
+    "test": "jest --config jest.config.js --coverage",
+    "build:bench:old": "tsc --outDir lib-reference/",
+    "build:bench:new": "tsc --outDir lib-test/",
+    "bench": "node perf/benchmark.cjs"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/dubzzz/pure-rand.git"
+  },
+  "author": "Nicolas DUBIEN <github@dubien.org>",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/dubzzz/pure-rand/issues"
+  },
+  "homepage": "https://github.com/dubzzz/pure-rand#readme",
+  "devDependencies": {
+    "@types/jest": "^29.5.12",
+    "@types/node": "^20.11.30",
+    "cross-env": "^7.0.3",
+    "fast-check": "^3.16.0",
+    "jest": "^29.7.0",
+    "prettier": "3.2.5",
+    "replace-in-file": "^7.1.0",
+    "source-map-support": "^0.5.21",
+    "tinybench": "^2.6.0",
+    "ts-jest": "^29.1.2",
+    "ts-node": "^10.9.2",
+    "typescript": "^5.4.2"
+  },
+  "keywords": [
+    "seed",
+    "random",
+    "prng",
+    "generator",
+    "pure",
+    "rand",
+    "mersenne",
+    "random number generator",
+    "fastest",
+    "fast"
+  ],
+  "funding": [
+    {
+      "type": "individual",
+      "url": "https://github.com/sponsors/dubzzz"
+    },
+    {
+      "type": "opencollective",
+      "url": "https://opencollective.com/fast-check"
+    }
+  ]
+}