Branch Coverage

/usr/include/c++/5/bits/stl_algo.h
Criterion Covered Total %
branch 46 476 9.6


line true false branch
81 0 0 if (__comp(__a, __b))
0 0 if (__comp(__a, __b))
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))
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))
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))
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))
0 0 else if (__comp(__b, __c))
0 0 else if (__comp(__b, __c))
118 0 0 for (; __trip_count > 0; --__trip_count)
0 0 for (; __trip_count > 0; --__trip_count)
0 20 for (; __trip_count > 0; --__trip_count)
0 21 for (; __trip_count > 0; --__trip_count)
0 0 for (; __trip_count > 0; --__trip_count)
0 0 for (; __trip_count > 0; --__trip_count)
0 15 for (; __trip_count > 0; --__trip_count)
0 64 for (; __trip_count > 0; --__trip_count)
120 0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
124 0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
128 0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
132 0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
140 0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
144 0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
3 18 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
0 3 if (__pred(__first))
12 12 if (__pred(__first))
148 0 0 if (__pred(__first))
0 0 if (__pred(__first))
12 8 if (__pred(__first))
9 9 if (__pred(__first))
0 0 if (__pred(__first))
0 0 if (__pred(__first))
7 8 if (__pred(__first))
21 9 if (__pred(__first))
162 0 0 std::__iterator_category(__first));
0 0 std::__iterator_category(__first));
0 0 std::__iterator_category(__first));
0 0 std::__iterator_category(__first));
15 0 std::__iterator_category(__first));
64 0 std::__iterator_category(__first));
171 20 0 return std::__find_if(__first, __last,
21 0 return std::__find_if(__first, __last,
173 20 0 std::__iterator_category(__first));
21 0 std::__iterator_category(__first));
860 0 0 __first = std::__find_if(__first, __last, __pred);
861 0 0 if (__first == __last)
865 0 0 for (; __first != __last; ++__first)
866 0 0 if (!__pred(__first))
0 0 if (!__pred(__first))
868 0 0 *__result = _GLIBCXX_MOVE(*__first);
945 0 0 if (__first == __last)
0 5 if (__first == __last)
948 0 0 while (++__next != __last)
1 5 while (++__next != __last)
950 0 0 if (__binary_pred(__first, __next))
0 1 if (__binary_pred(__first, __next))
963 0 0 __first = std::__adjacent_find(__first, __last, __binary_pred);
5 0 __first = std::__adjacent_find(__first, __last, __binary_pred);
964 0 0 if (__first == __last)
5 0 if (__first == __last)
970 0 0 while (++__first != __last)
0 0 while (++__first != __last)
971 0 0 if (!__binary_pred(__dest, __first))
0 0 if (!__binary_pred(__dest, __first))
972 0 0 *++__dest = _GLIBCXX_MOVE(*__first);
1002 0 0 __gnu_cxx::__ops::__iter_equal_to_iter());
5 0 __gnu_cxx::__ops::__iter_equal_to_iter());
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)
1671 0 0 if (__comp(__i, __first))
0 0 if (__comp(__i, __first))
0 0 if (__comp(__i, __first))
0 0 if (__comp(__i, __first))
0 0 if (__comp(__i, __first))
0 0 if (__comp(__i, __first))
0 0 if (__comp(__i, __first))
1672 0 0 std::__pop_heap(__first, __middle, __i, __comp);
0 0 std::__pop_heap(__first, __middle, __i, __comp);
0 0 std::__pop_heap(__first, __middle, __i, __comp);
0 0 std::__pop_heap(__first, __middle, __i, __comp);
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))
0 0 while (__comp(__val, __next))
0 0 while (__comp(__val, __next))
0 0 while (__comp(__val, __next))
1825 0 0 *__last = _GLIBCXX_MOVE(*__next);
0 0 *__last = _GLIBCXX_MOVE(*__next);
1829 0 0 *__last = _GLIBCXX_MOVE(__val);
0 0 *__last = _GLIBCXX_MOVE(__val);
1838 0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 0 if (__first == __last) return;
0 5 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)
1 5 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))
0 0 if (__comp(__i, __first))
0 0 if (__comp(__i, __first))
1 0 if (__comp(__i, __first))
1 0 if (__comp(__i, __first))
1846 0 0 _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1);
0 0 _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1);
0 0 _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1);
1 0 _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1);
1847 0 0 *__first = _GLIBCXX_MOVE(__val);
1 0 *__first = _GLIBCXX_MOVE(__val);
1850 0 0 std::__unguarded_linear_insert(__i,
0 0 std::__unguarded_linear_insert(__i,
0 0 std::__unguarded_linear_insert(__i,
0 0 std::__unguarded_linear_insert(__i,
0 0 std::__unguarded_linear_insert(__i,
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)
1862 0 0 std::__unguarded_linear_insert(__i,
0 0 std::__unguarded_linear_insert(__i,
0 0 std::__unguarded_linear_insert(__i,
0 0 std::__unguarded_linear_insert(__i,
0 0 std::__unguarded_linear_insert(__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 5 if (__last - __first > int(_S_threshold))
1897 0 0 while (__comp(__first, __pivot))
0 0 while (__comp(__first, __pivot))
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))
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))
1916 0 0 std::__move_median_to_first(__first, __first + 1, __mid, __last - 1,
0 0 std::__move_median_to_first(__first, __first + 1, __mid, __last - 1,
0 0 std::__move_median_to_first(__first, __first + 1, __mid, __last - 1,
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);
0 0 return std::__unguarded_partition(__first + 1, __last, __first, __comp);
0 0 return std::__unguarded_partition(__first + 1, __last, __first, __comp);
0 0 return std::__unguarded_partition(__first + 1, __last, __first, __comp);
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 5 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)
1943 0 0 std::__partial_sort(__first, __last, __last, __comp);
0 0 std::__partial_sort(__first, __last, __last, __comp);
0 0 std::__partial_sort(__first, __last, __last, __comp);
0 0 std::__partial_sort(__first, __last, __last, __comp);
1948 0 0 std::__unguarded_partition_pivot(__first, __last, __comp);
0 0 std::__unguarded_partition_pivot(__first, __last, __comp);
0 0 std::__unguarded_partition_pivot(__first, __last, __comp);
0 0 std::__unguarded_partition_pivot(__first, __last, __comp);
1949 0 0 std::__introsort_loop(__cut, __last, __depth_limit, __comp);
0 0 std::__introsort_loop(__cut, __last, __depth_limit, __comp);
0 0 std::__introsort_loop(__cut, __last, __depth_limit, __comp);
0 0 std::__introsort_loop(__cut, __last, __depth_limit, __comp);
1961 0 0 if (__first != __last)
0 0 if (__first != __last)
0 0 if (__first != __last)
5 0 if (__first != __last)
2268 0 0 __gnu_cxx::__ops::__iter_less_val());
2269 0 0 return __i != __last && !(__val < *__i);
0 0 return __i != __last && !(__val < *__i);
3815 0 0 return std::__find_if(__first, __last,
3816 0 0 __gnu_cxx::__ops::__pred_iter(__pred));
4174 4 5 for (; __first != __last; ++__first, ++__result)
53 16 for (; __first != __last; ++__first, ++__result)
0 0 for (; __first != __last; ++__first, ++__result)
4175 4 0 *__result = __unary_op(*__first);
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());
5 0 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());