@pie-lib/graphing 4.0.5-next.0 → 4.0.5-next.102

package/dist/undo-redo.js

@@ -1,47 +0,0 @@
-import e from "react";
-import t from "prop-types";
-import n from "classnames";
-import { styled as r } from "@mui/material/styles";
-import { jsx as i, jsxs as a } from "react/jsx-runtime";
-import { color as o } from "@pie-lib/render-ui";
-import s from "@mui/material/Button";
-import c from "@pie-lib/translator";
-//#region src/undo-redo.tsx
-var { translator: l } = c, u = r(s)(({ theme: e }) => ({
-	color: o.text(),
-	fontWeight: "bold",
-	marginBottom: e.spacing(.5),
-	"&:not(:last-of-type)": { marginRight: e.spacing(.5) },
-	"&:hover": { backgroundColor: o.buttonHoverBg() }
-})), d = class extends e.Component {
-	static propTypes = {
-		className: t.string,
-		onUndo: t.func.isRequired,
-		onRedo: t.func.isRequired,
-		onReset: t.func.isRequired,
-		language: t.string
-	};
-	static defaultProps = {};
-	render() {
-		let { className: e, onUndo: t, onRedo: r, onReset: o, language: s } = this.props;
-		return /* @__PURE__ */ a("div", {
-			className: n(e),
-			children: [
-				/* @__PURE__ */ i(u, {
-					onClick: () => t(!0),
-					children: l.t("common:undo", { lng: s })
-				}),
-				/* @__PURE__ */ i(u, {
-					onClick: () => r(!0),
-					children: l.t("graphing.redo", { lng: s })
-				}),
-				/* @__PURE__ */ i(u, {
-					onClick: () => o(),
-					children: l.t("graphing.reset", { lng: s })
-				})
-			]
-		});
-	}
-};
-//#endregion
-export { d as default };

package/dist/use-debounce.d.ts

@@ -1,9 +0,0 @@
-/**
- * @synced-from pie-lib/packages/graphing/src/use-debounce.js
- * @auto-generated
- *
- * This file is automatically synced from pie-elements and converted to TypeScript.
- * Manual edits will be overwritten on next sync.
- * To make changes, edit the upstream JavaScript file and run sync again.
- */
-export declare const useDebounce: (value: any, delay: any) => any;

package/dist/use-debounce.js

@@ -1,13 +0,0 @@
-import { useEffect as e, useState as t } from "react";
-//#region src/use-debounce.ts
-var n = (n, r) => {
-	let [i, a] = t(n);
-	return e(() => {
-		let e = setTimeout(() => {
-			a(n);
-		}, r);
-		return () => clearTimeout(e);
-	}, [n]), i;
-};
-//#endregion
-export { n as useDebounce };

package/dist/utils.d.ts

@@ -1,61 +0,0 @@
-/**
- * @synced-from pie-lib/packages/graphing/src/utils.js
- * @auto-generated
- *
- * This file is automatically synced from pie-elements and converted to TypeScript.
- * Manual edits will be overwritten on next sync.
- * To make changes, edit the upstream JavaScript file and run sync again.
- */
-export declare const stripEmptyLabel: (pt: any) => any;
-export declare const tickCount: (min: any, max: any, step: any) => number;
-export declare const bounds: (area: any, domain: any, range: any) => {
-    left: number;
-    right: number;
-    top: number;
-    bottom: number;
-};
-export declare const point: (o: any) => import("@mapbox/point-geometry").default;
-export declare const getAngleDeg: () => number;
-export declare const arrowDimensions: () => number;
-export declare const getTickValues: (prop: any) => number[];
-export declare const countWords: (label: any) => any;
-export declare const findLongestWord: (label: any) => any;
-export declare const amountToIncreaseWidth: (longestWord: any) => number;
-export declare const polygonToArea: (points: any) => any;
-export declare const lineToArea: (from: any, to: any) => {
-    left: number;
-    top: number;
-    bottom: number;
-    right: number;
-};
-export declare const pointsToArea: (a: any, b: any) => {
-    left: number;
-    top: number;
-    bottom: number;
-    right: number;
-};
-export declare const isDomainRangeEqual: (graphProps: any, nextGraphProps: any) => any;
-export declare const getRightestPoints: (points: any) => {
-    a: any;
-    b: any;
-};
-export declare const getMiddleOfTwoPoints: (a: any, b: any) => {
-    x: number;
-    y: number;
-};
-export declare const roundNumber: (number: any) => number;
-export declare const sameAxes: (p1: any, p2: any) => any;
-export declare const equalPoints: (p1: any, p2: any) => any;
-export declare const thinnerShapesNeeded: (graphProps: any) => boolean;
-export declare const getAdjustedGraphLimits: (graphProps: any) => {
-    domain: {
-        min: number;
-        max: any;
-    };
-    range: {
-        min: number;
-        max: any;
-    };
-};
-export declare const getDistanceBetweenTwoPoints: (a: any, b: any) => number;
-export declare const isDuplicatedMark: (mark: any, marks: any, oldMark: any) => boolean;

package/dist/utils.js

@@ -1,75 +0,0 @@
-import { __toESM as e } from "./_virtual/_rolldown/runtime.js";
-import { require_browser as t } from "./node_modules/.bun/invariant@2.2.4/node_modules/invariant/browser.js";
-import { cloneDeep as n, head as r, isEmpty as i, isEqual as a, omit as o, tail as s } from "lodash-es";
-import { utils as c } from "@pie-lib/plot";
-//#region src/utils.ts
-var l = /* @__PURE__ */ e(t(), 1), u = (e) => e?.label === "" ? o(e, "label") : e;
-c.tickCount;
-var d = c.bounds, f = c.point, p = () => 0, m = () => 0, h = (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) : [];
-}, g = (e) => e == null || i(e) ? 1 : e.split(" ").length, _ = (e) => (e || "").replace(/<[^>]+>/g, "").split(" ").sort((e, t) => t.length - e.length)[0].length, v = (e) => e ? e * 10 : 0, y = (e) => {
-	let t = r(e), n = {
-		left: t.x,
-		top: t.y,
-		bottom: t.y,
-		right: t.x
-	};
-	return s(e).reduce((e, t) => (e.left = Math.min(e.left, t.x), e.top = Math.max(e.top, t.y), e.bottom = Math.min(e.bottom, t.y), e.right = Math.max(e.right, t.x), e), n);
-}, b = (e, t) => x(e, t), x = (e, t) => ((0, l.default)(!!e && !!t, "a or b is undefined"), {
-	left: Math.min(e.x, t.x),
-	top: Math.max(e.y, t.y),
-	bottom: Math.min(e.y, t.y),
-	right: Math.max(e.x, t.x)
-}), S = (e) => {
-	let t = n(e);
-	return t.sort((e, t) => t.x - e.x), {
-		a: t[0],
-		b: t[1]
-	};
-}, C = (e, t) => ({
-	x: (e.x + t.x) / 2,
-	y: (e.y + t.y) / 2
-}), w = (e) => parseFloat(e.toFixed(4)), T = (e, t) => e && t && (w(e.x) === w(t.x) || w(e.y) === w(t.y)), E = (e, t) => e && t && a({
-	x: w(e.x),
-	y: w(e.y)
-}, {
-	x: w(t.x),
-	y: w(t.y)
-}), D = (e, t) => {
-	let { min: n, max: r, step: i } = e;
-	return t / ((r - n) / i);
-}, O = (e) => {
-	let { domain: t, range: n, size: { width: r, height: i } } = e;
-	return D(t, r) < 14 || D(n, i) < 14;
-}, k = (e) => {
-	let { domain: t, range: n, size: { width: r, height: i } } = e, a = D(t, r), o = D(n, i), s = t.step / (a / 15), c = n.step / (o / 15);
-	return {
-		domain: {
-			min: t.min - s,
-			max: t.max + s
-		},
-		range: {
-			min: n.min - c,
-			max: n.max + c
-		}
-	};
-}, A = (e, t) => Math.sqrt((t.x - e.x) * (t.x - e.x) + (t.y - e.y) * (t.y - e.y)), j = (e) => (e || []).sort((e, t) => e.x - t.x || e.y - t.y), M = (e, t, n) => (e.x - t.x) * (n.y - t.y) === (n.x - t.x) * (e.y - t.y), N = (e, t) => M(e.from, t.from, t.to) && M(e.to, t.from, t.to), P = (e, t) => E(e.root, t.root) && A(t.root, t.edge) === A(e.root, e.edge), F = (e, t, r) => {
-	let { type: i, building: o } = e;
-	if (o) return !1;
-	let s = (t || []).filter((e) => e.type === i && !e.building), c = s.findIndex((e) => a(e, r));
-	return c !== -1 && s.splice(c, 1), !!s.find((t) => {
-		if (i === "circle" || i === "parabola" || i === "sine" || i === "absolute" || i === "exponential") {
-			let { root: n, edge: r } = e;
-			return E(n, t.root) && E(r, t.edge) || i === "circle" && P(t, e);
-		} else if (i === "line" || i === "ray" || i === "segment" || i === "vector") {
-			let { from: n, to: r } = e;
-			return E(n, t.from) && E(r, t.to) || E(n, t.to) && E(r, t.from) || i === "line" && N(t, e);
-		} else if (i === "polygon") return a(j(n(e.points)), j(n(t.points)));
-		else if (i === "point") return E(t, e);
-	});
-};
-//#endregion
-export { v as amountToIncreaseWidth, m as arrowDimensions, d as bounds, g as countWords, E as equalPoints, _ as findLongestWord, k as getAdjustedGraphLimits, p as getAngleDeg, A as getDistanceBetweenTwoPoints, C as getMiddleOfTwoPoints, S as getRightestPoints, h as getTickValues, F as isDuplicatedMark, b as lineToArea, f as point, y as polygonToArea, w as roundNumber, T as sameAxes, u as stripEmptyLabel, O as thinnerShapesNeeded };