/
test_signature.py
296 lines (208 loc) · 8.43 KB
/
test_signature.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
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
from __future__ import print_function, unicode_literals
import os
import pytest
import sourmash_lib
from sourmash_lib.signature import SourmashSignature, save_signatures, \
load_signatures, load_one_signature
from . import sourmash_tst_utils as utils
def test_compare(track_abundance):
# same content, same name -> equal
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
e.add("AT" * 10)
sig1 = SourmashSignature(e, name='foo')
f = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
f.add("AT" * 10)
sig2 = SourmashSignature(f, name='foo')
assert e == f
def test_compare_ne(track_abundance):
# same content, different names -> different
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
e.add("AT" * 10)
sig1 = SourmashSignature(e, name='foo')
f = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
f.add("AT" * 10)
sig2 = SourmashSignature(f, name='bar')
assert sig1 != sig2
def test_compare_ne2(track_abundance):
# same content, different filename -> different
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
e.add("AT" * 10)
sig1 = SourmashSignature(e, name='foo', filename='a')
f = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
f.add("AT" * 10)
sig2 = SourmashSignature(f, name='foo', filename='b')
assert sig1 != sig2
assert sig2 != sig1
def test_compare_ne2_reverse(track_abundance):
# same content, one has filename, other does not -> different
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
e.add("AT" * 10)
sig1 = SourmashSignature(e, name='foo')
f = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
f.add("AT" * 10)
sig2 = SourmashSignature(f, filename='b')
assert sig2 != sig1
assert sig1 != sig2
def test_hashable(track_abundance):
# check: can we use signatures as keys in dictionaries and sets?
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
e.add("AT" * 10)
sig = SourmashSignature(e)
x = set()
x.add(sig)
def test_str(track_abundance):
# signatures should be printable
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
e.add("AT" * 10)
sig = SourmashSignature(e)
print(sig)
assert str(sig) == 'SourmashSignature(59502a74)'
assert repr(sig) == 'SourmashSignature(59502a74)'
sig.d['name'] = 'fizbar'
assert str(sig) == 'SourmashSignature(\'fizbar\', 59502a74)'
assert repr(sig) == 'SourmashSignature(\'fizbar\', 59502a74)'
def test_roundtrip(track_abundance):
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
e.add("AT" * 10)
sig = SourmashSignature(e)
s = save_signatures([sig])
siglist = list(load_signatures(s))
sig2 = siglist[0]
e2 = sig2.minhash
assert sig.similarity(sig2) == 1.0
assert sig2.similarity(sig) == 1.0
def test_load_signature_ksize_nonint(track_abundance):
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
e.add("AT" * 10)
sig = SourmashSignature(e)
s = save_signatures([sig])
siglist = list(load_signatures(s, ksize='20'))
sig2 = siglist[0]
e2 = sig2.minhash
assert sig.similarity(sig2) == 1.0
assert sig2.similarity(sig) == 1.0
def test_roundtrip_empty(track_abundance):
# edge case, but: empty minhash? :)
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
sig = SourmashSignature(e)
s = save_signatures([sig])
siglist = list(load_signatures(s))
sig2 = siglist[0]
e2 = sig2.minhash
assert sig.similarity(sig2) == 0
assert sig2.similarity(sig) == 0
def test_roundtrip_max_hash(track_abundance):
e = sourmash_lib.MinHash(n=0, ksize=20, track_abundance=track_abundance,
max_hash=10)
e.add_hash(5)
sig = SourmashSignature(e)
s = save_signatures([sig])
siglist = list(load_signatures(s))
sig2 = siglist[0]
e2 = sig2.minhash
assert e.max_hash == e2.max_hash
assert sig.similarity(sig2) == 1.0
assert sig2.similarity(sig) == 1.0
def test_roundtrip_seed(track_abundance):
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance,
seed=10)
e.add_hash(5)
sig = SourmashSignature(e)
s = save_signatures([sig])
siglist = list(load_signatures(s))
sig2 = siglist[0]
e2 = sig2.minhash
assert e.seed == e2.seed
assert sig.similarity(sig2) == 1.0
assert sig2.similarity(sig) == 1.0
def test_similarity_downsample(track_abundance):
e = sourmash_lib.MinHash(n=0, ksize=20, track_abundance=track_abundance,
max_hash=2**63)
f = sourmash_lib.MinHash(n=0, ksize=20, track_abundance=track_abundance,
max_hash=2**2)
e.add_hash(1)
e.add_hash(5)
assert len(e.get_mins()) == 2
f.add_hash(1)
f.add_hash(5) # should be discarded due to max_hash
assert len(f.get_mins()) == 1
ee = SourmashSignature(e)
ff = SourmashSignature(f)
with pytest.raises(ValueError): # mismatch in max_hash
ee.similarity(ff)
x = ee.similarity(ff, downsample=True)
assert round(x, 1) == 1.0
def test_md5(track_abundance):
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
e.add_hash(5)
sig = SourmashSignature(e)
print(sig._save())
assert sig.md5sum() == 'eae27d77ca20db309e056e3d2dcd7d69', sig.md5sum()
def test_name(track_abundance):
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
sig = SourmashSignature(e, name='foo')
assert sig.name() == 'foo'
def test_name_2(track_abundance):
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
sig = SourmashSignature(e, filename='foo.txt')
assert sig.name() == 'foo.txt'
def test_name_3(track_abundance):
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
sig = SourmashSignature(e, name='foo',
filename='foo.txt')
assert sig.name() == 'foo'
def test_name_4(track_abundance):
e = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
sig = SourmashSignature(e)
assert sig.name() == sig.md5sum()[:8]
def test_save_load_multisig(track_abundance):
e1 = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
sig1 = SourmashSignature(e1)
e2 = sourmash_lib.MinHash(n=1, ksize=25, track_abundance=track_abundance)
sig2 = SourmashSignature(e2)
x = save_signatures([sig1, sig2])
y = list(load_signatures(x))
print(x)
assert len(y) == 2
assert sig1 in y # order not guaranteed, note.
assert sig2 in y
assert sig1 != sig2
def test_load_one_fail_nosig(track_abundance):
x = save_signatures([])
print((x,))
with pytest.raises(ValueError):
y = load_one_signature(x)
def test_load_one_succeed(track_abundance):
e1 = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
sig1 = SourmashSignature(e1)
x = save_signatures([sig1])
y = load_one_signature(x)
assert sig1 == y
def test_load_one_fail_multisig(track_abundance):
e1 = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
sig1 = SourmashSignature(e1)
e2 = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
sig2 = SourmashSignature(e2)
x = save_signatures([sig1, sig2])
with pytest.raises(ValueError):
y = load_one_signature(x)
def test_save_minified(track_abundance):
e1 = sourmash_lib.MinHash(n=1, ksize=20, track_abundance=track_abundance)
sig1 = SourmashSignature(e1, name="foo")
e2 = sourmash_lib.MinHash(n=1, ksize=25, track_abundance=track_abundance)
sig2 = SourmashSignature(e2, name="bar baz")
x = save_signatures([sig1, sig2])
assert '\n' not in x
assert len(x.split('\n')) == 1
y = list(load_signatures(x))
assert len(y) == 2
assert any(sig.name() == 'foo' for sig in y)
assert any(sig.name() == 'bar baz' for sig in y)
def test_load_minified(track_abundance):
sigfile = utils.get_test_data('genome-s10+s11.sig')
sigs = load_signatures(sigfile)
minified = save_signatures(sigs)
with open(sigfile, 'r') as f:
orig_file = f.read()
assert len(minified) < len(orig_file)
assert '\n' not in minified