From e88f60b63cb05f56a61060a953c726b7a78c0652 Mon Sep 17 00:00:00 2001
From: pacien
Date: Fri, 30 Nov 2018 17:08:01 +0100
Subject: isolate huffman encoding module

---
 src/huffmantree.nim | 74 -----------------------------------------------------
 1 file changed, 74 deletions(-)
 delete mode 100644 src/huffmantree.nim

(limited to 'src/huffmantree.nim')

diff --git a/src/huffmantree.nim b/src/huffmantree.nim
deleted file mode 100644
index 6208ecf..0000000
--- a/src/huffmantree.nim
+++ /dev/null
@@ -1,74 +0,0 @@
-# gzip-like LZSS compressor
-# Copyright (C) 2018  Pacien TRAN-GIRARD
-#
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU Affero General Public License as
-# published by the Free Software Foundation, either version 3 of the
-# License, or (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU Affero General Public License for more details.
-#
-# You should have received a copy of the GNU Affero General Public License
-# along with this program.  If not, see <https://www.gnu.org/licenses/>.
-
-import tables, heapqueue
-import integers, bitio/bitreader, bitio/bitwriter
-
-const valueLengthFieldBitLength* = 6  # 64
-
-type HuffmanTreeNodeKind* = enum
-  branch,
-  leaf
-
-type HuffmanTreeNode*[T: SomeUnsignedInt] = ref object
-  case kind*: HuffmanTreeNodeKind
-    of branch:
-      left*, right*: HuffmanTreeNode[T]
-      maxChildValue: T
-    of leaf:
-      value*: T
-
-proc huffmanBranch*[T](left, right: HuffmanTreeNode[T]): HuffmanTreeNode[T] =
-  HuffmanTreeNode[T](
-    kind: branch, left: left, right: right,
-    maxChildValue: max(left.maxValue(), right.maxValue()))
-
-proc huffmanLeaf*[T](value: T): HuffmanTreeNode[T] =
-  HuffmanTreeNode[T](kind: leaf, value: value)
-
-proc `==`*[T](a, b: HuffmanTreeNode[T]): bool =
-  if a.kind != b.kind: return false
-  case a.kind:
-    of branch: a.left == b.left and a.right == b.right
-    of leaf: a.value == b.value
-
-proc maxValue*[T](node: HuffmanTreeNode[T]): T =
-  case node.kind:
-    of branch: node.maxChildValue
-    of leaf: node.value
-
-proc deserialise*[T](bitReader: BitReader, valueType: typedesc[T]): HuffmanTreeNode[T] =
-  let valueBitLength = bitReader.readBits(valueLengthFieldBitLength, uint8).int
-  proc readNode(): HuffmanTreeNode[T] =
-    case bitReader.readBool():
-      of false: huffmanBranch(readNode(), readNode())
-      of true: huffmanLeaf(bitReader.readBits(valueBitLength, valueType))
-  readNode()
-
-proc serialise*[T](tree: HuffmanTreeNode[T], bitWriter: BitWriter) =
-  let maxValue = tree.maxValue()
-  let valueBitLength = maxValue.bitLength()
-  proc writeNode(node: HuffmanTreeNode[T]) =
-    case node.kind:
-      of branch:
-        bitWriter.writeBool(false)
-        writeNode(node.left)
-        writeNode(node.right)
-      of leaf:
-        bitWriter.writeBool(true)
-        bitWriter.writeBits(valueBitLength, node.value)
-  bitWriter.writeBits(valueLengthFieldBitLength, valueBitLength.uint8)
-  writeNode(tree)
-- 
cgit v1.2.3