`find_block_end` query against a loaded span set. Prefers an empty marker at exactly `target` (e.g. an inode marker `V[9:9]` over a name vertex `V[0:9]` that also ends at 9), then the non-empty span immediately left of `target` if it ends at or contains `target`, then a non-empty span starting exactly at `target`.
(set: &BTreeSet<(u64, u64)>, target: u64)
| 83 | /// immediately left of `target` if it ends at or contains `target`, then a |
| 84 | /// non-empty span starting exactly at `target`. |
| 85 | fn block_end(set: &BTreeSet<(u64, u64)>, target: u64) -> Option<(u64, u64)> { |
| 86 | if set.contains(&(target, target)) { |
| 87 | return Some((target, target)); |
| 88 | } |
| 89 | for &(s, e) in set.range(..(target, 0u64)).rev() { |
| 90 | if s == e { |
| 91 | continue; |
| 92 | } |
| 93 | if e == target || (s <= target && target < e) { |
| 94 | return Some((s, e)); |
| 95 | } |
| 96 | break; |
| 97 | } |
| 98 | for &(s, e) in set.range((target, 0u64)..=(target, u64::MAX)) { |
| 99 | if s != e { |
| 100 | return Some((s, e)); |
| 101 | } |
| 102 | } |
| 103 | None |
| 104 | } |
no test coverage detected