aboutsummaryrefslogtreecommitdiff
path: root/tests/huffman/thuffmantree.nim
diff options
context:
space:
mode:
Diffstat (limited to 'tests/huffman/thuffmantree.nim')
-rw-r--r--tests/huffman/thuffmantree.nim75
1 files changed, 75 insertions, 0 deletions
diff --git a/tests/huffman/thuffmantree.nim b/tests/huffman/thuffmantree.nim
new file mode 100644
index 0000000..ac8fa59
--- /dev/null
+++ b/tests/huffman/thuffmantree.nim
@@ -0,0 +1,75 @@
1# gzip-like LZSS compressor
2# Copyright (C) 2018 Pacien TRAN-GIRARD
3#
4# This program is free software: you can redistribute it and/or modify
5# it under the terms of the GNU Affero General Public License as
6# published by the Free Software Foundation, either version 3 of the
7# License, or (at your option) any later version.
8#
9# This program is distributed in the hope that it will be useful,
10# but WITHOUT ANY WARRANTY; without even the implied warranty of
11# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12# GNU Affero General Public License for more details.
13#
14# You should have received a copy of the GNU Affero General Public License
15# along with this program. If not, see <https://www.gnu.org/licenses/>.
16
17import unittest, streams
18import bitio/bitreader, bitio/bitwriter
19import huffman/huffmantree
20
21suite "huffmantree":
22 let tree = huffmanBranch(
23 huffmanLeaf(1'u),
24 huffmanBranch(
25 huffmanLeaf(2'u),
26 huffmanLeaf(3'u)))
27
28 test "equality":
29 check huffmanLeaf(12'u) == huffmanLeaf(12'u)
30 check huffmanLeaf(12'u) != huffmanLeaf(21'u)
31 check huffmanLeaf(12'u) != huffmanBranch(huffmanLeaf(12'u), huffmanLeaf(12'u))
32 check huffmanBranch(huffmanLeaf(12'u), huffmanLeaf(21'u)) == huffmanBranch(huffmanLeaf(12'u), huffmanLeaf(21'u))
33 check huffmanBranch(huffmanLeaf(12'u), huffmanLeaf(21'u)) != huffmanBranch(huffmanLeaf(12'u), huffmanLeaf(1'u))
34 check tree == tree
35
36 test "maxValue":
37 check tree.maxValue() == 3
38
39 test "deserialise":
40 let stream = newStringStream()
41 defer: stream.close()
42 let bitWriter = stream.bitWriter()
43 bitWriter.writeBits(valueLengthFieldBitLength, 2'u8)
44 bitWriter.writeBool(false) # root
45 bitWriter.writeBool(true) # 1 leaf
46 bitWriter.writeBits(2, 1'u)
47 bitWriter.writeBool(false) # right branch
48 bitWriter.writeBool(true) # 2 leaf
49 bitWriter.writeBits(2, 2'u)
50 bitWriter.writeBool(true) # 3 leaf
51 bitWriter.writeBits(2, 3'u)
52 bitWriter.flush()
53
54 stream.setPosition(0)
55 let bitReader = stream.bitReader()
56 check huffmantree.deserialise(bitReader, uint) == tree
57
58 test "serialise":
59 let stream = newStringStream()
60 defer: stream.close()
61 let bitWriter = stream.bitWriter()
62 tree.serialise(bitWriter)
63 bitWriter.flush()
64
65 stream.setPosition(0)
66 let bitReader = stream.bitReader()
67 check bitReader.readBits(valueLengthFieldBitLength, uint8) == 2
68 check bitReader.readBool() == false # root
69 check bitReader.readBool() == true # 1 leaf
70 check bitReader.readBits(2, uint8) == 1
71 check bitReader.readBool() == false # right branch
72 check bitReader.readBool() == true # 2 leaf
73 check bitReader.readBits(2, uint8) == 2
74 check bitReader.readBool() == true # 3 leaf
75 check bitReader.readBits(2, uint8) == 3