Counter: MEM_MAX

Rank % total CountsCallsPaths Symbol name
to / from
this
Totalto / from
this
Total Including
child / parent
Total
1.25 8,4488,448901,794901,89411 G4AugerData::BuildAugerTransitionTable()
[310] 1.25 1,2468,44878,760901,79411 G4AugerData::LoadData(int)
1.25 8,4488,44851,55756,381124 void std::vector<int, std::allocator<int> >::_M_realloc_insert<int const&>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&)
1.21 8,19224,5761887,834127 std::basic_filebuf<char, std::char_traits<char> >::open(char const*, std::_Ios_Openmode)
0.86 5,8005,800164,219164,21911 void std::vector<G4AugerTransition, std::allocator<G4AugerTransition> >::_M_realloc_insert<G4AugerTransition>(__gnu_cxx::__normal_iterator<G4AugerTransition*, std::vector<G4AugerTransition, std::allocator<G4AugerTransition> > >, G4AugerTransition&&)
0.25 1,6801,68072,61672,61611 G4AugerTransition::G4AugerTransition(int, std::vector<int, std::allocator<int> >, std::map<int, std::vector<int, std::allocator<int> >, std::less<int>, std::allocator<std::pair<int const, std::vector<int, std::allocator<int> > > > > const*, std::map<int, G4DataVector, std::less<int>, std::allocator<std::pair<int const, G4DataVector> > > const*, std::map<int, G4DataVector, std::less<int>, std::allocator<std::pair<int const, G4DataVector> > > const*)
0.25 1,6643,36026,552134,36412 std::_Rb_tree_node<std::pair<int const, G4DataVector> >* std::_Rb_tree<int, std::pair<int const, G4DataVector>, std::_Select1st<std::pair<int const, G4DataVector> >, std::less<int>, std::allocator<std::pair<int const, G4DataVector> > >::_M_copy<std::_Rb_tree<int, std::pair<int const, G4DataVector>, std::_Select1st<std::pair<int const, G4DataVector> >, std::less<int>, std::allocator<std::pair<int const, G4DataVector> > >::_Alloc_node>(std::_Rb_tree_node<std::pair<int const, G4DataVector> > const*, std::_Rb_tree_node_base*, std::_Rb_tree<int, std::pair<int const, G4DataVector>, std::_Select1st<std::pair<int const, G4DataVector> >, std::less<int>, std::allocator<std::pair<int const, G4DataVector> > >::_Alloc_node&)
0.08 5281,06413,27667,18212 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> > > > >::_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> > > > >::_Alloc_node&)
0.08 5128,96092,530207,820143 void std::vector<double, std::allocator<double> >::_M_realloc_insert<double const&>(__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, double const&)
0.06 3842,01623,81623,970121 std::vector<double, std::allocator<double> >::operator=(std::vector<double, std::allocator<double> > const&)
0.03 228456360,4721,609,991135 std::basic_istream<char, std::char_traits<char> >& std::basic_istream<char, std::char_traits<char> >::_M_extract<double>(double&)
0.02 15415418818811 @{SimplifiedCalo+9421873}
0.02 1401405,6185,61811 int& std::vector<int, std::allocator<int> >::emplace_back<int>(int&&)
0.02 131416,752949,8911388 std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_mutate(unsigned long, unsigned long, char const*, unsigned long)
0.01 969611,90813,08014 std::vector<int, std::allocator<int> >::operator=(std::vector<int, std::allocator<int> > const&)
Back to summary