From acce0e01cdb2a57cda35e040035dbf1da6b96031 Mon Sep 17 00:00:00 2001
From: Timotej Lazar <timotej.lazar@fri.uni-lj.si>
Date: Mon, 11 Apr 2016 00:10:57 +0200
Subject: Prolog: add test cases for the trees group

---
 prolog/problems/trees/maxt_2/common.py | 43 +++++++++++++++++++++++++++++++---
 prolog/problems/trees/maxt_2/en.py     |  2 --
 prolog/problems/trees/maxt_2/sl.py     | 11 +++++++++
 3 files changed, 51 insertions(+), 5 deletions(-)
 create mode 100644 prolog/problems/trees/maxt_2/sl.py

(limited to 'prolog/problems/trees/maxt_2')

diff --git a/prolog/problems/trees/maxt_2/common.py b/prolog/problems/trees/maxt_2/common.py
index b1cdb39..5c842d5 100644
--- a/prolog/problems/trees/maxt_2/common.py
+++ b/prolog/problems/trees/maxt_2/common.py
@@ -1,8 +1,13 @@
-# coding=utf-8
+from operator import itemgetter
+import socket
+
+import prolog.engine
+import prolog.util
+from server.hints import Hint, HintPopup
 
 id = 143
-number = 50
-visible = False
+number = 90
+visible = True
 facts = None
 
 solution = '''\
@@ -24,3 +29,35 @@ getMaxElems([SubTree|SubTrees], [MaxElem|MaxElems]) :-
   maxT(SubTree, MaxElem),
   getMaxElems(SubTrees, MaxElems).
 '''
+
+test_cases = [
+    ('maxT(t(666), X), X == 666',
+        [{}]),
+    ('setof(M, maxT(t(3,t(2,t(3),t(6)),t(-1,t(0,t(8)),t(1))), M), X), X == [8]',
+        [{}]),
+    ('setof(M, maxT(t(-3,t(-2,t(-3),t(-6)),t(-11,t(-1,t(-8)),t(-10))), M), X), X == [-1]',
+        [{}]),
+]
+
+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/trees/maxt_2/en.py b/prolog/problems/trees/maxt_2/en.py
index bb222f8..7a8f59b 100644
--- a/prolog/problems/trees/maxt_2/en.py
+++ b/prolog/problems/trees/maxt_2/en.py
@@ -1,5 +1,3 @@
-# coding=utf-8
-
 name = 'maxT/2'
 slug = 'find the greatest element in a tree'
 
diff --git a/prolog/problems/trees/maxt_2/sl.py b/prolog/problems/trees/maxt_2/sl.py
new file mode 100644
index 0000000..17db5e1
--- /dev/null
+++ b/prolog/problems/trees/maxt_2/sl.py
@@ -0,0 +1,11 @@
+name = 'maxT/2'
+slug = 'poišči največji element v drevesu'
+
+description = '''\
+<p><code>maxT(Tree, Max)</code>: <code>Max</code> je največji element v drevesu <code>Tree</code>.</p>
+<pre>
+?- maxT(t(1, t(2), t(3)), Max).
+  Max = 3.
+</pre>'''
+
+hint = {}
-- 
cgit v1.2.1