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
|
#ifndef __RAPMAP_SA_INDEX_HPP__
#define __RAPMAP_SA_INDEX_HPP__
#include <cereal/types/unordered_map.hpp>
#include <cereal/types/vector.hpp>
#include <cereal/types/string.hpp>
#include <cereal/archives/binary.hpp>
#include "spdlog/spdlog.h"
#include "spdlog/fmt/ostr.h"
#include "spdlog/fmt/fmt.h"
#include "google/dense_hash_map"
#include "bit_array.h"
//#include "bitmap.h"
//#include "shared.h"
#include "rank9b.h"
#include <cstdio>
#include <vector>
#include <memory>
#include <fstream>
#include "RapMapUtils.hpp"
template <typename IndexT, typename HashT>
class RapMapSAIndex {
public:
using IndexType = IndexT;
using HashType = HashT;
struct BitArrayDeleter {
void operator()(BIT_ARRAY* b) {
if(b != nullptr) {
bit_array_free(b);
}
}
};
using BitArrayPointer = std::unique_ptr<BIT_ARRAY, BitArrayDeleter>;
RapMapSAIndex();
// Given a position, p, in the concatenated text,
// return the corresponding transcript
IndexT transcriptAtPosition(IndexT p);
bool load(const std::string& indDir);
std::vector<IndexT> SA;
BitArrayPointer bitArray{nullptr};
std::unique_ptr<rank9b> rankDict{nullptr};
std::string seq;
std::vector<std::string> txpNames;
std::vector<IndexT> txpOffsets;
std::vector<IndexT> txpLens;
std::vector<IndexT> positionIDs;
std::vector<rapmap::utils::SAIntervalWithKey<IndexT>> kintervals;
HashT khash;
};
#endif //__RAPMAP_SA_INDEX_HPP__
|
