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
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120

#[cfg(test)]
use crate::huffman_table::MAX_MATCH;
use crate::huffman_table::{MAX_DISTANCE, MIN_MATCH};

#[derive(Copy, Clone, Eq, PartialEq, Debug)]
pub struct StoredLength {
    length: u8,
}

impl StoredLength {
    #[cfg(test)]
    pub fn from_actual_length(length: u16) -> StoredLength {
        assert!(length <= MAX_MATCH && length >= MIN_MATCH);
        StoredLength {
            length: (length - MIN_MATCH) as u8,
        }
    }

    pub fn new(stored_length: u8) -> StoredLength {
        StoredLength {
            length: stored_length,
        }
    }

    pub fn stored_length(&self) -> u8 {
        self.length
    }

    #[cfg(test)]
    pub fn actual_length(&self) -> u16 {
        u16::from(self.length) + MIN_MATCH
    }
}

#[derive(Copy, Clone, Eq, PartialEq, Debug)]
pub enum LZType {
    Literal(u8),
    StoredLengthDistance(StoredLength, u16),
}

#[derive(Copy, Clone, Eq, PartialEq, Debug)]
pub struct LZValue {
    litlen: u8,
    distance: u16,
}

impl LZValue {
    #[inline]
    pub fn literal(value: u8) -> LZValue {
        LZValue {
            litlen: value,
            distance: 0,
        }
    }

    #[inline]
    pub fn length_distance(length: u16, distance: u16) -> LZValue {
        debug_assert!(distance > 0 && distance <= MAX_DISTANCE);
        let stored_length = (length - MIN_MATCH) as u8;
        LZValue {
            litlen: stored_length,
            distance,
        }
    }

    #[inline]
    pub fn value(&self) -> LZType {
        if self.distance != 0 {
            LZType::StoredLengthDistance(StoredLength::new(self.litlen), self.distance)
        } else {
            LZType::Literal(self.litlen)
        }
    }
}

#[cfg(test)]
pub fn lit(l: u8) -> LZValue {
    LZValue::literal(l)
}

#[cfg(test)]
pub fn ld(l: u16, d: u16) -> LZValue {
    LZValue::length_distance(l, d)
}

#[cfg(test)]
mod test {
    use super::*;
    use crate::huffman_table::{MAX_DISTANCE, MAX_MATCH, MIN_DISTANCE, MIN_MATCH};
    #[test]
    fn lzvalue() {
        for i in 0..255 as usize + 1 {
            let v = LZValue::literal(i as u8);
            if let LZType::Literal(n) = v.value() {
                assert_eq!(n as usize, i);
            } else {
                panic!();
            }
        }

        for i in MIN_MATCH..MAX_MATCH + 1 {
            let v = LZValue::length_distance(i, 5);
            if let LZType::StoredLengthDistance(l, _) = v.value() {
                assert_eq!(l.actual_length(), i);
            } else {
                panic!();
            }
        }

        for i in MIN_DISTANCE..MAX_DISTANCE + 1 {
            let v = LZValue::length_distance(5, i);

            if let LZType::StoredLengthDistance(_, d) = v.value() {
                assert_eq!(d, i);
            } else {
                panic!("Failed to get distance {}", i);
            }
        }
    }
}