bedrs 0.2.26

use crate::{
    traits::{ChromBounds, ValueBounds},
    Intersect, Overlap, Strand, Subtract,
};
use std::cmp::Ordering;

use super::{
    overlap::{StrandedOverlap, UnstrandedOverlap},
    Distance, Segment,
};

/// The main trait representing an interval.
///
/// This trait can be derived on arbitrary structs that have
/// the fields {chr, start, end} and those fields meet the
/// minimum required bounds of `ChromBounds` and `ValueBounds`.
///
/// # Examples
/// ```
/// use bedrs::prelude::*;
/// use bedrs_derive::Coordinates;
///
/// #[derive(Default, Coordinates)]
/// struct MyInterval {
///     chr: usize,
///     start: usize,
///     end: usize,
/// }
///
/// let a = MyInterval { chr: 1, start: 10, end: 20};
/// assert_eq!(a.chr(), &1);
/// assert_eq!(a.start(), 10);
/// assert_eq!(a.end(), 20);
/// assert_eq!(a.strand(), None);
///
/// #[derive(Default, Coordinates)]
/// struct MyStrandedInterval {
///     chr: usize,
///     start: usize,
///     end: usize,
///     strand: Strand,
/// }
///
/// let a = MyStrandedInterval{
///     chr: 1,
///     start: 10,
///     end: 20,
///     strand: Strand::Reverse
/// };
/// assert_eq!(a.chr(), &1);
/// assert_eq!(a.start(), 10);
/// assert_eq!(a.end(), 20);
/// assert_eq!(a.strand(), Some(Strand::Reverse));
/// ```
#[allow(clippy::len_without_is_empty)]
pub trait Coordinates<C, T>
where
    C: ChromBounds,
    T: ValueBounds,
{
    /// Returns the start coordinate of the interval.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let iv = Bed3::new(1, 10, 20);
    /// assert_eq!(iv.start(), 10);
    /// ```
    fn start(&self) -> T;

    /// Returns the end coordinate of the interval.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let iv = Bed3::new(1, 10, 20);
    /// assert_eq!(iv.end(), 20);
    /// ```
    fn end(&self) -> T;

    /// Returns a reference to the chromosome of the interval.
    ///
    /// *Note*: A reference is returned in the case that the chromosome
    /// is a large type, such as a `String` or `Vec<u8>`.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let iv = Bed3::new(1, 10, 20);
    /// assert_eq!(iv.chr(), &1);
    /// ```
    fn chr(&self) -> &C;

    /// Return the strand of the interval, if it has one.
    ///
    /// This is a default implementation that returns `None` for
    /// intervals that do not have a strand.
    ///
    /// # Examples
    ///
    /// ```
    /// use bedrs::{Coordinates, Bed3, Strand, StrandedBed3};
    ///
    /// let iv = Bed3::new(1, 10, 20);
    /// assert_eq!(iv.strand(), None);
    ///
    /// let siv = StrandedBed3::new(1, 10, 20, Strand::Forward);
    /// assert_eq!(siv.strand(), Some(Strand::Forward));
    /// ```
    fn strand(&self) -> Option<Strand> {
        None
    }

    /// Update the start coordinate of the interval.
    ///
    ///
    /// # Examples
    ///
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let mut iv = Bed3::new(1, 10, 20);
    /// assert_eq!(iv.start(), 10);
    ///
    /// iv.update_start(&5);
    /// assert_eq!(iv.start(), 5);
    /// ```
    fn update_start(&mut self, val: &T);

    /// Update the end coordinate of the interval.
    ///
    /// # Examples
    ///
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let mut iv = Bed3::new(1, 10, 20);
    /// assert_eq!(iv.end(), 20);
    ///
    /// iv.update_end(&30);
    /// assert_eq!(iv.end(), 30);
    /// ```
    fn update_end(&mut self, val: &T);

    /// Update the chromosome of the interval.
    ///
    /// # Examples
    ///
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let mut iv = Bed3::new(1, 10, 20);
    /// assert_eq!(iv.chr(), &1);
    ///
    /// iv.update_chr(&2);
    /// assert_eq!(iv.chr(), &2);
    /// ```
    fn update_chr(&mut self, val: &C);

    /// Update the strand of the interval.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, StrandedBed3, Strand};
    ///
    /// let mut siv = StrandedBed3::new(1, 10, 20, Strand::Forward);
    /// assert_eq!(siv.strand(), Some(Strand::Forward));
    ///
    /// siv.update_strand(Some(Strand::Reverse));
    /// assert_eq!(siv.strand(), Some(Strand::Reverse));
    /// ```
    fn update_strand(&mut self, _strand: Option<Strand>) {
        // Do nothing by default
    }

    /// Create a new interval with the same coordinates as the current one.
    ///
    /// *Note*: This is less verbose when working with generic types.
    /// In most cases it can be better to use the `copy` or `clone` methods.
    ///
    /// # Examples
    ///
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let iv = Bed3::new(1, 10, 20);
    /// let new_iv = <Bed3<usize, usize> as Coordinates<usize, usize>>::from(&iv);
    ///
    /// assert!(iv.eq(&new_iv));
    /// ```
    fn from<Iv: Coordinates<C, T>>(other: &Iv) -> Self;

    /// Creates an empty interval.
    fn empty() -> Self;

    /// Calculates the length of the interval across its start and end coordinates.
    ///
    /// # Examples
    ///
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let iv = Bed3::new(1, 10, 20);
    /// assert_eq!(iv.len(), 10);
    /// ```
    fn len(&self) -> T {
        self.end().sub(self.start())
    }

    /// Update all attributes of the interval.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let mut iv = Bed3::new(1, 10, 20);
    /// assert!(iv.eq(&Bed3::new(1, 10, 20)));
    ///
    /// iv.update_all(&2, &5, &10);
    /// assert!(iv.eq(&Bed3::new(2, 5, 10)));
    /// ```
    fn update_all(&mut self, chr: &C, start: &T, end: &T) {
        self.update_chr(chr);
        self.update_endpoints(start, end);
    }

    /// Update the endpoints of the interval.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let mut iv = Bed3::new(1, 10, 20);
    /// assert!(iv.eq(&Bed3::new(1, 10, 20)));
    ///
    /// iv.update_endpoints(&5, &10);
    /// assert!(iv.eq(&Bed3::new(1, 5, 10)));
    /// ```
    fn update_endpoints(&mut self, start: &T, end: &T) {
        self.update_start(start);
        self.update_end(end);
    }

    /// Update all the attributes of the interval from another interval.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let mut iv = Bed3::new(1, 10, 20);
    /// assert!(iv.eq(&Bed3::new(1, 10, 20)));
    ///
    /// iv.update_all_from(&Bed3::new(2, 5, 10));
    /// assert!(iv.eq(&Bed3::new(2, 5, 10)));
    /// ```
    fn update_all_from<I: Coordinates<C, T>>(&mut self, other: &I) {
        self.update_chr(other.chr());
        self.update_endpoints(&other.start(), &other.end());
    }

    /// Update only the endpoints of the interval from another interval.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let mut iv = Bed3::new(1, 10, 20);
    /// assert!(iv.eq(&Bed3::new(1, 10, 20)));
    ///
    /// iv.update_endpoints_from(&Bed3::new(2, 5, 10));
    /// assert!(iv.eq(&Bed3::new(1, 5, 10)));
    /// ```
    fn update_endpoints_from<I: Coordinates<C, T>>(&mut self, other: &I) {
        self.update_start(&other.start());
        self.update_end(&other.end());
    }

    /// Extend the interval to the left by a value.
    /// This is equivalent to subtracting the value from the start coordinate.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let mut iv = Bed3::new(1, 10, 20);
    /// assert!(iv.eq(&Bed3::new(1, 10, 20)));
    ///
    /// iv.extend_left(&5);
    /// assert!(iv.eq(&Bed3::new(1, 5, 20)));
    /// ```
    fn extend_left(&mut self, val: &T) {
        if self.start().lt(val) {
            self.update_start(&T::zero());
        } else {
            self.update_start(&self.start().sub(*val));
        }
    }

    /// Extend the interval to the right by a value.
    /// This is equivalent to adding the value to the end coordinate.
    ///
    /// If a maximum bound is provided, the new end coordinate will be capped
    /// at that maximum value.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let mut iv = Bed3::new(1, 10, 20);
    /// assert!(iv.eq(&Bed3::new(1, 10, 20)));
    ///
    /// iv.extend_right(&5, None);
    /// assert!(iv.eq(&Bed3::new(1, 10, 25)));
    ///
    /// iv.extend_right(&5, Some(27));
    /// assert!(iv.eq(&Bed3::new(1, 10, 27)));
    /// ```
    fn extend_right(&mut self, val: &T, max_bound: Option<T>) {
        let new_end = self.end().add(*val);
        if let Some(max) = max_bound {
            self.update_end(&new_end.min(max));
        } else {
            self.update_end(&new_end);
        }
    }

    /// Extend the interval to the left and right by a value.
    /// This is equivalent to subtracting the value from the start coordinate
    /// and adding the value to the end coordinate.
    ///
    /// If a maximum bound is provided, the new end coordinate will be capped
    /// at that maximum value.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let mut iv = Bed3::new(1, 10, 20);
    /// assert!(iv.eq(&Bed3::new(1, 10, 20)));
    ///
    /// iv.extend(&5, None);
    /// assert!(iv.eq(&Bed3::new(1, 5, 25)));
    ///
    /// iv.extend(&5, Some(27));
    /// assert!(iv.eq(&Bed3::new(1, 0, 27)));
    /// ```
    fn extend(&mut self, val: &T, max_bound: Option<T>) {
        self.extend_left(val);
        self.extend_right(val, max_bound);
    }

    /// Calculate the length of the interval as a fraction of the total length.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let iv = Bed3::new(1, 10, 20);
    /// assert_eq!(iv.f_len(0.5), 5);
    /// assert_eq!(iv.f_len(0.3), 3);
    /// assert_eq!(iv.f_len(2.0), 20);
    /// ```
    fn f_len(&self, frac: f64) -> T {
        let len_f: f64 = self.len().to_f64().unwrap();
        let n = len_f * frac;
        T::from_f64(n.round()).unwrap()
    }

    /// Compare two intervals by their genomic coordinates.
    ///
    /// # Examples
    /// ```
    /// use bedrs::{Coordinates, Bed3};
    ///
    /// let a = Bed3::new(1, 10, 20);
    /// let b = Bed3::new(1, 10, 20);
    /// let c = Bed3::new(1, 20, 30);
    /// let d = Bed3::new(2, 10, 20);
    /// let e = Bed3::new(1, 5, 10);
    ///
    /// // a == b
    /// assert_eq!(a.coord_cmp(&b), std::cmp::Ordering::Equal);
    ///
    /// // a < c
    /// assert_eq!(a.coord_cmp(&c), std::cmp::Ordering::Less);
    ///
    /// // a < d
    /// assert_eq!(a.coord_cmp(&d), std::cmp::Ordering::Less);
    ///
    /// // a > e
    /// assert_eq!(a.coord_cmp(&e), std::cmp::Ordering::Greater);
    /// ```
    fn coord_cmp<I: Coordinates<C, T>>(&self, other: &I) -> Ordering {
        match self.chr().cmp(other.chr()) {
            Ordering::Equal => match self.start().cmp(&other.start()) {
                Ordering::Equal => match self.end().cmp(&other.end()) {
                    Ordering::Equal => self.strand().cmp(&other.strand()),
                    order => order,
                },
                order => order,
            },
            order => order,
        }
    }
    /// Compare two intervals, but bias the `other` interval to extend
    /// further to the left by `bias` units.
    ///
    /// Used to find the lower bound of an interval in a sorted container
    /// where the maximum range of the intervals is known a priori.
    fn biased_coord_cmp<I: Coordinates<C, T>>(&self, other: &I, bias: T) -> Ordering {
        match self.chr().cmp(other.chr()) {
            Ordering::Equal => {
                let comp = if other.start() < bias {
                    None // can't compare the intervals since they both bias below zero
                } else {
                    Some(self.start().cmp(&other.start().sub(bias)))
                };
                if let Some(comp) = comp {
                    match comp {
                        Ordering::Equal => match self.end().cmp(&other.end()) {
                            Ordering::Equal => self.strand().cmp(&other.strand()),
                            order => order,
                        },
                        order => order,
                    }
                } else {
                    Ordering::Equal
                }
            }
            order => order,
        }
    }
    fn biased_lt<I: Coordinates<C, T>>(&self, other: &I, bias: T) -> bool {
        self.biased_coord_cmp(other, bias) == Ordering::Less
    }
    fn lt<I: Coordinates<C, T>>(&self, other: &I) -> bool {
        self.coord_cmp(other) == Ordering::Less
    }
    fn gt<I: Coordinates<C, T>>(&self, other: &I) -> bool {
        self.coord_cmp(other) == Ordering::Greater
    }
    fn eq<I: Coordinates<C, T>>(&self, other: &I) -> bool {
        self.coord_cmp(other) == Ordering::Equal
    }
    fn pprint(&self) -> String {
        format!(
            "{:?}:{:?}-{:?}:{}",
            self.chr(),
            self.start(),
            self.end(),
            self.strand().unwrap_or(Strand::Unknown)
        )
    }
}

impl<I, C, T> Distance<C, T> for I
where
    I: Coordinates<C, T>,
    C: ChromBounds,
    T: ValueBounds,
{
}

impl<I, C, T> Intersect<C, T> for I
where
    I: Coordinates<C, T>,
    C: ChromBounds,
    T: ValueBounds,
{
}

impl<I, C, T> Overlap<C, T> for I
where
    I: Coordinates<C, T>,
    C: ChromBounds,
    T: ValueBounds,
{
}

impl<I, C, T> StrandedOverlap<C, T> for I
where
    I: Coordinates<C, T>,
    C: ChromBounds,
    T: ValueBounds,
{
}

impl<I, C, T> UnstrandedOverlap<C, T> for I
where
    I: Coordinates<C, T>,
    C: ChromBounds,
    T: ValueBounds,
{
}

impl<I, C, T> Subtract<C, T> for I
where
    I: Coordinates<C, T>,
    C: ChromBounds,
    T: ValueBounds,
{
}

impl<I, C, T> Segment<C, T> for I
where
    I: Coordinates<C, T>,
    C: ChromBounds,
    T: ValueBounds,
{
}

#[cfg(test)]
mod testing {
    use crate::{traits::Coordinates, BaseInterval, Bed3};

    // define a custom interval struct for testing
    struct CustomInterval {
        left: usize,
        right: usize,
    }
    impl Coordinates<usize, usize> for CustomInterval {
        fn empty() -> Self {
            Self { left: 0, right: 0 }
        }
        fn start(&self) -> usize {
            self.left
        }
        fn end(&self) -> usize {
            self.right
        }
        fn chr(&self) -> &usize {
            &0
        }
        fn update_start(&mut self, val: &usize) {
            self.left = *val;
        }
        fn update_end(&mut self, val: &usize) {
            self.right = *val;
        }
        #[allow(unused)]
        fn update_chr(&mut self, val: &usize) {}
        fn from<Iv: Coordinates<usize, usize>>(other: &Iv) -> Self {
            Self {
                left: other.start(),
                right: other.end(),
            }
        }
    }

    // define a custom interval struct for testing
    struct CustomIntervalMeta {
        left: usize,
        right: usize,
        meta: String,
    }
    impl Coordinates<usize, usize> for CustomIntervalMeta {
        fn empty() -> Self {
            Self {
                left: 0,
                right: 0,
                meta: String::new(),
            }
        }
        fn start(&self) -> usize {
            self.left
        }
        fn end(&self) -> usize {
            self.right
        }
        fn chr(&self) -> &usize {
            &0
        }
        fn update_start(&mut self, val: &usize) {
            self.left = *val;
        }
        fn update_end(&mut self, val: &usize) {
            self.right = *val;
        }
        #[allow(unused)]
        fn update_chr(&mut self, val: &usize) {}
        fn from<Iv: Coordinates<usize, usize>>(other: &Iv) -> Self {
            Self {
                left: other.start(),
                right: other.end(),
                meta: String::new(),
            }
        }
    }

    #[test]
    fn test_custom_interval() {
        let left = 10;
        let right = 100;
        let a = CustomInterval { left, right };
        assert_eq!(a.start(), 10);
        assert_eq!(a.end(), 100);
        assert_eq!(*a.chr(), 0);

        // for coverage
        let mut a = CustomInterval::empty();
        a.update_chr(&0);
        //
    }

    #[test]
    fn test_custom_interval_update() {
        let mut a = CustomInterval {
            left: 10,
            right: 100,
        };
        assert_eq!(a.start(), 10);
        assert_eq!(a.end(), 100);
        a.update_start(&30);
        a.update_end(&120);
        assert_eq!(a.start(), 30);
        assert_eq!(a.end(), 120);
    }

    #[test]
    fn test_custom_interval_transcode() {
        let a = CustomInterval {
            left: 10,
            right: 100,
        };
        let b: CustomInterval = Coordinates::from(&a);
        assert_eq!(a.start(), b.start());
        assert_eq!(a.end(), b.end());
        assert_eq!(a.chr(), b.chr());
    }
    #[test]
    fn test_custom_interval_with_meta() {
        let left = 10;
        let right = 100;
        let meta = "some_meta".to_string();
        let a = CustomIntervalMeta { left, right, meta };
        assert_eq!(a.start(), 10);
        assert_eq!(a.end(), 100);
        assert_eq!(*a.chr(), 0);
    }

    #[test]
    fn test_custom_interval_meta_update() {
        let mut a = CustomIntervalMeta {
            left: 10,
            right: 100,
            meta: String::from("hello"),
        };
        assert_eq!(a.start(), 10);
        assert_eq!(a.end(), 100);
        a.update_start(&30);
        a.update_end(&120);
        a.update_chr(&0);
        assert_eq!(a.start(), 30);
        assert_eq!(a.end(), 120);
        let _a = CustomIntervalMeta::empty();
    }

    #[test]
    fn test_custom_interval_meta_transcode() {
        let a = CustomIntervalMeta {
            left: 10,
            right: 100,
            meta: String::from("hello"),
        };
        let b: CustomIntervalMeta = Coordinates::from(&a);
        assert_eq!(a.start(), b.start());
        assert_eq!(a.end(), b.end());
        assert_eq!(a.chr(), b.chr());
        assert_ne!(a.meta, b.meta);
    }

    #[test]
    fn test_convenience_methods() {
        let a = BaseInterval::new(10, 20);
        let b = BaseInterval::new(30, 50);
        let c = BaseInterval::new(30, 50);
        assert!(a.lt(&b));
        assert!(b.gt(&a));
        assert!(b.eq(&c));
    }

    #[test]
    fn test_extend_left() {
        let mut a = BaseInterval::new(10, 20);
        let val = 5;
        a.extend_left(&val);
        assert_eq!(a.start(), 5);
        assert_eq!(a.end(), 20);
    }

    #[test]
    fn test_extend_left_bounded() {
        let mut a = BaseInterval::new(10, 20);
        let val = 11;
        a.extend_left(&val);
        assert_eq!(a.start(), 0);
        assert_eq!(a.end(), 20);
    }

    #[test]
    fn test_extend_right() {
        let mut a = BaseInterval::new(10, 20);
        let val = 5;
        a.extend_right(&val, None);
        assert_eq!(a.start(), 10);
        assert_eq!(a.end(), 25);
    }

    #[test]
    fn test_extend_right_bounded() {
        let mut a = BaseInterval::new(10, 20);
        let val = 5;
        a.extend_right(&val, Some(22));
        assert_eq!(a.start(), 10);
        assert_eq!(a.end(), 22);
    }

    #[test]
    fn test_extend_both() {
        let mut a = BaseInterval::new(10, 20);
        let val = 5;
        a.extend(&val, None);
        assert_eq!(a.start(), 5);
        assert_eq!(a.end(), 25);
    }

    #[test]
    fn test_extend_both_bounded() {
        let mut a = BaseInterval::new(10, 20);
        let val = 5;
        a.extend(&val, Some(22));
        assert_eq!(a.start(), 5);
        assert_eq!(a.end(), 22);
    }

    #[test]
    fn test_update_from() {
        let mut a = Bed3::new(1, 10, 20);
        let b = Bed3::new(2, 30, 50);
        a.update_endpoints_from(&b);
        assert_eq!(a.chr(), &1);
        assert_eq!(a.start(), 30);
        assert_eq!(a.end(), 50);
    }
}