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

1234

/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; }
117 return array_[i].element;
124 return array_[i].element;
127 inline iterator begin() { return &array_[0].element; }
128 inline iterator end() { return &array_[size_].element; }
130 inline const_iterator begin() const { return &array_[0].element; }
131 inline const_iterator end() const { return &array_[size_].element; }
154 InnerContainer* const array_; member in class:ceres::internal::FixedArray
166 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/ppapi/shared_impl/
H A Dscoped_pp_var.cc54 : array_(array),
60 array_ = static_cast<PP_Var*>(
65 array_[i] = PP_MakeUndefined();
70 CallRelease(array_[i]);
72 thunk::GetPPB_Memory_Dev_0_1_Thunk()->MemFree(array_);
77 PP_Var* result = array_;
78 array_ = NULL;
86 CallRelease(array_[index]);
87 array_[index] = var.get();
H A Dscoped_pp_var.h68 PP_Var* get() { return array_; }
73 const PP_Var& operator[](size_t index) { return array_[index]; }
79 PP_Var* array_; member in class:ppapi::ScopedPPVarArray
/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.cc78 array_(CopyKeyArray(array)),
102 for (size_t i = 0; i < array_.size(); i++) {
103 if (!array_[i].IsValid())
127 for (size_t i = 0; i < array_.size() && i < other.array_.size(); ++i) {
128 int result = array_[i].CompareTo(other.array_[i]);
132 return Compare(array_.size(), other.array_.size());
/external/chromium_org/v8/src/
H A Dunique.h136 UniqueSet() : size_(0), capacity_(0), array_(NULL) { }
141 array_(zone->NewArray<Unique<T> >(capacity)) {
147 : size_(1), capacity_(1), array_(zone->NewArray<Unique<T> >(1)) {
148 array_[0] = uniq;
156 if (array_[i] == uniq) return;
157 if (array_[i].raw_address_ > uniq.raw_address_) {
160 for (int j = size_ - 1; j >= i; j--) array_[j + 1] = array_[j];
161 array_[i] = uniq;
168 array_[size
327 Unique<T>* array_; member in class:v8::internal::FINAL
[all...]
/external/chromium_org/third_party/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_org/third_party/webrtc/modules/audio_coding/neteq/
H A Daudio_vector.cc29 memcpy(copy_to->array_.get(), array_.get(), Size() * sizeof(int16_t));
37 memmove(&array_[insert_length], &array_[0], Size() * sizeof(int16_t));
38 memcpy(&array_[0], &prepend_this.array_[0], insert_length * sizeof(int16_t));
48 PushBack(append_this.array_.get(), append_this.Size());
53 memcpy(&array_[first_free_ix_], append_this, length * sizeof(int16_t));
63 memmove(&array_[0], &array_[lengt
[all...]
H A Daudio_vector_unittest.cc28 array_[i] = i;
33 return sizeof(array_) / sizeof(array_[0]);
36 int16_t array_[10]; member in class:webrtc::AudioVectorTest
67 vec.PushBack(array_, array_length());
72 EXPECT_EQ(array_[i], vec[i]);
73 EXPECT_EQ(array_[i], vec_copy[i]);
89 vec.PushBack(array_, array_length());
115 vec.PushFront(array_, array_length());
118 EXPECT_EQ(array_[
[all...]
H A Daudio_vector.h26 : array_(new int16_t[kDefaultInitialSize]),
32 : array_(new int16_t[initial_size]),
35 memset(array_.get(), 0, initial_size * sizeof(int16_t));
111 scoped_ptr<int16_t[]> array_; member in class:webrtc::AudioVector
112 size_t first_free_ix_; // The first index after the last sample in array_.
113 // Note that this index may point outside of array_.
/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_org/ui/file_manager/file_manager/foreground/js/
H A Dfolder_shortcuts_data_model.js22 this.array_ = [];
65 return this.array_.length;
230 return this.array_.slice(begin, opt_end);
238 return this.array_[index];
249 if (this.array_[i].toURL() === value)
262 if (util.isSameEntry(this.array_[i], value))
308 var oldArray = this.array_.slice(0); // Shallow copy.
312 if (util.isSameEntry(this.array_[i], value))
317 if (this.compare(this.array_[i], value) >= 0) {
318 this.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::__anon2214
[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_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/llvm/utils/unittest/googletest/src/
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/third_party/tcmalloc/vendor/src/
H A Dpacked-cache-inl.h159 array_[Hash(key)] = KeyToUpper(key) | value;
164 return KeyMatch(array_[Hash(key)], key);
168 // As with other code in this class, we touch array_ as few times
173 T entry = array_[Hash(key)];
181 array_[i] = kUseWholeKeys ? (value | KeyToUpper(i)) : value;
231 // array_ is the cache. Its elements are volatile because any
233 volatile T array_[1 << kHashbits]; member in class:PackedCache
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/plugin_settings/domui/js/cr/ui/
H A Darray_data_model.js20 this.array_ = array;
37 return this.array_.length;
49 return this.array_[this.indexes_[index]];
95 return this.array_.indexOf(item, opt_fromIndex);
105 return this.array_.slice.apply(this.array_, arguments);
141 var arr = this.array_;
333 var item1 = this.array_[index1];
334 var item2 = this.array_[index2];

Completed in 8439 milliseconds

1234