diff options
Diffstat (limited to 'prolog/problems/lists/rev_2')
-rw-r--r-- | prolog/problems/lists/rev_2/common.py | 52 | ||||
-rw-r--r-- | prolog/problems/lists/rev_2/en.py | 15 | ||||
-rw-r--r-- | prolog/problems/lists/rev_2/sl.py | 15 |
3 files changed, 0 insertions, 82 deletions
diff --git a/prolog/problems/lists/rev_2/common.py b/prolog/problems/lists/rev_2/common.py deleted file mode 100644 index 408389a..0000000 --- a/prolog/problems/lists/rev_2/common.py +++ /dev/null @@ -1,52 +0,0 @@ -# coding=utf-8 - -from operator import itemgetter -import prolog.engine -import server.problems - -id = 111 -number = 18 -visible = False -facts = None - -solution = '''\ -conc111([], L, L). -conc111([H|T], L2, [H|L]) :- - conc111(T, L2, L). -rev([], []). -rev([H|T], R):- - rev(T, R1), - conc111(R1, [H], R). -''' - -test_cases = [ - ('rev([], X)', - [{'X': '[]'}]), - ('rev([s, k, c, d, d], X)', - [{'X': '[d, d, c, k, s]'}]), - ('rev(X, [s, k, c, d, d])', - [{'X': '[d, d, c, k, s]'}]), -] - -def test(code, aux_code): - n_correct = 0 - engine_id = None - try: - engine_id, output = prolog.engine.create(code=code+aux_code, timeout=1.0) - if engine_id is not None and 'error' not in map(itemgetter(0), output): - # Engine successfully created, and no syntax error in program. - for query, answers in test_cases: - if prolog.engine.check_answers(engine_id, query=query, answers=answers, timeout=1.0): - n_correct += 1 - except socket.timeout: - pass - finally: - if engine_id: - prolog.engine.destroy(engine_id) - - hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_cases)}}] - return n_correct, len(test_cases), hints - -def hint(code, aux_code): - # TODO - return [] diff --git a/prolog/problems/lists/rev_2/en.py b/prolog/problems/lists/rev_2/en.py deleted file mode 100644 index 3ae126e..0000000 --- a/prolog/problems/lists/rev_2/en.py +++ /dev/null @@ -1,15 +0,0 @@ -# coding=utf-8 - -name = 'rev/2' -slug = 'reverse a list' - -description = '''\ -<p><code>rev(L1, L2)</code>: the list <code>L2</code> is obtained from <code>L1</code> by reversing the order of the elements.</p> -<pre> -?- rev([1,2,3], X). - X = [3,2,1]. -?- rev([], X). - X = []. -</pre>''' - -hint = {} diff --git a/prolog/problems/lists/rev_2/sl.py b/prolog/problems/lists/rev_2/sl.py deleted file mode 100644 index ab58a1c..0000000 --- a/prolog/problems/lists/rev_2/sl.py +++ /dev/null @@ -1,15 +0,0 @@ -# coding=utf-8 - -name = 'rev/2' -slug = 'Obrni seznam' - -description = '''\ -<p><code>rev(L1, L2)</code>: seznam <code>L2</code> ima elemente v obratnem vrstnem redu kot seznam <code>L1</code>.</p> -<pre> -?- rev([1,2,3], X). - X = [3,2,1]. -?- rev([], X). - X = []. -</pre>''' - -hint = {} |