def test_decodifica_data(self):
raiz, tree = huffman.make_tree(self.table)
res = huffman.decodifica_data(tree, [
'111', '011', '011', '01', '01', '01', '0', '0', '0', '0', '0',
'0', '0', '0'
])
self.assertEqual(res, self.data)
def test_decode_string(self):
hist = huffman.make_hist(self.data)
raiz, tree = huffman.make_tree(hist)
res = huffman.decode_string(tree, raiz, '11101101101010100000000')
self.assertEqual(res, self.data)
def test_compress(self):
hist = huffman.make_hist(self.data)
raiz, tree = huffman.make_tree(hist)
comp = huffman.compress(tree, self.data)
self.assertEqual(comp, '11101101101010100000000')
def test_decodifica(self):
raiz, tree = huffman.make_tree(self.table)
dec = huffman.decode(tree, ['0'])
self.assertEqual(dec[0], 5)
def test_codifica(self):
raiz, tree = huffman.make_tree(self.table)
cod = huffman.codifica(tree, [5])
self.assertEqual(cod[0], '0')
def test_make_tree(self):
#genera arbol y regresa la raiz
raiz, tree = huffman.make_tree(self.table)
self.assertEqual(raiz, 258)