cafe-utility 36.1.8 → 36.2.0

package/index.d.ts

@@ -614,6 +614,7 @@ declare function multicall(functions: (() => void)[]): () => void
 declare function maxBy<T>(array: T[], fn: (item: T) => number): T
 declare function minBy<T>(array: T[], fn: (item: T) => number): T
 declare function allArrayIndexOf<T>(array: T[], predicate: (item: T) => boolean): number[]
+declare function pathfind(array: boolean[][], fromX: number, fromY: number, toX: number, toY: number, maxSteps: number): [number, number][] | null
 declare function findInstance<T, K extends T>(array: T[], type: Newable<K>): Optional<K>
 declare function filterInstances<T, K extends T>(array: T[], type: Newable<K>): K[]
 declare function interleave<T, K>(arrayA: T[], arrayB: K[]): (T | K)[]
@@ -990,6 +991,7 @@ export declare const Arrays: {
 	maxBy: typeof maxBy
 	minBy: typeof minBy
 	allIndexOf: typeof allArrayIndexOf
+	pathfind: typeof pathfind
 }
 export declare const System: {
 	sleepMillis: typeof sleepMillis

package/index.js

@@ -1974,6 +1974,46 @@ function allArrayIndexOf(n, t) {
 		e
 	)
 }
+const DIRECTIONS = [
+	[1, 0],
+	[-1, 0],
+	[0, 1],
+	[0, -1]
+]
+function pathfind(n, t, e, r, i, o) {
+	const s = n.length
+	if (s === 0) return null
+	const c = n[0].length
+	if (t < 0 || t >= c || e < 0 || e >= s || r < 0 || r >= c || i < 0 || i >= s || n[e][t] || n[i][r]) return null
+	if (t === r && e === i) return [[t, e]]
+	const u = c * s,
+		f = new Uint8Array(u),
+		l = new Int32Array(u)
+	l.fill(-1)
+	const a = [[t, e, 0]]
+	let h = 0
+	const m = e * c + t
+	for (f[m] = 1; h < a.length; ) {
+		const [d, p, y] = a[h++],
+			$ = p * c + d
+		if (d === r && p === i) {
+			const w = []
+			for (let b = $; b !== -1; b = l[b]) w.push([b % c, Math.floor(b / c)])
+			return w.reverse(), w
+		}
+		if (y >= o) continue
+		const g = y + 1
+		for (const [w, b] of DIRECTIONS) {
+			const E = d + w,
+				x = p + b
+			if (E >= 0 && E < c && x >= 0 && x < s && !n[x][E]) {
+				const A = x * c + E
+				f[A] || ((f[A] = 1), (l[A] = $), a.push([E, x, g]))
+			}
+		}
+	}
+	return null
+}
 function findInstance(n, t) {
 	const e = n.find(r => r instanceof t)
 	return Optional.of(e)
@@ -2128,77 +2168,77 @@ function keccakPermutate(n) {
 			l = n[8] ^ n[18] ^ n[28] ^ n[38] ^ n[48],
 			a = n[9] ^ n[19] ^ n[29] ^ n[39] ^ n[49],
 			h = (i << 1) | (o >>> 31),
-			p = (o << 1) | (i >>> 31),
+			m = (o << 1) | (i >>> 31),
 			d = l ^ h,
-			m = a ^ p,
-			w = (s << 1) | (c >>> 31),
-			x = (c << 1) | (s >>> 31),
-			g = e ^ w,
-			y = r ^ x,
-			En = (u << 1) | (f >>> 31),
-			Sn = (f << 1) | (u >>> 31),
-			b = i ^ En,
-			A = o ^ Sn,
+			p = a ^ m,
+			y = (s << 1) | (c >>> 31),
+			$ = (c << 1) | (s >>> 31),
+			g = e ^ y,
+			w = r ^ $,
+			b = (u << 1) | (f >>> 31),
+			E = (f << 1) | (u >>> 31),
+			x = i ^ b,
+			A = o ^ E,
 			Mn = (l << 1) | (a >>> 31),
 			kn = (a << 1) | (l >>> 31),
-			$ = s ^ Mn,
-			E = c ^ kn,
+			S = s ^ Mn,
+			M = c ^ kn,
 			On = (e << 1) | (r >>> 31),
 			Tn = (r << 1) | (e >>> 31),
-			S = u ^ On,
-			M = f ^ Tn
-		;(n[0] ^= d), (n[1] ^= m), (n[2] ^= g), (n[3] ^= y), (n[4] ^= b), (n[5] ^= A), (n[6] ^= $), (n[7] ^= E), (n[8] ^= S), (n[9] ^= M), (n[10] ^= d), (n[11] ^= m), (n[12] ^= g), (n[13] ^= y), (n[14] ^= b), (n[15] ^= A), (n[16] ^= $), (n[17] ^= E), (n[18] ^= S), (n[19] ^= M), (n[20] ^= d), (n[21] ^= m), (n[22] ^= g), (n[23] ^= y), (n[24] ^= b), (n[25] ^= A), (n[26] ^= $), (n[27] ^= E), (n[28] ^= S), (n[29] ^= M), (n[30] ^= d), (n[31] ^= m), (n[32] ^= g), (n[33] ^= y), (n[34] ^= b), (n[35] ^= A), (n[36] ^= $), (n[37] ^= E), (n[38] ^= S), (n[39] ^= M), (n[40] ^= d), (n[41] ^= m), (n[42] ^= g), (n[43] ^= y), (n[44] ^= b), (n[45] ^= A), (n[46] ^= $), (n[47] ^= E), (n[48] ^= S), (n[49] ^= M)
-		const k = n[0],
-			O = n[1],
-			T = (n[2] << 1) | (n[3] >>> 31),
-			C = (n[3] << 1) | (n[2] >>> 31),
-			R = (n[5] << 30) | (n[4] >>> 2),
-			I = (n[4] << 30) | (n[5] >>> 2),
-			D = (n[6] << 28) | (n[7] >>> 4),
-			P = (n[7] << 28) | (n[6] >>> 4),
-			B = (n[8] << 27) | (n[9] >>> 5),
-			U = (n[9] << 27) | (n[8] >>> 5),
-			j = (n[11] << 4) | (n[10] >>> 28),
-			L = (n[10] << 4) | (n[11] >>> 28),
-			N = (n[13] << 12) | (n[12] >>> 20),
-			F = (n[12] << 12) | (n[13] >>> 20),
-			v = (n[14] << 6) | (n[15] >>> 26),
-			z = (n[15] << 6) | (n[14] >>> 26),
-			W = (n[17] << 23) | (n[16] >>> 9),
-			q = (n[16] << 23) | (n[17] >>> 9),
-			H = (n[18] << 20) | (n[19] >>> 12),
-			V = (n[19] << 20) | (n[18] >>> 12),
-			J = (n[20] << 3) | (n[21] >>> 29),
-			K = (n[21] << 3) | (n[20] >>> 29),
-			Z = (n[22] << 10) | (n[23] >>> 22),
-			Q = (n[23] << 10) | (n[22] >>> 22),
-			G = (n[25] << 11) | (n[24] >>> 21),
-			_ = (n[24] << 11) | (n[25] >>> 21),
-			Y = (n[26] << 25) | (n[27] >>> 7),
-			X = (n[27] << 25) | (n[26] >>> 7),
-			nn = (n[29] << 7) | (n[28] >>> 25),
-			tn = (n[28] << 7) | (n[29] >>> 25),
-			en = (n[31] << 9) | (n[30] >>> 23),
-			rn = (n[30] << 9) | (n[31] >>> 23),
-			on = (n[33] << 13) | (n[32] >>> 19),
-			sn = (n[32] << 13) | (n[33] >>> 19),
-			cn = (n[34] << 15) | (n[35] >>> 17),
-			un = (n[35] << 15) | (n[34] >>> 17),
-			fn = (n[36] << 21) | (n[37] >>> 11),
-			ln = (n[37] << 21) | (n[36] >>> 11),
-			an = (n[38] << 8) | (n[39] >>> 24),
-			hn = (n[39] << 8) | (n[38] >>> 24),
-			dn = (n[40] << 18) | (n[41] >>> 14),
-			pn = (n[41] << 18) | (n[40] >>> 14),
-			mn = (n[42] << 2) | (n[43] >>> 30),
-			gn = (n[43] << 2) | (n[42] >>> 30),
-			wn = (n[45] << 29) | (n[44] >>> 3),
-			xn = (n[44] << 29) | (n[45] >>> 3),
-			yn = (n[47] << 24) | (n[46] >>> 8),
-			bn = (n[46] << 24) | (n[47] >>> 8),
-			An = (n[48] << 14) | (n[49] >>> 18),
-			$n = (n[49] << 14) | (n[48] >>> 18)
-		;(n[0] = k ^ (~N & G)), (n[1] = O ^ (~F & _)), (n[2] = N ^ (~G & fn)), (n[3] = F ^ (~_ & ln)), (n[4] = G ^ (~fn & An)), (n[5] = _ ^ (~ln & $n)), (n[6] = fn ^ (~An & k)), (n[7] = ln ^ (~$n & O)), (n[8] = An ^ (~k & N)), (n[9] = $n ^ (~O & F)), (n[10] = D ^ (~H & J)), (n[11] = P ^ (~V & K)), (n[12] = H ^ (~J & on)), (n[13] = V ^ (~K & sn)), (n[14] = J ^ (~on & wn)), (n[15] = K ^ (~sn & xn)), (n[16] = on ^ (~wn & D)), (n[17] = sn ^ (~xn & P)), (n[18] = wn ^ (~D & H)), (n[19] = xn ^ (~P & V)), (n[20] = T ^ (~v & Y)), (n[21] = C ^ (~z & X)), (n[22] = v ^ (~Y & an)), (n[23] = z ^ (~X & hn)), (n[24] = Y ^ (~an & dn)), (n[25] = X ^ (~hn & pn)), (n[26] = an ^ (~dn & T)), (n[27] = hn ^ (~pn & C)), (n[28] = dn ^ (~T & v)), (n[29] = pn ^ (~C & z)), (n[30] = B ^ (~j & Z)), (n[31] = U ^ (~L & Q)), (n[32] = j ^ (~Z & cn)), (n[33] = L ^ (~Q & un)), (n[34] = Z ^ (~cn & yn)), (n[35] = Q ^ (~un & bn)), (n[36] = cn ^ (~yn & B)), (n[37] = un ^ (~bn & U)), (n[38] = yn ^ (~B & j)), (n[39] = bn ^ (~U & L)), (n[40] = R ^ (~W & nn)), (n[41] = I ^ (~q & tn)), (n[42] = W ^ (~nn & en)), (n[43] = q ^ (~tn & rn)), (n[44] = nn ^ (~en & mn)), (n[45] = tn ^ (~rn & gn)), (n[46] = en ^ (~mn & R)), (n[47] = rn ^ (~gn & I)), (n[48] = mn ^ (~R & W)), (n[49] = gn ^ (~I & q)), (n[0] ^= IOTA_CONSTANTS[t * 2]), (n[1] ^= IOTA_CONSTANTS[t * 2 + 1])
+			k = u ^ On,
+			O = f ^ Tn
+		;(n[0] ^= d), (n[1] ^= p), (n[2] ^= g), (n[3] ^= w), (n[4] ^= x), (n[5] ^= A), (n[6] ^= S), (n[7] ^= M), (n[8] ^= k), (n[9] ^= O), (n[10] ^= d), (n[11] ^= p), (n[12] ^= g), (n[13] ^= w), (n[14] ^= x), (n[15] ^= A), (n[16] ^= S), (n[17] ^= M), (n[18] ^= k), (n[19] ^= O), (n[20] ^= d), (n[21] ^= p), (n[22] ^= g), (n[23] ^= w), (n[24] ^= x), (n[25] ^= A), (n[26] ^= S), (n[27] ^= M), (n[28] ^= k), (n[29] ^= O), (n[30] ^= d), (n[31] ^= p), (n[32] ^= g), (n[33] ^= w), (n[34] ^= x), (n[35] ^= A), (n[36] ^= S), (n[37] ^= M), (n[38] ^= k), (n[39] ^= O), (n[40] ^= d), (n[41] ^= p), (n[42] ^= g), (n[43] ^= w), (n[44] ^= x), (n[45] ^= A), (n[46] ^= S), (n[47] ^= M), (n[48] ^= k), (n[49] ^= O)
+		const T = n[0],
+			C = n[1],
+			I = (n[2] << 1) | (n[3] >>> 31),
+			R = (n[3] << 1) | (n[2] >>> 31),
+			D = (n[5] << 30) | (n[4] >>> 2),
+			P = (n[4] << 30) | (n[5] >>> 2),
+			B = (n[6] << 28) | (n[7] >>> 4),
+			U = (n[7] << 28) | (n[6] >>> 4),
+			N = (n[8] << 27) | (n[9] >>> 5),
+			j = (n[9] << 27) | (n[8] >>> 5),
+			L = (n[11] << 4) | (n[10] >>> 28),
+			v = (n[10] << 4) | (n[11] >>> 28),
+			F = (n[13] << 12) | (n[12] >>> 20),
+			z = (n[12] << 12) | (n[13] >>> 20),
+			W = (n[14] << 6) | (n[15] >>> 26),
+			q = (n[15] << 6) | (n[14] >>> 26),
+			H = (n[17] << 23) | (n[16] >>> 9),
+			V = (n[16] << 23) | (n[17] >>> 9),
+			J = (n[18] << 20) | (n[19] >>> 12),
+			K = (n[19] << 20) | (n[18] >>> 12),
+			Z = (n[20] << 3) | (n[21] >>> 29),
+			Q = (n[21] << 3) | (n[20] >>> 29),
+			G = (n[22] << 10) | (n[23] >>> 22),
+			_ = (n[23] << 10) | (n[22] >>> 22),
+			Y = (n[25] << 11) | (n[24] >>> 21),
+			X = (n[24] << 11) | (n[25] >>> 21),
+			nn = (n[26] << 25) | (n[27] >>> 7),
+			tn = (n[27] << 25) | (n[26] >>> 7),
+			en = (n[29] << 7) | (n[28] >>> 25),
+			rn = (n[28] << 7) | (n[29] >>> 25),
+			on = (n[31] << 9) | (n[30] >>> 23),
+			sn = (n[30] << 9) | (n[31] >>> 23),
+			cn = (n[33] << 13) | (n[32] >>> 19),
+			un = (n[32] << 13) | (n[33] >>> 19),
+			fn = (n[34] << 15) | (n[35] >>> 17),
+			ln = (n[35] << 15) | (n[34] >>> 17),
+			an = (n[36] << 21) | (n[37] >>> 11),
+			hn = (n[37] << 21) | (n[36] >>> 11),
+			dn = (n[38] << 8) | (n[39] >>> 24),
+			pn = (n[39] << 8) | (n[38] >>> 24),
+			mn = (n[40] << 18) | (n[41] >>> 14),
+			gn = (n[41] << 18) | (n[40] >>> 14),
+			wn = (n[42] << 2) | (n[43] >>> 30),
+			xn = (n[43] << 2) | (n[42] >>> 30),
+			yn = (n[45] << 29) | (n[44] >>> 3),
+			bn = (n[44] << 29) | (n[45] >>> 3),
+			An = (n[47] << 24) | (n[46] >>> 8),
+			$n = (n[46] << 24) | (n[47] >>> 8),
+			En = (n[48] << 14) | (n[49] >>> 18),
+			Sn = (n[49] << 14) | (n[48] >>> 18)
+		;(n[0] = T ^ (~F & Y)), (n[1] = C ^ (~z & X)), (n[2] = F ^ (~Y & an)), (n[3] = z ^ (~X & hn)), (n[4] = Y ^ (~an & En)), (n[5] = X ^ (~hn & Sn)), (n[6] = an ^ (~En & T)), (n[7] = hn ^ (~Sn & C)), (n[8] = En ^ (~T & F)), (n[9] = Sn ^ (~C & z)), (n[10] = B ^ (~J & Z)), (n[11] = U ^ (~K & Q)), (n[12] = J ^ (~Z & cn)), (n[13] = K ^ (~Q & un)), (n[14] = Z ^ (~cn & yn)), (n[15] = Q ^ (~un & bn)), (n[16] = cn ^ (~yn & B)), (n[17] = un ^ (~bn & U)), (n[18] = yn ^ (~B & J)), (n[19] = bn ^ (~U & K)), (n[20] = I ^ (~W & nn)), (n[21] = R ^ (~q & tn)), (n[22] = W ^ (~nn & dn)), (n[23] = q ^ (~tn & pn)), (n[24] = nn ^ (~dn & mn)), (n[25] = tn ^ (~pn & gn)), (n[26] = dn ^ (~mn & I)), (n[27] = pn ^ (~gn & R)), (n[28] = mn ^ (~I & W)), (n[29] = gn ^ (~R & q)), (n[30] = N ^ (~L & G)), (n[31] = j ^ (~v & _)), (n[32] = L ^ (~G & fn)), (n[33] = v ^ (~_ & ln)), (n[34] = G ^ (~fn & An)), (n[35] = _ ^ (~ln & $n)), (n[36] = fn ^ (~An & N)), (n[37] = ln ^ (~$n & j)), (n[38] = An ^ (~N & L)), (n[39] = $n ^ (~j & v)), (n[40] = D ^ (~H & en)), (n[41] = P ^ (~V & rn)), (n[42] = H ^ (~en & on)), (n[43] = V ^ (~rn & sn)), (n[44] = en ^ (~on & wn)), (n[45] = rn ^ (~sn & xn)), (n[46] = on ^ (~wn & D)), (n[47] = sn ^ (~xn & P)), (n[48] = wn ^ (~D & H)), (n[49] = xn ^ (~P & V)), (n[0] ^= IOTA_CONSTANTS[t * 2]), (n[1] ^= IOTA_CONSTANTS[t * 2 + 1])
 	}
 }
 function bytesToNumbers(n) {
@@ -2449,11 +2489,11 @@ function jacobianAddMixed(n, t, e, r, i) {
 	if (f === 0n) return l === 0n ? jacobianDouble(n, t, e) : [0n, 0n, 0n]
 	const a = (f * f) % o,
 		h = (f * a) % o,
-		p = (n * a) % o,
-		d = mod(l * l - h - 2n * p, o),
-		m = mod(l * (p - d) - t * h, o),
-		w = (f * e) % o
-	return [d, m, w]
+		m = (n * a) % o,
+		d = mod(l * l - h - 2n * m, o),
+		p = mod(l * (m - d) - t * h, o),
+		y = (f * e) % o
+	return [d, p, y]
 }
 function jacobianToAffine(n, t, e) {
 	if (e === 0n) return [0n, 0n]
@@ -2526,21 +2566,21 @@ function shamirWNAF(n, t, e, r, i, o) {
 		l = Math.max(s.length, c.length)
 	let a = 0n,
 		h = 0n,
-		p = 0n
+		m = 0n
 	for (let d = l - 1; d >= 0; d--) {
-		;[a, h, p] = jacobianDouble(a, h, p)
-		const m = d < s.length ? s[d] : 0
-		if (m !== 0) {
-			const [x, g] = u[(Math.abs(m) - 1) >> 1]
-			;[a, h, p] = jacobianAddMixed(a, h, p, x, m > 0 ? g : SECP256K1_P - g)
+		;[a, h, m] = jacobianDouble(a, h, m)
+		const p = d < s.length ? s[d] : 0
+		if (p !== 0) {
+			const [$, g] = u[(Math.abs(p) - 1) >> 1]
+			;[a, h, m] = jacobianAddMixed(a, h, m, $, p > 0 ? g : SECP256K1_P - g)
 		}
-		const w = d < c.length ? c[d] : 0
-		if (w !== 0) {
-			const [x, g] = f[(Math.abs(w) - 1) >> 1]
-			;[a, h, p] = jacobianAddMixed(a, h, p, x, w > 0 ? g : SECP256K1_P - g)
+		const y = d < c.length ? c[d] : 0
+		if (y !== 0) {
+			const [$, g] = f[(Math.abs(y) - 1) >> 1]
+			;[a, h, m] = jacobianAddMixed(a, h, m, $, y > 0 ? g : SECP256K1_P - g)
 		}
 	}
-	return jacobianToAffine(a, h, p)
+	return jacobianToAffine(a, h, m)
 }
 function doubleAndAdd(n, t, e) {
 	const [r, i, o, s] = glvDecompose(e),
@@ -3129,7 +3169,7 @@ class Lock {
 	(exports.Binary = { hexToUint8Array, uint8ArrayToHex, binaryToUint8Array, uint8ArrayToBinary, base64ToUint8Array, uint8ArrayToBase64, base32ToUint8Array, uint8ArrayToBase32, log2Reduce, partition, concatBytes, numberToUint8, uint8ToNumber, numberToUint16, uint16ToNumber, numberToUint32, uint32ToNumber, numberToUint64, uint64ToNumber, numberToUint256, uint256ToNumber, sliceBytes, keccak256, sha3_256, proximity, commonPrefix, setBit, getBit, indexOf: binaryIndexOf, equals: binaryEquals, padStart: binaryPadStart, padStartToMultiple: binaryPadStartToMultiple, padEnd: binaryPadEnd, padEndToMultiple: binaryPadEndToMultiple, xorCypher, isUtf8 }),
 	(exports.Elliptic = { privateKeyToPublicKey, compressPublicKey, publicKeyFromCompressed, publicKeyToAddress, signMessage, signHash, verifySignature, recoverPublicKey, checksumEncode }),
 	(exports.Random = { intBetween, floatBetween, chance, signed: signedRandom, makeSeededRng, point: randomPoint, procs }),
-	(exports.Arrays = { countUnique, makeUnique, splitBySize, splitByCount, index: indexArray, indexCollection: indexArrayToCollection, onlyOrThrow, onlyOrNull, firstOrThrow, firstOrNull, shuffle, initialize: initializeArray, initialize2D: initialize2DArray, rotate2D: rotate2DArray, containsShape, glue, pluck, pick, pickMany, pickManyUnique, pickWeighted, pickRandomIndices, pickGuaranteed, last, pipe, makePipe, sortWeighted, pushAll, unshiftAll, filterAndRemove, merge: mergeArrays, empty, pushToBucket, unshiftAndLimit, atRolling, group, createOscillator, organiseWithLimits, tickPlaybook, getArgument, getBooleanArgument, getNumberArgument, requireStringArgument, requireNumberArgument, bringToFront, bringToFrontInPlace, findInstance, filterInstances, interleave, toggle, createHierarchy, multicall, maxBy, minBy, allIndexOf: allArrayIndexOf }),
+	(exports.Arrays = { countUnique, makeUnique, splitBySize, splitByCount, index: indexArray, indexCollection: indexArrayToCollection, onlyOrThrow, onlyOrNull, firstOrThrow, firstOrNull, shuffle, initialize: initializeArray, initialize2D: initialize2DArray, rotate2D: rotate2DArray, containsShape, glue, pluck, pick, pickMany, pickManyUnique, pickWeighted, pickRandomIndices, pickGuaranteed, last, pipe, makePipe, sortWeighted, pushAll, unshiftAll, filterAndRemove, merge: mergeArrays, empty, pushToBucket, unshiftAndLimit, atRolling, group, createOscillator, organiseWithLimits, tickPlaybook, getArgument, getBooleanArgument, getNumberArgument, requireStringArgument, requireNumberArgument, bringToFront, bringToFrontInPlace, findInstance, filterInstances, interleave, toggle, createHierarchy, multicall, maxBy, minBy, allIndexOf: allArrayIndexOf, pathfind }),
 	(exports.System = { sleepMillis, forever, scheduleMany, waitFor, expandError, runAndSetInterval, whereAmI, withRetries }),
 	(exports.Numbers = { make: makeNumber, sum, average, median, getDistanceFromMidpoint, clamp, range, interpolate, createSequence, increment, decrement, format: formatNumber, fromDecimals, makeStorage, asMegabytes, convertBytes, hexToRgb, rgbToHex, haversineDistanceToMeters, roundToNearest, formatDistance, triangularNumber, searchFloat, binomialSample, toSignificantDigits }),
 	(exports.Promises = { raceFulfilled, invert: invertPromise, runInParallelBatches }),

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "cafe-utility",
-	"version": "36.1.8",
+	"version": "36.2.0",
 	"description": "",
 	"main": "index.js",
 	"exports": {