Counter: MEM_TOTAL

Rank % total CountsCallsPaths Symbol name
to / from
this		 Totalto / from
this		 Total Including
child / parent		 Total
0.03 81,472204,6522,2325,30411 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&)'4
[400] 0.03 57,57223,9001,5602,23211 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&)'5
0.01 23,90023,90067267211 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&)'6
Back to summary