| /external/libchrome/base/ |
| scoped_observer.h | 18 // attached itself to as an observer. When ScopedObserver is destroyed it
19 // removes the object as an observer from all sources it has been added to.
37 auto it = std::find(sources_.begin(), sources_.end(), source); local
38 DCHECK(it != sources_.end());
39 sources_.erase(it);
|
| /external/libchrome/testing/ |
| multiprocess_func_list.cc | 45 MultiProcessTestMap::iterator it = func_lookup_table.find(test_name); local
46 if (it != func_lookup_table.end()) {
47 const ProcessFunctions& process_functions = it->second;
|
| /external/libcxx/test/libcxx/debug/containers/ |
| db_string.pass.cpp | 63 iterator it = --C.end(); local
67 CHECK_DEBUG_THROWS( C.erase(it) );
|
| /external/libcxx/test/libcxx/thread/thread.threads/thread.thread.this/ |
| sleep_for.pass.cpp | 49 struct itimerval it; local
50 std::memset(&it, 0, sizeof(itimerval));
51 it.it_value.tv_sec = 0;
52 it.it_value.tv_usec = 250000;
55 ec = setitimer(ITIMER_REAL, &it, nullptr);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| remove_if.pass.cpp | 33 auto it = std::remove_if(std::begin(ia), std::end(ia), equal2); local
35 return (std::begin(ia) + std::size(ia) - 1) == it // we removed one element
36 && std::none_of(std::begin(ia), it, equal2)
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.foreach/ |
| for_each_n.pass.cpp | 30 auto it = std::for_each_n(std::begin(ia), N, [](int &a) { a += 2; }); local
31 return it == (std::begin(ia) + N)
52 Iter it = std::for_each_n(Iter(ia), 0, std::ref(f)); local
53 assert(it == Iter(ia));
59 Iter it = std::for_each_n(Iter(ia), s, std::ref(f)); local
61 assert(it == Iter(ia+s));
69 Iter it = std::for_each_n(Iter(ia), 1, std::ref(f)); local
71 assert(it == Iter(ia+1));
|
| /external/libcxx/test/std/containers/associative/map/ |
| compare.pass.cpp | 38 Iter it = m_empty.find(Key(0)); local
39 assert(it == m_empty.end());
40 it = m_contains.find(Key(0));
41 assert(it != m_contains.end());
|
| /external/libcxx/test/std/containers/associative/map/map.modifiers/ |
| erase_iter.pass.cpp | 254 I it = c.find(a); local
255 if (it != c.end())
256 c.erase(it);
|
| insert_or_assign.pass.cpp | 142 M::const_iterator it = m.find(2); local
145 r = m.insert_or_assign(it, 2, std::move(mv1));
152 r = m.insert_or_assign(it, 3, std::move(mv2));
165 M::const_iterator it = std::next(m.cbegin()); local
169 r = m.insert_or_assign(it, std::move(mvkey1), std::move(mv1));
178 r = m.insert_or_assign(it, std::move(mvkey2), std::move(mv2));
|
| try.emplace.pass.cpp | 138 M::const_iterator it = m.find(2); local
143 r = m.try_emplace(it, i, std::move(mv1));
150 r = m.try_emplace(it, 3, std::move(mv1));
164 M::const_iterator it = std::next(m.cbegin()); local
168 r = m.try_emplace(it, std::move(mvkey1), std::move(mv1));
175 r = m.try_emplace(it, std::move(mvkey2), std::move(mv1));
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| erase_iter.pass.cpp | 296 I it = c.find(a); local
297 if (it != c.end())
298 c.erase(it);
|
| /external/libcxx/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);
|
| /external/libcxx/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);
|
| /external/libcxx/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);
|
| /external/libcxx/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 ());
|
| /external/libcxx/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());
|
| /external/libcxx/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
|
| /external/libcxx/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);
|
| /external/libcxx/test/std/containers/unord/unord.multimap/ |
| incomplete.pass.cpp | 27 Map::iterator it; member in struct:A
|
| /external/libcxx/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
|
| /external/libcxx/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
|
