Searched defs:sparse_to_dense_ (Results 1 - 2 of 2) sorted by relevance
/external/regex-re2/util/ |
H A D | sparse_set.h | 57 : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_(NULL) {} 61 sparse_to_dense_ = new int[max_size]; 68 sparse_to_dense_[i] = 0xababababU; 75 delete[] sparse_to_dense_; 95 if (sparse_to_dense_) { 96 memmove(a, sparse_to_dense_, max_size_*sizeof a[0]); 101 delete[] sparse_to_dense_; 103 sparse_to_dense_ = a; 133 // Unsigned comparison avoids checking sparse_to_dense_[i] < 0. 134 return (uint)sparse_to_dense_[ 169 int* sparse_to_dense_; member in class:re2::SparseSet [all...] |
H A D | sparse_array.h | 55 // SparseArray uses a vector dense_ and an array sparse_to_dense_, both of 64 // The array sparse_to_dense_ maps from indices in [0,m) to indices in 66 // For indices present in the array, dense_[sparse_to_dense_[i]].index_ == i. 67 // For indices not present in the array, sparse_to_dense_ can contain 70 // The lax requirement on sparse_to_dense_ values makes clearing 73 // sparse_to_dense_[i] is in [0, size_) AND 74 // dense_[sparse_to_dense_[i]].index_ == i. 76 // dense_[sparse_to_dense_[i]].value_ 79 // To insert a new entry, set sparse_to_dense_[i] to size_, 84 // updating the appropriate sparse_to_dense_ entrie 225 int* sparse_to_dense_; member in class:re2::SparseArray [all...] |
Completed in 292 milliseconds