From cf4e59c9d6bce337514fc7d77120baced0d6d7bc Mon Sep 17 00:00:00 2001
From: Timotej Lazar <timotej.lazar@fri.uni-lj.si>
Date: Thu, 17 Mar 2016 14:19:45 +0100
Subject: Prolog: split lists exercises into two groups

---
 .../problems/lists_advanced/palindrome_1/common.py | 54 ++++++++++++++++++++++
 prolog/problems/lists_advanced/palindrome_1/en.py  | 15 ++++++
 prolog/problems/lists_advanced/palindrome_1/sl.py  | 15 ++++++
 3 files changed, 84 insertions(+)
 create mode 100644 prolog/problems/lists_advanced/palindrome_1/common.py
 create mode 100644 prolog/problems/lists_advanced/palindrome_1/en.py
 create mode 100644 prolog/problems/lists_advanced/palindrome_1/sl.py

(limited to 'prolog/problems/lists_advanced/palindrome_1')

diff --git a/prolog/problems/lists_advanced/palindrome_1/common.py b/prolog/problems/lists_advanced/palindrome_1/common.py
new file mode 100644
index 0000000..e9960c6
--- /dev/null
+++ b/prolog/problems/lists_advanced/palindrome_1/common.py
@@ -0,0 +1,54 @@
+# 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_advanced/palindrome_1/en.py b/prolog/problems/lists_advanced/palindrome_1/en.py
new file mode 100644
index 0000000..48ee8ac
--- /dev/null
+++ b/prolog/problems/lists_advanced/palindrome_1/en.py
@@ -0,0 +1,15 @@
+# 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_advanced/palindrome_1/sl.py b/prolog/problems/lists_advanced/palindrome_1/sl.py
new file mode 100644
index 0000000..ad67d3f
--- /dev/null
+++ b/prolog/problems/lists_advanced/palindrome_1/sl.py
@@ -0,0 +1,15 @@
+# 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 = {}
-- 
cgit v1.2.1