sam.hadow/huffman-py
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Upload files to ''

Browse Source
This commit is contained in:
sam.hadow 2023-05-25 02:44:58 +02:00
parent ebcfc19334
commit 5c97db3496
1 changed files with 62 additions and 80 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

142
test_huffman.py
View File

@ -1,104 +1,86 @@
#
# Sam Hadow - Huffman-py
# Copyright (C) 2023
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU 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 General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
#
import unittest import unittest
from huffman_py.Node import * from src.Sommets import *
from huffman_py.Tree import * from src.Arbre import *
from huffman_py.functions.encode import * from src.fonctions.encode import *
from huffman_py.functions.decode import * from src.fonctions.decode import *
from huffman_py.functions.occurence import * from src.fonctions.occurence import *
# pour lancer les tests utilisez: # pour lancer les tests utilisez:
# python -m unittest discover # python -m unittest discover
class TestUtils(unittest.TestCase): class TestUtils(unittest.TestCase):
def test_Tree_id(self): def test_Arbre_id(self):
a = Node(10, 'a') a = Sommets(10, 'a')
b = Node(8,'b') b = Sommets(8,'b')
r1 = Node(18,'',left=b,right=a) r1 = Sommets(18,'',left=b,right=a)
tree1 = Tree(r1) arbre1 = Arbre(r1)
# vérification affectation d'un identifier unique en créant l'tree # vérification affectation d'un identifiant unique en créant l'arbre
liste_id = [] liste_id = []
verification_id = True verification_id = True
for elem in tree1.nodes: for elem in arbre1.sommets:
liste_id.append(elem.identifier) liste_id.append(elem.identifiant)
if len(liste_id) > len(set(liste_id)): if len(liste_id) > len(set(liste_id)):
verification_id = False verification_id = False
self.assertTrue(verification_id) self.assertTrue(verification_id)
def test_Tree_fusion(self): def test_Arbre_fusion(self):
# fusion des trees # fusion des arbres
# on doit retrouver les éléments des 2 trees + une nouvelle root # on doit retrouver les éléments des 2 arbres + une nouvelle racine
# les identifiers doivent toujours être uniques # les identifiants doivent toujours être uniques
a = Node(10, 'a') a = Sommets(10, 'a')
b = Node(8,'b') b = Sommets(8,'b')
r1 = Node(18,'',left=b,right=a) r1 = Sommets(18,'',left=b,right=a)
c = Node(15, 'c') c = Sommets(15, 'c')
d = Node(20,'d') d = Sommets(20,'d')
r2 = Node(18,'',left=d,right=c) r2 = Sommets(18,'',left=d,right=c)
tree1 = Tree(r1) arbre1 = Arbre(r1)
tree2 = Tree(r2) arbre2 = Arbre(r2)
l1 = len(tree1.nodes) l1 = len(arbre1.sommets)
l2 = len(tree2.nodes) l2 = len(arbre2.sommets)
tree1 += tree2 arbre1 += arbre2
verification_fusion = True verification_fusion = True
if l1+l2+1 != len(tree1.nodes): if l1+l2+1 != len(arbre1.sommets):
verification_fusion = False verification_fusion = False
liste_id2 = [] liste_id2 = []
verification_id2 = True verification_id2 = True
for elem in tree1.nodes: for elem in arbre1.sommets:
liste_id2.append(elem.identifier) liste_id2.append(elem.identifiant)
if len(liste_id2) > len(set(liste_id2)): if len(liste_id2) > len(set(liste_id2)):
verification_id2 = False verification_id2 = False
self.assertTrue(verification_fusion) self.assertTrue(verification_fusion)
self.assertTrue(verification_id2) self.assertTrue(verification_id2)
def test_Tree_seek(self): def test_Arbre_recherche(self):
# seek de node # recherche de sommet
a = Node(10, 'a') a = Sommets(10, 'a')
b = Node(8,'b') b = Sommets(8,'b')
r1 = Node(18,'',left=b,right=a) r1 = Sommets(18,'',left=b,right=a)
tree1 = Tree(r1) arbre1 = Arbre(r1)
self.assertEqual(tree1.seek(a),a) self.assertEqual(arbre1.recherche(a),a)
self.assertNotEqual(tree1.seek(b),a) self.assertNotEqual(arbre1.recherche(b),a)
def test_Tree_suppression(self): def test_Arbre_suppression(self):
a = Node(10, 'a') a = Sommets(10, 'a')
b = Node(8,'b') b = Sommets(8,'b')
r1 = Node(18,'',left=b,right=a) r1 = Sommets(18,'',left=b,right=a)
r2 = Node(18,'',left=None,right=r1) r2 = Sommets(18,'',left=None,right=r1)
tree1 = Tree(r2) arbre1 = Arbre(r2)
tree1 -= r1 arbre1 -= r1
self.assertEqual(tree1.seek(a),None) self.assertEqual(arbre1.recherche(a),None)
self.assertEqual(tree1.seek(b),None) self.assertEqual(arbre1.recherche(b),None)
self.assertEqual(tree1.seek(r1),None) self.assertEqual(arbre1.recherche(r1),None)
self.assertEqual(tree1.seek(r2),r2) self.assertEqual(arbre1.recherche(r2),r2)
def test_occurences(self): def test_occurences(self):
o1 = calcul_occurence('aaabcc') o1 = calcul_occurence('aaabcc')
@ -114,27 +96,27 @@ class TestUtils(unittest.TestCase):
def test_encodage_huffman(self): def test_encodage_huffman(self):
string = 'mouton' string = 'mouton'
string2 = 'vache' string2 = 'vache'
(encodedOutput, root, huffmanEncoding) = huffman_encode(string) (encodedOutput, racine, huffmanEncoding) = huffman_encode(string)
(encodedOutput2, root2, huffmanEncoding2) = huffman_encode(string2) (encodedOutput2, racine2, huffmanEncoding2) = huffman_encode(string2)
# l'encodage doit être différent (les dictionnaires et trees aussi) # l'encodage doit être différent (les dictionnaires et arbres aussi)
self.assertNotEqual(huffmanEncoding, huffmanEncoding2) self.assertNotEqual(huffmanEncoding, huffmanEncoding2)
self.assertNotEqual(encodedOutput, encodedOutput2) self.assertNotEqual(encodedOutput, encodedOutput2)
self.assertNotEqual(Tree(root),Tree(root2)) self.assertNotEqual(Arbre(racine),Arbre(racine2))
def test_decodage_huffman(self): def test_decodage_huffman(self):
string = 'chèvre' string = 'chèvre'
(encodedOutput, root, huffmanEncoding) = huffman_encode(string) (encodedOutput, racine, huffmanEncoding) = huffman_encode(string)
# on doit être capable de décoder avec la root de l'tree ou avec le dictionnaire # on doit être capable de décoder avec la racine de l'arbre ou avec le dictionnaire
self.assertEqual(string,huffman_decode(encodedOutput,root)) self.assertEqual(string,huffman_decode(encodedOutput,racine))
self.assertEqual(string,decode_from_dict(encodedOutput,huffmanEncoding)) self.assertEqual(string,decode_from_dico(encodedOutput,huffmanEncoding))
# on doit être capable de détecter si le dictionnaire/tree n'est pas celui correspondant à un texte encodé # on doit être capable de détecter si le dictionnaire/arbre n'est pas celui correspondant à un texte encodé
string2 = 'poule' string2 = 'poule'
(encodedOutput2, root2, huffmanEncoding2) = huffman_encode(string2) (encodedOutput2, racine2, huffmanEncoding2) = huffman_encode(string2)
with self.assertRaises(ValueError): with self.assertRaises(ValueError):
decode_from_dict(encodedOutput2,huffmanEncoding) decode_from_dico(encodedOutput2,huffmanEncoding)
with self.assertRaises(ValueError): with self.assertRaises(ValueError):
huffman_decode(encodedOutput2,root) huffman_decode(encodedOutput2,racine)
if __name__ == '__main__': if __name__ == '__main__':