pub fn ndiffs(b1: &DnaString, b2: &DnaString) -> usize {
    assert_eq!(b1.len(), b2.len());
    let mut diffs = 0;
    let (s1, s2) = (&b1.storage, &b2.storage);
    for i in 0..s1.len() {
        diffs += count_diff_2_bit_packed(s1[i], s2[i])
    }
    diffs as usize
}
/// Compute the number of base positions at which two DnaStrings differ, assuming
/// that they have the same length.
Compute the number of base positions at which two DnaStrings differ, assuming
that they have the same length.
Compute the number of base positions at which two DnaStrings differ assuming that they have the same length .
pub fn ndiffs(b1: &DnaString, b2: &DnaString) -> usize {
    assert_eq!(b1.len(), b2.len());
    let mut diffs = 0;
    let (s1, s2) = (&b1.storage, &b2.storage);
    for i in 0..s1.len() {
        diffs += count_diff_2_bit_packed(s1[i], s2[i])
    }
    diffs as usize
}
pub fn ndiffs ( b1 : & DnaString , b2 : & DnaString ) -> usize { assert_eq ! ( b1 len ( ) b2 len ( ) ) ; let mut diffs = 0 ; let ( s1 , s2 ) = ( & b1 . storage , & b2 . storage ) ; for i in 0 .. s1 . len ( ) { diffs += count_diff_2_bit_packed ( s1 [ i ] , s2 [ i ] ) } diffs as usize }
Compute the number of base positions at which two DnaStrings differ, assuming
that they have the same length.
Compute the number of base positions at which two DnaStrings differ assuming that they have the same length .
b1
&DnaString
b2
&DnaString
b1
&DnaString
b2
&DnaString