/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | 20030807-6.c | 6 foo (distance, i, j) 7 int distance[13][13]; 10 if (distance[i][j] < 0) 11 distance[i][0] = ((distance[i][j]) < 0 ? -(distance[i][j]) : (distance[i][j])); 15 foo2 (distance, i, j) 16 int distance[13][13]; 19 if (distance[ [all...] |
H A D | 20040514-2.c | 4 foo2 (distance, i, j) 5 int distance; 8 int t = distance;
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | p9732a.C | 22 int distance(); 28 int euler::distance() { function in class:euler 36 return e.distance();
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/ |
H A D | info_fn_imps.hpp | 45 { return std::distance(begin(), end()); }
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/deque/capacity/ |
H A D | resize_size.cc | 31 VERIFY( std::distance(d.begin(), d.end()) == 0 ); 34 VERIFY( std::distance(d.begin(), d.end()) == 1000 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/vector/capacity/resize/ |
H A D | resize_size.cc | 31 VERIFY( std::distance(v.begin(), v.end()) == 0 ); 34 VERIFY( std::distance(v.begin(), v.end()) == 1000 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/forward_list/capacity/ |
H A D | resize_size.cc | 31 VERIFY( std::distance(fl.begin(), fl.end()) == 0 ); 34 VERIFY( std::distance(fl.begin(), fl.end()) == 1000 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/list/capacity/ |
H A D | resize_size.cc | 31 VERIFY( std::distance(l.begin(), l.end()) == 0 ); 34 VERIFY( std::distance(l.begin(), l.end()) == 1000 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/experimental/filesystem/path/concat/ |
H A D | path.cc | 37 VERIFY( std::distance(pp.begin(), pp.end()) == 5 ); 44 VERIFY( std::distance(qq.begin(), qq.end()) == 3 ); 48 VERIFY( std::distance(q.begin(), q.end()) == 4 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multimap/insert/ |
H A D | 53115.cc | 43 VERIFY( distance(umm.begin(), umm.end()) - umm.size() == 0 ); 48 VERIFY( distance(umm.begin(), umm.end()) - umm.size() == 0 ); 53 VERIFY( distance(umm.begin(), umm.end()) - umm.size() == 0 ); 58 VERIFY( distance(umm.begin(), umm.end()) - umm.size() == 0 ); 63 VERIFY( distance(umm.begin(), umm.end()) - umm.size() == 0 ); 68 VERIFY( distance(umm.begin(), umm.end()) - umm.size() == 0 ); 73 VERIFY( distance(umm.begin(), umm.end()) - umm.size() == 0 ); 78 VERIFY( distance(umm.begin(), umm.end()) - umm.size() == 0 ); 83 VERIFY( distance(umm.begin(), umm.end()) - umm.size() == 0 ); 88 VERIFY( distance(um [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multiset/insert/ |
H A D | 53115.cc | 43 VERIFY( distance(mms.begin(), mms.end()) - mms.size() == 0 ); 48 VERIFY( distance(mms.begin(), mms.end()) - mms.size() == 0 ); 53 VERIFY( distance(mms.begin(), mms.end()) - mms.size() == 0 ); 58 VERIFY( distance(mms.begin(), mms.end()) - mms.size() == 0 ); 63 VERIFY( distance(mms.begin(), mms.end()) - mms.size() == 0 ); 68 VERIFY( distance(mms.begin(), mms.end()) - mms.size() == 0 ); 73 VERIFY( distance(mms.begin(), mms.end()) - mms.size() == 0 ); 78 VERIFY( distance(mms.begin(), mms.end()) - mms.size() == 0 ); 83 VERIFY( distance(mms.begin(), mms.end()) - mms.size() == 0 ); 88 VERIFY( distance(mm [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | pr42246-2.f | 5 subroutine distance(x,clo) subroutine
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/forward_list/cons/ |
H A D | cons_size.cc | 31 VERIFY( std::distance(fl.begin(), fl.end()) == 1000 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/vector/cons/ |
H A D | cons_size.cc | 31 VERIFY( std::distance(v.begin(), v.end()) == 1000 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/deque/cons/ |
H A D | cons_size.cc | 31 VERIFY( std::distance(d.begin(), d.end()) == 1000 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/list/cons/ |
H A D | cons_size.cc | 31 VERIFY( std::distance(l.begin(), l.end()) == 1000 );
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
H A D | pr60659.C | 4 void distance (_InputIterator, _InputIterator p2) function 20 template <class T> typename D<T>::type distance (const T &p1) function in namespace:boost 22 distance (boost::begin (p1), boost::end (p1)); 57 int b = boost::distance (AllTransVideos ());
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.benjamin/ |
H A D | typedef01.C | 9 MILES distance; variable
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/util/statistic/ |
H A D | sample_mean.hpp | 58 const size_t num = std::distance(b, e);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_map/erase/ |
H A D | 1.cc | 61 VERIFY( distance(m1.begin(), m1.end()) - m1.size() == 0 ); 66 VERIFY( distance(m1.begin(), m1.end()) - m1.size() == 0 ); 73 VERIFY( distance(m1.begin(), m1.end()) - m1.size() == 0 ); 83 VERIFY( distance(m1.begin(), m1.end()) - m1.size() == 0 ); 90 VERIFY( distance(m1.begin(), m1.end()) - m1.size() == 0 ); 98 VERIFY( distance(m1.begin(), m1.end()) - m1.size() == 0 ); 115 VERIFY( distance(m1.begin(), m1.end()) - m1.size() == 0 ); 122 VERIFY( distance(m1.begin(), m1.end()) - m1.size() == 0 ); 135 VERIFY( distance(m1.begin(), m1.end()) - m1.size() == 0 ); 144 VERIFY( distance(m [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/forward_list/operations/ |
H A D | remove_freed.cc | 42 VERIFY( std::distance(fl1.begin(), fl1.end()) == 3 ); 66 VERIFY( std::distance(fl2.begin(), fl2.end()) == 0 ); 82 VERIFY( std::distance(fl3.begin(), fl3.end()) == 2 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multimap/erase/ |
H A D | 1.cc | 62 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 67 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 74 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 84 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 91 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 99 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 116 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 123 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 136 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 145 VERIFY( distance(mm [all...] |
H A D | 2.cc | 61 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 66 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 73 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 78 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 ); 83 VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multiset/erase/ |
H A D | 1.cc | 61 VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 ); 66 VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 ); 73 VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 ); 83 VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 ); 90 VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 ); 98 VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 ); 115 VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 ); 122 VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 ); 135 VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 ); 144 VERIFY( distance(ms [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_set/erase/ |
H A D | 1.cc | 60 VERIFY( distance(s1.begin(), s1.end()) - s1.size() == 0 ); 65 VERIFY( distance(s1.begin(), s1.end()) - s1.size() == 0 ); 72 VERIFY( distance(s1.begin(), s1.end()) - s1.size() == 0 ); 82 VERIFY( distance(s1.begin(), s1.end()) - s1.size() == 0 ); 89 VERIFY( distance(s1.begin(), s1.end()) - s1.size() == 0 ); 97 VERIFY( distance(s1.begin(), s1.end()) - s1.size() == 0 ); 114 VERIFY( distance(s1.begin(), s1.end()) - s1.size() == 0 ); 121 VERIFY( distance(s1.begin(), s1.end()) - s1.size() == 0 ); 134 VERIFY( distance(s1.begin(), s1.end()) - s1.size() == 0 ); 143 VERIFY( distance(s [all...] |