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 select_support_scan.hpp
\brief select_support_scan.hpp contains classes that support a sdsl::bit_vector with linear time select.
\author Simon Gog
*/
#ifndef INCLUDED_SDSL_SELECT_SUPPORT_SCAN
#define INCLUDED_SDSL_SELECT_SUPPORT_SCAN
#include "int_vector.hpp"
#include "util.hpp"
#include "select_support.hpp"
//! Namespace for the succinct data structure library.
namespace sdsl
{
//! A class supporting linear time select queries.
/*! \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 select_support_group
*/
template<uint8_t t_b=1, uint8_t t_pat_len=1>
class select_support_scan : public select_support
{
private:
static_assert(t_b == 1u or t_b == 0u or t_b == 10u , "select_support_scan: bit pattern must be `0`,`1`,`10` or `01`");
static_assert(t_pat_len == 1u or t_pat_len == 2u , "select_support_scan: bit pattern length must be 1 or 2");
public:
typedef bit_vector bit_vector_type;
enum { bit_pat = t_b };
public:
explicit select_support_scan(const bit_vector* v=nullptr) : select_support(v) {}
select_support_scan(const select_support_scan<t_b,t_pat_len>& ss) : select_support(ss.m_v) {}
inline size_type select(size_type i) const;
inline size_type operator()(size_type i)const
{
return select(i);
}
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&, SDSL_UNUSED const bit_vector* v=nullptr)
{
set_vector(v);
}
void set_vector(const bit_vector* v=nullptr)
{
m_v = v;
}
select_support_scan<t_b, t_pat_len>& operator=(const select_support_scan& ss)
{
set_vector(ss.m_v);
return *this;
}
void swap(select_support_scan<t_b, t_pat_len>&) {}
};
template<uint8_t t_b, uint8_t t_pat_len>
inline typename select_support_scan<t_b,t_pat_len>::size_type select_support_scan<t_b,t_pat_len>::select(size_type i)const
{
const uint64_t* data = m_v->data();
size_type word_pos = 0;
size_type word_off = 0;
uint64_t carry = select_support_trait<t_b,t_pat_len>::init_carry(data, word_pos);
size_type args = select_support_trait<t_b,t_pat_len>::args_in_the_first_word(*data, word_off, carry);
if (args >= i) {
return (word_pos<<6)+select_support_trait<t_b,t_pat_len>::ith_arg_pos_in_the_first_word(*data, i, word_off, carry);
}
word_pos+=1;
size_type sum_args = args;
carry = select_support_trait<t_b,t_pat_len>::get_carry(*data);
uint64_t old_carry = carry;
args = select_support_trait<t_b,t_pat_len>::args_in_the_word(*(++data), carry);
while (sum_args + args < i) {
sum_args += args;
assert(data+1 < m_v->data() + (m_v->capacity()>>6));
old_carry = carry;
args = select_support_trait<t_b,t_pat_len>::args_in_the_word(*(++data), carry);
word_pos+=1;
}
return (word_pos<<6) + select_support_trait<t_b,t_pat_len>::ith_arg_pos_in_the_word(*data, i-sum_args, old_carry);
}
} // end namespace
#endif
|
