summaryrefslogtreecommitdiff
path: root/prolog/problems/lists/min_2/common.py
blob: 213da5ab4c02b7087ef3de624e1581290702963b (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
# coding=utf-8

from operator import itemgetter
import prolog.engine
import server.problems

id = 108
number = 15
visible = False
facts = None

solution = '''\
min([X], X).
min([H|T], Min):-
  min(T, Min1),
  ( H < Min1, Min is H
    ;
    H >= Min1, Min is Min1 ).
'''

test_cases = [
    ('min([15], X)',
        [{'X': '15'}]),
    ('min([22, 13, 81], X)',
        [{'X': '13'}]),
    ('min([42, 42, 42, 42], X)',
        [{'X': '42'}]),
    ('min([-22, 113, 1], X)',
        [{'X': '-22'}]),
]

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 []