Searched refs:sparse_ (Results 1 – 3 of 3) sorted by relevance
202 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_; variable271 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 …]
160 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_; variable205 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()
111 sparse_.reset(new SparseType()); in Reset()114 sparse_.reset(); in Reset()123 if (!sparse_->empty()) { // Don't attempt lookup in empty map in Get()124 auto it = sparse_->find(index); in Get()125 if (it != sparse_->cend()) { in Get()164 sparse_->clear(); // full range replaces all subranges in SetRange()174 …for (auto it = sparse_->begin(); it != sparse_->end();) { // no increment clause because of erase… in SetRange()176 it = sparse_->erase(it); // remove redundant entries in SetRange()241 if (it_sparse_ == vec_->sparse_->cend()) {279 it_sparse_ = vec_->sparse_->cbegin(); in ConstIterator()[all …]