bitwise 0.1.1

Portable high-level bitwise manipulation algorithms.
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

use word::Word;

/// Number of trailing ones in the binary representation of `x`.
///
/// # Keywords:
///
/// Count trailing ones.
///
/// # Examples
///
/// ```
/// use bitwise::word::*;
///
/// let n = 0b0010_0111u16;
///
/// assert_eq!(n.count_trailing_ones(), 3);
/// assert_eq!(count_trailing_ones(n), 3);
/// ```
#[inline]
pub fn count_trailing_ones<T: Word>(x: T) -> T {
    T::trailing_zeros(!x)
}

/// Method version of [`count_trailing_ones`](fn.count_trailing_ones.html).
pub trait CountTrailingOnes {
    #[inline]
    fn count_trailing_ones(self) -> Self;
}

impl<T: Word> CountTrailingOnes for T {
    #[inline]
    fn count_trailing_ones(self) -> Self {
        count_trailing_ones(self)
    }
}