HomeSort by relevance Sort by last modified time
    Searched refs:array_ (Results 1 - 25 of 82) sorted by null

1 2 3 4

  /external/chromium/chrome/browser/sync/util/
dbgq.h 18 DebugQueue() : i_(array_) { }
20 i_ = (array_ == i_ ? array_ + size - 1 : i_ - 1);
25 T array_[size]; member in class:DebugQueue
  /libcore/luni/src/main/native/
ExecStrings.cpp 27 : env_(env), java_array_(java_string_array), array_(NULL) {
33 array_ = new char*[length + 1];
34 array_[length] = NULL;
39 array_[i] = string;
44 if (array_ == NULL) {
57 env_->ReleaseStringUTFChars(java_string.get(), array_[i]);
59 delete[] array_;
70 return array_;
ExecStrings.h 30 char** array_; member in class:ExecStrings
  /external/ceres-solver/include/ceres/internal/
fixed_array.h 110 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_((n <= kInlineElement
    [all...]
scoped_ptr.h 202 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_ != p;
261 C* array_; member in class:ceres::internal::scoped_array
    [all...]
  /external/chromium_org/content/common/indexed_db/
indexed_db_key_path.cc 21 : type_(WebIDBKeyPathTypeArray), array_(array) {}
27 return array_;
45 return array_ == other.array_;
indexed_db_key.cc 67 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_.size(); i++)
    [all...]
indexed_db_key.h 41 const std::vector<IndexedDBKey>& array() const { return array_; }
50 std::vector<IndexedDBKey> array_; member in class:content::IndexedDBKey
indexed_db_key_path.h 34 std::vector<string16> array_; member in class:content::IndexedDBKeyPath
  /external/open-vcdiff/gtest/src/
gtest-test-part.cc 69 : 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/
gtest-test-part.cc 69 : 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/
font_data.cc 26 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/
scoped_ptr.h 174 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_ != p;
233 C* array_; member in class:scoped_array
    [all...]
  /external/chromium_org/third_party/cld/base/
scoped_ptr.h 187 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_ != p;
246 C* array_; member in class:scoped_array
    [all...]
  /external/chromium_org/base/containers/
small_map.h 390 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
587 ManualConstructor<value_type> array_[kArraySize]; member in union:base::SmallMap::__anon6101
    [all...]
  /external/chromium_org/third_party/tcmalloc/chromium/src/
pagemap.h 73 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...]
packed-cache-inl.h 161 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/
gtest-test-part.cc 69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
  /external/chromium_org/testing/gtest/src/
gtest-test-part.cc 69 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/
gtest-test-part.cc 69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
  /external/gtest/src/
gtest-test-part.cc 69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
  /external/llvm/utils/unittest/googletest/
gtest-test-part.cc 69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
  /external/mesa3d/src/gtest/src/
gtest-test-part.cc 69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
  /ndk/sources/third_party/googletest/googletest/src/
gtest-test-part.cc 69 array_.push_back(result);
79 return array_[index];
84 return static_cast<int>(array_.size());
  /external/chromium_org/third_party/WebKit/Source/wtf/
TCPackedCache.h 149 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 841 milliseconds

1 2 3 4