Add test function for prolog/sets/union_3

1 files changed, 42 insertions, 0 deletions

diff --git a/prolog/problems/sets/union_3/common.py b/prolog/problems/sets/union_3/common.py
index 2a14245..807bce6 100644
--- a/prolog/problems/sets/union_3/common.py
+++ b/prolog/problems/sets/union_3/common.py
@@ -1,5 +1,9 @@
 # coding=utf-8
 
+from operator import itemgetter
+import prolog.engine
+import server.problems
+
 id = 128
 number = 35
 visible = True
@@ -18,3 +22,41 @@ union([H|T], S2, U) :-
   memb128(H, S2),
   union(T, S2, U).
 '''
+
+test_cases = [
+    ('union([], [3,2,5,1], A), msort(A, X)',
+        [{'X': '[1, 2, 3, 5]'}]),
+    ('union([3,2,5,1], [], A), msort(A, X)',
+        [{'X': '[1, 2, 3, 5]'}]),
+    ('union([3,2,5,1], [8,4,2,3,5,1,9], A), msort(A, X)',
+        [{'X': '[1, 2, 3, 4, 5, 8, 9]'}]),
+    ('union([2,3,5,1,9], [3,0,9,5,6], A), msort(A, X)',
+        [{'X': '[0, 1, 2, 3, 5, 6, 9]'}]),
+]
+
+def test(program, solved_problems):
+    code = (program + '\n' +
+            server.problems.solutions_for_problems('prolog', solved_problems))
+
+    n_correct = 0
+    engine_id = None
+    try:
+        engine_id, output = prolog.engine.create(code=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:
+                # Limit inferences for each solution to curb unbounded recursion.
+                limited = 'call_with_inference_limit(({}), 100000, _)'.format(query)
+                if prolog.engine.check_answers(engine_id, query=limited, answers=answers, timeout=1.0):
+                    n_correct += 1
+    finally:
+        if engine_id:
+            prolog.engine.destroy(engine_id)
+
+    passed = n_correct == len(test_cases)
+    hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_cases)}}]
+    return passed, hints
+
+def hint(program, solved_problems):
+    # TODO
+    return []