aboutsummaryrefslogtreecommitdiff
path: root/src/huffman/huffmantree.nim
diff options
context:
space:
mode:
Diffstat (limited to 'src/huffman/huffmantree.nim')
-rw-r--r--src/huffman/huffmantree.nim10
1 files changed, 5 insertions, 5 deletions
diff --git a/src/huffman/huffmantree.nim b/src/huffman/huffmantree.nim
index 58a840e..f3fce1b 100644
--- a/src/huffman/huffmantree.nim
+++ b/src/huffman/huffmantree.nim
@@ -31,6 +31,11 @@ type HuffmanTreeNode*[T: SomeUnsignedInt] = ref object
31 of leaf: 31 of leaf:
32 value*: T 32 value*: T
33 33
34proc maxValue*[T](node: HuffmanTreeNode[T]): T =
35 case node.kind:
36 of branch: node.maxChildValue
37 of leaf: node.value
38
34proc huffmanBranch*[T](left, right: HuffmanTreeNode[T]): HuffmanTreeNode[T] = 39proc huffmanBranch*[T](left, right: HuffmanTreeNode[T]): HuffmanTreeNode[T] =
35 HuffmanTreeNode[T]( 40 HuffmanTreeNode[T](
36 kind: branch, left: left, right: right, 41 kind: branch, left: left, right: right,
@@ -45,11 +50,6 @@ proc `==`*[T](a, b: HuffmanTreeNode[T]): bool =
45 of branch: a.left == b.left and a.right == b.right 50 of branch: a.left == b.left and a.right == b.right
46 of leaf: a.value == b.value 51 of leaf: a.value == b.value
47 52
48proc maxValue*[T](node: HuffmanTreeNode[T]): T =
49 case node.kind:
50 of branch: node.maxChildValue
51 of leaf: node.value
52
53proc deserialise*[T](bitReader: BitReader, valueType: typedesc[T]): HuffmanTreeNode[T] = 53proc deserialise*[T](bitReader: BitReader, valueType: typedesc[T]): HuffmanTreeNode[T] =
54 let valueBitLength = bitReader.readBits(valueLengthFieldBitLength, uint8).int 54 let valueBitLength = bitReader.readBits(valueLengthFieldBitLength, uint8).int
55 proc readNode(): HuffmanTreeNode[T] = 55 proc readNode(): HuffmanTreeNode[T] =