Repository navigation
Expand file tree
/
Copy pathtest_programDef.py
More file actions
151 lines (115 loc) · 2.96 KB
/
Copy pathtest_programDef.py
File metadata and controls
151 lines (115 loc) · 2.96 KB
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
import unittest
from pyrefine.checker import check_program
program = """
#!/usr/bin/env python
from pyrefine import *
def simple_swap(x, y):
define_('int -> int -> int',
'x > 0 and y > 0 and x != y',
'ret > 0')
if y > x:
x, y = y, x
return x - y
def simple_swap1(x, y):
define_('int -> int -> int',
'x > 0 and y > 0 and x != y',
'ret > 0')
t = c_('int', 0)
if y > x:
t = x
x = y
y = t
return x - y
def using_lam(x, y):
define_('int -> int -> int', 'x < 0', 'ret > y')
neg = define_('int -> int', 'True', 'ret * x <= 1',
lambda x: -x)
example_simple1 = define_('int -> int', 'a >= 0', 'ret > 0',
lambda a: simple_swap(1, 8) if a == 0 else a * 2)
t = example_simple1(neg(x) + 1)
return y + t
def gcd2(x, y):
define_('int -> int -> int',
'x > 0 and y > 0',
'ret > 0')
t = c_('int', 0)
while x != y:
loop_('x > 0 and y > 0', 'x + y')
if x > y:
y, x = x, y
y = y - x
return y
def simple(x, y):
define_('int -> int -> int',
'x > 0 and y > 0',
'ret == x + y')
a = c_('int', x)
res = c_('int', 0)
res = a + y
return res
def simple_if(x, y):
define_('int -> int -> int',
'x != 0',
'ret > 0')
a = c_('int', 0)
a = x
if x < 0:
a = -x
return a
def simple_if2(x, y):
define_('int -> int -> int',
'y >= 0 and x >= 0',
'ret > 0')
a = c_('int', 1)
if y > x:
a = y
b = c_('int', y)
return a + b
def simple_if3(x, y):
define_('int -> int -> bool',
'y >= 0',
'ret == True')
if x > y:
x = y
return x <= y
def simple_if_else(x, y):
define_('int -> int -> int',
'True',
'ret > 0')
a = c_('int', 0)
if x > y:
a = x - y
else:
a = y - x + 1
return a
def simple_while(x):
define_('int -> int',
'x >= 0',
'ret >= 0')
s = c_('int', 0)
while x != 0:
loop_('x >= 0 and s >= 0', 'x')
s = s + x
x = x - 1
return s
def gcd(x, y):
define_('int -> int -> int',
'x > 0 and y > 0',
'ret > 0')
while x != y:
loop_('x > 0 and y > 0', 'x + y')
if x < y:
y = y - x
else:
x = x - y
return y
"""
class TestProgramDef(unittest.TestCase):
def test_all(self):
res = check_program(program)
for func_name in ['simple_swap', 'simple_swap1', 'using_lam', 'gcd2',
'simple', 'simple_if', 'simple_if2', 'simple_if3',
'simple_if_else', 'simple_while', 'gcd']:
self.assertIn(func_name, res)
self.assertIn('neg', res['using_lam'].child)
self.assertIn('example_simple1', res['using_lam'].child)