HomeSort by relevance Sort by last modified time
    Searched refs:assert (Results 476 - 500 of 13786) sorted by null

<<11121314151617181920>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/
erase_iter.pass.cpp 39 assert(m.size() == 8);
41 assert(m.size() == 7);
42 assert(i == next(m.begin(), 3));
43 assert(m.begin()->first == 1);
44 assert(m.begin()->second == 1.5);
45 assert(next(m.begin())->first == 2);
46 assert(next(m.begin())->second == 2.5);
47 assert(next(m.begin(), 2)->first == 3);
48 assert(next(m.begin(), 2)->second == 3.5);
49 assert(next(m.begin(), 3)->first == 5)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.mutex/thread.lock.algorithm/
try_lock.pass.cpp 77 assert(std::try_lock(l0, l1) == -1);
78 assert(l0.locked());
79 assert(l1.locked());
84 assert(std::try_lock(l0, l1) == 1);
85 assert(!l0.locked());
86 assert(!l1.locked());
91 assert(std::try_lock(l0, l1) == 0);
92 assert(!l0.locked());
93 assert(!l1.locked());
101 assert(false)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/default.allocator/allocator.members/
construct.pass.cpp 25 assert(s == 3 * sizeof(int));
81 assert(new_called == 0);
82 assert(A_constructed == 0);
85 assert(new_called == 1);
86 assert(A_constructed == 0);
89 assert(new_called == 1);
90 assert(A_constructed == 1);
93 assert(new_called == 1);
94 assert(A_constructed == 0);
97 assert(new_called == 1)
    [all...]
  /external/libcxx/test/std/containers/associative/map/map.access/
index_key.pass.cpp 37 assert(m.size() == 7);
38 assert(m[1] == 1.5);
39 assert(m.size() == 7);
41 assert(m[1] == -1.5);
42 assert(m.size() == 7);
43 assert(m[6] == 0);
44 assert(m.size() == 8);
46 assert(m[6] == 6.5);
47 assert(m.size() == 8);
63 assert(m.size() == 7)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.access/
index_key.pass.cpp 37 assert(m.size() == 7);
38 assert(m[1] == 1.5);
39 assert(m.size() == 7);
41 assert(m[1] == -1.5);
42 assert(m.size() == 7);
43 assert(m[6] == 0);
44 assert(m.size() == 8);
46 assert(m[6] == 6.5);
47 assert(m.size() == 8);
63 assert(m.size() == 7)
    [all...]
  /external/libcxx/test/std/containers/associative/multiset/multiset.cons/
copy.pass.cpp 42 assert(m.get_allocator() == A(7));
43 assert(m.key_comp() == C(5));
44 assert(m.size() == 9);
45 assert(distance(m.begin(), m.end()) == 9);
46 assert(*next(m.begin(), 0) == 1);
47 assert(*next(m.begin(), 1) == 1);
48 assert(*next(m.begin(), 2) == 1);
49 assert(*next(m.begin(), 3) == 2);
50 assert(*next(m.begin(), 4) == 2);
51 assert(*next(m.begin(), 5) == 2)
    [all...]
initializer_list_compare.pass.cpp 27 assert(m.size() == 6);
28 assert(distance(m.begin(), m.end()) == 6);
30 assert(*i == V(1));
31 assert(*++i == V(2));
32 assert(*++i == V(3));
33 assert(*++i == V(4));
34 assert(*++i == V(5));
35 assert(*++i == V(6));
36 assert(m.key_comp() == Cmp(10));
  /external/libcxx/test/std/depr/depr.str.strstreams/depr.strstreambuf/depr.strstreambuf.virtuals/
underflow.pass.cpp 36 assert(sb.underflow() == '1');
37 assert(sb.underflow() == '1');
38 assert(sb.snextc() == '2');
39 assert(sb.underflow() == '2');
40 assert(sb.underflow() == '2');
41 assert(sb.snextc() == '3');
42 assert(sb.underflow() == '3');
43 assert(sb.underflow() == '3');
44 assert(sb.snextc() == EOF);
45 assert(sb.underflow() == EOF)
    [all...]
  /external/libcxx/test/std/re/re.alg/re.alg.match/
grep.pass.cpp 29 assert(std::regex_match(s, m, std::regex("tour\nto\ntournament",
31 assert(m.size() == 1);
32 assert(!m.prefix().matched);
33 assert(m.prefix().first == s);
34 assert(m.prefix().second == m[0].first);
35 assert(!m.suffix().matched);
36 assert(m.suffix().first == m[0].second);
37 assert(m.suffix().second == s + std::char_traits<char>::length(s));
38 assert(m.length(0) == 10);
39 assert(m.position(0) == 0)
    [all...]
  /external/libcxx/test/std/re/re.iter/re.regiter/re.regiter.cnstr/
cnstr.pass.cpp 27 assert(i != std::cregex_iterator());
28 assert(i->size() == 1);
29 assert(i->position() == 0);
30 assert(i->str() == "555-1234");
32 assert(i != std::cregex_iterator());
33 assert(i->size() == 1);
34 assert(i->position() == 10);
35 assert(i->str() == "555-2345");
37 assert(i != std::cregex_iterator());
38 assert(i->size() == 1)
    [all...]
  /external/libcxx/test/std/re/re.iter/re.regiter/re.regiter.deref/
deref.pass.cpp 25 assert(i != std::cregex_iterator());
26 assert((*i).size() == 1);
27 assert((*i).position() == 0);
28 assert((*i).str() == "555-1234");
30 assert(i != std::cregex_iterator());
31 assert((*i).size() == 1);
32 assert((*i).position() == 10);
33 assert((*i).str() == "555-2345");
35 assert(i != std::cregex_iterator());
36 assert((*i).size() == 1)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/
copy.pass.cpp 42 assert(m.get_allocator() == A(7));
43 assert(m.key_comp() == C(5));
44 assert(m.size() == 9);
45 assert(distance(m.begin(), m.end()) == 9);
46 assert(*next(m.begin(), 0) == 1);
47 assert(*next(m.begin(), 1) == 1);
48 assert(*next(m.begin(), 2) == 1);
49 assert(*next(m.begin(), 3) == 2);
50 assert(*next(m.begin(), 4) == 2);
51 assert(*next(m.begin(), 5) == 2)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/depr/depr.str.strstreams/depr.strstreambuf/depr.strstreambuf.virtuals/
underflow.pass.cpp 36 assert(sb.underflow() == '1');
37 assert(sb.underflow() == '1');
38 assert(sb.snextc() == '2');
39 assert(sb.underflow() == '2');
40 assert(sb.underflow() == '2');
41 assert(sb.snextc() == '3');
42 assert(sb.underflow() == '3');
43 assert(sb.underflow() == '3');
44 assert(sb.snextc() == EOF);
45 assert(sb.underflow() == EOF)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.match/
grep.pass.cpp 29 assert(std::regex_match(s, m, std::regex("tour\nto\ntournament",
31 assert(m.size() == 1);
32 assert(!m.prefix().matched);
33 assert(m.prefix().first == s);
34 assert(m.prefix().second == m[0].first);
35 assert(!m.suffix().matched);
36 assert(m.suffix().first == m[0].second);
37 assert(m.suffix().second == s + std::char_traits<char>::length(s));
38 assert(m.length(0) == 10);
39 assert(m.position(0) == 0)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.iter/re.regiter/re.regiter.cnstr/
cnstr.pass.cpp 27 assert(i != std::cregex_iterator());
28 assert(i->size() == 1);
29 assert(i->position() == 0);
30 assert(i->str() == "555-1234");
32 assert(i != std::cregex_iterator());
33 assert(i->size() == 1);
34 assert(i->position() == 10);
35 assert(i->str() == "555-2345");
37 assert(i != std::cregex_iterator());
38 assert(i->size() == 1)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.iter/re.regiter/re.regiter.deref/
deref.pass.cpp 25 assert(i != std::cregex_iterator());
26 assert((*i).size() == 1);
27 assert((*i).position() == 0);
28 assert((*i).str() == "555-1234");
30 assert(i != std::cregex_iterator());
31 assert((*i).size() == 1);
32 assert((*i).position() == 10);
33 assert((*i).str() == "555-2345");
35 assert(i != std::cregex_iterator());
36 assert((*i).size() == 1)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/futures/futures.promise/
alloc_ctor.pass.cpp 24 assert(test_alloc_base::count == 0);
27 assert(test_alloc_base::count == 1);
29 assert(test_alloc_base::count == 1);
30 assert(f.valid());
32 assert(test_alloc_base::count == 0);
35 assert(test_alloc_base::count == 1);
37 assert(test_alloc_base::count == 1);
38 assert(f.valid());
40 assert(test_alloc_base::count == 0);
43 assert(test_alloc_base::count == 1)
    [all...]
  /external/libcxx/test/std/containers/associative/set/set.cons/
initializer_list_compare.pass.cpp 27 assert(m.size() == 6);
28 assert(distance(m.begin(), m.end()) == 6);
30 assert(*i == V(1));
31 assert(*++i == V(2));
32 assert(*++i == V(3));
33 assert(*++i == V(4));
34 assert(*++i == V(5));
35 assert(*++i == V(6));
36 assert(m.key_comp() == Cmp(10));
  /external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/
push_rv.pass.cpp 24 assert(q.size() == 1);
25 assert(q.front() == MoveOnly(1));
26 assert(q.back() == MoveOnly(1));
28 assert(q.size() == 2);
29 assert(q.front() == MoveOnly(1));
30 assert(q.back() == MoveOnly(2));
32 assert(q.size() == 3);
33 assert(q.front() == MoveOnly(1));
34 assert(q.back() == MoveOnly(3));
  /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/
resize_size_value.pass.cpp 29 assert(distance(c.begin(), c.end()) == 3);
30 assert(*next(c.begin(), 0) == 0);
31 assert(*next(c.begin(), 1) == 1);
32 assert(*next(c.begin(), 2) == 2);
35 assert(distance(c.begin(), c.end()) == 6);
36 assert(*next(c.begin(), 0) == 0);
37 assert(*next(c.begin(), 1) == 1);
38 assert(*next(c.begin(), 2) == 2);
39 assert(*next(c.begin(), 3) == 10);
40 assert(*next(c.begin(), 4) == 10)
    [all...]
  /external/libcxx/test/std/depr/depr.str.strstreams/depr.istrstream/depr.istrstream.cons/
ccp.pass.cpp 26 assert(i == 123);
29 assert(d == 4.5);
32 assert(s == "dog");
33 assert(in.eof());
34 assert(!in.fail());
37 assert(!in.fail());
39 assert(in.fail());
40 assert(buf[9] == 'o');
41 assert(buf[10] == 'g');
ccp_size.pass.cpp 26 assert(i == 123);
29 assert(d == 4.5);
32 assert(s == "");
33 assert(in.eof());
34 assert(in.fail());
37 assert(!in.fail());
39 assert(in.fail());
40 assert(buf[5] == '.');
41 assert(buf[6] == '5');
cp.pass.cpp 26 assert(i == 123);
29 assert(d == 4.5);
32 assert(s == "dog");
33 assert(in.eof());
34 assert(!in.fail());
37 assert(!in.fail());
39 assert(!in.fail());
40 assert(buf[9] == 'g');
41 assert(buf[10] == 'g');
cp_size.pass.cpp 26 assert(i == 123);
29 assert(d == 4.5);
32 assert(s == "");
33 assert(in.eof());
34 assert(in.fail());
37 assert(!in.fail());
39 assert(!in.fail());
40 assert(buf[5] == '5');
41 assert(buf[6] == '5');
  /external/libcxx/test/std/input.output/iostream.format/input.streams/istream.unformatted/
get.pass.cpp 47 assert(!is.eof());
48 assert(!is.fail());
49 assert(c == ' ');
50 assert(is.gcount() == 1);
56 assert(!is.eof());
57 assert(!is.fail());
58 assert(c == ' ');
59 assert(is.gcount() == 1);
61 assert(!is.eof());
62 assert(!is.fail())
    [all...]

Completed in 1148 milliseconds

<<11121314151617181920>>