/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at https://mozilla.org/MPL/2.0/. */

//! This module implements the sampling logic required to hash,
//! randomize and pick branches using pre-set ratios.

use sha2::{Digest, Sha256};

use crate::error::{NimbusError, Result};

const HASH_BITS: u32 = 48;
const HASH_LENGTH: u32 = HASH_BITS / 4;

/// Sample by splitting the input space into a series of buckets, checking
/// if the given input is in a range of buckets
///
/// The range to check is defined by a start point and length, and can wrap around
/// the input space. For example, if there are 100 buckets, and we ask to check 50 buckets
/// starting from bucket 70, then buckets 70-99 and 0-19 will be checked
///
/// # Arguments:
///
/// - `input` What will be hashed and matched against the range of the buckets
/// - `start` the index of the bucket to start checking
/// - `count` then number of buckets to check
/// - `total` The total number of buckets to group inputs into
///
/// # Returns:
///
/// Returns true if the hash generated from the input belongs within the range
/// otherwise false
///
/// # Errors:
///
/// Could error in the following cases (but not limited to)
/// - An error occurred in the hashing process
/// - an error occurred while checking if the hash belongs in the bucket
pub(crate) fn bucket_sample<T: serde::Serialize>(
    input: T,
    start: u32,
    count: u32,
    total: u32,
) -> Result<bool> {
    let input_hash = hex::encode(truncated_hash(input)?);
    let wrapped_start = start % total;
    let end = wrapped_start + count;

    Ok(if end > total {
        is_hash_in_bucket(&input_hash, 0, end % total, total)?
            || is_hash_in_bucket(&input_hash, wrapped_start, total, total)?
    } else {
        is_hash_in_bucket(&input_hash, wrapped_start, end, total)?
    })
}

/// Sample over a list of ratios such that, over the input space, each
/// ratio has a number of matches in correct proportion to the other ratios
///
/// # Arguments:
/// - `input`: the input used in the sampling process
/// - `ratios`: The list of ratios associated with each option
///
/// # Example:
///
/// Assuming the ratios: `[1, 2, 3, 4]`
/// 10% of all inputs will return 0, 20% will return 1 and so on
///
/// # Returns
/// Returns an index of the ratio that matched the input
///
/// # Errors
/// Could return an error if the input couldn't be hashed
pub(crate) fn ratio_sample<T: serde::Serialize>(input: T, ratios: &[u32]) -> Result<usize> {
    if ratios.is_empty() {
        return Err(NimbusError::EmptyRatiosError);
    }
    let input_hash = hex::encode(truncated_hash(input)?);
    let ratio_total: u32 = ratios.iter().sum();
    let mut sample_point = 0;
    for (i, ratio) in ratios.iter().enumerate() {
        sample_point += ratio;
        if input_hash <= fraction_to_key(sample_point as f64 / ratio_total as f64)? {
            return Ok(i);
        }
    }
    Ok(ratios.len() - 1)
}

/// Provides a hash of `data`, truncated to the 6 most significant bytes
/// For consistency with: https://searchfox.org/mozilla-central/source/toolkit/components/utils/Sampling.jsm#79
/// # Arguments:
/// - `data`: The data to be hashed
///
/// # Returns:
/// Returns the 6 bytes associated with the SHA-256 of the data
///
/// # Errors:
/// Would return an error if the hashing function fails to generate a hash
/// that is larger than 6 bytes (Should never occur)
pub(crate) fn truncated_hash<T: serde::Serialize>(data: T) -> Result<[u8; 6]> {
    let mut hasher = Sha256::new();
    let data_str = match serde_json::to_string(&data) {
        Ok(v) => v,
        Err(e) => {
            return Err(NimbusError::JSONError(
                "data_str = nimbus::sampling::truncated_hash::serde_json::to_string".into(),
                e.to_string(),
            ));
        }
    };
    hasher.update(data_str.as_bytes());
    Ok(hasher.finalize()[0..6].try_into()?)
}

/// Checks if a given hash (represented as a 6 byte hex string) fits within a bucket range
///
/// # Arguments:
/// - `input_hash_num`: The hash as a 6 byte hex string (12 hex digits)
/// - `min_bucket`: The minimum bucket number
/// - `max_bucket`: The maximum bucket number
/// - `bucket_count`: The number of buckets
///
/// # Returns
/// Returns true if the has fits in the bucket range,
/// otherwise false
///
/// # Errors:
///
/// Could return an error if bucket numbers are higher than the bucket count
fn is_hash_in_bucket(
    input_hash_num: &str,
    min_bucket: u32,
    max_bucket: u32,
    bucket_count: u32,
) -> Result<bool> {
    let min_hash = fraction_to_key(min_bucket as f64 / bucket_count as f64)?;
    let max_hash = fraction_to_key(max_bucket as f64 / bucket_count as f64)?;
    Ok(min_hash.as_str() <= input_hash_num && input_hash_num < max_hash.as_str())
}

/// Maps from the range [0, 1] to [0, 2^48]
///
/// # Argument:
/// - `fraction`: float in the range 0-1
///
/// # Returns
/// returns a hex string representing the fraction multiplied to be within the
/// [0, 2^48] range
///
/// # Errors
/// returns an error if the fraction not within the 0-1 range
fn fraction_to_key(fraction: f64) -> Result<String> {
    if !(0.0..=1.0).contains(&fraction) {
        return Err(NimbusError::InvalidFraction);
    }
    let multiplied = (fraction * (2u64.pow(HASH_BITS) - 1) as f64).floor();
    let multiplied = format!("{:x}", multiplied as u64);
    let padding = vec!['0'; HASH_LENGTH as usize - multiplied.len()];
    let res = padding
        .into_iter()
        .chain(multiplied.chars())
        .collect::<String>();
    Ok(res)
}