Home
last modified time | relevance | path

Searched refs:sparse_ (Results 1 – 2 of 2) sorted by relevance

/third_party/re2/re2/
Dsparse_array.h202 return dense_[sparse_[i]].value_; in get_existing()
206 return dense_[sparse_[i]].value_; in get_existing()
232 dense_[sparse_[i]].value_ = v; in SetExistingInternal()
234 return dense_.data() + sparse_[i]; in SetExistingInternal()
252 __msan_unpoison(sparse_.data() + min, (max - min) * sizeof sparse_[0]); in MaybeInitializeMemory()
255 sparse_[i] = 0xababababU; in MaybeInitializeMemory()
261 PODArray<int> sparse_; variable
271 sparse_(src.max_size()), in SparseArray()
273 std::copy_n(src.sparse_.data(), src.max_size(), sparse_.data()); in SparseArray()
280 sparse_(std::move(src.sparse_)), in SparseArray()
[all …]
Dsparse_set.h160 return dense_.data() + sparse_[i]; in InsertInternal()
177 __msan_unpoison(sparse_.data() + min, (max - min) * sizeof sparse_[0]); in MaybeInitializeMemory()
180 sparse_[i] = 0xababababU; in MaybeInitializeMemory()
186 PODArray<int> sparse_; variable
205 std::copy_n(sparse_.data(), old_max_size, a.data()); in resize()
208 sparse_ = std::move(a); in resize()
227 return (uint32_t)sparse_[i] < (uint32_t)size_ && in contains()
228 dense_[sparse_[i]] == i; in contains()
235 sparse_[i] = size_; in create_index()
241 sparse_(max_size), dense_(max_size) { in SparseSetT()