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/insertbt_3/common.py | 64 ++++++++++++++++++++++++++++--
 prolog/problems/trees/insertbt_3/en.py     |  2 -
 prolog/problems/trees/insertbt_3/sl.py     | 14 +++++++
 3 files changed, 75 insertions(+), 5 deletions(-)
 create mode 100644 prolog/problems/trees/insertbt_3/sl.py

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

diff --git a/prolog/problems/trees/insertbt_3/common.py b/prolog/problems/trees/insertbt_3/common.py
index eb1ea94..57c56ee 100644
--- a/prolog/problems/trees/insertbt_3/common.py
+++ b/prolog/problems/trees/insertbt_3/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 = 138
-number = 48
-visible = False
+number = 70
+visible = True
 facts = None
 
 solution = '''\
@@ -19,3 +24,56 @@ deleteBT138(X, b(L, E, R), b(L, E, R1)) :-
 insertBT(X, T, NewT) :-
   deleteBT138(X, NewT, T).
 '''
+
+test_cases = [
+    ('setof(T, insertBT(q,nil,T), X), X == [b(nil,q,nil)]',
+        [{}]),
+    ('''setof(T, insertBT(q, b(b(nil,4,nil),2,nil), T), X),
+                  X == [b(b(nil,2,b(nil,4,nil)),q,nil), b(b(nil,4,nil),2,b(nil,q,nil)),
+                        b(b(nil,4,nil),q,b(nil,2,nil)), b(b(nil,4,b(nil,q,nil)),2,nil),
+                        b(b(nil,q,b(nil,4,nil)),2,nil), b(b(b(nil,4,nil),2,nil),q,nil),
+                        b(b(b(nil,4,nil),q,nil),2,nil), b(b(b(nil,q,nil),4,nil),2,nil)]''',
+        [{}]),
+    ('''setof(T, insertBT(9, b(b(nil,2,b(nil,6,nil)),1,b(nil,3,nil)), T), X),
+                  X == [b(b(nil,1,b(nil,2,b(nil,6,nil))),9,b(nil,3,nil)),
+                        b(b(nil,1,b(b(nil,6,nil),2,nil)),9,b(nil,3,nil)),
+                        b(b(nil,2,b(nil,6,nil)),1,b(nil,3,b(nil,9,nil))),
+                        b(b(nil,2,b(nil,6,nil)),1,b(nil,9,b(nil,3,nil))),
+                        b(b(nil,2,b(nil,6,nil)),1,b(b(nil,3,nil),9,nil)),
+                        b(b(nil,2,b(nil,6,nil)),1,b(b(nil,9,nil),3,nil)),
+                        b(b(nil,2,b(nil,6,nil)),9,b(nil,1,b(nil,3,nil))),
+                        b(b(nil,2,b(nil,6,nil)),9,b(b(nil,3,nil),1,nil)),
+                        b(b(nil,2,b(nil,6,b(nil,9,nil))),1,b(nil,3,nil)),
+                        b(b(nil,2,b(nil,9,b(nil,6,nil))),1,b(nil,3,nil)),
+                        b(b(nil,2,b(b(nil,6,nil),9,nil)),1,b(nil,3,nil)),
+                        b(b(nil,2,b(b(nil,9,nil),6,nil)),1,b(nil,3,nil)),
+                        b(b(nil,9,b(nil,2,b(nil,6,nil))),1,b(nil,3,nil)),
+                        b(b(nil,9,b(b(nil,6,nil),2,nil)),1,b(nil,3,nil)),
+                        b(b(b(nil,2,nil),1,b(nil,6,nil)),9,b(nil,3,nil)),
+                        b(b(b(nil,2,nil),9,b(nil,6,nil)),1,b(nil,3,nil)),
+                        b(b(b(nil,9,nil),2,b(nil,6,nil)),1,b(nil,3,nil))]''',
+        [{}]),
+]
+
+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/insertbt_3/en.py b/prolog/problems/trees/insertbt_3/en.py
index c0fa47c..1205868 100644
--- a/prolog/problems/trees/insertbt_3/en.py
+++ b/prolog/problems/trees/insertbt_3/en.py
@@ -1,5 +1,3 @@
-# coding=utf-8
-
 name = 'insertBT/3'
 slug = 'insert an element into a binary tree'
 
diff --git a/prolog/problems/trees/insertbt_3/sl.py b/prolog/problems/trees/insertbt_3/sl.py
new file mode 100644
index 0000000..f3339fd
--- /dev/null
+++ b/prolog/problems/trees/insertbt_3/sl.py
@@ -0,0 +1,14 @@
+name = 'insertBT/3'
+slug = 'vstavi element v binarno drevo'
+
+description = '''\
+<p><code>insertBT(X, T, NewT)</code>: binarno drevo <code>NewT</code> dobimo tako, da v <code>T</code> vstavimo element <code>X</code> na poljubno mesto. Tvoj program naj vrača vse možne rešitve.</p>
+<pre>
+?- insertBT(2, b(nil,1,nil), T).
+  T = b(b(nil,1,nil),2,nil) ;
+  T = b(nil,2,b(nil,1,nil)) ;
+  T = b(b(nil,2,nil),1,nil) ;
+  T = b(nil,1,b(nil,2,nil)).
+</pre>'''
+
+hint = {}
-- 
cgit v1.2.1