@genai-fi/nanogpt 0.20.0 → 0.20.1

package/dist/shared-DOgWaqvL.js

@@ -0,0 +1,5 @@
+import { t as e } from "./shared-D1coEFea.js";
+//#region node_modules/@tensorflow/tfjs-backend-webgl/dist/kernel_utils/shared.js
+var { addImpl: t, bincountImpl: n, bincountReduceImpl: r, bitwiseAndImpl: i, castImpl: a, ceilImpl: o, concatImpl: s, equalImpl: c, expImpl: l, expm1Impl: u, floorImpl: d, gatherNdImpl: f, gatherV2Impl: p, greaterImpl: m, greaterEqualImpl: h, lessImpl: g, lessEqualImpl: _, linSpaceImpl: v, logImpl: y, maxImpl: b, maximumImpl: x, minimumImpl: S, multiplyImpl: C, negImpl: w, notEqualImpl: T, prodImpl: E, raggedGatherImpl: D, raggedRangeImpl: O, raggedTensorToTensorImpl: k, rangeImpl: A, rsqrtImpl: j, scatterImpl: M, sigmoidImpl: N, simpleAbsImpl: P, sliceImpl: F, sparseFillEmptyRowsImpl: I, sparseReshapeImpl: L, sparseSegmentReductionImpl: R, sqrtImpl: z, staticRegexReplaceImpl: B, stridedSliceImpl: V, stringNGramsImpl: H, stringSplitImpl: U, stringToHashBucketFastImpl: W, subImpl: G, tileImpl: K, topKImpl: q, transposeImpl: J, uniqueImpl: Y } = e;
+//#endregion
+export { A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, R, S, T, U, V, W, Y, g as _, a, b, c, d, f, _ as g, m as h, i, j, k, l, h as m, n, o, p, q, r, s, t, u, v, w, x, y, z };

package/dist/slice_util-Dgb3ANWI.js

@@ -0,0 +1,208 @@
+import { r as e } from "./chunk-BPntVaq0.js";
+import { Ls as t, Ps as n } from "./dist-BewPQWjc.js";
+//#region node_modules/@tensorflow/tfjs-core/dist/ops/slice_util.js
+var r = /* @__PURE__ */ e({
+	assertParamsValid: () => o,
+	computeFlatOffset: () => y,
+	computeOutShape: () => c,
+	getNormalizedAxes: () => f,
+	isSliceContinous: () => v,
+	maskToAxes: () => s,
+	parseSliceParams: () => b,
+	sliceInfo: () => x,
+	startForAxis: () => g,
+	startIndicesWithElidedDims: () => p,
+	stopForAxis: () => _,
+	stopIndicesWithElidedDims: () => m,
+	stridesForAxis: () => h,
+	stridesWithElidedDims: () => l
+}), i = -2, a = -1;
+function o(e, t, r) {
+	let i = e.shape.length;
+	n(i === t.length, () => `Error in slice${i}D: Length of begin ${t} must match the rank of the array (${i}).`), n(i === r.length, () => `Error in slice${i}D: Length of size ${r} must match the rank of the array (${i}).`);
+	for (let a = 0; a < i; ++a) n(t[a] + r[a] <= e.shape[a], () => `Error in slice${i}D: begin[${a}] + size[${a}] (${t[a] + r[a]}) would overflow input.shape[${a}] (${e.shape[a]})`);
+}
+function s(e) {
+	let t = [], n = 0;
+	for (; e > 0;) e & 1 && t.push(n), e /= 2, n++;
+	return t;
+}
+function c(e, t, n) {
+	let r = [];
+	for (let i = 0; i < e.length; i++) r[i] = Math.ceil((t[i] - e[i]) / n[i]);
+	return r;
+}
+function l(e, t, n, r) {
+	let i = [...e];
+	for (let e = i.length; e < r.length; e++) i.push(1);
+	for (let e = 0; e < n; e++) e === 0 ? i[t] = 1 : (i.splice(t, 0, 1), i.pop());
+	return i;
+}
+function u(e, t, n) {
+	return n <= e ? n : n - (t - 1);
+}
+function d(e, t) {
+	let n = [];
+	for (let r = 0; r < e; r++) n.push(t + r);
+	return n;
+}
+function f(e, t, n, r, i, a, o, s, c) {
+	let u = e.length, d = Array(u), f = Array(u), v = Array(u);
+	if (t.length && n > 0) {
+		let c = t[0], u = n + 1;
+		d = p(o, c, u, r, e), f = m(s, c, u, i, e), v = l(a, c, u, e);
+	} else for (let t = 0; t < u; t++) d[t] = g(o, r, a, e, t, c), f[t] = _(s, i, a, e, t, c), v[t] = h(a, t, c);
+	return {
+		begin: d,
+		end: f,
+		strides: v
+	};
+}
+function p(e, t, n, r, i) {
+	let a = [...i], o = d(n, t);
+	for (let i = 0; i < a.length; i++) if (o.indexOf(i) > -1) a[i] = 0;
+	else {
+		let o = u(t, n, i), s = r[o];
+		e & 1 << o && (s = 0), a[i] = s;
+	}
+	return a;
+}
+function m(e, n, r, i, a) {
+	let o = [...a], s = d(r, n);
+	for (let t = 0; t < o.length; t++) if (s.indexOf(t) > -1) o[t] = 2 ** 53 - 1;
+	else {
+		let a = u(n, r, t), s = i[a];
+		e & 1 << a && (s = 2 ** 53 - 1), o[t] = s;
+	}
+	for (let e = 0; e < o.length; e++) {
+		let n = a[e];
+		o[e] < 0 && (o[e] += n), o[e] = t(0, o[e], a[e]);
+	}
+	return o;
+}
+function h(e, t, n) {
+	let r = e[t];
+	return (n & 1 << t || r == null) && (r = 1), r;
+}
+function g(e, n, r, i, a, o) {
+	let s = n[a], c = r[a] || 1;
+	(e & 1 << a || o & 1 << a || s == null) && (s = c > 0 ? -(2 ** 53 - 1) : 2 ** 53 - 1);
+	let l = i[a];
+	return s < 0 && (s += l), s = t(0, s, l - 1), s;
+}
+function _(e, n, r, i, a, o) {
+	let s = n[a], c = r[a] || 1;
+	(e & 1 << a || o & 1 << a || s == null) && (s = c > 0 ? 2 ** 53 - 1 : -(2 ** 53 - 1));
+	let l = i[a];
+	return s < 0 && (s += l), s = c > 0 ? t(0, s, l) : t(-1, s, l - 1), s;
+}
+function v(e, t, n) {
+	let r = n.length;
+	for (let e = 0; e < n.length; e++) if (n[e] > 1) {
+		r = e;
+		break;
+	}
+	for (let i = r + 1; i < n.length; i++) if (t[i] > 0 || n[i] !== e[i]) return !1;
+	return !0;
+}
+function y(e, t) {
+	let n = e.length > 0 ? e[e.length - 1] : 1;
+	for (let r = 0; r < e.length - 1; r++) n += e[r] * t[r];
+	return n;
+}
+function b(e, t, r) {
+	let i, a = e.shape.length;
+	i = typeof t == "number" ? [t, ...Array(a - 1).fill(0)] : t.length < a ? t.concat(Array(a - t.length).fill(0)) : t.slice(), i.forEach((e) => {
+		n(e !== -1, () => "slice() does not support negative begin indexing.");
+	});
+	let o;
+	return o = r == null ? Array(a).fill(-1) : typeof r == "number" ? [r, ...Array(a - 1).fill(-1)] : r.length < a ? r.concat(Array(a - r.length).fill(-1)) : r, o = o.map((t, r) => t >= 0 ? t : (n(t === -1, () => `Negative size values should be exactly -1 but got ${t} for the slice() size at index ${r}.`), e.shape[r] - i[r])), [i, o];
+}
+function x(e, t, n, r, a, o, s, c, l) {
+	let u;
+	if (r == null ? (u = Array(t.length), u.fill(1)) : u = r, s != null && s & s - 1) throw Error("Multiple ellipses in slice is not allowed.");
+	let d = !1, f = {
+		dims: u.length,
+		numAddAxisAfterEllipsis: 0,
+		begin: t.slice(),
+		end: n.slice(),
+		strides: u.slice(),
+		beginMask: a,
+		endMask: o,
+		ellipsisMask: s,
+		newAxisMask: c,
+		shrinkAxisMask: l
+	};
+	for (let e = 0; e < f.dims; e++) d && 1 << e & c && f.numAddAxisAfterEllipsis++, 1 << e & s && (d = !0);
+	d || (f.ellipsisMask |= 1 << f.dims, f.dims++);
+	let p = {
+		dims: e.length,
+		beginMask: 0,
+		endMask: 0,
+		beginValid: !1,
+		endValid: !1
+	};
+	S(f, p);
+	let m = !0, h = !0, g = !0, _ = [], v = [];
+	for (let t = 0; t < e.length; ++t) {
+		if (p.strides[t] === 0) throw Error(`strides[${t}] must be non-zero`);
+		let n = !!(p.shrinkAxisMask & 1 << t), r = e[t];
+		if (r === -1) {
+			_.push(n ? 1 : -1);
+			continue;
+		}
+		let i = [p.beginMask & 1 << t, p.endMask & 1 << t], a = [p.strides[t] > 0 ? 0 : -1, p.strides[t] > 0 ? r : r - 1];
+		if (n && p.strides[t] <= 0) throw Error("only stride 1 allowed on non-range indexing.");
+		g &&= p.strides[t] === 1;
+		let o = !!(p.beginMask & 1 << t && p.endMask & 1 << t);
+		if (p.beginValid && p.endValid) {
+			if (n) {
+				let e = p.begin[t] < 0 ? r + p.begin[t] : p.begin[t];
+				if (p.begin[t] = e, p.end[t] = p.begin[t] + 1, e < 0 || e >= r) throw Error(`slice index ${p.begin[t]} of dimension ${t} out of bounds.`);
+			} else p.begin[t] = C(p.begin[t], 0, p.strides[t], r, i, a), p.end[t] = C(p.end[t], 1, p.strides[t], r, i, a);
+			let e = p.strides[t] === 1 && p.begin[t] === 0 && p.end[t] === r;
+			m &&= e, h &&= t === 0 && p.strides[t] === 1 || e;
+		} else m = m && p.strides[t] === 1 && o, h &&= t === 0 && p.strides[t] === 1 || o;
+		let s, c = !1;
+		if (p.beginValid && p.endValid ? (s = p.end[t] - p.begin[t], c = !0) : n ? (s = 1, c = !0) : o && r >= 0 && (s = p.strides[t] < 0 ? -r : r, c = !0), c) {
+			let e;
+			e = s === 0 || s < 0 != p.strides[t] < 0 ? 0 : Math.trunc(s / p.strides[t]) + (s % p.strides[t] === 0 ? 0 : 1), _.push(e);
+		} else _.push(-1);
+	}
+	for (let e = 0; e < p.finalShapeGatherIndices.length; ++e) {
+		let t = p.finalShapeGatherIndices[e];
+		t >= 0 ? v.push(_[t]) : t === i && v.push(1);
+	}
+	return {
+		finalShapeSparse: v.filter((e, t) => p.finalShapeGatherIndices[t] !== i),
+		finalShape: v,
+		isIdentity: m,
+		sliceDim0: h,
+		isSimpleSlice: g,
+		begin: p.begin,
+		end: p.end,
+		strides: p.strides
+	};
+}
+function S(e, t) {
+	t.beginMask = 0, t.endMask = 0, t.shrinkAxisMask = 0;
+	let n = 0;
+	t.beginValid = e.begin != null, t.endValid = e.end != null, t.begin = Array(t.dims), t.end = Array(t.dims), t.strides = Array(t.dims), t.finalShapeGatherIndices = [], t.finalShapeGatherIndicesSparse = [], t.inputShapeGatherIndicesSparse = Array(t.dims);
+	for (let r = 0; r < e.dims; r++) if (1 << r & e.ellipsisMask) {
+		let i = Math.min(t.dims - (e.dims - r) + 1 + e.numAddAxisAfterEllipsis, t.dims);
+		for (; n < i; n++) t.begin[n] = 0, t.end[n] = 0, t.strides[n] = 1, t.beginMask |= 1 << n, t.endMask |= 1 << n, t.finalShapeGatherIndices.push(n), t.finalShapeGatherIndicesSparse.push(-1), t.inputShapeGatherIndicesSparse[n] = r;
+	} else if (1 << r & e.newAxisMask) t.finalShapeGatherIndices.push(i), t.finalShapeGatherIndicesSparse.push(-1);
+	else {
+		if (n === t.begin.length) throw Error(`Index out of range using input dim ${n}; input has only ${t.dims} dims, ${t.begin.length}.`);
+		e.begin != null && (t.begin[n] = e.begin[r]), e.end != null && (t.end[n] = e.end[r]), t.strides[n] = e.strides[r], e.beginMask & 1 << r && (t.beginMask |= 1 << n), e.endMask & 1 << r && (t.endMask |= 1 << n), e.shrinkAxisMask & 1 << r ? (t.finalShapeGatherIndices.push(a), t.finalShapeGatherIndicesSparse.push(-1), t.shrinkAxisMask |= 1 << n) : (t.finalShapeGatherIndices.push(n), t.finalShapeGatherIndicesSparse.push(r)), t.inputShapeGatherIndicesSparse[n] = r, n++;
+	}
+}
+function C(e, t, n, r, i, a) {
+	if (i[t]) return n > 0 ? a[t] : a[t + 1 & 1];
+	{
+		let t = e < 0 ? r + e : e;
+		return t < a[0] ? a[0] : t > a[1] ? a[1] : t;
+	}
+}
+//#endregion
+export { b as a, v as i, y as n, x as o, c as r, r as s, o as t };