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
|
extern crate alloc;
extern crate bitstream_io;
#[test]
fn test_huffman_values() {
use bitstream_io::{define_huffman_tree, BigEndian, BitRead, BitReader};
let data = [0b10110001, 0b11101101];
define_huffman_tree!(Tree1 : i32 = [0, [1, [2, 5]]]);
define_huffman_tree!(Tree2 : &'static str = ["foo", ["bar", ["baz", "kelp"]]]);
let mut r = BitReader::endian(data.as_slice(), BigEndian);
assert_eq!(r.read_huffman::<Tree1>().unwrap(), 1);
assert_eq!(r.read_huffman::<Tree1>().unwrap(), 2);
assert_eq!(r.read_huffman::<Tree1>().unwrap(), 0);
assert_eq!(r.read_huffman::<Tree1>().unwrap(), 0);
assert_eq!(r.read_huffman::<Tree1>().unwrap(), 5);
let mut r = BitReader::endian(data.as_slice(), BigEndian);
assert_eq!(r.read_huffman::<Tree2>().unwrap(), "bar");
assert_eq!(r.read_huffman::<Tree2>().unwrap(), "baz");
assert_eq!(r.read_huffman::<Tree2>().unwrap(), "foo");
assert_eq!(r.read_huffman::<Tree2>().unwrap(), "foo");
assert_eq!(r.read_huffman::<Tree2>().unwrap(), "kelp");
}
|
