@alphacharts/indicators 0.0.0-stage → 0.1.1

package/dist/define-XUgQMhSl.js

@@ -0,0 +1,687 @@
+//#region src/engine/feed.ts
+var e = [
+	"open",
+	"high",
+	"low",
+	"close",
+	"volume"
+], t = class {
+	graph = new p();
+	align = "same";
+	spanMs = 0;
+	cur = 0;
+	get n() {
+		return this.graph.n;
+	}
+	load(t, r, i = "outside series") {
+		n(r, i);
+		let a = t.time.length;
+		for (let n of e) {
+			if (!(t[n] instanceof Float64Array)) throw TypeError(`${i}: ${n} must be a Float64Array`);
+			if (t[n].length !== a) throw RangeError(`${i}: ${n} has ${t[n].length} rows, time has ${a}`);
+		}
+		for (let e = 0; e < a; e++) {
+			if (!Number.isFinite(t.time[e])) throw RangeError(`${i}: time at row ${e} is not a finite number`);
+			if (e > 0 && !(t.time[e] > t.time[e - 1])) throw RangeError(`${i}: times must be strictly increasing (row ${e})`);
+		}
+		let o = this.graph;
+		o.clear(), o.reserve(a), o.time.v.set(t.time);
+		for (let n of e) o[n].v.set(t[n]);
+		o.n = a, o.run(0, a), this.cur = 0, this.align = r.align, this.spanMs = r.spanMs;
+	}
+	configure(e, t = "outside series") {
+		n(e, t), this.align = e.align, this.spanMs = e.spanMs;
+	}
+	apply(t, n = "outside series") {
+		let r = this.graph, i = r.n;
+		if (!Number.isFinite(t.time)) throw RangeError(`${n}: bar time is not a finite number`);
+		if (i > 0 && t.time < r.time.v[i - 1]) throw RangeError(`${n}: bar time ${t.time} is earlier than the last bar ${r.time.v[i - 1]}; load the series again instead`);
+		let a = i > 0 && t.time === r.time.v[i - 1], o = a ? i - 1 : i;
+		a || (r.reserve(i + 1), r.n = i + 1), r.time.v[o] = t.time;
+		for (let n of e) r[n].v[o] = t[n];
+		return r.run(o, o + 1), a ? "revised" : "appended";
+	}
+	snapshot() {
+		let e = this.graph, t = e.n;
+		return {
+			time: e.time.v.slice(0, t),
+			open: e.open.v.slice(0, t),
+			high: e.high.v.slice(0, t),
+			low: e.low.v.slice(0, t),
+			close: e.close.v.slice(0, t),
+			volume: e.volume.v.slice(0, t)
+		};
+	}
+	lookup(e) {
+		let t = this.graph.n;
+		if (t === 0 || e !== e) return -1;
+		let n = this.graph.time.v, r = this.align === "same" ? e : e - this.spanMs, i = this.cur < t ? this.cur : t - 1;
+		if (n[i] <= r) for (; i + 1 < t && n[i + 1] <= r;) i++;
+		else {
+			let e = 0, t = i;
+			for (; e < t;) {
+				let i = e + t >>> 1;
+				n[i] <= r ? e = i + 1 : t = i;
+			}
+			if (i = e - 1, i < 0) return -1;
+		}
+		return this.cur = i, this.align === "same" ? n[i] === e ? i : -1 : i;
+	}
+	value(e, t) {
+		return t < 0 ? NaN : this.graph[e].v[t];
+	}
+};
+function n(e, t) {
+	if (e.align !== "same" && e.align !== "closed") throw RangeError(`${t}: align must be "same" or "closed", got ${String(e.align)}`);
+	if (e.align === "closed" && !(Number.isFinite(e.spanMs) && e.spanMs > 0)) throw RangeError(`${t}: a "closed" feed needs spanMs > 0, got ${String(e.spanMs)}`);
+}
+function r(e, t, n) {
+	let r = new Float64Array(n.length);
+	for (let i = 0; i < n.length; i++) r[i] = e.value(t, e.lookup(n[i]));
+	return r;
+}
+function i(e, t, r) {
+	n(r, "outside series");
+	let i = e.length, a = t.length, o = {
+		align: r.align,
+		chartBars: i
+	};
+	if (i === 0 || a === 0) return {
+		...o,
+		matched: 0,
+		reason: "empty",
+		offsetMs: null,
+		message: i === 0 ? "The chart has no bars." : "The outside series has no bars."
+	};
+	let s = 0, c = 0;
+	for (let n = 0; n < i; n++) {
+		let i = e[n];
+		if (r.align === "same") {
+			for (; c < a && t[c] < i;) c++;
+			c < a && t[c] === i && s++;
+		} else {
+			let e = i - r.spanMs;
+			for (; c < a && t[c] <= e;) c++;
+			c > 0 && s++;
+		}
+	}
+	if (s === i) return {
+		...o,
+		matched: s,
+		reason: "complete",
+		offsetMs: null,
+		message: "Every chart bar sees a bar of the outside series."
+	};
+	if (s > 0) return {
+		...o,
+		matched: s,
+		reason: "partial",
+		offsetMs: null,
+		message: `${i - s} of ${i} chart bars have no bar of the outside series and are blank (a missing bar is never filled).`
+	};
+	if (r.align === "closed") return {
+		...o,
+		matched: s,
+		reason: "no-finished-bar",
+		offsetMs: null,
+		message: "No bar of the outside series has finished by any chart bar, so every value is blank."
+	};
+	let l = (t[0] - e[0]) % r.spanMs;
+	l > r.spanMs / 2 ? l -= r.spanMs : l <= -r.spanMs / 2 && (l += r.spanMs);
+	let u = Math.round(Math.abs(l) / 6e4), d = l === 0 ? "its bars never fall at the same time as the chart's (the two do not trade at the same times)" : `its bars open ${u} minute${u === 1 ? "" : "s"} ${l > 0 ? "after" : "before"} the chart's`;
+	return {
+		...o,
+		matched: s,
+		reason: "different-clock",
+		offsetMs: l,
+		message: `No chart bar has a bar of the outside series at exactly its time, so every value is blank: ${d}. A series on the chart's own timeframe joins only at equal times; read a longer timeframe (for example 1d) or a series on the same clock.`
+	};
+}
+//#endregion
+//#region src/engine/kernels.ts
+var a = null;
+function o(e) {
+	a = e;
+}
+function s() {
+	return a;
+}
+function c(e, t, n) {
+	if (!a || t !== 0 || n < 4096) return !1;
+	for (let t = 0; t < n; t++) if (e[t] !== e[t]) return !1;
+	return !0;
+}
+//#endregion
+//#region src/engine/graph.ts
+var l = class {
+	v;
+	constructor(e) {
+		this.v = new Float64Array(e).fill(NaN);
+	}
+}, u = class extends l {
+	run = () => {};
+}, d = [
+	"close",
+	"open",
+	"high",
+	"low",
+	"hl2",
+	"hlc3",
+	"ohlc4",
+	"hlcc4"
+], f = NaN, p = class {
+	n = 0;
+	cap = 0;
+	cols = [];
+	nodes = [];
+	time;
+	open;
+	high;
+	low;
+	close;
+	volume;
+	sources = /* @__PURE__ */ new Map();
+	feeds = /* @__PURE__ */ new Map();
+	constructor(e = 0) {
+		this.cap = e, this.time = this.col(), this.open = this.col(), this.high = this.col(), this.low = this.col(), this.close = this.col(), this.volume = this.col();
+	}
+	col() {
+		let e = new l(this.cap);
+		return this.cols.push(e), e;
+	}
+	reserve(e) {
+		if (e <= this.cap) return;
+		let t = Math.max(e, Math.ceil(this.cap * 1.5), 256);
+		for (let e of this.cols) {
+			let n = new Float64Array(t).fill(f);
+			n.set(e.v.subarray(0, Math.min(this.n, e.v.length))), e.v = n;
+		}
+		this.cap = t;
+	}
+	run(e, t) {
+		if (t > this.cap) throw RangeError(`graph.run: ${t} bars exceed the reserved ${this.cap}`);
+		for (let n of this.nodes) n.run(e, t);
+	}
+	clear() {
+		for (let e of this.cols) e.v.fill(f, 0, this.n);
+		this.n = 0;
+	}
+	adopt(e, t) {
+		if (e.length !== this.cols.length) throw RangeError(`graph.adopt: ${e.length} columns, expected ${this.cols.length}`);
+		this.cols.forEach((t, n) => t.v = e[n]), this.cap = e[0]?.length ?? 0, this.n = t;
+	}
+	node(e) {
+		let t = new u(this.cap);
+		return t.run = (n, r) => e(t, n, r), this.cols.push(t), this.nodes.push(t), t;
+	}
+	calc(e) {
+		return this.node((t, n, r) => {
+			let i = t.v;
+			for (let t = n; t < r; t++) i[t] = e(t);
+		});
+	}
+	val(e) {
+		return typeof e == "number" ? () => e : (t) => e.v[t];
+	}
+	src(e) {
+		let t = this.sources.get(e);
+		if (t) return t;
+		let { open: n, high: r, low: i, close: a } = this, o;
+		switch (e) {
+			case "close":
+				o = this.map(a, (e) => e);
+				break;
+			case "open":
+				o = this.map(n, (e) => e);
+				break;
+			case "high":
+				o = this.map(r, (e) => e);
+				break;
+			case "low":
+				o = this.map(i, (e) => e);
+				break;
+			case "hl2":
+				o = this.node((e, t, n) => {
+					let a = r.v, o = i.v, s = e.v;
+					for (let e = t; e < n; e++) s[e] = (a[e] + o[e]) / 2;
+				});
+				break;
+			case "hlc3":
+				o = this.node((e, t, n) => {
+					let o = r.v, s = i.v, c = a.v, l = e.v;
+					for (let e = t; e < n; e++) l[e] = (o[e] + s[e] + c[e]) / 3;
+				});
+				break;
+			case "ohlc4":
+				o = this.node((e, t, o) => {
+					let s = n.v, c = r.v, l = i.v, u = a.v, d = e.v;
+					for (let e = t; e < o; e++) d[e] = (s[e] + c[e] + l[e] + u[e]) / 4;
+				});
+				break;
+			case "hlcc4":
+				o = this.node((e, t, n) => {
+					let o = r.v, s = i.v, c = a.v, l = e.v;
+					for (let e = t; e < n; e++) l[e] = (o[e] + s[e] + 2 * c[e]) / 4;
+				});
+				break;
+			default: throw RangeError(`unknown source "${String(e)}"`);
+		}
+		return this.sources.set(e, o), o;
+	}
+	feed(e) {
+		let n = this.feeds.get(e);
+		return n || this.feeds.set(e, n = new t()), n;
+	}
+	external(e, t) {
+		return this.joined(e, t);
+	}
+	joined(e, t) {
+		let n = this.feed(e), r = this.time;
+		return this.node((i, a, o) => {
+			let s = r.v, c = i.v, l = this.feeds.get(e) ?? n, u = typeof t == "string" ? l.graph[t] : t;
+			for (let e = a; e < o; e++) {
+				let t = l.lookup(s[e]);
+				c[e] = t < 0 ? f : u.v[t];
+			}
+		});
+	}
+	map(e, t) {
+		return this.node((n, r, i) => {
+			let a = e.v, o = n.v;
+			for (let e = r; e < i; e++) o[e] = t(a[e]);
+		});
+	}
+	map2(e, t, n) {
+		let r = this.val(e), i = this.val(t);
+		return this.node((e, t, a) => {
+			let o = e.v;
+			for (let e = t; e < a; e++) o[e] = n(r(e), i(e));
+		});
+	}
+	add(e, t) {
+		return this.map2(e, t, (e, t) => e + t);
+	}
+	sub(e, t) {
+		return this.map2(e, t, (e, t) => e - t);
+	}
+	mul(e, t) {
+		return this.map2(e, t, (e, t) => e * t);
+	}
+	div(e, t) {
+		return this.map2(e, t, (e, t) => t === 0 ? f : e / t);
+	}
+	max2(e, t) {
+		return this.map2(e, t, (e, t) => e !== e || t !== t ? f : e > t ? e : t);
+	}
+	min2(e, t) {
+		return this.map2(e, t, (e, t) => e !== e || t !== t ? f : e < t ? e : t);
+	}
+	abs(e) {
+		return this.map(e, Math.abs);
+	}
+	neg(e) {
+		return this.map(e, (e) => -e);
+	}
+	lag(e, t) {
+		return this.node((n, r, i) => {
+			let a = e.v, o = n.v;
+			for (let e = r; e < i; e++) o[e] = e >= t ? a[e - t] : f;
+		});
+	}
+	change(e, t = 1) {
+		return this.node((n, r, i) => {
+			let a = e.v, o = n.v;
+			for (let e = r; e < i; e++) o[e] = e >= t ? a[e] - a[e - t] : f;
+		});
+	}
+	validRun(e) {
+		return this.node((t, n, r) => {
+			let i = e.v, a = t.v;
+			for (let e = n; e < r; e++) a[e] = i[e] === i[e] ? (e > 0 ? a[e - 1] : 0) + 1 : 0;
+		});
+	}
+	sum(e, t) {
+		if (y(t), t === 1) return this.map(e, (e) => e);
+		let n = this.validRun(e), r = this.col();
+		return this.node((i, a, o) => {
+			let l = e.v, u = n.v, d = r.v, p = i.v;
+			if (c(l, a, o)) {
+				let e = s().sumState(l.subarray(0, o), t);
+				p.set(e.sum), d.set(e.state);
+			} else for (let e = a; e < o; e++) {
+				let n = u[e];
+				if (n === 0) {
+					d[e] = 0, p[e] = f;
+					continue;
+				}
+				let r = (n > 1 ? d[e - 1] : 0) + l[e];
+				n > t && (r -= l[e - t]), d[e] = r, p[e] = n >= t ? r : f;
+			}
+		});
+	}
+	sma(e, t) {
+		let n = this.sum(e, t);
+		return this.map(n, (e) => e / t);
+	}
+	smooth(e, t, n) {
+		y(t);
+		let r = this.validRun(e);
+		return this.node((i, a, o) => {
+			let s = e.v, c = r.v, l = i.v;
+			for (let e = a; e < o; e++) {
+				let r = c[e];
+				if (r === 0) {
+					l[e] = f;
+					continue;
+				}
+				let i = e > 0 ? l[e - 1] : f;
+				if (i === i) l[e] = i + n * (s[e] - i);
+				else if (r >= t) {
+					let n = 0;
+					for (let r = e - t + 1; r <= e; r++) n += s[r];
+					l[e] = n / t;
+				} else l[e] = f;
+			}
+		});
+	}
+	ema(e, t) {
+		return this.smooth(e, t, 2 / (t + 1));
+	}
+	rma(e, t) {
+		return this.smooth(e, t, 1 / t);
+	}
+	wma(e, t) {
+		y(t);
+		let n = this.validRun(e), r = this.col(), i = this.col(), a = t * (t + 1) / 2;
+		return this.node((o, s, c) => {
+			let l = e.v, u = n.v, d = r.v, p = i.v, m = o.v;
+			for (let e = s; e < c; e++) {
+				let n = u[e];
+				if (n === 0) {
+					d[e] = 0, p[e] = 0, m[e] = f;
+					continue;
+				}
+				let r = l[e];
+				if (n < t) d[e] = (n > 1 ? d[e - 1] : 0) + r, p[e] = (n > 1 ? p[e - 1] : 0) + n * r, m[e] = f;
+				else if (n === t) d[e] = (n > 1 ? d[e - 1] : 0) + r, p[e] = (n > 1 ? p[e - 1] : 0) + t * r, m[e] = p[e] / a;
+				else {
+					let n = d[e - 1];
+					p[e] = p[e - 1] - n + t * r, d[e] = n - l[e - t] + r, m[e] = p[e] / a;
+				}
+			}
+		});
+	}
+	highest(e, t) {
+		return this.extreme(e, t, !0, !1);
+	}
+	lowest(e, t) {
+		return this.extreme(e, t, !1, !1);
+	}
+	highestBars(e, t, n = !1) {
+		return this.extreme(e, t, !0, !0, n);
+	}
+	lowestBars(e, t, n = !1) {
+		return this.extreme(e, t, !1, !0, n);
+	}
+	extreme(e, t, n, r, i = !1) {
+		y(t);
+		let a = this.validRun(e);
+		return this.node((o, l, u) => {
+			let d = e.v, p = a.v, m = o.v;
+			if (!i && c(d, l, u)) {
+				let e = s(), i = d.subarray(0, u);
+				m.set(r ? n ? e.highestBars(i, t) : e.lowestBars(i, t) : n ? e.highest(i, t) : e.lowest(i, t));
+			} else for (let e = l; e < u; e++) {
+				if (p[e] < t) {
+					m[e] = f;
+					continue;
+				}
+				let a = d[e], o = 0;
+				for (let r = 1; r < t; r++) {
+					let t = d[e - r];
+					(n ? i ? t >= a : t > a : i ? t <= a : t < a) && (a = t, o = r);
+				}
+				m[e] = r ? o : a;
+			}
+		});
+	}
+	variance(e, t, n = !1) {
+		if (y(t), n && t < 2) throw RangeError(`sample variance needs a period of at least 2, got ${t}`);
+		let r = this.sma(e, t), i = n ? t / (t - 1) : 1;
+		return this.node((a, o, l) => {
+			let u = e.v, d = r.v, p = a.v;
+			if (c(u, o, l)) {
+				if (p.set(s().variance(u.subarray(0, l), t)), n) for (let e = 0; e < l; e++) p[e] = p[e] * i;
+			} else for (let e = o; e < l; e++) {
+				let r = d[e];
+				if (r !== r) {
+					p[e] = f;
+					continue;
+				}
+				let i = 0;
+				for (let n = e - t + 1; n <= e; n++) {
+					let e = u[n] - r;
+					i += e * e;
+				}
+				p[e] = n ? i / (t - 1) : i / t;
+			}
+		});
+	}
+	stdev(e, t, n = !1) {
+		return this.map(this.variance(e, t, n), Math.sqrt);
+	}
+	linreg(e, t) {
+		if (!Number.isInteger(t) || t < 2) throw RangeError(`linreg: period must be an integer >= 2, got ${t}`);
+		let n = this.validRun(e), r = t * (t - 1) / 2, i = t * (t * (t - 1) * (2 * t - 1) / 6) - r * r, a = this.col(), o = this.col();
+		return {
+			value: this.node((l, u, d) => {
+				let p = e.v, m = n.v, h = a.v, g = o.v, _ = l.v;
+				if (c(p, u, d)) {
+					let e = s().linreg(p.subarray(0, d), t);
+					_.set(e.value), h.set(e.slope), g.set(e.intercept);
+				} else for (let e = u; e < d; e++) {
+					if (m[e] < t) {
+						h[e] = f, g[e] = f, _[e] = f;
+						continue;
+					}
+					let n = 0, a = 0;
+					for (let r = 0; r < t; r++) {
+						let i = p[e - t + 1 + r];
+						n += i, a += r * i;
+					}
+					let o = (t * a - r * n) / i, s = (n - o * r) / t;
+					h[e] = o, g[e] = s, _[e] = s + o * (t - 1);
+				}
+			}),
+			slope: this.alias(a),
+			intercept: this.alias(o)
+		};
+	}
+	alias(e) {
+		return this.node((t, n, r) => {
+			let i = e.v, a = t.v;
+			for (let e = n; e < r; e++) a[e] = i[e];
+		});
+	}
+	tr() {
+		let { high: e, low: t, close: n } = this;
+		return this.node((r, i, a) => {
+			let o = e.v, s = t.v, c = n.v, l = r.v;
+			for (let e = i; e < a; e++) {
+				if (e === 0) {
+					l[e] = f;
+					continue;
+				}
+				let t = c[e - 1], n = o[e] - s[e], r = Math.abs(o[e] - t), i = Math.abs(s[e] - t);
+				l[e] = n > r ? n > i ? n : i : r > i ? r : i;
+			}
+		});
+	}
+	trFirst() {
+		let { high: e, low: t, close: n } = this;
+		return this.node((r, i, a) => {
+			let o = e.v, s = t.v, c = n.v, l = r.v;
+			for (let e = i; e < a; e++) {
+				let t = o[e] - s[e];
+				if (e === 0) {
+					l[e] = t;
+					continue;
+				}
+				let n = c[e - 1], r = Math.abs(o[e] - n), i = Math.abs(s[e] - n);
+				l[e] = t > r ? t > i ? t : i : r > i ? r : i;
+			}
+		});
+	}
+	atr(e) {
+		return this.rma(this.trFirst(), e);
+	}
+	barsPerYear(e = 0) {
+		let t = this.time, n = e * 6e4, r = this.col();
+		return this.node((e, i, a) => {
+			let o = t.v, s = r.v, c = e.v;
+			for (let e = i; e < a; e++) {
+				let t = e > 0 && Math.floor((o[e] + n) / m) === Math.floor((o[e - 1] + n) / m);
+				s[e] = t ? s[e - 1] + 1 : 1, c[e] = t ? c[e - 1] : e === 0 ? f : v(o, s, e);
+			}
+		});
+	}
+}, m = 864e5, h = 252, g = .05;
+function _(e) {
+	e.sort((e, t) => e - t);
+	let t = e.length >> 1;
+	return e.length % 2 == 0 ? (e[t - 1] + e[t]) / 2 : e[t];
+}
+function v(e, t, n) {
+	let r = [];
+	for (let e = n - 1; e >= 0 && r.length < 60; e -= t[e]) r.push(t[e]);
+	let i = _(r);
+	if (i >= 2) return i * h;
+	let a = Math.max(0, n - 120 + 1), o = n - a + 1;
+	if (o < 6) return f;
+	let s = [];
+	for (let t = a + 1; t <= n; t++) e[t] > e[t - 1] && s.push(e[t] - e[t - 1]);
+	if (s.length === 0) return f;
+	let c = _(s);
+	if (c >= m && c < 1.5 * m) {
+		let t = [
+			0,
+			0,
+			0,
+			0,
+			0,
+			0,
+			0
+		];
+		for (let r = a; r <= n; r++) t[(Math.floor(e[r] / m) % 7 + 7) % 7]++;
+		if (Math.min(...t.map((e, n) => e + t[(n + 1) % 7])) <= Math.max(g * o, +(o >= 7))) return h * m / c;
+	}
+	return 365 * m / c;
+}
+function y(e) {
+	if (!Number.isInteger(e) || e < 1) throw RangeError(`period must be a positive integer, got ${e}`);
+}
+//#endregion
+//#region src/define.ts
+var b = (e, t, n = 1, r = 1e4, i = e) => ({
+	key: e,
+	label: i,
+	type: "int",
+	default: t,
+	min: n,
+	max: r,
+	step: 1
+}), x = (e, t, n = -1e9, r = 1e9, i = .1, a = e) => ({
+	key: e,
+	label: a,
+	type: "float",
+	default: t,
+	min: n,
+	max: r,
+	step: i
+}), S = (e, t, n = e) => ({
+	key: e,
+	label: n,
+	type: "bool",
+	default: t
+}), C = (e, t, n, r = e) => ({
+	key: e,
+	label: r,
+	type: "select",
+	default: t,
+	options: n
+}), w = (e = "close", t = "source") => ({
+	key: t,
+	label: t,
+	type: "source",
+	default: e,
+	options: d
+}), T = {
+	blue: "#2962FF",
+	orange: "#FF6D00",
+	red: "#F23645",
+	green: "#089981",
+	purple: "#9C27B0",
+	teal: "#00897B",
+	yellow: "#FBC02D",
+	pink: "#E91E63",
+	gray: "#787B86",
+	lime: "#8BC34A",
+	cyan: "#00BCD4",
+	brown: "#795548"
+}, E = (e, t, n = {}) => ({
+	kind: "line",
+	key: n.key ?? e,
+	title: n.title ?? e,
+	col: e,
+	color: t,
+	...n.width !== void 0 && { width: n.width },
+	...n.style && { style: n.style },
+	...n.offset !== void 0 && { offset: n.offset },
+	...n.connect && { connect: !0 }
+}), D = (e, t, n, r = {}) => ({
+	kind: "histogram",
+	key: r.key ?? e,
+	title: r.title ?? e,
+	col: e,
+	color: t,
+	...n && { colorDown: n }
+}), O = (e, t, n, r, i, a = e) => ({
+	kind: "band",
+	key: e,
+	title: a,
+	upper: t,
+	lower: n,
+	color: r,
+	fill: i
+}), k = (e, t, n, r, i = e) => ({
+	kind: "fill",
+	key: e,
+	title: i,
+	a: t,
+	b: n,
+	color: r
+}), A = (e, t, n = T.gray, r = "dashed") => ({
+	kind: "hline",
+	key: e,
+	title: e,
+	value: t,
+	color: n,
+	style: r
+}), j = (e, t, n, r, i = {}) => ({
+	kind: "markers",
+	key: i.key ?? e,
+	title: i.title ?? e,
+	col: e,
+	shape: t,
+	position: n,
+	color: r,
+	...i.offset !== void 0 && { offset: i.offset },
+	...i.text && { text: !0 }
+});
+function M(e) {
+	return e;
+}
+//#endregion
+export { r as S, d as _, k as a, t as b, A as c, j as d, C as f, u as g, p as h, M as i, b as l, l as m, O as n, x as o, w as p, S as r, D as s, T as t, E as u, o as v, i as x, e as y };
+
+//# sourceMappingURL=define-XUgQMhSl.js.map