-
Notifications
You must be signed in to change notification settings - Fork 294
/
hashtable.hh
382 lines (320 loc) · 10.4 KB
/
hashtable.hh
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
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
/*
This file is part of khmer, https://github.com/dib-lab/khmer/, and is
Copyright (C) 2010-2015, Michigan State University.
Copyright (C) 2015-2016, The Regents of the University of California.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the Michigan State University nor the names
of its contributors may be used to endorse or promote products
derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
LICENSE (END)
Contact: khmer-project@idyll.org
*/
#ifndef HASHTABLE_HH
#define HASHTABLE_HH
#include <stddef.h>
#include <stdint.h>
#include <string.h>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <memory>
#include "MurmurHash3.h"
#include "khmer.hh"
#include "khmer_exception.hh"
#include "kmer_hash.hh"
#include "read_parsers.hh"
#include "storage.hh"
#include "subset.hh"
using namespace std;
namespace khmer
{
namespace read_parsers
{
template<typename SeqIO> class ReadParser;
class FastxReader;
}
}
#define CALLBACK_PERIOD 100000
namespace khmer
{
typedef std::unique_ptr<KmerHashIterator> KmerHashIteratorPtr;
class Hashtable: public
KmerFactory // Base class implementation of a Bloom ht.
{
friend class SubsetPartition;
friend class LabelHash;
protected:
Storage * store;
unsigned int _max_count;
unsigned int _max_bigcount;
//WordLength _ksize;
HashIntoType bitmask;
unsigned int _nbits_sub_1;
explicit Hashtable( WordLength ksize, Storage * s)
: KmerFactory( ksize ), store(s),
_max_count( MAX_KCOUNT ),
_max_bigcount( MAX_BIGCOUNT )
{
_init_bitstuff();
}
virtual ~Hashtable( )
{
delete store;
}
void _init_bitstuff()
{
bitmask = 0;
for (unsigned int i = 0; i < _ksize; i++) {
bitmask = (bitmask << 2) | 3;
}
_nbits_sub_1 = (_ksize*2 - 2);
}
explicit Hashtable(const Hashtable&);
Hashtable& operator=(const Hashtable&);
virtual KmerHashIteratorPtr new_kmer_iterator(const char * sp) const {
KmerHashIterator * ki = new TwoBitKmerHashIterator(sp, _ksize);
return unique_ptr<KmerHashIterator>(ki);
}
virtual KmerHashIteratorPtr new_kmer_iterator(const std::string& s) const {
return new_kmer_iterator(s.c_str());
}
public:
// accessor to get 'k'
const WordLength ksize() const
{
return _ksize;
}
// various hash functions.
inline
virtual
HashIntoType
hash_dna(const char * kmer) const
{
return _hash(kmer, _ksize);
}
inline
virtual
HashIntoType
hash_dna_top_strand(const char * kmer) const
{
HashIntoType f = 0, r = 0;
_hash(kmer, _ksize, f, r);
return f;
}
inline
virtual
HashIntoType
hash_dna_bottom_strand(const char * kmer) const
{
HashIntoType f = 0, r = 0;
_hash(kmer, _ksize, f, r);
return r;
}
inline
virtual
std::string
unhash_dna(HashIntoType hashval) const
{
return _revhash(hashval, _ksize);
}
void count(const char * kmer)
{
store->add(hash_dna(kmer));
}
void count(HashIntoType khash)
{
store->add(khash);
}
void add(const char * kmer)
{
store->add(hash_dna(kmer));
}
void add(HashIntoType khash)
{
store->add(khash);
}
// get the count for the given k-mer.
const BoundedCounterType get_count(const char * kmer) const
{
return store->get_count(hash_dna(kmer));
}
const BoundedCounterType get_count(HashIntoType khash) const
{
return store->get_count(khash);
}
void save(std::string filename)
{
store->save(filename, _ksize);
}
void load(std::string filename)
{
store->load(filename, _ksize);
_init_bitstuff();
}
// count every k-mer in the string.
unsigned int consume_string(const std::string &s);
// checks each read for non-ACGT characters
bool check_and_normalize_read(std::string &read) const;
// check each read for non-ACGT characters, and then consume it.
unsigned int check_and_process_read(std::string &read,
bool &is_valid);
// Count every k-mer in a file containing nucleotide sequences.
template<typename SeqIO>
void consume_seqfile(
std::string const &filename,
unsigned int &total_reads,
unsigned long long &n_consumed
);
// Count every k-mer in a file containing nucleotide sequences,
// using the supplied parser.
template<typename SeqIO>
void consume_seqfile(
read_parsers::ReadParserPtr<SeqIO>& parser,
unsigned int &total_reads,
unsigned long long &n_consumed
);
void set_use_bigcount(bool b)
{
store->set_use_bigcount(b);
}
bool get_use_bigcount()
{
return store->get_use_bigcount();
}
bool median_at_least(const std::string &s,
unsigned int cutoff);
void get_median_count(const std::string &s,
BoundedCounterType &median,
float &average,
float &stddev);
// number of unique k-mers
const uint64_t n_unique_kmers() const
{
return store->n_unique_kmers();
}
// count number of occupied bins
const uint64_t n_occupied() const
{
return store->n_occupied();
}
// table information
std::vector<uint64_t> get_tablesizes() const
{
return store->get_tablesizes();
}
const size_t n_tables() const
{
return store->n_tables();
}
// return all k-mer substrings, on the forward strand.
void get_kmers(const std::string &s, std::vector<std::string> &kmers)
const;
// return hash values for all k-mer substrings
void get_kmer_hashes(const std::string &s,
std::vector<HashIntoType> &kmers) const;
// return hash values for all k-mer substrings in a SeenSet
void get_kmer_hashes_as_hashset(const std::string &s,
SeenSet& hashes) const;
// return counts of all k-mers in this string.
void get_kmer_counts(const std::string &s,
std::vector<BoundedCounterType> &counts) const;
// get access to raw tables.
Byte ** get_raw_tables()
{
return store->get_raw_tables();
}
// find the minimum k-mer count in the given sequence
BoundedCounterType get_min_count(const std::string &s);
// find the maximum k-mer count in the given sequence
BoundedCounterType get_max_count(const std::string &s);
// calculate the abundance distribution of kmers in the given file.
template<typename SeqIO>
uint64_t * abundance_distribution(
read_parsers::ReadParserPtr<SeqIO>& parser,
Hashtable * tracking
);
template<typename SeqIO>
uint64_t * abundance_distribution(std::string filename,
Hashtable * tracking);
// return the index of the first position in the sequence with k-mer
// abundance below min_abund.
unsigned long trim_on_abundance(std::string seq,
BoundedCounterType min_abund) const;
// return the index of the first position in the sequence with k-mer
// abundance above max_abund.
unsigned long trim_below_abundance(std::string seq,
BoundedCounterType max_abund) const;
// detect likely positions of errors
std::vector<unsigned int> find_spectral_error_positions(std::string seq,
BoundedCounterType min_abund) const;
};
// Hashtable-derived class with ByteStorage.
class Counttable : public khmer::Hashtable
{
public:
explicit Counttable(WordLength ksize, std::vector<uint64_t> sizes)
: Hashtable(ksize, new ByteStorage(sizes)) { } ;
inline
virtual
HashIntoType
hash_dna(const char * kmer) const {
if (!(strlen(kmer) >= _ksize)) {
throw khmer_exception("Supplied kmer string doesn't match the underlying k-size.");
}
return _hash_murmur(kmer, _ksize);
}
inline virtual HashIntoType
hash_dna_top_strand(const char * kmer) const {
throw khmer_exception("not implemented");
}
inline virtual HashIntoType
hash_dna_bottom_strand(const char * kmer) const {
throw khmer_exception("not implemented");
}
inline virtual std::string
unhash_dna(HashIntoType hashval) const {
throw khmer_exception("not implemented");
}
virtual KmerHashIteratorPtr new_kmer_iterator(const char * sp) const;
};
// Hashtable-derived class with NibbleStorage.
class SmallCounttable : public khmer::Hashtable
{
public:
explicit SmallCounttable(WordLength ksize, std::vector<uint64_t> sizes)
: Hashtable(ksize, new NibbleStorage(sizes)) { } ;
};
// Hashtable-derived class with BitStorage.
class Nodetable : public Hashtable
{
public:
explicit Nodetable(WordLength ksize, std::vector<uint64_t> sizes)
: Hashtable(ksize, new BitStorage(sizes)) { } ;
};
}
#endif // HASHTABLE_HH