Home
last modified time | relevance | path

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

1234

/external/chromium_org/chrome/browser/resources/file_manager/foreground/js/
Dfolder_shortcuts_data_model.js14 this.array_ = []; property in FolderShortcutsDataModel
41 var permutation = this.calculatePermutation_(this.array_, list);
42 this.array_ = list;
59 if (this.array_.length == list.length) {
61 for (var i = 0; i < this.array_.length; i++) {
63 if (this.array_[i] != list[i]) {
72 var permutation = this.calculatePermutation_(this.array_, list);
73 this.array_ = list;
93 return this.array_.length;
105 return this.array_.slice(begin, opt_end);
[all …]
/external/chromium_org/v8/src/
Dunique.h154 UniqueSet() : size_(0), capacity_(0), array_(NULL) { } in UniqueSet()
161 if (array_[i] == uniq) return; in Add()
162 if (array_[i].raw_address_ > uniq.raw_address_) { in Add()
165 for (int j = size_ - 1; j >= i; j--) array_[j + 1] = array_[j]; in Add()
166 array_[i] = uniq; in Add()
173 array_[size_++] = uniq; in Add()
179 if (array_[i] == uniq) { in Remove()
180 while (++i < size_) array_[i - 1] = array_[i]; in Remove()
191 if (this->array_[i] != that->array_[i]) return false; in Equals()
201 if (this->array_[i] == elem) return true; in Contains()
[all …]
Dhydrogen-gvn.cc42 array_(NULL), in HValueMap()
87 HValueMapListElement* array_; // Primary store - contains the first value member in v8::internal::HValueMap
160 array_(zone->NewArray<HValueMapListElement>(other->array_size_)), in HValueMap()
164 array_, other->array_, array_size_ * sizeof(HValueMapListElement)); in HValueMap()
175 HValue* value = array_[i].value; in Kill()
180 for (int current = array_[i].next; current != kNil; current = next) { in Kill()
195 array_[i].next = kept; in Kill()
198 value = array_[i].value; in Kill()
201 int head = array_[i].next; in Kill()
203 array_[i].value = NULL; in Kill()
[all …]
/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()
118 return array_[i].element;
126 return array_[i].element;
129 inline iterator begin() { return &array_[0].element; } in begin()
130 inline iterator end() { return &array_[size_].element; } in end()
132 inline const_iterator begin() const { return &array_[0].element; } in begin()
133 inline const_iterator end() const { return &array_[size_].element; } in end()
156 InnerContainer* const array_; variable
168 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/base/memory/
Dscoped_ptr.h174 explicit scoped_array(C* p = NULL) : array_(p) { } in array_() function
180 delete[] array_; in ~scoped_array()
187 if (p != array_) {
189 delete[] array_;
190 array_ = p;
198 assert(array_ != NULL);
199 return array_[i];
205 return array_; in get()
211 bool operator==(C* p) const { return array_ == p; }
212 bool operator!=(C* p) const { return array_ != p; }
[all …]
/external/chromium_org/content/common/indexed_db/
Dindexed_db_key.cc68 array_(CopyKeyArray(keys)), in IndexedDBKey()
95 for (size_t i = 0; i < array_.size() && i < other.array_.size(); ++i) { in Compare()
96 if (int result = array_[i].Compare(other.array_[i])) in Compare()
99 if (array_.size() < other.array_.size()) in Compare()
101 if (array_.size() > other.array_.size()) in Compare()
136 for (size_t i = 0; i < array_.size(); i++) { in IsValid()
137 if (!array_[i].IsValid()) in IsValid()
Dindexed_db_key_path.cc21 : type_(WebIDBKeyPathTypeArray), array_(array) {} in IndexedDBKeyPath()
27 return array_; in array()
45 return array_ == other.array_; in operator ==()
/external/chromium/chrome/browser/resources/shared/js/cr/ui/
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/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/chrome/browser/sync/util/
Ddbgq.h18 DebugQueue() : i_(array_) { } in DebugQueue()
20 i_ = (array_ == i_ ? array_ + size - 1 : i_ - 1); in Push()
25 T array_[size]; variable
/external/open-vcdiff/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/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/ui/webui/resources/js/cr/ui/
Darray_data_model.js20 this.array_ = array;
37 return this.array_.length;
49 return this.array_[this.indexes_[index]];
118 var arr = this.array_;
145 newArray.push(this.array_[this.indexes_[i]]);
150 deletedItems.push(this.array_[this.indexes_[i]]);
161 newArray.push(this.array_[this.indexes_[i]]);
166 this.array_ = newArray;
383 var item1 = this.array_[index1];
384 var item2 = this.array_[index2];
/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/qemu/elff/
Ddwarf_defs.h720 : array_(&small_array_[0]), in DwarfAbbrDieArray()
727 if (array_ != &small_array_[0]) { in ~DwarfAbbrDieArray()
728 delete[] array_; in ~DwarfAbbrDieArray()
780 memcpy(new_array, array_, count_ * sizeof(const Dwarf_Abbr_DIE*)); in add()
781 if (array_ != &small_array_[0]) { in add()
782 delete[] array_; in add()
784 array_ = new_array; in add()
789 array_[num - 1] = abbr; in add()
814 return array_[num - 1]; in get()
865 return array_[num - 1]; in cache_to()
[all …]
/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/WebKit/Source/wtf/
DTCPackedCache.h149 array_[Hash(key)] = static_cast<T>(KeyToUpper(key) | value); in Put()
154 return KeyMatch(array_[Hash(key)], key); in Has()
163 T entry = array_[Hash(key)]; in GetOrDefault()
170 array_[i] = static_cast<T>(value); in Clear()
224 T array_[1 << kHashbits]; variable
/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 …]
/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 …]

1234