| /packages/apps/TV/jni/ |
| tunertvinput_jni.cpp | 42 std::map<jlong, DvbManager *>::iterator it = sDvbManagers.find(deviceId); local
43 if (it != sDvbManagers.end()) {
44 delete it->second;
45 sDvbManagers.erase(it);
57 std::map<jlong, DvbManager *>::iterator it = sDvbManagers.find(deviceId); local
59 if (it == sDvbManagers.end()) {
63 dvbManager = it->second;
78 std::map<jlong, DvbManager *>::iterator it = sDvbManagers.find(deviceId); local
79 if (it != sDvbManagers.end()) {
80 it->second->closeAllDvbPidFilter()
91 std::map<jlong, DvbManager *>::iterator it = sDvbManagers.find(deviceId); local
104 std::map<jlong, DvbManager *>::iterator it = sDvbManagers.find(deviceId); local
119 std::map<jlong, DvbManager *>::iterator it = sDvbManagers.find(deviceId); local
153 std::map<jlong, DvbManager *>::iterator it = sDvbManagers.find(deviceId); local
168 std::map<jlong, DvbManager *>::iterator it = sDvbManagers.find(deviceId); local
[all...] |
| /system/extras/memtrack/ |
| memtrack.cpp | 167 for (processes_t::iterator it = all_.begin(); it != all_.end(); ++it) {
168 it->second.pids.clear();
195 for (cur_processes_t::const_iterator it = cur_.begin();
196 it != cur_.end(); ++it) {
198 if (all_.count(it->first) == 0) {
200 all_[it->first].num_samples = 0;
201 all_[it->first].name = it->first
[all...] |
| /external/llvm/lib/Option/ |
| ArgList.cpp | 49 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it)
50 if ((*it)->getOption().matches(Id))
51 return *it;
57 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it)
58 if ((*it)->getOption().matches(Id0) ||
59 (*it)->getOption().matches(Id1)
[all...] |
| /external/libcxx/test/std/experimental/filesystem/class.directory_iterator/directory_iterator.members/ |
| increment.pass.cpp | 54 directory_iterator it(testDir, ec);
59 TEST_REQUIRE(it != endIt);
60 const path entry = *it;
62 directory_iterator& it_ref = ++it;
63 TEST_CHECK(&it_ref == &it);
66 TEST_CHECK(it == endIt);
77 directory_iterator it(testDir, ec);
82 TEST_REQUIRE(it != endIt);
83 const path entry = *it;
85 const path entry2 = *it++
[all...] |
| /external/webrtc/webrtc/modules/remote_bitrate_estimator/ |
| remote_estimator_proxy.cc | 109 for (auto it = packet_arrival_times_.begin();
110 it != packet_arrival_times_.end() && it->first < seq &&
111 arrival_time - it->second >= kBackWindowMs;) {
112 auto delete_it = it;
113 ++it;
133 auto it = packet_arrival_times_.find(window_start_seq_);
134 RTC_DCHECK(it != packet_arrival_times_.end());
139 feedback_packet->WithBase(static_cast<uint16_t>(it->first & 0xFFFF),
140 it->second * 1000)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/filesystem/class.directory_iterator/directory_iterator.members/ |
| increment.pass.cpp | 54 directory_iterator it(testDir, ec);
59 TEST_REQUIRE(it != endIt);
60 const path entry = *it;
62 directory_iterator& it_ref = ++it;
63 TEST_CHECK(&it_ref == &it);
66 TEST_CHECK(it == endIt);
77 directory_iterator it(testDir, ec);
82 TEST_REQUIRE(it != endIt);
83 const path entry = *it;
85 const path entry2 = *it++
[all...] |
| /external/javaparser/javaparser-testing/src/test/java/com/github/javaparser/printer/lexicalpreservation/transformations/ast/body/ |
| InitializerDeclarationTransformationsTest.java | 16 * JavaParser is distributed in the hope that it will be useful,
48 InitializerDeclaration it = consider("{ /*some comment*/ }"); local
49 it.setStatic(true);
50 assertTransformedToString("static { /*some comment*/ }", it);
55 InitializerDeclaration it = consider("static { /*some comment*/ }"); local
56 it.setStatic(false);
57 assertTransformedToString("{ /*some comment*/ }", it);
|
| /external/libchrome/base/metrics/ |
| histogram_snapshot_manager.h | 27 // corruption, this class also validates as much redundancy as it can before
39 // chosen. If all histograms should be recorded, set it to
46 for (ForwardHistogramIterator it = begin; it != end; ++it) {
47 (*it)->SetFlags(flags_to_set);
48 if (((*it)->flags() & required_flags) == required_flags)
49 PrepareDelta(*it);
56 // except that it does not update the previous logged values and can thus
|
| /external/libcxx/benchmarks/ |
| ContainerBenchmarks.hpp | 29 for (auto it = in.begin(); it != end; ++it) {
30 benchmark::DoNotOptimize(&(*c.insert(*it).first));
43 for (auto it = in.begin(); it != end; ++it) {
44 benchmark::DoNotOptimize(&(*c.insert(*it).first));
59 for (auto it = in.begin(); it != end; ++it)
[all...] |
| /external/nist-sip/java/gov/nist/javax/sip/header/ |
| AllowList.java | 82 for ( Iterator<Allow> it = this.hlist.iterator(); it.hasNext();) {
83 Allow a = (Allow)it.next();
106 ListIterator<String> it = methods.listIterator(); local
107 while (it.hasNext()) {
109 allow.setMethod((String) it.next());
|
| /external/parameter-framework/upstream/parameter/ |
| SelectionCriterionType.cpp | 78 for (NumToLitMapConstIt it = _numToLitMap.begin(); it != _numToLitMap.end(); ++it) {
79 if (it->second == iValue) {
121 NumToLitMapConstIt it = _numToLitMap.find(strValue); local
123 if (it != _numToLitMap.end()) {
125 iValue = it->second;
134 NumToLitMapConstIt it; local
136 for (it = _numToLitMap.begin(); it != _numToLitMap.end(); ++it)
159 NumToLitMapConstIt it; local
238 NumToLitMapConstIt it; local
[all...] |
| /external/tensorflow/tensorflow/contrib/lite/tools/ |
| mutable_op_resolver.cc | 22 auto it = builtins_.find(op); local
23 return it != builtins_.end() ? it->second : nullptr;
27 auto it = custom_ops_.find(op); local
28 return it != custom_ops_.end() ? it->second : nullptr;
|
| /external/turbine/java/com/google/turbine/parse/ |
| IteratorLexer.java | 30 private final Iterator<SavedToken> it; field in class:IteratorLexer
33 public IteratorLexer(SourceFile source, Iterator<SavedToken> it) {
35 this.it = it;
45 if (it.hasNext()) {
46 curr = it.next();
|
| /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;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/bin_search_tree_/ |
| r_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
66 iterator it(p_z);
67 ++it;
68 m_p_head->m_p_left = it.m_p_nd;
72 iterator it(p_z);
73 --it;
74 m_p_head->m_p_right = it.m_p_nd
[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/bin_search_tree_/ |
| r_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
66 iterator it(p_z);
67 ++it;
68 m_p_head->m_p_left = it.m_p_nd;
72 iterator it(p_z);
73 --it;
74 m_p_head->m_p_right = it.m_p_nd
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/benchmarks/ |
| ContainerBenchmarks.hpp | 29 for (auto it = in.begin(); it != end; ++it) {
30 benchmark::DoNotOptimize(&(*c.insert(*it).first));
43 for (auto it = in.begin(); it != end; ++it) {
44 benchmark::DoNotOptimize(&(*c.insert(*it).first));
59 for (auto it = in.begin(); it != end; ++it)
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| TriangularSolver.h | 43 for(LhsIterator it(lhsEval, i); it; ++it)
45 lastVal = it.value();
46 lastIndex = it.index();
79 LhsIterator it(lhsEval, i);
80 while(it && it.index()<i)
81 ++it;
84 eigen_assert(it && it.index()==i)
[all...] |
| /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>();
|
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/ |
| id_descriptor.h | 36 // registers it in id_to_descriptor_. Returns the computed descriptor.
43 const auto it = id_to_descriptor_.find(id); local
44 if (it == id_to_descriptor_.end())
46 return it->second;
|
| /external/v8/tools/clang/blink_gc_plugin/ |
| RecordInfo.cpp | 69 for (TemplateArgs::iterator it = args.begin(); it != args.end(); ++it) {
70 if (CXXRecordDecl* decl = (*it)->getAsCXXRecordDecl())
118 for (const auto& it : base_record->bases()) {
119 const RecordType* type = it.getType()->getAs<RecordType>();
122 base = GetDependentTemplatedDecl(*it.getType());
160 // If it is not a mixin base we are done.
200 Cache::iterator it = cache_.find(record);
201 if (it != cache_.end()
[all...] |
| /external/compiler-rt/test/asan/TestCases/Posix/ |
| mmap_limit_mb.cc | 30 for (std::vector<char *>::const_iterator it = v.begin(); it != v.end(); ++it)
31 delete[](*it);
|
| /external/curl/docs/cmdline-opts/ |
| show-error.d | 5 When used with --silent, it makes curl show an error message if it fails.
|
| /external/eigen/Eigen/src/MetisSupport/ |
| MetisSupport.h | 44 for (typename MatrixType::InnerIterator it(A, j); it; ++it)
46 Index idx = it.index(); // Get the row index (for column major) or column index (for row major)
54 for (typename MatrixType::InnerIterator it(At, j); it; ++it)
56 Index idx = it.index();
77 for (typename MatrixType::InnerIterator it(A,j); it; ++it
[all...] |
| /external/icu/icu4j/perf-tests/src/com/ibm/icu/dev/test/perf/ |
| UnicodeSetPerf.java | 24 UnicodeSetIterator it; field in class:UnicodeSetPerf
40 it = new UnicodeSetIterator(testChars);
49 it.reset();
51 while (it.nextRange()) {
52 for (int cp = it.codepoint; cp <= it.codepointEnd; ++cp) {
69 it.reset();
71 while (it.nextRange()) {
72 for (int cp = it.codepoint; cp <= it.codepointEnd; ++cp)
[all...] |
