@pie-element/graphing 10.1.1 → 10.1.2-next.1

package/dist/author/utils.js

@@ -0,0 +1,260 @@
+import { isEqual as e } from "@pie-element/shared-lodash";
+//#region src/author/utils.ts
+var t = [
+	.01,
+	.02,
+	.04,
+	.05,
+	.0625,
+	.1,
+	.125,
+	.2,
+	.25,
+	.5,
+	1,
+	2,
+	3,
+	4,
+	5,
+	8,
+	10,
+	12,
+	15,
+	20,
+	40,
+	50,
+	64,
+	100,
+	500,
+	1e3
+], n = [
+	.01,
+	.02,
+	.05,
+	.1,
+	.2,
+	.25,
+	.5,
+	1,
+	2,
+	5,
+	10,
+	20,
+	50,
+	100,
+	500,
+	1e3
+], r = {
+	.01: [
+		0,
+		.01,
+		.02,
+		.04,
+		.05,
+		.1
+	],
+	.02: [
+		0,
+		.02,
+		.04,
+		.1
+	],
+	.04: [
+		0,
+		.04,
+		.08,
+		.16,
+		.2
+	],
+	.05: [
+		0,
+		.05,
+		.1,
+		.2,
+		.25
+	],
+	.0625: [
+		0,
+		.0625,
+		.125,
+		.25,
+		.5
+	],
+	.1: [
+		0,
+		.1,
+		.2,
+		.4,
+		.5,
+		1
+	],
+	.125: [
+		0,
+		.125,
+		.25,
+		.5,
+		1
+	],
+	.2: [
+		0,
+		.2,
+		.5,
+		.1
+	],
+	.25: [
+		0,
+		.25,
+		.5,
+		1,
+		2
+	],
+	.5: [
+		0,
+		.5,
+		1,
+		2
+	],
+	1: [
+		0,
+		1,
+		2,
+		4,
+		5,
+		10
+	],
+	2: [
+		0,
+		2,
+		4,
+		8,
+		10
+	],
+	3: [
+		0,
+		3,
+		6,
+		12,
+		15
+	],
+	4: [
+		0,
+		4,
+		8,
+		16,
+		20
+	],
+	5: [
+		0,
+		5,
+		10,
+		20,
+		25
+	],
+	8: [
+		0,
+		8,
+		16,
+		32,
+		40,
+		64
+	],
+	10: [
+		0,
+		10,
+		20,
+		40,
+		50,
+		100
+	],
+	12: [
+		0,
+		12,
+		24
+	],
+	15: [
+		0,
+		15,
+		30,
+		60
+	],
+	20: [
+		0,
+		20,
+		40,
+		80,
+		100
+	],
+	40: [
+		0,
+		40,
+		80,
+		160,
+		200
+	],
+	50: [
+		0,
+		50,
+		100,
+		200,
+		250
+	],
+	64: [
+		0,
+		64,
+		128
+	],
+	100: [
+		0,
+		100,
+		200,
+		400,
+		500
+	],
+	500: [
+		0,
+		500,
+		1e3,
+		2500
+	],
+	1e3: [
+		0,
+		1e3,
+		2e3,
+		4e3,
+		5e3
+	]
+}, i = (e, r, i = !1) => {
+	let a = 10 * (e.max - e.min) / r, o = a * 10, s = i && !n.includes(e.step) && t.includes(e.step);
+	return (!i || s ? t : n).filter((e) => e >= a && e <= o);
+}, a = (e) => r[e] || [], o = (t, n, r, o) => {
+	let s = i(t, n), c = a(t.step);
+	if (!e(r, s) && !s.includes(t.step)) {
+		let e = i(t, n, !0)[0] || 1;
+		return t.step = e, c = a(e), c.includes(t.labelStep) || (t.labelStep = e), {
+			gridValues: s,
+			labelValues: c
+		};
+	}
+	return !e(o, c) && !c.includes(t.labelStep) && (t.labelStep = t.step), {
+		gridValues: s,
+		labelValues: c
+	};
+}, s = (e) => {
+	let t = [], n = 0;
+	for (; n >= e.min && t.indexOf(n) < 0;) t.push(n), n = Math.round((n - e.step) * 1e4) / 1e4;
+	for (n = Math.round(e.step * 1e4) / 1e4; n <= e.max && t.indexOf(n) < 0;) t.push(n), n = Math.round((n + e.step) * 1e4) / 1e4;
+	return t ? t.filter((t) => t >= e.min && t <= e.max) : [];
+}, c = (e, t, n) => {
+	let r = s(e), i = s(t), a = (e, t) => r.includes(e) && i.includes(t);
+	return Object.entries(n || {}).reduce((e, [t, n]) => (e[t] = {
+		...n,
+		marks: (n.marks || []).filter((e) => {
+			if (e.type === "point") return a(e.x, e.y);
+			if (e.type === "polygon") return !e.points.find((e) => !a(e.x, e.y));
+			let t = e.from || e.root, n = e.to || e.edge;
+			return e.building ? a(t.x, t.y) : a(t.x, t.y) && a(n.x, n.y);
+		})
+	}, e), {});
+};
+//#endregion
+export { o as applyConstraints, c as filterPlotableMarks, i as getGridValues, a as getLabelValues };