Searched refs:dense_ (Results 1 - 3 of 3) sorted by relevance

/external/regex-re2/util/
H A Dsparse_set.h57 : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_(NULL) {}
62 dense_ = new int[max_size];
67 dense_[i] = 0xababababU;
76 delete[] dense_;
83 iterator begin() { return dense_; }
84 iterator end() { return dense_ + size_; }
85 const_iterator begin() const { return dense_; }
86 const_iterator end() const { return dense_ + size_; }
106 if (dense_) {
107 memmove(a, dense_, size
170 int* dense_; member in class:re2::SparseSet
[all...]
H A Dsparse_array.h55 // SparseArray uses a vector dense_ and an array sparse_to_dense_, both of
59 // The vector dense_ contains the size_ elements in the sparse array (with
62 // the size_ pairs are dense_[0] through dense_[size_-1].
66 // For indices present in the array, dense_[sparse_to_dense_[i]].index_ == i.
74 // dense_[sparse_to_dense_[i]].index_ == i.
76 // dense_[sparse_to_dense_[i]].value_
80 // initialize dense_[size_], and then increment size_.
83 // swapping dense_[size_-1] and the dense_ bein
226 vector<IndexValue> dense_; member in class:re2::SparseArray
[all...]
/external/v8/src/
H A Dhydrogen.cc1372 dense_(zone->NewArray<int>(capacity)),
1383 return 0 <= d && d < length_ && dense_[d] == n;
1388 dense_[length_] = n;
1399 int* dense_; member in class:v8::internal::SparseSet

Completed in 109 milliseconds