raj_mathe/logik2021
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

master > master: Verschönerung vom Skript

Browse Source
This commit is contained in:
RD 2021-05-06 12:55:11 +02:00
parent 7fc5852fc9
commit d94d508e8c
1 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
code/utests/u_rekursion.py
View File

@ -25,10 +25,10 @@ from aussagenlogik.rekursion import rekursiv_eval;
# TESTFALL Atome(·) # TESTFALL Atome(·)
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ # ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
@unittest.skip("Methode noch nicht implementiert") @unittest.skip('Methode noch nicht implementiert')
class TestRekursivAtoms(TestCase): class TestRekursivAtoms(TestCase):
def test_noduplicates(self): def test_noduplicates(self):
fml = string_to_parts('( A4 && ( A4 || A4 ) )'); fml = string_to_parts('( A4 && ( A4 || A4 ))');
val = sorted(rekursiv_atoms(fml)); val = sorted(rekursiv_atoms(fml));
assert len([_ for _ in val if _ == 'A4']) == 1, 'Atome dürfen nicht mehrfach vorkommen!'; assert len([_ for _ in val if _ == 'A4']) == 1, 'Atome dürfen nicht mehrfach vorkommen!';
@ -52,7 +52,7 @@ class TestRekursivAtoms(TestCase):
# TESTFALL Depth(·) # TESTFALL Depth(·)
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ # ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
@unittest.skip("Methode noch nicht implementiert") @unittest.skip('Methode noch nicht implementiert')
class TestRekursivDepth(TestCase): class TestRekursivDepth(TestCase):
def test_calc1(self): def test_calc1(self):
fml = string_to_parts('A0'); fml = string_to_parts('A0');
@ -65,7 +65,7 @@ class TestRekursivDepth(TestCase):
assert val == 2, 'computed {}'.format(val); assert val == 2, 'computed {}'.format(val);
def test_calc3(self): def test_calc3(self):
fml = string_to_parts('(! A0 && A3 )'); fml = string_to_parts('( ! A0 && A3 )');
val = rekursiv_depth(fml); val = rekursiv_depth(fml);
assert val == 2, 'computed {}'.format(val); assert val == 2, 'computed {}'.format(val);
@ -84,7 +84,7 @@ class TestRekursivDepth(TestCase):
# TESTFALL Länge(·) # TESTFALL Länge(·)
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ # ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
@unittest.skip("Methode noch nicht implementiert") @unittest.skip('Methode noch nicht implementiert')
class TestRekursivLength(TestCase): class TestRekursivLength(TestCase):
def test_calc1(self): def test_calc1(self):
fml = string_to_parts('A0'); fml = string_to_parts('A0');
@ -97,7 +97,7 @@ class TestRekursivLength(TestCase):
assert val == 3, 'computed {}'.format(val); assert val == 3, 'computed {}'.format(val);
def test_calc3(self): def test_calc3(self):
fml = string_to_parts('(! A0 && A3 )'); fml = string_to_parts('( ! A0 && A3 )');
val = rekursiv_length(fml); val = rekursiv_length(fml);
assert val == 4, 'computed {}'.format(val); assert val == 4, 'computed {}'.format(val);
@ -117,7 +117,7 @@ class TestRekursivLength(TestCase):
# TESTFALL Anzahl Klammern(·) # TESTFALL Anzahl Klammern(·)
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ # ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
@unittest.skip("Methode noch nicht implementiert") @unittest.skip('Methode noch nicht implementiert')
class TestRekursivParentheses(TestCase): class TestRekursivParentheses(TestCase):
def test_calc1(self): def test_calc1(self):
fml = string_to_parts('A0'); fml = string_to_parts('A0');
@ -130,7 +130,7 @@ class TestRekursivParentheses(TestCase):
assert val == 0, 'computed {}'.format(val); assert val == 0, 'computed {}'.format(val);
def test_calc3(self): def test_calc3(self):
fml = string_to_parts('(! A0 && A3 )'); fml = string_to_parts('( ! A0 && A3 )');
val = rekursiv_parentheses(fml); val = rekursiv_parentheses(fml);
assert val == 2, 'computed {}'.format(val); assert val == 2, 'computed {}'.format(val);
@ -150,7 +150,7 @@ class TestRekursivParentheses(TestCase):
# TESTFALL eval(·, ·) # TESTFALL eval(·, ·)
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ # ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# @unittest.skip("Methode noch nicht implementiert") # @unittest.skip('Methode noch nicht implementiert')
class TestRekursivEval(TestCase): class TestRekursivEval(TestCase):
def test_literale(self): def test_literale(self):
fml = string_to_parts('A0'); fml = string_to_parts('A0');
@ -167,7 +167,7 @@ class TestRekursivEval(TestCase):
assert val == 1; assert val == 1;
def test_complex1(self): def test_complex1(self):
fml = string_to_parts('( ! A0 || (( A0 && A3 ) || A2 ) )'); fml = string_to_parts('( ! A0 || (( A0 && A3 ) || A2 ))');
val = rekursiv_eval(fml, [ 'A0', 'A2' ]); val = rekursiv_eval(fml, [ 'A0', 'A2' ]);
assert val == 1; assert val == 1;
val = rekursiv_eval(fml, [ 'A0', 'A3' ]); val = rekursiv_eval(fml, [ 'A0', 'A3' ]);
@ -178,7 +178,7 @@ class TestRekursivEval(TestCase):
assert val == 1; assert val == 1;
def test_complex2(self): def test_complex2(self):
fml = string_to_parts('( ! A0 || (( A0 && A3 ) || ! A2) )'); fml = string_to_parts('( ! A0 || (( A0 && A3 ) || ! A2 ))');
val = rekursiv_eval(fml, [ 'A0', 'A2' ]); val = rekursiv_eval(fml, [ 'A0', 'A2' ]);
assert val == 0; assert val == 0;
val = rekursiv_eval(fml, [ 'A0', 'A3' ]); val = rekursiv_eval(fml, [ 'A0', 'A3' ]);