Branch Coverage

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

Criterion	Covered	Total	%
branch	20	40	50.0

line	true	false	branch
96	1724	0	class map
479	1325	0	iterator __i = lower_bound(__k);
481	1325	0	if (__i == end() || key_comp()(__k, (*__i).first))
	56	1269	if (__i == end() || key_comp()(__k, (*__i).first))
	56	0	if (__i == end() || key_comp()(__k, (*__i).first))
	56	0	if (__i == end() || key_comp()(__k, (*__i).first))
	56	0	if (__i == end() || key_comp()(__k, (*__i).first))
	56	0	if (__i == end() || key_comp()(__k, (*__i).first))
	56	1269	if (__i == end() || key_comp()(__k, (*__i).first))
	1325	0	if (__i == end() || key_comp()(__k, (*__i).first))
	1325	0	if (__i == end() || key_comp()(__k, (*__i).first))
	0	0	if (__i == end() || key_comp()(__k, (*__i).first))
	0	0	if (__i == end() || key_comp()(__k, (*__i).first))
487	1325	0	__i = insert(__i, value_type(__k, mapped_type()));
	1325	0	__i = insert(__i, value_type(__k, mapped_type()));
	1325	0	__i = insert(__i, value_type(__k, mapped_type()));
	1325	0	__i = insert(__i, value_type(__k, mapped_type()));
	1325	0	__i = insert(__i, value_type(__k, mapped_type()));
489	1325	0	return (*__i).second;
666	1325	0	{ return _M_t._M_insert_unique_(__position, __x); }