Searched defs:element (Results 1 - 7 of 7) sorted by relevance

/art/runtime/
H A Dmapping_table.h68 DexToPcIterator(const MappingTable* table, uint32_t element) : argument
69 table_(table), element_(element), end_(table_->DexToPcSize()), encoded_table_ptr_(nullptr),
71 if (element == 0) { // An iterator wanted from the start.
79 DCHECK_EQ(table_->DexToPcSize(), element);
145 PcToDexIterator(const MappingTable* table, uint32_t element) : argument
146 table_(table), element_(element), end_(table_->PcToDexSize()), encoded_table_ptr_(nullptr),
148 if (element == 0) { // An iterator wanted from the start.
156 DCHECK_EQ(table_->PcToDexSize(), element);
H A Dclass_linker.cc2080 mirror::Object* element = dex_elements->GetWithoutChecks(i); local
2081 if (element == nullptr) {
2085 mirror::Object* dex_file = dex_file_field->GetObject(element);
3088 // us. It's used to ensure that we're looking for the element type in
3090 // array class; that always comes from the base element class.
3117 // element type -- an array of Strings goes with the loader for
3323 // Update the element in the hash set.
5980 const std::pair<const char*, mirror::ClassLoader*>& element) const {
5981 return ComputeModifiedUtf8Hash(element.first);
H A Ddebugger.cc1338 mirror::Object* element = oa->Get(offset + i); local
1339 JDWP::JdwpTag specific_tag = (element != nullptr) ? TagFromObject(soa, element)
1342 expandBufAddObjectId(pReply, gRegistry->Add(element));
4595 // Returns the index of the head element.
4598 // we want to use the current element. Take "head+1" and subtract count
/art/compiler/utils/
H A Dgrowable_array.h115 // Insert an element to the end of a list, resizing if necessary.
141 // Overwrite existing element at position index. List must be large enough.
153 * Remove an existing element from list. If there are more than one copy
154 * of the element, only the first one encountered will be deleted.
157 void Delete(T element) { argument
160 if (!found && elem_list_[i] == element) {
167 // We should either have found the element, or it was the last (unscanned) element.
168 DCHECK(found || (element == elem_list_[num_used_ - 1]));
/art/test/122-npe/src/
H A DMain.java565 static void checkElement(StackTraceElement element, argument
568 assertEquals(declaringClass, element.getClassName());
569 assertEquals(methodName, element.getMethodName());
570 assertEquals(fileName, element.getFileName());
571 assertEquals(lineNumber, element.getLineNumber());
/art/runtime/base/
H A Dhash_set.h177 // If an element inbetween doesn't rehash to the range from the current empty slot to the
181 // element to its actual location/index.
191 // If the next element is empty, we are done. Make sure to clear the current empty index.
196 // Otherwise try to see if the next element can fill the current empty index.
227 // Find an element, returns end() if not found.
232 Iterator Find(const K& element) { argument
233 return FindWithHash(element, hashfn_(element));
236 Iterator FindWithHash(const K& element, size_t hash) { argument
237 DCHECK_EQ(hashfn_(element), has
251 Insert(const T& element) argument
254 InsertWithHash(const T& element, size_t hash) argument
275 const T& element = ElementForIndex(i); local
295 T& element = data_[i]; local
376 T& element = old_data[i]; local
[all...]
/art/test/107-int-math2/src/
H A DMain.java825 static void throwArrayStoreException(Object[] array, Object element) { argument
826 array[0] = element;

Completed in 240 milliseconds