-
Notifications
You must be signed in to change notification settings - Fork 95
/
Copy pathlib_gen_int_tests.py
80 lines (69 loc) · 1.6 KB
/
lib_gen_int_tests.py
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
# Copyright 2018 The go-python Authors. All rights reserved.
# Use of this source code is governed by a BSD-style
# license that can be found in the LICENSE file.
# Generate some tests
unops = "- + abs ~ float complex int"
augops = "+ - * / // % & | ^"
binops = augops + " < <= == != > >="
# powmod
# divmod
# lsl
# lsr
# round
# **
# **=
import random
def big():
return random.randint(-1000000000000000000000000000000, 1000000000000000000000000000000)
def small():
return random.randint(-1<<63, (1<<63)-1)
def unop(op, a):
if len(op) == 1:
expr = "%s%s" % (op, a)
else:
expr = "%s(%s)" % (op, a)
r = eval(expr)
print("assert (%s) == %s" % (expr, r))
for op in unops.split():
print("\ndoc='unop %s'" % op)
for i in range(2):
a = small()
unop(op, a)
a = big()
unop(op, a)
def binop(op, a, b):
expr = "%s%s%s" % (a, op, b)
r = eval(expr)
print("assert (%s) == %s" % (expr, r))
for op in binops.split():
print("\ndoc='binop %s'" % op)
a = small()
b = small()
binop(op, a, b)
a = big()
b = small()
binop(op, a, b)
a = small()
b = big()
binop(op, a, b)
a = big()
b = big()
binop(op, a, b)
def augop(op, a, b):
expr = "%s%s%s" % (a, op, b)
r = eval(expr)
print("a = %s\na %s= %s\nassert a == %s" % (a, op, b, r))
for op in augops.split():
print("\ndoc='augop %s'" % op)
a = small()
b = small()
augop(op, a, b)
a = big()
b = small()
augop(op, a, b)
a = small()
b = big()
augop(op, a, b)
a = big()
b = big()
augop(op, a, b)