I was using your code in an leetcode problem, and some test cases are bit off, I spend some time debugging, and found an logic error, where for some data sets, the iteration will yield repeated items.

I think what's happening is this:

• first iteration yields result in this code path with self.offset == 0:

• the next iteration moves to the next component (which happens to be a "small" component), with self.offset still being 0:

• thus the interval at offset 0 gets returned twice.

I tried to add this piece of code at L281, and it seems fixes the failure for the test cases, but I don't fully understand the algorithm, I can't be sure if this is correct or not. please take a look at it.

+   if self.find_offset {
+       self.find_offset = comp_start;
+       self.find_offset = 0;
+   }
    while self.offset < comp_end {
        let interval = &self.inner.intervals[self.offset];
        self.offset += 1;
        if interval.start < self.stop && interval.end > self.start {
            return Some(interval);
        }
    }

Hey, great job on implementing AIList!

I just noticed one thing, could be nothing, but shouldn't it be

while j < min_cov_len && ...

instead of

while j < min_comp_len && ...