Prolog: add test cases for the trees group

3 files changed, 55 insertions, 5 deletions

diff --git a/prolog/problems/trees/memberbt_2/common.py b/prolog/problems/trees/memberbt_2/common.py
index 6df89e3..98c1eb2 100644
--- a/prolog/problems/trees/memberbt_2/common.py
+++ b/prolog/problems/trees/memberbt_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 = 135
-number = 42
-visible = False
+number = 10
+visible = True
 facts = None
 
 solution = '''\
@@ -12,3 +17,37 @@ memberBT(X, b(L, _, _)) :-
 memberBT(X, b(_, _, R)) :-
   memberBT(X, R).
 '''
+
+test_cases = [
+    ('memberBT(M, b(nil,r,nil))',
+        [{'M': 'r'}]),
+    ('memberBT(M, b(b(b(nil,4,nil),2,b(nil,6,nil)),1,b(nil,3,b(nil,5,nil))))',
+        [{'M': '1'}, {'M': '2'}, {'M': '3'}, {'M': '4'}, {'M': '5'},
+         {'M': '6'}]),
+    ('memberBT(M, 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))))',
+        [{'M': '1'}, {'M': '2'}, {'M': '3'}, {'M': '4'}, {'M': '7'},
+         {'M': '8'}]),
+]
+
+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/memberbt_2/en.py b/prolog/problems/trees/memberbt_2/en.py
index 1559151..7c1025b 100644
--- a/prolog/problems/trees/memberbt_2/en.py
+++ b/prolog/problems/trees/memberbt_2/en.py
@@ -1,5 +1,3 @@
-# coding=utf-8
-
 name = 'memberBT/2'
 slug = 'find elements in a binary tree'
 
diff --git a/prolog/problems/trees/memberbt_2/sl.py b/prolog/problems/trees/memberbt_2/sl.py
new file mode 100644
index 0000000..324e6f9
--- /dev/null
+++ b/prolog/problems/trees/memberbt_2/sl.py
@@ -0,0 +1,13 @@
+name = 'memberBT/2'
+slug = 'poišči element v binarnem drevesu'
+
+description = '''\
+<p><code>memberBT(X, T)</code>: <code>X</code> je element binarnega drevesa <code>T</code>. Vozlišče v binarnem drevesu je predstavljeno s strukturo <code>b(L, E, R)</code>, kjer sta <code>L</code> in <code>R</code> levo in desno poddrevo, <code>E</code> pa je vrednost v tem vozlišču. Prazno drevo predstavlja atom <code>nil</code>.</p>
+<pre>
+?- memberBT(X, b(b(nil,2,nil),1,b(nil,3,nil))).
+  X = 1 ;
+  X = 2 ;
+  X = 3.
+</pre>'''
+
+hint = {}