| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multiset/ |
| erase_iter.pass.cpp | 198 I it = c.find(a); local
199 if (it != c.end())
200 c.erase(it);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/set/ |
| erase_iter.pass.cpp | 198 I it = c.find(a); local
199 if (it != c.end())
200 c.erase(it);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.modifiers/ |
| insert_size_value.pass.cpp | 120 CI it = c.cbegin() + i; local
122 c.insert(it, 5, *jt);
125 it = c.cbegin();
126 for (int k = 0; k < i; ++k, ++it)
127 assert(*it == k);
128 for (int k = 0; k < 5; ++k, ++it)
129 assert(*it == j);
130 for (int k = i; k < 20; ++k, ++it)
131 assert(*it == k);
|
| insert_value.pass.cpp | 102 CI it = c.cbegin() + i; local
104 c.insert(it, *jt);
107 it = c.cbegin();
108 for (int k = 0; k < i; ++k, ++it)
109 assert(*it == k);
110 assert(*it == j);
111 ++it;
112 for (int k = i; k < 20; ++k, ++it)
113 assert(*it == k);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| remove.pass.cpp | 99 C::const_iterator it = c.begin(); local
100 for(int *ip = std::begin(t2); ip != std::end(t2); ++ip, ++it) {
101 assert ( it != c.end());
102 assert ( *ip == it->get());
104 assert ( it == c.end ());
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.ops/ |
| remove.pass.cpp | 58 std::list<S>::const_iterator it = c.begin(); local
59 for (int *ip = a2; ip < a2 + 5; ++ip, ++it) {
60 assert(it != c.end());
61 assert(*ip == it->get());
63 assert(it == c.end());
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/ |
| compare.pass.cpp | 42 Iter it = map.find(Key(0)); local
43 assert(it == map.end());
|
| incomplete_type.pass.cpp | 27 Map::iterator it; member in struct:A
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| erase_const_iter.pass.cpp | 88 I it = m.find(a); local
89 if (it != m.end())
90 m.erase(it);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/ |
| incomplete.pass.cpp | 27 Map::iterator it; member in struct:A
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/ |
| erase_const_iter.pass.cpp | 95 I it = m.find(a); local
96 if (it != m.end())
97 m.erase(it);
|
| incomplete.pass.cpp | 28 Map::iterator it; member in struct:A
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/ |
| erase_const_iter.pass.cpp | 93 I it = m.find(a); local
94 if (it != m.end())
95 m.erase(it);
|
| incomplete.pass.cpp | 28 Map::iterator it; member in struct:A
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/filesystem/class.rec.dir.itr/rec.dir.itr.members/ |
| copy_assign.pass.cpp | 33 // in a non-default state. The returned 'it' is in a
35 // it.options() == directory_options::skip_permission_denied
36 // it.depth() == 1
37 // it.recursion_pending() == true
41 recursive_directory_iterator it(testDir,
43 TEST_ASSERT(it != endIt);
44 while (it.depth() != 1) {
45 ++it;
46 TEST_ASSERT(it != endIt);
48 TEST_ASSERT(it.depth() == 1)
111 const recursive_directory_iterator it = createInterestingIterator(); local
131 const recursive_directory_iterator it; local
140 recursive_directory_iterator it = createInterestingIterator(); local
[all...] |
| move_assign.pass.cpp | 28 // the directory iterators. Turn off this warning so we can test it.
39 // in a non-default state. The returned 'it' is in a
41 // it.options() == directory_options::skip_permission_denied
42 // it.depth() == 1
43 // it.recursion_pending() == true
47 recursive_directory_iterator it(testDir,
49 TEST_ASSERT(it != endIt);
50 while (it.depth() != 1) {
51 ++it;
52 TEST_ASSERT(it != endIt)
121 recursive_directory_iterator it = createInterestingIterator(); local
144 recursive_directory_iterator it; local
153 recursive_directory_iterator it = createInterestingIterator(); local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/memory/specialized.algorithms/specialized.destroy/ |
| destroy_n.pass.cpp | 36 using It = forward_iterator<Counted*>;
46 It it = std::destroy_n(It(p), 4); local
47 assert(it == It(p+4));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/utils/google-benchmark/src/ |
| csv_reporter.cc | 139 auto it = run.counters.find(ucn); local
140 CHECK(it != run.counters.end());
141 Out << "," << it->second;
|
| /prebuilts/ndk/r16/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
|
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/glslang/glslang/MachineIndependent/ |
| RemoveTree.cpp | 113 TRemoveTraverser it; local
115 root->traverse(&it);
|
| /prebuilts/ndk/r16/sources/third_party/vulkan/src/layers/ |
| vk_layer_table.cpp | 33 device_table_map::const_iterator it = tableMap.find((void *)key); local
34 assert(it != tableMap.end() && "Not able to find device dispatch entry");
35 return it->second;
40 instance_table_map::const_iterator it = tableInstanceMap.find((void *)key); local
42 if (it != tableInstanceMap.end()) {
44 it->second);
49 assert(it != tableInstanceMap.end() && "Not able to find instance dispatch entry");
50 return it->second;
55 device_table_map::const_iterator it = map.find((void *)key); local
56 if (it != map.end())
68 instance_table_map::const_iterator it = map.find((void *)key); local
85 device_table_map::const_iterator it = map.find((void *)key); local
100 instance_table_map::const_iterator it = map.find((void *)key); local
141 instance_table_map::const_iterator it = map.find((void *)key); local
168 device_table_map::const_iterator it = map.find((void *)key); local
[all...] |
| /system/bt/packet/avrcp/ |
| avrcp_browse_packet.cc | 63 auto it = begin() + static_cast<size_t>(1); local
64 return base::ByteSwap(it.extract<uint16_t>());
78 for (auto it = begin() + static_cast<size_t>(3); it != end(); it++) {
79 ss << " " << loghex(*it);
|
| change_path.cc | 54 auto it = begin() + BrowsePacket::kMinSize(); local
55 return base::ByteSwap(it.extract<uint16_t>());
59 auto it = begin() + BrowsePacket::kMinSize() + static_cast<size_t>(2); local
60 return static_cast<Direction>(*it);
64 auto it = begin() + BrowsePacket::kMinSize() + static_cast<size_t>(3); local
65 return base::ByteSwap(it.extract<uint64_t>());
|
| get_total_number_of_items.cc | 58 auto it = begin() + BrowsePacket::kMinSize(); local
59 return static_cast<Scope>(*it);
|
| pass_through_packet.cc | 43 // Data length, for this packet it's always 0;
50 auto it = begin() + Packet::kMinSize(); local
51 return static_cast<KeyState>(((*it) & 0b10000000) >> 7);
|
