Searched refs:array_ (Results 1 - 25 of 76) sorted by relevance

1234

/external/chromium/chrome/browser/sync/util/
H A Ddbgq.h18 DebugQueue() : i_(array_) { }
20 i_ = (array_ == i_ ? array_ + size - 1 : i_ - 1);
25 T array_[size]; member in class:DebugQueue
/external/chromium_org/chrome/browser/resources/file_manager/js/
H A Dfolder_shortcuts_data_model.js14 this.array_ = [];
38 var permutation = this.calculatePermitation_(this.array_, list);
39 this.array_ = list;
56 if (this.array_.length == list.length) {
58 for (var i = 0; i < this.array_.length; i++) {
60 if (this.array_[i] != list[i]) {
69 var permutation = this.calculatePermitation_(this.array_, list);
70 this.array_ = list;
90 return this.array_.length;
98 return this.array_[inde
[all...]
/external/chromium/chrome/browser/resources/shared/js/cr/ui/
H A Darray_data_model.js20 this.array_ = array;
31 return this.array_.length;
40 return this.array_[index];
51 return this.array_.indexOf(item, opt_fromIndex);
61 return this.array_.slice.apply(this.array_, arguments);
75 var arr = this.array_;
/external/ceres-solver/include/ceres/internal/
H A Dfixed_array.h110 inline const T* get() const { return &array_[0].element; }
111 inline T* get() { return &array_[0].element; }
118 return array_[i].element;
126 return array_[i].element;
129 inline iterator begin() { return &array_[0].element; }
130 inline iterator end() { return &array_[size_].element; }
132 inline const_iterator begin() const { return &array_[0].element; }
133 inline const_iterator end() const { return &array_[size_].element; }
156 InnerContainer* const array_; member in class:ceres::internal::FixedArray
168 array_((
[all...]
H A Dscoped_ptr.h202 explicit scoped_array(C* p = NULL) : array_(p) { }
208 delete[] array_;
215 if (p != array_) {
217 delete[] array_;
218 array_ = p;
226 assert(array_ != NULL);
227 return array_[i];
233 return array_;
239 bool operator==(const C* p) const { return array_ == p; }
240 bool operator!=(const C* p) const { return array_ !
261 C* array_; member in class:ceres::internal::scoped_array
[all...]
/external/chromium_org/content/common/indexed_db/
H A Dindexed_db_key_path.cc21 : type_(WebIDBKeyPathTypeArray), array_(array) {}
27 return array_;
45 return array_ == other.array_;
H A Dindexed_db_key.cc67 array_(CopyKeyArray(keys)),
88 for (size_t i = 0; i < array_.size() && i < other.array_.size(); ++i) {
89 if (int result = array_[i].Compare(other.array_[i]))
92 if (array_.size() < other.array_.size())
94 if (array_.size() > other.array_.size())
126 for (size_t i = 0; i < array_
[all...]
H A Dindexed_db_key.h41 const std::vector<IndexedDBKey>& array() const { return array_; }
50 std::vector<IndexedDBKey> array_; member in class:content::IndexedDBKey
/external/open-vcdiff/gtest/src/
H A Dgtest-test-part.cc69 : array_(new internal::Vector<TestPartResult>) {
74 delete array_;
79 array_->PushBack(result);
89 return array_->GetElement(index);
94 return array_->size();
/external/protobuf/gtest/src/
H A Dgtest-test-part.cc69 : array_(new internal::Vector<TestPartResult>) {
74 delete array_;
79 array_->PushBack(result);
89 return array_->GetElement(index);
94 return array_->size();
/external/sfntly/cpp/src/sfntly/data/
H A Dfont_data.cc26 return std::min<int32_t>(array_->Size() - bound_offset_, bound_length_);
47 return std::min<int32_t>(array_->Length() - bound_offset_, bound_length_);
55 Init(data->array_);
60 Init(data->array_);
69 array_ = ba;
/external/chromium/base/memory/
H A Dscoped_ptr.h174 explicit scoped_array(C* p = NULL) : array_(p) { }
180 delete[] array_;
187 if (p != array_) {
189 delete[] array_;
190 array_ = p;
198 assert(array_ != NULL);
199 return array_[i];
205 return array_;
211 bool operator==(C* p) const { return array_ == p; }
212 bool operator!=(C* p) const { return array_ !
233 C* array_; member in class:scoped_array
[all...]
/external/chromium_org/base/containers/
H A Dsmall_map.h390 if (compare(array_[i]->first, key)) {
391 return iterator(array_ + i);
394 return iterator(array_ + size_);
404 if (compare(array_[i]->first, key)) {
405 return const_iterator(array_ + i);
408 return const_iterator(array_ + size_);
422 if (compare(array_[i]->first, key)) {
423 return array_[i]->second;
430 array_[size_].Init(key, data_type());
431 return array_[size
587 ManualConstructor<value_type> array_[kArraySize]; member in union:base::SmallMap::__anon3695
[all...]
/external/chromium_org/third_party/cld/base/
H A Dscoped_ptr.h187 explicit scoped_array(C* p = NULL) : array_(p) { }
193 delete[] array_;
200 if (p != array_) {
202 delete[] array_;
203 array_ = p;
211 assert(array_ != NULL);
212 return array_[i];
218 return array_;
224 bool operator==(const C* p) const { return array_ == p; }
225 bool operator!=(const C* p) const { return array_ !
246 C* array_; member in class:scoped_array
[all...]
/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Dpagemap.h73 void** array_; member in class:TCMalloc_PageMap1
79 array_ = reinterpret_cast<void**>((*allocator)(sizeof(void*) << BITS));
80 memset(array_, 0, sizeof(void*) << BITS);
88 // ensure a number y where array_[y] would be an out-of-bounds
101 return array_[k];
109 array_[k] = v;
116 if (array_[k] != NULL) return array_[k];
133 // Dimension of our page map array_.
139 void** array_; member in class:TCMalloc_PageMap1_LazyCommit
[all...]
H A Dpacked-cache-inl.h161 array_[Hash(key)] = KeyToUpper(key) | value;
166 return KeyMatch(array_[Hash(key)], key);
170 // As with other code in this class, we touch array_ as few times
175 T entry = array_[Hash(key)];
183 array_[i] = kUseWholeKeys ? (value | KeyToUpper(i)) : value;
233 // array_ is the cache. Its elements are volatile because any
235 volatile T array_[1 << kHashbits]; member in class:PackedCache
/external/chromium/testing/gtest/src/
H A Dgtest-test-part.cc69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
/external/chromium_org/testing/gtest/src/
H A Dgtest-test-part.cc69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
/external/chromium_org/third_party/mesa/src/src/gtest/src/
H A Dgtest-test-part.cc69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
/external/gtest/src/
H A Dgtest-test-part.cc69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
/external/libvpx/libvpx/third_party/googletest/src/src/
H A Dgtest-test-part.cc69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
/external/llvm/utils/unittest/googletest/
H A Dgtest-test-part.cc69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
/external/mesa3d/src/gtest/src/
H A Dgtest-test-part.cc69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
/external/chromium_org/chrome/common/extensions/docs/examples/api/fontSettings/js/cr/ui/
H A Darray_data_model.js21 this.array_ = array;
38 return this.array_.length;
50 return this.array_[this.indexes_[index]];
119 var arr = this.array_;
146 newArray.push(this.array_[this.indexes_[i]]);
151 deletedItems.push(this.array_[this.indexes_[i]]);
162 newArray.push(this.array_[this.indexes_[i]]);
167 this.array_ = newArray;
380 var item1 = this.array_[index1];
381 var item2 = this.array_[index
[all...]
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DTCPackedCache.h149 array_[Hash(key)] = static_cast<T>(KeyToUpper(key) | value);
154 return KeyMatch(array_[Hash(key)], key);
158 // As with other code in this class, we touch array_ as few times
163 T entry = array_[Hash(key)];
170 array_[i] = static_cast<T>(value);
224 T array_[1 << kHashbits]; member in class:PackedCache

Completed in 559 milliseconds

1234