blob: a8585a20b9ea9d30820ca9ad7b3c64d1d5f52bdd (
plain)
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
|
/*
* Copyright 2011 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef SkBitSet_DEFINED
#define SkBitSet_DEFINED
#include "SkTDArray.h"
#include "SkTemplates.h"
class SkBitSet {
public:
explicit SkBitSet(int numberOfBits) {
SkASSERT(numberOfBits > 0);
fDwordCount = (numberOfBits + 31) / 32; // Round up size to 32-bit boundary.
fBitData.reset((uint32_t*)sk_calloc_throw(fDwordCount * sizeof(uint32_t)));
}
SkBitSet(const SkBitSet&) = delete;
SkBitSet& operator=(const SkBitSet&) = delete;
/** Set the value of the index-th bit to true. */
void set(int index) {
uint32_t mask = 1 << (index & 31);
uint32_t* chunk = this->internalGet(index);
SkASSERT(chunk);
*chunk |= mask;
}
template<typename T>
void setAll(T* array, int len) {
static_assert(std::is_integral<T>::value, "T is integral");
for (int i = 0; i < len; ++i) {
this->set(static_cast<int>(array[i]));
}
}
bool has(int index) const {
const uint32_t* chunk = this->internalGet(index);
uint32_t mask = 1 << (index & 31);
return chunk && SkToBool(*chunk & mask);
}
/** Export indices of set bits to T array. */
template<typename T>
void exportTo(SkTDArray<T>* array) const {
static_assert(std::is_integral<T>::value, "T is integral");
SkASSERT(array);
uint32_t* data = reinterpret_cast<uint32_t*>(fBitData.get());
for (unsigned int i = 0; i < fDwordCount; ++i) {
uint32_t value = data[i];
if (value) { // There are set bits
unsigned int index = i * 32;
for (unsigned int j = 0; j < 32; ++j) {
if (0x1 & (value >> j)) {
array->push(index + j);
}
}
}
}
}
private:
std::unique_ptr<uint32_t, SkFunctionWrapper<void, void, sk_free>> fBitData;
size_t fDwordCount; // Dword (32-bit) count of the bitset.
uint32_t* internalGet(int index) const {
size_t internalIndex = index / 32;
if (internalIndex >= fDwordCount) {
return nullptr;
}
return fBitData.get() + internalIndex;
}
};
#endif
|
