nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2024-11-21 22:34:05 +00:00
Code Issues Packages Projects Releases Wiki Activity

optimize superset method of IntervalSet

Browse Source
This commit is contained in:
SparrowLii 2022-06-08 15:23:11 +08:00
parent 50b00252ae
commit 8db6d4bae2
1 changed files with 21 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
compiler/rustc_index/src/interval.rs
View File

@ -1,7 +1,7 @@
use std::iter::Step;
use std::marker::PhantomData;
use std::ops::Bound;
use std::ops::RangeBounds;
use std::ops::{Bound, Range};
use crate::vec::Idx;
use crate::vec::IndexVec;
@ -145,9 +145,26 @@ impl<I: Idx> IntervalSet<I> {
where
I: Step,
{
// FIXME: Performance here is probably not great. We will be doing a lot
// of pointless tree traversals.
other.iter().all(|elem| self.contains(elem))
let mut sup_iter = self.iter_intervals();
let mut current = None;
let contains = |sup: Range<I>, sub: Range<I>, current: &mut Option<Range<I>>| {
if sup.end < sub.start {
// if `sup.end == sub.start`, the next sup doesn't contain `sub.start`
None // continue to the next sup
} else if sup.end >= sub.end && sup.start <= sub.start {
*current = Some(sup); // save the current sup
Some(true)
} else {
Some(false)
}
};
other.iter_intervals().all(|sub| {
current
.take()
.and_then(|sup| contains(sup, sub.clone(), &mut current))
.or_else(|| sup_iter.find_map(|sup| contains(sup, sub.clone(), &mut current)))
.unwrap_or(false)
})
}
pub fn is_empty(&self) -> bool {