From acce0e01cdb2a57cda35e040035dbf1da6b96031 Mon Sep 17 00:00:00 2001 From: Timotej Lazar Date: Mon, 11 Apr 2016 00:10:57 +0200 Subject: Prolog: add test cases for the trees group --- prolog/problems/trees/deletebt_3/common.py | 52 ++++++++++++++++++++++++++++-- prolog/problems/trees/deletebt_3/en.py | 2 -- prolog/problems/trees/deletebt_3/sl.py | 13 ++++++++ 3 files changed, 62 insertions(+), 5 deletions(-) create mode 100644 prolog/problems/trees/deletebt_3/sl.py (limited to 'prolog/problems/trees/deletebt_3') diff --git a/prolog/problems/trees/deletebt_3/common.py b/prolog/problems/trees/deletebt_3/common.py index 52f9e3f..748fcbf 100644 --- a/prolog/problems/trees/deletebt_3/common.py +++ b/prolog/problems/trees/deletebt_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 = 137 -number = 47 -visible = False +number = 60 +visible = True facts = None solution = '''\ @@ -16,3 +21,44 @@ deleteBT(X, b(L, E, R), b(L1, E, R)) :- deleteBT(X, b(L, E, R), b(L, E, R1)) :- deleteBT(X, R, R1). ''' + +test_cases = [ + ('deleteBT(q, b(nil,q,nil), X), X == nil', + [{}]), + ('''setof(T, deleteBT(2, b(b(b(nil,4,nil),2,b(nil,6,nil)),1,b(nil,3,b(nil,5,nil))), T), X), + X == [b(b(nil,4,b(nil,6,nil)),1,b(nil,3,b(nil,5,nil))),b(b(b(nil,4,nil),6,nil),1,b(nil,3,b(nil,5,nil)))]''', + [{}]), + ('''setof(T, deleteBT(8, 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))), T), X), + X == [b(b(b(nil,7,nil),3,b(nil,2,nil)),8,b(b(nil,4,nil),8,b(nil,1,nil))), + b(b(b(nil,8,nil),7,b(nil,2,nil)),3,b(b(nil,4,nil),8,b(nil,1,nil))), + b(b(b(b(nil,8,nil),7,nil),2,nil),3,b(b(nil,4,nil),8,b(nil,1,nil))), + b(b(b(b(nil,8,nil),7,nil),3,b(nil,2,nil)),8,b(nil,4,b(nil,1,nil))), + b(b(b(b(nil,8,nil),7,nil),3,b(nil,2,nil)),8,b(b(nil,4,nil),1,nil))]''', + [{}]), + ('''setof(T, deleteBT(2, 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))), T), X), + X == [b(b(b(b(nil,8,nil),7,nil),3,nil),8,b(b(nil,4,nil),8,b(nil,1,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/deletebt_3/en.py b/prolog/problems/trees/deletebt_3/en.py index eedab0a..14f2f1c 100644 --- a/prolog/problems/trees/deletebt_3/en.py +++ b/prolog/problems/trees/deletebt_3/en.py @@ -1,5 +1,3 @@ -# coding=utf-8 - name = 'deleteBT/3' slug = 'delete an element from a binary tree' diff --git a/prolog/problems/trees/deletebt_3/sl.py b/prolog/problems/trees/deletebt_3/sl.py new file mode 100644 index 0000000..7a1d930 --- /dev/null +++ b/prolog/problems/trees/deletebt_3/sl.py @@ -0,0 +1,13 @@ +name = 'deleteBT/3' +slug = 'izbriši element iz binarnega drevesa' + +description = '''\ +

deleteBT(X, T, NewT): binarno drevo NewT dobimo iz T tako, da izbrišemo eno pojavitev elementa X. Če X ni v listu, ga zamenjamo s korenom levega ali desnega poddrevesa. Program naj vrača vse veljavne rešitve.

+
+?- deleteBT(1, b(b(b(nil,4,nil),2,b(nil,6,nil)),1,b(nil,3,b(nil,5,nil))), T).
+  T = b(b(nil,4,b(nil,6,nil)),2,b(nil,3,b(nil,5,nil))) ;
+  T = b(b(b(nil,4,nil),6,nil),2,b(nil,3,b(nil,5,nil))) ;
+  T = b(b(b(nil,4,nil),2,b(nil,6,nil)),3,b(nil,5,nil)).
+
''' + +hint = {} -- cgit v1.2.1