Files
a0_basic_app
a1_vehicle
a2_async_sim
ab_glyph
ab_glyph_rasterizer
adler
adler32
agents
aho_corasick
anyhow
approx
aquamarine
ash
atty
bitflags
bytemuck
byteorder
cache_padded
cfg_if
chrono
color_quant
crc32fast
crossbeam_channel
crossbeam_deque
crossbeam_epoch
crossbeam_utils
deflate
draw2d
either
flexi_logger
generic_array
gif
glfw
glfw_sys
glob
image
indoc
itertools
jpeg_decoder
lazy_static
libc
libloading
log
matrixmultiply
memchr
memoffset
miniz_oxide
nalgebra
base
geometry
linalg
third_party
num_complex
num_cpus
num_integer
num_iter
num_rational
num_traits
owned_ttf_parser
paste
png
proc_macro2
proc_macro_error
proc_macro_error_attr
quote
raw_window_handle
rawpointer
rayon
rayon_core
regex
regex_syntax
scoped_threadpool
scopeguard
semver
semver_parser
serde
serde_derive
simba
smawk
spin_sleep
syn
terminal_size
textwrap
thiserror
thiserror_impl
tiff
time
triple_buffer
ttf_parser
typenum
unicode_width
unicode_xid
unindent
vk_sys
weezl
yansi
 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
/// Reverse the first length bits of n.
/// (Passing more than 16 as length will produce garbage.
pub fn reverse_bits(mut n: u16, length: u8) -> u16 {
    debug_assert!(length <= 16);
    // Borrowed from http://aggregate.org/MAGIC/#Bit%20Reversal
    n = ((n & 0xaaaa) >> 1) | ((n & 0x5555) << 1);
    n = ((n & 0xcccc) >> 2) | ((n & 0x3333) << 2);
    n = ((n & 0xf0f0) >> 4) | ((n & 0x0f0f) << 4);
    n = ((n & 0xff00) >> 8) | ((n & 0x00ff) << 8);
    n >> (16 - length)
}

#[cfg(test)]
mod test {
    use super::reverse_bits;
    #[test]
    fn test_bit_reverse() {
        assert_eq!(reverse_bits(0b0111_0100, 8), 0b0010_1110);
        assert_eq!(
            reverse_bits(0b1100_1100_1100_1100, 16),
            0b0011_0011_0011_0011
        );
        // Check that we ignore >16 length
        // We no longer check for this.
        // assert_eq!(reverse_bits(0b11001100_11001100, 32), 0b0011001100110011);
    }
}