use std::collections::{BTreeMap, HashSet};
use std::ops::Bound::Unbounded;
use std::{cmp, fmt, mem};

use heed::types::{ByteSlice, Unit};
use heed::{BytesDecode, Database};
use roaring::RoaringBitmap;

use crate::error::{FieldIdMapMissingEntry, UserError};
use crate::facet::FacetType;
use crate::heed_codec::facet::FacetStringLevelZeroCodec;
use crate::search::facet::{FacetNumberIter, FacetNumberRange, FacetStringIter};
use crate::{DocumentId, FieldId, Index, Result};

/// The default number of values by facets that will
/// be fetched from the key-value store.
const DEFAULT_VALUES_BY_FACET: usize = 100;

/// The hard limit in the number of values by facets that will be fetched from
/// the key-value store. Searching for more values could slow down the engine.
const MAX_VALUES_BY_FACET: usize = 1000;

/// Threshold on the number of candidates that will make
/// the system to choose between one algorithm or another.
const CANDIDATES_THRESHOLD: u64 = 35_000;

pub struct FacetDistribution<'a> {
    facets: Option<HashSet<String>>,
    candidates: Option<RoaringBitmap>,
    max_values_by_facet: usize,
    rtxn: &'a heed::RoTxn<'a>,
    index: &'a Index,
}

impl<'a> FacetDistribution<'a> {
    pub fn new(rtxn: &'a heed::RoTxn, index: &'a Index) -> FacetDistribution<'a> {
        FacetDistribution {
            facets: None,
            candidates: None,
            max_values_by_facet: DEFAULT_VALUES_BY_FACET,
            rtxn,
            index,
        }
    }

    pub fn facets<I: IntoIterator<Item = A>, A: AsRef<str>>(&mut self, names: I) -> &mut Self {
        self.facets = Some(names.into_iter().map(|s| s.as_ref().to_string()).collect());
        self
    }

    pub fn candidates(&mut self, candidates: RoaringBitmap) -> &mut Self {
        self.candidates = Some(candidates);
        self
    }

    pub fn max_values_by_facet(&mut self, max: usize) -> &mut Self {
        self.max_values_by_facet = cmp::min(max, MAX_VALUES_BY_FACET);
        self
    }

    /// There is a small amount of candidates OR we ask for facet string values so we
    /// decide to iterate over the facet values of each one of them, one by one.
    fn facet_distribution_from_documents(
        &self,
        field_id: FieldId,
        facet_type: FacetType,
        candidates: &RoaringBitmap,
        distribution: &mut BTreeMap<String, u64>,
    ) -> heed::Result<()> {
        fn fetch_facet_values<'t, KC, K: 't>(
            rtxn: &'t heed::RoTxn,
            db: Database<KC, Unit>,
            field_id: FieldId,
            candidates: &RoaringBitmap,
            distribution: &mut BTreeMap<String, u64>,
        ) -> heed::Result<()>
        where
            K: fmt::Display,
            KC: BytesDecode<'t, DItem = (FieldId, DocumentId, K)>,
        {
            let mut key_buffer: Vec<_> = field_id.to_be_bytes().iter().copied().collect();

            for docid in candidates.into_iter() {
                key_buffer.truncate(mem::size_of::<FieldId>());
                key_buffer.extend_from_slice(&docid.to_be_bytes());
                let iter = db
                    .remap_key_type::<ByteSlice>()
                    .prefix_iter(rtxn, &key_buffer)?
                    .remap_key_type::<KC>();

                for result in iter {
                    let ((_, _, value), ()) = result?;
                    *distribution.entry(value.to_string()).or_insert(0) += 1;
                }
            }

            Ok(())
        }

        match facet_type {
            FacetType::Number => {
                let db = self.index.field_id_docid_facet_f64s;
                fetch_facet_values(self.rtxn, db, field_id, candidates, distribution)
            }
            FacetType::String => {
                let db = self.index.field_id_docid_facet_strings;
                fetch_facet_values(self.rtxn, db, field_id, candidates, distribution)
            }
        }
    }

    /// There is too much documents, we use the facet levels to move throught
    /// the facet values, to find the candidates and values associated.
    fn facet_numbers_distribution_from_facet_levels(
        &self,
        field_id: FieldId,
        candidates: &RoaringBitmap,
        distribution: &mut BTreeMap<String, u64>,
    ) -> heed::Result<()> {
        let iter =
            FacetNumberIter::new_non_reducing(self.rtxn, self.index, field_id, candidates.clone())?;

        for result in iter {
            let (value, mut docids) = result?;
            docids &= candidates;
            if !docids.is_empty() {
                distribution.insert(value.to_string(), docids.len());
            }
            if distribution.len() == self.max_values_by_facet {
                break;
            }
        }

        Ok(())
    }

    fn facet_strings_distribution_from_facet_levels(
        &self,
        field_id: FieldId,
        candidates: &RoaringBitmap,
        distribution: &mut BTreeMap<String, u64>,
    ) -> heed::Result<()> {
        let iter =
            FacetStringIter::new_non_reducing(self.rtxn, self.index, field_id, candidates.clone())?;

        for result in iter {
            let (value, mut docids) = result?;
            docids &= candidates;
            if !docids.is_empty() {
                distribution.insert(value.to_string(), docids.len());
            }
            if distribution.len() == self.max_values_by_facet {
                break;
            }
        }

        Ok(())
    }

    /// Placeholder search, a.k.a. no candidates were specified. We iterate throught the
    /// facet values one by one and iterate on the facet level 0 for numbers.
    fn facet_values_from_raw_facet_database(
        &self,
        field_id: FieldId,
    ) -> heed::Result<BTreeMap<String, u64>> {
        let mut distribution = BTreeMap::new();

        let db = self.index.facet_id_f64_docids;
        let range = FacetNumberRange::new(self.rtxn, db, field_id, 0, Unbounded, Unbounded)?;

        for result in range {
            let ((_, _, value, _), docids) = result?;
            distribution.insert(value.to_string(), docids.len());
            if distribution.len() == self.max_values_by_facet {
                break;
            }
        }

        let iter = self
            .index
            .facet_id_string_docids
            .remap_key_type::<ByteSlice>()
            .prefix_iter(self.rtxn, &field_id.to_be_bytes())?
            .remap_key_type::<FacetStringLevelZeroCodec>();

        for result in iter {
            let ((_, value), docids) = result?;
            distribution.insert(value.to_string(), docids.len());
            if distribution.len() == self.max_values_by_facet {
                break;
            }
        }

        Ok(distribution)
    }

    fn facet_values(&self, field_id: FieldId) -> heed::Result<BTreeMap<String, u64>> {
        use FacetType::{Number, String};

        match self.candidates {
            Some(ref candidates) => {
                // Classic search, candidates were specified, we must return facet values only related
                // to those candidates. We also enter here for facet strings for performance reasons.
                let mut distribution = BTreeMap::new();
                if candidates.len() <= CANDIDATES_THRESHOLD {
                    self.facet_distribution_from_documents(
                        field_id,
                        Number,
                        candidates,
                        &mut distribution,
                    )?;
                    self.facet_distribution_from_documents(
                        field_id,
                        String,
                        candidates,
                        &mut distribution,
                    )?;
                } else {
                    self.facet_numbers_distribution_from_facet_levels(
                        field_id,
                        candidates,
                        &mut distribution,
                    )?;
                    self.facet_strings_distribution_from_facet_levels(
                        field_id,
                        candidates,
                        &mut distribution,
                    )?;
                }

                Ok(distribution)
            }
            None => self.facet_values_from_raw_facet_database(field_id),
        }
    }

    pub fn execute(&self) -> Result<BTreeMap<String, BTreeMap<String, u64>>> {
        let fields_ids_map = self.index.fields_ids_map(self.rtxn)?;
        let filterable_fields = self.index.filterable_fields(self.rtxn)?;
        let fields = match self.facets {
            Some(ref facets) => {
                let invalid_fields: HashSet<_> = facets.difference(&filterable_fields).collect();
                if !invalid_fields.is_empty() {
                    return Err(UserError::InvalidFacetsDistribution {
                        invalid_facets_name: invalid_fields.into_iter().cloned().collect(),
                    }
                    .into());
                } else {
                    facets.clone()
                }
            }
            None => filterable_fields,
        };

        let mut distribution = BTreeMap::new();
        for name in fields {
            let fid =
                fields_ids_map.id(&name).ok_or_else(|| FieldIdMapMissingEntry::FieldName {
                    field_name: name.clone(),
                    process: "FacetDistribution::execute",
                })?;
            let values = self.facet_values(fid)?;
            distribution.insert(name, values);
        }

        Ok(distribution)
    }
}

impl fmt::Debug for FacetDistribution<'_> {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        let FacetDistribution { facets, candidates, max_values_by_facet, rtxn: _, index: _ } = self;

        f.debug_struct("FacetDistribution")
            .field("facets", facets)
            .field("candidates", candidates)
            .field("max_values_by_facet", max_values_by_facet)
            .finish()
    }
}