| 1 |
#[test] |
| 2 |
fn test_huffman_values() { |
| 3 |
use bitstream_io::{define_huffman_tree, BigEndian, BitRead, BitReader}; |
| 4 |
|
| 5 |
let data = [0b10110001, 0b11101101]; |
| 6 |
|
| 7 |
define_huffman_tree!(Tree1 : i32 = [0, [1, [2, 5]]]); |
| 8 |
define_huffman_tree!(Tree2 : &'static str = ["foo", ["bar", ["baz", "kelp"]]]); |
| 9 |
|
| 10 |
let mut r = BitReader::endian(data.as_slice(), BigEndian); |
| 11 |
assert_eq!(r.read_huffman::<Tree1>().unwrap(), 1); |
| 12 |
assert_eq!(r.read_huffman::<Tree1>().unwrap(), 2); |
| 13 |
assert_eq!(r.read_huffman::<Tree1>().unwrap(), 0); |
| 14 |
assert_eq!(r.read_huffman::<Tree1>().unwrap(), 0); |
| 15 |
assert_eq!(r.read_huffman::<Tree1>().unwrap(), 5); |
| 16 |
|
| 17 |
let mut r = BitReader::endian(data.as_slice(), BigEndian); |
| 18 |
assert_eq!(r.read_huffman::<Tree2>().unwrap(), "bar"); |
| 19 |
assert_eq!(r.read_huffman::<Tree2>().unwrap(), "baz"); |
| 20 |
assert_eq!(r.read_huffman::<Tree2>().unwrap(), "foo"); |
| 21 |
assert_eq!(r.read_huffman::<Tree2>().unwrap(), "foo"); |
| 22 |
assert_eq!(r.read_huffman::<Tree2>().unwrap(), "kelp"); |
| 23 |
} |