Searched refs:sparse_to_dense_ (Results 1 – 2 of 2) sorted by relevance
/external/regex-re2/util/ |
D | sparse_set.h | 57 … : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_(NULL), valgrind_(RunningOnValgrind()) {} in SparseSet() 61 sparse_to_dense_ = new int[max_size]; in SparseSet() 69 sparse_to_dense_[i] = 0xababababU; in SparseSet() 76 delete[] sparse_to_dense_; in ~SparseSet() 96 if (sparse_to_dense_) { in resize() 97 memmove(a, sparse_to_dense_, max_size_*sizeof a[0]); in resize() 102 delete[] sparse_to_dense_; in resize() 104 sparse_to_dense_ = a; in resize() 135 return (uint)sparse_to_dense_[i] < (uint)size_ && in contains() 136 dense_[sparse_to_dense_[i]] == i; in contains() [all …]
|
D | sparse_array.h | 225 int* sparse_to_dense_; variable 234 : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_(), valgrind_(RunningOnValgrind()) {} in SparseArray() 273 if (sparse_to_dense_) { in resize() 274 memmove(a, sparse_to_dense_, max_size_*sizeof a[0]); in resize() 280 delete[] sparse_to_dense_; in resize() 282 sparse_to_dense_ = a; in resize() 301 return (uint)sparse_to_dense_[i] < (uint)size_ && in has_index() 302 dense_[sparse_to_dense_[i]].index_ == i; in has_index() 326 p = make_pair(dense_.begin() + sparse_to_dense_[new_value.index_], false); in insert() 344 return dense_.begin() + sparse_to_dense_[i]; in find() [all …]
|