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/depthbt_2/common.py | 45 ++++++++++++++++++++++++++++---
 prolog/problems/trees/depthbt_2/en.py     |  2 --
 prolog/problems/trees/depthbt_2/sl.py     | 11 ++++++++
 3 files changed, 53 insertions(+), 5 deletions(-)
 create mode 100644 prolog/problems/trees/depthbt_2/sl.py

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

diff --git a/prolog/problems/trees/depthbt_2/common.py b/prolog/problems/trees/depthbt_2/common.py
index 4542419..ce04a08 100644
--- a/prolog/problems/trees/depthbt_2/common.py
+++ b/prolog/problems/trees/depthbt_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 = 140
-number = 45
-visible = False
+number = 40
+visible = True
 facts = None
 
 solution = '''\
@@ -16,3 +21,37 @@ depthBT(b(L, _, R), D) :-
    DL < DR,
    D is DR + 1).
 '''
+
+test_cases = [
+	('depthBT(nil, X), X == 0',
+            [{}]),
+	('depthBT(b(b(b(nil,4,nil),2,b(nil,6,nil)),1,b(nil,3,b(nil,5,nil))), X), X == 3',
+            [{}]),
+	('depthBT(b(b(b(b(nil,8,nil),7,nil),3,b(nil,2,nil)),8,b(b(nil,4,nil),8,b(nil,1,nil))), X), X == 4',
+            [{}]),
+	('depthBT(b(b(b(b(nil,a,nil),b,nil),c,nil),d,nil), X), X == 4',
+            [{}]),
+]
+
+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/depthbt_2/en.py b/prolog/problems/trees/depthbt_2/en.py
index c3f7d4c..ff8d8f3 100644
--- a/prolog/problems/trees/depthbt_2/en.py
+++ b/prolog/problems/trees/depthbt_2/en.py
@@ -1,5 +1,3 @@
-# coding=utf-8
-
 name = 'depthBT/2'
 slug = 'find the depth of a binary tree'
 
diff --git a/prolog/problems/trees/depthbt_2/sl.py b/prolog/problems/trees/depthbt_2/sl.py
new file mode 100644
index 0000000..03589e5
--- /dev/null
+++ b/prolog/problems/trees/depthbt_2/sl.py
@@ -0,0 +1,11 @@
+name = 'depthBT/2'
+slug = 'poišči globino binarnega drevesa'
+
+description = '''\
+<p><code>depthBT(T, D)</code>: <code>D</code> je globina binarnega drevesa <code>T</code>.</p>
+<pre>
+?- depthBT(b(b(b(nil,4,nil),2,b(nil,6,nil)),1,nil), D).
+  D = 3.
+</pre>'''
+
+hint = {}
-- 
cgit v1.2.1