Newer
Older
from __future__ import division, with_statement
from __future__ import absolute_import
@pytest.mark.skipif("sys.version_info < (2, 5)")
def test_memoize_method_clear():
from pytools import memoize_method
class SomeClass:
def __init__(self):
self.run_count = 0
def test_memoize_method_with_uncached():
from pytools import memoize_method_with_uncached
class SomeClass:
def __init__(self):
self.run_count = 0
@memoize_method_with_uncached(uncached_args=[1], uncached_kwargs=["z"])
def f(self, x, y, z):
self.run_count += 1
return 17
sc = SomeClass()
sc.f(17, 18, z=19)
sc.f(17, 19, z=20)
sc.f(18, 19, z=20)
assert sc.run_count == 2
def test_memoize_method_nested():
from pytools import memoize_method_nested
class SomeClass:
def __init__(self):
self.run_count = 0
def f(self):
@memoize_method_nested
def inner(x):
self.run_count += 1
return 2*x
inner(5)
inner(5)
sc = SomeClass()
sc.f()
assert sc.run_count == 1
pytest.importorskip("numpy")
from pytools.convergence import PConvergenceVerifier
pconv_verifier = PConvergenceVerifier()
for order in [2, 3, 4, 5]:
pconv_verifier.add_data_point(order, 0.1**order)
pconv_verifier()
pconv_verifier = PConvergenceVerifier()
for order in [2, 3, 4, 5]:
pconv_verifier.add_data_point(order, 0.5**order)
pconv_verifier()
pconv_verifier = PConvergenceVerifier()
for order in [2, 3, 4, 5]:
pconv_verifier.add_data_point(order, 2)
with pytest.raises(AssertionError):
pconv_verifier()
Yichao Yu
committed
def test_memoize():
from pytools import memoize
count = [0]
Yichao Yu
committed
@memoize(use_kwargs=True)
Yichao Yu
committed
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
def f(i, j=1):
count[0] += 1
return i + j
assert f(1) == 2
assert f(1, 2) == 3
assert f(2, j=3) == 5
assert count[0] == 3
assert f(1) == 2
assert f(1, 2) == 3
assert f(2, j=3) == 5
assert count[0] == 3
def test_memoize_keyfunc():
from pytools import memoize
count = [0]
@memoize(key=lambda i, j=(1,): (i, len(j)))
def f(i, j=(1,)):
count[0] += 1
return i + len(j)
assert f(1) == 2
assert f(1, [2]) == 2
assert f(2, j=[2, 3]) == 4
assert count[0] == 2
assert f(1) == 2
assert f(1, (2,)) == 2
assert f(2, j=(2, 3)) == 4
assert count[0] == 2
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
@pytest.mark.parametrize("dims", [2, 3])
def test_spatial_btree(dims, do_plot=False):
import numpy as np
nparticles = 2000
x = -1 + 2*np.random.rand(dims, nparticles)
x = np.sign(x)*np.abs(x)**1.9
x = (1.4 + x) % 2 - 1
bl = np.min(x, axis=-1)
tr = np.max(x, axis=-1)
print(bl, tr)
from pytools.spatial_btree import SpatialBinaryTreeBucket
tree = SpatialBinaryTreeBucket(bl, tr, max_elements_per_box=10)
for i in range(nparticles):
tree.insert(i, (x[:, i], x[:, i]))
if do_plot:
import matplotlib.pyplot as pt
pt.gca().set_aspect("equal")
pt.plot(x[0], x[1], "x")
tree.plot(fill=None)
pt.show()
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
def test_diskdict():
from pytools.diskdict import DiskDict
from tempfile import NamedTemporaryFile
with NamedTemporaryFile() as ntf:
d = DiskDict(ntf.name)
key_val = [
((), "hi"),
(frozenset([1, 2, "hi"]), 5)
]
for k, v in key_val:
d[k] = v
for k, v in key_val:
assert d[k] == v
del d
d = DiskDict(ntf.name)
for k, v in key_val:
del d[k]
del d
d = DiskDict(ntf.name)
for k, v in key_val:
d[k] = v
del d
d = DiskDict(ntf.name)
for k, v in key_val:
assert k in d
assert d[k] == v
del d
if __name__ == "__main__":
# make sure that import failures get reported, instead of skipping the tests.
import pyopencl # noqa
import sys
if len(sys.argv) > 1:
exec(sys.argv[1])
else:
from py.test.cmdline import main
main([__file__])