Branch Coverage

/usr/include/c++/5/bits/stl_algo.h
Criterion Covered Total %
branch 11 192 5.7


line true false branch
81 0 0 if (__comp(__a, __b))
83 0 0 if (__comp(__b, __c))
85 0 0 else if (__comp(__a, __c))
90 0 0 else if (__comp(__a, __c))
92 0 0 else if (__comp(__b, __c))
118 0 0 for (; __trip_count > 0; --__trip_count)
120 0 0 if (__pred(__first))
124 0 0 if (__pred(__first))
128 0 0 if (__pred(__first))
132 0 0 if (__pred(__first))
140 0 0 if (__pred(__first))
144 0 0 if (__pred(__first))
148 0 0 if (__pred(__first))
945 0 7 if (__first == __last)
0 0 if (__first == __last)
0 0 if (__first == __last)
0 0 if (__first == __last)
0 0 if (__first == __last)
948 2 5 while (++__next != __last)
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))
0 0 if (__binary_pred(__first, __next))
964 0 0 if (__first == __last)
0 0 if (__first == __last)
0 0 if (__first == __last)
970 0 0 while (++__first != __last)
2 2 while (++__first != __last)
0 0 while (++__first != __last)
0 0 while (++__first != __last)
0 0 while (++__first != __last)
971 0 0 if (!__binary_pred(__dest, __first))
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)
1823 0 0 while (__comp(__val, __next))
0 0 while (__comp(__val, __next))
1838 0 0 if (__first == __last) return;
7 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)
4 7 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))
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)
1878 0 7 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))
1900 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))
1939 0 7 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)
1961 7 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)
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());