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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

use word::Word;

/// Outer Perfect Shuffle of `x`.
///
/// See also:
/// [Hacker's Delight: shuffling bits](http://icodeguru.com/Embedded/Hacker's-Delight/047.htm).
///
/// # Examples
///
/// ```
/// use bitwise::word::*;
///
/// let n = 0b0110_0101_1101_1011_1111_1001_0110_0011u32;
/// //        abcd efgh ijkl mnop ABCD EFGH IJKL MNOP,
/// let s = 0b0111_1101_0110_0011_1011_0110_1000_1111u32;
/// //        aAbB cCdD eEfF gGhH iIjJ kKlL mMnN oOpP,
///
/// assert_eq!(n.outer_perfect_shuffle(), s);
/// assert_eq!(outer_perfect_shuffle(n), s);
/// ```
#[inline]
pub fn outer_perfect_shuffle<T: Word>(x: T) -> T {
    let mut x = x;
    let s = T::byte_size();
    if s > T::from_u8(4) {
        let t = (x ^ (x >> T::from_u8(16))) & T::from_u64(0x00000000FFFF0000u64);
        x = x ^ t ^ (t << T::from_u8(16));
    }
    if s > T::from_u8(2) {
        let t = (x ^ (x >> T::from_u8(8))) & T::from_u64(0x0000FF000000FF00u64);
        x = x ^ t ^ (t << T::from_u8(8));
    }
    if s > T::one() {
        let t = (x ^ (x >> T::from_u8(4))) & T::from_u64(0x00F000F000F000F0u64);
        x = x ^ t ^ (t << T::from_u8(4));
    }
    let t = (x ^ (x >> T::from_u8(2))) & T::from_u64(0x0C0C0C0C0C0C0C0Cu64);
    x = x ^ t ^ (t << T::from_u8(2));
    let t = (x ^ (x >> T::one())) & T::from_u64(0x2222222222222222u64);
    x = x ^ t ^ (t << T::one());
    x
}

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

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