Prolog: split lists exercises into two groups

3 files changed, 0 insertions, 84 deletions

diff --git a/prolog/problems/lists/palindrome_1/common.py b/prolog/problems/lists/palindrome_1/common.py
deleted file mode 100644
index e9960c6..0000000
--- a/prolog/problems/lists/palindrome_1/common.py
+++ /dev/null
@@ -1,54 +0,0 @@
-# coding=utf-8
-
-from operator import itemgetter
-import prolog.engine
-import server.problems
-
-id = 112
-number = 19
-visible = False
-facts = None
-
-solution = '''\
-conc112([], L, L).
-conc112([H|T], L2, [H|L]) :-
-  conc112(T, L2, L).
-rev112([], []).
-rev112([H|T], R):-
-  rev112(T, R1),
-  conc112(R1, [H], R).
-palindrome(L) :-
-  rev112(L, L).
-'''
-
-test_cases = [
-    ('palindrome([])',
-        [{}]),
-    ('palindrome([a, b, e, A, B, C])',
-        [{'A': 'e', 'B': 'b', 'C': 'a'}]),
-    ('palindrome([b, e, X])',
-        [{'X': 'b'}]),
-]
-
-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/palindrome_1/en.py b/prolog/problems/lists/palindrome_1/en.py
deleted file mode 100644
index 48ee8ac..0000000
--- a/prolog/problems/lists/palindrome_1/en.py
+++ /dev/null
@@ -1,15 +0,0 @@
-# coding=utf-8
-
-name = 'palindrome/1'
-slug = 'check if list is a palindrome'
-
-description = '''\
-<p><code>palindrome(L)</code>: the elements of list <code>L</code> are the same when read from the front or back of the list.</p>
-<pre>
-?- palindrome([1,2,3,2,1]).
-  true.
-?- palindrome([1,2,3]).
-  false.
-</pre>'''
-
-hint = {}
diff --git a/prolog/problems/lists/palindrome_1/sl.py b/prolog/problems/lists/palindrome_1/sl.py
deleted file mode 100644
index ad67d3f..0000000
--- a/prolog/problems/lists/palindrome_1/sl.py
+++ /dev/null
@@ -1,15 +0,0 @@
-# coding=utf-8
-
-name = 'palindrome/1'
-slug = 'Preveri, če elementi seznama tvorijo palindrom'
-
-description = '''\
-<p><code>palindrome(L)</code>: Elementi seznama <code>L</code> se preberejo v istem vrstnem redu z začetka in s konca seznama.</p>
-<pre>
-?- palindrome([1,2,3,2,1]).
-  true.
-?- palindrome([1,2,3]).
-  false.
-</pre>'''
-
-hint = {}