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/numberbt_2/common.py | 45 ++++++++++++++++++++++++++++-- prolog/problems/trees/numberbt_2/en.py | 2 -- prolog/problems/trees/numberbt_2/sl.py | 11 ++++++++ 3 files changed, 53 insertions(+), 5 deletions(-) create mode 100644 prolog/problems/trees/numberbt_2/sl.py (limited to 'prolog/problems/trees/numberbt_2') diff --git a/prolog/problems/trees/numberbt_2/common.py b/prolog/problems/trees/numberbt_2/common.py index e75075e..9061a2d 100644 --- a/prolog/problems/trees/numberbt_2/common.py +++ b/prolog/problems/trees/numberbt_2/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 = 139 -number = 44 -visible = False +number = 30 +visible = True facts = None solution = '''\ @@ -12,3 +17,37 @@ numberBT(b(L, _, R), N) :- numberBT(R, RN), N is LN + RN + 1. ''' + +test_cases = [ + ('numberBT(nil, X), X == 0', + [{}]), + ('numberBT(b(b(b(nil,4,nil),2,b(nil,6,nil)),1,b(nil,3,b(nil,5,nil))), X), X == 6', + [{}]), + ('numberBT(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))), X), X == 8', + [{}]), + ('numberBT(b(b(b(b(nil,a,nil),b,nil),c,nil),d,nil), X), X == 4', + [{}]), +] + +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/numberbt_2/en.py b/prolog/problems/trees/numberbt_2/en.py index 99dc9ca..4cab0f8 100644 --- a/prolog/problems/trees/numberbt_2/en.py +++ b/prolog/problems/trees/numberbt_2/en.py @@ -1,5 +1,3 @@ -# coding=utf-8 - name = 'numberBT/2' slug = 'find the number of nodes in a binary tree' diff --git a/prolog/problems/trees/numberbt_2/sl.py b/prolog/problems/trees/numberbt_2/sl.py new file mode 100644 index 0000000..d9f0b34 --- /dev/null +++ b/prolog/problems/trees/numberbt_2/sl.py @@ -0,0 +1,11 @@ +name = 'numberBT/2' +slug = 'preštej število vozlišč v binarnem drevesu' + +description = '''\ +

numberBT(T, N): N je število vozlišč v binarnem drevesuT.

+
+?- numberBT(b(b(nil,2,nil),1,b(nil,3,nil)), N).
+  N = 3.
+
''' + +hint = {} -- cgit v1.2.1