Make a 3-level tree with barely healthy nodes. 1 root, 8 inner nodes, 7*4+5=33 leaf nodes, 4 entries each.
(f: &mut MapForest<u32, f32>)
| 1291 | // Make a 3-level tree with barely healthy nodes. |
| 1292 | // 1 root, 8 inner nodes, 7*4+5=33 leaf nodes, 4 entries each. |
| 1293 | fn level3_sparse(f: &mut MapForest<u32, f32>) -> Map<u32, f32> { |
| 1294 | f.clear(); |
| 1295 | let mut m = Map::new(); |
| 1296 | for n in 1..133 { |
| 1297 | m.insert(n * 10, n as f32, f, &()); |
| 1298 | } |
| 1299 | m |
| 1300 | } |
| 1301 | |
| 1302 | #[test] |
| 1303 | fn level3_removes() { |