()
| 2232 | let order: Vec<u32> = if n_fine < 2 { |
| 2233 | (0..nblocks as u32).collect() |
| 2234 | } else { |
| 2235 | let h = Hypergraph::from_profile(profile); |
| 2236 | let (fine_of, fine_tree) = h.partition_with_tree(n_fine, epsilon); |
| 2237 | let mut leaf_order = Vec::with_capacity(n_fine); |
| 2238 | dfs_leaf_order(&fine_tree, &mut leaf_order); |
| 2239 | let mut rank = vec![0u32; n_fine]; |
| 2240 | for (r, &sid) in leaf_order.iter().enumerate() { |
| 2241 | rank[sid as usize] = r as u32; |
| 2242 | } |
| 2243 | let mut order: Vec<u32> = (0..nblocks as u32).collect(); |
| 2244 | order.sort_by_key(|&b| (rank[fine_of[b as usize] as usize], b)); |
| 2245 | order |
| 2246 | }; |
nothing calls this directly
no test coverage detected