use core::cmp::{Ordering, PartialEq, PartialOrd};
use core::ops::{Add, BitAnd, BitOr, BitXor, Mul, Not, Sub};

use num_traits::{One, Zero};

use super::Set;
use crate::traits::{Afi, AfiClass, PrefixSet as _};

impl<A: Afi> Zero for Set<A> {
    fn zero() -> Self {
        Self::new()
    }

    fn is_zero(&self) -> bool {
        self.root.is_some()
    }
}

impl<A: Afi> One for Set<A> {
    fn one() -> Self {
        Self::new()
            .insert(<A as AfiClass>::PrefixRange::ALL)
            .clone()
    }
}

impl<A: Afi> BitAnd for Set<A> {
    type Output = Self;

    fn bitand(self, rhs: Self) -> Self::Output {
        match (self.root, rhs.root) {
            (Some(r), Some(s)) => Self::Output::new_with_root(r & s).aggregate().clone(),
            _ => Self::Output::zero(),
        }
    }
}

impl<A: Afi> BitOr for Set<A> {
    type Output = Self;

    fn bitor(self, rhs: Self) -> Self::Output {
        match (&self.root, &rhs.root) {
            (Some(r), Some(s)) => Self::Output::new_with_root(r.clone() | s.clone())
                .aggregate()
                .clone(),
            (Some(_), None) => self,
            (None, Some(_)) => rhs,
            (None, None) => Self::Output::zero(),
        }
    }
}

impl<A: Afi> BitXor for Set<A> {
    type Output = Self;

    fn bitxor(self, rhs: Self) -> Self::Output {
        (self.clone() | rhs.clone()) - (self & rhs)
    }
}

impl<A: Afi> Not for Set<A> {
    type Output = Self;

    fn not(self) -> Self::Output {
        Self::Output::one() - self
    }
}

impl<A: Afi> Add for Set<A> {
    type Output = Self;

    #[allow(clippy::suspicious_arithmetic_impl)]
    fn add(self, rhs: Self) -> Self::Output {
        self | rhs
    }
}

impl<A: Afi> Sub for Set<A> {
    type Output = Self;

    fn sub(self, rhs: Self) -> Self::Output {
        match (&self.root, &rhs.root) {
            (Some(r), Some(s)) => Self::Output::new_with_root(r.clone() - s.clone())
                .aggregate()
                .clone(),
            _ => self,
        }
    }
}

impl<A: Afi> Mul for Set<A> {
    type Output = Self;

    #[allow(clippy::suspicious_arithmetic_impl)]
    fn mul(self, rhs: Self) -> Self::Output {
        self & rhs
    }
}

impl<A: Afi> PartialEq for Set<A> {
    fn eq(&self, other: &Self) -> bool {
        match (&self.root, &other.root) {
            (Some(r), Some(s)) => r.children().zip(s.children()).all(|(m, n)| m == n),
            (None, None) => true,
            _ => false,
        }
    }
}

impl<A: Afi> PartialOrd for Set<A> {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        if self == other {
            Some(Ordering::Equal)
        } else if self.prefixes().all(|p| other.contains(p)) {
            Some(Ordering::Less)
        } else if other.prefixes().all(|p| self.contains(p)) {
            Some(Ordering::Greater)
        } else {
            None
        }
    }
}

impl<A: Afi> Eq for Set<A> {}

#[cfg(test)]
mod tests {
    use core::str::FromStr;
    use std::{dbg, vec};

    use paste::paste;

    use super::super::Node;
    use super::*;
    use crate::{
        concrete::{Prefix, PrefixRange},
        error::{Error, TestResult},
        Ipv4, Ipv6,
    };

    impl<A: Afi> FromIterator<&'static str> for Set<A> {
        fn from_iter<T: IntoIterator<Item = &'static str>>(iter: T) -> Self {
            enum Insertable<A: Afi> {
                Prefix(Prefix<A>),
                Range(PrefixRange<A>),
            }
            impl<A: Afi> FromStr for Insertable<A> {
                type Err = Error;
                fn from_str(s: &str) -> Result<Self, Self::Err> {
                    s.parse()
                        .map(Insertable::Range)
                        .or_else(|_| s.parse().map(Insertable::Prefix))
                }
            }
            #[allow(clippy::from_over_into)]
            impl<A: Afi> Into<Node<A>> for Insertable<A> {
                fn into(self) -> Node<A> {
                    match self {
                        Self::Prefix(prefix) => prefix.into(),
                        Self::Range(range) => range.into(),
                    }
                }
            }
            iter.into_iter()
                .map(Insertable::from_str)
                .collect::<Result<_, _>>()
                .unwrap()
        }
    }

    macro_rules! test_exprs {
        ( $($fn_id:ident {$lhs:expr, $rhs:expr});* ) => {
            test_exprs!(@ipv4 {$($fn_id {$lhs, $rhs});*});
            test_exprs!(@ipv6 {$($fn_id {$lhs, $rhs});*});
        };
        ( @ipv4 {$($fn_id:ident {$lhs:expr, $rhs:expr});*} ) => {
            paste! {
                test_exprs!($(Ipv4 => [<ipv4_ $fn_id>] {$lhs, $rhs});*);
            }
        };
        ( @ipv6 {$($fn_id:ident {$lhs:expr, $rhs:expr});*} ) => {
            paste! {
                test_exprs!($(Ipv6 => [<ipv6_ $fn_id>] {$lhs, $rhs});*);
            }
        };
        ( $($p:ty => $fn_id:ident {$lhs:expr, $rhs:expr});* ) => {
            paste! {
                $(
                    #[test]
                    fn $fn_id() -> TestResult {
                        let res: Set<$p> = dbg!($lhs);
                        assert_eq!(res, dbg!($rhs));
                        Ok(())
                    }
                )*
            }
        };
    }

    macro_rules! test_unary_op {
        ( $( !$operand:ident == $expect:ident),* ) => {
            test_unary_op!(@call $(not $operand == $expect),*);
        };
        ( @call $($op:ident $operand:ident == $expect:ident),* ) => {
            paste! {
                test_exprs!($(
                    [<$op _ $operand _is_ $expect>] {
                        Set::$operand().$op(),
                        Set::$expect()
                    }
                );*);
            }
        }
    }

    macro_rules! test_binary_op {
        ( $($lhs:ident & $rhs:ident == $expect:ident),* ) => {
            test_binary_op!(@call $($lhs bitand $rhs == $expect),*);
        };
        ( $($lhs:ident | $rhs:ident == $expect:ident),* ) => {
            test_binary_op!(@call $($lhs bitor $rhs == $expect),*);
        };
        ( $($lhs:ident ^ $rhs:ident == $expect:ident),* ) => {
            test_binary_op!(@call $($lhs bitxor $rhs == $expect),*);
        };
        ( $($lhs:ident + $rhs:ident == $expect:ident),* ) => {
            test_binary_op!(@call $($lhs add $rhs == $expect),*);
        };
        ( $($lhs:ident - $rhs:ident == $expect:ident),* ) => {
            test_binary_op!(@call $($lhs sub $rhs == $expect),*);
        };
        ( $($lhs:ident * $rhs:ident == $expect:ident),* ) => {
            test_binary_op!(@call $($lhs mul $rhs == $expect),*);
        };
        ( @call $($lhs:ident $op:ident $rhs:ident == $expect:ident),* ) => {
            paste! {
                test_exprs!($(
                    [<$lhs _ $op _ $rhs _is_ $expect>] {
                        Set::$lhs().$op(Set::$rhs()),
                        Set::$expect()
                    }
                );*);
            }
        }
    }

    #[test]
    fn ipv4_zero_set_is_empty() {
        assert_eq!(Set::<Ipv4>::zero().prefixes().count(), 0);
    }

    #[test]
    fn ipv6_zero_set_is_empty() {
        assert_eq!(Set::<Ipv6>::zero().prefixes().count(), 0);
    }

    test_unary_op!(!zero == one, !one == zero);

    test_binary_op!(
        zero & zero == zero,
        zero & one == zero,
        one & zero == zero,
        one & one == one
    );

    test_binary_op!(
        zero | zero == zero,
        zero | one == one,
        one | zero == one,
        one | one == one
    );

    test_binary_op!(
        zero ^ zero == zero,
        zero ^ one == one,
        one ^ zero == one,
        one ^ one == zero
    );

    test_binary_op!(
        zero + zero == zero,
        zero + one == one,
        one + zero == one,
        one + one == one
    );

    test_binary_op!(
        zero - zero == zero,
        zero - one == zero,
        one - zero == one,
        one - one == zero
    );

    test_binary_op!(
        zero * zero == zero,
        zero * one == zero,
        one * zero == zero,
        one * one == one
    );

    test_exprs!( @ipv4 {
        intersect_disjoint_nodes {
            vec!["1.0.0.0/8,8,16"].into_iter().collect::<Set<_>>()
                & vec!["2.0.0.0/8,8,16"].into_iter().collect(),
            Set::zero()
        };
        intersect_disjoint_ranges {
            vec!["1.0.0.0/8,8,11"].into_iter().collect::<Set<_>>()
                & vec!["1.0.0.0/8,12,15"].into_iter().collect(),
            Set::zero()
        };
        intersect_overlapping_nodes {
            vec!["1.0.0.0/8,12,16"].into_iter().collect::<Set<_>>()
                & vec!["1.0.0.0/12,12,16"].into_iter().collect(),
            vec!["1.0.0.0/12,12,16"].into_iter().collect()
        };
        intersect_overlapping_ranges {
            vec!["1.0.0.0/8,8,12"].into_iter().collect::<Set<_>>()
                & vec!["1.0.0.0/8,12,16"].into_iter().collect(),
            vec!["1.0.0.0/8,12,12"].into_iter().collect()
        };
        intersect_overlapping_set_with_parent {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                & vec!["1.0.0.0/16"].into_iter().collect(),
            vec!["1.0.0.0/16"].into_iter().collect()
        };
        intersect_overlapping_set_with_sibling {
            vec!["1.0.0.0/8", "2.0.0.0/8"].into_iter().collect::<Set<_>>()
                & vec!["1.0.0.0/8"].into_iter().collect(),
            vec!["1.0.0.0/8"].into_iter().collect()
        };
        intersect_overlapping_set_with_child {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                & vec!["1.0.0.0/8"].into_iter().collect(),
            vec!["1.0.0.0/8"].into_iter().collect()
        };
        intersect_covering_parent {
            vec!["1.0.0.0/16"].into_iter().collect::<Set<_>>()
                & vec!["1.0.0.0/8,16,16"].into_iter().collect(),
            vec!["1.0.0.0/16"].into_iter().collect()
        };
        intersect_covered_child {
            vec!["1.0.0.0/8,16,16"].into_iter().collect::<Set<_>>()
                & vec!["1.0.0.0/16"].into_iter().collect(),
            vec!["1.0.0.0/16"].into_iter().collect()
        };
        intersect_overlapping_set_with_covered_child {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                & vec!["1.0.0.0/8,16,16"].into_iter().collect(),
            vec!["1.0.0.0/16"].into_iter().collect()
        };
        union_disjoint_nodes {
            vec!["2.0.0.0/8,8,16"].into_iter().collect::<Set<_>>()
                | vec!["3.0.0.0/8,8,16"].into_iter().collect(),
            vec!["2.0.0.0/7,8,16"].into_iter().collect()
        };
        union_disjoint_ranges {
            vec!["1.0.0.0/8,8,11"].into_iter().collect::<Set<_>>()
                | vec!["1.0.0.0/8,12,15"].into_iter().collect(),
            vec!["1.0.0.0/8,8,15"].into_iter().collect()
        };
        union_overlapping_nodes {
            vec!["1.0.0.0/8,12,16"].into_iter().collect::<Set<_>>()
                | vec!["1.0.0.0/12,12,16"].into_iter().collect(),
            vec!["1.0.0.0/8,12,16"].into_iter().collect()
        };
        union_overlapping_ranges {
            vec!["1.0.0.0/8,8,12"].into_iter().collect::<Set<_>>()
                | vec!["1.0.0.0/8,12,16"].into_iter().collect(),
            vec!["1.0.0.0/8,8,16"].into_iter().collect()
        };
        union_overlapping_set_with_parent {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                | vec!["1.0.0.0/16"].into_iter().collect(),
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect()
        };
        union_overlapping_set_with_sibling {
            vec!["1.0.0.0/8", "2.0.0.0/8"].into_iter().collect::<Set<_>>()
                | vec!["1.0.0.0/8"].into_iter().collect(),
            vec!["1.0.0.0/8", "2.0.0.0/8"].into_iter().collect()
        };
        union_overlapping_set_with_child {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                | vec!["1.0.0.0/8"].into_iter().collect(),
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect()
        };
        union_covering_parent {
            vec!["1.0.0.0/16"].into_iter().collect::<Set<_>>()
                | vec!["1.0.0.0/8,16,16"].into_iter().collect(),
            vec!["1.0.0.0/8,16,16"].into_iter().collect()
        };
        union_covered_child {
            vec!["1.0.0.0/8,16,16"].into_iter().collect::<Set<_>>()
                | vec!["1.0.0.0/16"].into_iter().collect(),
            vec!["1.0.0.0/8,16,16"].into_iter().collect()
        };
        union_overlapping_set_with_covered_child {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                | vec!["1.0.0.0/8,16,16"].into_iter().collect(),
            vec!["1.0.0.0/8", "1.0.0.0/8,16,16"].into_iter().collect()
        };
        xor_disjoint_nodes {
            vec!["2.0.0.0/8,8,16"].into_iter().collect::<Set<_>>()
                ^ vec!["3.0.0.0/8,8,16"].into_iter().collect(),
            vec!["2.0.0.0/7,8,16"].into_iter().collect()
        };
        xor_disjoint_ranges {
            vec!["1.0.0.0/8,8,11"].into_iter().collect::<Set<_>>()
                ^ vec!["1.0.0.0/8,12,15"].into_iter().collect(),
            vec!["1.0.0.0/8,8,15"].into_iter().collect()
        };
        xor_overlapping_nodes {
            vec!["1.0.0.0/8,12,16"].into_iter().collect::<Set<_>>()
                ^ vec!["1.0.0.0/12,12,16"].into_iter().collect(),
            vec![
                "1.16.0.0/12,12,16",
                "1.32.0.0/11,12,16",
                "1.64.0.0/10,12,16",
                "1.128.0.0/9,12,16"
            ].into_iter().collect()
        };
        xor_overlapping_ranges {
            vec!["1.0.0.0/8,8,12"].into_iter().collect::<Set<_>>()
                ^ vec!["1.0.0.0/8,12,16"].into_iter().collect(),
            vec!["1.0.0.0/8,8,11", "1.0.0.0/8,13,16"].into_iter().collect()
        };
        xor_overlapping_set_with_parent {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                ^ vec!["1.0.0.0/16"].into_iter().collect(),
            vec!["1.0.0.0/8"].into_iter().collect()
        };
        xor_overlapping_set_with_sibling {
            vec!["1.0.0.0/8", "2.0.0.0/8"].into_iter().collect::<Set<_>>()
                ^ vec!["1.0.0.0/8"].into_iter().collect(),
            vec!["2.0.0.0/8"].into_iter().collect()
        };
        xor_overlapping_set_with_child {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                ^ vec!["1.0.0.0/8"].into_iter().collect(),
            vec!["1.0.0.0/16"].into_iter().collect()
        };
        xor_covering_parent {
            vec!["1.0.0.0/16"].into_iter().collect::<Set<_>>()
                ^ vec!["1.0.0.0/8,16,16"].into_iter().collect(),
            vec![
                "1.1.0.0/16",
                "1.2.0.0/15,16,16",
                "1.4.0.0/14,16,16",
                "1.8.0.0/13,16,16",
                "1.16.0.0/12,16,16",
                "1.32.0.0/11,16,16",
                "1.64.0.0/10,16,16",
                "1.128.0.0/9,16,16",
            ].into_iter().collect()
        };
        xor_covered_child {
            vec!["1.0.0.0/8,16,16"].into_iter().collect::<Set<_>>()
                ^ vec!["1.0.0.0/16"].into_iter().collect(),
            vec![
                "1.1.0.0/16",
                "1.2.0.0/15,16,16",
                "1.4.0.0/14,16,16",
                "1.8.0.0/13,16,16",
                "1.16.0.0/12,16,16",
                "1.32.0.0/11,16,16",
                "1.64.0.0/10,16,16",
                "1.128.0.0/9,16,16",
            ].into_iter().collect()
        };
        xor_overlapping_set_with_covered_child {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                ^ vec!["1.0.0.0/8,16,16"].into_iter().collect(),
            vec!["1.0.0.0/8"].into_iter().collect()
        };
        sub_disjoint_nodes {
            vec!["2.0.0.0/8,8,16"].into_iter().collect::<Set<_>>()
                - vec!["3.0.0.0/8,8,16"].into_iter().collect(),
            vec!["2.0.0.0/8,8,16"].into_iter().collect()
        };
        sub_disjoint_ranges {
            vec!["1.0.0.0/8,8,11"].into_iter().collect::<Set<_>>()
                - vec!["1.0.0.0/8,12,15"].into_iter().collect(),
            vec!["1.0.0.0/8,8,11"].into_iter().collect()
        };
        sub_overlapping_nodes {
            vec!["1.0.0.0/8,12,16"].into_iter().collect::<Set<_>>()
                - vec!["1.0.0.0/12,12,16"].into_iter().collect(),
            vec![
                "1.16.0.0/12,12,16",
                "1.32.0.0/11,12,16",
                "1.64.0.0/10,12,16",
                "1.128.0.0/9,12,16"
            ].into_iter().collect()
        };
        sub_overlapping_ranges {
            vec!["1.0.0.0/8,8,12"].into_iter().collect::<Set<_>>()
                - vec!["1.0.0.0/8,12,16"].into_iter().collect(),
            vec!["1.0.0.0/8,8,11"].into_iter().collect()
        };
        sub_overlapping_set_with_parent {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                - vec!["1.0.0.0/16"].into_iter().collect(),
            vec!["1.0.0.0/8"].into_iter().collect()
        };
        sub_overlapping_set_with_sibling {
            vec!["1.0.0.0/8", "2.0.0.0/8"].into_iter().collect::<Set<_>>()
                - vec!["1.0.0.0/8"].into_iter().collect(),
            vec!["2.0.0.0/8"].into_iter().collect()
        };
        sub_overlapping_set_with_child {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                - vec!["1.0.0.0/8"].into_iter().collect(),
            vec!["1.0.0.0/16"].into_iter().collect()
        };
        sub_covering_parent {
            vec!["1.0.0.0/16"].into_iter().collect::<Set<_>>()
                - vec!["1.0.0.0/8,16,16"].into_iter().collect(),
            Set::zero()
        };
        sub_covered_child {
            vec!["1.0.0.0/8,16,16"].into_iter().collect::<Set<_>>()
                - vec!["1.0.0.0/16"].into_iter().collect(),
            vec![
                "1.1.0.0/16",
                "1.2.0.0/15,16,16",
                "1.4.0.0/14,16,16",
                "1.8.0.0/13,16,16",
                "1.16.0.0/12,16,16",
                "1.32.0.0/11,16,16",
                "1.64.0.0/10,16,16",
                "1.128.0.0/9,16,16",
            ].into_iter().collect()
        };
        sub_overlapping_set_with_covered_child {
            vec!["1.0.0.0/8", "1.0.0.0/16"].into_iter().collect::<Set<_>>()
                - vec!["1.0.0.0/8,16,16"].into_iter().collect(),
            vec![
                "1.0.0.0/8",
                "1.1.0.0/16",
                "1.2.0.0/15,16,16",
                "1.4.0.0/14,16,16",
                "1.8.0.0/13,16,16",
                "1.16.0.0/12,16,16",
                "1.32.0.0/11,16,16",
                "1.64.0.0/10,16,16",
                "1.128.0.0/9,16,16",
            ].into_iter().collect()
        };
        sub_complex_deaggregation {
            vec!["2.0.0.0/8,8,10", "3.0.0.0/8,8,9"].into_iter().collect::<Set<_>>()
                - vec!["2.0.0.0/10", "3.0.0.0/8,8,10"].into_iter().collect(),
            vec![
                "2.0.0.0/8,8,9",
                "2.64.0.0/10",
                "2.128.0.0/10",
                "2.192.0.0/10",
            ].into_iter().collect()
        };
        not_singleton {
            ! vec!["1.0.0.0/8"].into_iter().collect::<Set<_>>(),
            vec![
                "0.0.0.0/0,0,7",
                "0.0.0.0/0,9,32",
                "0.0.0.0/8",
                "2.0.0.0/7,8,8",
                "4.0.0.0/6,8,8",
                "8.0.0.0/5,8,8",
                "16.0.0.0/4,8,8",
                "32.0.0.0/3,8,8",
                "64.0.0.0/2,8,8",
                "128.0.0.0/1,8,8"
            ].into_iter().collect()
        };
        not_range {
            ! vec!["1.0.0.0/8,8,16"].into_iter().collect::<Set<_>>(),
            vec![
                "0.0.0.0/0,0,7",
                "0.0.0.0/0,17,32",
                "0.0.0.0/8,8,16",
                "2.0.0.0/7,8,16",
                "4.0.0.0/6,8,16",
                "8.0.0.0/5,8,16",
                "16.0.0.0/4,8,16",
                "32.0.0.0/3,8,16",
                "64.0.0.0/2,8,16",
                "128.0.0.0/1,8,16",
            ].into_iter().collect()
        }
    });
}