forked from pjkundert/cpppo
-
Notifications
You must be signed in to change notification settings - Fork 2
/
misc_test.py
268 lines (224 loc) · 10.2 KB
/
misc_test.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
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
149
150
151
152
153
154
155
156
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
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
from __future__ import absolute_import, print_function, division
try:
from future_builtins import zip, map # Use Python 3 "lazy" zip, map
except ImportError:
pass
import threading
from .misc import (
near, scale, magnitude, centeraxis, natural, change_function, mutexmethod,
parse_ip_port, ip, network,
hexdump, hexload,
)
def test_scale():
assert near( scale( 0., ( 0., 100. ), ( 32., 212. )), 32. )
assert near( scale( -40., ( 0., 100. ), ( 32., 212. )), -40. )
assert near( scale( 20., ( 0., 100. ), ( 32., 212. )), 68. )
# Try an inverted mapping (a reverse-ordered range)
assert near( scale( 0., ( 0., 100. ), ( 1., -1. )), 1. )
assert near( scale( -40., ( 0., 100. ), ( 1., -1. )), 1.80 )
assert near( scale( 20., ( 0., 100. ), ( 1., -1. )), 0.60 )
assert near( scale( 120., ( 0., 100. ), ( 1., -1. )), -1.40 )
# Try a reverse-ordered domain
assert near( scale( 0., ( 100., 0. ), ( 32., 212. )), 212. )
assert near( scale( -40., ( 100., 0. ), ( 32., 212. )), 284. )
assert near( scale( 20., ( 100., 0. ), ( 32., 212. )), 176. )
# An exponential mapping
assert near( scale( 40, ( 25 , 40 ), ( 0, 1 )), 1 )
assert near( scale( 40, ( 25 , 40 ), ( 0, 1 ), exponent=2), 1 )
assert near( scale( 25, ( 25 , 40 ), ( 0, 1 )), 0 )
assert near( scale( 25, ( 25 , 40 ), ( 0, 1 ), exponent=2), 0 )
assert near( scale( 25+15/2 , ( 25 , 40 ), ( 0, 1 )), .5 )
assert near( scale( 25+15/2 , ( 25 , 40 ), ( 0, 1 ), exponent=2), .25 )
assert near( scale( 39 , ( 25 , 40 ), ( 0, 1 )), .9333 )
assert near( scale( 39 , ( 25 , 40 ), ( 0, 1 ), exponent=2), .8711 )
assert near( scale( 26 , ( 25 , 40 ), ( 0, 1 )), .066667 )
assert near( scale( 26 , ( 25 , 40 ), ( 0, 1 ), exponent=2), .004444 )
# Ensure non-linear scaling ensures negatives may be handled by clamping domain
assert near( scale( 24 , ( 25 , 40 ), ( 0, 1 ), exponent=2, clamped=True ), 0 )
def test_magnitude():
# base 10 (the default)
assert near( magnitude( 23. ), 1. )
assert near( magnitude( .23 ), .01 )
assert near( magnitude( 75. ), 10. )
assert near( magnitude( .03 ), .001 )
# base 2
assert near( magnitude( 33., 2 ), 16. )
assert near( magnitude( 50., 2 ), 32. )
def test_centeraxis():
string='abc.123.xyz'
assert centeraxis( string, 20 ) \
== ' abc.123.xyz '
assert centeraxis( string, 20, reverse=True ) \
== ' abc.123.xyz '
assert centeraxis( string, 20, reverse=True, fillchar='x' ) \
== 'xxxxxxxabc.123.xyzxx'
string='----------abc.123.xyz++++++++++'
assert centeraxis( string, 20, reverse=True ) \
== '----------abc.123.xyz++++++++++'
assert centeraxis( string, 20, reverse=True, clip=True ) \
== '-------abc.123.xyz++'
assert centeraxis( string, 20, clip=True ) \
== '---abc.123.xyz++++++'
assert centeraxis( string, 20, clip=True ) \
== '---abc.123.xyz++++++'
# If no axis char, center around a fill char
string='abc'
assert centeraxis( string, 20, reverse=True ) \
== ' abc '
assert centeraxis( string, 20 ) \
== ' abc '
def test_natural():
assert natural('10th') == (' 10', 't', 'h')
for itm in [ None, [1], {'a':1} ]:
assert natural(itm) == ('', itm.__class__.__name__,
"%9d" % ( hash( itm )
if hasattr( itm, '__hash__' ) and itm.__hash__ is not None
else id( itm )))
l = ['10th', '1st', '9', 9, 'Z', 'a', 9.0, "9.1", None ]
ls1 = ['None', "'1st'", "'9'", "9", "9.0", "'9.1'", "'10th'", "'a'", "'Z'"]
ls2 = ['None', "'1st'", "9", "'9'", "9.0", "'9.1'", "'10th'", "'a'", "'Z'"]
s = sorted( l, key=natural )
rs = [ repr(i) for i in s ]
assert rs == ls1 or rs == ls2
def test_function_creation():
"""Creating functions with code containing a defined co_filename is required in
order to extend the logging module. Unfortunately, this module seeks up the
stack frame until it finds a function whose co_filename is not the logging
module... """
def func( boo ):
pass
assert func.__code__.co_filename == __file__
filename = "something/else.py"
change_function( func, co_filename=filename )
assert func.__code__.co_filename == filename
def test_mutexmethod():
class C( object ):
_cls_lock = threading.Lock()
def __init__( self ):
self._ins_lock = threading.Lock()
@classmethod
@mutexmethod( '_cls_lock', blocking=False )
def clsmethod_lock_cls( cls, f=None ):
if f:
return f()
@mutexmethod( '_cls_lock', blocking=False )
def insmethod_lock_cls( self, f=None ):
if f:
return f()
@mutexmethod( '_ins_lock', blocking=False )
def insmethod_lock_ins( self, f=None ):
if f:
return f()
c = C()
# Same lock; should raise Exception (since blocking=False used above)
assert c.insmethod_lock_cls() is None
try:
c.insmethod_lock_cls( c.insmethod_lock_cls )
assert False, "Should have raised recursive lock exception"
except Exception as exc:
assert "Lock is held" in str( exc )
assert c.clsmethod_lock_cls() is None
try:
c.clsmethod_lock_cls( c.clsmethod_lock_cls )
assert False, "Should have raised recursive lock exception"
except Exception as exc:
assert "Lock is held" in str( exc )
try:
c.clsmethod_lock_cls( c.insmethod_lock_cls )
assert False, "Should have raised recursive lock exception"
except Exception as exc:
assert "Lock is held" in str( exc )
# Two different locks; should not interfere
c.clsmethod_lock_cls( c.insmethod_lock_ins )
def test_parse_ip_port():
for t,(a,p) in {
"127.0.0.1": ( ip("127.0.0.1"), None ),
"127.0.0.1:80": ( ip("127.0.0.1"), 80 ),
"::1": ( ip("::1"), None ),
"[::1]:80": ( ip("::1"), 80 ),
"::192.168.0.1": ( ip("::c0a8:1"), None ),
"2605:2700:0:3::4713:93e3": ( ip("2605:2700:0:3::4713:93e3"), None ),
"[2605:2700:0:3::4713:93e3]:80":( ip("2605:2700:0:3::4713:93e3"), 80),
"boogaloo.cash:443": ( "boogaloo.cash", 443 ),
}.items():
assert parse_ip_port( t ) == (a,p)
for t,(a,p) in {
"127.0.0.1": ( ip("127.0.0.1"), 123 ),
"127.0.0.1:80": ( ip("127.0.0.1"), 80 ),
"::1": ( ip("::1"), 123 ),
"[::1]:80": ( ip("::1"), 80 ),
"::192.168.0.1": ( ip("::c0a8:1"), 123 ),
"2605:2700:0:3::4713:93e3": ( ip("2605:2700:0:3::4713:93e3"), 123 ),
"[2605:2700:0:3::4713:93e3]:80":( ip("2605:2700:0:3::4713:93e3"), 80),
"boogaloo.cash:443": ( "boogaloo.cash", 443 ),
}.items():
assert parse_ip_port( t, default=(None,123) ) == (a,p)
assert parse_ip_port( ":11", default=('',456)) == ('',11)
assert parse_ip_port( ":11", default=('boo',456)) == ('boo',11)
assert parse_ip_port( "", default=('',456)) == ('',456)
assert str( network( "192.168.1.0/24" ).broadcast_address ) == "192.168.1.255"
def test_hexdump():
vals = b'\x01\x02\x03'
dump = hexdump( vals )
assert dump == '00000000: 01 02 03 |...|'
load = hexload( dump )
print( repr( load ))
assert load == vals
dump = hexdump( vals, quote='' )
assert dump == '00000000: 01 02 03 ...'
load = hexload( dump )
print( repr( load ))
assert load == vals
dump = hexdump( vals, quote='' )
assert dump == '00000000: 01 02 03 ...'
load = hexload( dump, offset=1 )
print( repr( load ))
assert load == vals[1:]
# fill gaps in addresses, start at an offset
gaps = r"""
00003FD0: 3F D0 00 00 00 00 00 00 00 00 00 00 12 00 00 00 |................|
... something unparsable ...
00003FF0: 3F F0 00 00 00 00 00 00 00 00 00 00 12 00 00 00 |................|
00004000: 40 00 30 31 20 53 45 34 20 45 20 32 33 2e 35 63 |@.01 SE4 E 23.5c|
"""
load = hexload( gaps, offset=0x3fc0, fill=b'\xFF', skip=True )
dump = hexdump( load, offset=0x3fc0 )
print( dump )
assert dump == """\
00003FC0: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff |................|
00003FD0: 3f d0 00 00 00 00 00 00 00 00 00 00 12 00 00 00 |?...............|
00003FE0: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff |................|
00003FF0: 3f f0 00 00 00 00 00 00 00 00 00 00 12 00 00 00 |?...............|
00004000: 40 00 30 31 20 53 45 34 20 45 20 32 33 2e 35 63 |@.01 SE4 E 23.5c|"""
# Don't fill, skip unparsable rows
load = hexload( gaps, skip=True )
dump = hexdump( load )
print( dump )
assert dump == """\
00000000: 3f d0 00 00 00 00 00 00 00 00 00 00 12 00 00 00 |?...............|
00000010: 3f f0 00 00 00 00 00 00 00 00 00 00 12 00 00 00 |?...............|
00000020: 40 00 30 31 20 53 45 34 20 45 20 32 33 2e 35 63 |@.01 SE4 E 23.5c|"""
try:
load = hexload( gaps )
except Exception as exc:
assert str(exc) == "Failed to match a hex dump on row: ' ... something unparsable ...'"
else:
raise AssertionError( "Failed to raise Exception, got: {load!r}".format( load=load ))
# simpler formats that are accepted
simp = """\
0001:01020304
0005:05
9:09
"""
load = hexload( simp )
print( repr( load ) )
dump = hexdump( load )
print( dump )
assert dump == """\
00000000: 01 02 03 04 05 09 |......|"""
load = hexload( simp, fill=b'\x99' )
print( repr( load ) )
dump = hexdump( load )
print( dump )
assert dump == """\
00000000: 99 01 02 03 04 05 99 99 99 09 |..........|"""