| /bionic/libc/upstream-openbsd/lib/libc/gen/ |
| alarm.c | 40 struct itimerval it, oitv; local
41 struct itimerval *itp = ⁢
|
| /external/libbrillo/brillo/ |
| variant_dictionary.h | 19 // and convert it to the type T. If the value does not exist, or the type
24 VariantDictionary::const_iterator it = dictionary.find(key); local
25 if (it == dictionary.end()) {
28 return it->second.TryGet<T>();
|
| /external/libcxx/test/std/iterators/stream.iterators/istream.iterator/istream.iterator.cons/ |
| default.fail.cpp | 25 constexpr std::istream_iterator<S> it; local
|
| default.pass.cpp | 23 T it; local
24 assert(it == T());
|
| /external/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator.cons/ |
| default.pass.cpp | 27 T it; local
28 assert(it == T());
35 T it; local
36 assert(it == T());
|
| /system/nativepower/daemon/ |
| system_property_setter_stub.cc | 27 const auto it = properties_.find(key); local
28 return it != properties_.end() ? it->second : std::string();
|
| /external/parameter-framework/upstream/parameter/ |
| HardwareBackSynchronizer.cpp | 40 std::list<const CConfigurableElement *>::const_iterator it; local
42 for (it = _needingBackSyncList.begin(); it != _needingBackSyncList.end(); ++it) {
44 const CConfigurableElement *pConfigurableElement = *it;
|
| SimulatedBackSynchronizer.cpp | 46 std::list<const CConfigurableElement *>::const_iterator it; local
48 for (it = _needingBackSyncList.begin(); it != _needingBackSyncList.end(); ++it) {
50 const CConfigurableElement *pConfigurableElement = *it;
|
| ElementLibrary.cpp | 40 ElementBuilderMapIterator it; local
42 for (it = _elementBuilderMap.begin(); it != _elementBuilderMap.end(); ++it) {
44 delete it->second;
51 ElementBuilderMapConstIterator it = _elementBuilderMap.find(getBuilderType(xmlElement)); local
53 if (it != _elementBuilderMap.end()) {
55 return it->second->createElement(xmlElement);
|
| SyncerSet.cpp | 63 SyncerSetConstIterator it; local
65 for (it = _syncerSet.begin(); it != _syncerSet.end(); ++it) {
67 ISyncer *pSyncer = *it;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/ |
| compare.pass.cpp | 29 std::map<Key, int>::iterator it = std::map<Key, int>().find(Key(0)); local
|
| /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_/ |
| split_join_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
76 iterator it = upper_bound(r_key); local
78 new_other.copy_from_ordered_range(it, end());
80 new_this.copy_from_ordered_range(begin(), it); local
|
| /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_/ |
| split_join_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
76 iterator it = upper_bound(r_key); local
78 new_other.copy_from_ordered_range(it, end());
80 new_this.copy_from_ordered_range(begin(), it); local
|
| /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_/ |
| split_join_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
76 iterator it = upper_bound(r_key); local
78 new_other.copy_from_ordered_range(it, end());
80 new_this.copy_from_ordered_range(begin(), it); local
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/ov_tree_map_/ |
| split_join_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
76 iterator it = upper_bound(r_key); local
78 new_other.copy_from_ordered_range(it, end());
80 new_this.copy_from_ordered_range(begin(), it); local
|
| /system/update_engine/update_manager/ |
| evaluation_context-inl.h | 34 ValueCacheMap::iterator it = value_cache_.find(var); local
35 if (it != value_cache_.end())
36 return reinterpret_cast<const T*>(it->second.value());
|
| /external/libchrome/base/metrics/ |
| sample_map_unittest.cc | 65 scoped_ptr<SampleCountIterator> it = samples.Iterator(); local
71 it->Get(&min, &max, &count);
75 EXPECT_FALSE(it->GetBucketIndex(NULL));
77 it->Next();
78 it->Get(&min, &max, &count);
83 it->Next();
84 it->Get(&min, &max, &count);
89 it->Next();
90 EXPECT_TRUE(it->Done());
108 scoped_ptr<SampleCountIterator> it = samples.Iterator() local
137 scoped_ptr<SampleCountIterator> it = samples.Iterator(); local
[all...] |
| /external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.overview/ |
| indexing.pass.cpp | 31 auto it = vals.begin (); local
32 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
34 assert ( *it == dyn[i]);
41 auto it = vals.begin (); local
42 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
44 assert ( *it == dyn[i]);
|
| /external/libyuv/files/source/ |
| mjpeg_validate.cc | 24 const uint8* it = sample; local
25 while (it < end) {
27 it = static_cast<const uint8 *>(memchr(it, 0xff, end - it));
28 if (it == NULL) {
31 if (it[1] == 0xd9) {
34 ++it; // Skip over current 0xff.
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| params.h | 61 IndexParams::const_iterator it = params.find(name); local
62 if (it != params.end()) {
63 return it->second.cast<T>();
73 IndexParams::const_iterator it = params.find(name); local
74 if (it != params.end()) {
75 return it->second.cast<T>();
84 IndexParams::const_iterator it; local
86 for(it=params.begin(); it!=params.end(); ++it) {
[all...] |
| /external/opencv3/samples/python2/ |
| peopledetect.py | 28 import itertools as it namespace
35 for fn in it.chain(*map(glob, sys.argv[1:])):
|
| /frameworks/compile/mclinker/unittests/ |
| SymbolTableTest.cpp | 17 // create testee. modify it if need
37 mcld::SymbolTable<>::iterator it; local
38 it = m_pTestee->begin();
39 ASSERT_EQ(it, m_pTestee->end());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/dynarray/dynarray.overview/ |
| indexing.pass.cpp | 31 auto it = vals.begin (); local
32 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
34 assert ( *it == dyn[i]);
41 auto it = vals.begin (); local
42 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
44 assert ( *it == dyn[i]);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/rc_binomial_heap_/ |
| debug_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
65 typename rc_t::const_iterator it = m_rc.end(); local
66 --it;
70 PB_DS_DEBUG_VERIFY(*it == p_nd);
77 --it;
80 PB_DS_DEBUG_VERIFY(it + 1 == m_rc.begin());
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/rc_binomial_heap_/ |
| debug_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
65 typename rc_t::const_iterator it = m_rc.end(); local
66 --it;
70 PB_DS_DEBUG_VERIFY(*it == p_nd);
77 --it;
80 PB_DS_DEBUG_VERIFY(it + 1 == m_rc.begin());
|
