summaryrefslogtreecommitdiff
path: root/prolog/problems/sorting
diff options
context:
space:
mode:
authorAleksander Sadikov <aleksander.sadikov@fri.uni-lj.si>2015-12-14 15:24:48 +0100
committerAleksander Sadikov <aleksander.sadikov@fri.uni-lj.si>2015-12-14 15:25:36 +0100
commit79f4196a6b86c6090ab0fb915d05bebc3a627783 (patch)
treea07a40daa67a77c55ccf43d797fca6369adba06c /prolog/problems/sorting
parent384d3c501a38b489312496b0bf9522bdf29053d8 (diff)
Add tests for Prolog.{sorting,sets,license_plates}
Diffstat (limited to 'prolog/problems/sorting')
-rw-r--r--prolog/problems/sorting/is_sorted_1/common.py46
-rw-r--r--prolog/problems/sorting/isort_2/common.py40
-rw-r--r--prolog/problems/sorting/pivoting_4/common.py40
-rw-r--r--prolog/problems/sorting/quick_sort_2/common.py40
-rw-r--r--prolog/problems/sorting/sins_3/common.py42
-rw-r--r--prolog/problems/sorting/slowest_sort_ever_2/common.py40
6 files changed, 248 insertions, 0 deletions
diff --git a/prolog/problems/sorting/is_sorted_1/common.py b/prolog/problems/sorting/is_sorted_1/common.py
index 8feb549..9213ddc 100644
--- a/prolog/problems/sorting/is_sorted_1/common.py
+++ b/prolog/problems/sorting/is_sorted_1/common.py
@@ -1,5 +1,9 @@
# coding=utf-8
+from operator import itemgetter
+import prolog.engine
+import server.problems
+
id = 121
number = 28
visible = True
@@ -12,3 +16,45 @@ is_sorted([H1,H2|T]) :-
H1 =< H2,
is_sorted([H2|T]).
'''
+
+test_cases = [
+ ('is_sorted([])',
+ [{}]),
+ ('is_sorted([5, 6, 13, 555, 2111, 2112])',
+ [{}]),
+ ('is_sorted([2, 5, 5, 13, 555, 2111, 2112])',
+ [{}]),
+ ('is_sorted([-2])',
+ [{}]),
+ ('is_sorted([-42, -42, -42, -42])',
+ [{}]),
+ ('\+ is_sorted([3, 4, 5, 6, 1, 2, 3])',
+ [{}]),
+ ('\+ is_sorted([3, 4, 5, 6, 1, 2, 3, 0])',
+ [{}]),
+]
+
+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 []
diff --git a/prolog/problems/sorting/isort_2/common.py b/prolog/problems/sorting/isort_2/common.py
index f2c4244..6041b35 100644
--- a/prolog/problems/sorting/isort_2/common.py
+++ b/prolog/problems/sorting/isort_2/common.py
@@ -1,5 +1,9 @@
# coding=utf-8
+from operator import itemgetter
+import prolog.engine
+import server.problems
+
id = 123
number = 30
visible = True
@@ -17,3 +21,39 @@ isort([H|T], SL) :-
isort(T, ST),
sins123(H, ST, SL).
'''
+
+test_cases = [
+ ('isort([], X)',
+ [{'X': '[]'}]),
+ ('isort([5, 3, 5, 5, 1, 2, 0], X)',
+ [{'X': '[0, 1, 2, 3, 5, 5, 5]'}]),
+ ('isort([2, 1, 3, 5, 6, 0, 22, 3], X)',
+ [{'X': '[0, 1, 2, 3, 3, 5, 6, 22]'}]),
+ ('isort([5, 4, 3, 2, 1], X)',
+ [{'X': '[1, 2, 3, 4, 5]'}]),
+]
+
+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 []
diff --git a/prolog/problems/sorting/pivoting_4/common.py b/prolog/problems/sorting/pivoting_4/common.py
index dd1a1a9..0e9afaa 100644
--- a/prolog/problems/sorting/pivoting_4/common.py
+++ b/prolog/problems/sorting/pivoting_4/common.py
@@ -1,5 +1,9 @@
# coding=utf-8
+from operator import itemgetter
+import prolog.engine
+import server.problems
+
id = 124
number = 31
visible = True
@@ -14,3 +18,39 @@ pivoting(P, [H|T], S, [H|G]) :-
H > P,
pivoting(P, T, S, G).
'''
+
+test_cases = [
+ ('pivoting(5, [], A, B)',
+ [{'A': '[]', 'B': '[]'}]),
+ ('pivoting(5, [6, 7, 6], A, B)',
+ [{'A': '[]', 'B': '[6, 7, 6]'}]),
+ ('pivoting(4, [2, 1, 8, 9, 3, 4, 2], A, B)',
+ [{'A': '[2, 1, 3, 4, 2]', 'B': '[8, 9]'}]),
+ ('pivoting(4, [22, 1, 0, 8, 3, 5, 7, -2], A, B)',
+ [{'A': '[1, 0, 3, -2]', 'B': '[22, 8, 5, 7]'}]),
+]
+
+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 []
diff --git a/prolog/problems/sorting/quick_sort_2/common.py b/prolog/problems/sorting/quick_sort_2/common.py
index 4afc8fa..b1449f1 100644
--- a/prolog/problems/sorting/quick_sort_2/common.py
+++ b/prolog/problems/sorting/quick_sort_2/common.py
@@ -1,5 +1,9 @@
# coding=utf-8
+from operator import itemgetter
+import prolog.engine
+import server.problems
+
id = 125
number = 32
visible = True
@@ -23,3 +27,39 @@ quick_sort([Pivot|T], Sorted) :-
quick_sort(Greater, SortedGreater),
conc125(SortedSmaller, [Pivot|SortedGreater], Sorted).
'''
+
+test_cases = [
+ ('quick_sort([], X)',
+ [{'X': '[]'}]),
+ ('quick_sort([5, 3, 5, 5, 1, 2, 0], X)',
+ [{'X': '[0, 1, 2, 3, 5, 5, 5]'}]),
+ ('quick_sort([2, 1, 3, 5, 6, 0, 22, 3], X)',
+ [{'X': '[0, 1, 2, 3, 3, 5, 6, 22]'}]),
+ ('quick_sort([5, 4, 3, 2, 1], X)',
+ [{'X': '[1, 2, 3, 4, 5]'}]),
+]
+
+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 []
diff --git a/prolog/problems/sorting/sins_3/common.py b/prolog/problems/sorting/sins_3/common.py
index ab592ea..4c707ca 100644
--- a/prolog/problems/sorting/sins_3/common.py
+++ b/prolog/problems/sorting/sins_3/common.py
@@ -1,5 +1,9 @@
# coding=utf-8
+from operator import itemgetter
+import prolog.engine
+import server.problems
+
id = 122
number = 29
visible = True
@@ -13,3 +17,41 @@ sins(X, [Y|T], [Y|L]) :-
X > Y,
sins(X, T, L).
'''
+
+test_cases = [
+ ('sins(4, [], X)',
+ [{'X': '[4]'}]),
+ ('sins(4, [1, 2, 5, 6, 8], X)',
+ [{'X': '[1, 2, 4, 5, 6, 8]'}]),
+ ('sins(8, [1, 2, 3, 4, 5, 6, 7], X)',
+ [{'X': '[1, 2, 3, 4, 5, 6, 7, 8]'}]),
+ ('sins(1, [2, 3, 4, 5, 6, 7], X)',
+ [{'X': '[1, 2, 3, 4, 5, 6, 7]'}]),
+ ('sins(2, [2, 3, 4, 5, 6, 7], X)',
+ [{'X': '[2, 2, 3, 4, 5, 6, 7]'}]),
+]
+
+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 []
diff --git a/prolog/problems/sorting/slowest_sort_ever_2/common.py b/prolog/problems/sorting/slowest_sort_ever_2/common.py
index fc8f980..72e25e2 100644
--- a/prolog/problems/sorting/slowest_sort_ever_2/common.py
+++ b/prolog/problems/sorting/slowest_sort_ever_2/common.py
@@ -1,5 +1,9 @@
# coding=utf-8
+from operator import itemgetter
+import prolog.engine
+import server.problems
+
id = 126
number = 33
visible = True
@@ -24,3 +28,39 @@ slowest_sort_ever(L, S) :-
permute126(L, S),
is_sorted126(S).
'''
+
+test_cases = [
+ ('slowest_sort_ever([], X)',
+ [{'X': '[]'}]),
+ ('slowest_sort_ever([5, 3, 5, 1], X)',
+ [{'X': '[1, 3, 5, 5]'}]),
+ ('slowest_sort_ever([2, 1, 5, 6], X)',
+ [{'X': '[1, 2, 5, 6]'}]),
+ ('slowest_sort_ever([5, 4, 3, 2], X)',
+ [{'X': '[2, 3, 4, 5]'}]),
+]
+
+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 []