minerva-design 1.4.0 → 1.5.0

package/dist/charts/engine/trading/indicators.js

@@ -1,197 +1,474 @@
+import { offsetOf as e, zoneOffset as t } from "./format.js";
 //#region src/engine/trading/indicators.ts
-var e = Number.isFinite, t = (e) => new Float64Array(e).fill(NaN), n = (e) => Math.max(1, Math.floor(e) || 1), r = (t, r, i, a, o = 0) => {
-	let s = n(i), c = 0, l = 0;
-	for (let n = Math.max(0, o - s); n < o; n++) {
-		let r = t[n];
-		e(r) && (c += r, l++);
+var n = Number.isFinite, r = (e) => new Float64Array(e).fill(NaN), i = (e) => Math.max(1, Math.floor(e) || 1), a = (e, t, r, a, o = 0) => {
+	let s = i(r), c = 0, l = 0;
+	for (let t = Math.max(0, o - s); t < o; t++) {
+		let r = e[t];
+		n(r) && (c += r, l++);
 	}
-	for (let n = o; n < r; n++) {
-		let r = t[n];
-		if (e(r) && (c += r, l++), n >= s) {
-			let r = t[n - s];
-			e(r) && (c -= r, l--);
+	for (let r = o; r < t; r++) {
+		let t = e[r];
+		if (n(t) && (c += t, l++), r >= s) {
+			let t = e[r - s];
+			n(t) && (c -= t, l--);
 		}
-		a[n] = l === s ? c / s : NaN;
+		a[r] = l === s ? c / s : NaN;
 	}
-}, i = (t, n, r) => {
-	if (n < r - 1) return NaN;
+}, o = (e, t, r) => {
+	if (t < r - 1) return NaN;
 	let i = 0;
-	for (let a = n - r + 1; a <= n; a++) {
-		let n = t[a];
-		if (!e(n)) return NaN;
-		i += n;
+	for (let a = t - r + 1; a <= t; a++) {
+		let t = e[a];
+		if (!n(t)) return NaN;
+		i += t;
 	}
 	return i / r;
-}, a = (t, n, r, a, o, s) => {
-	for (let c = s; c < n; c++) {
-		let n = t[c], s = c > 0 ? o[c - 1] : NaN;
-		e(n) ? e(s) ? o[c] = s + a * (n - s) : o[c] = i(t, c, r) : o[c] = NaN;
+}, s = (e, t, r, i, a, s) => {
+	for (let c = s; c < t; c++) {
+		let t = e[c], s = c > 0 ? a[c - 1] : NaN;
+		n(t) ? n(s) ? a[c] = s + i * (t - s) : a[c] = o(e, c, r) : a[c] = NaN;
 	}
-}, o = (e, t, r, i, o = 0) => {
-	let s = n(r);
-	a(e, t, s, 2 / (s + 1), i, o);
-}, s = (e, t, r, i, o = 0) => {
-	let s = n(r);
-	a(e, t, s, 1 / s, i, o);
-}, c = (t, r, a, o, s = 0) => {
-	let c = n(a), l = c * (c + 1) / 2, u = (n) => {
-		if (n < c - 1) return NaN;
+}, c = (e, t, n, r, a = 0) => {
+	let o = i(n);
+	s(e, t, o, 2 / (o + 1), r, a);
+}, l = (e, t, n, r, a = 0) => {
+	let o = i(n);
+	s(e, t, o, 1 / o, r, a);
+}, u = (e, t, r, a, s = 0) => {
+	let c = i(r), l = c * (c + 1) / 2, u = (t) => {
+		if (t < c - 1) return NaN;
 		let r = 0;
 		for (let i = 0; i < c; i++) {
-			let a = t[n - i];
-			if (!e(a)) return NaN;
+			let a = e[t - i];
+			if (!n(a)) return NaN;
 			r += (c - i) * a;
 		}
 		return r;
-	}, d = s > 0 ? u(s - 1) : NaN, f = s > 0 ? i(t, s - 1, c) * c : NaN;
-	for (let n = s; n < r; n++) {
-		let r = t[n];
-		e(d) && e(f) && e(r) ? (d = d - f + c * r, f = f + r - (n >= c ? t[n - c] : 0)) : (d = u(n), f = i(t, n, c) * c), o[n] = e(d) ? d / l : NaN;
+	}, d = s > 0 ? u(s - 1) : NaN, f = s > 0 ? o(e, s - 1, c) * c : NaN;
+	for (let r = s; r < t; r++) {
+		let t = e[r];
+		n(d) && n(f) && n(t) ? (d = d - f + c * t, f = f + t - (r >= c ? e[r - c] : 0)) : (d = u(r), f = o(e, r, c) * c), a[r] = n(d) ? d / l : NaN;
 	}
-}, l = (t, r, a, o, s = 0) => {
-	let c = n(a);
-	for (let n = s; n < r; n++) {
-		let r = i(t, n, c);
-		if (!e(r)) {
-			o[n] = NaN;
+}, d = (e, t, r, a, s = 0) => {
+	let c = i(r);
+	for (let r = s; r < t; r++) {
+		let t = o(e, r, c);
+		if (!n(t)) {
+			a[r] = NaN;
 			continue;
 		}
-		let a = 0;
-		for (let e = n - c + 1; e <= n; e++) {
-			let n = t[e] - r;
-			a += n * n;
+		let i = 0;
+		for (let n = r - c + 1; n <= r; n++) {
+			let r = e[n] - t;
+			i += r * r;
 		}
-		o[n] = Math.sqrt(a / c);
+		a[r] = Math.sqrt(i / c);
 	}
-}, u = (t, r, i, a, o, s, c = 0) => {
-	let l = n(i);
-	for (let n = c; n < r; n++) {
-		if (o[n] = s[n] = NaN, a[n] = NaN, n === 0) continue;
-		let r = t[n] - t[n - 1];
-		if (e(r)) {
-			if (e(o[n - 1]) && e(s[n - 1])) o[n] = (o[n - 1] * (l - 1) + Math.max(r, 0)) / l, s[n] = (s[n - 1] * (l - 1) + Math.max(-r, 0)) / l;
-			else if (n >= l) {
-				let r = 0, i = 0, a = !0;
-				for (let o = n - l + 1; o <= n; o++) {
-					let n = t[o] - t[o - 1];
-					if (!e(n)) {
+}, f = (e, t, r, i, a, o) => {
+	let s = new Int32Array(r + 1), c = 0, l = 0, u = -1, d = (e, t) => o ? e >= t : e <= t, f = (t) => {
+		let i = e[t];
+		if (!n(i)) {
+			u = t, c = l = 0;
+			return;
+		}
+		for (; l > c && d(i, e[s[(l - 1) % (r + 1)]]);) l--;
+		for (s[l % (r + 1)] = t, l++; s[c % (r + 1)] <= t - r;) c++;
+	};
+	for (let e = Math.max(0, a - r + 1); e < a; e++) f(e);
+	for (let n = a; n < t; n++) f(n), i[n] = n < r - 1 || u > n - r || l === c ? NaN : e[s[c % (r + 1)]];
+}, p = (e, t, r, a, o, s, c = 0) => {
+	let l = i(r);
+	for (let r = c; r < t; r++) {
+		if (o[r] = s[r] = NaN, a[r] = NaN, r === 0) continue;
+		let t = e[r] - e[r - 1];
+		if (n(t)) {
+			if (n(o[r - 1]) && n(s[r - 1])) o[r] = (o[r - 1] * (l - 1) + Math.max(t, 0)) / l, s[r] = (s[r - 1] * (l - 1) + Math.max(-t, 0)) / l;
+			else if (r >= l) {
+				let t = 0, i = 0, a = !0;
+				for (let o = r - l + 1; o <= r; o++) {
+					let r = e[o] - e[o - 1];
+					if (!n(r)) {
 						a = !1;
 						break;
 					}
-					n > 0 ? r += n : i -= n;
+					r > 0 ? t += r : i -= r;
 				}
 				if (!a) continue;
-				o[n] = r / l, s[n] = i / l;
+				o[r] = t / l, s[r] = i / l;
 			} else continue;
-			a[n] = s[n] === 0 ? o[n] === 0 ? 50 : 100 : 100 - 100 / (1 + o[n] / s[n]);
+			a[r] = s[r] === 0 ? o[r] === 0 ? 50 : 100 : 100 - 100 / (1 + o[r] / s[r]);
 		}
 	}
-}, d = (t, n, r, i, a, o = 0) => {
+}, m = (e, t, r, i, a, o = 0) => {
 	for (let s = o; s < i; s++) {
-		let i = t[s] - n[s];
-		if (s === 0 || !e(r[s - 1])) {
+		let i = e[s] - t[s];
+		if (s === 0 || !n(r[s - 1])) {
 			a[s] = i;
 			continue;
 		}
 		let o = r[s - 1];
-		a[s] = Math.max(i, Math.abs(t[s] - o), Math.abs(n[s] - o));
+		a[s] = Math.max(i, Math.abs(e[s] - o), Math.abs(t[s] - o));
 	}
-}, f = (t, r, i, a, o, s, c, l, u, d, f = 0) => {
-	let p = n(o), m = n(s), h = n(c);
-	for (let n = f; n < a; n++) {
-		if (l[n] = u[n] = d[n] = NaN, n < p - 1) continue;
+}, h = (e, t, r, a, o, s, c, l, u, d, f = 0) => {
+	let p = i(o), m = i(s), h = i(c);
+	for (let i = f; i < a; i++) {
+		if (l[i] = u[i] = d[i] = NaN, i < p - 1) continue;
 		let a = -Infinity, o = Infinity;
-		for (let e = n - p + 1; e <= n; e++) t[e] > a && (a = t[e]), r[e] < o && (o = r[e]);
-		let s = i[n];
-		if (!e(a) || !e(o) || !e(s)) continue;
-		let c = a === o ? 50 : (s - o) / (a - o) * 100, f = n > 0 && e(l[n - 1]) ? l[n - 1] : 50, g = n > 0 && e(u[n - 1]) ? u[n - 1] : 50;
-		l[n] = ((m - 1) * f + c) / m, u[n] = ((h - 1) * g + l[n]) / h, d[n] = 3 * l[n] - 2 * u[n];
+		for (let n = i - p + 1; n <= i; n++) e[n] > a && (a = e[n]), t[n] < o && (o = t[n]);
+		let s = r[i];
+		if (!n(a) || !n(o) || !n(s)) continue;
+		let c = a === o ? 50 : (s - o) / (a - o) * 100, f = i > 0 && n(l[i - 1]) ? l[i - 1] : 50, g = i > 0 && n(u[i - 1]) ? u[i - 1] : 50;
+		l[i] = ((m - 1) * f + c) / m, u[i] = ((h - 1) * g + l[i]) / h, d[i] = 3 * l[i] - 2 * u[i];
 	}
-}, p = 864e5, m = (e, t, n = 0) => {
-	if (t === "none") return 0;
-	let r = e + n * 6e4, i = Math.floor(r / p);
-	if (t === "day") return i;
-	if (t === "week") return Math.floor((i + 3) / 7);
-	let a = new Date(r);
-	return a.getUTCFullYear() * 12 + a.getUTCMonth();
-}, h = (t, n, r, i, a, o, s, c, l, u, d, f = 0) => {
+}, g = 864e5, _ = (t, n, r = 0) => {
+	if (n === "none") return 0;
+	let i = t + e(r, t) * 6e4, a = Math.floor(i / g);
+	if (n === "day") return a;
+	if (n === "week") return Math.floor((a + 3) / 7);
+	let o = new Date(i);
+	return o.getUTCFullYear() * 12 + o.getUTCMonth();
+}, v = (e, t, r, i, a, o, s, c, l, u, d, f = 0) => {
 	for (let p = f; p < o; p++) {
-		let o = (t[p] + n[p] + r[p]) / 3, f = e(i[p]) ? i[p] : 0, h = p > 0 && (!a || m(a[p], s, c) === m(a[p - 1], s, c)), g = h && e(u[p - 1]) ? u[p - 1] : 0, _ = h && e(d[p - 1]) ? d[p - 1] : 0;
-		u[p] = g + (e(o) ? o * f : 0), d[p] = _ + f, l[p] = d[p] > 0 ? u[p] / d[p] : e(o) ? o : NaN;
+		let o = (e[p] + t[p] + r[p]) / 3, f = n(i[p]) ? i[p] : 0, m = p > 0 && (!a || _(a[p], s, c) === _(a[p - 1], s, c)), h = m && n(u[p - 1]) ? u[p - 1] : 0, g = m && n(d[p - 1]) ? d[p - 1] : 0;
+		u[p] = h + (n(o) ? o * f : 0), d[p] = g + f, l[p] = d[p] > 0 ? u[p] / d[p] : n(o) ? o : NaN;
 	}
-}, g = (t, n, r, i, a, o, s = 0) => {
+}, y = (e, t, r, i, a, o, s = 0) => {
 	for (let c = s; c < a; c++) {
-		let a = (t[c] + n[c] + r[c] + i[c]) / 4, s = c > 0 ? o.open[c - 1] : NaN, l = c > 0 ? o.close[c - 1] : NaN, u = e(s) && e(l) ? (s + l) / 2 : (t[c] + i[c]) / 2;
-		o.open[c] = u, o.close[c] = a, o.high[c] = Math.max(n[c], u, a), o.low[c] = Math.min(r[c], u, a);
+		let a = (e[c] + t[c] + r[c] + i[c]) / 4, s = c > 0 ? o.open[c - 1] : NaN, l = c > 0 ? o.close[c - 1] : NaN, u = n(s) && n(l) ? (s + l) / 2 : (e[c] + i[c]) / 2;
+		o.open[c] = u, o.close[c] = a, o.high[c] = Math.max(t[c], u, a), o.low[c] = Math.min(r[c], u, a);
+	}
+}, b = (e, t, r, i, a = 0) => {
+	for (let o = a; o < r; o++) {
+		if (o === 0) {
+			i[o] = 0;
+			continue;
+		}
+		let r = n(t[o]) ? t[o] : 0, a = n(i[o - 1]) ? i[o - 1] : 0, s = e[o] - e[o - 1];
+		i[o] = a + (s > 0 ? r : s < 0 ? -r : 0);
+	}
+}, x = (e, t, n, r, i, a) => {
+	for (let o = a; o < r; o++) i[o] = (e[o] + t[o] + n[o]) / 3;
+}, S = (e, t, r, o, s, c, l, u, d = 0) => {
+	let f = i(s);
+	x(e, t, r, o, l, d), a(l, o, f, u, d);
+	for (let e = d; e < o; e++) {
+		let t = u[e];
+		if (!n(t)) {
+			c[e] = NaN;
+			continue;
+		}
+		let r = 0;
+		for (let n = e - f + 1; n <= e; n++) r += Math.abs(l[n] - t);
+		r /= f, c[e] = r === 0 ? 0 : (l[e] - t) / (.015 * r);
+	}
+}, C = (e, t, r, a, o, s, c, l, u = 0) => {
+	let d = i(o);
+	f(e, a, d, c, u, !0), f(t, a, d, l, u, !1);
+	for (let e = u; e < a; e++) {
+		let t = c[e], i = l[e];
+		s[e] = !n(t) || !n(i) ? NaN : t === i ? -50 : (t - r[e]) / (t - i) * -100;
+	}
+}, w = (e, t, r, a, o, s, c, l, u = 0) => {
+	let d = i(s);
+	x(e, t, r, o, l, Math.max(0, u - d - 1));
+	for (let e = u; e < o; e++) {
+		if (e < d) {
+			c[e] = NaN;
+			continue;
+		}
+		let t = 0, r = 0, i = !0;
+		for (let o = e - d + 1; o <= e; o++) {
+			let e = l[o] * (n(a[o]) ? a[o] : 0);
+			if (!n(e) || !n(l[o - 1])) {
+				i = !1;
+				break;
+			}
+			l[o] > l[o - 1] ? t += e : l[o] < l[o - 1] && (r += e);
+		}
+		c[e] = i ? r === 0 ? t === 0 ? 50 : 100 : 100 - 100 / (1 + t / r) : NaN;
 	}
-}, _ = (e, n) => {
-	let i = t(e.length);
-	return r(e, e.length, n, i), i;
-}, v = (e, n) => {
-	let r = t(e.length);
-	return o(e, e.length, n, r), r;
-}, y = (e, n) => {
-	let r = t(e.length);
-	return c(e, e.length, n, r), r;
-}, b = (e, n = 20, i = 2) => {
-	let a = e.length, o = t(a), s = t(a), c = t(a), u = t(a);
-	r(e, a, n, o), l(e, a, n, u);
-	for (let e = 0; e < a; e++) s[e] = o[e] + i * u[e], c[e] = o[e] - i * u[e];
+}, T = (e, t, r, o, s, c, l, u, d, m = 0) => {
+	let h = i(o);
+	p(e, t, r, d.rsi, d.gain, d.loss, m), f(d.rsi, t, h, d.highest, m, !0), f(d.rsi, t, h, d.lowest, m, !1);
+	for (let e = m; e < t; e++) {
+		let t = d.highest[e], r = d.lowest[e];
+		d.raw[e] = !n(t) || !n(r) ? NaN : t === r ? 50 : (d.rsi[e] - r) / (t - r) * 100;
+	}
+	a(d.raw, t, s, l, m), a(l, t, c, u, m);
+}, E = (e, t, r, i, a, o, s, c, u, d, f = 0) => {
+	for (let n = f; n < i; n++) {
+		if (n === 0) {
+			d.tr[n] = d.plusDm[n] = d.minusDm[n] = NaN;
+			continue;
+		}
+		let i = e[n] - e[n - 1], a = t[n - 1] - t[n];
+		d.plusDm[n] = i > a && i > 0 ? i : 0, d.minusDm[n] = a > i && a > 0 ? a : 0;
+		let o = r[n - 1];
+		d.tr[n] = Math.max(e[n] - t[n], Math.abs(e[n] - o), Math.abs(t[n] - o));
+	}
+	l(d.tr, i, a, d.smoothTr, f), l(d.plusDm, i, a, d.smoothPlus, f), l(d.minusDm, i, a, d.smoothMinus, f);
+	for (let e = f; e < i; e++) {
+		let t = d.smoothTr[e];
+		s[e] = t ? 100 * d.smoothPlus[e] / t : NaN, c[e] = t ? 100 * d.smoothMinus[e] / t : NaN;
+		let r = s[e] + c[e];
+		d.dx[e] = n(r) ? r === 0 ? 0 : 100 * Math.abs(s[e] - c[e]) / r : NaN;
+	}
+	l(d.dx, i, o, u, f);
+}, D = (e, t, r, i, a, o, s, c, l = 0) => {
+	let { ep: u, af: d, trend: f } = c;
+	for (let c = l; c < r; c++) {
+		if (c === 0) {
+			s[c] = u[c] = d[c] = f[c] = NaN;
+			continue;
+		}
+		if (!n(f[c - 1])) {
+			let r = e[c] + t[c] >= e[c - 1] + t[c - 1];
+			s[c] = r ? Math.min(t[c - 1], t[c]) : Math.max(e[c - 1], e[c]), u[c] = r ? Math.max(e[c - 1], e[c]) : Math.min(t[c - 1], t[c]), d[c] = i, f[c] = n(s[c]) ? r ? 1 : -1 : NaN;
+			continue;
+		}
+		let r = u[c - 1], l = d[c - 1], p = s[c - 1] + l * (r - s[c - 1]), m = c >= 2 ? c - 2 : c - 1;
+		f[c - 1] === 1 ? (p = Math.min(p, t[c - 1], t[m]), t[c] < p ? (f[c] = -1, p = Math.max(r, e[c]), u[c] = t[c], d[c] = i) : (f[c] = 1, u[c] = Math.max(r, e[c]), d[c] = e[c] > r ? Math.min(l + a, o) : l)) : (p = Math.max(p, e[c - 1], e[m]), e[c] > p ? (f[c] = 1, p = Math.min(r, t[c]), u[c] = e[c], d[c] = i) : (f[c] = -1, u[c] = Math.min(r, t[c]), d[c] = t[c] < r ? Math.min(l + a, o) : l)), s[c] = p;
+	}
+}, O = (e, t, r, i, a, o, s, c, u, d = 0) => {
+	let { tr: f, atr: p, upper: h, lower: g } = u;
+	m(e, t, r, i, f, d), l(f, i, a, p, d);
+	for (let a = d; a < i; a++) {
+		let i = p[a];
+		if (!n(i)) {
+			s[a] = c[a] = h[a] = g[a] = NaN;
+			continue;
+		}
+		let l = (e[a] + t[a]) / 2, u = l + o * i, d = l - o * i, f = a > 0 ? h[a - 1] : NaN, m = a > 0 ? g[a - 1] : NaN, _ = a > 0 ? r[a - 1] : NaN;
+		n(m) && !(d > m || _ < m) && (d = m), n(f) && !(u < f || _ > f) && (u = f), h[a] = u, g[a] = d;
+		let v = a > 0 ? c[a - 1] : NaN, y = n(v) ? v === -1 ? r[a] > u ? 1 : -1 : r[a] < d ? -1 : 1 : -1;
+		c[a] = y, s[a] = y === 1 ? d : u;
+	}
+}, k = (e, t, n, r, a, o, s, c) => {
+	let l = i(r);
+	f(e, n, l, o, c, !0), f(t, n, l, s, c, !1);
+	for (let e = c; e < n; e++) a[e] = (o[e] + s[e]) / 2;
+}, A = (e, t, n, r, i, a, o, s, c, l, u, d = 0) => {
+	let { highest: f, lowest: p } = u;
+	k(e, t, n, r, o, f, p, d), k(e, t, n, i, s, f, p, d), k(e, t, n, a, l, f, p, d);
+	for (let e = d; e < n; e++) c[e] = (o[e] + s[e]) / 2;
+}, j = (e, t, n, r, a, o, s, c = 0) => {
+	let l = i(r);
+	f(e, n, l, a, c, !0), f(t, n, l, o, c, !1);
+	for (let e = c; e < n; e++) s[e] = (a[e] + o[e]) / 2;
+}, M = (e, t, n, r, i, a, o, s, u, d, f, p = 0) => {
+	c(n, r, i, s, p), m(e, t, n, r, f.tr, p), l(f.tr, r, o, f.atr, p);
+	for (let e = p; e < r; e++) u[e] = s[e] + a * f.atr[e], d[e] = s[e] - a * f.atr[e];
+}, N = (e, t) => {
+	let n = r(e.length);
+	return a(e, e.length, t, n), n;
+}, ee = (e, t) => {
+	let n = r(e.length);
+	return c(e, e.length, t, n), n;
+}, te = (e, t) => {
+	let n = r(e.length);
+	return u(e, e.length, t, n), n;
+}, ne = (e, t = 20, n = 2) => {
+	let i = e.length, o = r(i), s = r(i), c = r(i), l = r(i);
+	a(e, i, t, o), d(e, i, t, l);
+	for (let e = 0; e < i; e++) s[e] = o[e] + n * l[e], c[e] = o[e] - n * l[e];
 	return {
 		middle: o,
 		upper: s,
 		lower: c
 	};
-}, x = (e, n = 12, r = 26, i = 9) => {
-	let a = e.length, s = t(a), c = t(a);
-	o(e, a, n, s), o(e, a, r, c);
-	let l = t(a);
-	for (let e = 0; e < a; e++) l[e] = s[e] - c[e];
-	let u = t(a);
-	o(l, a, i, u);
-	let d = t(a);
+}, re = (e, t = 12, n = 26, i = 9) => {
+	let a = e.length, o = r(a), s = r(a);
+	c(e, a, t, o), c(e, a, n, s);
+	let l = r(a);
+	for (let e = 0; e < a; e++) l[e] = o[e] - s[e];
+	let u = r(a);
+	c(l, a, i, u);
+	let d = r(a);
 	for (let e = 0; e < a; e++) d[e] = l[e] - u[e];
 	return {
 		macd: l,
 		signal: u,
 		histogram: d
 	};
-}, S = (e, n = 14) => {
-	let r = e.length, i = t(r);
-	return u(e, r, n, i, t(r), t(r)), i;
-}, C = (e, n, r, i = 9, a = 3, o = 3) => {
-	let s = r.length, c = t(s), l = t(s), u = t(s);
-	return f(e, n, r, s, i, a, o, c, l, u), {
+}, P = (e, t = 14) => {
+	let n = e.length, i = r(n);
+	return p(e, n, t, i, r(n), r(n)), i;
+}, F = (e, t, n, i = 9, a = 3, o = 3) => {
+	let s = n.length, c = r(s), l = r(s), u = r(s);
+	return h(e, t, n, s, i, a, o, c, l, u), {
 		k: c,
 		d: l,
 		j: u
 	};
-}, w = (e, n, r, i = 14) => {
-	let a = r.length, o = t(a);
-	d(e, n, r, a, o);
-	let c = t(a);
-	return s(o, a, i, c), c;
-}, T = (e, n, r, i, a = {}) => {
-	let o = r.length, s = t(o);
-	return h(e, n, r, i, a.time ?? null, o, a.reset ?? "day", a.utcOffset ?? 0, s, t(o), t(o)), s;
-}, E = (e) => {
-	let n = e.close.length, r = {
-		open: t(n),
-		high: t(n),
-		low: t(n),
-		close: t(n)
+}, I = (e, t, n, i = 14) => {
+	let a = n.length, o = r(a);
+	m(e, t, n, a, o);
+	let s = r(a);
+	return l(o, a, i, s), s;
+}, L = (e, n, i, a, o = {}) => {
+	let s = i.length, c = r(s), l = o.timeZone;
+	return v(e, n, i, a, o.time ?? null, s, o.reset ?? "day", o.utcOffset ?? (l ? (e) => t(e, l) : 0), c, r(s), r(s)), c;
+}, R = (e) => {
+	let t = e.close.length, n = {
+		open: r(t),
+		high: r(t),
+		low: r(t),
+		close: r(t)
+	};
+	return y(e.open, e.high, e.low, e.close, t, n), n;
+}, z = (e, t) => {
+	let n = r(e.length);
+	return b(e, t, e.length, n), n;
+}, B = (e, t, n, i = 20) => {
+	let a = n.length, o = r(a);
+	return S(e, t, n, a, i, o, r(a), r(a)), o;
+}, V = (e, t, n, i = 14) => {
+	let a = n.length, o = r(a);
+	return C(e, t, n, a, i, o, r(a), r(a)), o;
+}, H = (e, t, n, i, a = 14) => {
+	let o = n.length, s = r(o);
+	return w(e, t, n, i, o, a, s, r(o)), s;
+}, U = (e, t = {}) => {
+	let n = e.length, i = r(n), a = r(n);
+	return T(e, n, t.rsiPeriod ?? 14, t.stochPeriod ?? 14, t.kPeriod ?? 3, t.dPeriod ?? 3, i, a, {
+		rsi: r(n),
+		gain: r(n),
+		loss: r(n),
+		highest: r(n),
+		lowest: r(n),
+		raw: r(n)
+	}), {
+		k: i,
+		d: a
+	};
+}, W = (e, t, n, i = 14, a = 14) => {
+	let o = n.length, s = r(o), c = r(o), l = r(o);
+	return E(e, t, n, o, i, a, s, c, l, {
+		tr: r(o),
+		plusDm: r(o),
+		minusDm: r(o),
+		smoothTr: r(o),
+		smoothPlus: r(o),
+		smoothMinus: r(o),
+		dx: r(o)
+	}), {
+		plus: s,
+		minus: c,
+		adx: l
+	};
+}, G = (e, t, n = {}) => {
+	let i = e.length, a = r(i), o = n.start ?? .02;
+	return D(e, t, i, o, n.increment ?? o, n.maximum ?? .2, a, {
+		ep: r(i),
+		af: r(i),
+		trend: r(i)
+	}), a;
+}, K = (e, t, n, i = 10, a = 3) => {
+	let o = n.length, s = r(o), c = r(o);
+	return O(e, t, n, o, i, a, s, c, {
+		tr: r(o),
+		atr: r(o),
+		upper: r(o),
+		lower: r(o)
+	}), {
+		value: s,
+		direction: c
+	};
+}, q = (e, t, n = {}) => {
+	let i = e.length, a = {
+		conversion: r(i),
+		base: r(i),
+		spanA: r(i),
+		spanB: r(i)
+	};
+	return A(e, t, i, n.conversionPeriod ?? 9, n.basePeriod ?? 26, n.spanBPeriod ?? 52, a.conversion, a.base, a.spanA, a.spanB, {
+		highest: r(i),
+		lowest: r(i)
+	}), a;
+}, J = (e, t, n, i = {}) => {
+	let a = n.length, o = {
+		middle: r(a),
+		upper: r(a),
+		lower: r(a)
+	};
+	return M(e, t, n, a, i.period ?? 20, i.multiplier ?? 2, i.atrPeriod ?? 10, o.middle, o.upper, o.lower, {
+		tr: r(a),
+		atr: r(a)
+	}), o;
+}, Y = (e, t, n = 20) => {
+	let i = e.length, a = {
+		upper: r(i),
+		lower: r(i),
+		middle: r(i)
 	};
-	return g(e.open, e.high, e.low, e.close, n, r), r;
-}, D = {
+	return j(e, t, i, n, a.upper, a.lower, a.middle), a;
+}, ie = (e, t = {}) => {
+	let r = e.close.length, i = Math.max(0, Math.floor(t.from ?? 0)), a = Math.min(r - 1, Math.floor(t.to ?? r - 1)), o = Math.max(1, Math.floor(t.rows ?? 24)), s = Infinity, c = -Infinity;
+	for (let t = i; t <= a; t++) e.low[t] < s && (s = e.low[t]), e.high[t] > c && (c = e.high[t]);
+	let l = new Float64Array(o), u = new Float64Array(o), d = {
+		low: s,
+		high: c,
+		step: 0,
+		up: l,
+		down: u,
+		total: 0,
+		poc: -1,
+		valueAreaFrom: -1,
+		valueAreaTo: -1
+	};
+	if (!n(s) || !n(c)) return d;
+	c === s && (c += Math.abs(s) * 1e-6 || 1e-6, s -= Math.abs(s) * 1e-6 || 1e-6);
+	let f = (c - s) / o, p = 0;
+	for (let t = i; t <= a; t++) {
+		let r = e.volume[t], i = e.low[t], a = e.high[t];
+		if (!(r > 0) || !n(i) || !n(a)) continue;
+		let c = e.close[t] >= e.open[t] ? l : u;
+		p += r;
+		let d = Math.min(o - 1, Math.max(0, Math.floor((i - s) / f))), m = Math.min(o - 1, Math.max(0, Math.floor((a - s) / f)));
+		if (d === m || a <= i) {
+			c[d] += r;
+			continue;
+		}
+		let h = a - i;
+		for (let e = d; e <= m; e++) {
+			let t = s + e * f, n = Math.min(a, t + f) - Math.max(i, t);
+			n > 0 && (c[e] += r * n / h);
+		}
+	}
+	if (!(p > 0)) return {
+		...d,
+		low: s,
+		high: c,
+		step: f
+	};
+	let m = 0;
+	for (let e = 1; e < o; e++) l[e] + u[e] > l[m] + u[m] && (m = e);
+	let h = p * Math.min(1, Math.max(0, t.valueArea ?? .7)), g = m, _ = m, v = l[m] + u[m];
+	for (; v < h && (g > 0 || _ < o - 1);) {
+		let e = g > 0 ? l[g - 1] + u[g - 1] : -1;
+		(_ < o - 1 ? l[_ + 1] + u[_ + 1] : -1) >= e ? (_++, v += l[_] + u[_]) : (g--, v += l[g] + u[g]);
+	}
+	return {
+		low: s,
+		high: c,
+		step: f,
+		up: l,
+		down: u,
+		total: p,
+		poc: m,
+		valueAreaFrom: g,
+		valueAreaTo: _
+	};
+}, X = {
 	s: 1e3,
 	m: 6e4,
 	h: 36e5,
 	H: 36e5,
-	d: p,
-	D: p,
-	w: 7 * p,
-	W: 7 * p
-}, O = (e) => {
+	d: g,
+	D: g,
+	w: 7 * g,
+	W: 7 * g
+}, Z = (e) => {
 	if (typeof e == "number") return e > 0 ? {
 		unit: "ms",
 		count: e,
@@ -205,29 +482,28 @@ var e = Number.isFinite, t = (e) => new Float64Array(e).fill(NaN), n = (e) => Ma
 	return r === "M" ? {
 		unit: "month",
 		count: n,
-		ms: n * 30 * p
+		ms: n * 30 * g
 	} : {
 		unit: "ms",
-		count: n * D[r],
-		ms: n * D[r]
+		count: n * X[r],
+		ms: n * X[r]
 	};
-}, k = (e, t, n = 0) => {
-	let r = n * 6e4, i = e + r;
-	if (t.unit === "month") {
-		let e = new Date(i), n = e.getUTCFullYear() * 12 + e.getUTCMonth(), a = n - n % t.count;
-		return Date.UTC(Math.floor(a / 12), a % 12, 1) - r;
-	}
-	if (t.count % (7 * p) == 0) {
-		let e = 4 * p;
-		return Math.floor((i - e) / t.count) * t.count + e - r;
+}, Q = (t, n, r = 0) => {
+	let i = t + e(r, t) * 6e4;
+	if (n.unit === "month") {
+		let e = new Date(i), t = e.getUTCFullYear() * 12 + e.getUTCMonth();
+		return t - t % n.count;
 	}
-	return Math.floor(i / t.count) * t.count - r;
-}, A = (e) => !Array.isArray(e);
-function j(e, t, n = 0) {
-	let r = O(t);
-	if (!r) throw Error(`Invalid timeframe: ${String(t)}`);
-	let i = A(e), a = i ? e.close.length : e.length, o = (t) => {
-		if (!i) return e[t];
+	return n.count % (7 * g) == 0 ? Math.floor((i - 4 * g) / n.count) : Math.floor(i / n.count);
+}, $ = (t, n, r = 0) => {
+	let i = Q(t, n, r), a = n.unit === "month" ? Date.UTC(Math.floor(i / 12), i % 12, 1) : n.count % (7 * g) == 0 ? i * n.count + 4 * g : i * n.count, o = a - e(r, t) * 6e4;
+	return a - e(r, o) * 6e4;
+}, ae = (e) => !Array.isArray(e);
+function oe(e, n, r = 0) {
+	let i = Z(n);
+	if (!i) throw Error(`Invalid timeframe: ${String(n)}`);
+	let a = typeof r == "string" ? (e) => t(e, r) : r, o = ae(e), s = o ? e.close.length : e.length, c = (t) => {
+		if (!o) return e[t];
 		let n = e;
 		return {
 			time: n.time[t],
@@ -237,32 +513,32 @@ function j(e, t, n = 0) {
 			close: n.close[t],
 			volume: n.volume ? n.volume[t] : void 0
 		};
-	}, s = [], c = null;
-	for (let e = 0; e < a; e++) {
-		let t = o(e), i = k(t.time, r, n);
-		!c || i !== c.time ? (c && s.push(c), c = {
-			time: i,
+	}, l = [], u = null, d = NaN;
+	for (let e = 0; e < s; e++) {
+		let t = c(e), n = Q(t.time, i, a);
+		!u || n !== d ? (u && l.push(u), d = n, u = {
+			time: $(t.time, i, a),
 			open: t.open,
 			high: t.high,
 			low: t.low,
 			close: t.close,
 			volume: t.volume ?? 0
-		}) : (t.high > c.high && (c.high = t.high), t.low < c.low && (c.low = t.low), c.close = t.close, c.volume = (c.volume ?? 0) + (t.volume ?? 0));
+		}) : (t.high > u.high && (u.high = t.high), t.low < u.low && (u.low = t.low), u.close = t.close, u.volume = (u.volume ?? 0) + (t.volume ?? 0));
 	}
-	if (c && s.push(c), !i) return s;
-	let l = s.length, u = {
-		time: new Float64Array(l),
-		open: new Float64Array(l),
-		high: new Float64Array(l),
-		low: new Float64Array(l),
-		close: new Float64Array(l),
-		volume: new Float64Array(l)
+	if (u && l.push(u), !o) return l;
+	let f = l.length, p = {
+		time: new Float64Array(f),
+		open: new Float64Array(f),
+		high: new Float64Array(f),
+		low: new Float64Array(f),
+		close: new Float64Array(f),
+		volume: new Float64Array(f)
 	};
-	return s.forEach((e, t) => {
-		u.time[t] = e.time, u.open[t] = e.open, u.high[t] = e.high, u.low[t] = e.low, u.close[t] = e.close, u.volume[t] = e.volume ?? 0;
-	}), u;
+	return l.forEach((e, t) => {
+		p.time[t] = e.time, p.open[t] = e.open, p.high[t] = e.high, p.low[t] = e.low, p.close[t] = e.close, p.volume[t] = e.volume ?? 0;
+	}), p;
 }
 //#endregion
-export { w as atr, b as bollinger, k as bucketStart, v as ema, o as emaInto, E as heikinAshi, g as heikinAshiInto, C as kdj, f as kdjInto, x as macd, O as parseTimeframe, j as resampleBars, s as rmaInto, S as rsi, u as rsiInto, m as sessionKey, _ as sma, r as smaInto, l as stdevInto, d as trueRangeInto, T as vwap, h as vwapInto, y as wma, c as wmaInto };
+export { I as atr, ne as bollinger, Q as bucketKey, $ as bucketStart, B as cci, S as cciInto, W as dmi, E as dmiInto, Y as donchian, j as donchianInto, ee as ema, c as emaInto, R as heikinAshi, y as heikinAshiInto, q as ichimoku, A as ichimokuInto, F as kdj, h as kdjInto, J as keltner, M as keltnerInto, re as macd, H as mfi, w as mfiInto, z as obv, b as obvInto, Z as parseTimeframe, G as psar, D as psarInto, oe as resampleBars, l as rmaInto, P as rsi, p as rsiInto, _ as sessionKey, N as sma, a as smaInto, d as stdevInto, U as stochRsi, T as stochRsiInto, K as supertrend, O as supertrendInto, m as trueRangeInto, ie as volumeProfile, L as vwap, v as vwapInto, V as williamsR, C as williamsRInto, te as wma, u as wmaInto };
 
 //# sourceMappingURL=indicators.js.map