| 29 | } |
| 30 | |
| 31 | fn bulk_load_inner(entries: Vec<RTreeEntry>, governor: Option<Arc<MemoryGovernor>>) -> Self { |
| 32 | if entries.is_empty() { |
| 33 | let mut tree = Self::new(); |
| 34 | if let Some(gov) = governor { |
| 35 | tree.governor = Some(gov); |
| 36 | } |
| 37 | return tree; |
| 38 | } |
| 39 | let len = entries.len(); |
| 40 | |
| 41 | // Reserve budget for nodes vec (approximately len / LEAF_CAPACITY nodes, |
| 42 | // each holding LEAF_CAPACITY RTreeEntry slots). Best-effort: budget |
| 43 | // pressure is a backpressure signal, not a hard gate on bulk load. |
| 44 | let _guard = governor.as_ref().and_then(|gov| { |
| 45 | let node_count = len.div_ceil(LEAF_CAPACITY) * 2; // leaves + internals |
| 46 | let bytes = node_count |
| 47 | * (std::mem::size_of::<Node>() + LEAF_CAPACITY * std::mem::size_of::<RTreeEntry>()); |
| 48 | gov.reserve(EngineId::Spatial, bytes).ok() |
| 49 | }); |
| 50 | |
| 51 | let mut tree = Self { |
| 52 | nodes: Vec::new(), |
| 53 | root: 0, |
| 54 | len, |
| 55 | governor, |
| 56 | }; |
| 57 | tree.root = str_pack(&mut tree.nodes, entries); |
| 58 | tree |
| 59 | } |
| 60 | } |
| 61 | |
| 62 | /// Recursively pack entries into leaf nodes, then group into internal nodes. |