feat: add bbox implementation

HideBa · Jan 17, 2025 · 8ee222d · 8ee222d
1 parent 9c760f6
commit 8ee222d
Show file tree

Hide file tree

Showing 9 changed files with 203 additions and 277 deletions.
diff --git a/src/rust/src/main.rs b/src/rust/src/main.rs
@@ -92,7 +92,7 @@ fn serialize(input: &str, output: &str) -> Result<()> {
     };
 
     let header_options = Some(HeaderWriterOptions {
-        write_index: false,
+        write_index: true,
         feature_count: features.len() as u64,
         index_node_size: 16,
     });

diff --git a/src/rust/src/packedrtree.rs b/src/rust/src/packedrtree.rs
@@ -522,7 +522,7 @@ impl PackedRTree {
         while let Some(next) = queue.pop_front() {
             let node_index = next.0;
             let level = next.1;
-            println!("popped next node_index: {node_index}, level: {level}");
+            // println!("popped next node_index: {node_index}, level: {level}");
             let is_leaf_node = node_index >= num_nodes - num_items;
             // find the end index of the node
             let end = min(node_index + node_size as usize, level_bounds[level].end);
@@ -538,12 +538,12 @@ impl PackedRTree {
                 if is_leaf_node {
                     let index = pos - leaf_nodes_offset;
                     let offset = node_item.offset as usize;
-                    println!("pushing leaf node. index: {index}, offset: {offset}");
+                    // println!("pushing leaf node. index: {index}, offset: {offset}");
                     results.push(SearchResultItem { offset, index });
                 } else {
                     let offset = node_item.offset as usize;
                     let prev_level = level - 1;
-                    println!("pushing branch node. prev_level: {prev_level}, offset: {offset}");
+                    // println!("pushing branch node. prev_level: {prev_level}, offset: {offset}");
                     queue.push_back((offset, prev_level));
                 }
             }

diff --git a/src/rust/src/reader/geom_decoder.rs b/src/rust/src/reader/geom_decoder.rs
@@ -264,13 +264,8 @@ fn decode_semantics_(
         // 2) If subsequent recursive call (start,n are Some)
         let s = start.unwrap();
         let length = n.unwrap();
-        println!("d: {:?}", d);
-        println!("s: {:?}", s);
-        println!("length: {:?}", length);
-        println!("semantic_indices: {:?}", semantic_indices);
         if d <= 2 {
             let slice = &semantic_indices[s..s + length];
-            print!("slice: {:?}", slice);
             let mut leaf = Vec::with_capacity(slice.len());
             for &val in slice {
                 leaf.push(if val == u32::MAX { None } else { Some(val) });
@@ -782,14 +777,6 @@ mod tests {
                 .unwrap_or_default()
                 .iter()
                 .collect::<Vec<_>>();
-
-            println!("solids: {:?}", solids);
-            println!("shells: {:?}", shells);
-            println!(
-                "semantics_objects: {:?}",
-                geometry.semantics_objects().unwrap()
-            );
-            println!("semantics: {:?}", geometry.semantics().unwrap());
             let decoded = decode_semantics(
                 &solids,
                 &shells,
@@ -805,8 +792,6 @@ mod tests {
             assert_eq!(decoded.surfaces[1].thetype, "WallSurface");
             assert_eq!(decoded.surfaces[1].children, None);
 
-            println!("values: {:?}", decoded.values);
-            println!("surfaces: {:?}", decoded.surfaces);
             match &decoded.values {
                 SemanticsValues::Nested(solids) => {
                     assert_eq!(solids.len(), 2);