claude-autopm 2.12.3 → 3.0.1

package/packages/plugin-devops/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;

package/packages/plugin-devops/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;

package/packages/plugin-devops/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;

package/packages/plugin-devops/node_modules/pure-rand/lib/esm/distribution/Distribution.js

@@ -0,0 +1 @@
+export {};

package/packages/plugin-devops/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 };

package/packages/plugin-devops/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 };

package/packages/plugin-devops/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 };

package/packages/plugin-devops/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));
+}

package/packages/plugin-devops/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;
+        }
+    }
+}

package/packages/plugin-devops/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);
+}

package/packages/plugin-devops/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;
+}

package/packages/plugin-devops/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;
+            }
+        }
+    }
+}

package/packages/plugin-devops/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;
+}

package/packages/plugin-devops/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 });

package/packages/plugin-devops/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 });

package/packages/plugin-devops/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;
+}