@genai-fi/nanogpt 0.19.1 → 0.20.1

package/dist/backend_util-Cg-roD1p.js

@@ -0,0 +1,399 @@
+import { r as e } from "./chunk-BPntVaq0.js";
+import { Ar as t, Ci as n, Cn as r, Cr as i, Dn as a, Dr as o, En as s, Er as c, In as l, Li as u, Ln as d, M as ee, N as te, Oi as ne, On as re, Or as ie, Ps as f, Ri as ae, Rn as oe, Rs as se, Sn as ce, Sr as le, Tn as ue, Tr as de, ec as p, j as fe, jr as pe, ki as me, kr as he, oc as m, wn as ge, wr as _e, xn as ve, xr as ye } from "./dist-BewPQWjc.js";
+import { a as be, i as xe, n as Se, o as Ce, r as we, t as Te } from "./selu_util-zkAx5doH.js";
+import { s as Ee } from "./slice_util-Dgb3ANWI.js";
+import { n as De, t as Oe } from "./concat_util-CWDZCBlA.js";
+import { a as ke, c as Ae, i as je, n as Me, o as Ne, r as Pe, s as Fe, t as Ie } from "./complex_util-CkazZsaH.js";
+//#region node_modules/@tensorflow/tfjs-core/dist/ops/gather_nd_util.js
+function h(e, t) {
+	let n = e.shape.length, r = t.shape.length;
+	if (n < 1) throw Error(`tf.gatherND() expects the input to be rank 1 or higher, but the rank was ${n}.`);
+	if (r < 1) throw Error(`tf.gatherND() expects the indices to be rank 1 or higher, but the rank was ${r}.`);
+	if (t.dtype !== "int32") throw Error(`tf.gatherND() expects the indices to be int32 type, but the dtype was ${t.dtype}.`);
+	if (t.shape[r - 1] > n) throw Error(`index innermost dimension length must be <= tensor rank; saw: ${t.shape[r - 1]} vs. ${n}`);
+	if (m(e.shape) === 0) throw Error(`Requested more than 0 entries, but input is empty. Input shape: ${e.shape}.`);
+	let i = t.shape, a = i[i.length - 1], o = 1;
+	for (let e = 0; e < i.length - 1; ++e) o *= i[e];
+	let s = e.shape, c = i.slice();
+	c.pop();
+	let l = 1;
+	for (let e = a; e < n; ++e) l *= s[e], c.push(s[e]);
+	let u = [...se(e.shape).map((e) => e / l), 1].slice(0, a);
+	return [
+		c,
+		o,
+		l,
+		u
+	];
+}
+//#endregion
+//#region node_modules/@tensorflow/tfjs-core/dist/ops/ragged_to_dense_util.js
+var g;
+(function(e) {
+	e[e.FIRST_DIM_SIZE = 0] = "FIRST_DIM_SIZE", e[e.VALUE_ROWIDS = 1] = "VALUE_ROWIDS", e[e.ROW_LENGTHS = 2] = "ROW_LENGTHS", e[e.ROW_SPLITS = 3] = "ROW_SPLITS", e[e.ROW_LIMITS = 4] = "ROW_LIMITS", e[e.ROW_STARTS = 5] = "ROW_STARTS";
+})(g ||= {});
+function _(e, t, n) {
+	let r = [];
+	if (n == null && t == null) return r;
+	if (t == null) for (; r.length < e + n.length;) r.push(-1);
+	else r = t.slice();
+	if (n == null) return r;
+	if (e + n.length !== r.length) throw Error(`rt input.shape and shape=${t} are incompatible: rt input.rank = ${e + n.length}, but shape.rank = ${r.length}`);
+	for (let i = 1; i < n.length; ++i) {
+		let a = n[i], o = r[r.length - n.length + i], s = r[o];
+		if (a >= 0) if (s >= 0) {
+			if (s !== a) throw Error(`rt input.shape and shape=${t} are incompatible: rt input.shape[${i + e}] = ${a} but shape[${i + e}] = ${s}`);
+		} else r[o] = a;
+	}
+	return r;
+}
+function v(e) {
+	let t = {
+		FIRST_DIM_SIZE: g.FIRST_DIM_SIZE,
+		VALUE_ROWIDS: g.VALUE_ROWIDS,
+		ROW_LENGTHS: g.ROW_LENGTHS,
+		ROW_SPLITS: g.ROW_SPLITS,
+		ROW_LIMITS: g.ROW_LIMITS,
+		ROW_STARTS: g.ROW_STARTS
+	}, n = [];
+	for (let r of e) if (r in t) n.push(t[r]);
+	else break;
+	return n;
+}
+function y(e) {
+	return e.length === 0 ? 0 : e[0] === g.FIRST_DIM_SIZE ? e.length - 1 : e.length;
+}
+function b(e, t) {
+	if (e == null || t == null) return;
+	let n = e.length, r = t.length;
+	if (n >= r) throw Error(`defaultValue.shape=${e} and ragged tensor flatValues.shape=${t}, are incompatible: defaultValue.rank = ${n} must be less than ragged tensor input flatValues.rank = ${r})`);
+	for (let i = 0; i < Math.min(n, r - 1); ++i) {
+		let n = e[i], r = t[i + 1];
+		if (n >= 0 && r >= 0 && n !== 1 && n !== r) throw Error(`defaultValue.shape=${e}, and ragged tensor input flatValues.shape=${t} are incompatible: defaultValue.shape[${i - e.length}] = ${n} but ragged tensor input.flatValues.shape[${i - e.length}] = ${r}`);
+	}
+}
+function x(e) {
+	return e <= 30 ? e : p(e, Math.floor(Math.sqrt(e)));
+}
+//#endregion
+//#region node_modules/@tensorflow/tfjs-core/dist/ops/rotate_util.js
+function S(e, t, n) {
+	return [n * (typeof e == "number" ? e : e[0]), t * (typeof e == "number" ? e : e[1])];
+}
+//#endregion
+//#region node_modules/@tensorflow/tfjs-core/dist/ops/array_ops_util.js
+function C(e, t, n, r = !0) {
+	let i = [];
+	if (r) i = i.concat(t.slice(0)), i.push(e[0] / n), i = i.concat(e.slice(1));
+	else {
+		i = i.concat(e[0]);
+		let n = t.length;
+		for (let r = 0; r < n; ++r) i = i.concat([e[r + 1] / t[r], t[r]]);
+		i = i.concat(e.slice(n + 1));
+	}
+	return i;
+}
+function Le(e, t, n = !0) {
+	let r = [];
+	if (n) {
+		r.push(t);
+		for (let n = t + 1; n < e; ++n) n <= 2 * t ? (r.push(n), r.push(n - (t + 1))) : r.push(n);
+	} else {
+		let n = [], i = [];
+		for (let r = 1; r < e; ++r) r >= t * 2 + 1 || r % 2 == 1 ? i.push(r) : n.push(r);
+		r.push(...n), r.push(0), r.push(...i);
+	}
+	return r;
+}
+function w(e, t, n, r = !0) {
+	let i = [];
+	r ? i.push(e[0] / n) : i.push(e[0] * n);
+	for (let n = 1; n < e.length; ++n) n <= t.length ? r ? i.push(t[n - 1] * e[n]) : i.push(e[n] / t[n - 1]) : i.push(e[n]);
+	return i;
+}
+function T(e, t) {
+	let n = [0];
+	for (let r = 0; r < t; ++r) n.push(e[r][0]);
+	return n;
+}
+function E(e, t, n) {
+	let r = e.slice(0, 1);
+	for (let i = 0; i < n; ++i) r.push(e[i + 1] - t[i][0] - t[i][1]);
+	return r;
+}
+//#endregion
+//#region node_modules/@tensorflow/tfjs-core/dist/ops/erf_util.js
+var D = .3275911, O = .254829592, k = -.284496736, A = 1.421413741, j = -1.453152027, M = 1.061405429, N = "->", Re = /->/g, P = ",", F = "...";
+function I(e, t) {
+	e = e.replace(/\s/g, "");
+	let n = (e.length - e.replace(Re, "").length) / 2;
+	if (n < 1) throw Error("Equations without an arrow are not supported.");
+	if (n > 1) throw Error(`Equation must contain exactly one arrow ("${N}").`);
+	let [r, i] = e.split(N);
+	f(r.indexOf(F) === -1, () => `The ellipsis notation ("${F}") is not supported yet.`);
+	let a = r.split(P), o = a.length;
+	if (t !== o) throw Error(`Expected ${o} input tensors, received ${t}`);
+	if (o > 2) throw Error("Support for more than 2 input tensors is not implemented yet.");
+	let s = [];
+	for (let e = 0; e < i.length; ++e) {
+		let t = i[e];
+		if (!a.some((e) => e.indexOf(t) !== -1)) throw Error(`Output subscripts contain the label ${t} not present in the input subscripts.`);
+		s.indexOf(t) === -1 && s.push(t);
+	}
+	for (let e = 0; e < r.length; ++e) {
+		let t = r[e];
+		s.indexOf(t) === -1 && t !== P && s.push(t);
+	}
+	let c = Array(a.length);
+	for (let e = 0; e < o; ++e) {
+		if (new Set(a[e].split("")).size !== a[e].length) throw Error(`Found duplicate axes in input component ${a[e]}. Support for duplicate axes in input is not implemented yet.`);
+		c[e] = [];
+		for (let t = 0; t < a[e].length; ++t) c[e].push(s.indexOf(a[e][t]));
+	}
+	let l = s.length, u = i.length, d = [];
+	for (let e = u; e < l; ++e) d.push(e);
+	return {
+		allDims: s,
+		summedDims: d,
+		idDims: c
+	};
+}
+function L(e, t) {
+	let n = Array(e);
+	n.fill(-1);
+	for (let e = 0; e < t.length; ++e) n[t[e]] = e;
+	let r = [];
+	for (let t = 0; t < e; ++t) n[t] === -1 && r.push(t);
+	return n = n.filter((e) => e !== -1), {
+		permutationIndices: n,
+		expandDims: r
+	};
+}
+function R(e, t, n) {
+	let r = Array(e);
+	for (let e = 0; e < n.length; ++e) {
+		let i = n[e].shape;
+		for (let n = 0; n < t[e].length; ++n) r[t[e][n]] === void 0 ? r[t[e][n]] = i[n] : f(r[t[e][n]] === i[n], () => `Expected dimension ${r[t[e][n]]} at axis ${n} of input shaped ${JSON.stringify(i)}, but got dimension ${i[n]}`);
+	}
+}
+function z(e, t) {
+	let n = e, r = [], i = 0;
+	e.length === 0 && n.push(-1), i = e.length + 1;
+	for (let e = 0; e < i; ++e) r.push([]);
+	let a = [];
+	for (let e = 0; e < n.length; ++e) {
+		let i = n[e], o = ze(t, i);
+		for (let t of o) a.indexOf(t) === -1 && (r[e].push(t), a.push(t));
+	}
+	return {
+		path: n,
+		steps: r
+	};
+}
+function B(e) {
+	return e.every((e, t) => e === t);
+}
+function ze(e, t) {
+	let n = [];
+	for (let r = 0; r < e.length; ++r) (e[r].length === 0 || e[r].indexOf(t) !== -1 || t === -1) && n.push(r);
+	return n;
+}
+//#endregion
+//#region node_modules/@tensorflow/tfjs-core/dist/ops/split_util.js
+function V(e, t, n = 0) {
+	let r = [];
+	if (typeof t == "number") f(e.shape[n] % t === 0, () => "Number of splits must evenly divide the axis."), r = Array(t).fill(e.shape[n] / t);
+	else {
+		f(t.reduce((e, t) => (t === -1 && (e += 1), e), 0) <= 1, () => "There should be only one negative value in split array.");
+		let i = t.indexOf(-1);
+		if (i !== -1) {
+			let r = t.reduce((e, t) => t > 0 ? e + t : e);
+			t[i] = e.shape[n] - r;
+		}
+		f(e.shape[n] === t.reduce((e, t) => e + t), () => "The sum of sizes must match the size of the axis dimension."), r = t;
+	}
+	return r;
+}
+//#endregion
+//#region node_modules/@tensorflow/tfjs-core/dist/ops/sparse/sparse_fill_empty_rows_util.js
+function H(e) {
+	return `Received SparseTensor with denseShape[0] = 0 but
+  indices.shape[0] = ${e}`;
+}
+function U(e, t) {
+	return `indices(${e}, 0) is invalid: ${t} < 0`;
+}
+function W(e, t, n) {
+	return `indices(${e}, 0) is invalid: ${t} >= ${n}`;
+}
+//#endregion
+//#region node_modules/@tensorflow/tfjs-core/dist/ops/sparse/sparse_reshape_util.js
+function G(e, t) {
+	return `only one output dimension may be -1, not both ${e} and ${t}`;
+}
+function K(e, t) {
+	return `size ${e} must be non-negative, not ${t}`;
+}
+function q() {
+	return "reshape cannot infer the missing input size for an empty tensor unless all specified input sizes are non-zero";
+}
+function J(e, t) {
+	return `Input to reshape is a SparseTensor with ${m(e)}
+  dense values, but the requested shape requires a multiple of ${m(t)}. inputShape=${e} outputShape= ${t}`;
+}
+function Y(e, t) {
+	return `Input to reshape is a tensor with ${m(e)} dense values, but the requested shape has ${m(t)}. inputShape=${e} outputShape=${t}`;
+}
+//#endregion
+//#region node_modules/@tensorflow/tfjs-core/dist/ops/sparse/sparse_segment_reduction_util.js
+function X() {
+	return "segment ids must be >= 0";
+}
+function Z() {
+	return "segment ids are not increasing";
+}
+function Q(e, t) {
+	return `Segment id ${e} out of range [0, ${t}), possibly because segmentIds input is not sorted.`;
+}
+function Be(e, t, n) {
+	return `Bad: indices[${e}] == ${t} out of range [0, ${n})`;
+}
+//#endregion
+//#region node_modules/@tensorflow/tfjs-core/dist/ops/segment_util.js
+var Ve = /* @__PURE__ */ e({
+	collectGatherOpShapeInfo: () => We,
+	computeOutShape: () => Ue,
+	segOpComputeOptimalWindowSize: () => He
+});
+function He(e, t) {
+	let n = !1, r;
+	for (e <= 30 ? (r = e, n = !0) : r = p(e, Math.floor(Math.sqrt(e))); !n;) r > t || r === e ? n = !0 : r = p(e, r + 1);
+	return r;
+}
+function Ue(e, t, n) {
+	let r = [], i = e.length;
+	for (let a = 0; a < i; a++) a === t ? r.push(n) : r.push(e[a]);
+	return r;
+}
+function We(e, t, n, r) {
+	let i = t.shape.length, a = e.shape.length;
+	if (r !== 0 && (r < -i || r > i)) throw Error(`Expect batchDims in the range of [-${i}, ${i}], but got ${r}`);
+	if (r < 0 && (r += i), r > a) throw Error(`batchDims (${r}) must be less than rank(x) (
+    ${a}).`);
+	if (n < r) throw Error(`batchDims (${r}) must be less than or equal to axis (${n}).`);
+	for (let n = 0; n < r; ++n) if (e.shape[n] !== t.shape[n]) throw Error(`x.shape[${n}]: ${e.shape[n]} should be equal to indices.shape[${n}]: ${t.shape[n]}.`);
+	let o = e.shape[n], s = [], c = 1, l = 1, u = 1;
+	for (let t = 0; t < r; ++t) s.push(e.shape[t]), c *= e.shape[t];
+	for (let t = r; t < n; t++) s.push(e.shape[t]), l *= e.shape[t];
+	for (let e = r; e < i; e++) s.push(t.shape[e]);
+	for (let t = n + 1; t < a; t++) s.push(e.shape[t]), u *= e.shape[t];
+	return {
+		batchSize: c,
+		sliceSize: u,
+		outerSize: l,
+		dimSize: o,
+		outputShape: s
+	};
+}
+//#endregion
+//#region node_modules/@tensorflow/tfjs-core/dist/backends/backend_util.js
+var Ge = /* @__PURE__ */ e({
+	ERF_A1: () => O,
+	ERF_A2: () => k,
+	ERF_A3: () => A,
+	ERF_A4: () => j,
+	ERF_A5: () => M,
+	ERF_P: () => D,
+	PARALLELIZE_THRESHOLD: () => 30,
+	RowPartitionType: () => g,
+	SELU_SCALE: () => Te,
+	SELU_SCALEALPHA: () => Se,
+	applyActivation: () => we,
+	assertAndGetBroadcastShape: () => l,
+	assertAxesAreInnerMostDims: () => ve,
+	assertParamsConsistent: () => Oe,
+	assignToTypedArray: () => Ie,
+	axesAreInnerMostDims: () => ce,
+	calculateShapes: () => fe,
+	checkEinsumDimSizes: () => R,
+	checkPadOnDimRoundingMode: () => ye,
+	combineLocations: () => r,
+	combineRaggedTensorToTensorShapes: () => _,
+	complexWithEvenIndex: () => Me,
+	complexWithOddIndex: () => Pe,
+	computeConv2DInfo: () => le,
+	computeConv3DInfo: () => i,
+	computeDefaultPad: () => _e,
+	computeDilation2DInfo: () => de,
+	computeOptimalWindowSize: () => x,
+	computeOutAndReduceShapes: () => ge,
+	computeOutShape: () => De,
+	computePool2DInfo: () => c,
+	computePool3DInfo: () => o,
+	convertConv2DDataFormat: () => ie,
+	decodeEinsumEquation: () => I,
+	eitherStridesOrDilationsAreOne: () => he,
+	expandShapeToKeepDim: () => ue,
+	exponent: () => je,
+	exponents: () => ke,
+	fromStringArrayToUint8: () => $,
+	fromUint8ToStringArray: () => Ke,
+	getAxesPermutation: () => s,
+	getBroadcastDims: () => d,
+	getComplexWithIndex: () => Ne,
+	getEinsumComputePath: () => z,
+	getEinsumPermutation: () => L,
+	getFusedBiasGradient: () => xe,
+	getFusedDyActivation: () => be,
+	getImageCenter: () => S,
+	getInnerMostAxes: () => a,
+	getPermuted: () => Le,
+	getRaggedRank: () => y,
+	getReductionAxes: () => oe,
+	getReshaped: () => C,
+	getReshapedPermuted: () => w,
+	getRowPartitionTypesHelper: () => v,
+	getSliceBeginCoords: () => T,
+	getSliceSize: () => E,
+	getSparseFillEmptyRowsIndicesDenseShapeMismatch: () => H,
+	getSparseFillEmptyRowsNegativeIndexErrorMessage: () => U,
+	getSparseFillEmptyRowsOutOfRangeIndexErrorMessage: () => W,
+	getSparseReshapeEmptyTensorZeroOutputDimErrorMessage: () => q,
+	getSparseReshapeInputOutputMismatchErrorMessage: () => Y,
+	getSparseReshapeInputOutputMultipleErrorMessage: () => J,
+	getSparseReshapeMultipleNegativeOneOutputDimErrorMessage: () => G,
+	getSparseReshapeNegativeOutputDimErrorMessage: () => K,
+	getSparseSegmentReductionIndicesOutOfRangeErrorMessage: () => Be,
+	getSparseSegmentReductionNegativeSegmentIdsErrorMessage: () => X,
+	getSparseSegmentReductionNonIncreasingSegmentIdsErrorMessage: () => Z,
+	getSparseSegmentReductionSegmentIdOutOfRangeErrorMessage: () => Q,
+	getUndoAxesPermutation: () => re,
+	isIdentityPermutation: () => B,
+	log: () => u,
+	mergeRealAndImagArrays: () => Fe,
+	prepareAndValidate: () => h,
+	prepareSplitSize: () => V,
+	segment_util: () => Ve,
+	shouldFuse: () => Ce,
+	slice_util: () => Ee,
+	splitRealAndImagArrays: () => Ae,
+	stridesOrDilationsArePositive: () => t,
+	tupleValuesAreOne: () => pe,
+	upcastType: () => n,
+	validateDefaultValueShape: () => b,
+	validateInput: () => ee,
+	validateUpdateShape: () => te,
+	warn: () => ae
+});
+function Ke(e) {
+	try {
+		return e.map((e) => ne(e));
+	} catch (e) {
+		throw Error(`Failed to decode encoded string bytes into utf-8, error: ${e}`);
+	}
+}
+function $(e) {
+	return e.map((e) => me(e));
+}
+//#endregion
+export { D as A, y as B, L as C, A as D, k as E, E as F, b as H, S as I, x as L, C as M, w as N, j as O, T as P, g as R, z as S, O as T, h as U, v as V, U as _, Ue as a, R as b, X as c, q as d, Y as f, H as g, K as h, We as i, Le as j, M as k, Z as l, G as m, $ as n, He as o, J as p, Ke as r, Be as s, Ge as t, Q as u, W as v, B as w, I as x, V as y, _ as z };

package/dist/binary_op_util-CrYk9LXL.js

@@ -0,0 +1,103 @@
+//#region node_modules/@tensorflow/tfjs-backend-webgpu/dist/binary_op_util.js
+var e;
+(function(e) {
+	e[e.ADD = 0] = "ADD", e[e.ATAN2 = 1] = "ATAN2", e[e.COMPLEX_MULTIPLY_IMAG = 2] = "COMPLEX_MULTIPLY_IMAG", e[e.COMPLEX_MULTIPLY_REAL = 3] = "COMPLEX_MULTIPLY_REAL", e[e.DIV = 4] = "DIV", e[e.ELU_DER = 5] = "ELU_DER", e[e.EQUAL = 6] = "EQUAL", e[e.FLOOR_DIV = 7] = "FLOOR_DIV", e[e.GREATER = 8] = "GREATER", e[e.GREATER_EQUAL = 9] = "GREATER_EQUAL", e[e.LESS = 10] = "LESS", e[e.LESS_EQUAL = 11] = "LESS_EQUAL", e[e.LOGICAL_AND = 12] = "LOGICAL_AND", e[e.LOGICAL_OR = 13] = "LOGICAL_OR", e[e.MAX = 14] = "MAX", e[e.MIN = 15] = "MIN", e[e.MOD = 16] = "MOD", e[e.MUL = 17] = "MUL", e[e.NOT_EQUAL = 18] = "NOT_EQUAL", e[e.POW = 19] = "POW", e[e.PRELU = 20] = "PRELU", e[e.SQUARED_DIFFERENCE = 21] = "SQUARED_DIFFERENCE", e[e.SUB = 22] = "SUB";
+})(e ||= {});
+var t = "let resultTemp = a + b;", n = "let resultTemp = atan2(a, b);", r = "let resultTemp = areal * breal - aimag * bimag;", i = "let resultTemp = areal * bimag + aimag * breal;", a = "let resultTemp = a / b;", o = "let resultTemp = select(a * (b + 1.0), a, b >= b - b);", s = "\n  let zero = sign(a) * 0 + 0;\n  let one = sign(b) * 0 + 1;\n  let resultTemp = select(zero, one, a == b);\n", c = "\n  let remainder =\n      select(a % b, round(a % b), (round(a) == a) & (round(b) == b));\n  let quotient = (a - remainder) / b;\n  let resultTemp =\n      round(select(quotient, quotient - 1, sign(remainder) == -sign(b)));\n", l = "\n  let zero = sign(a) * 0 + 0;\n  let one = sign(b) * 0 + 1;\n  let resultTemp = select(zero, one, a > b);\n", u = "\n  let zero = sign(a) * 0 + 0;\n  let one = sign(b) * 0 + 1;\n  let resultTemp = select(zero, one, a >= b);\n", d = "\n  let zero = sign(a) * 0 + 0;\n  let one = sign(b) * 0 + 1;\n  let resultTemp = select(zero, one, a < b);\n", f = "\n  let zero = sign(a) * 0 + 0;\n  let one = sign(b) * 0 + 1;\n  let resultTemp = select(zero, one, a <= b);\n", p = "return f32(a >= 1.0 && b >= 1.0);", m = "return (vec4<f32>(a >= vec4<f32>(1.0)) *\n  vec4<f32>(b >= vec4<f32>(1.0)));", h = "return f32(a >= 1.0 || b >= 1.0);", g = "return min(vec4<f32>(a >= vec4<f32>(1.0)) +\n  vec4<f32>(b >= vec4<f32>(1.0)), vec4<f32>(1.0));", _ = "let resultTemp = max(a, b);", v = "let resultTemp = min(a, b);", y = "\n  let isNaN = b == 0.;\n  var resultTemp = a % b;\n  resultTemp = select((resultTemp + b) % b, resultTemp,\n      (a < 0. && b < 0.) || (a >= 0. && b > 0.));\n", b = "\n  let isNaN = !vec4<bool>(b);\n  var resultTemp = vec4<f32>(a % b);\n  if (!((a[0] < 0. && b[0] < 0.) || (a[0] >= 0. && b[0] > 0.))) {\n    resultTemp[0] = (resultTemp[0] + b[0]) % b[0];\n  }\n  if (!((a[1] < 0. && b[1] < 0.) || (a[1] >= 0. && b[1] > 0.))) {\n    resultTemp[1] = (resultTemp[1] + b[1]) % b[1];\n  }\n  if (!((a[2] < 0. && b[2] < 0.) || (a[2] >= 0. && b[2] > 0.))) {\n    resultTemp[2] = (resultTemp[2] + b[2]) % b[2];\n  }\n  if (!((a[3] < 0. && b[3] < 0.) || (a[3] >= 0. && b[3] > 0.))) {\n    resultTemp[3] = (resultTemp[3] + b[3]) % b[3];\n  }\n", x = "let resultTemp = a * b;", S = "\n  var resultTemp = f32(a != b);\n  let valueForNaN = 1.0;\n", C = "\n  var resultTemp = vec4<f32>(a != b);\n  let valueForNaN = 1.0;\n", w = "\n  let isNaN = a < 0.0 && floor(b) < b;\n  if (b == 0.0) {\n    return 1.0;\n  }\n  var resultTemp = select(sign(a) * pow(abs(a), b), pow(abs(a), b),\n      round(abs(b) % 2.0) != 1.0);\n", T = "\n  let isModRound1Bool = vec4<i32>(round(abs(b) % vec4<f32>(2.0))) == vec4<i32>(1);\n  let isModRound1 = vec4<f32>(isModRound1Bool);\n  let multiplier = sign(a) * isModRound1 + (vec4<f32>(1.0) - isModRound1);\n  var resultTemp = multiplier * pow(abs(a), b);\n\n  // Ensure that a^0 = 1, including 0^0 = 1 as this correspond to TF and JS\n  let isExpZero = b == vec4<f32>(0.0);\n  if (isExpZero.r) {\n    resultTemp.r = 1.0;\n  }\n  if (isExpZero.g) {\n    resultTemp.g = 1.0;\n  }\n  if (isExpZero.b) {\n    resultTemp.b = 1.0;\n  }\n  if (isExpZero.a) {\n    resultTemp.a = 1.0;\n  }\n  let isNaN = (a < vec4<f32>(0.0)) & (floor(b) < b);\n", E = "if (a < 0.0) { return b * a; }  return a;", D = "\n  let aLessThanZero = vec4<f32>(a < vec4<f32>(0.0));\n  return (aLessThanZero * (b * a)) + ((vec4<f32>(1.0) - aLessThanZero) * a);\n", O = "let resultTemp = (a - b) * (a - b);", k = "let resultTemp = a - b;";
+function A(A, j) {
+	let M;
+	do {
+		switch (A) {
+			case e.ATAN2:
+				M = n;
+				break;
+			case e.MAX:
+				M = _;
+				break;
+			case e.MIN:
+				M = v;
+				break;
+			case e.MOD:
+				M = j ? b : y;
+				break;
+			case e.NOT_EQUAL:
+				M = j ? C : S;
+				break;
+			case e.POW:
+				M = j ? T : w;
+				break;
+			default: continue;
+		}
+		let t, r, i;
+		return j ? (t = "isnanVec4", r = "vec4<f32>", i = "vec4<bool>") : (t = "isnan", r = "f32", i = "bool"), `
+      let aIsNaN = ${t}(a);
+      let aPostLegalization = select(a, ${r}(42), aIsNaN);
+      let bIsNaN = ${t}(b);
+      let bPostLegalization = select(b, ${r}(42), bIsNaN);
+      let isNaN = false;
+      let valueForNaN = uniforms.NAN;
+      {
+        let a = aPostLegalization;
+        let b = bPostLegalization;
+        ${M}
+        return select(
+            resultTemp, ${r}(valueForNaN),
+            ${i}(isNaN) | aIsNaN | bIsNaN);
+      }
+    `;
+	} while (!1);
+	switch (A) {
+		case e.ADD:
+			M = t;
+			break;
+		case e.COMPLEX_MULTIPLY_IMAG:
+			M = i;
+			break;
+		case e.COMPLEX_MULTIPLY_REAL:
+			M = r;
+			break;
+		case e.DIV:
+			M = a;
+			break;
+		case e.ELU_DER:
+			M = o;
+			break;
+		case e.EQUAL:
+			M = s;
+			break;
+		case e.FLOOR_DIV:
+			M = c;
+			break;
+		case e.GREATER:
+			M = l;
+			break;
+		case e.GREATER_EQUAL:
+			M = u;
+			break;
+		case e.LESS:
+			M = d;
+			break;
+		case e.LESS_EQUAL:
+			M = f;
+			break;
+		case e.LOGICAL_AND: return j ? m : p;
+		case e.LOGICAL_OR: return j ? g : h;
+		case e.MUL:
+			M = x;
+			break;
+		case e.PRELU: return j ? D : E;
+		case e.SQUARED_DIFFERENCE:
+			M = O;
+			break;
+		case e.SUB:
+			M = k;
+			break;
+		default:
+	}
+	return `
+    ${M}
+    return resultTemp;
+  `;
+}
+//#endregion
+export { A as n, e as t };

package/dist/checks/appendCache.js

@@ -1,22 +1,55 @@
-import { s, h as a } from "../index-CUXkjxiT.js";
-import { t } from "../tensor4d-C6UCG_u8.js";
-async function u(e) {
-  await s(e);
-  const n = t(
-    [
-      [
-        [
-          [0.1, 0.2, 0, 0],
-          [0.1, 0.2, 0, 0],
-          [0, 0, 0, 0],
-          [0, 0, 0, 0]
-        ]
-      ]
-    ],
-    [1, 1, 4, 4]
-  ), r = t([[[[0.1, 0.2, 0.3, 0.4]]]], [1, 1, 1, 4]);
-  return await a().runKernel("AppendCache", { cache: n, item: r }, { maxSize: 4, pastLen: 2 }).array();
+import { P as e, ii as t, ui as n } from "../dist-BewPQWjc.js";
+//#region lib/checks/appendCache.ts
+async function r(r) {
+	await n(r);
+	let i = e([[[
+		[
+			.1,
+			.2,
+			0,
+			0
+		],
+		[
+			.1,
+			.2,
+			0,
+			0
+		],
+		[
+			0,
+			0,
+			0,
+			0
+		],
+		[
+			0,
+			0,
+			0,
+			0
+		]
+	]]], [
+		1,
+		1,
+		4,
+		4
+	]), a = e([[[[
+		.1,
+		.2,
+		.3,
+		.4
+	]]]], [
+		1,
+		1,
+		1,
+		4
+	]);
+	return await t().runKernel("AppendCache", {
+		cache: i,
+		item: a
+	}, {
+		maxSize: 4,
+		pastLen: 2
+	}).array();
 }
-export {
-  u as execute
-};
+//#endregion
+export { r as execute };

package/dist/checks/attentionMask.js

@@ -1,37 +1,56 @@
-import { s as i, h as a } from "../index-CUXkjxiT.js";
-import { t } from "../tensor4d-C6UCG_u8.js";
-import { t as e } from "../tensor2d-BnXMKScO.js";
-async function k(n) {
-  await i(n);
-  const s = t(
-    [
-      [
-        [
-          [0.1, 0.2, 0.3, 0.4],
-          [0.3, 0.4, 0.5, 0.6]
-        ]
-      ]
-    ],
-    [1, 1, 2, 4]
-  ), o = t(
-    [
-      [
-        [
-          [0.5, 0.6, 0.5, 0.6],
-          [0.7, 0.8, 0.7, 0.8]
-        ]
-      ]
-    ],
-    [1, 1, 2, 4]
-  ), r = e(
-    [
-      [0, -1 / 0, -1 / 0, -1 / 0],
-      [0, 0, 0, -1 / 0]
-    ],
-    [2, 4]
-  );
-  return await a().runKernel("AttentionMask", { q: s, k: o, mask: r }, { divisor: 0.5, pastLen: 0 }).array();
+import { I as e, P as t, ii as n, ui as r } from "../dist-BewPQWjc.js";
+//#region lib/checks/attentionMask.ts
+async function i(i) {
+	await r(i);
+	let a = t([[[[
+		.1,
+		.2,
+		.3,
+		.4
+	], [
+		.3,
+		.4,
+		.5,
+		.6
+	]]]], [
+		1,
+		1,
+		2,
+		4
+	]), o = t([[[[
+		.5,
+		.6,
+		.5,
+		.6
+	], [
+		.7,
+		.8,
+		.7,
+		.8
+	]]]], [
+		1,
+		1,
+		2,
+		4
+	]), s = e([[
+		0,
+		-Infinity,
+		-Infinity,
+		-Infinity
+	], [
+		0,
+		0,
+		0,
+		-Infinity
+	]], [2, 4]);
+	return await n().runKernel("AttentionMask", {
+		q: a,
+		k: o,
+		mask: s
+	}, {
+		divisor: .5,
+		pastLen: 0
+	}).array();
 }
-export {
-  k as execute
-};
+//#endregion
+export { i as execute };