/frameworks/base/core/java/android/bluetooth/le/ |
BluetoothLeUtils.java | 66 Iterator<Map.Entry<T, byte[]>> it = map.entrySet().iterator(); local 67 while (it.hasNext()) { 68 Map.Entry<T, byte[]> entry = it.next(); 71 if (it.hasNext()) {
|
/frameworks/base/core/java/android/util/ |
FastImmutableArraySet.java | 26 * so it is worth copying the contents of the set to an array when iterating over it 40 FastIterator<T> it = mIterator; local 41 if (it == null) { 42 it = new FastIterator<T>(mContents); 43 mIterator = it; 45 it.mIndex = 0; 47 return it;
|
/frameworks/compile/mclinker/lib/LD/ |
GroupReader.cpp | 113 ArchiveListType::iterator it = ar_list.begin(); local 118 for (it = ar_list.begin(); it != end; ++it) { 119 Archive& ar = (*it)->archive; 120 // if --whole-archive is given to this archive, no need to read it again 130 for (it = ar_list.begin(); it != end; ++it) { 131 Archive& ar = (*it)->archive [all...] |
/frameworks/compile/mclinker/lib/Target/Mips/ |
MipsGOTPLT.cpp | 40 for (iterator it = begin(), ie = end(); it != ie; ++it, ++buffer) { 41 GOTPLTEntry* got = &(llvm::cast<GOTPLTEntry>((*it))); 64 iterator it = begin(); local 65 llvm::cast<GOTPLTEntry>(*it++).setValue(0); // PLT lazy resolver 66 llvm::cast<GOTPLTEntry>(*it++).setValue(0); // Module pointer 68 for (; it != end(); ++it) 69 llvm::cast<GOTPLTEntry>(*it).setValue(pltAddr) [all...] |
/frameworks/compile/mclinker/lib/Target/X86/ |
X86GOTPLT.cpp | 42 iterator it = begin(); local 45 ++it; 48 for (; it != end(); ++it) { 49 llvm::cast<X86_32GOTEntry>(*it).setValue(plt_addr + 6); 75 iterator it = begin(); local 78 ++it; 81 for (; it != end(); ++it) { 82 llvm::cast<X86_64GOTEntry>(*it).setValue(plt_addr + 6) [all...] |
/frameworks/compile/mclinker/unittests/ |
StringTableTest.cpp | 18 // create testee. modify it if need 56 StringTable::iterator it = m_pTestee->begin(); local 57 ASSERT_STREQ(*it, "Hello"); 58 ++it; 59 ASSERT_STREQ(*it, "World"); 60 ++it; 61 ASSERT_STREQ(*it, "Media"); 62 ++it; 63 ASSERT_STREQ(*it, "Tek"); 64 ++it; [all...] |
/frameworks/opt/telephony/src/java/com/android/internal/telephony/sip/ |
SipCallBase.java | 45 for (Iterator<Connection> it = mConnections.iterator(); it.hasNext(); ) { 46 Connection c = it.next(); 47 if (c.getState() == State.DISCONNECTED) it.remove();
|
/hardware/qcom/display/msm8084/libqdutils/ |
cb_utils.cpp | 81 Region::const_iterator it = wormholeRegion.begin(); local 83 while (it != end) { 84 const Rect& r = *it++;
|
/hardware/qcom/display/msm8226/libqdutils/ |
cb_utils.cpp | 81 Region::const_iterator it = wormholeRegion.begin(); local 83 while (it != end) { 84 const Rect& r = *it++;
|
/hardware/qcom/display/msm8994/libqdutils/ |
cb_utils.cpp | 83 Region::const_iterator it = wormholeRegion.begin(); local 85 while (it != end) { 86 const Rect& r = *it++;
|
/ndk/sources/third_party/googletest/googletest/src/ |
gtest-typed-test.cc | 71 for (DefinedTestIter it = defined_test_names_.begin(); 72 it != defined_test_names_.end(); 73 ++it) { 74 if (name == *it) { 88 for (DefinedTestIter it = defined_test_names_.begin(); 89 it != defined_test_names_.end(); 90 ++it) { 91 if (tests.count(*it) == 0) { 92 errors << "You forgot to list test " << *it << ".\n"; local
|
/packages/inputmethods/LatinIME/native/dicttoolkit/src/utils/ |
arguments_and_options.h | 46 const auto &it = mOptions.find(optionName); local 47 ASSERT(it != mOptions.end()); 48 return it->second; 52 const auto &it = mArguments.find(name); local 53 return it != mArguments.end() && !it->second.empty(); 57 const auto &it = mArguments.find(name); local 58 ASSERT(it != mArguments.end() && !it->second.empty()); 59 return it->second.front() 63 const auto &it = mArguments.find(name); local [all...] |
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v4/ |
ver4_patricia_trie_writing_helper.cpp | 171 TerminalPositionLookupTable::TerminalIdMap::const_iterator it = local 173 if (it == mTerminalIdMap->end()) { 178 if (!mPtNodeWriter->updateTerminalId(ptNodeParams, it->second)) { 179 AKLOGE("Cannot update terminal id. %d -> %d", it->first, it->second);
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ov_tree_map_/ |
erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 123 template<typename It> 124 It 126 erase_imp(It it) 129 if (it == end()) 132 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(*it)) 186 point_iterator it = find(r_key); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pat_trie_/ |
erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 148 for (typename inode::iterator it = 150 it != static_cast<inode_pointer>(p_nd)->end(); 151 ++it) 153 node_pointer p_child =* it; 168 erase(const_iterator it) 172 if (it == end() 249 iterator it = begin(); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/rb_tree_map_/ |
erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 46 point_iterator it = this->find(r_key); local 47 if (it == base_type::end()) 49 erase(it); 56 erase(iterator it) 59 if (it == base_type::end()) 60 return it; 93 iterator it = base_type::begin(); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/tree_policy/ |
order_statistics_imp.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 46 node_iterator it = node_begin(); local 49 while (it != end_it) 51 node_iterator l_it = it.get_l_child(); 55 return *it; 57 it = l_it; 61 it = it.get_r_child() 79 node_const_iterator it = node_begin(); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ov_tree_map_/ |
erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 123 template<typename It> 124 It 126 erase_imp(It it) 129 if (it == end()) 132 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(*it)) 186 point_iterator it = find(r_key); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pat_trie_/ |
erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 148 for (typename inode::iterator it = 150 it != static_cast<inode_pointer>(p_nd)->end(); 151 ++it) 153 node_pointer p_child =* it; 168 erase(const_iterator it) 172 if (it == end() 249 iterator it = begin(); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/rb_tree_map_/ |
erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 46 point_iterator it = this->find(r_key); local 47 if (it == base_type::end()) 49 erase(it); 56 erase(iterator it) 59 if (it == base_type::end()) 60 return it; 93 iterator it = base_type::begin(); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/tree_policy/ |
order_statistics_imp.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 46 node_iterator it = node_begin(); local 49 while (it != end_it) 51 node_iterator l_it = it.get_l_child(); 55 return *it; 57 it = l_it; 61 it = it.get_r_child() 79 node_const_iterator it = node_begin(); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/ov_tree_map_/ |
erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 123 template<typename It> 124 It 126 erase_imp(It it) 129 if (it == end()) 132 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(*it)) 186 point_iterator it = find(r_key); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/pat_trie_/ |
erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 148 for (typename inode::iterator it = 150 it != static_cast<inode_pointer>(p_nd)->end(); 151 ++it) 153 node_pointer p_child =* it; 168 erase(const_iterator it) 172 if (it == end() 249 iterator it = begin(); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/rb_tree_map_/ |
erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 46 point_iterator it = this->find(r_key); local 47 if (it == base_type::end()) 49 erase(it); 56 erase(iterator it) 59 if (it == base_type::end()) 60 return it; 93 iterator it = base_type::begin(); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/tree_policy/ |
order_statistics_imp.hpp | 6 // software; you can redistribute it and/or modify it under the terms 11 // This library is distributed in the hope that it will be useful, but 33 // purpose. It is provided "as is" without express or implied 46 node_iterator it = node_begin(); local 49 while (it != end_it) 51 node_iterator l_it = it.get_l_child(); 55 return *it; 57 it = l_it; 61 it = it.get_r_child() 79 node_const_iterator it = node_begin(); local [all...] |