Home
last modified time | relevance | path

Searched refs:array_ (Results 1 – 25 of 79) sorted by relevance

1234

/external/chromium_org/v8/src/
Dunique.h136 UniqueSet() : size_(0), capacity_(0), array_(NULL) { } in UniqueSet()
141 array_(zone->NewArray<Unique<T> >(capacity)) { in UniqueSet()
147 : size_(1), capacity_(1), array_(zone->NewArray<Unique<T> >(1)) { in UniqueSet()
148 array_[0] = uniq; in UniqueSet()
156 if (array_[i] == uniq) return; in Add()
157 if (array_[i].raw_address_ > uniq.raw_address_) { in Add()
160 for (int j = size_ - 1; j >= i; j--) array_[j + 1] = array_[j]; in Add()
161 array_[i] = uniq; in Add()
168 array_[size_++] = uniq; in Add()
174 if (array_[i] == uniq) { in Remove()
[all …]
Dhydrogen-gvn.cc18 array_(NULL), in HInstructionMap()
63 HInstructionMapListElement* array_; member in v8::internal::FINAL
139 array_(zone->NewArray<HInstructionMapListElement>(other->array_size_)), in HInstructionMap()
143 MemCopy(array_, other->array_, in HInstructionMap()
154 HInstruction* instr = array_[i].instr; in Kill()
159 for (int current = array_[i].next; current != kNil; current = next) { in Kill()
175 array_[i].next = kept; in Kill()
178 instr = array_[i].instr; in Kill()
182 int head = array_[i].next; in Kill()
184 array_[i].instr = NULL; in Kill()
[all …]
/external/chromium_org/third_party/webrtc/modules/audio_coding/neteq/
Daudio_vector.cc29 memcpy(copy_to->array_.get(), array_.get(), Size() * sizeof(int16_t)); in CopyTo()
37 memmove(&array_[insert_length], &array_[0], Size() * sizeof(int16_t)); in PushFront()
38 memcpy(&array_[0], &prepend_this.array_[0], insert_length * sizeof(int16_t)); in PushFront()
48 PushBack(append_this.array_.get(), append_this.Size()); in PushBack()
53 memcpy(&array_[first_free_ix_], append_this, length * sizeof(int16_t)); in PushBack()
63 memmove(&array_[0], &array_[length], remaining_samples * sizeof(int16_t)); in PopFront()
76 memset(&array_[first_free_ix_], 0, extra_length * sizeof(int16_t)); in Extend()
87 int16_t* insert_position_ptr = &array_[position]; in InsertAt()
101 int16_t* insert_position_ptr = &array_[position]; in InsertZerosAt()
115 memcpy(&array_[position], insert_this, length * sizeof(int16_t)); in OverwriteAt()
[all …]
Daudio_vector_unittest.cc28 array_[i] = i; in SetUp()
33 return sizeof(array_) / sizeof(array_[0]); in array_length()
36 int16_t array_[10]; member in webrtc::AudioVectorTest
67 vec.PushBack(array_, array_length()); in TEST_F()
72 EXPECT_EQ(array_[i], vec[i]); in TEST_F()
73 EXPECT_EQ(array_[i], vec_copy[i]); in TEST_F()
89 vec.PushBack(array_, array_length()); in TEST_F()
115 vec.PushFront(array_, array_length()); in TEST_F()
118 EXPECT_EQ(array_[i], vec[i]); in TEST_F()
144 vec.PushBack(array_, array_length()); in TEST_F()
[all …]
Daudio_vector.h26 : array_(new int16_t[kDefaultInitialSize]), in AudioVector()
32 : array_(new int16_t[initial_size]), in AudioVector()
35 memset(array_.get(), 0, initial_size * sizeof(int16_t)); in AudioVector()
111 scoped_ptr<int16_t[]> array_; variable
/external/ceres-solver/include/ceres/internal/
Dfixed_array.h110 inline const T* get() const { return &array_[0].element; } in get()
111 inline T* get() { return &array_[0].element; } in get()
117 return array_[i].element;
124 return array_[i].element;
127 inline iterator begin() { return &array_[0].element; } in begin()
128 inline iterator end() { return &array_[size_].element; } in end()
130 inline const_iterator begin() const { return &array_[0].element; } in begin()
131 inline const_iterator end() const { return &array_[size_].element; } in end()
154 InnerContainer* const array_; variable
166 array_((n <= kInlineElements in FixedArray()
[all …]
Dscoped_ptr.h202 explicit scoped_array(C* p = NULL) : array_(p) { } in array_() function
208 delete[] array_; in ~scoped_array()
215 if (p != array_) {
217 delete[] array_;
218 array_ = p;
226 assert(array_ != NULL);
227 return array_[i];
233 return array_; in get()
239 bool operator==(const C* p) const { return array_ == p; }
240 bool operator!=(const C* p) const { return array_ != p; }
[all …]
/external/chromium_org/base/containers/
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_++]->second;
[all …]
/external/chromium_org/ppapi/shared_impl/
Dscoped_pp_var.cc54 : array_(array), in ScopedPPVarArray()
60 array_ = static_cast<PP_Var*>( in ScopedPPVarArray()
65 array_[i] = PP_MakeUndefined(); in ScopedPPVarArray()
70 CallRelease(array_[i]); in ~ScopedPPVarArray()
72 thunk::GetPPB_Memory_Dev_0_1_Thunk()->MemFree(array_); in ~ScopedPPVarArray()
77 PP_Var* result = array_; in Release()
78 array_ = NULL; in Release()
86 CallRelease(array_[index]); in Set()
87 array_[index] = var.get(); in Set()
/external/chromium_org/ui/file_manager/file_manager/foreground/js/
Dfolder_shortcuts_data_model.js22 this.array_ = []; property in FolderShortcutsDataModel
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_.splice(i, 0, value);
[all …]
/external/chromium_org/third_party/cld/base/
Dscoped_ptr.h187 explicit scoped_array(C* p = NULL) : array_(p) { } in array_() function
193 delete[] array_; in ~scoped_array()
200 if (p != array_) {
202 delete[] array_;
203 array_ = p;
211 assert(array_ != NULL);
212 return array_[i];
218 return array_; in get()
224 bool operator==(const C* p) const { return array_ == p; }
225 bool operator!=(const C* p) const { return array_ != p; }
[all …]
/external/chromium_org/third_party/tcmalloc/chromium/src/
Dpagemap.h73 void** array_; variable
79 array_ = reinterpret_cast<void**>((*allocator)(sizeof(void*) << BITS)); in TCMalloc_PageMap1()
80 memset(array_, 0, sizeof(void*) << BITS); in TCMalloc_PageMap1()
101 return array_[k]; in get()
109 array_[k] = v; in set()
116 if (array_[k] != NULL) return array_[k]; in Next()
139 void** array_; variable
149 return (index * sizeof(*array_)) >> kPageShift; in ContainingPage()
169 size_t size = sizeof(*array_) << BITS; in TCMalloc_PageMap1_LazyCommit()
170 array_ = reinterpret_cast<void**>(VirtualAlloc( in TCMalloc_PageMap1_LazyCommit()
[all …]
Dpacked-cache-inl.h161 array_[Hash(key)] = KeyToUpper(key) | value; in Put()
166 return KeyMatch(array_[Hash(key)], key); in Has()
175 T entry = array_[Hash(key)]; in GetOrDefault()
183 array_[i] = kUseWholeKeys ? (value | KeyToUpper(i)) : value; in Clear()
235 volatile T array_[1 << kHashbits]; variable
/external/chromium_org/content/common/indexed_db/
Dindexed_db_key.cc78 array_(CopyKeyArray(array)), in IndexedDBKey()
102 for (size_t i = 0; i < array_.size(); i++) { in IsValid()
103 if (!array_[i].IsValid()) in IsValid()
127 for (size_t i = 0; i < array_.size() && i < other.array_.size(); ++i) { in CompareTo()
128 int result = array_[i].CompareTo(other.array_[i]); in CompareTo()
132 return Compare(array_.size(), other.array_.size()); in CompareTo()
Dindexed_db_key_path.cc21 : type_(WebIDBKeyPathTypeArray), array_(array) {} in IndexedDBKeyPath()
27 return array_; in array()
45 return array_ == other.array_; in operator ==()
/external/jsoncpp/src/lib_json/
Djson_valueiterator.inl28 iterator_.array_ = ValueInternalArray::IteratorState();
43 iterator_.array_ = state;
61 return ValueInternalArray::dereference( iterator_.array_ );
74 ValueInternalArray::increment( iterator_.array_ );
87 ValueInternalArray::decrement( iterator_.array_ );
124 return ValueInternalArray::distance( iterator_.array_, other.iterator_.array_ );
141 return ValueInternalArray::equals( iterator_.array_, other.iterator_.array_ );
154 iterator_.array_ = other.iterator_.array_;
174 return Value( ValueInternalArray::indexOf( iterator_.array_ ) );
194 return Value::UInt( ValueInternalArray::indexOf( iterator_.array_ ) );
Djson_internalarray.inl167 return x.array_ == other.array_
176 JSON_ASSERT_MESSAGE( it.array_ &&
177 (it.currentPageIndex_ - it.array_->pages_)*itemsPerPage + it.currentItemIndex_
178 != it.array_->size_,
192 JSON_ASSERT_MESSAGE( it.array_ && it.currentPageIndex_ == it.array_->pages_
217 JSON_ASSERT_MESSAGE( it.array_ &&
218 (it.currentPageIndex_ - it.array_->pages_)*itemsPerPage + it.currentItemIndex_
219 < it.array_->size_,
227 it.array_ = const_cast<ValueInternalArray *>( this );
236 it.array_ = const_cast<ValueInternalArray *>( this );
[all …]
/external/chromium_org/ui/webui/resources/js/cr/ui/
Darray_data_model.js28 this.array_ = array;
45 return this.array_.length;
57 return this.array_[this.indexes_[index]];
127 var arr = this.array_;
154 newArray.push(this.array_[this.indexes_[i]]);
159 deletedItems.push(this.array_[this.indexes_[i]]);
170 newArray.push(this.array_[this.indexes_[i]]);
175 this.array_ = newArray;
238 this.array_[this.indexes_[index]] = newItem;
421 var item1 = this.array_[index1];
[all …]
/external/protobuf/gtest/src/
Dgtest-test-part.cc69 : array_(new internal::Vector<TestPartResult>) { in TestPartResultArray()
74 delete array_; in ~TestPartResultArray()
79 array_->PushBack(result); in Append()
89 return array_->GetElement(index); in GetTestPartResult()
94 return array_->size(); in size()
/external/sfntly/cpp/src/sfntly/data/
Dfont_data.cc26 return std::min<int32_t>(array_->Size() - bound_offset_, bound_length_); in Size()
47 return std::min<int32_t>(array_->Length() - bound_offset_, bound_length_); in Length()
55 Init(data->array_); in FontData()
60 Init(data->array_); in FontData()
69 array_ = ba; in Init()
/external/chromium_org/third_party/sfntly/cpp/src/sfntly/data/
Dfont_data.cc26 return std::min<int32_t>(array_->Size() - bound_offset_, bound_length_); in Size()
47 return std::min<int32_t>(array_->Length() - bound_offset_, bound_length_); in Length()
55 Init(data->array_); in FontData()
60 Init(data->array_); in FontData()
69 array_ = ba; in Init()
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/plugin_settings/domui/js/cr/ui/
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];
/external/chromium_org/third_party/tcmalloc/vendor/src/
Dpacked-cache-inl.h159 array_[Hash(key)] = KeyToUpper(key) | value; in Put()
164 return KeyMatch(array_[Hash(key)], key); in Has()
173 T entry = array_[Hash(key)]; in GetOrDefault()
181 array_[i] = kUseWholeKeys ? (value | KeyToUpper(i)) : value; in Clear()
233 volatile T array_[1 << kHashbits]; variable
/external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/
Dcommon.h557 explicit scoped_array(C* p = NULL) : array_(p) { } in array_() function
563 delete[] array_; in ~scoped_array()
570 if (p != array_) {
572 delete[] array_;
573 array_ = p;
581 assert(array_ != NULL);
582 return array_[i];
588 return array_; in get()
594 bool operator==(C* p) const { return array_ == p; }
595 bool operator!=(C* p) const { return array_ != p; }
[all …]
/external/protobuf/src/google/protobuf/stubs/
Dcommon.h511 explicit scoped_array(C* p = NULL) : array_(p) { } in array_() function
517 delete[] array_; in ~scoped_array()
524 if (p != array_) {
526 delete[] array_;
527 array_ = p;
535 assert(array_ != NULL);
536 return array_[i];
542 return array_; in get()
548 bool operator==(C* p) const { return array_ == p; }
549 bool operator!=(C* p) const { return array_ != p; }
[all …]

1234