File: ranked_bitvector.hpp

package info (click to toggle)
iqtree 2.0.7%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 14,620 kB
  • sloc: cpp: 142,571; ansic: 57,789; sh: 275; python: 242; makefile: 95
file content (152 lines) | stat: -rw-r--r-- 3,784 bytes parent folder | download
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
#ifndef RANKED_BITVECTOR_HPP
#define RANKED_BITVECTOR_HPP

#include "bitvector.hpp"

namespace terraces {

template <typename Alloc>
class basic_ranked_bitvector : public basic_bitvector<Alloc> {
public:
	using value_type = typename basic_bitvector<Alloc>::value_type;

private:
	using base = basic_bitvector<Alloc>;

	std::vector<value_type, Alloc> m_ranks;
	index m_count;
#ifndef NDEBUG
	bool m_ranks_dirty;
#endif // NDEBUG

public:
	basic_ranked_bitvector(index size, Alloc alloc)
	        : basic_bitvector<Alloc>{size, alloc}, m_ranks(base::m_blocks.size(), 0, alloc) {
		base::add_sentinel();
#ifndef NDEBUG
		m_ranks_dirty = true;
#endif // NDEBUG
	}

	/** Sets a bit in the bitvector. */
	void set(index i) {
		base::set(i);
#ifndef NDEBUG
		m_ranks_dirty = true;
#endif // NDEBUG
	}
	/** Clears a bit in the bitvector. */
	void clr(index i) {
		base::clr(i);
#ifndef NDEBUG
		m_ranks_dirty = true;
#endif // NDEBUG
	}
	/** Flips a bit in the bitvector. */
	void flip(index i) {
		base::flip(i);
#ifndef NDEBUG
		m_ranks_dirty = true;
#endif // NDEBUG
	}

	/** Clears all bits in the bitvector. */
	void blank();
	/** Inverts all bits in the bitvector. */
	void invert();
	/** Applies element-wise xor from another bitvector. */
	void bitwise_xor(const basic_bitvector<Alloc>& other);
	/** Sets the values of this bitvector to the bitwise or of two bitvectors. */
	void set_bitwise_or(const basic_bitvector<Alloc>& fst, const basic_bitvector<Alloc>& snd);

	/** Returns the number of set bits. */
	index count() const {
		assert(!m_ranks_dirty);
		return m_count - 1;
	}

	/** Updates the internal data structures after editing the vector. */
	void update_ranks();
	/** Returns the rank of an index, i.e. the number of set bits in the range [0..i) */
	index rank(index i) const;
	index select(index i) const;
};

using ranked_bitvector = basic_ranked_bitvector<utils::stack_allocator<index>>;

template <typename Alloc>
index basic_ranked_bitvector<Alloc>::rank(index i) const {
	assert(!m_ranks_dirty);
	assert(i <= basic_bitvector<Alloc>::m_size);
	index b = bits::block_index(i);
	return m_ranks[b] + bits::partial_popcount(base::m_blocks[b], bits::shift_index(i));
}

template <typename Alloc>
index basic_ranked_bitvector<Alloc>::select(index i) const {
	assert(i <= count());
	auto it = base::begin();
	for (index j = 0; j < i; ++j) {
		++it;
	}
	return *it;
}

template <typename Alloc>
void basic_ranked_bitvector<Alloc>::blank() {
	base::blank();
#ifndef NDEBUG
	m_ranks_dirty = true;
#endif // NDEBUG
}

template <typename Alloc>
void basic_ranked_bitvector<Alloc>::bitwise_xor(const basic_bitvector<Alloc>& other) {
	base::bitwise_xor(other);
#ifndef NDEBUG
	m_ranks_dirty = true;
#endif // NDEBUG
}

template <typename Alloc>
void basic_ranked_bitvector<Alloc>::invert() {
	base::invert();
#ifndef NDEBUG
	m_ranks_dirty = true;
#endif // NDEBUG
}

template <typename Alloc>
void basic_ranked_bitvector<Alloc>::set_bitwise_or(const basic_bitvector<Alloc>& fst,
                                                   const basic_bitvector<Alloc>& snd) {
	base::set_bitwise_or(fst, snd);
#ifndef NDEBUG
	m_ranks_dirty = true;
#endif // NDEBUG
}

template <typename Alloc>
void basic_ranked_bitvector<Alloc>::update_ranks() {
	m_count = 0;
	for (index b = 0; b < base::m_blocks.size(); ++b) {
		m_ranks[b] = m_count;
		m_count += bits::popcount(base::m_blocks[b]);
	}
	assert(m_count > 0);
#ifndef NDEBUG
	m_ranks_dirty = false;
#endif // NDEBUG
}

/** Returns a basic_ranked_bitvector<Alloc> containing size elements. */
template <typename Alloc>
basic_ranked_bitvector<Alloc> full_ranked_set(index size, Alloc a) {
	basic_ranked_bitvector<Alloc> set{size, a};
	set.invert();
	set.update_ranks();
	return set;
}

} // namespace terraces

#endif // RANKED_BITVECTOR_HPP