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
|
/* sdsl - succinct data structures library
Copyright (C) 2012 Simon Gog
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see http://www.gnu.org/licenses/ .
*/
/*! \file rank_support_scan.hpp
\brief rank_support_scan.hpp contains rank_support_scan that support a sdsl::bit_vector with linear time rank information.
\author Simon Gog
*/
#ifndef INCLUDED_SDSL_RANK_SUPPORT_SCAN
#define INCLUDED_SDSL_RANK_SUPPORT_SCAN
#include "rank_support.hpp"
//! Namespace for the succinct data structure library.
namespace sdsl
{
//! A class supporting rank queries in linear time.
/*! \par Space complexity
* Constant.
* \par Time complexity
* Linear in the size of the supported vector.
*
* \tparam t_b Bit pattern which should be supported. Either `0`,`1`,`10`,`01`.
* \tparam t_pat_len Length of the bit pattern.
* @ingroup rank_support_group
*/
template<uint8_t t_b=1, uint8_t t_pat_len=1>
class rank_support_scan : public rank_support
{
private:
static_assert(t_b == 1u or t_b == 0u or t_b == 10u or t_b == 11u, "rank_support_scan: bit pattern must be `0`,`1`,`10` or `01`");
static_assert(t_pat_len == 1u or t_pat_len == 2u , "rank_support_scan: bit pattern length must be 1 or 2");
public:
typedef bit_vector bit_vector_type;
enum { bit_pat = t_b };
enum { bit_pat_len = t_pat_len };
public:
explicit rank_support_scan(const bit_vector* v = nullptr)
{
set_vector(v);
}
rank_support_scan(const rank_support_scan& rs)
{
set_vector(rs.m_v);
}
size_type rank(size_type idx) const;
size_type operator()(size_type idx)const
{
return rank(idx);
};
size_type size()const
{
return m_v->size();
};
size_type serialize(std::ostream& out, structure_tree_node* v=nullptr, std::string name="")const
{
return serialize_empty_object(out, v, name, this);
}
void load(std::istream&, const int_vector<1>* v=nullptr)
{
set_vector(v);
}
void set_vector(const bit_vector* v=nullptr)
{
m_v=v;
}
//! Assign Operator
rank_support_scan& operator=(const rank_support_scan& rs)
{
set_vector(rs.m_v);
return *this;
}
//! swap Operator
void swap(rank_support_scan&) {}
};
template<uint8_t t_b, uint8_t t_pat_len>
inline typename rank_support_scan<t_b, t_pat_len>::size_type rank_support_scan<t_b, t_pat_len>::rank(size_type idx)const
{
assert(m_v != nullptr);
assert(idx <= m_v->size());
const uint64_t* p = m_v->data();
size_type i = 0;
size_type result = 0;
while (i+64 <= idx) {
result += rank_support_trait<t_b, t_pat_len>::full_word_rank(p, i);
i += 64;
}
return result+rank_support_trait<t_b, t_pat_len>::word_rank(p, idx);
}
}// end namespace sds
#endif // end file
|
