Home
last modified time | relevance | path

Searched refs:it (Results 1 – 25 of 246) sorted by relevance

12345678910

/ndk/tests/device/test-stlport/unit/
Duninitialized_test.cpp95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end()); in copy_test() local
96 for (; it != end; ++it) { in copy_test()
97 CPPUNIT_ASSERT( (*it).member == 1 ); in copy_test()
107 TrivialCopyStruct* it = src + 0; in copy_test() local
109 for (; it != end; ++it) { in copy_test()
110 (*it).member = 0; in copy_test()
114 for (it = dst+0, end = dst+count; it != end; ++it) { in copy_test()
118 CPPUNIT_ASSERT( (*it).member == 0 ); in copy_test()
120 CPPUNIT_ASSERT( (*it).member == 1 ); in copy_test()
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end()); in copy_test() local
[all …]
Dmvctor_test.cpp247 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test() local
249 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {} in deque_test()
267 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test() local
269 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {} in deque_test()
287 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test() local
289 for (; it != vect_deque.end() && nb_incr < 6; ++nb_incr, ++it) {} in deque_test()
307 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test() local
309 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {} in deque_test()
467 vector<vector<int> >::iterator it = vect_vector.end() - 5; in vector_test() local
469 for (; it != vect_vector.end() && nb_incr <= 6; ++nb_incr, ++it) {} in vector_test()
[all …]
Ddeque_test.cpp289 deque<int>::iterator it(dint.begin() + 1); in erase() local
290 CPPUNIT_ASSERT( *it == 1 ); in erase()
293 CPPUNIT_ASSERT( *it == 1 ); in erase()
295 it = dint.end() - 2; in erase()
296 CPPUNIT_ASSERT( *it == 5 ); in erase()
299 CPPUNIT_ASSERT( *it == 5 ); in erase()
304 it = dint.begin() + 2; in erase()
305 CPPUNIT_ASSERT( *it == 2 ); in erase()
308 CPPUNIT_ASSERT( *it == 2 ); in erase()
310 it = dint.end() - 3; in erase()
[all …]
Diter_test.cpp69 Vec::reverse_iterator it; in iter3() local
71 for (it = v.rbegin(); it != v.rend(); ++it, ++counter) { in iter3()
74 CPPUNIT_ASSERT(!strcmp(*it, "zippy")); in iter3()
77 CPPUNIT_ASSERT(!strcmp(*it, "motorboy")); in iter3()
Dequal_test.cpp106 vector<Test>::iterator it; in equal_range2() local
113 it = upper_bound(tv.begin(), tv.end(), 5); in equal_range2()
114 CPPUNIT_ASSERT( it != tv.end() ); in equal_range2()
115 CPPUNIT_ASSERT( *it == 6 ); in equal_range2()
117 it = lower_bound(tv.begin(), tv.end(), 5); in equal_range2()
118 CPPUNIT_ASSERT( it != tv.end() ); in equal_range2()
119 CPPUNIT_ASSERT( *it == 5 ); in equal_range2()
/ndk/tests/device/test-gnustl-full/unit/
Duninitialized_test.cpp95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end()); in copy_test() local
96 for (; it != end; ++it) { in copy_test()
97 CPPUNIT_ASSERT( (*it).member == 1 ); in copy_test()
107 TrivialCopyStruct* it = src + 0; in copy_test() local
109 for (; it != end; ++it) { in copy_test()
110 (*it).member = 0; in copy_test()
114 for (it = dst+0, end = dst+count; it != end; ++it) { in copy_test()
118 CPPUNIT_ASSERT( (*it).member == 0 ); in copy_test()
120 CPPUNIT_ASSERT( (*it).member == 1 ); in copy_test()
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end()); in copy_test() local
[all …]
Dmvctor_test.cpp247 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test() local
249 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {} in deque_test()
267 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test() local
269 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {} in deque_test()
287 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test() local
289 for (; it != vect_deque.end() && nb_incr < 6; ++nb_incr, ++it) {} in deque_test()
307 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test() local
309 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {} in deque_test()
467 vector<vector<int> >::iterator it = vect_vector.end() - 5; in vector_test() local
469 for (; it != vect_vector.end() && nb_incr <= 6; ++nb_incr, ++it) {} in vector_test()
[all …]
Ddeque_test.cpp289 deque<int>::iterator it(dint.begin() + 1); in erase() local
290 CPPUNIT_ASSERT( *it == 1 ); in erase()
293 CPPUNIT_ASSERT( *it == 1 ); in erase()
295 it = dint.end() - 2; in erase()
296 CPPUNIT_ASSERT( *it == 5 ); in erase()
299 CPPUNIT_ASSERT( *it == 5 ); in erase()
304 it = dint.begin() + 2; in erase()
305 CPPUNIT_ASSERT( *it == 2 ); in erase()
308 CPPUNIT_ASSERT( *it == 2 ); in erase()
310 it = dint.end() - 3; in erase()
[all …]
Diter_test.cpp69 Vec::reverse_iterator it; in iter3() local
71 for (it = v.rbegin(); it != v.rend(); ++it, ++counter) { in iter3()
74 CPPUNIT_ASSERT(!strcmp(*it, "zippy")); in iter3()
77 CPPUNIT_ASSERT(!strcmp(*it, "motorboy")); in iter3()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.search/
Dbackup.pass.cpp31 std::sregex_iterator it{s.begin(), s.end(), re}; in main() local
34 assert(it->position(0) == 0); in main()
35 assert(it->length(0) == 1); in main()
37 ++it; in main()
38 assert(it->position(0) == 5); in main()
39 assert(it->length(0) == 1); in main()
41 ++it; in main()
42 assert(it == end); in main()
50 std::regex_iterator<std::list<char>::iterator> it{l.begin(), l.end(), re}; in main() local
53 assert(it->position(0) == 0); in main()
[all …]
Dno_update_pos.pass.cpp29 std::cregex_iterator it{text, text+6, re}; in main() local
32 assert(it->str() == "a"); in main()
33 assert(it->position(0) == 0); in main()
34 assert(it->length(0) == 1); in main()
36 ++it; in main()
37 assert(it == end); in main()
/ndk/sources/third_party/googletest/googletest/src/
Dgtest-typed-test.cc71 for (DefinedTestIter it = defined_test_names_.begin(); in VerifyRegisteredTestNames() local
72 it != defined_test_names_.end(); in VerifyRegisteredTestNames()
73 ++it) { in VerifyRegisteredTestNames()
74 if (name == *it) { in VerifyRegisteredTestNames()
88 for (DefinedTestIter it = defined_test_names_.begin(); in VerifyRegisteredTestNames() local
89 it != defined_test_names_.end(); in VerifyRegisteredTestNames()
90 ++it) { in VerifyRegisteredTestNames()
91 if (tests.count(*it) == 0) { in VerifyRegisteredTestNames()
92 errors << "You forgot to list test " << *it << ".\n"; in VerifyRegisteredTestNames()
/ndk/sources/third_party/googletest/googletest/test/
Dgtest-param-test_test.cc132 typename ParamGenerator<T>::iterator it = generator.begin(); in VerifyGenerator() local
134 ASSERT_FALSE(it == generator.end()) in VerifyGenerator()
139 EXPECT_TRUE(expected_values[i] == *it) in VerifyGenerator()
142 << ", *it is " << PrintValue(*it) in VerifyGenerator()
144 it++; in VerifyGenerator()
146 EXPECT_TRUE(it == generator.end()) in VerifyGenerator()
154 it = generator.begin(); in VerifyGenerator()
156 ASSERT_FALSE(it == generator.end()) in VerifyGenerator()
159 EXPECT_TRUE(expected_values[i] == *it) in VerifyGenerator()
162 << ", *it is " << PrintValue(*it) in VerifyGenerator()
[all …]
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/basic_cstring/
Dbasic_cstring.hpp92 self_type& trim_right( iterator it );
93 self_type& trim_left( iterator it );
289 basic_cstring<CharT>::trim_left( iterator it ) in trim_left() argument
291 m_begin = it; in trim_left()
307 iterator it; in trim_left() local
308 for( it = begin(); it != end(); ++it ) { in trim_left()
309 …if( traits_type::find( exclusions.begin(), exclusions.size(), *it ) == reinterpret_cast<pointer>(0… in trim_left()
313 return trim_left( it ); in trim_left()
333 basic_cstring<CharT>::trim_right( iterator it ) in trim_right() argument
335 m_end = it; in trim_right()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/dynarray/dynarray.overview/
Dindexing.pass.cpp31 auto it = vals.begin (); in dyn_test_const() local
32 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) { in dyn_test_const()
34 assert ( *it == dyn[i]); in dyn_test_const()
41 auto it = vals.begin (); in dyn_test() local
42 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) { in dyn_test()
44 assert ( *it == dyn[i]); in dyn_test()
Dat.pass.cpp46 auto it = vals.begin (); in dyn_test_const() local
47 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) { in dyn_test_const()
49 assert ( *it == dyn.at(i)); in dyn_test_const()
60 auto it = vals.begin (); in dyn_test() local
61 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) { in dyn_test()
63 assert ( *it == dyn.at(i)); in dyn_test()
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/impl/
Dexception_safety.ipp366 registry::iterator it = m_memory_in_use.find( p );
367 if( it != m_memory_in_use.end() ) {
368 m_execution_path[it->second].m_alloc.ptr = 0;
369 m_memory_in_use.erase( it );
414 format_execution_path( wrap_stringstream& formatter, ExecPathIt it, ExecPathIt end, unsigned indent…
416 while( it != end ) {
417 switch( it->m_type ) {
419 format_location( formatter, *it, indent );
420 formatter << "> \"" << it->m_scope.name << "\"\n";
421 format_execution_path( formatter, it+1, it + it->m_scope.size, indent + 2 );
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/
Dinsert_value.pass.cpp103 CI it = c.cbegin() + i; in self_reference_test() local
105 c.insert(it, *jt); in self_reference_test()
108 it = c.cbegin(); in self_reference_test()
109 for (int k = 0; k < i; ++k, ++it) in self_reference_test()
110 assert(*it == k); in self_reference_test()
111 assert(*it == j); in self_reference_test()
112 ++it; in self_reference_test()
113 for (int k = i; k < 20; ++k, ++it) in self_reference_test()
114 assert(*it == k); in self_reference_test()
Dinsert_size_value.pass.cpp119 CI it = c.cbegin() + i; in self_reference_test() local
121 c.insert(it, 5, *jt); in self_reference_test()
124 it = c.cbegin(); in self_reference_test()
125 for (int k = 0; k < i; ++k, ++it) in self_reference_test()
126 assert(*it == k); in self_reference_test()
127 for (int k = 0; k < 5; ++k, ++it) in self_reference_test()
128 assert(*it == j); in self_reference_test()
129 for (int k = i; k < 20; ++k, ++it) in self_reference_test()
130 assert(*it == k); in self_reference_test()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.cons/
Diter_alloc.pass.cpp36 for (It it = first; it != last; ++it, ++i) in test() local
37 assert(s2[i] == *it); in test()
53 for (It it = first; it != last; ++it, ++i) in test() local
54 assert(s2[i] == *it); in test()
/ndk/sources/host-tools/make-3.81/
Dconfigure.bat6 rem GNU Make is free software; you can redistribute it and/or modify it under
11 rem GNU Make is distributed in the hope that it will be useful, but WITHOUT
40 rem REDIR will return 1 if it cannot run Make.
41 rem If it can run Make, it will usually return 2,
59 echo Your environment is too small. Please enlarge it and run me again.
/ndk/sources/host-tools/make-3.81/tests/scripts/options/
Ddash-l10 of a temporary file; if it exists an error is generated. If it
11 doesn't exist then it is created, the rule sleeps, then deletes
14 it is given the -l option with a value of 0.0001. This ensures
16 decide that it cannot run more than one job even though -j 4 was
Dsymlinks9 # Apparently the Windows port of Perl reports that it does support symlinks
10 # (in that the symlink() function doesn't fail) but it really doesn't, so
11 # check for it explicitly.
27 # With -L, it should update targ
42 # Add in a new link between sym and dep. Be sure it's newer than targ.
48 # With -L, it should update targ
Ddash-W13 # Run it again: nothing should happen
17 # Now run it with -W b.x: should rebuild a.x
21 # Put the timestamp for a.x into the future; it should still be remade.
34 # First set it up with a normal build
53 # Tweak foo.x's timestamp so the update will change it.
60 # Test -W on vpath-found files: it should take effect.
/ndk/sources/host-tools/make-3.81/config/
Dsize_max.m417 AC_EGREP_CPP([Found it], [
23 Found it
27 dnl Define it ourselves. Here we assume that the type 'size_t' is not wider
29 dnl The _AC_COMPUTE_INT macro works up to LONG_MAX, since it uses 'expr',
38 dnl Even though SIZE_MAX fits in an unsigned int, it must be of type
59 [Define as the maximum value of type 'size_t', if the system doesn't define it.])

12345678910