Branch Coverage

/usr/include/c++/5/bits/stl_heap.h
Criterion Covered Total %
branch 0 120 0.0


line true false branch
129 0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
0 0 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
131 0 0 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent));
0 0 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent));
135 0 0 *(__first + __holeIndex) = _GLIBCXX_MOVE(__value);
0 0 *(__first + __holeIndex) = _GLIBCXX_MOVE(__value);
212 0 0 while (__secondChild < (__len - 1) / 2)
0 0 while (__secondChild < (__len - 1) / 2)
0 0 while (__secondChild < (__len - 1) / 2)
0 0 while (__secondChild < (__len - 1) / 2)
215 0 0 if (__comp(__first + __secondChild,
0 0 if (__comp(__first + __secondChild,
0 0 if (__comp(__first + __secondChild,
0 0 if (__comp(__first + __secondChild,
218 0 0 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild));
0 0 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild));
221 0 0 if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)
0 0 if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)
0 0 if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)
0 0 if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)
0 0 if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)
0 0 if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)
0 0 if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)
0 0 if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)
224 0 0 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first
0 0 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first
228 0 0 std::__push_heap(__first, __holeIndex, __topIndex,
0 0 std::__push_heap(__first, __holeIndex, __topIndex,
0 0 std::__push_heap(__first, __holeIndex, __topIndex,
244 0 0 *__result = _GLIBCXX_MOVE(*__first);
0 0 *__result = _GLIBCXX_MOVE(*__first);
245 0 0 std::__adjust_heap(__first, _DistanceType(0),
0 0 std::__adjust_heap(__first, _DistanceType(0),
0 0 std::__adjust_heap(__first, _DistanceType(0),
0 0 std::__adjust_heap(__first, _DistanceType(0),
325 0 0 if (__last - __first < 2)
0 0 if (__last - __first < 2)
0 0 if (__last - __first < 2)
0 0 if (__last - __first < 2)
333 0 0 std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value),
0 0 std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value),
0 0 std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value),
0 0 std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value),
335 0 0 if (__parent == 0)
337 0 0 __parent--;
0 0 __parent--;
393 0 0 while (__last - __first > 1)
0 0 while (__last - __first > 1)
0 0 while (__last - __first > 1)
0 0 while (__last - __first > 1)