rbush-rs 0.1.0 → 1.0.0

package/Cargo.lock

@@ -0,0 +1,125 @@
+# This file is automatically @generated by Cargo.
+# It is not intended for manual editing.
+version = 4
+
+[[package]]
+name = "bumpalo"
+version = "3.19.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5dd9dc738b7a8311c7ade152424974d8115f2cdad61e8dab8dac9f2362298510"
+
+[[package]]
+name = "cfg-if"
+version = "1.0.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9330f8b2ff13f34540b44e946ef35111825727b38d33286ef986142615121801"
+
+[[package]]
+name = "js-sys"
+version = "0.3.85"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8c942ebf8e95485ca0d52d97da7c5a2c387d0e7f0ba4c35e93bfcaee045955b3"
+dependencies = [
+ "once_cell",
+ "wasm-bindgen",
+]
+
+[[package]]
+name = "once_cell"
+version = "1.21.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "42f5e15c9953c5e4ccceeb2e7382a716482c34515315f7b03532b8b4e8393d2d"
+
+[[package]]
+name = "proc-macro2"
+version = "1.0.105"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "535d180e0ecab6268a3e718bb9fd44db66bbbc256257165fc699dadf70d16fe7"
+dependencies = [
+ "unicode-ident",
+]
+
+[[package]]
+name = "quote"
+version = "1.0.43"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dc74d9a594b72ae6656596548f56f667211f8a97b3d4c3d467150794690dc40a"
+dependencies = [
+ "proc-macro2",
+]
+
+[[package]]
+name = "rbush-rs"
+version = "0.1.0"
+dependencies = [
+ "js-sys",
+ "wasm-bindgen",
+]
+
+[[package]]
+name = "rustversion"
+version = "1.0.22"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b39cdef0fa800fc44525c84ccb54a029961a8215f9619753635a9c0d2538d46d"
+
+[[package]]
+name = "syn"
+version = "2.0.114"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d4d107df263a3013ef9b1879b0df87d706ff80f65a86ea879bd9c31f9b307c2a"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "unicode-ident",
+]
+
+[[package]]
+name = "unicode-ident"
+version = "1.0.22"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9312f7c4f6ff9069b165498234ce8be658059c6728633667c526e27dc2cf1df5"
+
+[[package]]
+name = "wasm-bindgen"
+version = "0.2.108"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "64024a30ec1e37399cf85a7ffefebdb72205ca1c972291c51512360d90bd8566"
+dependencies = [
+ "cfg-if",
+ "once_cell",
+ "rustversion",
+ "wasm-bindgen-macro",
+ "wasm-bindgen-shared",
+]
+
+[[package]]
+name = "wasm-bindgen-macro"
+version = "0.2.108"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "008b239d9c740232e71bd39e8ef6429d27097518b6b30bdf9086833bd5b6d608"
+dependencies = [
+ "quote",
+ "wasm-bindgen-macro-support",
+]
+
+[[package]]
+name = "wasm-bindgen-macro-support"
+version = "0.2.108"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5256bae2d58f54820e6490f9839c49780dff84c65aeab9e772f15d5f0e913a55"
+dependencies = [
+ "bumpalo",
+ "proc-macro2",
+ "quote",
+ "syn",
+ "wasm-bindgen-shared",
+]
+
+[[package]]
+name = "wasm-bindgen-shared"
+version = "0.2.108"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1f01b580c9ac74c8d8f0c0e4afb04eeef2acf145458e52c03845ee9cd23e3d12"
+dependencies = [
+ "unicode-ident",
+]

package/Cargo.toml

@@ -0,0 +1,15 @@
+[package]
+name = "rbush-rs"
+version = "0.1.0"
+authors = ["Preetham <ppmpreetham1@gmail.com>"]
+description = "High-performance RBush port in WebAssembly"
+repository = "https://github.com/ppmpreetham/rbush-rs"
+license = "MIT"
+edition = "2024"
+
+[lib]
+crate-type = ["cdylib"]
+
+[dependencies]
+js-sys = "0.3.85"
+wasm-bindgen = "0.2.108"

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Preetham Pemmasani
+
+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/package.json

@@ -1,15 +1,25 @@
 {
   "name": "rbush-rs",
-  "type": "module",
-  "version": "0.1.0",
-  "files": [
-    "rbush_rs_bg.wasm",
-    "rbush_rs.js",
-    "rbush_rs.d.ts"
-  ],
-  "main": "rbush_rs.js",
-  "types": "rbush_rs.d.ts",
-  "sideEffects": [
-    "./snippets/*"
-  ]
-}
+  "version": "1.0.0",
+  "description": "",
+  "main": "index.js",
+  "scripts": {
+    "test": "jest"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/ppmpreetham/rbush-rs.git"
+  },
+  "keywords": [],
+  "author": "",
+  "license": "ISC",
+  "type": "commonjs",
+  "bugs": {
+    "url": "https://github.com/ppmpreetham/rbush-rs/issues"
+  },
+  "homepage": "https://github.com/ppmpreetham/rbush-rs#readme",
+  "devDependencies": {
+    "jest": "^30.2.0",
+    "rbush": "^3.0.1"
+  }
+}

package/rbush.test.js

@@ -0,0 +1,168 @@
+const RBushJS = require("rbush")
+const { RBush: RBushWasm } = require("./pkg/rbush_rs")
+
+describe("RBush Comprehensive Benchmark", () => {
+  function generateData(count) {
+    const data = []
+    const flatData = new Float64Array(count * 4)
+    for (let i = 0; i < count; i++) {
+      const minX = Math.random() * 1000
+      const minY = Math.random() * 1000
+      const maxX = minX + Math.random() * 20
+      const maxY = minY + Math.random() * 20
+
+      data.push({ minX, minY, maxX, maxY, id: i })
+
+      flatData[i * 4] = minX
+      flatData[i * 4 + 1] = minY
+      flatData[i * 4 + 2] = maxX
+      flatData[i * 4 + 3] = maxY
+    }
+    return { data, flatData }
+  }
+
+  const DATA_SIZE = 10000
+  const { data: testData, flatData: testDataFlat } = generateData(DATA_SIZE)
+  const searchBox = { minX: 400, minY: 400, maxX: 600, maxY: 600 }
+  const itemsToRemove = testData.slice(0, 1000)
+
+  function benchmark(name, fn, iterations = 100) {
+    const start = performance.now()
+    for (let i = 0; i < iterations; i++) {
+      fn()
+    }
+    const end = performance.now()
+    const avg = (end - start) / iterations
+    console.log(`${name.padEnd(30)}: ${avg.toFixed(3)} ms`)
+  }
+
+  console.log(`\nBENCHMARK RESULTS (N=${DATA_SIZE})`)
+
+  test("Benchmark: Bulk Load", () => {
+    console.log("\n Bulk Load ")
+    benchmark(
+      "JS RBush",
+      () => {
+        const tree = new RBushJS(9)
+        tree.load(testData)
+      },
+      10
+    )
+
+    benchmark(
+      "WASM RBush (Hybrid)",
+      () => {
+        const tree = new RBushWasm(9)
+        tree.loadHybrid(testDataFlat, testData)
+      },
+      10
+    )
+  })
+
+  test("Benchmark: Insert (One by One)", () => {
+    console.log("\n Insert (1000 items) ")
+
+    const smallSet = testData.slice(0, 1000)
+
+    benchmark(
+      "JS RBush",
+      () => {
+        const tree = new RBushJS(9)
+        for (const item of smallSet) tree.insert(item)
+      },
+      20
+    )
+
+    benchmark(
+      "WASM RBush",
+      () => {
+        const tree = new RBushWasm(9)
+        for (const item of smallSet) tree.insert(item)
+      },
+      20
+    )
+  })
+
+  test("Benchmark: Search", () => {
+    console.log("\n Search ")
+    const jsTree = new RBushJS(9)
+    jsTree.load(testData)
+
+    const wasmTree = new RBushWasm(9)
+    wasmTree.loadHybrid(testDataFlat, testData)
+
+    benchmark("JS RBush", () => {
+      jsTree.search(searchBox)
+    })
+
+    benchmark("WASM RBush", () => {
+      wasmTree.search(searchBox)
+    })
+  })
+
+  test("Benchmark: Collides", () => {
+    console.log("\n Collides ")
+    const jsTree = new RBushJS(9)
+    jsTree.load(testData)
+
+    const wasmTree = new RBushWasm(9)
+    wasmTree.loadHybrid(testDataFlat, testData)
+
+    benchmark("JS RBush", () => {
+      jsTree.collides(searchBox)
+    })
+
+    benchmark("WASM RBush", () => {
+      wasmTree.collides(searchBox)
+    })
+  })
+
+  test("Benchmark: Remove", () => {
+    console.log("\n Remove (1000 items) ")
+
+    benchmark(
+      "JS RBush",
+      () => {
+        const tree = new RBushJS(9)
+        tree.load(testData)
+        for (const item of itemsToRemove) tree.remove(item)
+      },
+      5
+    )
+
+    benchmark(
+      "WASM RBush",
+      () => {
+        const tree = new RBushWasm(9)
+        tree.loadHybrid(testDataFlat, testData)
+        for (const item of itemsToRemove) tree.remove(item)
+      },
+      5
+    )
+  })
+
+  test("Benchmark: Clear", () => {
+    console.log("\n Clear ")
+    const jsTree = new RBushJS(9)
+    jsTree.load(testData)
+
+    const wasmTree = new RBushWasm(9)
+    wasmTree.loadHybrid(testDataFlat, testData)
+
+    benchmark(
+      "JS RBush",
+      () => {
+        jsTree.clear()
+      },
+      1000
+    )
+
+    benchmark(
+      "WASM RBush",
+      () => {
+        wasmTree.clear()
+      },
+      1000
+    )
+  })
+})

package/src/lib.rs

@@ -0,0 +1,667 @@
+use js_sys::{Array, Reflect};
+use wasm_bindgen::prelude::*;
+
+
+
+#[derive(Clone, Copy, Debug, PartialEq)]
+struct Rect {
+    min_x: f64,
+    min_y: f64,
+    max_x: f64,
+    max_y: f64,
+}
+
+impl Rect {
+    fn new_empty() -> Self {
+        Rect {
+            min_x: f64::INFINITY,
+            min_y: f64::INFINITY,
+            max_x: f64::NEG_INFINITY,
+            max_y: f64::NEG_INFINITY,
+        }
+    }
+
+    fn from_js(item: &JsValue) -> Self {
+        fn get_coord(val: &JsValue, prop: &str) -> f64 {
+            match Reflect::get(val, &JsValue::from_str(prop)) {
+                Ok(v) => v.as_f64().unwrap_or(0.0),
+                Err(_) => 0.0,
+            }
+        }
+        Rect {
+            min_x: get_coord(item, "minX"),
+            min_y: get_coord(item, "minY"),
+            max_x: get_coord(item, "maxX"),
+            max_y: get_coord(item, "maxY"),
+        }
+    }
+
+    fn from_flat(data: &[f64]) -> Self {
+        Rect {
+            min_x: data[0],
+            min_y: data[1],
+            max_x: data[2],
+            max_y: data[3],
+        }
+    }
+
+    fn area(&self) -> f64 {
+        (self.max_x - self.min_x) * (self.max_y - self.min_y)
+    }
+
+    fn margin(&self) -> f64 {
+        (self.max_x - self.min_x) + (self.max_y - self.min_y)
+    }
+
+    fn enlarged_area(&self, other: &Rect) -> f64 {
+        (f64::max(other.max_x, self.max_x) - f64::min(other.min_x, self.min_x))
+            * (f64::max(other.max_y, self.max_y) - f64::min(other.min_y, self.min_y))
+    }
+
+    fn intersection_area(&self, other: &Rect) -> f64 {
+        let min_x = f64::max(self.min_x, other.min_x);
+        let min_y = f64::max(self.min_y, other.min_y);
+        let max_x = f64::min(self.max_x, other.max_x);
+        let max_y = f64::min(self.max_y, other.max_y);
+
+        f64::max(0.0, max_x - min_x) * f64::max(0.0, max_y - min_y)
+    }
+
+    fn contains(&self, other: &Rect) -> bool {
+        self.min_x <= other.min_x
+            && self.min_y <= other.min_y
+            && other.max_x <= self.max_x
+            && other.max_y <= self.max_y
+    }
+
+    fn intersects(&self, other: &Rect) -> bool {
+        other.min_x <= self.max_x
+            && other.min_y <= self.max_y
+            && other.max_x >= self.min_x
+            && other.max_y >= self.min_y
+    }
+
+    fn extend(&mut self, other: &Rect) {
+        self.min_x = f64::min(self.min_x, other.min_x);
+        self.min_y = f64::min(self.min_y, other.min_y);
+        self.max_x = f64::max(self.max_x, other.max_x);
+        self.max_y = f64::max(self.max_y, other.max_y);
+    }
+}
+
+
+
+#[derive(Clone)]
+struct Entry {
+    bbox: Rect,
+    data: JsValue,
+    is_leaf: bool,
+    height: usize,
+    children: Vec<Entry>,
+}
+
+impl Entry {
+    fn new_leaf(item: JsValue) -> Self {
+        let bbox = Rect::from_js(&item);
+        Entry {
+            bbox,
+            data: item,
+            is_leaf: true,
+            height: 1,
+            children: vec![],
+        }
+    }
+
+    fn new_node(children: Vec<Entry>) -> Self {
+        let mut node = Entry {
+            bbox: Rect::new_empty(),
+            data: JsValue::NULL,
+            is_leaf: false,
+            height: 1,
+            children,
+        };
+        node.calc_bbox();
+        node
+    }
+
+    fn calc_bbox(&mut self) {
+        let mut dist_bbox = Rect::new_empty();
+        for child in &self.children {
+            dist_bbox.extend(&child.bbox);
+        }
+        self.bbox = dist_bbox;
+    }
+}
+
+
+
+#[wasm_bindgen]
+pub struct RBush {
+    root: Entry,
+    max_entries: usize,
+    min_entries: usize,
+}
+
+#[wasm_bindgen]
+impl RBush {
+    #[wasm_bindgen(constructor)]
+    pub fn new(max_entries: Option<usize>) -> RBush {
+        let m = max_entries.unwrap_or(9).max(4);
+        let min = (m as f64 * 0.4).ceil().max(2.0) as usize;
+
+        RBush {
+            root: Entry::new_node(vec![]),
+            max_entries: m,
+            min_entries: min,
+        }
+    }
+
+    pub fn clear(&mut self) {
+        self.root = Entry::new_node(vec![]);
+    }
+
+    pub fn all(&self) -> Array {
+        let result = Array::new();
+        self._all(&self.root, &result);
+        result
+    }
+
+    pub fn search(&self, bbox_js: &JsValue) -> Array {
+        let bbox = Rect::from_js(bbox_js);
+        let result = Array::new();
+        let mut stack = vec![&self.root];
+
+        while let Some(node) = stack.pop() {
+            if !bbox.intersects(&node.bbox) {
+                continue;
+            }
+
+            for child in &node.children {
+                if bbox.intersects(&child.bbox) {
+                    if child.is_leaf {
+                        
+                        if !child.data.is_null() && !child.data.is_undefined() {
+                            result.push(&child.data);
+                        }
+                    } else if bbox.contains(&child.bbox) {
+                        self._all(child, &result);
+                    } else {
+                        stack.push(child);
+                    }
+                }
+            }
+        }
+        result
+    }
+
+    pub fn collides(&self, bbox_js: &JsValue) -> bool {
+        let bbox = Rect::from_js(bbox_js);
+        let mut stack = vec![&self.root];
+
+        while let Some(node) = stack.pop() {
+            if !bbox.intersects(&node.bbox) {
+                continue;
+            }
+
+            for child in &node.children {
+                if bbox.intersects(&child.bbox) {
+                    if child.is_leaf || bbox.contains(&child.bbox) {
+                        return true;
+                    }
+                    stack.push(child);
+                }
+            }
+        }
+        false
+    }
+
+    #[wasm_bindgen(js_name = insert)]
+    pub fn insert(&mut self, item: JsValue) {
+        
+        if item.is_null() || item.is_undefined() {
+            return;
+        }
+
+        let entry = Entry::new_leaf(item);
+        self.insert_entry(entry);
+    }
+
+    
+    pub fn load(&mut self, data: &Array) {
+        if data.length() == 0 {
+            return;
+        }
+
+        let items: Vec<Entry> = (0..data.length())
+            .filter_map(|i| {
+                let val = data.get(i);
+                if val.is_null() || val.is_undefined() {
+                    return None;
+                }
+                Some(Entry::new_leaf(val))
+            })
+            .collect();
+
+        if !items.is_empty() {
+            self.bulk_load(items);
+        }
+    }
+
+    
+    #[wasm_bindgen(js_name = loadHybrid)]
+    pub fn load_hybrid(&mut self, fast_coords: &[f64], items: &Array) {
+        if fast_coords.is_empty() {
+            return;
+        }
+
+        let count = fast_coords.len() / 4;
+        let mut entries = Vec::with_capacity(count);
+
+        for i in 0..count {
+            let item_data = items.get(i as u32);
+
+            
+            if item_data.is_null() || item_data.is_undefined() {
+                continue;
+            }
+
+            let start = i * 4;
+            let bbox = Rect::from_flat(&fast_coords[start..start + 4]);
+
+            entries.push(Entry {
+                bbox,
+                data: item_data,
+                is_leaf: true,
+                height: 1,
+                children: vec![],
+            });
+        }
+
+        if !entries.is_empty() {
+            self.bulk_load(entries);
+        }
+    }
+
+    pub fn remove(&mut self, item: JsValue) {
+        let bbox = Rect::from_js(&item);
+        let mut items_to_reinsert = Vec::new();
+
+        RBush::remove_from_node(
+            &mut self.root,
+            &item,
+            &bbox,
+            self.min_entries,
+            &mut items_to_reinsert,
+        );
+
+        for item in items_to_reinsert {
+            self.insert_entry(item);
+        }
+
+        if !self.root.is_leaf && self.root.children.len() == 1 {
+            self.root = self.root.children.pop().unwrap();
+        }
+    }
+
+    
+
+    fn remove_from_node(
+        node: &mut Entry,
+        item: &JsValue,
+        bbox: &Rect,
+        min_entries: usize,
+        reinsert: &mut Vec<Entry>,
+    ) -> bool {
+        if node.is_leaf {
+            let mut index = None;
+            for (i, child) in node.children.iter().enumerate() {
+                if &child.data == item {
+                    index = Some(i);
+                    break;
+                }
+            }
+
+            if let Some(idx) = index {
+                node.children.remove(idx);
+                node.calc_bbox();
+                return true;
+            }
+            return false;
+        }
+
+        let mut removed = false;
+        let mut removal_index = None;
+
+        for (i, child) in node.children.iter_mut().enumerate() {
+            if child.bbox.contains(bbox) {
+                if RBush::remove_from_node(child, item, bbox, min_entries, reinsert) {
+                    removed = true;
+                    if child.children.len() < min_entries {
+                        removal_index = Some(i);
+                    } else {
+                        child.calc_bbox();
+                    }
+                    break;
+                }
+            }
+        }
+
+        if let Some(idx) = removal_index {
+            let underflowed_child = node.children.remove(idx);
+            RBush::collect_items(&underflowed_child, reinsert);
+            node.calc_bbox();
+        } else if removed {
+            node.calc_bbox();
+        }
+
+        removed
+    }
+
+    fn collect_items(node: &Entry, acc: &mut Vec<Entry>) {
+        if node.is_leaf {
+            for child in &node.children {
+                acc.push(child.clone());
+            }
+        } else {
+            for child in &node.children {
+                RBush::collect_items(child, acc);
+            }
+        }
+    }
+
+    fn bulk_load(&mut self, mut items: Vec<Entry>) {
+        if items.len() < self.min_entries {
+            for item in items {
+                self.insert_entry(item);
+            }
+            return;
+        }
+
+        let len = items.len();
+        let node = self._build(&mut items, 0, len - 1, 0);
+
+        if self.root.children.is_empty() {
+            self.root = node;
+        } else if self.root.height == node.height {
+            self._split_root(node);
+        } else {
+            if self.root.height < node.height {
+                let tmp = self.root.clone();
+                self.root = node;
+                let level = self.root.height - tmp.height - 1;
+                self._insert_at_level(tmp, level);
+            } else {
+                let level = self.root.height - node.height - 1;
+                self._insert_at_level(node, level);
+            }
+        }
+    }
+
+    fn insert_entry(&mut self, item: Entry) {
+        let level = self.root.height - 1;
+        self._insert_at_level(item, level);
+    }
+
+    fn _insert_at_level(&mut self, item: Entry, level: usize) {
+        let split = RBush::insert_recursive(
+            &mut self.root,
+            item,
+            level,
+            self.max_entries,
+            self.min_entries,
+        );
+        if let Some(new_node) = split {
+            self._split_root(new_node);
+        }
+    }
+
+    fn _split_root(&mut self, new_node: Entry) {
+        let old_root_children = std::mem::take(&mut self.root.children);
+        let mut old_root = Entry::new_node(old_root_children);
+        old_root.height = self.root.height;
+        old_root.calc_bbox();
+
+        self.root.height += 1;
+        self.root.is_leaf = false;
+        self.root.children = vec![old_root, new_node];
+        self.root.calc_bbox();
+    }
+
+    fn _all(&self, node: &Entry, result: &Array) {
+        let mut stack = vec![node];
+        while let Some(n) = stack.pop() {
+            for child in &n.children {
+                if child.is_leaf {
+                    if !child.data.is_null() && !child.data.is_undefined() {
+                        result.push(&child.data);
+                    }
+                } else {
+                    stack.push(child);
+                }
+            }
+        }
+    }
+
+    fn _build(&self, items: &mut [Entry], left: usize, right: usize, height: usize) -> Entry {
+        let n = right - left + 1;
+        let mut m = self.max_entries;
+
+        if n <= m {
+            let children = items[left..=right].to_vec();
+            return Entry::new_node(children);
+        }
+
+        let mut target_height = height;
+        if target_height == 0 {
+            target_height = (n as f64).log(m as f64).ceil() as usize;
+            m = (n as f64 / (m as f64).powi((target_height - 1) as i32)).ceil() as usize;
+        }
+
+        let mut node = Entry::new_node(vec![]);
+        node.height = target_height;
+
+        let n2 = (n as f64 / m as f64).ceil() as usize;
+        let n1 = n2 * (m as f64).sqrt().ceil() as usize;
+
+        RBush::multi_select(items, left, right, n1, true);
+
+        let mut children = vec![];
+        let mut i = left;
+        while i <= right {
+            let right2 = std::cmp::min(i + n1 - 1, right);
+
+            RBush::multi_select(items, i, right2, n2, false);
+
+            let mut j = i;
+            while j <= right2 {
+                let right3 = std::cmp::min(j + n2 - 1, right2);
+                children.push(self._build(items, j, right3, target_height - 1));
+                j += n2;
+            }
+            i += n1;
+        }
+
+        node.children = children;
+        node.calc_bbox();
+        node
+    }
+
+    fn multi_select(arr: &mut [Entry], left: usize, right: usize, n: usize, compare_x: bool) {
+        let mut stack = vec![(left, right)];
+
+        while let Some((l, r)) = stack.pop() {
+            if r - l <= n {
+                continue;
+            }
+
+            let mid = l + ((r - l) as f64 / n as f64 / 2.0).ceil() as usize * n;
+            let target_idx = mid - l;
+            let slice = &mut arr[l..=r];
+
+            if compare_x {
+                slice.select_nth_unstable_by(target_idx, |a, b| {
+                    a.bbox.min_x.partial_cmp(&b.bbox.min_x).unwrap()
+                });
+            } else {
+                slice.select_nth_unstable_by(target_idx, |a, b| {
+                    a.bbox.min_y.partial_cmp(&b.bbox.min_y).unwrap()
+                });
+            }
+
+            stack.push((l, mid));
+            stack.push((mid, r));
+        }
+    }
+
+    fn insert_recursive(
+        node: &mut Entry,
+        item: Entry,
+        target_level: usize,
+        max_entries: usize,
+        min_entries: usize,
+    ) -> Option<Entry> {
+        node.bbox.extend(&item.bbox);
+
+        if node.height - 1 == target_level {
+            node.children.push(item);
+            if node.children.len() > max_entries {
+                return Some(RBush::split(node, min_entries));
+            }
+            return None;
+        }
+
+        let best_index = RBush::choose_subtree(node, &item.bbox);
+
+        let split_node = RBush::insert_recursive(
+            &mut node.children[best_index],
+            item,
+            target_level,
+            max_entries,
+            min_entries,
+        );
+
+        if let Some(new_child) = split_node {
+            node.children.push(new_child);
+            if node.children.len() > max_entries {
+                return Some(RBush::split(node, min_entries));
+            }
+        }
+
+        None
+    }
+
+    fn choose_subtree(node: &Entry, bbox: &Rect) -> usize {
+        let mut best_index = 0;
+        let mut min_enlargement = f64::INFINITY;
+        let mut min_area = f64::INFINITY;
+
+        for (i, child) in node.children.iter().enumerate() {
+            let area = child.bbox.area();
+            let enlargement = bbox.enlarged_area(&child.bbox) - area;
+
+            if enlargement < min_enlargement {
+                min_enlargement = enlargement;
+                min_area = if area < min_area { area } else { min_area };
+                best_index = i;
+            } else if enlargement == min_enlargement {
+                if area < min_area {
+                    min_area = area;
+                    best_index = i;
+                }
+            }
+        }
+        best_index
+    }
+
+    fn split(node: &mut Entry, min_entries: usize) -> Entry {
+        let count = node.children.len();
+
+        RBush::choose_split_axis(node, min_entries, count);
+        let split_index = RBush::choose_split_index(node, min_entries, count);
+
+        let new_children = node.children.split_off(split_index);
+        let mut new_node = Entry::new_node(new_children);
+        new_node.height = node.height;
+
+        node.calc_bbox();
+        new_node.calc_bbox();
+
+        new_node
+    }
+
+    fn choose_split_axis(node: &mut Entry, m: usize, count: usize) {
+        let x_margin = RBush::all_dist_margin(node, m, count, true);
+        let y_margin = RBush::all_dist_margin(node, m, count, false);
+
+        if x_margin < y_margin {
+            node.children
+                .sort_by(|a, b| a.bbox.min_x.partial_cmp(&b.bbox.min_x).unwrap());
+        }
+    }
+
+    fn all_dist_margin(node: &mut Entry, m: usize, count: usize, compare_x: bool) -> f64 {
+        if compare_x {
+            node.children
+                .sort_by(|a, b| a.bbox.min_x.partial_cmp(&b.bbox.min_x).unwrap());
+        } else {
+            node.children
+                .sort_by(|a, b| a.bbox.min_y.partial_cmp(&b.bbox.min_y).unwrap());
+        }
+
+        let mut left_bbox = Rect::new_empty();
+        let mut right_bbox = Rect::new_empty();
+
+        for i in 0..m {
+            left_bbox.extend(&node.children[i].bbox);
+        }
+        for i in (count - m)..count {
+            right_bbox.extend(&node.children[i].bbox);
+        }
+
+        let mut margin = left_bbox.margin() + right_bbox.margin();
+
+        for i in m..(count - m) {
+            left_bbox.extend(&node.children[i].bbox);
+            margin += left_bbox.margin();
+        }
+        for i in ((m)..(count - m)).rev() {
+            right_bbox.extend(&node.children[i].bbox);
+            margin += right_bbox.margin();
+        }
+
+        margin
+    }
+
+    fn choose_split_index(node: &Entry, m: usize, count: usize) -> usize {
+        let mut min_overlap = f64::INFINITY;
+        let mut min_area = f64::INFINITY;
+        let mut index = count - m;
+
+        for i in m..=(count - m) {
+            let mut bbox1 = Rect::new_empty();
+            let mut bbox2 = Rect::new_empty();
+
+            for c in &node.children[0..i] {
+                bbox1.extend(&c.bbox);
+            }
+            for c in &node.children[i..count] {
+                bbox2.extend(&c.bbox);
+            }
+
+            let overlap = bbox1.intersection_area(&bbox2);
+            let area = bbox1.area() + bbox2.area();
+
+            if overlap < min_overlap {
+                min_overlap = overlap;
+                index = i;
+                min_area = if area < min_area { area } else { min_area };
+            } else if overlap == min_overlap {
+                if area < min_area {
+                    min_area = area;
+                    index = i;
+                }
+            }
+        }
+        index
+    }
+}

package/rbush_rs.d.ts

@@ -1,59 +0,0 @@
-/* tslint:disable */
-/* eslint-disable */
-
-export class RBush {
-    free(): void;
-    [Symbol.dispose](): void;
-    all(): Array<any>;
-    clear(): void;
-    collides(bbox_js: any): boolean;
-    insert(item: any): void;
-    load(data: Array<any>): void;
-    loadHybrid(fast_coords: Float64Array, items: Array<any>): void;
-    constructor(max_entries?: number | null);
-    remove(item: any): void;
-    search(bbox_js: any): Array<any>;
-}
-
-export type InitInput = RequestInfo | URL | Response | BufferSource | WebAssembly.Module;
-
-export interface InitOutput {
-    readonly memory: WebAssembly.Memory;
-    readonly __wbg_rbush_free: (a: number, b: number) => void;
-    readonly rbush_all: (a: number) => any;
-    readonly rbush_clear: (a: number) => void;
-    readonly rbush_collides: (a: number, b: any) => number;
-    readonly rbush_insert: (a: number, b: any) => void;
-    readonly rbush_load: (a: number, b: any) => void;
-    readonly rbush_loadHybrid: (a: number, b: number, c: number, d: any) => void;
-    readonly rbush_new: (a: number) => number;
-    readonly rbush_remove: (a: number, b: any) => void;
-    readonly rbush_search: (a: number, b: any) => any;
-    readonly __wbindgen_exn_store: (a: number) => void;
-    readonly __externref_table_alloc: () => number;
-    readonly __wbindgen_externrefs: WebAssembly.Table;
-    readonly __wbindgen_malloc: (a: number, b: number) => number;
-    readonly __wbindgen_start: () => void;
-}
-
-export type SyncInitInput = BufferSource | WebAssembly.Module;
-
-/**
- * Instantiates the given `module`, which can either be bytes or
- * a precompiled `WebAssembly.Module`.
- *
- * @param {{ module: SyncInitInput }} module - Passing `SyncInitInput` directly is deprecated.
- *
- * @returns {InitOutput}
- */
-export function initSync(module: { module: SyncInitInput } | SyncInitInput): InitOutput;
-
-/**
- * If `module_or_path` is {RequestInfo} or {URL}, makes a request and
- * for everything else, calls `WebAssembly.instantiate` directly.
- *
- * @param {{ module_or_path: InitInput | Promise<InitInput> }} module_or_path - Passing `InitInput` directly is deprecated.
- *
- * @returns {Promise<InitOutput>}
- */
-export default function __wbg_init (module_or_path?: { module_or_path: InitInput | Promise<InitInput> } | InitInput | Promise<InitInput>): Promise<InitOutput>;

package/rbush_rs.js

@@ -1,303 +0,0 @@
-/* @ts-self-types="./rbush_rs.d.ts" */
-
-export class RBush {
-    __destroy_into_raw() {
-        const ptr = this.__wbg_ptr;
-        this.__wbg_ptr = 0;
-        RBushFinalization.unregister(this);
-        return ptr;
-    }
-    free() {
-        const ptr = this.__destroy_into_raw();
-        wasm.__wbg_rbush_free(ptr, 0);
-    }
-    /**
-     * @returns {Array<any>}
-     */
-    all() {
-        const ret = wasm.rbush_all(this.__wbg_ptr);
-        return ret;
-    }
-    clear() {
-        wasm.rbush_clear(this.__wbg_ptr);
-    }
-    /**
-     * @param {any} bbox_js
-     * @returns {boolean}
-     */
-    collides(bbox_js) {
-        const ret = wasm.rbush_collides(this.__wbg_ptr, bbox_js);
-        return ret !== 0;
-    }
-    /**
-     * @param {any} item
-     */
-    insert(item) {
-        wasm.rbush_insert(this.__wbg_ptr, item);
-    }
-    /**
-     * @param {Array<any>} data
-     */
-    load(data) {
-        wasm.rbush_load(this.__wbg_ptr, data);
-    }
-    /**
-     * @param {Float64Array} fast_coords
-     * @param {Array<any>} items
-     */
-    loadHybrid(fast_coords, items) {
-        const ptr0 = passArrayF64ToWasm0(fast_coords, wasm.__wbindgen_malloc);
-        const len0 = WASM_VECTOR_LEN;
-        wasm.rbush_loadHybrid(this.__wbg_ptr, ptr0, len0, items);
-    }
-    /**
-     * @param {number | null} [max_entries]
-     */
-    constructor(max_entries) {
-        const ret = wasm.rbush_new(isLikeNone(max_entries) ? 0x100000001 : (max_entries) >>> 0);
-        this.__wbg_ptr = ret >>> 0;
-        RBushFinalization.register(this, this.__wbg_ptr, this);
-        return this;
-    }
-    /**
-     * @param {any} item
-     */
-    remove(item) {
-        wasm.rbush_remove(this.__wbg_ptr, item);
-    }
-    /**
-     * @param {any} bbox_js
-     * @returns {Array<any>}
-     */
-    search(bbox_js) {
-        const ret = wasm.rbush_search(this.__wbg_ptr, bbox_js);
-        return ret;
-    }
-}
-if (Symbol.dispose) RBush.prototype[Symbol.dispose] = RBush.prototype.free;
-
-function __wbg_get_imports() {
-    const import0 = {
-        __proto__: null,
-        __wbg___wbindgen_jsval_eq_11888390b0186270: function(arg0, arg1) {
-            const ret = arg0 === arg1;
-            return ret;
-        },
-        __wbg___wbindgen_number_get_8ff4255516ccad3e: function(arg0, arg1) {
-            const obj = arg1;
-            const ret = typeof(obj) === 'number' ? obj : undefined;
-            getDataViewMemory0().setFloat64(arg0 + 8 * 1, isLikeNone(ret) ? 0 : ret, true);
-            getDataViewMemory0().setInt32(arg0 + 4 * 0, !isLikeNone(ret), true);
-        },
-        __wbg___wbindgen_throw_be289d5034ed271b: function(arg0, arg1) {
-            throw new Error(getStringFromWasm0(arg0, arg1));
-        },
-        __wbg_get_9b94d73e6221f75c: function(arg0, arg1) {
-            const ret = arg0[arg1 >>> 0];
-            return ret;
-        },
-        __wbg_get_b3ed3ad4be2bc8ac: function() { return handleError(function (arg0, arg1) {
-            const ret = Reflect.get(arg0, arg1);
-            return ret;
-        }, arguments); },
-        __wbg_length_35a7bace40f36eac: function(arg0) {
-            const ret = arg0.length;
-            return ret;
-        },
-        __wbg_new_3eb36ae241fe6f44: function() {
-            const ret = new Array();
-            return ret;
-        },
-        __wbg_push_8ffdcb2063340ba5: function(arg0, arg1) {
-            const ret = arg0.push(arg1);
-            return ret;
-        },
-        __wbindgen_cast_0000000000000001: function(arg0, arg1) {
-            // Cast intrinsic for `Ref(String) -> Externref`.
-            const ret = getStringFromWasm0(arg0, arg1);
-            return ret;
-        },
-        __wbindgen_init_externref_table: function() {
-            const table = wasm.__wbindgen_externrefs;
-            const offset = table.grow(4);
-            table.set(0, undefined);
-            table.set(offset + 0, undefined);
-            table.set(offset + 1, null);
-            table.set(offset + 2, true);
-            table.set(offset + 3, false);
-        },
-    };
-    return {
-        __proto__: null,
-        "./rbush_rs_bg.js": import0,
-    };
-}
-
-const RBushFinalization = (typeof FinalizationRegistry === 'undefined')
-    ? { register: () => {}, unregister: () => {} }
-    : new FinalizationRegistry(ptr => wasm.__wbg_rbush_free(ptr >>> 0, 1));
-
-function addToExternrefTable0(obj) {
-    const idx = wasm.__externref_table_alloc();
-    wasm.__wbindgen_externrefs.set(idx, obj);
-    return idx;
-}
-
-let cachedDataViewMemory0 = null;
-function getDataViewMemory0() {
-    if (cachedDataViewMemory0 === null || cachedDataViewMemory0.buffer.detached === true || (cachedDataViewMemory0.buffer.detached === undefined && cachedDataViewMemory0.buffer !== wasm.memory.buffer)) {
-        cachedDataViewMemory0 = new DataView(wasm.memory.buffer);
-    }
-    return cachedDataViewMemory0;
-}
-
-let cachedFloat64ArrayMemory0 = null;
-function getFloat64ArrayMemory0() {
-    if (cachedFloat64ArrayMemory0 === null || cachedFloat64ArrayMemory0.byteLength === 0) {
-        cachedFloat64ArrayMemory0 = new Float64Array(wasm.memory.buffer);
-    }
-    return cachedFloat64ArrayMemory0;
-}
-
-function getStringFromWasm0(ptr, len) {
-    ptr = ptr >>> 0;
-    return decodeText(ptr, len);
-}
-
-let cachedUint8ArrayMemory0 = null;
-function getUint8ArrayMemory0() {
-    if (cachedUint8ArrayMemory0 === null || cachedUint8ArrayMemory0.byteLength === 0) {
-        cachedUint8ArrayMemory0 = new Uint8Array(wasm.memory.buffer);
-    }
-    return cachedUint8ArrayMemory0;
-}
-
-function handleError(f, args) {
-    try {
-        return f.apply(this, args);
-    } catch (e) {
-        const idx = addToExternrefTable0(e);
-        wasm.__wbindgen_exn_store(idx);
-    }
-}
-
-function isLikeNone(x) {
-    return x === undefined || x === null;
-}
-
-function passArrayF64ToWasm0(arg, malloc) {
-    const ptr = malloc(arg.length * 8, 8) >>> 0;
-    getFloat64ArrayMemory0().set(arg, ptr / 8);
-    WASM_VECTOR_LEN = arg.length;
-    return ptr;
-}
-
-let cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
-cachedTextDecoder.decode();
-const MAX_SAFARI_DECODE_BYTES = 2146435072;
-let numBytesDecoded = 0;
-function decodeText(ptr, len) {
-    numBytesDecoded += len;
-    if (numBytesDecoded >= MAX_SAFARI_DECODE_BYTES) {
-        cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
-        cachedTextDecoder.decode();
-        numBytesDecoded = len;
-    }
-    return cachedTextDecoder.decode(getUint8ArrayMemory0().subarray(ptr, ptr + len));
-}
-
-let WASM_VECTOR_LEN = 0;
-
-let wasmModule, wasm;
-function __wbg_finalize_init(instance, module) {
-    wasm = instance.exports;
-    wasmModule = module;
-    cachedDataViewMemory0 = null;
-    cachedFloat64ArrayMemory0 = null;
-    cachedUint8ArrayMemory0 = null;
-    wasm.__wbindgen_start();
-    return wasm;
-}
-
-async function __wbg_load(module, imports) {
-    if (typeof Response === 'function' && module instanceof Response) {
-        if (typeof WebAssembly.instantiateStreaming === 'function') {
-            try {
-                return await WebAssembly.instantiateStreaming(module, imports);
-            } catch (e) {
-                const validResponse = module.ok && expectedResponseType(module.type);
-
-                if (validResponse && module.headers.get('Content-Type') !== 'application/wasm') {
-                    console.warn("`WebAssembly.instantiateStreaming` failed because your server does not serve Wasm with `application/wasm` MIME type. Falling back to `WebAssembly.instantiate` which is slower. Original error:\n", e);
-
-                } else { throw e; }
-            }
-        }
-
-        const bytes = await module.arrayBuffer();
-        return await WebAssembly.instantiate(bytes, imports);
-    } else {
-        const instance = await WebAssembly.instantiate(module, imports);
-
-        if (instance instanceof WebAssembly.Instance) {
-            return { instance, module };
-        } else {
-            return instance;
-        }
-    }
-
-    function expectedResponseType(type) {
-        switch (type) {
-            case 'basic': case 'cors': case 'default': return true;
-        }
-        return false;
-    }
-}
-
-function initSync(module) {
-    if (wasm !== undefined) return wasm;
-
-
-    if (module !== undefined) {
-        if (Object.getPrototypeOf(module) === Object.prototype) {
-            ({module} = module)
-        } else {
-            console.warn('using deprecated parameters for `initSync()`; pass a single object instead')
-        }
-    }
-
-    const imports = __wbg_get_imports();
-    if (!(module instanceof WebAssembly.Module)) {
-        module = new WebAssembly.Module(module);
-    }
-    const instance = new WebAssembly.Instance(module, imports);
-    return __wbg_finalize_init(instance, module);
-}
-
-async function __wbg_init(module_or_path) {
-    if (wasm !== undefined) return wasm;
-
-
-    if (module_or_path !== undefined) {
-        if (Object.getPrototypeOf(module_or_path) === Object.prototype) {
-            ({module_or_path} = module_or_path)
-        } else {
-            console.warn('using deprecated parameters for the initialization function; pass a single object instead')
-        }
-    }
-
-    if (module_or_path === undefined) {
-        module_or_path = new URL('rbush_rs_bg.wasm', import.meta.url);
-    }
-    const imports = __wbg_get_imports();
-
-    if (typeof module_or_path === 'string' || (typeof Request === 'function' && module_or_path instanceof Request) || (typeof URL === 'function' && module_or_path instanceof URL)) {
-        module_or_path = fetch(module_or_path);
-    }
-
-    const { instance, module } = await __wbg_load(await module_or_path, imports);
-
-    return __wbg_finalize_init(instance, module);
-}
-
-export { initSync, __wbg_init as default };