Branch Coverage

/usr/include/c++/5/bits/stl_algo.h
Criterion Covered Total %
branch 6 528 1.1


line true false branch
81 0 0 if (__comp(__a, __b))
0 0 if (__comp(__a, __b))
83 0 0 if (__comp(__b, __c))
0 0 if (__comp(__b, __c))
85 0 0 else if (__comp(__a, __c))
0 0 else if (__comp(__a, __c))
90 0 0 else if (__comp(__a, __c))
0 0 else if (__comp(__a, __c))
92 0 0 else if (__comp(__b, __c))
0 0 else if (__comp(__b, __c))
945 0 0 if (__first == __last)
0 0 if (__first == __last)
0 0 if (__first == __last)
0 0 if (__first == __last)
948 0 0 while (++__next != __last)
0 0 while (++__next != __last)
0 0 while (++__next != __last)
0 0 while (++__next != __last)
950 0 0 if (__binary_pred(__first, __next))
964 0 0 if (__first == __last)
0 0 if (__first == __last)
970 0 0 while (++__first != __last)
0 0 while (++__first != __last)
0 0 while (++__first != __last)
0 0 while (++__first != __last)
1152 0 0 if (__first == __last)
0 0 if (__first == __last)
0 0 if (__first == __last)
0 0 if (__first == __last)
1155 0 0 while (__first < __last)
0 0 while (__first < __last)
15 7 while (__first < __last)
0 0 while (__first < __last)
0 0 while (__first < __last)
0 0 while (__first < __last)
1334 0 0 if (__first == __middle)
0 0 if (__first == __middle)
0 0 if (__first == __middle)
1336 0 0 else if (__last == __middle)
0 0 else if (__last == __middle)
0 0 else if (__last == __middle)
1347 0 0 if (__k == __n - __k)
0 0 if (__k == __n - __k)
0 0 if (__k == __n - __k)
1358 0 0 if (__k < __n - __k)
0 0 if (__k < __n - __k)
0 0 if (__k < __n - __k)
1368 0 0 for (_Distance __i = 0; __i < __n - __k; ++ __i)
0 0 for (_Distance __i = 0; __i < __n - __k; ++ __i)
0 0 for (_Distance __i = 0; __i < __n - __k; ++ __i)
1375 0 0 if (__n == 0)
0 0 if (__n == 0)
0 0 if (__n == 0)
1392 0 0 for (_Distance __i = 0; __i < __n - __k; ++ __i)
0 0 for (_Distance __i = 0; __i < __n - __k; ++ __i)
0 0 for (_Distance __i = 0; __i < __n - __k; ++ __i)
1399 0 0 if (__n == 0)
0 0 if (__n == 0)
0 0 if (__n == 0)
1670 0 0 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
0 0 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
0 0 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
0 0 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
0 0 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
0 0 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
0 0 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
0 0 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
0 0 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
0 0 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
1671 0 0 if (__comp(__i, __first))
0 0 if (__comp(__i, __first))
1823 0 0 while (__comp(__val, __next))
0 0 while (__comp(__val, __next))
0 0 while (__comp(__val, __next))
0 0 while (__comp(__val, __next))
1838 0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
1840 0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
1842 0 0 if (__comp(__i, __first))
0 0 if (__comp(__i, __first))
0 0 if (__comp(__i, __first))
1861 0 0 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
0 0 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
1878 0 0 if (__last - __first > int(_S_threshold))
0 0 if (__last - __first > int(_S_threshold))
0 0 if (__last - __first > int(_S_threshold))
0 0 if (__last - __first > int(_S_threshold))
0 0 if (__last - __first > int(_S_threshold))
0 0 if (__last - __first > int(_S_threshold))
0 0 if (__last - __first > int(_S_threshold))
0 0 if (__last - __first > int(_S_threshold))
0 0 if (__last - __first > int(_S_threshold))
0 0 if (__last - __first > int(_S_threshold))
1897 0 0 while (__comp(__first, __pivot))
0 0 while (__comp(__first, __pivot))
1900 0 0 while (__comp(__pivot, __last))
0 0 while (__comp(__pivot, __last))
1902 0 0 if (!(__first < __last))
0 0 if (!(__first < __last))
0 0 if (!(__first < __last))
0 0 if (!(__first < __last))
0 0 if (!(__first < __last))
0 0 if (!(__first < __last))
0 0 if (!(__first < __last))
0 0 if (!(__first < __last))
0 0 if (!(__first < __last))
0 0 if (!(__first < __last))
1939 0 0 while (__last - __first > int(_S_threshold))
0 0 while (__last - __first > int(_S_threshold))
0 0 while (__last - __first > int(_S_threshold))
0 0 while (__last - __first > int(_S_threshold))
0 0 while (__last - __first > int(_S_threshold))
0 0 while (__last - __first > int(_S_threshold))
0 0 while (__last - __first > int(_S_threshold))
0 0 while (__last - __first > int(_S_threshold))
0 0 while (__last - __first > int(_S_threshold))
0 0 while (__last - __first > int(_S_threshold))
1941 0 0 if (__depth_limit == 0)
0 0 if (__depth_limit == 0)
0 0 if (__depth_limit == 0)
0 0 if (__depth_limit == 0)
0 0 if (__depth_limit == 0)
0 0 if (__depth_limit == 0)
0 0 if (__depth_limit == 0)
0 0 if (__depth_limit == 0)
0 0 if (__depth_limit == 0)
0 0 if (__depth_limit == 0)
1961 0 0 if (__first != __last)
0 0 if (__first != __last)
0 0 if (__first != __last)
0 0 if (__first != __last)
0 0 if (__first != __last)
0 0 if (__first != __last)
0 0 if (__first != __last)
0 0 if (__first != __last)
0 0 if (__first != __last)
0 0 if (__first != __last)
2045 0 0 while (__len > 0)
0 0 while (__len > 0)
0 0 while (__len > 0)
0 0 while (__len > 0)
0 0 while (__len > 0)
2050 0 0 if (__comp(__val, __middle))
0 0 if (__comp(__val, __middle))
0 0 if (__comp(__val, __middle))
2320 0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
2334 0 0 if (__first1 != __last1)
0 0 if (__first1 != __last1)
0 0 if (__first1 != __last1)
2349 0 0 if (__first1 == __last1)
0 0 if (__first1 == __last1)
0 0 if (__first1 == __last1)
2354 0 0 else if (__first2 == __last2)
0 0 else if (__first2 == __last2)
0 0 else if (__first2 == __last2)
2393 0 0 if (__len1 > __len2 && __len2 <= __buffer_size)
0 0 if (__len1 > __len2 && __len2 <= __buffer_size)
0 0 if (__len1 > __len2 && __len2 <= __buffer_size)
2395 0 0 if (__len2)
0 0 if (__len2)
0 0 if (__len2)
2404 0 0 else if (__len1 <= __buffer_size)
0 0 else if (__len1 <= __buffer_size)
0 0 else if (__len1 <= __buffer_size)
2406 0 0 if (__len1)
0 0 if (__len1)
0 0 if (__len1)
2434 0 0 if (__len1 <= __len2 && __len1 <= __buffer_size)
0 0 if (__len1 <= __len2 && __len1 <= __buffer_size)
0 0 if (__len1 <= __len2 && __len1 <= __buffer_size)
2440 0 0 else if (__len2 <= __buffer_size)
0 0 else if (__len2 <= __buffer_size)
0 0 else if (__len2 <= __buffer_size)
2452 0 0 if (__len1 > __len2)
0 0 if (__len1 > __len2)
0 0 if (__len1 > __len2)
2494 0 0 if (__len1 == 0 || __len2 == 0)
0 0 if (__len1 == 0 || __len2 == 0)
0 0 if (__len1 == 0 || __len2 == 0)
2497 0 0 if (__len1 + __len2 == 2)
0 0 if (__len1 + __len2 == 2)
0 0 if (__len1 + __len2 == 2)
2508 0 0 if (__len1 > __len2)
0 0 if (__len1 > __len2)
0 0 if (__len1 > __len2)
2653 0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
0 0 while (__first1 != __last1 && __first2 != __last2)
2682 0 0 while (__last - __first >= __two_step)
0 0 while (__last - __first >= __two_step)
0 0 while (__last - __first >= __two_step)
0 0 while (__last - __first >= __two_step)
0 0 while (__last - __first >= __two_step)
0 0 while (__last - __first >= __two_step)
2703 0 0 while (__last - __first >= __chunk_size)
0 0 while (__last - __first >= __chunk_size)
0 0 while (__last - __first >= __chunk_size)
2728 0 0 while (__step_size < __len)
0 0 while (__step_size < __len)
0 0 while (__step_size < __len)
2749 0 0 if (__len > __buffer_size)
0 0 if (__len > __buffer_size)
0 0 if (__len > __buffer_size)
2774 0 0 if (__last - __first < 15)
0 0 if (__last - __first < 15)
0 0 if (__last - __first < 15)
3192 0 1 for (; __first != __last; ++__first)
1 1 for (; __first != __last; ++__first)
3193 0 0 if (__pred(__first))
0 1 if (__pred(__first))
3725 0 0 if (__first == __last)
3736 0 0 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
4698 0 0 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
0 0 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
0 0 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
4729 0 0 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));