use crate::circuit_builder::CircuitBuilder;
use crate::field::extension_field::Extendable;
use crate::field::field::Field;
use crate::gates::base_sum::{BaseSplitGenerator, BaseSumGate};
use crate::generator::{SimpleGenerator, WitnessGenerator};
use crate::target::Target;
use crate::util::{ceil_div_usize, log2_strict};
use crate::wire::Wire;
use crate::witness::PartialWitness;

impl<F: Extendable<D>, const D: usize> CircuitBuilder<F, D> {
    /// Split the given element into a list of targets, where each one represents a
    /// base-B limb of the element, with little-endian ordering.
    pub(crate) fn split_le_base<const B: usize>(
        &mut self,
        x: Target,
        num_limbs: usize,
    ) -> Vec<Target> {
        let gate = self.add_gate(BaseSumGate::<B>::new(num_limbs), vec![]);
        let sum = Target::wire(gate, BaseSumGate::<B>::WIRE_SUM);
        self.route(x, sum);

        Target::wires_from_range(
            gate,
            BaseSumGate::<B>::WIRE_LIMBS_START..BaseSumGate::<B>::WIRE_LIMBS_START + num_limbs,
        )
    }

    /// Asserts that `x`'s bit representation has at least `trailing_zeros` trailing zeros.
    pub(crate) fn assert_trailing_zeros<const B: usize>(&mut self, x: Target, trailing_zeros: u32) {
        let num_limbs = num_limbs(64, B);
        let num_limbs_to_check = num_limbs_to_check(trailing_zeros, B);
        let limbs = self.split_le_base::<B>(x, num_limbs);
        assert!(
            num_limbs_to_check < self.config.num_routed_wires,
            "Not enough routed wires."
        );
        for i in 0..num_limbs_to_check {
            self.assert_zero(limbs[i]);
        }
    }

    pub(crate) fn reverse_bits<const B: usize>(&mut self, x: Target, num_limbs: usize) -> Target {
        let gate = self.add_gate(BaseSumGate::<B>::new(num_limbs), vec![]);
        let sum = Target::wire(gate, BaseSumGate::<B>::WIRE_SUM);
        self.route(x, sum);

        Target::wire(gate, BaseSumGate::<B>::WIRE_REVERSED_SUM)
    }
}

/// Returns `k` such that any number with `k` trailing zeros in base `base` has at least
/// `n` trailing zeros in base 2.
#[allow(unconditional_panic)]
const fn num_limbs_to_check(n: u32, base: usize) -> usize {
    if base % 2 == 1 {
        // Dirty trick to panic if the base is odd.
        // TODO: replace with `assert_eq!(base % 2, 0, "Base should be even.")` when stable.
        [][0]
    } else {
        ceil_div_usize(n as usize, base.trailing_zeros() as usize)
    }
}

fn num_limbs(n_log: u32, base: usize) -> usize {
    ((n_log as f64) * 2.0_f64.log(base as f64)).ceil() as usize
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::circuit_data::CircuitConfig;
    use crate::field::crandall_field::CrandallField;

    #[test]
    fn test_split_base() {
        type F = CrandallField;
        let config = CircuitConfig::large_config();
        let mut builder = CircuitBuilder::<F, 4>::new(config);
        let x = F::from_canonical_usize(0b110100000); // 416 = 1532 in base 6.
        let xt = builder.constant(x);
        let limbs = builder.split_le_base::<6>(xt, 24);
        let one = builder.one();
        let two = builder.two();
        let three = builder.constant(F::from_canonical_u64(3));
        let five = builder.constant(F::from_canonical_u64(5));
        builder.assert_equal(limbs[0], two);
        builder.assert_equal(limbs[1], three);
        builder.assert_equal(limbs[2], five);
        builder.assert_equal(limbs[3], one);

        builder.assert_trailing_zeros::<6>(xt, 4);
        builder.assert_trailing_zeros::<4>(xt, 5);
        builder.assert_trailing_zeros::<12>(xt, 5);
        let data = builder.build();

        let proof = data.prove(PartialWitness::new());
    }
}