Counter: MEM_TOTAL

Rank	% total	Counts		Calls		Paths		Symbol name
Rank	% total	to / from this	Total	to / from this	Total	Including child / parent	Total	Symbol name
	0.11	1,112,864	1,112,864	23,816	23,816	1	1	std::_Rb_tree<int, std::pair<int const, std::vector<int, std::allocator<int> > >, std::_Select1st<std::pair<int const, std::vector<int, std::allocator<int> > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<int, std::allocator<int> > > > >::operator=(std::_Rb_tree<int, std::pair<int const, std::vector<int, std::allocator<int> > >, std::_Select1st<std::pair<int const, std::vector<int, std::allocator<int> > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<int, std::allocator<int> > > > > const&)
[195]	0.11	318,768	794,096	6,274	23,816	1	1	std::_Rb_tree_node<std::pair<int const, std::vector<int, std::allocator<int> > > >* std::_Rb_tree<int, std::pair<int const, std::vector<int, std::allocator<int> > >, std::_Select1st<std::pair<int const, std::vector<int, std::allocator<int> > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<int, std::allocator<int> > > > >::_M_copy<std::_Rb_tree<int, std::pair<int const, std::vector<int, std::allocator<int> > >, std::_Select1st<std::pair<int const, std::vector<int, std::allocator<int> > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<int, std::allocator<int> > > > >::_Reuse_or_alloc_node>(std::_Rb_tree_node<std::pair<int const, std::vector<int, std::allocator<int> > > > const, std::_Rb_tree_node_base, std::_Rb_tree<int, std::pair<int const, std::vector<int, std::allocator<int> > >, std::_Select1st<std::pair<int const, std::vector<int, std::allocator<int> > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<int, std::allocator<int> > > > >::_Reuse_or_alloc_node&)
	0.08	794,096	794,096	17,542	17,542	1	1	std::_Rb_tree_node<std::pair<int const, std::vector<int, std::allocator<int> > > >* std::_Rb_tree<int, std::pair<int const, std::vector<int, std::allocator<int> > >, std::_Select1st<std::pair<int const, std::vector<int, std::allocator<int> > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<int, std::allocator<int> > > > >::_M_copy<std::_Rb_tree<int, std::pair<int const, std::vector<int, std::allocator<int> > >, std::_Select1st<std::pair<int const, std::vector<int, std::allocator<int> > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<int, std::allocator<int> > > > >::_Reuse_or_alloc_node>(std::_Rb_tree_node<std::pair<int const, std::vector<int, std::allocator<int> > > > const, std::_Rb_tree_node_base, std::_Rb_tree<int, std::pair<int const, std::vector<int, std::allocator<int> > >, std::_Select1st<std::pair<int const, std::vector<int, std::allocator<int> > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<int, std::allocator<int> > > > >::_Reuse_or_alloc_node&)'2

Back to summary