From bf8f64b904b758fde524d2efc75ebac1f8ca1d95 Mon Sep 17 00:00:00 2001
From: Jack Case <jack@jack-case.pro>
Date: Sun, 29 Mar 2026 09:21:42 -0400
Subject: [PATCH] working on building a more interesting tree for testing

---
 src/main.rs | 26 +++++++++++++++++---------
 1 file changed, 17 insertions(+), 9 deletions(-)

diff --git a/src/main.rs b/src/main.rs
index 59f5aa3..210972e 100644
--- a/src/main.rs
+++ b/src/main.rs
@@ -1,18 +1,26 @@
-
+use std::collections::HashMap;
 
 use outline_rs::blocktree::{NoteBlock, NotePage, BlockTreeIterator};
 
 fn main() {
     let root_block = NoteBlock::new(0,Some(1),Some(2),String::from("hello"));
+
+    let mut block_map = HashMap::new();
+    for idx in 1..5 {
+        let new_block = NoteBlock::new(idx,None, None, String::from("I'm block {idx}"));
+        block_map.insert(idx,new_block);
+    }
+
     let mut page = NotePage::new(String::from("page 1"), 0, root_block);
-    let new_block = NoteBlock::new(1,None,None, String::from("world"));
-    page.insert(new_block);
-    let new_block = NoteBlock::new(2,None,Some(3), String::from("world"));
-    page.insert(new_block);
-    let new_block = NoteBlock::new(3,Some(4),None, String::from("world"));
-    page.insert(new_block);
-    let new_block = NoteBlock::new(4,None,None, String::from("world"));
-    page.insert(new_block);
+
+    // take each new block and give it some children/siblings
+    let mut block1 = block_vector.remove(1)?;
+    block1.next_sibling_id =
+
+
+
+
+
     page.build_tree();
 
     println!("{:?}", page);