Lines Matching refs:dense_
55 // 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_ being deleted and then
122 return dense_.begin();
125 return dense_.begin() + size_;
129 return dense_.begin();
132 return dense_.begin() + size_;
226 vector<IndexValue> dense_;
234 : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_(), valgrind_(RunningOnValgrind()) {}
263 return dense_[i];
284 dense_.resize(new_max_size);
302 dense_[sparse_to_dense_[i]].index_ == i;
326 p = make_pair(dense_.begin() + sparse_to_dense_[new_value.index_], false);
344 return dense_.begin() + sparse_to_dense_[i];
352 return dense_.begin() + sparse_to_dense_[i];
362 dense_[sparse_to_dense_[i]].second = v;
364 return dense_.begin() + sparse_to_dense_[i];
385 return dense_[sparse_to_dense_[i]].second;
402 dense_[di] = dense_[size_ - 1];
403 sparse_to_dense_[dense_[di].index_] = di;
414 dense_[size_].index_ = i;
422 dense_.resize(max_size);
427 dense_[i].index_ = 0xababababU;
