Branch Coverage

/usr/include/c++/5/bits/stl_algo.h

Criterion	Covered	Total	%
branch	0	86	0.0

line	true	false	branch
945	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)
950	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)
	0	0	while (++__first != __last)
	0	0	while (++__first != __last)
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)
1823	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;
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)
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)
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))
1902	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))
1941	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)