range_overlap/

lib.rs

//! Determine how two ranges overlap, given their end points.
//! 
//! There are two pairs of terms used throughout this crate: *exclusive* vs.
//! *inclusive* and *closed* vs. *open*.
//! 
//! - *exclusive* vs. *inclusive* refers to whether the end of the range is
//! considered part of it. This is the distinction between `1..3` and `1..=3`
//! in Rust's range notation: the former will only represent the sequence `[1, 2]`
//! and thus is *exclusive*, while the latter represents `[1, 2, 3]` and so is
//! *inclusive*.
//! 
//! - *closed* vs. *open* refers to whether the range has finite end points.
//! You could have a range that starts at `1` and goes one forever, ends at `10`
//! but has infinitely many values less than that, or that has no end points whatsoever.
//! These are all *open* ranges. Conversely, a range that starts at `1` and ends at `5`
//! is closed. When this crate needs to represent ranges that may be closed, half-open,
//! or fully open, it uses `Option<T>` values, where `Some(T)` represents a closed side
//! and `None` an open side. For example, `(Some(1), None)` represent the range starting
//! at `1` and going on forever.
//! 
//! The [`RangeOverlap`] enum of this crate specifies 6 possible ways
//! in which two ranges may overlap. In the following schematics, `|`
//! indicates an end point included in the range, `-` indicates an internal
//! part of the range, and `o` indicates an exclusive end point. For simplicity,
//! we'll only cover fully closed ranges first.
//! 
//! The simplest is no overlap, represented by [`RangeOverlap::None`]:
//! 
//! ```text
//! // B is wholly after A
//! A: |----|
//! B:         |----|
//! 
//! // A is wholly after B
//! A:         |--|
//! B: |---|
//! 
//! // B starts on A's excluded end point:
//! A: |----o
//! B:      |----o
//! ```
//! 
//! The next simplest is [`RangeOverlap::AEqualsB`], when A and B represent the same range:
//! ```text
//! // This holds true for inclusive...
//! A: |----|
//! B: |----|
//! 
//! // ...and exclusive ranges:
//! A: |----o
//! B: |----o
//! ```
//! 
//! The next two variants indicate when one range is entirely within
//! another. [`RangeOverlap::AContainsB`] means that the first range 
//! specified (`A`) contains all the points in `B`, while [`RangeOverlap::AInsideB`]
//! indicates the reverse:
//! 
//! ```text
//! // AContainsB:
//! A: |------|
//! B:   |--|
//! 
//! // These are also AContainsB, because no point in B is outside A, even though
//! // the ends line up:
//! A: |------|
//! B: |----|
//! 
//! A: |------|
//! B:   |----|
//! 
//! A: |------o
//! B:   |----o
//! 
//! And vice versa, these are AInsideB:
//! A:   |---|
//! B: |-------|
//! 
//! A:   |---o
//! B: |-----o
//! 
//! A: |---|
//! B: |-----|
//! ```
//! 
//! Finally, [`RangeOverlap::AEndsInB`] and [`RangeOverlap::AStartsInB`] indicate
//! cases where only one end of A falls within the limits of B:
//! 
//! ```text
//! // AEndsInB:
//! 
//! A: |------|
//! B:    |-------|
//! 
//! // This is AEndsInB because the end of A is included. If it were
//! // exclusive this would be None:
//! A: |------|
//! B:        |-----|
//! 
//! // AStartsInB:
//! A:    |------|
//! B: |----|
//! 
//! A:    |------|
//! B: |--|
//! ```
//! 
//! The main function that can classify any type of range is [`classify_any`]. This can handle
//! closed, half-open, or fully open ranges and interpret the end points as inclusive or exclusive.
//! If you know your ranges will be closed, you can use [`excl_classify`] or [`incl_classify`] to
//! determine the [`RangeOverlap`] without needing to wrap the range ends in `Some()`.
//! 
//! One assumption this crate makes is that an end being open means the same thing for both ranges.
//! For example:
//! 
//! ```
//! # use range_overlap::{classify_any, RangeOverlap};
//! 
//! let overlap = classify_any(None, Some(5), None, Some(10), false);
//! assert_eq!(overlap, RangeOverlap::AInsideB);
//! ```
//! 
//! Here, `None` is assumed to mean the same thing for both ranges, essentially negative infinity.
//! Since this means there can be no point in A not also in B, the result is `AInsideB`. Another
//! interesting case is when both ranges are fully open:
//! 
//! ```
//! # use range_overlap::{classify_any, RangeOverlap};
//! 
//! // With literal `None`s we had to give the type T as i32, since there was nothing
//! // for Rust to infer T from. You will almost never need to do this in practice.
//! let overlap = classify_any::<i32>(None, None, None, None, false);
//! assert_eq!(overlap, RangeOverlap::AEqualsB);
//! ```
//! 
//! Again, since `None` is taken to mean the same thing for both A and B, all points in one
//! must be in the other, so these two are equal ranges.
//! 
//! If you only need to determine if two ranges overlap, but not how, you can either use the 
//! [`RangeOverlap::has_overlap`] method, or call one of the convenience methods:
//! 
//! - [`has_excl_overlap`]
//! - [`has_incl_overlap`]
//! - [`has_open_excl_overlap`]
//! - [`has_open_incl_overlap`]
//! 
//! Finally, note that all of these method are defined for any type that implements [`PartialOrd`].
//! This means you can use them for integers, floats, `chrono` times, and many other types. This includes
//! types such as [`std::string::String`], which may not produce intuitive behavior unless you are very
//! clear on how they are ordered.

/// An enum describing the kind of overlap between two ranges.
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
pub enum RangeOverlap {
    /// The second range is fully within the first, meaning that all values from the second are also in the first
    AContainsB,

    /// The first range is fully within the second, meaning that all values from the first are also in the second
    AInsideB,

    /// The end of the first range overlaps with the start of the second. One case that depends on whether the ranges
    /// are considered inclusive or exclusive is when the end of A equals the start of B. That case will only be `AEndsInB`
    /// if the ranges are inclusive, otherwise it will be `None`.
    AEndsInB,

    /// The start of the first range overlaps the end of the second. One case that depends on whether the ranges
    /// are considered inclusive or exclusive is when the start of A equals the end of B. That case will only be `AStartsInB`
    /// if the ranges are inclusive, otherwise it will be `None`.
    AStartsInB,

    /// The bounds of both ranges are exactly the same.
    AEqualsB,

    /// There is no overlap between the two ranges.
    None
}

impl RangeOverlap {
    /// Returns `true` if there was any overlap between the ranges
    pub fn has_overlap(&self) -> bool {
        if let Self::None = self {
            false
        } else {
            true
        }
    }
}

/// Classify the kind of overlap between two fully closed ranges with the ends
/// considered exclusive.
pub fn excl_classify<T: PartialOrd>(a_start: T, a_end: T, b_start: T, b_end: T) -> RangeOverlap {
    if a_start == b_start && a_end == b_end {
        RangeOverlap::AEqualsB
    } else if a_start <= b_start && a_end >= b_end {
        RangeOverlap::AContainsB
    } else if a_start < b_start && a_end > b_start && a_end <= b_end {
        RangeOverlap::AEndsInB
    } else if a_start > b_start && a_start < b_end && a_end > b_end {
        RangeOverlap::AStartsInB
    } else if a_start >= b_end || b_start >= a_end {
        RangeOverlap::None
    } else {
        RangeOverlap::AInsideB
    }
}

/// Classify the kind of overlap between two fully closed ranges with the ends
/// considered inclusive.
pub fn incl_classify<T: PartialOrd>(a_start: T, a_end: T, b_start: T, b_end: T) -> RangeOverlap {
    if a_start == b_start && a_end == b_end {
        RangeOverlap::AEqualsB
    } else if a_start <= b_start && a_end >= b_end {
        RangeOverlap::AContainsB
    } else if a_start < b_start && a_end >= b_start && a_end <= b_end {
        RangeOverlap::AEndsInB
    } else if a_start > b_start && a_start <= b_end && a_end > b_end {
        RangeOverlap::AStartsInB
    } else if a_start >= b_end || b_start >= a_end {
        RangeOverlap::None
    } else {
        RangeOverlap::AInsideB
    }
}

/// Classify the kind of overlap between two ranges that can be closed, half-open,
/// or fully open. Specifying `a_start`, `a_end`, `b_start`, or `b_end` as `None`
/// indicates that that side of the range is open. The final parameter, `inclusive`,
/// can be `true` to indicate that `a_end` and `b_end` are part of their ranges, or
/// `false` if they are not.
pub fn classify_any<T: PartialOrd>(a_start: Option<T>, a_end: Option<T>, b_start: Option<T>, b_end: Option<T>, inclusive: bool) -> RangeOverlap {
    match (a_start, a_end, b_start, b_end, inclusive) {
        (None, None, None, None, _) => RangeOverlap::AEqualsB,
        (None, None, None, Some(_), _) => RangeOverlap::AContainsB,
        (None, None, Some(_), None, _) => RangeOverlap::AContainsB,
        (None, None, Some(_), Some(_), _) => RangeOverlap::AContainsB,
        (None, Some(_), None, None, _) => RangeOverlap::AInsideB,
        (None, Some(ea), None, Some(eb), _) => {
            // Doesn't matter here if we are looking for inclusive or exclusive,
            // since we only compare ends
            if ea == eb {
                RangeOverlap::AEqualsB
            } else if ea < eb {
                RangeOverlap::AInsideB
            } else {
                RangeOverlap::AContainsB
            }
        },
        (None, Some(ea), Some(sb), None, false) => {
            if ea <= sb {
                RangeOverlap::None
            } else {
                RangeOverlap::AEndsInB
            }
        },
        (None, Some(ea), Some(sb), None, true) => {
            if ea < sb {
                RangeOverlap::None
            } else {
                RangeOverlap::AEndsInB
            }
        },
        (None, Some(ea), Some(sb), Some(eb), false) => {
            if ea <= sb {
                RangeOverlap::None
            } else if ea > sb && ea < eb {
                RangeOverlap::AEndsInB
            } else {
                RangeOverlap::AContainsB
            }
        },
        (None, Some(ea), Some(sb), Some(eb), true) => {
            if ea < sb {
                RangeOverlap::None
            } else if ea >= sb && ea < eb {
                RangeOverlap::AEndsInB
            } else {
                RangeOverlap::AContainsB
            }
        },
        (Some(_), None, None, None, _) => RangeOverlap::AInsideB,
        (Some(sa), None, None, Some(eb), false) => {
            if sa >= eb {
                RangeOverlap::None
            } else {
                RangeOverlap::AStartsInB
            }
        },
        (Some(sa), None, None, Some(eb), true) => {
            if sa > eb {
                RangeOverlap::None
            } else {
                RangeOverlap::AStartsInB
            }
        },
        (Some(sa), None, Some(sb), None, _) => {
            if sa == sb {
                RangeOverlap::AEqualsB
            } else if sa < sb {
                RangeOverlap::AContainsB
            } else {
                RangeOverlap::AInsideB
            }
        },
        (Some(sa), None, Some(sb), Some(eb), false) => {
            if sa <= sb {
                RangeOverlap::AContainsB
            } else if sa < eb {
                RangeOverlap::AStartsInB
            } else {
                RangeOverlap::None
            }
        },
        (Some(sa), None, Some(sb), Some(eb), true) => {
            if sa <= sb {
                RangeOverlap::AContainsB
            } else if sa <= eb {
                RangeOverlap::AStartsInB
            } else {
                RangeOverlap::None
            }
        },
        (Some(_), Some(_), None, None, _) => RangeOverlap::AInsideB,
        (Some(sa), Some(ea), None, Some(eb), false) => {
            if eb <= sa {
                RangeOverlap::None
            } else if ea <= eb {
                RangeOverlap::AInsideB
            } else {
                RangeOverlap::AStartsInB
            }
        },
        (Some(sa), Some(ea), None, Some(eb), true) => {
            if eb < sa {
                RangeOverlap::None
            } else if ea <= eb {
                RangeOverlap::AInsideB
            } else {
                RangeOverlap::AStartsInB
            }
        },
        (Some(sa), Some(ea), Some(sb), None, false) => {
            if sb >= ea {
                RangeOverlap::None
            } else if sa >= sb {
                RangeOverlap::AInsideB
            } else {
                RangeOverlap::AEndsInB
            }
        },
        (Some(sa), Some(ea), Some(sb), None, true) => {
            if sb > ea {
                RangeOverlap::None
            } else if sa >= sb {
                RangeOverlap::AInsideB
            } else {
                RangeOverlap::AEndsInB
            }
        },
        (Some(sa), Some(ea), Some(sb), Some(eb), false) => {
            excl_classify(sa, ea, sb, eb)
        },
        (Some(sa), Some(ea), Some(sb), Some(eb), true) => {
            incl_classify(sa, ea, sb, eb)
        },
    }
}

/// A convenience function that directly returns `true` if the two closed ranges given
/// have overlap, with `a_end` and `b_end` not included in the range.
pub fn has_excl_overlap<T: PartialOrd>(a_start: T, a_end: T, b_start: T, b_end: T) -> bool {
    excl_classify(a_start, a_end, b_start, b_end).has_overlap()
}

/// A convenience function that directly returns `true` if the two closed ranges given
/// have overlap, with `a_end` and `b_end` included in the range.
pub fn has_incl_overlap<T: PartialOrd>(a_start: T, a_end: T, b_start: T, b_end: T) -> bool {
    incl_classify(a_start, a_end, b_start, b_end).has_overlap()
}

/// A convenience function that directly returns `true` if the two ranges given
/// (which may be closed, half-open, or fully open) have overlap, with `a_end` and `b_end` 
/// not included in the range.
pub fn has_open_excl_overlap<T: PartialOrd>(a_start: Option<T>, a_end: Option<T>, b_start: Option<T>, b_end: Option<T>) -> bool {
    classify_any(a_start, a_end, b_start, b_end, false).has_overlap()
}

/// A convenience function that directly returns `true` if the two ranges given
/// (which may be closed, half-open, or fully open) have overlap, with `a_end` and `b_end` 
/// included in the range.
pub fn has_open_incl_overlap<T: PartialOrd>(a_start: Option<T>, a_end: Option<T>, b_start: Option<T>, b_end: Option<T>) -> bool {
    classify_any(a_start, a_end, b_start, b_end, true).has_overlap()
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_open_range_exclusive_bool() {
        let r1_start = 1;
        let r1_end = 20;
        let r2_before = -20;
        let r2_before2 = -10;
        let r2_between = 10;
        let r2_after = 30;
        let r2_after2 = 40;

        // Test when both ranges are open ended, making sure that the result is symmetrical
        assert_eq!(has_open_excl_overlap(Some(r1_start), None, Some(r2_before), None), true);
        assert_eq!(has_open_excl_overlap(Some(r1_start), None, Some(r2_between), None), true);
        assert_eq!(has_open_excl_overlap(Some(r1_start), None, Some(r2_after), None), true);

        assert_eq!(has_open_excl_overlap(Some(r2_before), None, Some(r1_start), None), true);
        assert_eq!(has_open_excl_overlap(Some(r2_between), None, Some(r1_start), None), true);
        assert_eq!(has_open_excl_overlap(Some(r2_after), None, Some(r1_start), None), true);

        // Test when one range has an end date - the only non-overlapping cases should be
        // when the start date of the open ended range is after the end date of the closed
        // range.
        assert_eq!(has_open_excl_overlap(Some(r1_start), Some(r1_end), Some(r2_before), None), true);
        assert_eq!(has_open_excl_overlap(Some(r1_start), Some(r1_end), Some(r2_between), None), true);
        assert_eq!(has_open_excl_overlap(Some(r1_start), Some(r1_end), Some(r2_after), None), false);

        assert_eq!(has_open_excl_overlap(Some(r2_before), None, Some(r1_start), Some(r1_end)), true);
        assert_eq!(has_open_excl_overlap(Some(r2_between), None, Some(r1_start), Some(r1_end)), true);
        assert_eq!(has_open_excl_overlap(Some(r2_after), None, Some(r1_start), Some(r1_end)), false);

        // Test when both ranges have end dates - the non-overlapping cases should be 
        // when either ranges' start date is after the other one's end date
        assert_eq!(has_open_excl_overlap(Some(r1_start), Some(r1_end), Some(r2_before), Some(r2_before2)), false);
        assert_eq!(has_open_excl_overlap(Some(r1_start), Some(r1_end), Some(r2_before), Some(r2_between)), true);
        assert_eq!(has_open_excl_overlap(Some(r1_start), Some(r1_end), Some(r2_between), Some(r2_after)), true);
        assert_eq!(has_open_excl_overlap(Some(r1_start), Some(r1_end), Some(r2_after), Some(r2_after2)), false);

        assert_eq!(has_open_excl_overlap(Some(r2_before), Some(r2_before2), Some(r1_start), Some(r1_end)), false);
        assert_eq!(has_open_excl_overlap(Some(r2_before), Some(r2_between), Some(r1_start), Some(r1_end)), true);
        assert_eq!(has_open_excl_overlap(Some(r2_between), Some(r2_after), Some(r1_start), Some(r1_end)), true);
        assert_eq!(has_open_excl_overlap(Some(r2_after), Some(r2_after2), Some(r1_start), Some(r1_end)), false);
    }

    #[test]
    fn test_open_range_exclusive_classification() {
        // A == B
        assert_eq!(classify_any(Some(1), Some(10), Some(1), Some(10), false), RangeOverlap::AEqualsB);
        assert_eq!(classify_any(None, Some(10), None, Some(10), false), RangeOverlap::AEqualsB);
        assert_eq!(classify_any(Some(1), None, Some(1), None, false), RangeOverlap::AEqualsB);
        assert_eq!(classify_any::<i32>(None, None, None, None, false), RangeOverlap::AEqualsB);

        // A contains B
        assert_eq!(classify_any(Some(1), Some(100), Some(50), Some(60), false), RangeOverlap::AContainsB);
        assert_eq!(classify_any(None, Some(100), Some(50), Some(60), false), RangeOverlap::AContainsB);
        assert_eq!(classify_any(Some(1), None, Some(50), Some(60), false), RangeOverlap::AContainsB);
        assert_eq!(classify_any(None, None, Some(50), Some(60), false), RangeOverlap::AContainsB);
        assert_eq!(classify_any(None, Some(100), None, Some(60), false), RangeOverlap::AContainsB);
        assert_eq!(classify_any(Some(1), None, Some(50), None, false), RangeOverlap::AContainsB);
        assert_eq!(classify_any(None, None, None, Some(60), false), RangeOverlap::AContainsB);
        assert_eq!(classify_any(None, None, Some(50), None, false), RangeOverlap::AContainsB);

        // (edge cases with equal start or end values)
        assert_eq!(classify_any(None, Some(50), Some(1), Some(50), false), RangeOverlap::AContainsB);
        assert_eq!(classify_any(Some(1), None, Some(1), Some(50), false), RangeOverlap::AContainsB);
        assert_eq!(classify_any(Some(10), Some(50), Some(10), Some(20), false), RangeOverlap::AContainsB);
        assert_eq!(classify_any(Some(10), Some(50), Some(40), Some(50), false), RangeOverlap::AContainsB);

        // A inside B
        assert_eq!(classify_any(None, Some(75), None, None, false), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(50), None, None, None, false), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(50), Some(60), Some(1), Some(100), false), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(50), Some(60), None, Some(100), false), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(50), Some(60), Some(1), None, false), RangeOverlap::AInsideB);
        assert_eq!(classify_any(None, Some(60), None, Some(100), false), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(50), None, Some(1), None, false), RangeOverlap::AInsideB);

        // (edge cases with equal start or end values)
        assert_eq!(classify_any(Some(1), Some(50), Some(1), None, false), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(1), Some(50), None, Some(50), false), RangeOverlap::AInsideB);

        // These are cases that showed up when using similar code with dates,
        // so converted dates to day-of-year for this test
        //  Original dates: 2017-1-1, 2017-12-01, 2017-1-1, None
        assert_eq!(classify_any(Some(1), Some(335), Some(1), None, false), RangeOverlap::AInsideB);
        //  Original date: 2004-12-01, 2005-01-01, 2004-07-01, 2005-01-01
        assert_eq!(classify_any(Some(336), Some(366), Some(183), Some(366), false), RangeOverlap::AInsideB);

        // A ends in B
        assert_eq!(classify_any(Some(1), Some(75), Some(25), Some(99), false), RangeOverlap::AEndsInB);
        assert_eq!(classify_any(None, Some(75), Some(25), Some(99), false), RangeOverlap::AEndsInB);
        assert_eq!(classify_any(None, Some(75), Some(25), None, false), RangeOverlap::AEndsInB);

        // A starts in B
        assert_eq!(classify_any(Some(50), Some(99), Some(1), Some(75), false), RangeOverlap::AStartsInB);
        assert_eq!(classify_any(Some(50), None, Some(1), Some(75), false), RangeOverlap::AStartsInB);
        assert_eq!(classify_any(Some(50), None, None, Some(75), false), RangeOverlap::AStartsInB);

        // No overlap
        assert_eq!(classify_any(Some(1), Some(25), Some(50), Some(75), false), RangeOverlap::None);
        assert_eq!(classify_any(Some(50), Some(75), Some(1), Some(25), false), RangeOverlap::None);
        assert_eq!(classify_any(None, Some(25), Some(50), Some(99), false), RangeOverlap::None);
        assert_eq!(classify_any(Some(1), Some(25), Some(50), None, false), RangeOverlap::None);

    }

    #[test]
    fn test_open_range_inclusive_classification() {
        // A == B
        assert_eq!(classify_any(Some(1), Some(10), Some(1), Some(10), true), RangeOverlap::AEqualsB);
        assert_eq!(classify_any(None, Some(10), None, Some(10), true), RangeOverlap::AEqualsB);
        assert_eq!(classify_any(Some(1), None, Some(1), None, true), RangeOverlap::AEqualsB);
        assert_eq!(classify_any::<i32>(None, None, None, None, true), RangeOverlap::AEqualsB);

        // A contains B
        assert_eq!(classify_any(Some(1), Some(100), Some(50), Some(60), true), RangeOverlap::AContainsB);
        assert_eq!(classify_any(None, Some(100), Some(50), Some(60), true), RangeOverlap::AContainsB);
        assert_eq!(classify_any(Some(1), None, Some(50), Some(60), true), RangeOverlap::AContainsB);
        assert_eq!(classify_any(None, None, Some(50), Some(60), true), RangeOverlap::AContainsB);
        assert_eq!(classify_any(None, Some(100), None, Some(60), true), RangeOverlap::AContainsB);
        assert_eq!(classify_any(Some(1), None, Some(50), None, true), RangeOverlap::AContainsB);
        assert_eq!(classify_any(None, None, None, Some(60), true), RangeOverlap::AContainsB);
        assert_eq!(classify_any(None, None, Some(50), None, true), RangeOverlap::AContainsB);

        // (edge cases with equal start or end values)
        assert_eq!(classify_any(None, Some(50), Some(1), Some(50), true), RangeOverlap::AContainsB);
        assert_eq!(classify_any(Some(1), None, Some(1), Some(50), true), RangeOverlap::AContainsB);
        assert_eq!(classify_any(Some(10), Some(50), Some(10), Some(20), true), RangeOverlap::AContainsB);
        assert_eq!(classify_any(Some(10), Some(50), Some(40), Some(50), true), RangeOverlap::AContainsB);

        // A inside B
        assert_eq!(classify_any(None, Some(75), None, None, true), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(50), None, None, None, true), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(50), Some(60), Some(1), Some(100), true), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(50), Some(60), None, Some(100), true), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(50), Some(60), Some(1), None, true), RangeOverlap::AInsideB);
        assert_eq!(classify_any(None, Some(60), None, Some(100), true), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(50), None, Some(1), None, true), RangeOverlap::AInsideB);

        // (edge cases with equal start or end values)
        assert_eq!(classify_any(Some(1), Some(50), Some(1), None, true), RangeOverlap::AInsideB);
        assert_eq!(classify_any(Some(1), Some(50), None, Some(50), true), RangeOverlap::AInsideB);

        // These are cases that showed up when using similar code with dates,
        // so converted dates to day-of-year for this test
        //  Original dates: 2017-1-1, 2017-12-01, 2017-1-1, None
        assert_eq!(classify_any(Some(1), Some(335), Some(1), None, true), RangeOverlap::AInsideB);
        //  Original date: 2004-12-01, 2005-01-01, 2004-07-01, 2005-01-01
        assert_eq!(classify_any(Some(336), Some(366), Some(183), Some(366), true), RangeOverlap::AInsideB);

        // A ends in B
        assert_eq!(classify_any(Some(1), Some(75), Some(25), Some(99), true), RangeOverlap::AEndsInB);
        assert_eq!(classify_any(None, Some(75), Some(25), Some(99), true), RangeOverlap::AEndsInB);
        assert_eq!(classify_any(None, Some(75), Some(25), None, true), RangeOverlap::AEndsInB);

        // A starts in B
        assert_eq!(classify_any(Some(50), Some(99), Some(1), Some(75), true), RangeOverlap::AStartsInB);
        assert_eq!(classify_any(Some(50), None, Some(1), Some(75), true), RangeOverlap::AStartsInB);
        assert_eq!(classify_any(Some(50), None, None, Some(75), true), RangeOverlap::AStartsInB);

        // No overlap
        assert_eq!(classify_any(Some(1), Some(25), Some(50), Some(75), true), RangeOverlap::None);
        assert_eq!(classify_any(Some(50), Some(75), Some(1), Some(25), true), RangeOverlap::None);
        assert_eq!(classify_any(None, Some(25), Some(50), Some(99), true), RangeOverlap::None);
        assert_eq!(classify_any(Some(1), Some(25), Some(50), None, true), RangeOverlap::None);

    }

    #[test]
    fn test_exclusive_vs_inclusive() {
        assert_eq!(excl_classify(1, 5, 5, 10), RangeOverlap::None);
        assert_eq!(incl_classify(1, 5, 5, 10), RangeOverlap::AEndsInB);

        assert_eq!(excl_classify(10, 15, 5, 10), RangeOverlap::None);
        assert_eq!(incl_classify(10, 15, 5, 10), RangeOverlap::AStartsInB);

        assert_eq!(classify_any(None, Some(10), Some(10), None, false), RangeOverlap::None);
        assert_eq!(classify_any(None, Some(10), Some(10), None, true), RangeOverlap::AEndsInB);

        assert_eq!(classify_any(None, Some(10), Some(10), Some(20), false), RangeOverlap::None);
        assert_eq!(classify_any(None, Some(10), Some(10), Some(20), true), RangeOverlap::AEndsInB);

        assert_eq!(classify_any(Some(1), None, None, Some(1), false), RangeOverlap::None);
        assert_eq!(classify_any(Some(1), None, None, Some(1), true), RangeOverlap::AStartsInB);

        assert_eq!(classify_any(Some(1), None, Some(-5), Some(1), false), RangeOverlap::None);
        assert_eq!(classify_any(Some(1), None, Some(-5), Some(1), true), RangeOverlap::AStartsInB);

        assert_eq!(classify_any(Some(1), Some(10), None, Some(1), false), RangeOverlap::None);
        assert_eq!(classify_any(Some(1), Some(10), None, Some(1), true), RangeOverlap::AStartsInB);

        assert_eq!(classify_any(Some(1), Some(10), Some(10), None, false), RangeOverlap::None);
        assert_eq!(classify_any(Some(1), Some(10), Some(10), None, true), RangeOverlap::AEndsInB);


    }

}