@ts-charts/quadtree 0.1.0

package/LICENSE.md

@@ -0,0 +1,21 @@
+# MIT License
+
+Copyright (c) 2024 Open Web Foundation
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,153 @@
+<p align="center"><img src=".github/art/cover.jpg" alt="Social Card of this repo"></p>
+
+[![npm version][npm-version-src]][npm-version-href]
+[![GitHub Actions][github-actions-src]][github-actions-href]
+[![Commitizen friendly][commitizen-src]][commitizen-href]
+<!-- [![npm downloads][npm-downloads-src]][npm-downloads-href] -->
+<!-- [![Codecov][codecov-src]][codecov-href] -->
+
+# ts-charts
+
+> A complete TypeScript rewrite of D3.js — fully typed, zero dependencies, Bun-first.
+
+All 30 D3.js packages, rewritten from the ground up in TypeScript with `isolatedDeclarations` support. Ships as a single umbrella package or 30+ individually installable sub-packages.
+
+## Features
+
+- 🔷 **Fully Typed** — strict TypeScript with `isolatedDeclarations: true`, no `any` leaks
+- 📦 **Zero Dependencies** — no external runtime dependencies, everything inlined
+- ⚡ **Bun-First** — optimized for Bun, works in all modern browsers
+- 🌳 **Tree-Shakeable** — ESM-only, import only what you need
+- 🧪 **3,500+ Tests** — comprehensive test suite ported from D3, all passing
+- 🎯 **D3 API Compatible** — drop-in replacement for D3.js
+
+## Install
+
+```bash
+# install the umbrella package (everything)
+bun add ts-charts
+
+# or install individual packages
+bun add @ts-charts/scale
+bun add @ts-charts/selection
+bun add @ts-charts/shape
+```
+
+## Usage
+
+```ts
+// import everything
+import { scaleLinear, line, select } from 'ts-charts'
+
+// or import from individual packages
+import { scaleLinear } from '@ts-charts/scale'
+import { line } from '@ts-charts/shape'
+import { select } from '@ts-charts/selection'
+
+// create a linear scale
+const x = scaleLinear()
+  .domain([0, 100])
+  .range([0, 960])
+
+// create a line generator
+const myLine = line()
+  .x((d: [number, number]) => x(d[0]))
+  .y((d: [number, number]) => d[1])
+```
+
+## Packages
+
+| Package | Description |
+|---------|-------------|
+| `@ts-charts/array` | Array manipulation, statistics, histograms, bisection |
+| `@ts-charts/axis` | SVG axis generators for scales |
+| `@ts-charts/brush` | 1D and 2D brush selections |
+| `@ts-charts/chord` | Chord diagram layout and ribbon generator |
+| `@ts-charts/color` | Color spaces: RGB, HSL, Lab, HCL, Cubehelix |
+| `@ts-charts/contour` | Contour polygons and density estimation |
+| `@ts-charts/delaunay` | Delaunay triangulation and Voronoi diagrams |
+| `@ts-charts/dispatch` | Named event dispatching |
+| `@ts-charts/drag` | Drag-and-drop interaction |
+| `@ts-charts/dsv` | CSV and TSV parsing and formatting |
+| `@ts-charts/ease` | Easing functions for transitions |
+| `@ts-charts/fetch` | Convenience wrappers for the Fetch API |
+| `@ts-charts/force` | Force-directed graph layout |
+| `@ts-charts/format` | Number formatting (SI, fixed, currency, etc.) |
+| `@ts-charts/geo` | Geographic projections and path generators |
+| `@ts-charts/hierarchy` | Tree, treemap, pack, and partition layouts |
+| `@ts-charts/interpolate` | Value interpolation for animations |
+| `@ts-charts/path` | SVG path serialization |
+| `@ts-charts/polygon` | Polygon area, centroid, convex hull |
+| `@ts-charts/quadtree` | 2D spatial indexing |
+| `@ts-charts/random` | Random number generators for various distributions |
+| `@ts-charts/scale` | Scales: linear, log, ordinal, time, etc. |
+| `@ts-charts/scale-chromatic` | Color schemes: sequential, diverging, categorical |
+| `@ts-charts/selection` | DOM selection and manipulation |
+| `@ts-charts/shape` | Shape generators: line, area, arc, pie, stack |
+| `@ts-charts/time` | Time intervals and rounding |
+| `@ts-charts/time-format` | Date/time parsing and formatting |
+| `@ts-charts/timer` | Efficient animation scheduling via `requestAnimationFrame` |
+| `@ts-charts/transition` | Animated transitions on selections |
+| `@ts-charts/zoom` | Pan and zoom interaction |
+
+## Testing
+
+```bash
+bun test
+```
+
+## Changelog
+
+Please see our [releases][releases-href] page for more information on what has changed recently.
+
+## Contributing
+
+Please see [CONTRIBUTING][contributing-href] for details.
+
+## Community
+
+For help, discussion about best practices, or any other conversation that would benefit from being searchable:
+
+[Discussions on GitHub][discussions-href]
+
+For casual chit-chat with others using this package:
+
+[Join the Stacks Discord Server][discord-href]
+
+## Postcardware
+
+"Software that is free, but hopes for a postcard." We love receiving postcards from around the world showing where Stacks is being used! We showcase them on our website too.
+
+Our address: Stacks.js, 12665 Village Ln #2306, Playa Vista, CA 90094, United States 🌎
+
+## Sponsors
+
+We would like to extend our thanks to the following sponsors for funding Stacks development. If you are interested in becoming a sponsor, please reach out to us.
+
+- [JetBrains][jetbrains-href]
+- [The Solana Foundation][solana-href]
+
+## License
+
+The MIT License (MIT). Please see [LICENSE][license-href] for more information.
+
+Made with 💙
+
+<!-- Badges -->
+[npm-version-src]: https://img.shields.io/npm/v/ts-charts?style=flat-square
+[npm-version-href]: https://npmjs.com/package/ts-charts
+[github-actions-src]: https://img.shields.io/github/actions/workflow/status/stacksjs/ts-charts/ci.yml?style=flat-square&branch=main
+[github-actions-href]: https://github.com/stacksjs/ts-charts/actions?query=workflow%3Aci
+
+[commitizen-src]: https://img.shields.io/badge/commitizen-friendly-brightgreen.svg
+[commitizen-href]: http://commitizen.github.io/cz-cli/
+[releases-href]: https://github.com/stacksjs/ts-charts/releases
+[contributing-href]: .github/CONTRIBUTING.md
+[discussions-href]: https://github.com/stacksjs/ts-charts/discussions
+[discord-href]: https://discord.gg/stacksjs
+[jetbrains-href]: https://www.jetbrains.com/
+[solana-href]: https://solana.com/
+[license-href]: LICENSE.md
+
+<!-- [codecov-src]: https://img.shields.io/codecov/c/gh/stacksjs/ts-charts/main?style=flat-square
+[codecov-href]: https://codecov.io/gh/stacksjs/ts-charts -->

package/dist/index.d.ts

@@ -0,0 +1,2 @@
+export type { Accessor, QuadtreeInternalNode, QuadtreeLeaf, QuadtreeNode, QuadtreeNodeCallback } from './types.ts';
+export { Quadtree, quadtree } from './quadtree.ts';

package/dist/index.js

@@ -0,0 +1 @@
+class W{node;x0;y0;x1;y1;constructor(L,E,D,B,F){this.node=L,this.x0=E,this.y0=D,this.x1=B,this.y1=F}}function v(L){return L[0]}function A(L){return L[1]}function k(L){let E={data:L.data},D=E,B=L.next;while(B)D=D.next={data:B.data},B=B.next;return E}function X(L){return Array.isArray(L)}class Y{_x;_y;_x0;_y0;_x1;_y1;_root;constructor(L,E,D,B,F,G){this._x=L??v,this._y=E??A,this._x0=D??NaN,this._y0=B??NaN,this._x1=F??NaN,this._y1=G??NaN,this._root=void 0}copy(){let L=new Y(this._x,this._y,this._x0,this._y0,this._x1,this._y1),E=this._root;if(!E)return L;if(!X(E))return L._root=k(E),L;let D=[],B=[,,,,];L._root=B,D.push({source:E,target:B});let F;while(F=D.pop())for(let G=0;G<4;++G){let H=F.source[G];if(H)if(X(H)){let J=[,,,,];F.target[G]=J,D.push({source:H,target:J})}else F.target[G]=k(H)}return L}add(L){let E=+this._x.call(null,L),D=+this._y.call(null,L);return w(this.cover(E,D),E,D,L),this}addAll(L){let E;if(!Array.isArray(L))E=Array.from(L);else E=L;let D=E.length,B=new Float64Array(D),F=new Float64Array(D),G=1/0,H=1/0,J=-1/0,M=-1/0;for(let K=0;K<D;++K){let R=E[K],P=+this._x.call(null,R),O=+this._y.call(null,R);if(isNaN(P)||isNaN(O))continue;if(B[K]=P,F[K]=O,P<G)G=P;if(P>J)J=P;if(O<H)H=O;if(O>M)M=O}if(G>J||H>M)return this;this.cover(G,H).cover(J,M);for(let K=0;K<D;++K)w(this,B[K],F[K],E[K]);return this}cover(L,E){if(isNaN(L=+L)||isNaN(E=+E))return this;let D=this._x0,B=this._y0,F=this._x1,G=this._y1;if(isNaN(D))F=(D=Math.floor(L))+1,G=(B=Math.floor(E))+1;else{let H=F-D||1,J=this._root,M,K;while(D>L||L>=F||B>E||E>=G)switch(K=(E<B)<<1|L<D,M=[,,,,],M[K]=J,J=M,H*=2,K){case 0:F=D+H,G=B+H;break;case 1:D=F-H,G=B+H;break;case 2:F=D+H,B=G-H;break;case 3:D=F-H,B=G-H;break}if(this._root&&X(this._root))this._root=J}return this._x0=D,this._y0=B,this._x1=F,this._y1=G,this}data(){let L=[];return this.visit((E)=>{if(!X(E)){let D=E;do L.push(D.data),D=D.next;while(D)}}),L}extent(L){if(L!==void 0)return this.cover(+L[0][0],+L[0][1]).cover(+L[1][0],+L[1][1]);return isNaN(this._x0)?void 0:[[this._x0,this._y0],[this._x1,this._y1]]}find(L,E,D){let B,F=this._x0,G=this._y0,H,J,M,K,R=this._x1,P=this._y1,O=[],V=this._root,Z,_;if(V)O.push(new W(V,F,G,R,P));if(D==null)D=1/0;else F=L-D,G=E-D,R=L+D,P=E+D,D*=D;while(Z=O.pop()){if(!(V=Z.node)||(H=Z.x0)>R||(J=Z.y0)>P||(M=Z.x1)<F||(K=Z.y1)<G)continue;if(X(V)){let S=(H+M)/2,U=(J+K)/2;if(O.push(new W(V[3],S,U,M,K),new W(V[2],H,U,S,K),new W(V[1],S,J,M,U),new W(V[0],H,J,S,U)),_=(E>=U)<<1|L>=S)Z=O[O.length-1],O[O.length-1]=O[O.length-1-_],O[O.length-1-_]=Z}else{let S=L-+this._x.call(null,V.data),U=E-+this._y.call(null,V.data),$=S*S+U*U;if($<D){let T=Math.sqrt(D=$);F=L-T,G=E-T,R=L+T,P=E+T,B=V.data}}}return B}remove(L){let E=+this._x.call(null,L),D=+this._y.call(null,L);if(isNaN(E)||isNaN(D))return this;let B,F=this._root,G,H,J,M=this._x0,K=this._y0,R=this._x1,P=this._y1,O,V,Z,_,S=0,U=0;if(!F)return this;if(X(F))while(!0){if(Z=E>=(O=(M+R)/2),Z)M=O;else R=O;if(_=D>=(V=(K+P)/2),_)K=V;else P=V;if(S=_<<1|Z,B=F,F=F[S],!F)return this;if(!X(F))break;if(B[S+1&3]||B[S+2&3]||B[S+3&3])G=B,U=S}let $=F;while($.data!==L)if(H=$,$=$.next,!$)return this;if(J=$.next,J)delete $.next;if(H){if(J)H.next=J;else delete H.next;return this}if(!B)return this._root=J,this;if(J)B[S]=J;else delete B[S];let T=B[0]||B[1]||B[2]||B[3];if(T&&T===(B[3]||B[2]||B[1]||B[0])&&!X(T))if(G)G[U]=T;else this._root=T;return this}removeAll(L){for(let E of L)this.remove(E);return this}root(){return this._root}size(){let L=0;return this.visit((E)=>{if(!X(E)){let D=E;do++L,D=D.next;while(D)}}),L}visit(L){let E=[],D,B=this._root,F,G,H,J,M;if(B)E.push(new W(B,this._x0,this._y0,this._x1,this._y1));while(D=E.pop())if(!L(B=D.node,G=D.x0,H=D.y0,J=D.x1,M=D.y1)&&X(B)){let K=(G+J)/2,R=(H+M)/2;if(F=B[3])E.push(new W(F,K,R,J,M));if(F=B[2])E.push(new W(F,G,R,K,M));if(F=B[1])E.push(new W(F,K,H,J,R));if(F=B[0])E.push(new W(F,G,H,K,R))}return this}visitAfter(L){let E=[],D=[],B;if(this._root)E.push(new W(this._root,this._x0,this._y0,this._x1,this._y1));while(B=E.pop()){let F=B.node;if(X(F)){let G,H=B.x0,J=B.y0,M=B.x1,K=B.y1,R=(H+M)/2,P=(J+K)/2;if(G=F[0])E.push(new W(G,H,J,R,P));if(G=F[1])E.push(new W(G,R,J,M,P));if(G=F[2])E.push(new W(G,H,P,R,K));if(G=F[3])E.push(new W(G,R,P,M,K))}D.push(B)}while(B=D.pop())L(B.node,B.x0,B.y0,B.x1,B.y1);return this}x(L){if(L!==void 0)return this._x=L,this;return this._x}y(L){if(L!==void 0)return this._y=L,this;return this._y}}function w(L,E,D,B){if(isNaN(E)||isNaN(D))return L;let F,G=L._root,H={data:B},J=L._x0,M=L._y0,K=L._x1,R=L._y1,P,O,V,Z,_,S,U=0,$;if(!G)return L._root=H,L;while(X(G)){if(_=E>=(P=(J+K)/2),_)J=P;else K=P;if(S=D>=(O=(M+R)/2),S)M=O;else R=O;if(U=S<<1|_,F=G,G=G[U],!G)return F[U]=H,L}if(V=+L._x.call(null,G.data),Z=+L._y.call(null,G.data),E===V&&D===Z){if(H.next=G,F)F[U]=H;else L._root=H;return L}do{let T=[,,,,];if(F)F[U]=T;else L._root=T;if(F=T,_=E>=(P=(J+K)/2),_)J=P;else K=P;if(S=D>=(O=(M+R)/2),S)M=O;else R=O;U=S<<1|_,$=(Z>=O)<<1|V>=P}while(U===$);return F[$]=G,F[U]=H,L}function b(L,E,D){let B=new Y(E??void 0,D??void 0,NaN,NaN,NaN,NaN);return L==null?B:B.addAll(L)}export{b as quadtree,Y as Quadtree};

package/dist/quad.d.ts

@@ -0,0 +1,9 @@
+import type { QuadtreeNode } from './types.ts';
+export declare class Quad<T> {
+  node: QuadtreeNode<T> | undefined;
+  x0: number;
+  y0: number;
+  x1: number;
+  y1: number;
+  constructor(node: QuadtreeNode<T> | undefined, x0: number, y0: number, x1: number, y1: number);
+}

package/dist/quadtree.d.ts

@@ -0,0 +1,33 @@
+import type { Accessor, QuadtreeNode, QuadtreeNodeCallback } from './types.ts';
+export declare function quadtree<T = [number, number]>(nodes?: Iterable<T> | null, x?: Accessor<T>, y?: Accessor<T>): Quadtree<T>;
+export declare class Quadtree<T = [number, number]> {
+  _x: Accessor<T>;
+  _y: Accessor<T>;
+  _x0: number;
+  _y0: number;
+  _x1: number;
+  _y1: number;
+  _root: QuadtreeNode<T> | undefined;
+  constructor(x?: Accessor<T>, y?: Accessor<T>, x0?: number, y0?: number, x1?: number, y1?: number);
+  copy(): Quadtree<T>;
+  add(d: T): this;
+  addAll(data: Iterable<T>): this;
+  cover(x: number, y: number): this;
+  data(): T[];
+  extent(): [[number, number], [number, number]] | undefined;
+  extent(extent: [[number, number], [number, number]]): this;
+  extent(extent?: [[number, number], [number, number]]): [[number, number], [number, number]] | undefined | this;
+  find(x: number, y: number, radius?: number | null): T | undefined;
+  remove(d: T): this;
+  removeAll(data: Iterable<T>): this;
+  root(): QuadtreeNode<T> | undefined;
+  size(): number;
+  visit(callback: QuadtreeNodeCallback<T>): this;
+  visitAfter(callback: QuadtreeNodeCallback<T>): this;
+  x(): Accessor<T>;
+  x(x: Accessor<T>): this;
+  x(x?: Accessor<T>): Accessor<T> | this;
+  y(): Accessor<T>;
+  y(y: Accessor<T>): this;
+  y(y?: Accessor<T>): Accessor<T> | this;
+}

package/dist/types.d.ts

@@ -0,0 +1,21 @@
+export declare interface QuadtreeLeaf<T> {
+  data: T
+  next?: QuadtreeLeaf<T>
+}
+export type QuadtreeInternalNode<T> = [
+  // eslint-disable-next-line pickier/no-unused-vars
+  QuadtreeNode<T> | undefined,
+  QuadtreeNode<T> | undefined,
+  QuadtreeNode<T> | undefined,
+  QuadtreeNode<T> | undefined,
+] & { length: 4 }
+export type QuadtreeNode<T> = QuadtreeLeaf<T> | QuadtreeInternalNode<T>
+export type QuadtreeNodeCallback<T> = (
+  node: QuadtreeNode<T>,
+  x0: number,
+  y0: number,
+  x1: number,
+  y1: number,
+) => boolean | void
+// eslint-disable-next-line pickier/no-unused-vars
+export type Accessor<T> = (d: T) => number

package/package.json

@@ -0,0 +1,22 @@
+{
+  "name": "@ts-charts/quadtree",
+  "version": "0.1.0",
+  "type": "module",
+  "description": "Two-dimensional recursive spatial subdivision.",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./src/index.ts"
+    }
+  },
+  "module": "./src/index.ts",
+  "types": "./dist/index.d.ts",
+  "files": [
+    "dist"
+  ],
+  "scripts": {
+    "build": "bun --bun build.ts",
+    "prepublishOnly": "bun --bun run build",
+    "test": "bun test"
+  }
+}