Upload files to ''
This commit is contained in:
parent
ebcfc19334
commit
5c97db3496
142
test_huffman.py
142
test_huffman.py
@ -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
|
||||
from huffman_py.Node import *
|
||||
from huffman_py.Tree import *
|
||||
from huffman_py.functions.encode import *
|
||||
from huffman_py.functions.decode import *
|
||||
from huffman_py.functions.occurence import *
|
||||
from src.Sommets import *
|
||||
from src.Arbre import *
|
||||
from src.fonctions.encode import *
|
||||
from src.fonctions.decode import *
|
||||
from src.fonctions.occurence import *
|
||||
|
||||
# pour lancer les tests utilisez:
|
||||
# python -m unittest discover
|
||||
|
||||
class TestUtils(unittest.TestCase):
|
||||
def test_Tree_id(self):
|
||||
a = Node(10, 'a')
|
||||
b = Node(8,'b')
|
||||
r1 = Node(18,'',left=b,right=a)
|
||||
def test_Arbre_id(self):
|
||||
a = Sommets(10, 'a')
|
||||
b = Sommets(8,'b')
|
||||
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 = []
|
||||
verification_id = True
|
||||
for elem in tree1.nodes:
|
||||
liste_id.append(elem.identifier)
|
||||
for elem in arbre1.sommets:
|
||||
liste_id.append(elem.identifiant)
|
||||
if len(liste_id) > len(set(liste_id)):
|
||||
verification_id = False
|
||||
|
||||
self.assertTrue(verification_id)
|
||||
|
||||
def test_Tree_fusion(self):
|
||||
# fusion des trees
|
||||
# on doit retrouver les éléments des 2 trees + une nouvelle root
|
||||
# les identifiers doivent toujours être uniques
|
||||
a = Node(10, 'a')
|
||||
b = Node(8,'b')
|
||||
r1 = Node(18,'',left=b,right=a)
|
||||
c = Node(15, 'c')
|
||||
d = Node(20,'d')
|
||||
r2 = Node(18,'',left=d,right=c)
|
||||
def test_Arbre_fusion(self):
|
||||
# fusion des arbres
|
||||
# on doit retrouver les éléments des 2 arbres + une nouvelle racine
|
||||
# les identifiants doivent toujours être uniques
|
||||
a = Sommets(10, 'a')
|
||||
b = Sommets(8,'b')
|
||||
r1 = Sommets(18,'',left=b,right=a)
|
||||
c = Sommets(15, 'c')
|
||||
d = Sommets(20,'d')
|
||||
r2 = Sommets(18,'',left=d,right=c)
|
||||
|
||||
tree1 = Tree(r1)
|
||||
tree2 = Tree(r2)
|
||||
arbre1 = Arbre(r1)
|
||||
arbre2 = Arbre(r2)
|
||||
|
||||
l1 = len(tree1.nodes)
|
||||
l2 = len(tree2.nodes)
|
||||
tree1 += tree2
|
||||
l1 = len(arbre1.sommets)
|
||||
l2 = len(arbre2.sommets)
|
||||
arbre1 += arbre2
|
||||
verification_fusion = True
|
||||
if l1+l2+1 != len(tree1.nodes):
|
||||
if l1+l2+1 != len(arbre1.sommets):
|
||||
verification_fusion = False
|
||||
|
||||
liste_id2 = []
|
||||
verification_id2 = True
|
||||
for elem in tree1.nodes:
|
||||
liste_id2.append(elem.identifier)
|
||||
for elem in arbre1.sommets:
|
||||
liste_id2.append(elem.identifiant)
|
||||
if len(liste_id2) > len(set(liste_id2)):
|
||||
verification_id2 = False
|
||||
|
||||
self.assertTrue(verification_fusion)
|
||||
self.assertTrue(verification_id2)
|
||||
|
||||
def test_Tree_seek(self):
|
||||
# seek de node
|
||||
a = Node(10, 'a')
|
||||
b = Node(8,'b')
|
||||
r1 = Node(18,'',left=b,right=a)
|
||||
def test_Arbre_recherche(self):
|
||||
# recherche de sommet
|
||||
a = Sommets(10, 'a')
|
||||
b = Sommets(8,'b')
|
||||
r1 = Sommets(18,'',left=b,right=a)
|
||||
|
||||
tree1 = Tree(r1)
|
||||
arbre1 = Arbre(r1)
|
||||
|
||||
self.assertEqual(tree1.seek(a),a)
|
||||
self.assertNotEqual(tree1.seek(b),a)
|
||||
self.assertEqual(arbre1.recherche(a),a)
|
||||
self.assertNotEqual(arbre1.recherche(b),a)
|
||||
|
||||
def test_Tree_suppression(self):
|
||||
a = Node(10, 'a')
|
||||
b = Node(8,'b')
|
||||
r1 = Node(18,'',left=b,right=a)
|
||||
r2 = Node(18,'',left=None,right=r1)
|
||||
def test_Arbre_suppression(self):
|
||||
a = Sommets(10, 'a')
|
||||
b = Sommets(8,'b')
|
||||
r1 = Sommets(18,'',left=b,right=a)
|
||||
r2 = Sommets(18,'',left=None,right=r1)
|
||||
|
||||
tree1 = Tree(r2)
|
||||
arbre1 = Arbre(r2)
|
||||
|
||||
tree1 -= r1
|
||||
self.assertEqual(tree1.seek(a),None)
|
||||
self.assertEqual(tree1.seek(b),None)
|
||||
self.assertEqual(tree1.seek(r1),None)
|
||||
self.assertEqual(tree1.seek(r2),r2)
|
||||
arbre1 -= r1
|
||||
self.assertEqual(arbre1.recherche(a),None)
|
||||
self.assertEqual(arbre1.recherche(b),None)
|
||||
self.assertEqual(arbre1.recherche(r1),None)
|
||||
self.assertEqual(arbre1.recherche(r2),r2)
|
||||
|
||||
def test_occurences(self):
|
||||
o1 = calcul_occurence('aaabcc')
|
||||
@ -114,27 +96,27 @@ class TestUtils(unittest.TestCase):
|
||||
def test_encodage_huffman(self):
|
||||
string = 'mouton'
|
||||
string2 = 'vache'
|
||||
(encodedOutput, root, huffmanEncoding) = huffman_encode(string)
|
||||
(encodedOutput2, root2, huffmanEncoding2) = huffman_encode(string2)
|
||||
# l'encodage doit être différent (les dictionnaires et trees aussi)
|
||||
(encodedOutput, racine, huffmanEncoding) = huffman_encode(string)
|
||||
(encodedOutput2, racine2, huffmanEncoding2) = huffman_encode(string2)
|
||||
# l'encodage doit être différent (les dictionnaires et arbres aussi)
|
||||
self.assertNotEqual(huffmanEncoding, huffmanEncoding2)
|
||||
self.assertNotEqual(encodedOutput, encodedOutput2)
|
||||
self.assertNotEqual(Tree(root),Tree(root2))
|
||||
self.assertNotEqual(Arbre(racine),Arbre(racine2))
|
||||
|
||||
def test_decodage_huffman(self):
|
||||
string = 'chèvre'
|
||||
(encodedOutput, root, huffmanEncoding) = huffman_encode(string)
|
||||
# on doit être capable de décoder avec la root de l'tree ou avec le dictionnaire
|
||||
self.assertEqual(string,huffman_decode(encodedOutput,root))
|
||||
self.assertEqual(string,decode_from_dict(encodedOutput,huffmanEncoding))
|
||||
(encodedOutput, racine, huffmanEncoding) = huffman_encode(string)
|
||||
# on doit être capable de décoder avec la racine de l'arbre ou avec le dictionnaire
|
||||
self.assertEqual(string,huffman_decode(encodedOutput,racine))
|
||||
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'
|
||||
(encodedOutput2, root2, huffmanEncoding2) = huffman_encode(string2)
|
||||
(encodedOutput2, racine2, huffmanEncoding2) = huffman_encode(string2)
|
||||
with self.assertRaises(ValueError):
|
||||
decode_from_dict(encodedOutput2,huffmanEncoding)
|
||||
decode_from_dico(encodedOutput2,huffmanEncoding)
|
||||
with self.assertRaises(ValueError):
|
||||
huffman_decode(encodedOutput2,root)
|
||||
huffman_decode(encodedOutput2,racine)
|
||||
|
||||
|
||||
if __name__ == '__main__':
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user