Branch Coverage

/usr/include/c++/5/bits/stl_algo.h
Criterion Covered Total %
branch 5 60 8.3


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))
1670 0 0 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
1671 0 0 if (__comp(__i, __first))
1672 0 0 std::__pop_heap(__first, __middle, __i, __comp);
1823 0 0 while (__comp(__val, __next))
1838 0 1 if (__first == __last) return;
1840 0 1 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
1842 0 0 if (__comp(__i, __first))
1846 0 0 _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1);
1850 0 0 std::__unguarded_linear_insert(__i,
0 0 std::__unguarded_linear_insert(__i,
1861 0 0 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
1862 0 0 std::__unguarded_linear_insert(__i,
0 0 std::__unguarded_linear_insert(__i,
1878 0 1 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))
1916 0 0 std::__move_median_to_first(__first, __first + 1, __mid, __last - 1,
1918 0 0 return std::__unguarded_partition(__first + 1, __last, __first, __comp);
1939 0 1 while (__last - __first > int(_S_threshold))
1941 0 0 if (__depth_limit == 0)
1943 0 0 std::__partial_sort(__first, __last, __last, __comp);
1948 0 0 std::__unguarded_partition_pivot(__first, __last, __comp);
1949 0 0 std::__introsort_loop(__cut, __last, __depth_limit, __comp);
1961 1 0 if (__first != __last)