| /external/tensorflow/tensorflow/compiler/xla/service/cpu/ |
| target_machine_features.cc | 23 auto it = target_transform_info_cache_.find(&function); local
24 if (it == target_transform_info_cache_.end()) {
28 it = emplace_result.first;
31 return &it->second;
|
| /external/tensorflow/tensorflow/contrib/lite/toco/graph_transformations/ |
| remove_unused_op.cc | 29 const auto it = model->operators.begin() + op_index; local
30 const auto* op = it->get();
34 // treating the part of the graph leading up to it as unused.
79 AddMessageF("Not discarding %s because it has unresolved outputs.",
121 model->operators.erase(it);
|
| /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;
|
| /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/r16/sources/cxx-stl/llvm-libc++/test/libcxx/experimental/filesystem/class.path/path.itr/ |
| iterator_db.pass.cpp | 47 auto it = p.begin(); local
49 --it;
52 ++it;
53 ++it;
55 ++it;
62 auto it = p.end(); local
64 ++it;
67 --it;
68 --it;
70 --it;
[all...] |
| /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());
|
| /art/runtime/interpreter/ |
| lock_count_data.cc | 53 auto it = std::find(monitors_->begin(), monitors_->end(), obj); local
54 if (it != monitors_->end()) {
55 monitors_->erase(it);
82 // There may be an exception pending, if the method is terminating abruptly. Clear it.
|
| /external/google-benchmark/src/ |
| counter.cc | 40 auto it = r.find(c.first); local
41 if (it != r.end()) {
42 c.second.value = c.second + it->second;
47 auto it = l->find(tc.first); local
48 if (it == l->end()) {
|
| /external/libchrome/base/metrics/ |
| sample_map_unittest.cc | 81 std::unique_ptr<SampleCountIterator> it = samples.Iterator(); local
87 it->Get(&min, &max, &count);
91 EXPECT_FALSE(it->GetBucketIndex(NULL));
93 it->Next();
94 it->Get(&min, &max, &count);
99 it->Next();
100 it->Get(&min, &max, &count);
105 it->Next();
106 EXPECT_TRUE(it->Done());
124 std::unique_ptr<SampleCountIterator> it = samples.Iterator() local
151 std::unique_ptr<SampleCountIterator> it = samples.Iterator(); local
[all...] |
| /external/libcxx/test/libcxx/containers/sequences/deque/ |
| incomplete.pass.cpp | 22 std::deque<A>::iterator it; member in struct:A
30 a.it = a.d.begin();
|
| /external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.overview/ |
| indexing.pass.cpp | 38 auto it = vals.begin (); local
39 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
41 assert ( *it == dyn[i]);
48 auto it = vals.begin (); local
49 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
51 assert ( *it == dyn[i]);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/ |
| generate_n.pass.cpp | 40 auto it = std::generate_n(std::begin(ib), N, gen_test()); local
42 return it == (std::begin(ib) + N)
43 && std::all_of(std::begin(ib), it, [](int x) { return x == 2; })
44 && *it == 0 // don't overwrite the last value in the output array
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| set_intersection_comp.pass.cpp | 36 auto it = std::set_intersection(std::begin(ia), std::end(ia), local
39 return std::includes(std::begin(ia), std::end(ia), std::begin(results), it)
40 && std::includes(std::begin(ib), std::end(ib), std::begin(results), it)
41 && std::is_sorted(std::begin(results), it, comp)
42 && std::all_of(it, std::end(results), [](int a) {return a == 0; })
|
| /external/libcxx/test/std/experimental/filesystem/class.directory_iterator/directory_iterator.members/ |
| copy_assign.pass.cpp | 73 const directory_iterator& it = it_obj; local
74 TEST_REQUIRE(it != endIt);
76 TEST_REQUIRE(it != endIt);
77 const path entry = *it;
80 TEST_REQUIRE(it2 != it);
84 it2 = it;
85 TEST_REQUIRE(it2 == it);
91 const directory_iterator it; local
93 directory_iterator& ref = (it2 = it);
|
| move_assign.pass.cpp | 28 // the directory iterators. Turn off this warning so we can test it.
77 directory_iterator it(testDir);
78 TEST_REQUIRE(it != endIt);
79 ++it;
80 TEST_REQUIRE(it != endIt);
81 const path entry = *it;
84 TEST_REQUIRE(it2 != it);
88 it2 = std::move(it);
95 directory_iterator it; local
97 directory_iterator& ref = (it2 = it);
[all...] |
| /external/libcxx/test/std/iterators/stream.iterators/istream.iterator/istream.iterator.cons/ |
| default.pass.cpp | 34 constexpr std::istream_iterator<T> it; local
35 (void)it;
50 T it; local
51 assert(it == T());
|
| /external/libcxx/utils/google-benchmark/src/ |
| counter.cc | 40 auto it = r.find(c.first); local
41 if (it != r.end()) {
42 c.second.value = c.second + it->second;
47 auto it = l->find(tc.first); local
48 if (it == l->end()) {
|
| /external/libvpx/libvpx/third_party/libyuv/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/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/parameter-framework/upstream/parameter/ |
| 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;
|
| /external/pdfium/core/fpdfapi/font/ |
| cpdf_fontglobals.cpp | 23 auto it = m_StockMap.find(pDoc); local
24 if (it == m_StockMap.end())
26 return it->second ? it->second->GetFont(index) : nullptr;
|
| /external/pdfium/fpdfsdk/ |
| cpdfsdk_annotiteration.cpp | 17 // Copying/sorting ObservedPtrs is expensive, so do it once at the end.
26 auto it = std::find(copiedList.begin(), copiedList.end(), pTopMostAnnot); local
27 if (it != copiedList.end()) {
28 copiedList.erase(it);
|
| /external/perfetto/src/tracing/core/ |
| patch_list_unittest.cc | 86 auto it = pl.begin(); local
87 for (uint16_t i = 0; it != pl.end(); it++, i++) {
88 EXPECT_EQ(ptrs[i], &it->size_field[0]);
|
