1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117
use crate::natural::logic::count_ones::limbs_count_ones;
use crate::natural::InnerNatural::{Large, Small};
use crate::natural::Natural;
use crate::platform::Limb;
use malachite_base::num::logic::traits::HammingDistance;
use std::cmp::Ordering;
// Interpreting a slice of `Limb`s as the limbs of a `Natural` in ascending order, returns the
// Hamming distance between that `Natural` and a `Limb`. Both have infinitely many implicit leading
// zeros. `xs` cannot be empty.
//
// # Worst-case complexity
// $T(n) = O(n)$
//
// $M(n) = O(1)$
//
// where $T$ is time, $M$ is additional memory, and $n$ is `xs.len()`.
//
// # Panics
// Panics if `xs` is empty.
pub_test! {limbs_hamming_distance_limb(xs: &[Limb], y: Limb) -> u64 {
xs[0].hamming_distance(y) + limbs_count_ones(&xs[1..])
}}
// Interpreting two equal-length slices of `Limb`s as the limbs of `Natural`s in ascending order,
// returns the Hamming distance between them. Both have infinitely many implicit leading zeros.
//
// # Worst-case complexity
// $T(n) = O(n)$
//
// $M(n) = O(1)$
//
// where $T$ is time, $M$ is additional memory, and $n$ is `xs.len()`.
//
// # Panics
// Panics if `xs` and `ys` have different lengths.
//
// This is equivalent to `mpz_hamdist` from `mpz/hamdist.c`, GMP 6.2.1, where both arguments are
// non-negative and have the same length.
pub_crate_test! {limbs_hamming_distance_same_length(xs: &[Limb], ys: &[Limb]) -> u64 {
assert_eq!(xs.len(), ys.len());
xs.iter()
.zip(ys.iter())
.map(|(x, &y)| x.hamming_distance(y))
.sum()
}}
// Interpreting two slices of `Limb`s as the limbs of `Natural`s in ascending order, returns the
// Hamming distance between them. Both have infinitely many implicit leading zeros.
//
// # Worst-case complexity
// $T(n) = O(n)$
//
// $M(n) = O(1)$
//
// where $T$ is time, $M$ is additional memory, and $n$ is `max(xs.len(), ys.len())`.
//
// This is equivalent to `mpz_hamdist` from `mpz/hamdist.c`, GMP 6.2.1, where both arguments are
// non-negative.
pub_test! {limbs_hamming_distance(xs: &[Limb], ys: &[Limb]) -> u64 {
let xs_len = xs.len();
let ys_len = ys.len();
match xs_len.cmp(&ys_len) {
Ordering::Equal => limbs_hamming_distance_same_length(xs, ys),
Ordering::Less => {
limbs_hamming_distance_same_length(xs, &ys[..xs_len]) + limbs_count_ones(&ys[xs_len..])
}
Ordering::Greater => {
limbs_hamming_distance_same_length(&xs[..ys_len], ys) + limbs_count_ones(&xs[ys_len..])
}
}
}}
impl Natural {
fn hamming_distance_limb(&self, other: Limb) -> u64 {
match *self {
Natural(Small(small)) => small.hamming_distance(other),
Natural(Large(ref limbs)) => limbs_hamming_distance_limb(limbs, other),
}
}
}
impl<'a, 'b> HammingDistance<&'a Natural> for &'b Natural {
/// Determines the Hamming distance between two [`Natural]`s.
///
/// Both [`Natural`]s have infinitely many implicit leading zeros.
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is
/// `max(self.significant_bits(), other.significant_bits())`.
///
/// # Examples
/// ```
/// extern crate malachite_base;
///
/// use malachite_base::num::basic::traits::One;
/// use malachite_base::num::logic::traits::HammingDistance;
/// use malachite_nz::natural::Natural;
///
/// assert_eq!(Natural::from(123u32).hamming_distance(&Natural::from(123u32)), 0);
/// // 105 = 1101001b, 123 = 1111011
/// assert_eq!(Natural::from(105u32).hamming_distance(&Natural::from(123u32)), 2);
/// let n = Natural::ONE << 100u32;
/// assert_eq!(n.hamming_distance(&(&n - Natural::ONE)), 101);
/// ```
fn hamming_distance(self, other: &'a Natural) -> u64 {
match (self, other) {
(&Natural(Small(x)), _) => other.hamming_distance_limb(x),
(_, &Natural(Small(y))) => self.hamming_distance_limb(y),
(&Natural(Large(ref xs)), &Natural(Large(ref ys))) => limbs_hamming_distance(xs, ys),
}
}
}