import re from python.util import has_token_sequence, string_almost_equal, \ string_contains_number, get_tokens, get_numbers, get_exception_desc from server.hints import Hint id = 20607 number = 8 visible = True solution = '''\ def children(tree, name): if name in tree: return tree[name] return [] ''' hint_type = { 'final_hint': Hint('final_hint') } def test(python, code): func_name = 'children' tokens = get_tokens(code) if not has_token_sequence(tokens, ['def', func_name]): return False, [{'id' : 'no_func_name', 'args' : {'func_name' : func_name}}] tree = { 'alice': ['mary', 'tom', 'judy'], 'bob': ['mary', 'tom', 'judy'], 'ken': ['suzan'], 'renee': ['rob', 'bob'], 'rob': ['jim'], 'sid': ['rob', 'bob'], 'tom': ['ken']} in_out = [ ((tree, 'alice'), ['mary', 'tom', 'judy']), ((tree, 'mary'), []), ((tree, 'renee'), ['rob', 'bob']), ((tree, 'rob'), ['jim']), ((tree, 'suzan'), []), ] test_in = [(func_name+'%s'%str(l[0]), None) for l in in_out] test_out = [l[1] for l in in_out] answers = python(code=code, inputs=test_in, timeout=1.0) n_correct = 0 tin, tout = None, None for i, (ans, to) in enumerate(zip(answers, test_out)): corr = set(ans[0]) == set(to) and len(ans[0]) == len(to) n_correct += corr if not corr: tin = test_in[i][0] tout = to passed = n_correct == len(test_in) hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_in)}}] if tin: hints.append({'id': 'problematic_test_case', 'args': {'testin': str(tin), 'testout': str(tout)}}) if passed: hints.append({'id': 'final_hint'}) return passed, hints def hint(python, code): tokens = get_tokens(code) # run one test first to see if there are any exceptions answer = python(code=code, inputs=[(None, None)], timeout=1.0) exc = get_exception_desc(answer[0][3]) if exc: return exc return None