lux/yuzu
1
0
Fork 0
mirror of https://git.h3cjp.net/H3cJP/yuzu.git synced 2024-12-12 22:05:23 +00:00
Code Issues Packages Projects Releases Wiki Activity

Common: Optimize BitSet iterator

Browse source
This commit is contained in:
Yuri Kunde Schlesner 2016-12-18 21:48:12 -08:00
parent 92bf5c88e6
commit d36ec905b1
1 changed files with 19 additions and 14 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

33
src/common/bit_set.h
View file

@ -121,22 +121,19 @@ public:
class Iterator {
public:
Iterator(const Iterator& other) : m_val(other.m_val), m_bit(other.m_bit) {}
Iterator(IntTy val, int bit) : m_val(val), m_bit(bit) {}
Iterator(IntTy val) : m_val(val), m_bit(0) {}
Iterator& operator=(Iterator other) {
new (this) Iterator(other);
return *this;
}
int operator*() {
return m_bit;
return m_bit + ComputeLsb();
}
Iterator& operator++() {
if (m_val == 0) {
m_bit = -1;
} else {
int bit = LeastSignificantSetBit(m_val);
m_val &= ~(1 << bit);
m_bit = bit;
}
int lsb = ComputeLsb();
m_val >>= lsb + 1;
m_bit += lsb + 1;
m_has_lsb = false;
return *this;
}
Iterator operator++(int _) {
@ -145,15 +142,24 @@ public:
return other;
}
bool operator==(Iterator other) const {
return m_bit == other.m_bit;
return m_val == other.m_val;
}
bool operator!=(Iterator other) const {
return m_bit != other.m_bit;
return m_val != other.m_val;
}
private:
int ComputeLsb() {
if (!m_has_lsb) {
m_lsb = LeastSignificantSetBit(m_val);
m_has_lsb = true;
}
return m_lsb;
}
IntTy m_val;
int m_bit;
int m_lsb = -1;
bool m_has_lsb = false;
};
BitSet() : m_val(0) {}
@ -221,11 +227,10 @@ public:
}
Iterator begin() const {
Iterator it(m_val, 0);
return ++it;
return Iterator(m_val);
}
Iterator end() const {
return Iterator(m_val, -1);
return Iterator(0);
}
IntTy m_val;