Branch Coverage

/usr/include/c++/5/bits/stl_algobase.h
Criterion Covered Total %
branch 18 102 17.6


line true false branch
200 5 0 if (__b < __a)
0 0 if (__b < __a)
224 0 5 if (__a < __b)
0 0 if (__a < __b)
99 97 if (__a < __b)
338 0 0 for(_Distance __n = __last - __first; __n > 0; --__n)
0 0 for(_Distance __n = __last - __first; __n > 0; --__n)
0 0 for(_Distance __n = __last - __first; __n > 0; --__n)
0 0 for(_Distance __n = __last - __first; __n > 0; --__n)
0 0 for(_Distance __n = __last - __first; __n > 0; --__n)
0 0 for(_Distance __n = __last - __first; __n > 0; --__n)
0 0 for(_Distance __n = __last - __first; __n > 0; --__n)
0 0 for(_Distance __n = __last - __first; __n > 0; --__n)
0 10 for(_Distance __n = __last - __first; __n > 0; --__n)
357 0 0 for(_Distance __n = __last - __first; __n > 0; --__n)
0 0 for(_Distance __n = __last - __first; __n > 0; --__n)
0 0 for(_Distance __n = __last - __first; __n > 0; --__n)
383 0 0 if (_Num)
0 0 if (_Num)
0 0 if (_Num)
0 0 if (_Num)
9 0 if (_Num)
3 3 if (_Num)
4 4 if (_Num)
1 1 if (_Num)
1 1 if (_Num)
5 0 if (_Num)
0 0 if (_Num)
4 0 if (_Num)
563 0 0 for (__n = __last - __first; __n > 0; --__n)
0 0 for (__n = __last - __first; __n > 0; --__n)
1 1 for (__n = __last - __first; __n > 0; --__n)
0 0 for (__n = __last - __first; __n > 0; --__n)
585 0 0 if (_Num)
0 0 if (_Num)
0 0 if (_Num)
0 0 if (_Num)
768 0 0 for (__decltype(__n + 0) __niter = __n;
815 0 0 for (; __first1 != __last1; ++__first1, ++__first2)
0 0 for (; __first1 != __last1; ++__first1, ++__first2)
816 0 0 if (!(*__first1 == *__first2))
0 0 if (!(*__first1 == *__first2))
829 0 0 if (const size_t __len = (__last1 - __first1))
847 0 0 return std::__equal<__simple>::equal(__first1, __last1, __first2);
970 0 0 while (__len > 0)
974 0 0 std::advance(__middle, __half);
975 0 0 if (__comp(__middle, __val))
1067 0 0 return std::__equal_aux(std::__niter_base(__first1),
0 0 return std::__equal_aux(std::__niter_base(__first1),
0 0 return std::__equal_aux(std::__niter_base(__first1),
1069 0 0 std::__niter_base(__first2));