use std::collections::{BTreeSet, HashSet};

use deserr::{DeserializeError, Deserr, ValuePointerRef};
use serde::{Deserialize, Serialize};
use utoipa::ToSchema;

use crate::attribute_patterns::{match_distinct_field, match_field_legacy, PatternMatch};
use crate::constants::{RESERVED_GEOJSON_FIELD_NAME, RESERVED_GEO_FIELD_NAME};
use crate::AttributePatterns;

#[derive(Serialize, Deserialize, PartialEq, Eq, Clone, Debug, ToSchema)]
#[serde(untagged)]
pub enum FilterableAttributesRule {
    Field(String),
    Pattern(FilterableAttributesPatterns),
}

// deserr hard to implement here
impl routes::RequestBody for FilterableAttributesRule {}

impl FilterableAttributesRule {
    /// Match a field against the filterable attributes rule.
    pub fn match_str(&self, field: &str) -> PatternMatch {
        match self {
            // If the rule is a field, match the field against the pattern using the legacy behavior
            FilterableAttributesRule::Field(pattern) => match_field_legacy(pattern, field),
            // If the rule is a pattern, match the field against the pattern using the new behavior
            FilterableAttributesRule::Pattern(patterns) => patterns.match_str(field),
        }
    }

    /// Check if the rule is a geo field.
    ///
    /// prefer using `index.is_geo_enabled`, `index.is_geo_filtering_enabled`
    /// or `index.is_geo_sorting_enabled` to check if the geo feature is
    /// enabled.
    pub fn has_geo(&self) -> bool {
        matches!(self, FilterableAttributesRule::Field(field_name) if field_name == RESERVED_GEO_FIELD_NAME)
    }

    pub fn has_geojson(&self) -> bool {
        matches!(self, FilterableAttributesRule::Field(field_name) if field_name == RESERVED_GEOJSON_FIELD_NAME)
    }

    /// Get the features of the rule.
    pub fn features(&self) -> FilterableAttributesFeatures {
        match self {
            // If the rule is a field, return the legacy default features
            FilterableAttributesRule::Field(_) => FilterableAttributesFeatures::legacy_default(),
            // If the rule is a pattern, return the features of the pattern
            FilterableAttributesRule::Pattern(patterns) => patterns.features(),
        }
    }
}

/// Defines a set of attribute patterns with specific filtering and faceting
/// features. This allows fine-grained control over which operations are
/// allowed on matched attributes.
#[derive(Serialize, Deserialize, PartialEq, Eq, Clone, Debug, Deserr, ToSchema)]
#[serde(deny_unknown_fields, rename_all = "camelCase")]
#[deserr(rename_all = camelCase, deny_unknown_fields)]
pub struct FilterableAttributesPatterns {
    /// Patterns to match attribute names. Use `*` as a wildcard to match any
    /// characters. For example, `["price_*", "stock"]` matches `price_usd`,
    /// `price_eur`, and `stock`.
    #[schema(value_type = Vec<String>)]
    pub attribute_patterns: AttributePatterns,
    /// The filtering and faceting features enabled for attributes matching
    /// these patterns. If not specified, defaults to equality filtering
    /// enabled.
    #[serde(default)]
    #[deserr(default)]
    pub features: FilterableAttributesFeatures,
}

impl FilterableAttributesPatterns {
    pub fn match_str(&self, field: &str) -> PatternMatch {
        self.attribute_patterns.match_str(field)
    }

    pub fn features(&self) -> FilterableAttributesFeatures {
        self.features
    }
}

/// Controls which filtering and faceting operations are enabled for matching
/// attributes. This allows restricting certain operations on specific fields
/// for security or performance reasons.
#[derive(Serialize, Deserialize, PartialEq, Eq, Clone, Copy, Debug, Deserr, ToSchema)]
#[serde(deny_unknown_fields, rename_all = "camelCase")]
#[deserr(rename_all = camelCase, deny_unknown_fields)]
#[derive(Default)]
pub struct FilterableAttributesFeatures {
    /// When `true`, allows searching within facet values for matching
    /// attributes. This enables the facet search feature which lets users
    /// search for specific facet values. Defaults to `false`.
    #[serde(default)]
    #[deserr(default)]
    pub facet_search: bool,
    /// Controls which filter operators are allowed for matching attributes.
    /// See `FilterFeatures` for available options.
    #[serde(default)]
    #[deserr(default)]
    pub filter: FilterFeatures,
}

impl FilterableAttributesFeatures {
    /// Create a new `FilterableAttributesFeatures` with the legacy default
    /// features.
    ///
    /// This is the default behavior for `FilterableAttributesRule::Field`.
    /// This will set the facet search to true and activate all the filter
    /// operators.
    pub fn legacy_default() -> Self {
        Self { facet_search: true, filter: FilterFeatures::legacy_default() }
    }

    /// Create a new `FilterableAttributesFeatures` with no features.
    pub fn no_features() -> Self {
        Self { facet_search: false, filter: FilterFeatures::no_features() }
    }

    pub fn is_filterable(&self) -> bool {
        self.filter.is_filterable()
    }

    /// Check if `IS EMPTY` is allowed
    pub fn is_filterable_empty(&self) -> bool {
        self.filter.is_filterable_empty()
    }

    /// Check if `=` and `IN` are allowed
    pub fn is_filterable_equality(&self) -> bool {
        self.filter.is_filterable_equality()
    }

    /// Check if `IS NULL` is allowed
    pub fn is_filterable_null(&self) -> bool {
        self.filter.is_filterable_null()
    }

    /// Check if `EXISTS` is allowed
    pub fn is_filterable_exists(&self) -> bool {
        self.filter.is_filterable_exists()
    }

    /// Check if `<`, `>`, `<=`, `>=` or `TO` are allowed
    pub fn is_filterable_comparison(&self) -> bool {
        self.filter.is_filterable_comparison()
    }

    /// Check if the facet search is allowed
    pub fn is_facet_searchable(&self) -> bool {
        self.facet_search
    }

    pub fn allowed_filter_operators(&self) -> Vec<String> {
        self.filter.allowed_operators()
    }
}

impl<E: DeserializeError> Deserr<E> for FilterableAttributesRule {
    fn deserialize_from_value<V: deserr::IntoValue>(
        value: deserr::Value<V>,
        location: ValuePointerRef,
    ) -> Result<Self, E> {
        if value.kind() == deserr::ValueKind::Map {
            Ok(Self::Pattern(FilterableAttributesPatterns::deserialize_from_value(
                value, location,
            )?))
        } else {
            Ok(Self::Field(String::deserialize_from_value(value, location)?))
        }
    }
}

/// Controls which filter operators are allowed for an attribute. This
/// provides fine-grained control over filtering capabilities.
#[derive(Serialize, Deserialize, PartialEq, Eq, Clone, Copy, Debug, Deserr, ToSchema)]
#[serde(deny_unknown_fields, rename_all = "camelCase")]
#[deserr(rename_all = camelCase, deny_unknown_fields)]
pub struct FilterFeatures {
    /// When `true`, enables equality operators: `=`, `!=`, and `IN`. These
    /// allow filtering for exact matches or membership in a set of values.
    /// Also enables `IS EMPTY`, `IS NULL`, and `EXISTS` operators. Defaults
    /// to `true`.
    #[serde(default = "default_true")]
    #[deserr(default = true)]
    pub equality: bool,
    /// When `true`, enables comparison operators: `<`, `>`, `<=`, `>=`, and
    /// `TO` (range). These allow filtering based on numeric or string
    /// comparisons. Defaults to `false`.
    #[serde(default)]
    #[deserr(default)]
    pub comparison: bool,
}

fn default_true() -> bool {
    true
}

impl FilterFeatures {
    /// Get the allowed operators for the filter.
    pub fn allowed_operators(&self) -> Vec<String> {
        if !self.is_filterable() {
            return vec![];
        }

        let mut operators = vec!["OR", "AND", "NOT"];
        if self.is_filterable_equality() {
            operators.extend_from_slice(&["=", "!=", "IN"]);
        }
        if self.is_filterable_comparison() {
            operators.extend_from_slice(&["<", ">", "<=", ">=", "TO"]);
        }
        if self.is_filterable_empty() {
            operators.push("IS EMPTY");
        }
        if self.is_filterable_null() {
            operators.push("IS NULL");
        }
        if self.is_filterable_exists() {
            operators.push("EXISTS");
        }

        operators.into_iter().map(String::from).collect()
    }

    pub fn is_filterable(&self) -> bool {
        self.equality || self.comparison
    }

    pub fn is_filterable_equality(&self) -> bool {
        self.equality
    }

    /// Check if `<`, `>`, `<=`, `>=` or `TO` are allowed
    pub fn is_filterable_comparison(&self) -> bool {
        self.comparison
    }

    /// Check if `IS EMPTY` is allowed
    pub fn is_filterable_empty(&self) -> bool {
        self.is_filterable()
    }

    /// Check if `IS EXISTS` is allowed
    pub fn is_filterable_exists(&self) -> bool {
        self.is_filterable()
    }

    /// Check if `IS NULL` is allowed
    pub fn is_filterable_null(&self) -> bool {
        self.is_filterable()
    }

    /// Create a new `FilterFeatures` with the legacy default features.
    ///
    /// This is the default behavior for `FilterableAttributesRule::Field`.
    /// This will set the equality and comparison to true.
    pub fn legacy_default() -> Self {
        Self { equality: true, comparison: true }
    }

    /// Create a new `FilterFeatures` with no features.
    pub fn no_features() -> Self {
        Self { equality: false, comparison: false }
    }
}

impl Default for FilterFeatures {
    fn default() -> Self {
        Self { equality: true, comparison: false }
    }
}

/// Match a field against a set of filterable attributes rules.
///
/// This function will return the set of patterns that match the given
/// filter.
///
/// # Arguments
///
/// * `filterable_attributes` - The set of filterable attributes rules to
///   match against.
/// * `filter` - The filter function to apply to the filterable attributes
///   rules.
pub fn filtered_matching_patterns<'patterns>(
    filterable_attributes: &'patterns [FilterableAttributesRule],
    filter: &impl Fn(FilterableAttributesFeatures) -> bool,
) -> BTreeSet<&'patterns str> {
    let mut result = BTreeSet::new();

    for rule in filterable_attributes {
        if filter(rule.features()) {
            match rule {
                FilterableAttributesRule::Field(field) => {
                    result.insert(field.as_str());
                }
                FilterableAttributesRule::Pattern(patterns) => {
                    patterns.attribute_patterns.patterns.iter().for_each(|pattern| {
                        result.insert(pattern);
                    });
                }
            }
        }
    }

    result
}

/// Match a field against a set of filterable attributes rules.
///
/// This function will return the features that match the given field name.
///
/// # Arguments
///
/// * `field_name` - The field name to match against.
/// * `filterable_attributes` - The set of filterable attributes rules to
///   match against.
///
/// # Returns
///
/// * `Some((rule_index, features))` - The features of the matching rule and
///   the index of the rule in the `filterable_attributes` array.
/// * `None` - No matching rule was found.
pub fn matching_features(
    field_name: &str,
    filterable_attributes: &[FilterableAttributesRule],
) -> Option<(usize, FilterableAttributesFeatures)> {
    for (id, filterable_attribute) in filterable_attributes.iter().enumerate() {
        if filterable_attribute.match_str(field_name) == PatternMatch::Match {
            return Some((id, filterable_attribute.features()));
        }
    }
    None
}

/// Match a field against a set of filterable, facet searchable fields,
/// distinct field, sortable fields, and asc_desc fields.
pub fn match_faceted_field(
    field_name: &str,
    filterable_fields: &[FilterableAttributesRule],
    sortable_fields: &HashSet<String>,
    asc_desc_fields: &HashSet<String>,
    distinct_field: &Option<String>,
) -> PatternMatch {
    // Check if the field matches any filterable or facet searchable field
    let mut selection = match_pattern_by_features(field_name, filterable_fields, &|features| {
        features.is_facet_searchable() || features.is_filterable()
    });

    // If the field matches the pattern, return Match
    if selection == PatternMatch::Match {
        return selection;
    }

    match match_distinct_field(distinct_field.as_deref(), field_name) {
        PatternMatch::Match => return PatternMatch::Match,
        PatternMatch::Parent => selection = PatternMatch::Parent,
        PatternMatch::NoMatch => (),
    }

    // Otherwise, check if the field matches any sortable/asc_desc field
    for pattern in sortable_fields.iter().chain(asc_desc_fields.iter()) {
        match match_field_legacy(pattern, field_name) {
            PatternMatch::Match => return PatternMatch::Match,
            PatternMatch::Parent => selection = PatternMatch::Parent,
            PatternMatch::NoMatch => (),
        }
    }

    selection
}

fn match_pattern_by_features(
    field_name: &str,
    filterable_attributes: &[FilterableAttributesRule],
    filter: &impl Fn(FilterableAttributesFeatures) -> bool,
) -> PatternMatch {
    let mut selection = PatternMatch::NoMatch;

    // `can_match` becomes false if the field name matches (PatternMatch::Match) any pattern that is not facet searchable or filterable,
    // this ensures that the field doesn't match a pattern with a lower priority, however it can still match a pattern for a nested field as a parent (PatternMatch::Parent).
    // See the test `search::filters::test_filterable_attributes_priority` for more details.
    let mut can_match = true;

    // Check if the field name matches any pattern that is facet searchable or filterable
    for pattern in filterable_attributes {
        match pattern.match_str(field_name) {
            PatternMatch::Match => {
                let features = pattern.features();
                if filter(features) && can_match {
                    return PatternMatch::Match;
                } else {
                    can_match = false;
                }
            }
            PatternMatch::Parent => {
                let features = pattern.features();
                if filter(features) {
                    selection = PatternMatch::Parent;
                }
            }
            PatternMatch::NoMatch => (),
        }
    }

    selection
}
