summaryrefslogtreecommitdiff
path: root/prolog/problems/clp_fd/puzzle_ratio_2
diff options
context:
space:
mode:
authorAleksander Sadikov <aleksander.sadikov@fri.uni-lj.si>2015-12-15 10:44:52 +0100
committerAleksander Sadikov <aleksander.sadikov@fri.uni-lj.si>2015-12-15 10:46:19 +0100
commitf22468b134a88fcd7acb1415c9997f578f1abe7b (patch)
tree51fbea9facbd7032cd4c55ef5a73eef2d5fd7536 /prolog/problems/clp_fd/puzzle_ratio_2
parentb7607719d8ee14ac6bf261ff82cb565a65b915d6 (diff)
Add tests for Prolog.clp_fd
Diffstat (limited to 'prolog/problems/clp_fd/puzzle_ratio_2')
-rw-r--r--prolog/problems/clp_fd/puzzle_ratio_2/common.py36
1 files changed, 36 insertions, 0 deletions
diff --git a/prolog/problems/clp_fd/puzzle_ratio_2/common.py b/prolog/problems/clp_fd/puzzle_ratio_2/common.py
index 73b9234..eca7f62 100644
--- a/prolog/problems/clp_fd/puzzle_ratio_2/common.py
+++ b/prolog/problems/clp_fd/puzzle_ratio_2/common.py
@@ -1,5 +1,9 @@
# coding=utf-8
+from operator import itemgetter
+import prolog.engine
+import server.problems
+
id = 154
number = 59
visible = True
@@ -16,3 +20,35 @@ puzzle_ratio(A, B) :-
A #< 200,
B #< 200,
labeling([], [A, B]).'''
+
+test_cases = [
+ ('puzzle_ratio(A, B)',
+ [{'A': '30', 'B': '24'}]),
+ ('setof(A/B, puzzle_ratio(A, B), X)',
+ [{'X': '[30/24]'}]),
+]
+
+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:
+ if prolog.engine.check_answers(engine_id, query=query, 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 []