@tldraw/editor 3.16.0-internal.a478398270c6 → 3.16.0-internal.f8b97f0c414f

package/dist-esm/lib/utils/nearestMultiple.mjs

@@ -1,14 +0,0 @@
-function gcd(a, b) {
-  return b === 0 ? a : gcd(b, a % b);
-}
-function nearestMultiple(float) {
-  const decimal = float.toString().split(".")[1];
-  if (!decimal) return 1;
-  const denominator = Math.pow(10, decimal.length);
-  const numerator = parseInt(decimal, 10);
-  return denominator / gcd(numerator, denominator);
-}
-export {
-  nearestMultiple
-};
-//# sourceMappingURL=nearestMultiple.mjs.map

package/dist-esm/lib/utils/nearestMultiple.mjs.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../src/lib/utils/nearestMultiple.ts"],
-  "sourcesContent": ["// Euclidean algorithm to find the GCD\nfunction gcd(a: number, b: number): number {\n\treturn b === 0 ? a : gcd(b, a % b)\n}\n\n// Returns the lowest value that the given number can be multiplied by to reach an integer\nexport function nearestMultiple(float: number) {\n\tconst decimal = float.toString().split('.')[1]\n\tif (!decimal) return 1\n\tconst denominator = Math.pow(10, decimal.length)\n\tconst numerator = parseInt(decimal, 10)\n\treturn denominator / gcd(numerator, denominator)\n}\n"],
-  "mappings": "AACA,SAAS,IAAI,GAAW,GAAmB;AAC1C,SAAO,MAAM,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC;AAClC;AAGO,SAAS,gBAAgB,OAAe;AAC9C,QAAM,UAAU,MAAM,SAAS,EAAE,MAAM,GAAG,EAAE,CAAC;AAC7C,MAAI,CAAC,QAAS,QAAO;AACrB,QAAM,cAAc,KAAK,IAAI,IAAI,QAAQ,MAAM;AAC/C,QAAM,YAAY,SAAS,SAAS,EAAE;AACtC,SAAO,cAAc,IAAI,WAAW,WAAW;AAChD;",
-  "names": []
-}

package/src/lib/test/currentToolIdMask.test.ts

@@ -1,49 +0,0 @@
-import { describe } from 'node:test'
-import { createTLStore } from '../config/createTLStore'
-import { Editor } from '../editor/Editor'
-import { StateNode } from '../editor/tools/StateNode'
-
-let editor: Editor
-
-class A extends StateNode {
-	static override id = 'A'
-}
-
-class B extends StateNode {
-	static override id = 'B'
-}
-
-class C extends StateNode {
-	static override id = 'C'
-
-	override onEnter() {
-		this.setCurrentToolIdMask('A')
-	}
-}
-
-beforeEach(() => {
-	editor = new Editor({
-		initialState: 'A',
-		shapeUtils: [],
-		bindingUtils: [],
-		tools: [A, B, C],
-		store: createTLStore({ shapeUtils: [], bindingUtils: [] }),
-		getContainer: () => document.body,
-	})
-})
-
-describe('current tool id mask', () => {
-	it('starts with the correct tool id', () => {
-		expect(editor.getCurrentToolId()).toBe('A')
-	})
-
-	it('updates the current tool id', () => {
-		editor.setCurrentTool('B')
-		expect(editor.getCurrentToolId()).toBe('B')
-	})
-
-	it('masks the current tool id', () => {
-		editor.setCurrentTool('C')
-		expect(editor.getCurrentToolId()).toBe('A')
-	})
-})

package/src/lib/utils/nearestMultiple.ts

@@ -1,13 +0,0 @@
-// Euclidean algorithm to find the GCD
-function gcd(a: number, b: number): number {
-	return b === 0 ? a : gcd(b, a % b)
-}
-
-// Returns the lowest value that the given number can be multiplied by to reach an integer
-export function nearestMultiple(float: number) {
-	const decimal = float.toString().split('.')[1]
-	if (!decimal) return 1
-	const denominator = Math.pow(10, decimal.length)
-	const numerator = parseInt(decimal, 10)
-	return denominator / gcd(numerator, denominator)
-}