diff options
author | Timotej Lazar <timotej.lazar@araneo.org> | 2015-01-16 15:07:32 +0100 |
---|---|---|
committer | Aleš Smodiš <aless@guru.si> | 2015-08-11 14:26:01 +0200 |
commit | 9763725d157003b02417a37e49788b5a8683f46a (patch) | |
tree | 3de64dd85eae57780e27760b8cfd1405eff24f6c /monkey/monkey.py | |
parent | bacad47b87c5c2f9a90734ef13ca98a0961a08bb (diff) |
Move testing code from monkey.py to test.py
Drop monkey/db.py and use Django models instead.
Diffstat (limited to 'monkey/monkey.py')
-rwxr-xr-x | monkey/monkey.py | 170 |
1 files changed, 1 insertions, 169 deletions
diff --git a/monkey/monkey.py b/monkey/monkey.py index 8e805f5..693aa67 100755 --- a/monkey/monkey.py +++ b/monkey/monkey.py @@ -8,11 +8,10 @@ import time from termcolor import colored -from . import db from .action import parse from .edits import classify_edits, clean_graph, edit_graph, get_edits_from_traces from .graph import Node, graphviz -from .prolog.engine import PrologEngine +from .prolog.engine import test from .prolog.util import compose, decompose, map_vars, rename_vars, stringify from .util import PQueue, Token, indent @@ -144,170 +143,3 @@ def fix(name, code, edits, timeout=30, debug=False): add_task(new_lines, new_rules, prev=task, step=new_step, cost=cost) return '', [], total_time, n_tested - -def print_hint(solution, steps, fix_time, n_tested): - if solution: - print(colored('Hint found! Tested {} programs in {:.1f} s.'.format(n_tested, fix_time), 'green')) - print(colored(' Edits', 'blue')) - for line, (before, after) in steps: - print(' {}:\t{} → {}'.format(line, stringify(before), stringify(after))) - print(colored(' Final version', 'blue')) - print(indent(compose(*decompose(solution)), 2)) - else: - print(colored('Hint not found! Tested {} programs in {:.1f} s.'.format(n_tested, fix_time), 'red')) - -# Find official solutions to all problems. -def init_problems(): - names = {} - codes = {} - libraries = {} - - pids = db.get_problem_ids() - for pid in pids: - names[pid], codes[pid], libraries[pid] = db.get_problem(pid) - - return names, codes, libraries - -# Submit code to Prolog server for testing. -def test(name, code): - # TODO also load fact library and solved predicates - engine = PrologEngine(code=code) - result = engine.ask("run_tests({}, '{}')".format(name, engine.id)) - engine.destroy() - return result['event'] == 'success' - -if __name__ == '__main__': - # Get problem id from commandline. - if len(sys.argv) < 2: - print('usage: ' + sys.argv[0] + ' <pid>') - sys.exit(1) - pid = int(sys.argv[1]) - - names, codes, libraries = init_problems() - - # Analyze traces for this problem to get edits, submissions and queries. - traces = db.get_traces(pid) - edits, lines, submissions, queries = get_edits_from_traces(traces.values()) - - # Find incorrect submissions. - incorrect = [] - for submission, count in sorted(submissions.items()): - if not test(names[pid], submission): - # This incorrect submission appeared in [count] attempts. - incorrect += [submission]*count - - # XXX only for testing - try: - done = pickle.load(open('status-'+str(pid)+'.pickle', 'rb')) - except: - done = [] - - # test fix() on incorrect student submissions - if len(sys.argv) >= 3 and sys.argv[2] == 'test': - timeout = int(sys.argv[3]) if len(sys.argv) >= 4 else 10 - - print('Fixing {}/{} programs (timeout={})…'.format( - len([p for p in incorrect if p not in done]), len(incorrect), timeout)) - - for i, program in enumerate(incorrect): - if program in done: - continue - print(colored('Analyzing program {0}/{1}…'.format(i+1, len(incorrect)), 'yellow')) - print(indent(compose(*decompose(program)), 2)) - - solution, steps, fix_time, n_tested = fix(names[pid], program, edits, timeout=timeout) - if solution: - done.append(program) - print_hint(solution, steps, fix_time, n_tested) - print() - - pickle.dump(done, open('status-'+str(pid)+'.pickle', 'wb')) - - print('Found hints for ' + str(len(done)) + ' of ' + str(len(incorrect)) + ' incorrect programs') - - # print info for this problem - elif len(sys.argv) >= 3 and sys.argv[2] == 'info': - # with no additional arguments, print some stats - if len(sys.argv) == 3: - print('Problem {} ({}): {} edits in {} traces, fixed {}/{} ({}/{} unique)'.format( - pid, colored(names[pid], 'yellow'), - colored(str(len(edits)), 'yellow'), colored(str(len(traces)), 'yellow'), - colored(str(len([p for p in incorrect if p in done])), 'yellow'), - colored(str(len(incorrect)), 'yellow'), - colored(str(len(set(done))), 'yellow'), - colored(str(len(set(incorrect))), 'yellow'))) - else: - if sys.argv[3] == 'users': - print(' '.join([str(uid) for (pid, uid) in sorted(traces.keys())])) - # print all observed edits and their costs - elif sys.argv[3] == 'edits': - inserts, removes, changes = classify_edits(edits) - print('Inserts') - for after, cost in sorted(inserts.items(), key=lambda x: x[1]): - print(' {:.2f}\t{}'.format(cost, stringify(after))) - print('Removes') - for before, cost in sorted(removes.items(), key=lambda x: x[1]): - print(' {:.2f}\t{}'.format(cost, stringify(before))) - print('Changes') - for (before, after), cost in sorted(changes.items(), key=lambda x: x[1]): - print(' {:.2f}\t{} → {}'.format(cost, - stringify(before if before else [('INVALID', 'ε')]), - stringify(after if after else [('INVALID', 'ε')]))) - # print all student submissions not (yet) corrected - elif sys.argv[3] == 'unsolved': - for p in sorted(set(incorrect)): - if p in done: - continue - print(indent(compose(*decompose(p)), 2)) - print() - # print all student queries and their counts - elif sys.argv[3] == 'queries': - for query, count in queries.most_common(): - print(' ' + str(count) + '\t' + query) - - # Print the edit graph in graphviz dot syntax. - elif len(sys.argv) == 4 and sys.argv[2] == 'graph': - uid = int(sys.argv[3]) - actions = parse(traces[(pid, uid)]) - - nodes, submissions, queries = edit_graph(actions) - - def position(node): - return (node.data[1]*150, node.data[0]*-60) - - def label(node): - return stringify(node.data[2]) - - def node_attr(node): - if node.ein and node.data[2] == node.ein[0].data[2]: - return 'color="gray", shape="point"' - return '' - - def edge_attr(a, b): - if a.data[2] == b.data[2]: - return 'arrowhead="none"' - return '' - - graphviz_str = graphviz(nodes, pos=position, label=label, - node_attr=node_attr, edge_attr=edge_attr) - print(graphviz_str) - - # run interactive loop - else: - while True: - # read the program from stdin - print('Enter program, end with empty line:') - code = '' - try: - while True: - line = input() - if not line: - break - code += line + '\n' - except EOFError: - break - - # try finding a fix - print(colored('Analyzing program…', 'yellow')) - solution, steps, fix_time, n_tested = fix(names[pid], code, edits, debug=True) - print_hint(solution, steps, fix_time, n_tested) |