Flat profile:

Each sample counts as 0.01 seconds.
  %   cumulative   self              self     total           
 time   seconds   seconds    calls  ms/call  ms/call  name    
 11.82      0.26     0.26 25292616     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&)
  6.36      0.40     0.14 13187822     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&)
  5.46      0.52     0.12 11296481     0.00     0.00  __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag)
  3.64      0.60     0.08  6300582     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::lower_bound(std::string const&)
  3.64      0.68     0.08  6253339     0.00     0.00  std::_Vector_base<int, std::allocator<int> >::_M_allocate(unsigned long)
  3.18      0.75     0.07  7976230     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_create_node(std::pair<std::string const, int> const&)
  2.27      0.80     0.05 11193831     0.00     0.00  std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&)
  2.27      0.85     0.05  7020104     0.00     0.00  TEvent* std::copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*)
  2.27      0.90     0.05  6015210     0.00     0.00  std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&)
  2.27      0.95     0.05  5854452     0.00     0.00  std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&)
  1.82      0.99     0.04  7926380     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&)
  1.82      1.03     0.04  7568957     0.00     0.00  TEvent* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*)
  1.36      1.06     0.03  6274349     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&)
  1.36      1.09     0.03  2227629     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&)
  1.36      1.12     0.03  1465695     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const*)
  1.36      1.15     0.03  1087108     0.00     0.00  encodeGraphletFromPrefix(encoding_nodeCodes, TEvent)
  1.36      1.18     0.03                             __gnu_cxx::new_allocator<std::pair<std::string const, int> >::new_allocator()
  1.36      1.21     0.03                             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_key(std::_Rb_tree_node<std::pair<int const, int> > const*)
  1.14      1.24     0.03  1172484     0.00     0.00  std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator++()
  0.91      1.26     0.02  6241474     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_value(std::_Rb_tree_node_base const*)
  0.91      1.28     0.02  6008019     0.00     0.00  std::pair<std::string const, std::string>::pair(std::string const&, std::string const&)
  0.91      1.30     0.02  5659722     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::begin() const
  0.91      1.32     0.02  4530743     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&)
  0.91      1.34     0.02  4512068     0.00     0.00  std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::insert(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&)
  0.91      1.36     0.02  4032032     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_create_node(std::pair<std::string const, std::string> const&)
  0.91      1.38     0.02  4032032     0.00     0.00  TEvent* std::__copy_move_backward_a2<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*)
  0.91      1.40     0.02  3207644     0.00     0.00  __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator++()
  0.91      1.42     0.02  2262026     0.00     0.00  std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl(std::allocator<std::pair<int, int> > const&)
  0.91      1.44     0.02  2016016     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, int> > const*)
  0.91      1.46     0.02  1566463     0.00     0.00  main
  0.91      1.48     0.02  1172200     0.00     0.00  TEvent* std::__uninitialized_copy_a<TEvent*, TEvent*, TEvent>(TEvent*, TEvent*, TEvent*, std::allocator<TEvent>&)
  0.91      1.50     0.02  1069742     0.00     0.00  std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&)
  0.91      1.52     0.02   340368     0.00     0.00  std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator!=(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const&) const
  0.91      1.54     0.02   274168     0.00     0.00  std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::~pair()
  0.91      1.56     0.02   273289     0.00     0.00  std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() const
  0.91      1.58     0.02   252002     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::end() const
  0.91      1.60     0.02    85092     0.00     0.00  encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*)
  0.91      1.62     0.02                             __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator->() const
  0.91      1.64     0.02                             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::size() const
  0.91      1.66     0.02                             std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::insert(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&)
  0.91      1.68     0.02                             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_erase(std::_Rb_tree_node<std::pair<std::string const, std::string> >*)
  0.68      1.69     0.02  3382708     0.00     0.00  std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map()
  0.68      1.71     0.02                             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::~_Rb_tree_impl()
  0.45      1.72     0.01  6241474     0.00     0.00  __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::new_allocator()
  0.45      1.73     0.01  5960214     0.00     0.00  __gnu_cxx::new_allocator<TEvent>::allocate(unsigned long, void const*)
  0.45      1.74     0.01  3655510     0.00     0.00  bool __gnu_cxx::operator!=<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&)
  0.45      1.75     0.01  3510052     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree(std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > > const&)
  0.45      1.76     0.01  3006048     0.00     0.00  std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator--()
  0.45      1.77     0.01  2514028     0.00     0.00  std::allocator<std::pair<int, int> >::allocator()
  0.45      1.78     0.01  2508036     0.00     0.00  int* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<int>(int const*, int const*, int*)
  0.45      1.79     0.01  2438083     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree()
  0.45      1.80     0.01  2196978     0.00     0.00  std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::operator--()
  0.45      1.81     0.01  1855696     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::push_back(TEvent const&)
  0.45      1.82     0.01  1500942     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&)
  0.45      1.83     0.01  1339110     0.00     0.00  std::__niter_base<__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, true>::__b(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >)
  0.45      1.84     0.01  1091010     0.00     0.00  std::pair<int const, int*>::pair(int const&, int* const&)
  0.45      1.85     0.01  1091010     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_right(std::_Rb_tree_node_base const*)
  0.45      1.86     0.01  1008008     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::max_size() const
  0.45      1.87     0.01  1008008     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::key_comp() const
  0.45      1.88     0.01  1008008     0.00     0.00  TEvent* std::__copy_move_a<false, TEvent const*, TEvent*>(TEvent const*, TEvent const*, TEvent*)
  0.45      1.89     0.01  1002016     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::get_allocator() const
  0.45      1.90     0.01   919006     0.00     0.00  unsigned long const& std::max<unsigned long>(unsigned long const&, unsigned long const&)
  0.45      1.91     0.01   870476     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::begin()
  0.45      1.92     0.01   870463     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize()
  0.45      1.93     0.01   851379     0.00     0.00  TemporalNetwork::getNextEvents(TEvent, int)
  0.45      1.94     0.01   776212     0.00     0.00  std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&)
  0.45      1.95     0.01   729702     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&)
  0.45      1.96     0.01   702469     0.00     0.00  void std::_Destroy<int*, int>(int*, int*, std::allocator<int>&)
  0.45      1.97     0.01   616930     0.00     0.00  std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&) const
  0.45      1.98     0.01   510552     0.00     0.00  TemporalNetwork::get_nodeNames(int)
  0.45      1.99     0.01   425460     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::lower_bound(int const&)
  0.45      2.00     0.01   327203     0.00     0.00  std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::map()
  0.45      2.01     0.01   320890     0.00     0.00  std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator==(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&) const
  0.45      2.02     0.01   255276     0.00     0.00  __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::deallocate(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, unsigned long)
  0.45      2.03     0.01   220371     0.00     0.00  TEvent::~TEvent()
  0.45      2.04     0.01   195256     0.00     0.00  __gnu_cxx::new_allocator<std::pair<int, int> >::allocate(unsigned long, void const*)
  0.45      2.05     0.01    21015     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_create_node(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&)
  0.45      2.06     0.01     5932     0.00     0.00  int* std::__uninitialized_move_a<int*, int*, std::allocator<int> >(int*, int*, int*, std::allocator<int>&)
  0.45      2.07     0.01      481     0.02     0.02  std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::max_size() const
  0.45      2.08     0.01      152     0.07     0.59  graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int)
  0.45      2.09     0.01                             std::allocator<TEvent>::allocator(std::allocator<TEvent> const&)
  0.45      2.10     0.01                             std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::end()
  0.45      2.11     0.01                             std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::end()
  0.45      2.12     0.01                             std::pair<double, int>::pair(double const&, int const&)
  0.45      2.13     0.01                             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, std::string> > const*)
  0.45      2.14     0.01                             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*)
  0.45      2.15     0.01                             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_get_node()
  0.45      2.16     0.01                             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, int> >*)
  0.45      2.17     0.01                             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::end()
  0.45      2.18     0.01                             std::pair<int, int>* std::uninitialized_copy<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*>(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*)
  0.45      2.19     0.01                             void std::_Destroy<__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent>(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, std::allocator<TEvent>&)
  0.23      2.19     0.01  1254018     0.00     0.00  std::__niter_base<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, true>::__b(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >)
  0.23      2.20     0.01   148300     0.00     0.00  std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator++()
  0.23      2.20     0.01                             std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator->() const
  0.00      2.20     0.00  4014056     0.00     0.00  std::string* std::__uninitialized_copy<false>::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*)
  0.00      2.20     0.00  3276068     0.00     0.00  std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map()
  0.00      2.20     0.00  2845130     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int> >*)
  0.00      2.20     0.00  2199269     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&)
  0.00      2.20     0.00  2197127     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, int> > const*)
  0.00      2.20     0.00  2186200     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl()
  0.00      2.20     0.00  2004032     0.00     0.00  __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::__normal_iterator(std::pair<int, int> const* const&)
  0.00      2.20     0.00  1679345     0.00     0.00  std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end()
  0.00      2.20     0.00  1506020     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize()
  0.00      2.20     0.00  1446283     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&)
  0.00      2.20     0.00  1339110     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_begin()
  0.00      2.20     0.00  1293839     0.00     0.00  std::_Rb_tree_const_iterator<int>::_Rb_tree_const_iterator(std::_Rb_tree_iterator<int> const&)
  0.00      2.20     0.00  1254018     0.00     0.00  TEvent* std::__uninitialized_copy<true>::uninitialized_copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*)
  0.00      2.20     0.00  1205984     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node_base const*)
  0.00      2.20     0.00  1091010     0.00     0.00  std::pair<int, int>* std::__uninitialized_copy_a<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*, std::pair<int, int> >(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*, std::allocator<std::pair<int, int> >&)
  0.00      2.20     0.00  1087108     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree()
  0.00      2.20     0.00  1044209     0.00     0.00  std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const
  0.00      2.20     0.00  1031736     0.00     0.00  std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&)
  0.00      2.20     0.00  1011315     0.00     0.00  std::string* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::string*, std::string*>(std::string*, std::string*, std::string*)
  0.00      2.20     0.00  1008008     0.00     0.00  __gnu_cxx::new_allocator<std::pair<int const, int> >::construct(std::pair<int const, int>*, std::pair<int const, int> const&)
  0.00      2.20     0.00  1002016     0.00     0.00  __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >::__normal_iterator(int* const&)
  0.00      2.20     0.00  1002016     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::capacity() const
  0.00      2.20     0.00  1002016     0.00     0.00  int* std::__uninitialized_copy<true>::uninitialized_copy<int*, int*>(int*, int*, int*)
  0.00      2.20     0.00   903206     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&)
  0.00      2.20     0.00   645788     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::string const&)
  0.00      2.20     0.00   644904     0.00     0.00  std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator*() const
  0.00      2.20     0.00   595644     0.00     0.00  std::pair<int, int>* std::__uninitialized_copy_a<std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int> >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&)
  0.00      2.20     0.00   574247     0.00     0.00  std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const
  0.00      2.20     0.00   558269     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&)
  0.00      2.20     0.00   534410     0.00     0.00  std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&)
  0.00      2.20     0.00   515914     0.00     0.00  TemporalNetwork::getEvents()
  0.00      2.20     0.00   513180     0.00     0.00  std::allocator<std::pair<int const, int> >::~allocator()
  0.00      2.20     0.00   509937     0.00     0.00  std::pair<std::pair<int, std::string> const, int>::~pair()
  0.00      2.20     0.00   504150     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::~_Rb_tree()
  0.00      2.20     0.00   504004     0.00     0.00  __gnu_cxx::new_allocator<std::pair<int const, int*> >::construct(std::pair<int const, int*>*, std::pair<int const, int*> const&)
  0.00      2.20     0.00   504004     0.00     0.00  std::pair<int const, int>::~pair()
  0.00      2.20     0.00   504004     0.00     0.00  std::pair<std::_Rb_tree_iterator<std::pair<std::string const, std::string> >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&, bool const&)
  0.00      2.20     0.00   504004     0.00     0.00  TEvent* std::__copy_move_a<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*)
  0.00      2.20     0.00   471538     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&)
  0.00      2.20     0.00   467819     0.00     0.00  std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&)
  0.00      2.20     0.00   418303     0.00     0.00  std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_base(unsigned long, std::allocator<std::pair<int, int> > const&)
  0.00      2.20     0.00   394522     0.00     0.00  __gnu_cxx::new_allocator<int>::construct(int*, int const&)
  0.00      2.20     0.00   390512     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_end()
  0.00      2.20     0.00   351992     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, int const&)
  0.00      2.20     0.00   340368     0.00     0.00  std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator++()
  0.00      2.20     0.00   335012     0.00     0.00  std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&)
  0.00      2.20     0.00   333719     0.00     0.00  __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, int> > >::deallocate(std::_Rb_tree_node<std::pair<std::string const, int> >*, unsigned long)
  0.00      2.20     0.00   328915     0.00     0.00  std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::key_comp() const
  0.00      2.20     0.00   327655     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*)
  0.00      2.20     0.00   327354     0.00     0.00  std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::~allocator()
  0.00      2.20     0.00   327203     0.00     0.00  std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::lower_bound(std::string const&)
  0.00      2.20     0.00   327052     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::~_Rb_tree_impl()
  0.00      2.20     0.00   327051     0.00     0.00  __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::~new_allocator()
  0.00      2.20     0.00   327051     0.00     0.00  __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::destroy(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*)
  0.00      2.20     0.00   321671     0.00     0.00  std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&)
  0.00      2.20     0.00   314427     0.00     0.00  std::pair<std::string const, int>::~pair()
  0.00      2.20     0.00   283888     0.00     0.00  std::_Rb_tree_iterator<std::pair<int const, int*> >::operator++(int)
  0.00      2.20     0.00   276926     0.00     0.00  __gnu_cxx::new_allocator<TEvent>::destroy(TEvent*)
  0.00      2.20     0.00   276926     0.00     0.00  __gnu_cxx::new_allocator<std::pair<std::string const, int> >::~new_allocator()
  0.00      2.20     0.00   276926     0.00     0.00  std::__miter_base<std::pair<int, int>*, false>::__b(std::pair<int, int>*)
  0.00      2.20     0.00   255276     0.00     0.00  std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::end()
  0.00      2.20     0.00   255276     0.00     0.00  std::pair<std::_Rb_tree_iterator<std::pair<std::string const, int> >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&, bool const&)
  0.00      2.20     0.00   255276     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&)
  0.00      2.20     0.00   252144     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::_M_range_check(unsigned long) const
  0.00      2.20     0.00   252002     0.00     0.00  std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::find(int const&)
  0.00      2.20     0.00   252002     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::operator[](unsigned long)
  0.00      2.20     0.00   252002     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_right(std::_Rb_tree_node_base const*)
  0.00      2.20     0.00   252002     0.00     0.00  TEvent* std::__uninitialized_copy_a<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, TEvent>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, std::allocator<TEvent>&)
  0.00      2.20     0.00   240528     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::end()
  0.00      2.20     0.00   188964     0.00     0.00  std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::operator[](int const&)
  0.00      2.20     0.00   183965     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree()
  0.00      2.20     0.00   183462     0.00     0.00  std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::end()
  0.00      2.20     0.00   183457     0.00     0.00  std::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >::~allocator()
  0.00      2.20     0.00   170468     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const*)
  0.00      2.20     0.00   170184     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int> >*)
  0.00      2.20     0.00   148300     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::find(int const&)
  0.00      2.20     0.00   146898     0.00     0.00  std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&)
  0.00      2.20     0.00   140225     0.00     0.00  std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator!=(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> > const&) const
  0.00      2.20     0.00   138944     0.00     0.00  std::pair<int, int>* std::__copy_move_backward_a2<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*)
  0.00      2.20     0.00   137982     0.00     0.00  std::pair<std::_Rb_tree_iterator<std::pair<int const, int*> >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, int*> > const&, bool const&)
  0.00      2.20     0.00   137982     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_leftmost()
  0.00      2.20     0.00   118521     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&)
  0.00      2.20     0.00   117894     0.00     0.00  std::less<std::string>::operator()(std::string const&, std::string const&) const
  0.00      2.20     0.00   104699     0.00     0.00  __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >::base() const
  0.00      2.20     0.00    99872     0.00     0.00  std::vector<int, std::allocator<int> >::begin()
  0.00      2.20     0.00    98110     0.00     0.00  std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map(std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > > const&)
  0.00      2.20     0.00    97628     0.00     0.00  std::pair<std::string const, int>::pair(std::string const&, int const&)
  0.00      2.20     0.00    97555     0.00     0.00  __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::base() const
  0.00      2.20     0.00    94841     0.00     0.00  std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator*() const
  0.00      2.20     0.00    94841     0.00     0.00  std::_Rb_tree_iterator<std::pair<int const, int*> >::operator->() const
  0.00      2.20     0.00    94812     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::~_Rb_tree_impl()
  0.00      2.20     0.00    94483     0.00     0.00  std::pair<int, int>::pair(int const&, int const&)
  0.00      2.20     0.00    93138     0.00     0.00  std::_Vector_base<std::string, std::allocator<std::string> >::_M_deallocate(std::string*, unsigned long)
  0.00      2.20     0.00    89371     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_begin()
  0.00      2.20     0.00    88616     0.00     0.00  std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator++()
  0.00      2.20     0.00    85092     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::end()
  0.00      2.20     0.00    85092     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_left(std::_Rb_tree_node_base*)
  0.00      2.20     0.00    71791     0.00     0.00  std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&)
  0.00      2.20     0.00    48736     0.00     0.00  __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::__normal_iterator(std::string* const&)
  0.00      2.20     0.00    47041     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&)
  0.00      2.20     0.00    46720     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::~_Rb_tree()
  0.00      2.20     0.00    45817     0.00     0.00  TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char)
  0.00      2.20     0.00    36500     0.00     0.00  __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&)
  0.00      2.20     0.00    23728     0.00     0.00  std::pair<int, int>* std::uninitialized_copy<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*)
  0.00      2.20     0.00    23019     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::~vector()
  0.00      2.20     0.00    21595     0.00     0.00  std::vector<std::string, std::allocator<std::string> >::~vector()
  0.00      2.20     0.00    16507     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::~_Rb_tree()
  0.00      2.20     0.00    15083     0.00     0.00  std::_Select1st<std::pair<int const, int> >::operator()(std::pair<int const, int> const&) const
  0.00      2.20     0.00    12270     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::~_Rb_tree()
  0.00      2.20     0.00    12015     0.00     0.00  std::vector<std::string, std::allocator<std::string> >::_M_range_check(unsigned long) const
  0.00      2.20     0.00    12015     0.00     0.00  std::vector<std::string, std::allocator<std::string> >::operator[](unsigned long)
  0.00      2.20     0.00    12015     0.00     0.00  void std::_Destroy<std::string*>(std::string*, std::string*)
  0.00      2.20     0.00    11867     0.00     0.00  std::pair<int, std::string> std::make_pair<int, std::string>(int, std::string)
  0.00      2.20     0.00    11864     0.00     0.00  __gnu_cxx::new_allocator<int>::~new_allocator()
  0.00      2.20     0.00    11864     0.00     0.00  __gnu_cxx::new_allocator<std::pair<int, int> >::max_size() const
  0.00      2.20     0.00    11864     0.00     0.00  void std::_Destroy_aux<true>::__destroy<int*>(int*, int*)
  0.00      2.20     0.00    11864     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_value(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const*)
  0.00      2.20     0.00    11499     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::vector()
  0.00      2.20     0.00     8076     0.00     0.00  std::_Rb_tree_const_iterator<std::pair<int const, int*> >::operator--()
  0.00      2.20     0.00     6312     0.00     0.00  std::_Rb_tree_const_iterator<std::pair<int const, int*> >::operator++()
  0.00      2.20     0.00     6312     0.00     0.00  void std::_Construct<std::string, std::string>(std::string*, std::string const&)
  0.00      2.20     0.00     6083     0.00     0.00  std::_Vector_base<std::string, std::allocator<std::string> >::_M_allocate(unsigned long)
  0.00      2.20     0.00     5935     0.00     0.00  int* std::__copy_move_backward_a2<false, int*, int*>(int*, int*, int*)
  0.00      2.20     0.00     5932     0.00     0.00  __gnu_cxx::new_allocator<std::_Rb_tree_node<int> >::allocate(unsigned long, void const*)
  0.00      2.20     0.00     5932     0.00     0.00  __gnu_cxx::new_allocator<std::pair<std::string const, int> >::construct(std::pair<std::string const, int>*, std::pair<std::string const, int> const&)
  0.00      2.20     0.00     5932     0.00     0.00  __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >::base() const
  0.00      2.20     0.00     5932     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_get_Node_allocator() const
  0.00      2.20     0.00     5932     0.00     0.00  std::__miter_base<int*, false>::__b(int*)
  0.00      2.20     0.00     5932     0.00     0.00  std::pair<std::string const, int>::pair(std::pair<std::string const, int> const&)
  0.00      2.20     0.00     5932     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_get_node()
  0.00      2.20     0.00     5932     0.00     0.00  int* std::__copy_move_a2<false, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*)
  0.00      2.20     0.00     5932     0.00     0.00  TEvent* std::__copy_move_backward_a<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*)
  0.00      2.20     0.00     5932     0.00     0.00  std::string* std::__uninitialized_move_a<std::string*, std::string*, std::allocator<std::string> >(std::string*, std::string*, std::string*, std::allocator<std::string>&)
  0.00      2.20     0.00     5919     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_right(std::_Rb_tree_node_base const*)
  0.00      2.20     0.00     5912     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_clone_node(std::_Rb_tree_node<std::pair<int const, int> > const*)
  0.00      2.20     0.00     5910     0.00     0.00  std::allocator<std::_Rb_tree_node<std::pair<int const, int> > >::allocator(std::allocator<std::_Rb_tree_node<std::pair<int const, int> > > const&)
  0.00      2.20     0.00     4740     0.00     0.00  std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::pair(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&)
  0.00      2.20     0.00     4332     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&)
  0.00      2.20     0.00     4305     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_erase(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*)
  0.00      2.20     0.00     4102     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&)
  0.00      2.20     0.00     3786     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_create_node(std::pair<std::pair<int, std::string> const, int> const&)
  0.00      2.20     0.00     3524     0.00     0.00  encoding_nodeCodes::encoding_nodeCodes(encoding_nodeCodes const&)
  0.00      2.20     0.00     3524     0.00     0.00  __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&)
  0.00      2.20     0.00     3426     0.00     0.00  __gnu_cxx::new_allocator<std::pair<std::string const, int> >::destroy(std::pair<std::string const, int>*)
  0.00      2.20     0.00     3307     0.00     0.00  __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::construct(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&)
  0.00      2.20     0.00     3156     0.00     0.00  __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::__normal_iterator(std::pair<int, int>* const&)
  0.00      2.20     0.00     3156     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::size() const
  0.00      2.20     0.00     3156     0.00     0.00  std::allocator<std::pair<std::string const, std::string> >::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >(std::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > > const&)
  0.00      2.20     0.00     3156     0.00     0.00  std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >::operator++()
  0.00      2.20     0.00     3156     0.00     0.00  std::vector<std::string, std::allocator<std::string> >::begin()
  0.00      2.20     0.00     3156     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_S_right(std::_Rb_tree_node_base const*)
  0.00      2.20     0.00     3156     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&)
  0.00      2.20     0.00     3156     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::begin()
  0.00      2.20     0.00     3077     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_leftmost()
  0.00      2.20     0.00     3071     0.00     0.00  std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator--()
  0.00      2.20     0.00     3071     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_right(std::_Rb_tree_node_base const*)
  0.00      2.20     0.00     2675     0.00     0.00  __gnu_cxx::new_allocator<TEvent>::construct(TEvent*, TEvent const&)
  0.00      2.20     0.00     2645     0.00     0.00  std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::vector(std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&)
  0.00      2.20     0.00     2556     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&)
  0.00      2.20     0.00     1864     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, int> >*)
  0.00      2.20     0.00     1772     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::pair<int, std::string> const, int> const&)
  0.00      2.20     0.00     1763     0.00     0.00  std::vector<int, std::allocator<int> >::end()
  0.00      2.20     0.00     1562     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_get_Node_allocator() const
  0.00      2.20     0.00     1562     0.00     0.00  void std::_Destroy<std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*)
  0.00      2.20     0.00     1083     0.00     0.00  std::allocator<std::pair<std::string const, int> >::~allocator()
  0.00      2.20     0.00     1083     0.00     0.00  void std::_Destroy<std::pair<int, int>*, std::pair<int, int> >(std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&)
  0.00      2.20     0.00      942     0.00     0.00  std::pair<std::pair<int, std::string> const, int>::pair(std::pair<int, std::string> const&, int const&)
  0.00      2.20     0.00      932     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_create_node(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&)
  0.00      2.20     0.00      781     0.00     0.00  std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl()
  0.00      2.20     0.00      781     0.00     0.00  std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::~_Vector_base()
  0.00      2.20     0.00      781     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::lower_bound(int const&)
  0.00      2.20     0.00      630     0.00     0.00  std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size() const
  0.00      2.20     0.00      604     0.00     0.00  __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::new_allocator()
  0.00      2.20     0.00      604     0.00     0.00  __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::construct(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&)
  0.00      2.20     0.00      604     0.00     0.00  std::pair<std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&, bool const&)
  0.00      2.20     0.00      604     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_create_node(int const&)
  0.00      2.20     0.00      604     0.00     0.00  TEvent* std::__copy_move_a2<false, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*)
  0.00      2.20     0.00      600     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*)
  0.00      2.20     0.00      579     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > const*)
  0.00      2.20     0.00      566     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::get_allocator() const
  0.00      2.20     0.00      481     0.00     0.00  std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_impl::_Vector_impl(std::allocator<TEvent> const&)
  0.00      2.20     0.00      481     0.00     0.02  TEvent* std::uninitialized_copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*)
  0.00      2.20     0.00      479     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_value(std::_Rb_tree_node_base const*)
  0.00      2.20     0.00      473     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int*> >*)
  0.00      2.20     0.00      337     0.00     0.00  __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::construct(std::pair<std::pair<int, std::string> const, int>*, std::pair<std::pair<int, std::string> const, int> const&)
  0.00      2.20     0.00      337     0.00     0.00  TEvent* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<TEvent>(TEvent const*, TEvent const*, TEvent*)
  0.00      2.20     0.00      315     0.00     0.00  std::pair<std::string const, std::string>::~pair()
  0.00      2.20     0.00      308     0.00     0.00  std::_Rb_tree_iterator<std::pair<int const, int> >::operator++()
  0.00      2.20     0.00      308     0.00     0.00  std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::insert(std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&)
  0.00      2.20     0.00      308     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*)
  0.00      2.20     0.00      303     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::begin()
  0.00      2.20     0.00      302     0.00     0.00  __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::new_allocator()
  0.00      2.20     0.00      302     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::get_allocator() const
  0.00      2.20     0.00      302     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::get_allocator() const
  0.00      2.20     0.00      302     0.00     0.00  std::allocator<TEvent>::allocator()
  0.00      2.20     0.00      302     0.00     0.00  std::allocator<std::pair<std::pair<int, std::string> const, int> >::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >(std::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > > const&)
  0.00      2.20     0.00      302     0.00     0.00  std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::~allocator()
  0.00      2.20     0.00      302     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::string> >*)
  0.00      2.20     0.00      302     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize()
  0.00      2.20     0.00      302     0.00     0.00  std::string* std::__copy_move_backward_a<false, std::string*, std::string*>(std::string*, std::string*, std::string*)
  0.00      2.20     0.00      292     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize()
  0.00      2.20     0.00      284     0.00     0.00  std::_Select1st<std::pair<std::pair<int, std::string> const, int> >::operator()(std::pair<std::pair<int, std::string> const, int> const&) const
  0.00      2.20     0.00      268     0.00     0.00  std::vector<int, std::allocator<int> >::push_back(int const&)
  0.00      2.20     0.00      242     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_Rb_tree_impl()
  0.00      2.20     0.00      237     0.00     0.00  __gnu_cxx::new_allocator<TEvent>::max_size() const
  0.00      2.20     0.00      232     0.00     0.00  std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&)
  0.00      2.20     0.00      217     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&)
  0.00      2.20     0.00      212     0.00     0.00  std::pair<int, std::string>::pair(int const&, std::string const&)
  0.00      2.20     0.00      181     0.00     0.00  std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&)
  0.00      2.20     0.00      171     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::~_Rb_tree()
  0.00      2.20     0.00      170     0.00     0.00  std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char)
  0.00      2.20     0.00      164     0.00     0.00  std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator()(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) const
  0.00      2.20     0.00      164     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::end()
  0.00      2.20     0.00      152     0.00     0.00  __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::operator++()
  0.00      2.20     0.00      152     0.00     0.00  TEvent* std::__copy_move<false, true, std::random_access_iterator_tag>::__copy_m<TEvent>(TEvent const*, TEvent const*, TEvent*)
  0.00      2.20     0.00      152     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_Rb_tree_impl<std::less<std::string>, false>::~_Rb_tree_impl()
  0.00      2.20     0.00      151     0.00     0.00  __gnu_cxx::new_allocator<std::string>::destroy(std::string*)
  0.00      2.20     0.00      151     0.00     0.00  __gnu_cxx::new_allocator<std::pair<int const, int*> >::new_allocator()
  0.00      2.20     0.00      151     0.00     0.00  __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::operator*() const
  0.00      2.20     0.00      151     0.00     0.00  std::_Select1st<std::pair<std::string const, int> >::operator()(std::pair<std::string const, int> const&) const
  0.00      2.20     0.00      151     0.00     0.00  std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&) const
  0.00      2.20     0.00      151     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::key_comp() const
  0.00      2.20     0.00      151     0.00     0.00  std::allocator<std::_Rb_tree_node<int> >::~allocator()
  0.00      2.20     0.00      151     0.00     0.00  std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator--()
  0.00      2.20     0.00      151     0.00     0.00  std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::find(std::string const&)
  0.00      2.20     0.00      151     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize()
  0.00      2.20     0.00      151     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_value(std::_Rb_tree_node_base const*)
  0.00      2.20     0.00      151     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_get_node()
  0.00      2.20     0.00      151     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl()
  0.00      2.20     0.00      151     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree()
  0.00      2.20     0.00      151     0.00     0.00  std::string* std::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*)
  0.00      2.20     0.00      151     0.00     0.00  bool std::operator< <char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00      2.20     0.00      142     0.00     0.00  __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::__normal_iterator(TEvent* const&)
  0.00      2.20     0.00      142     0.00     0.00  std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&) const
  0.00      2.20     0.00      142     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::end()
  0.00      2.20     0.00      142     0.00     0.00  std::vector<TEvent, std::allocator<TEvent> >::begin()
  0.00      2.20     0.00      142     0.00     0.00  std::vector<int, std::allocator<int> >::at(unsigned long)
  0.00      2.20     0.00      142     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*)
  0.00      2.20     0.00      142     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_value(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > const*)
  0.00      2.20     0.00      142     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_get_node()
  0.00      2.20     0.00      141     0.00     0.00  __gnu_cxx::new_allocator<std::pair<int const, int> >::~new_allocator()
  0.00      2.20     0.00      133     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const
  0.00      2.20     0.00       93     0.00     0.00  std::vector<int, std::allocator<int> >::~vector()
  0.00      2.20     0.00       89     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_create_node(std::pair<int const, int> const&)
  0.00      2.20     0.00       88     0.00     0.00  std::_Rb_tree_const_iterator<int>::operator==(std::_Rb_tree_const_iterator<int> const&) const
  0.00      2.20     0.00       88     0.00     0.00  std::pair<int, int>* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*)
  0.00      2.20     0.00       83     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::size() const
  0.00      2.20     0.00       80     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::pair<int, std::string> const&)
  0.00      2.20     0.00       66     0.00     0.00  std::pair<std::_Rb_tree_iterator<std::pair<int const, int> >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, int> > const&, bool const&)
  0.00      2.20     0.00       57     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const*)
  0.00      2.20     0.00       45     0.00     0.00  std::vector<std::string, std::allocator<std::string> >::push_back(std::string const&)
  0.00      2.20     0.00       44     0.00     0.00  std::vector<std::string, std::allocator<std::string> >::at(unsigned long)
  0.00      2.20     0.00       44     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int*> >*, std::_Rb_tree_node<std::pair<int const, int*> >*, int const&)
  0.00      2.20     0.00       44     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_S_key(std::_Rb_tree_node_base const*)
  0.00      2.20     0.00       44     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_put_node(std::_Rb_tree_node<int>*)
  0.00      2.20     0.00       44     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_left(std::_Rb_tree_node_base const*)
  0.00      2.20     0.00       42     0.00     0.00  std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::key_comp() const
  0.00      2.20     0.00       42     0.00     0.00  std::less<std::pair<int, std::string> >::operator()(std::pair<int, std::string> const&, std::pair<int, std::string> const&) const
  0.00      2.20     0.00       42     0.00     0.00  std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::lower_bound(std::pair<int, std::string> const&)
  0.00      2.20     0.00       42     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_rightmost()
  0.00      2.20     0.00       38     0.00     0.00  std::pair<int, int>* std::__uninitialized_copy<false>::uninitialized_copy<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*>(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*)
  0.00      2.20     0.00       38     0.00     0.00  int* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*)
  0.00      2.20     0.00       38     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_begin()
  0.00      2.20     0.00       36     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_value(std::_Rb_tree_node_base const*)
  0.00      2.20     0.00       29     0.00     0.00  std::set<int, std::less<int>, std::allocator<int> >::~set()
  0.00      2.20     0.00       25     0.00     0.00  int* std::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*)
  0.00      2.20     0.00       22     0.00     0.00  __gnu_cxx::new_allocator<int>::allocate(unsigned long, void const*)
  0.00      2.20     0.00       22     0.00     0.00  std::vector<int, std::allocator<int> >::max_size() const
  0.00      2.20     0.00       22     0.00     0.00  std::allocator<std::_Rb_tree_node<std::pair<int const, int*> > >::allocator()
  0.00      2.20     0.00       22     0.00     0.00  std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*)
  0.00      2.20     0.00       22     0.00     0.00  std::_Rb_tree_iterator<std::pair<int const, int*> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<int const, int*> >*)
  0.00      2.20     0.00       22     0.00     0.00  std::_Rb_tree_iterator<std::pair<int const, int> >::operator--()
  0.00      2.20     0.00       22     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::lower_bound(std::pair<int, std::string> const&)
  0.00      2.20     0.00       22     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_get_node()
  0.00      2.20     0.00       22     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_right(std::_Rb_tree_node_base const*)
  0.00      2.20     0.00       22     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_value(std::_Rb_tree_node<int> const*)
  0.00      2.20     0.00       20     0.00     0.00  std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::~map()
  0.00      2.20     0.00       19     0.00     0.00  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_end()
  0.00      2.20     0.00       19     0.00     0.00  bool std::operator< <int, std::string>(std::pair<int, std::string> const&, std::pair<int, std::string> const&)
  0.00      2.20     0.00       10     0.00     0.00  std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::~map()
  0.00      2.20     0.00        9     0.00     0.00  std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::map()
  0.00      2.20     0.00        6     0.00     0.00  bool __gnu_cxx::operator!=<int*, std::vector<int, std::allocator<int> > >(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&)
  0.00      2.20     0.00        3     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::key_comp() const
  0.00      2.20     0.00        3     0.00     0.00  std::_Vector_base<int, std::allocator<int> >::_Vector_impl::_Vector_impl(std::allocator<int> const&)
  0.00      2.20     0.00        3     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, std::string> >*)
  0.00      2.20     0.00        3     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&)
  0.00      2.20     0.00        3     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int*> >*)
  0.00      2.20     0.00        3     0.00     0.00  std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00      2.20     0.00        2     0.00    45.93  graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char)
  0.00      2.20     0.00        2     0.00     0.00  bool __gnu_cxx::operator!=<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > const&, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > const&)
  0.00      2.20     0.00        2     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::end() const
  0.00      2.20     0.00        2     0.00     5.08  std::_Vector_base<int, std::allocator<int> >::~_Vector_base()
  0.00      2.20     0.00        2     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::end()
  0.00      2.20     0.00        2     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_begin()
  0.00      2.20     0.00        2     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::_M_initialize()
  0.00      2.20     0.00        2     0.00     0.00  std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_erase(std::_Rb_tree_node<int>*)
  0.00      2.20     0.00        1     0.00     0.35  TemporalNetwork::TemporalNetwork(bool, std::string, char)
  0.00      2.20     0.00        1     0.00     0.00  __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >::~new_allocator()
  0.00      2.20     0.00        1     0.00     0.00  __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::deallocate(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, unsigned long)
  0.00      2.20     0.00        1     0.00     0.00  __gnu_cxx::new_allocator<std::pair<int const, int*> >::destroy(std::pair<int const, int*>*)
  0.00      2.20     0.00        1     0.00     0.00  __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::~new_allocator()
  0.00      2.20     0.00        1     0.00     0.00  __gnu_cxx::new_allocator<int>::new_allocator(__gnu_cxx::new_allocator<int> const&)
  0.00      2.20     0.00        1     0.00     0.00  std::vector<int, std::allocator<int> >::_M_check_len(unsigned long, char const*) const
  0.00      2.20     0.00        1     0.00     0.00  std::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::allocator()
  0.00      2.20     0.00        1     0.00     0.00  std::_Vector_base<std::string, std::allocator<std::string> >::_Vector_impl::_Vector_impl()
  0.00      2.20     0.00        1     0.00     0.00  std::_Vector_base<int, std::allocator<int> >::_Vector_base()
  0.00      2.20     0.00        1     0.00     0.00  std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator--()
  0.00      2.20     0.00        1     0.00     0.00  std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::lower_bound(int const&)
  0.00      2.20     0.00        1     0.00     0.00  std::set<int, std::less<int>, std::allocator<int> >::insert(int const&)
  0.00      2.20     0.00        1     0.00     0.00  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_right(std::_Rb_tree_node_base*)
  0.00      2.20     0.00        1     0.00     0.01  std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, int> const&)
  0.00      2.20     0.00        1     0.00     0.00  std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl()
  0.00      2.20     0.00        1     0.00     0.00  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&)
  0.00      2.20     0.00        1     0.00     0.15  std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique(std::pair<int const, int> const&)
  0.00      2.20     0.00        1     0.00     0.00  int* std::uninitialized_copy<int*, int*>(int*, int*, int*)
  0.00      2.20     0.00        1     0.00     0.00  std::pair<int, int>* std::__copy_move_backward_a<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*)
  0.00      2.20     0.00        1     0.00     5.08  int const& std::max<int>(int const&, int const&)
  0.00      2.20     0.00        1     0.00     0.00  int const& std::min<int>(int const&, int const&)
  0.00      2.20     0.00        1     0.00     5.08  bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*)

 %         the percentage of the total running time of the
time       program used by this function.

cumulative a running sum of the number of seconds accounted
 seconds   for by this function and those listed above it.

 self      the number of seconds accounted for by this
seconds    function alone.  This is the major sort for this
           listing.

calls      the number of times this function was invoked, if
           this function is profiled, else blank.
 
 self      the average number of milliseconds spent in this
ms/call    function per call, if this function is profiled,
	   else blank.

 total     the average number of milliseconds spent in this
ms/call    function and its descendents per call, if this 
	   function is profiled, else blank.

name       the name of the function.  This is the minor sort
           for this listing. The index shows the location of
	   the function in the gprof listing. If the index is
	   in parenthesis it shows where it would appear in
	   the gprof listing if it were to be printed.

		     Call graph (explanation follows)


granularity: each sample hit covers 2 byte(s) for 0.45% of 2.20 seconds

index % time    self  children    called     name
[1]     68.6    1.16    0.36 61021898+105477446 <cycle 1 as a whole> [1]
                0.26    0.09 25292616             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                0.14    0.09 13187822+7396836     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                0.12    0.00 11296481             __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
                0.04    0.06 7926380+1556344     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
                0.07    0.00 7976230             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_create_node(std::pair<std::string const, int> const&) <cycle 1> [18]
                0.05    0.02 5854452             std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) <cycle 1> [19]
                0.05    0.00 11193831             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.05    0.00 7020104             TEvent* std::copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [27]
                0.05    0.00 6015210+252002      std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) <cycle 1> [28]
                0.03    0.02 2227629+195276      std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.01    0.02 1500942             std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [43]
                0.02    0.00 4530743             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                0.02    0.00 1069742+48819       std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                0.01    0.01 5960214             __gnu_cxx::new_allocator<TEvent>::allocate(unsigned long, void const*) <cycle 1> [64]
                0.02    0.00 5659722             std::vector<TEvent, std::allocator<TEvent> >::begin() const <cycle 1> [65]
                0.02    0.00 4032032             TEvent* std::__copy_move_backward_a2<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [68]
                0.02    0.00 4032032             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_create_node(std::pair<std::string const, std::string> const&) <cycle 1> [67]
                0.02    0.00 3207644             __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator++() <cycle 1> [69]
                0.02    0.00 2016016             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [70]
                0.02    0.00 1566463+1           main <cycle 1> [63]
                0.02    0.00 1172200             TEvent* std::__uninitialized_copy_a<TEvent*, TEvent*, TEvent>(TEvent*, TEvent*, TEvent*, std::allocator<TEvent>&) <cycle 1> [71]
                0.02    0.00  273289             std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() const <cycle 1> [72]
                0.01    0.00  851379+190150      TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.01    0.00 3510052             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree(std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > > const&) <cycle 1> [111]
                0.00    0.01 2199269             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
                0.01    0.00  870463             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() <cycle 1> [119]
                0.01    0.00  729702             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) <cycle 1> [120]
                0.01    0.00  510552             TemporalNetwork::get_nodeNames(int) <cycle 1> [121]
                0.01    0.00  327203             std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::map() <cycle 1> [122]
                0.01    0.00  195256             __gnu_cxx::new_allocator<std::pair<int, int> >::allocate(unsigned long, void const*) <cycle 1> [124]
                0.00    0.01  645788             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::string const&) <cycle 1> [129]
                0.00    0.01  504004             TEvent* std::__copy_move_a<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [144]
                0.00    0.01  471538             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
                0.00    0.01  515914             TemporalNetwork::getEvents() <cycle 1> [146]
                0.01    0.00  148300             std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator++() <cycle 1> [152]
                0.00    0.00 1446283+870335      std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.00    0.00     315             std::pair<std::string const, std::string>::~pair() <cycle 1> [297]
                0.00    0.00 2845130             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int> >*) <cycle 1> [343]
                0.00    0.00 2197127+300         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [344]
                0.00    0.00 2186200             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() <cycle 1> [345]
                0.00    0.00 1339110             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_begin() <cycle 1> [347]
                0.00    0.00 1087108             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree() <cycle 1> [351]
                0.00    0.00 1044209             std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
                0.00    0.00 1031736             std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&) <cycle 1> [353]
                0.00    0.00 1002016             __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >::__normal_iterator(int* const&) <cycle 1> [356]
                0.00    0.00 1002016             std::vector<TEvent, std::allocator<TEvent> >::capacity() const <cycle 1> [357]
                0.00    0.00  574247             std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const <cycle 1> [360]
                0.00    0.00  558269             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
                0.00    0.00  534410+12166       std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                0.00    0.00  509937             std::pair<std::pair<int, std::string> const, int>::~pair() <cycle 1> [364]
                0.00    0.00  467819             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) <cycle 1> [367]
                0.00    0.00  418303             std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_base(unsigned long, std::allocator<std::pair<int, int> > const&) <cycle 1> [368]
                0.00    0.00  351992             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, int const&) <cycle 1> [371]
                0.00    0.00  340368             std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator++() <cycle 1> [372]
                0.00    0.00  335012             std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&) <cycle 1> [373]
                0.00    0.00  327655             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) <cycle 1> [376]
                0.00    0.00  327203             std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::lower_bound(std::string const&) <cycle 1> [378]
                0.00    0.00  283888             std::_Rb_tree_iterator<std::pair<int const, int*> >::operator++(int) <cycle 1> [383]
                0.00    0.00  255276             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [389]
                0.00    0.00  252144             std::vector<TEvent, std::allocator<TEvent> >::_M_range_check(unsigned long) const <cycle 1> [390]
                0.00    0.00  252002             TEvent* std::__uninitialized_copy_a<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, TEvent>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, std::allocator<TEvent>&) <cycle 1> [394]
                0.00    0.00  240528             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::end() <cycle 1> [395]
                0.00    0.00  118521+105000      std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
                0.00    0.00  148300             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::find(int const&) <cycle 1> [400]
                0.00    0.00  140225             std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator!=(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> > const&) const <cycle 1> [402]
                0.00    0.00   89371             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_begin() <cycle 1> [413]
                0.00    0.00   85092             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::end() <cycle 1> [415]
                0.00    0.00   71791+6083        std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&) <cycle 1> [417]
                0.00    0.00   47041             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
                0.00    0.00   36500             __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) <cycle 1> [419]
                0.00    0.00   12270             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::~_Rb_tree() <cycle 1> [424]
                0.00    0.00   12015             std::vector<std::string, std::allocator<std::string> >::_M_range_check(unsigned long) const <cycle 1> [425]
                0.00    0.00    6312             std::_Rb_tree_const_iterator<std::pair<int const, int*> >::operator++() <cycle 1> [433]
                0.00    0.00    6083             std::_Vector_base<std::string, std::allocator<std::string> >::_M_allocate(unsigned long) <cycle 1> [434]
                0.00    0.00    4102+1838        std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                0.00    0.00    5935             int* std::__copy_move_backward_a2<false, int*, int*>(int*, int*, int*) <cycle 1> [435]
                0.00    0.00    4332             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&) <cycle 1> [446]
                0.00    0.00    3786+315         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_create_node(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [448]
                0.00    0.00    1772             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [462]
                0.00    0.00    1083             std::allocator<std::pair<std::string const, int> >::~allocator() <cycle 1> [466]
                0.00    0.00     604             std::pair<std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&, bool const&) <cycle 1> [473]
                0.00    0.00     604             __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::construct(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [472]
                0.00    0.00     337             TEvent* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<TEvent>(TEvent const*, TEvent const*, TEvent*) <cycle 1> [483]
                0.00    0.00     302             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::get_allocator() const <cycle 1> [487]
                0.00    0.00     268             std::vector<int, std::allocator<int> >::push_back(int const&) <cycle 1> [494]
                0.00    0.00     232             std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) <cycle 1> [497]
                0.00    0.00     212             std::pair<int, std::string>::pair(int const&, std::string const&) <cycle 1> [498]
                0.00    0.00     181+19          std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
                0.00    0.00      42+142         std::less<std::pair<int, std::string> >::operator()(std::pair<int, std::string> const&, std::pair<int, std::string> const&) const <cycle 1> [539]
                0.00    0.00     151             std::string* std::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) <cycle 1> [516]
                0.00    0.00     151             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() <cycle 1> [512]
                0.00    0.00     142             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) <cycle 1> [522]
                0.00    0.00      42             std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::key_comp() const <cycle 1> [538]
                0.00    0.00      20             std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::~map() <cycle 1> [558]
                0.00    0.00       3             std::_Vector_base<int, std::allocator<int> >::_Vector_impl::_Vector_impl(std::allocator<int> const&) <cycle 1> [563]
                0.00    0.00       3             std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) <cycle 1> [567]
                0.00    0.00       1             std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::lower_bound(int const&) <cycle 1> [580]
                0.00    0.00       1             std::_Vector_base<std::string, std::allocator<std::string> >::_Vector_impl::_Vector_impl() <cycle 1> [577]
-----------------------------------------------
                               85092             encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.00    0.05   85092/1087108     graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.03    0.56 1002016/1087108     getNodes(std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >) [3]
[2]     28.9    0.03    0.61 1087108+85092   encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.02    0.33   85092/85092       encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
                0.10    0.03 5180264/61021898     std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) <cycle 1> [19]
                0.00    0.03  245454/1855696     std::vector<TEvent, std::allocator<TEvent> >::push_back(TEvent const&) [6]
                0.02    0.01 1263284/61021898     std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                0.02    0.01 1008008/61021898     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&) <cycle 1> [353]
                0.00    0.01  504004/504150      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::~_Rb_tree() [82]
                0.00    0.01  422186/3655510     bool __gnu_cxx::operator!=<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [20]
                0.00    0.00  255276/61021898     TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00  252002/61021898     TemporalNetwork::getEvents() <cycle 1> [146]
                0.00    0.00  170184/61021898     std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [43]
                0.00    0.00   85092/61021898     TemporalNetwork::get_nodeNames(int) <cycle 1> [121]
                0.00    0.00  252002/3382708     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map() [78]
                0.00    0.00  252002/252002      std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::find(int const&) [391]
                0.00    0.00   85092/255276      std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::end() [387]
                               85092             encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
-----------------------------------------------
                                                 <spontaneous>
[3]     28.3    0.00    0.62                 getNodes(std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >) [3]
                0.03    0.56 1002016/1087108     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.02    0.01 1002016/61021898     std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                0.00    0.01  501008/1679345     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() [35]
-----------------------------------------------
                                 142             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
                                 284             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                               85092             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree() <cycle 1> [351]
                              998425             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                             1002016             std::vector<TEvent, std::allocator<TEvent> >::capacity() const <cycle 1> [357]
                             1002016             __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >::__normal_iterator(int* const&) <cycle 1> [356]
                             1025234             TEvent* std::copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [27]
                             1087108             TEvent* std::__uninitialized_copy_a<TEvent*, TEvent*, TEvent>(TEvent*, TEvent*, TEvent*, std::allocator<TEvent>&) <cycle 1> [71]
                             1087108             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int> >*) <cycle 1> [343]
                             1339110             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_begin() <cycle 1> [347]
                             3006048             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree(std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > > const&) <cycle 1> [111]
                             8770547             __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
                0.00    0.00   85092/61021898     std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator==(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&) const [132]
                0.00    0.00  170184/61021898     std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::pair(std::string const&, std::vector<TEvent, std::allocator<TEvent> > const&) [91]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::find(int const&) [139]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::end() [52]
                0.00    0.00  252002/61021898     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::lower_bound(int const&) [85]
                0.00    0.00  252002/61021898     std::_Rb_tree_iterator<std::pair<int const, int> >::operator*() const [83]
                0.00    0.00  252002/61021898     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::insert(std::_Rb_tree_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) [74]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::begin() [140]
                0.02    0.01 1002016/61021898     std::_Vector_base<TEvent, std::allocator<TEvent> >::_M_deallocate(TEvent*, unsigned long) [48]
                0.03    0.01 1347572/61021898     void std::_Destroy<__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent>(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, std::allocator<TEvent>&) [32]
                0.03    0.01 1772610/61021898     __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > std::copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > >(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >) [31]
[4]     16.1    0.26    0.09 25292616         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                0.03    0.00 1172484/1172484     std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator++() [45]
                0.00    0.01 1254018/1254018     TEvent* std::__uninitialized_copy<true>::uninitialized_copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) [79]
                0.01    0.00 3664777/6008019     std::pair<std::string const, std::string>::pair(std::string const&, std::string const&) [62]
                0.01    0.00 1339110/1339110     std::__niter_base<__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, true>::__b(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >) [114]
                0.01    0.00 1002016/1002016     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::get_allocator() const [118]
                0.01    0.00  504004/702469      void std::_Destroy<int*, int>(int*, int*, std::allocator<int>&) [110]
                0.00    0.01 1506020/1506020     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [143]
                0.01    0.00 1254018/1254018     std::__niter_base<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, true>::__b(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >) [151]
                0.00    0.00 1008008/3382708     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map() [78]
                0.00    0.00  504004/513180      std::allocator<std::pair<int const, int> >::~allocator() [363]
                0.00    0.00  504004/504004      std::pair<int const, int>::~pair() [366]
                             4512068             TEvent* std::copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [27]
                              504004             TEvent* std::__copy_move_a<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [144]
                              252002             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, int const&) <cycle 1> [371]
                               85092             main <cycle 1> [63]
-----------------------------------------------
                0.02    0.33   85092/85092       encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
[5]     15.8    0.02    0.33   85092         encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
                0.01    0.21 1610242/1855696     std::vector<TEvent, std::allocator<TEvent> >::push_back(TEvent const&) [6]
                0.00    0.02 1377628/3655510     bool __gnu_cxx::operator!=<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [20]
                0.02    0.00  274168/274168      std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::~pair() [58]
                0.01    0.00  574752/61021898     std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [43]
                0.00    0.01  548336/1679345     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() [35]
                0.01    0.00  548336/61021898     __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator++() <cycle 1> [69]
                0.01    0.00  616930/616930      std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&) const [98]
                0.00    0.00  170184/61021898     std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) <cycle 1> [19]
                0.00    0.00  170184/61021898     TemporalNetwork::get_nodeNames(int) <cycle 1> [121]
                0.00    0.00  359260/3276068     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map() [342]
                0.00    0.00  146898/146898      std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) [401]
                0.00    0.00   85092/255276      std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::end() [387]
-----------------------------------------------
                0.00    0.03  245454/1855696     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.01    0.21 1610242/1855696     encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
[6]     11.7    0.01    0.25 1855696         std::vector<TEvent, std::allocator<TEvent> >::push_back(TEvent const&) [6]
                0.06    0.02 3300022/61021898     std::vector<TEvent, std::allocator<TEvent> >::begin() const <cycle 1> [65]
                0.04    0.01 1855696/61021898     std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) <cycle 1> [28]
                0.04    0.01 1855696/61021898     __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator++() <cycle 1> [69]
                0.03    0.01 1650011/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.01    0.03 1855696/3655510     bool __gnu_cxx::operator!=<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [20]
-----------------------------------------------
                                                 <spontaneous>
[7]     11.1    0.01    0.23                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, int> >*) [7]
                0.12    0.04 6241474/61021898     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
                0.08    0.00 6241474/6253339     std::_Vector_base<int, std::allocator<int> >::_M_allocate(unsigned long) [15]
-----------------------------------------------
                             7396836             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                              255276             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
                             1011282             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [389]
                             1096672             std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
                             1315524             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) <cycle 1> [120]
                             1650011             std::vector<TEvent, std::allocator<TEvent> >::begin() const <cycle 1> [65]
                             6609863             std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) <cycle 1> [28]
                0.00    0.00   85092/61021898     std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator*() const [157]
                0.01    0.00  454413/61021898     std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator()(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) const [92]
                0.01    0.00  709689/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_value(std::_Rb_tree_node_base const*) [75]
[8]     10.5    0.14    0.09 13187822+7396836 std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                0.05    0.00 3944198/6300582     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::lower_bound(std::string const&) [16]
                0.02    0.00 1210419/1465695     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const*) [42]
                0.02    0.00 3170346/7568957     TEvent* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*) [36]
                             4952206             __gnu_cxx::new_allocator<TEvent>::allocate(unsigned long, void const*) <cycle 1> [64]
                             4469604             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                             1855696             std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
                             1008008             TEvent* std::__copy_move_backward_a2<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [68]
                              998425             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                              255276             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [389]
                               49352             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
                             7396836             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
-----------------------------------------------
                                                 <spontaneous>
[9]      5.8    0.01    0.12                 std::allocator<TEvent>::allocator(std::allocator<TEvent> const&) [9]
                0.07    0.02 3944198/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_create_node(std::pair<std::string const, int> const&) <cycle 1> [18]
                0.02    0.00 3944198/7568957     TEvent* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*) [36]
-----------------------------------------------
                             1002016             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                             1512012             std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&) <cycle 1> [353]
                0.00    0.00       1/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique(std::pair<int const, int> const&) [194]
                0.00    0.00      18/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_root() const [230]
                0.00    0.00    3242/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
                0.00    0.00    5910/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_begin() const [133]
                0.00    0.00    5913/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_copy(std::_Rb_tree_node<std::pair<int const, int> > const*, std::_Rb_tree_node<std::pair<int const, int> >*) [55]
                0.00    0.00    5932/61021898     std::_Rb_tree_const_iterator<std::pair<int const, int> >::operator!=(std::_Rb_tree_const_iterator<std::pair<int const, int> > const&) const [196]
                0.01    0.00  503985/61021898     std::_Rb_tree_const_iterator<std::pair<int const, int> >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<int const, int> > const&) [87]
                0.01    0.00  504004/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::~_Rb_tree() [82]
                0.01    0.00  504004/61021898     std::_Rb_tree_const_iterator<std::pair<int const, int> >::operator->() const [84]
                0.02    0.01 1007970/61021898     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::begin() [46]
                0.12    0.04 6241474/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, int> >*) [7]
[10]     5.5    0.12    0.00 11296481         __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
                0.00    0.00  252002/3382708     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map() [78]
                             8770547             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                                5932             std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&) <cycle 1> [353]
-----------------------------------------------
                             1556344             std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
                              195256             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                              195256             __gnu_cxx::new_allocator<std::pair<int, int> >::allocate(unsigned long, void const*) <cycle 1> [124]
                              255276             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [389]
                              340368             std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator++() <cycle 1> [372]
                             1855696             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                0.00    0.00     962/61021898     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::begin() [227]
                0.00    0.00    2675/61021898     std::pair<int, int> std::make_pair<int, int>(int, int) [215]
                0.00    0.00   97628/61021898     std::pair<double, int>::pair(double const&, int const&) [88]
                0.00    0.00  140225/61021898     std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::find(int const&) [163]
                0.01    0.00  340368/61021898     std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator->() const [130]
                0.01    0.00  595644/61021898     std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator!=(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const&) const [38]
                0.03    0.01 1679345/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() [35]
                0.04    0.01 2227681/61021898     bool __gnu_cxx::operator!=<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [20]
[11]     4.5    0.04    0.06 7926380+1556344 std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
                0.03    0.00 2356384/6300582     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::lower_bound(std::string const&) [16]
                0.01    0.00 1008008/1008008     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::key_comp() const [117]
                0.01    0.00  220371/220371      TEvent::~TEvent() [123]
                0.00    0.01     481/481         TEvent* std::uninitialized_copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*) [126]
                0.00    0.00 1679345/3276068     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map() [342]
                0.00    0.00  390512/390512      std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_end() [370]
                0.00    0.00     962/276926      __gnu_cxx::new_allocator<TEvent>::destroy(TEvent*) [384]
                0.00    0.00     481/481         std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_impl::_Vector_impl(std::allocator<TEvent> const&) [479]
                             1096672             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                              645788             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::string const&) <cycle 1> [129]
                                2675             std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                             1556344             std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                                                 <spontaneous>
[12]     4.2    0.00    0.09                 generate_vector_file(std::string, std::string, std::string) [12]
                0.00    0.09       2/2           graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.00    0.00       1/152         graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00       1/1           TemporalNetwork::TemporalNetwork(bool, std::string, char) [180]
                0.00    0.00       2/45817       TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
                0.00    0.00       3/61021898     main <cycle 1> [63]
                0.00    0.00       3/504150      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::~_Rb_tree() [82]
                0.00    0.00       1/6           bool __gnu_cxx::operator!=<int*, std::vector<int, std::allocator<int> > >(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&) [310]
-----------------------------------------------
                0.00    0.09       2/2           generate_vector_file(std::string, std::string, std::string) [12]
[13]     4.2    0.00    0.09       2         graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.01    0.08     151/152         graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00   59775/61021898     std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&) <cycle 1> [417]
                0.00    0.00   43186/46720       std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::~_Rb_tree() [179]
                0.00    0.00    6076/61021898     TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00    5933/61021898     std::pair<std::pair<int, std::string> const, int>::~pair() <cycle 1> [364]
                0.00    0.00     151/45817       TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
                0.00    0.00     142/142         std::vector<TEvent, std::allocator<TEvent> >::begin() [211]
                0.00    0.00       2/2           bool __gnu_cxx::operator!=<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > const&, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > const&) [273]
                0.00    0.00     143/61021898     std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                0.00    0.00      64/61021898     std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) <cycle 1> [497]
                0.00    0.00      44/61021898     TemporalNetwork::getEvents() <cycle 1> [146]
                0.00    0.00      43/61021898     std::vector<int, std::allocator<int> >::push_back(int const&) <cycle 1> [494]
                0.00    0.00      44/44          std::vector<std::string, std::allocator<std::string> >::at(unsigned long) [302]
                0.00    0.00       4/61021898     main <cycle 1> [63]
                0.00    0.00       3/6           bool __gnu_cxx::operator!=<int*, std::vector<int, std::allocator<int> > >(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&) [310]
                0.00    0.00      51/93          std::vector<int, std::allocator<int> >::~vector() [314]
                0.00    0.00       1/61021898     std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) <cycle 1> [567]
                0.00    0.00       1/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::~_Rb_tree() <cycle 1> [424]
                0.00    0.00       1/504150      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::~_Rb_tree() [82]
                0.00    0.00    5935/11867       std::pair<int, std::string> std::make_pair<int, std::string>(int, std::string) [322]
                0.00    0.00     126/170         std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char) [335]
                0.00    0.00   21594/21595       std::vector<std::string, std::allocator<std::string> >::~vector() [421]
                0.00    0.00     152/152         __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::operator++() [501]
                0.00    0.00     151/151         __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::operator*() const [505]
                0.00    0.00     142/142         std::vector<int, std::allocator<int> >::at(unsigned long) [521]
                0.00    0.00     142/142         std::vector<TEvent, std::allocator<TEvent> >::end() [520]
-----------------------------------------------
                0.00    0.00       1/152         generate_vector_file(std::string, std::string, std::string) [12]
                0.01    0.08     151/152         graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[14]     4.1    0.01    0.08     152         graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.05   85092/1087108     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.01    0.00  586100/61021898     std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                0.00    0.00  168422/776212      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
                0.00    0.00  170184/61021898     TemporalNetwork::get_nodeNames(int) <cycle 1> [121]
                0.00    0.00  132542/61021898     TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00   83330/1679345     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() [35]
                0.00    0.00    1763/99872       std::vector<int, std::allocator<int> >::begin() [176]
                0.00    0.00     142/504150      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::~_Rb_tree() [82]
                0.00    0.00      84/61021898     std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) <cycle 1> [497]
                0.00    0.00       1/45817       TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
                0.00    0.00      25/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::~_Rb_tree() <cycle 1> [424]
                0.00    0.00      42/93          std::vector<int, std::allocator<int> >::~vector() [314]
                0.00    0.00       1/6           bool __gnu_cxx::operator!=<int*, std::vector<int, std::allocator<int> > >(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&) [310]
                0.00    0.00       1/98110       std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map(std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > > const&) [177]
                0.00    0.00      66/23019       std::vector<TEvent, std::allocator<TEvent> >::~vector() [321]
                0.00    0.00  577249/3276068     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map() [342]
                0.00    0.00    3524/3524        __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) [449]
                0.00    0.00    1763/1763        std::vector<int, std::allocator<int> >::end() [463]
                0.00    0.00     308/308         std::_Rb_tree_iterator<std::pair<int const, int> >::operator++() [484]
                0.00    0.00     142/142         std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&) const [519]
                0.00    0.00      23/11499       std::vector<TEvent, std::allocator<TEvent> >::vector() [431]
                0.00    0.00       1/1           int const& std::min<int>(int const&, int const&) [585]
-----------------------------------------------
                0.00    0.00   11865/6253339     std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [93]
                0.08    0.00 6241474/6253339     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, int> >*) [7]
[15]     3.6    0.08    0.00 6253339         std::_Vector_base<int, std::allocator<int> >::_M_allocate(unsigned long) [15]
-----------------------------------------------
                0.03    0.00 2356384/6300582     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
                0.05    0.00 3944198/6300582     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
[16]     3.6    0.08    0.00 6300582         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::lower_bound(std::string const&) [16]
-----------------------------------------------
                                                 <spontaneous>
[17]     3.3    0.00    0.07                 getNodeSet(std::vector<TEvent, std::allocator<TEvent> >*) [17]
                0.00    0.04   45663/45817       TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
                0.00    0.01  546671/1679345     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() [35]
                0.01    0.00  501008/61021898     std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                0.00    0.00  868680/3382708     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map() [78]
                0.00    0.00  130755/3276068     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map() [342]
-----------------------------------------------
                              756006             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [389]
                             1008008             __gnu_cxx::new_allocator<TEvent>::allocate(unsigned long, void const*) <cycle 1> [64]
                             2016016             TEvent* std::__copy_move_backward_a2<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [68]
                0.00    0.00  252002/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_leftmost() [138]
                0.07    0.02 3944198/61021898     std::allocator<TEvent>::allocator(std::allocator<TEvent> const&) [9]
[18]     3.2    0.07    0.00 7976230         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_create_node(std::pair<std::string const, int> const&) <cycle 1> [18]
                             2016016             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_create_node(std::pair<std::string const, std::string> const&) <cycle 1> [67]
                             2016016             TEvent* std::__copy_move_backward_a2<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [68]
-----------------------------------------------
                              252002             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                0.00    0.00  170184/61021898     encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::end() [52]
                0.10    0.03 5180264/61021898     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
[19]     3.2    0.05    0.02 5854452         std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) <cycle 1> [19]
                0.02    0.00 4512068/4512068     std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::insert(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [66]
                             1002016             std::vector<TEvent, std::allocator<TEvent> >::capacity() const <cycle 1> [357]
                             1002016             TEvent* std::copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [27]
                              170184             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) <cycle 1> [120]
                               85092             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::end() <cycle 1> [415]
-----------------------------------------------
                0.00    0.01  422186/3655510     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.00    0.02 1377628/3655510     encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
                0.01    0.03 1855696/3655510     std::vector<TEvent, std::allocator<TEvent> >::push_back(TEvent const&) [6]
[20]     3.0    0.01    0.06 3655510         bool __gnu_cxx::operator!=<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [20]
                0.04    0.01 2227681/61021898     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                                                 <spontaneous>
[21]     2.9    0.01    0.05                 std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [21]
                0.04    0.01 2196827/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.00    0.00 1293839/1293839     std::_Rb_tree_const_iterator<int>::_Rb_tree_const_iterator(std::_Rb_tree_iterator<int> const&) [348]
-----------------------------------------------
                                                 <spontaneous>
[22]     2.8    0.02    0.04                 std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_erase(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [22]
                0.02    0.01  870148/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.01    0.00  870148/870476      std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::begin() [97]
                0.00    0.00  870148/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00  183457/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) <cycle 1> [367]
-----------------------------------------------
                0.00    0.05  327051/327051      std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_left(std::_Rb_tree_node_base*) [24]
[23]     2.5    0.00    0.05  327051         __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::destroy(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*) [23]
                0.04    0.01 2196827/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
-----------------------------------------------
                                                 <spontaneous>
[24]     2.5    0.00    0.05                 std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_left(std::_Rb_tree_node_base*) [24]
                0.00    0.05  327051/327051      __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::destroy(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*) [23]
-----------------------------------------------
[25]     2.3    0.04    0.01   44716+6265731 <cycle 3 as a whole> [25]
                0.03    0.00 6274349+3242        std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
                0.01    0.01   21015             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_create_node(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 3> [56]
                0.00    0.00   15083             std::_Select1st<std::pair<int const, int> >::operator()(std::pair<int const, int> const&) const <cycle 3> [423]
-----------------------------------------------
                                 150             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
                                 482             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                                5781             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                              104699             std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
                              342651             std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) <cycle 1> [28]
                             1635104             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                             4469604             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                0.00    0.00       1/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique(std::pair<std::string const, int> const&) [312]
                0.00    0.00     100/61021898     __gnu_cxx::new_allocator<std::string>::construct(std::string*, std::string const&) [248]
                0.00    0.00     100/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_Rb_tree_impl<std::less<std::pair<int, std::string> >, false>::_Rb_tree_impl() [246]
                0.00    0.00     150/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, int> >, std::pair<std::string const, int> const&) [228]
                0.00    0.00     150/61021898     std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_left(std::_Rb_tree_node_base*) [279]
                0.00    0.00     150/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, int> const&) [243]
                0.00    0.00     158/61021898     std::_Vector_base<std::string, std::allocator<std::string> >::_Vector_base() [250]
                0.00    0.00     166/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [249]
                0.00    0.00    5932/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::~_Rb_tree() [198]
                0.01    0.00  327202/61021898     encoding_nodeCodes::encoding_nodeCodes() [131]
                0.01    0.00  454413/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_rightmost() [80]
                0.03    0.01 1650011/61021898     std::vector<TEvent, std::allocator<TEvent> >::push_back(TEvent const&) [6]
                0.04    0.01 2196827/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [21]
[26]     2.3    0.05    0.00 11193831         std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.00    0.00  327051/327051      __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::~new_allocator() [380]
                              327353             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) <cycle 1> [376]
                                 604             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&) <cycle 1> [446]
-----------------------------------------------
                             1002016             std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) <cycle 1> [19]
                             1002016             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                             4512068             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                0.00    0.00  252002/61021898     std::_Rb_tree_iterator<std::pair<int const, int> >::operator*() const [83]
                0.00    0.00  252002/61021898     std::pair<int const, int>::pair(int const&, int const&) [86]
[27]     2.3    0.05    0.00 7020104         TEvent* std::copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [27]
                             1025234             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                              252002             std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) <cycle 1> [28]
                              504004             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) <cycle 1> [120]
                             3107174             __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator++() <cycle 1> [69]
                0.01    0.00  548336/61021898     std::_Vector_base<TEvent, std::allocator<TEvent> >::_M_get_Tp_allocator() const [81]
                0.04    0.01 1855696/61021898     std::vector<TEvent, std::allocator<TEvent> >::push_back(TEvent const&) [6]
[28]     2.3    0.05    0.00 6015210+252002  std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) <cycle 1> [28]
                             6609863             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                              548336             __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator++() <cycle 1> [69]
                              342651             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                              252002             std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) <cycle 1> [28]
-----------------------------------------------
                                                 <spontaneous>
[29]     2.3    0.00    0.05                 std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&) [29]
                0.02    0.01 1008008/61021898     TEvent* std::__copy_move_backward_a2<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [68]
                0.02    0.01 1008008/61021898     __gnu_cxx::new_allocator<TEvent>::allocate(unsigned long, void const*) <cycle 1> [64]
-----------------------------------------------
                              195276             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                              327051             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() <cycle 1> [512]
                              327203             std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::lower_bound(std::string const&) <cycle 1> [378]
                             1014548             std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                0.00    0.00       1/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique(std::pair<std::string const, int> const&) [312]
                0.00    0.00       1/61021898     __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::deallocate(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, unsigned long) [323]
                0.00    0.00       2/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::end() [318]
                0.00    0.00       2/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [306]
                0.00    0.00      82/61021898     std::pair<int, int>* std::copy_backward<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [292]
                0.00    0.00     151/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, int> const&) [243]
                0.00    0.00    2675/61021898     __gnu_cxx::new_allocator<TEvent>::construct(TEvent*, TEvent const&) [199]
                0.00    0.00    3071/61021898     std::pair<int, int>* std::__uninitialized_move_a<std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> > >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [204]
                0.00    0.00    3073/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_check_len(unsigned long, char const*) const [206]
                0.00    0.00    6312/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::end() [190]
                0.00    0.00    6581/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [184]
                0.00    0.00   48736/61021898     __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::__normal_iterator(std::string* const&) [178]
                0.00    0.00   97628/61021898     std::less<int>::operator()(int const&, int const&) const [161]
                0.00    0.00   97628/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::~vector() [128]
                0.00    0.00   97628/61021898     std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::pair(int const&, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&) [155]
                0.00    0.00  195256/61021898     std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator==(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const&) const [154]
[30]     2.2    0.03    0.02 2227629+195276  std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.01    0.00 1091010/1091010     std::pair<int const, int*>::pair(int const&, int* const&) [115]
                0.00    0.00 1091010/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00 1091010/1091010     std::pair<int, int>* std::__uninitialized_copy_a<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*, std::pair<int, int> >(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [350]
                0.00    0.00  390512/3276068     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map() [342]
                0.00    0.00  195256/394522      __gnu_cxx::new_allocator<int>::construct(int*, int const&) [369]
                0.00    0.00  107036/1205984     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node_base const*) [349]
                              418303             std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_base(unsigned long, std::allocator<std::pair<int, int> > const&) <cycle 1> [368]
                              273289             std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() const <cycle 1> [72]
                              195256             std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
                               97628             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, int const&) <cycle 1> [371]
                               48819             std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&) <cycle 1> [373]
                              195276             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
-----------------------------------------------
                                                 <spontaneous>
[31]     2.0    0.00    0.04                 __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > std::copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > >(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >) [31]
                0.03    0.01 1772610/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                                                 <spontaneous>
[32]     2.0    0.01    0.03                 void std::_Destroy<__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent>(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, std::allocator<TEvent>&) [32]
                0.03    0.01 1347572/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                                   1             TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
                0.00    0.00       1/45817       graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00       2/45817       generate_vector_file(std::string, std::string, std::string) [12]
                0.00    0.00     151/45817       graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.00    0.04   45663/45817       getNodeSet(std::vector<TEvent, std::allocator<TEvent> >*) [17]
[33]     2.0    0.00    0.04   45817+1       TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
                0.01    0.01  598322/776212      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
                0.01    0.00  320890/320890      std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator==(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&) const [100]
                0.01    0.00  341684/61021898     TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00  179496/188964      std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::operator[](int const&) [156]
                0.00    0.00   11929/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::~_Rb_tree() <cycle 1> [424]
                0.00    0.00    3525/46720       std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::~_Rb_tree() [179]
                0.00    0.00    3524/3524        encoding_nodeCodes::encoding_nodeCodes(encoding_nodeCodes const&) [216]
                0.00    0.00     152/61021898     std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::map() <cycle 1> [122]
                0.00    0.00      10/10          std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::~map() [301]
                0.00    0.00   22953/23019       std::vector<TEvent, std::allocator<TEvent> >::~vector() [321]
                0.00    0.00  320890/321671      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) [381]
                0.00    0.00  314427/314427      std::pair<std::string const, int>::~pair() [382]
                0.00    0.00   15726/16507       std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::~_Rb_tree() [422]
                0.00    0.00   11476/11499       std::vector<TEvent, std::allocator<TEvent> >::vector() [431]
                0.00    0.00     152/152         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_Rb_tree_impl<std::less<std::string>, false>::~_Rb_tree_impl() [502]
                0.00    0.00      10/29          std::set<int, std::less<int>, std::allocator<int> >::~set() [546]
                0.00    0.00       9/9           std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::map() [561]
                0.00    0.00       3/3276068     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map() [342]
                                   1             TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
-----------------------------------------------
                                                 <spontaneous>
[34]     1.9    0.03    0.01                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_key(std::_Rb_tree_node<std::pair<int const, int> > const*) [34]
                0.01    0.00  504004/61021898     std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
-----------------------------------------------
                0.00    0.00   83330/1679345     graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.01  501008/1679345     getNodes(std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >) [3]
                0.00    0.01  546671/1679345     getNodeSet(std::vector<TEvent, std::allocator<TEvent> >*) [17]
                0.00    0.01  548336/1679345     encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
[35]     1.9    0.00    0.04 1679345         std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() [35]
                0.03    0.01 1679345/61021898     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                0.00    0.00  454413/7568957     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_rightmost() [80]
                0.02    0.00 3170346/7568957     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                0.02    0.00 3944198/7568957     std::allocator<TEvent>::allocator(std::allocator<TEvent> const&) [9]
[36]     1.8    0.04    0.00 7568957         TEvent* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*) [36]
-----------------------------------------------
                                                 <spontaneous>
[37]     1.7    0.02    0.02                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::size() const [37]
                0.01    0.00   15083/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
-----------------------------------------------
                0.02    0.01  340368/340368      std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::begin() [39]
[38]     1.6    0.02    0.01  340368         std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator!=(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const&) const [38]
                0.01    0.00  595644/61021898     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                                                 <spontaneous>
[39]     1.6    0.00    0.03                 std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::begin() [39]
                0.02    0.01  340368/340368      std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator!=(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const&) const [38]
-----------------------------------------------
                                3242             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
                             6241474             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_create_node(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 3> [56]
                0.00    0.00       1/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique(std::pair<int const, int> const&) [194]
                0.00    0.00      37/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl(std::less<int> const&, std::allocator<std::_Rb_tree_node<std::pair<int const, int> > > const&) [219]
                0.00    0.00    2686/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_maximum(std::_Rb_tree_node_base*) [165]
                0.00    0.00    3224/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_leftmost() [162]
                0.01    0.00   11844/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_copy(std::_Rb_tree_node<std::pair<int const, int> > const*, std::_Rb_tree_node<std::pair<int const, int> >*) [55]
                0.01    0.00   15083/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::size() const [37]
[40]     1.4    0.03    0.00 6274349+3242    std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
                0.00    0.00    3242/61021898     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
                0.00    0.00    3243/513180      std::allocator<std::pair<int const, int> >::~allocator() [363]
                                5932             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_create_node(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 3> [56]
                                3242             std::_Select1st<std::pair<int const, int> >::operator()(std::pair<int const, int> const&) const <cycle 3> [423]
                                3242             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
-----------------------------------------------
                                                 <spontaneous>
[41]     1.4    0.03    0.00                 __gnu_cxx::new_allocator<std::pair<std::string const, int> >::new_allocator() [41]
-----------------------------------------------
                0.01    0.00  255276/1465695     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
                0.02    0.00 1210419/1465695     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
[42]     1.4    0.03    0.00 1465695         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const*) [42]
-----------------------------------------------
                              252002             TEvent* std::__uninitialized_copy_a<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, TEvent>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, std::allocator<TEvent>&) <cycle 1> [394]
                              504004             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) <cycle 1> [120]
                0.00    0.00  170184/61021898     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.01    0.00  574752/61021898     encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
[43]     1.4    0.01    0.02 1500942         std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [43]
                0.02    0.00  252002/252002      std::vector<TEvent, std::allocator<TEvent> >::end() const [73]
                             1855696             std::vector<TEvent, std::allocator<TEvent> >::begin() const <cycle 1> [65]
                              304242             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) <cycle 1> [120]
                              252002             TEvent* std::__uninitialized_copy_a<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, TEvent>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, std::allocator<TEvent>&) <cycle 1> [394]
-----------------------------------------------
                0.00    0.00    3156/776212      TemporalNetwork::getEventCount() [187]
                0.00    0.00    3156/776212      std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::begin() [203]
                0.00    0.00    3156/776212      void std::_Construct<std::string, std::string>(std::string*, std::string const&) [202]
                0.00    0.00  168422/776212      graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.01    0.01  598322/776212      TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[44]     1.1    0.01    0.02  776212         std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
                0.01    0.00  405921/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                0.00    0.00  135307/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const <cycle 1> [360]
                0.00    0.00   97628/99872       std::vector<int, std::allocator<int> >::begin() [176]
                0.00    0.00   20266/117894      std::less<std::string>::operator()(std::string const&, std::string const&) const [166]
                0.00    0.00  135307/3276068     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map() [342]
                0.00    0.00   97628/97628       std::pair<std::string const, int>::pair(std::string const&, int const&) [407]
-----------------------------------------------
                0.03    0.00 1172484/1172484     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[45]     1.1    0.03    0.00 1172484         std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator++() [45]
                0.00    0.00   85092/170468      std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const*) [399]
-----------------------------------------------
                                                 <spontaneous>
[46]     1.1    0.00    0.02                 std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::begin() [46]
                0.02    0.01 1007970/61021898     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
-----------------------------------------------
                0.00    0.00  504004/2262026     TEvent* std::__copy_move_a<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [144]
                0.00    0.00  504004/2262026     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [143]
                0.01    0.00 1254018/2262026     TEvent* std::__uninitialized_copy<true>::uninitialized_copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) [79]
[47]     1.1    0.02    0.00 2262026         std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl(std::allocator<std::pair<int, int> > const&) [47]
                0.00    0.00  504004/504004      std::pair<std::_Rb_tree_iterator<std::pair<std::string const, std::string> >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&, bool const&) [153]
-----------------------------------------------
                                                 <spontaneous>
[48]     1.1    0.00    0.02                 std::_Vector_base<TEvent, std::allocator<TEvent> >::_M_deallocate(TEvent*, unsigned long) [48]
                0.02    0.01 1002016/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                              504004             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) <cycle 1> [120]
                              674188             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::end() <cycle 1> [415]
                0.00    0.00     143/61021898     graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.01    0.00  501008/61021898     getNodeSet(std::vector<TEvent, std::allocator<TEvent> >*) [17]
                0.01    0.00  586100/61021898     graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.02    0.01 1002016/61021898     getNodes(std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >) [3]
                0.02    0.01 1263284/61021898     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
[49]     1.1    0.02    0.00 4530743         std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                0.00    0.00 1002016/3382708     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map() [78]
                0.00    0.00  252002/252002      std::vector<TEvent, std::allocator<TEvent> >::operator[](unsigned long) [392]
                             3006048             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree(std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > > const&) <cycle 1> [111]
                             2089124             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int> >*) <cycle 1> [343]
                             1087108             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_begin() <cycle 1> [347]
                             1087108             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree() <cycle 1> [351]
                             1002016             TEvent* std::copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [27]
                             1002016             __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >::__normal_iterator(int* const&) <cycle 1> [356]
                             1002016             __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
                              252002             std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) <cycle 1> [19]
                               85092             TEvent* std::__uninitialized_copy_a<TEvent*, TEvent*, TEvent>(TEvent*, TEvent*, TEvent*, std::allocator<TEvent>&) <cycle 1> [71]
-----------------------------------------------
                0.00    0.00  504004/2508036     std::pair<std::_Rb_tree_iterator<std::pair<std::string const, std::string> >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&, bool const&) [153]
                0.00    0.01 1002016/2508036     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, std::string> > const*) [51]
                0.00    0.01 1002016/2508036     __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::new_allocator() [127]
[50]     1.1    0.01    0.01 2508036         int* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<int>(int const*, int const*, int*) [50]
                0.01    0.00 1008008/1008008     TEvent* std::__copy_move_a<false, TEvent const*, TEvent*>(TEvent const*, TEvent const*, TEvent*) [107]
                0.00    0.00 2508036/3510052     std::string* std::__uninitialized_copy<false>::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) <cycle 4> [142]
-----------------------------------------------
                                                 <spontaneous>
[51]     1.1    0.01    0.01                 std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, std::string> > const*) [51]
                0.00    0.01 1002016/2508036     int* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<int>(int const*, int const*, int*) [50]
                0.00    0.00 1002016/2514028     std::allocator<std::pair<int, int> >::allocator() [106]
-----------------------------------------------
                                                 <spontaneous>
[52]     1.0    0.01    0.01                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::end() [52]
                0.00    0.00  252002/61021898     std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) <cycle 1> [19]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                                                 <spontaneous>
[53]     1.0    0.02    0.00                 std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::insert(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [53]
                0.00    0.00   97628/61021898     std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&) <cycle 1> [373]
-----------------------------------------------
                               48819             std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                                2675             std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
                              195256             std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_base(unsigned long, std::allocator<std::pair<int, int> > const&) <cycle 1> [368]
                0.00    0.00     962/61021898     std::_Rb_tree_const_iterator<std::pair<std::string const, int> >::_Rb_tree_const_iterator() [225]
                0.00    0.00    2675/61021898     std::vector<std::string, std::allocator<std::string> >::end() [214]
                0.00    0.00    2675/61021898     bool __gnu_cxx::operator!=<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) [183]
                0.00    0.00  188964/61021898     std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::operator[](int const&) [156]
                0.01    0.00  270614/61021898     std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::~pair() [134]
                0.01    0.00  405921/61021898     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
[54]     0.9    0.02    0.00 1069742+48819   std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                0.00    0.00   45580/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00   45663/94483       std::pair<int, int>::pair(int const&, int const&) [411]
                             1014548             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                               45663             std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&) <cycle 1> [373]
                               48819             std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
-----------------------------------------------
                                                 <spontaneous>
[55]     0.9    0.00    0.02                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_copy(std::_Rb_tree_node<std::pair<int const, int> > const*, std::_Rb_tree_node<std::pair<int const, int> >*) [55]
                0.01    0.00   11844/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
                0.01    0.00    5913/44716       std::_Select1st<std::pair<int const, int> >::operator()(std::pair<int const, int> const&) const <cycle 3> [423]
                0.00    0.00       1/1           std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique(std::pair<int const, int> const&) [194]
                0.00    0.00    5913/61021898     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
                0.00    0.00    5919/5919        std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_right(std::_Rb_tree_node_base const*) [443]
                0.00    0.00    5910/5910        std::allocator<std::_Rb_tree_node<std::pair<int const, int> > >::allocator(std::allocator<std::_Rb_tree_node<std::pair<int const, int> > > const&) [445]
                0.00    0.00      18/36          std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_value(std::_Rb_tree_node_base const*) [545]
-----------------------------------------------
                                5932             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
                               15083             std::_Select1st<std::pair<int const, int> >::operator()(std::pair<int const, int> const&) const <cycle 3> [423]
[56]     0.9    0.01    0.01   21015         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_create_node(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 3> [56]
                0.01    0.00 6241474/6241474     __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::new_allocator() [94]
                0.00    0.00    5932/5932        __gnu_cxx::new_allocator<std::pair<std::string const, int> >::construct(std::pair<std::string const, int>*, std::pair<std::string const, int> const&) [182]
                0.00    0.00    5932/5932        std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_get_node() [440]
                0.00    0.00    5932/11864       __gnu_cxx::new_allocator<int>::~new_allocator() [427]
                             6241474             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
-----------------------------------------------
                0.02    0.00 6241474/6241474     __gnu_cxx::new_allocator<std::pair<int const, int> >::destroy(std::pair<int const, int>*) [59]
[57]     0.9    0.02    0.00 6241474         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_value(std::_Rb_tree_node_base const*) [57]
-----------------------------------------------
                0.02    0.00  274168/274168      encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
[58]     0.9    0.02    0.00  274168         std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::~pair() [58]
-----------------------------------------------
                                                 <spontaneous>
[59]     0.9    0.00    0.02                 __gnu_cxx::new_allocator<std::pair<int const, int> >::destroy(std::pair<int const, int>*) [59]
                0.02    0.00 6241474/6241474     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_value(std::_Rb_tree_node_base const*) [57]
-----------------------------------------------
                                                 <spontaneous>
[60]     0.9    0.02    0.00                 __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator->() const [60]
-----------------------------------------------
                                                 <spontaneous>
[61]     0.9    0.01    0.01                 std::pair<int, int>* std::uninitialized_copy<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*>(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*) [61]
                0.01    0.00 3006048/3006048     std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator--() [95]
-----------------------------------------------
                0.00    0.00     315/6008019     std::pair<std::string const, std::string>::~pair() <cycle 1> [297]
                0.00    0.00   94812/6008019     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::~_Rb_tree_impl() [181]
                0.01    0.00 2248115/6008019     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.01    0.00 3664777/6008019     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[62]     0.9    0.02    0.00 6008019         std::pair<std::string const, std::string>::pair(std::string const&, std::string const&) [62]
-----------------------------------------------
                                   1             main <cycle 1> [63]
                                  22             TEvent* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<TEvent>(TEvent const*, TEvent const*, TEvent*) <cycle 1> [483]
                                  93             std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
                                 151             __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::construct(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [472]
                                 315             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_create_node(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [448]
                               85092             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                              252144             std::vector<TEvent, std::allocator<TEvent> >::_M_range_check(unsigned long) const <cycle 1> [390]
                             1008008             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_create_node(std::pair<std::string const, std::string> const&) <cycle 1> [67]
                0.00    0.00       1/61021898     __gnu_cxx::new_allocator<std::pair<std::string const, std::string> >::construct(std::pair<std::string const, std::string>*, std::pair<std::string const, std::string> const&) [325]
                0.00    0.00       3/61021898     generate_vector_file(std::string, std::string, std::string) [12]
                0.00    0.00       4/61021898     graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.00    0.00     141/61021898     __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<int const, int> > >::deallocate(std::_Rb_tree_node<std::pair<int const, int> >*, unsigned long) [284]
                0.00    0.00     151/61021898     __gnu_cxx::new_allocator<std::_Rb_tree_node<int> >::new_allocator() [275]
                0.00    0.00    3156/61021898     std::allocator<std::pair<std::string const, std::string> >::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >(std::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > > const&) [208]
                0.00    0.00    3524/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_erase(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [205]
                0.00    0.00    4740/61021898     std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::pair(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [200]
                0.00    0.00    5932/61021898     __gnu_cxx::new_allocator<std::pair<std::string const, int> >::construct(std::pair<std::string const, int>*, std::pair<std::string const, int> const&) [182]
                0.00    0.00   85092/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::lower_bound(int const&) [90]
                0.00    0.00  117894/61021898     std::less<std::string>::operator()(std::string const&, std::string const&) const [166]
[63]     0.9    0.02    0.00 1566463+1       main <cycle 1> [63]
                                   2             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                                   1             main <cycle 1> [63]
-----------------------------------------------
                             4952206             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                0.02    0.01 1008008/61021898     std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&) [29]
[64]     0.9    0.01    0.01 5960214         __gnu_cxx::new_allocator<TEvent>::allocate(unsigned long, void const*) <cycle 1> [64]
                0.01    0.00 1008008/1008008     std::vector<TEvent, std::allocator<TEvent> >::max_size() const [116]
                             1008008             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_create_node(std::pair<std::string const, int> const&) <cycle 1> [18]
-----------------------------------------------
                              504004             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) <cycle 1> [120]
                             1855696             std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [43]
                0.06    0.02 3300022/61021898     std::vector<TEvent, std::allocator<TEvent> >::push_back(TEvent const&) [6]
[65]     0.9    0.02    0.00 5659722         std::vector<TEvent, std::allocator<TEvent> >::begin() const <cycle 1> [65]
                             1650011             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
-----------------------------------------------
                0.02    0.00 4512068/4512068     std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) <cycle 1> [19]
[66]     0.9    0.02    0.00 4512068         std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::insert(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [66]
-----------------------------------------------
                             2016016             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [70]
                             2016016             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_create_node(std::pair<std::string const, int> const&) <cycle 1> [18]
[67]     0.9    0.02    0.00 4032032         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_create_node(std::pair<std::string const, std::string> const&) <cycle 1> [67]
                0.00    0.00 1008008/1008008     __gnu_cxx::new_allocator<std::pair<int const, int> >::construct(std::pair<int const, int>*, std::pair<int const, int> const&) [355]
                             1008008             main <cycle 1> [63]
-----------------------------------------------
                             1008008             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                             2016016             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_create_node(std::pair<std::string const, int> const&) <cycle 1> [18]
                0.02    0.01 1008008/61021898     std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&) [29]
[68]     0.9    0.02    0.00 4032032         TEvent* std::__copy_move_backward_a2<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [68]
                             2016016             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() <cycle 1> [345]
                             2016016             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [70]
                             2016016             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_create_node(std::pair<std::string const, int> const&) <cycle 1> [18]
-----------------------------------------------
                              255276             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
                              548336             std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) <cycle 1> [28]
                0.01    0.00  548336/61021898     encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
                0.04    0.01 1855696/61021898     std::vector<TEvent, std::allocator<TEvent> >::push_back(TEvent const&) [6]
[69]     0.9    0.02    0.00 3207644         __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator++() <cycle 1> [69]
                             3107174             std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) <cycle 1> [28]
-----------------------------------------------
                             2016016             TEvent* std::__copy_move_backward_a2<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [68]
[70]     0.9    0.02    0.00 2016016         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [70]
                             2016016             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_create_node(std::pair<std::string const, std::string> const&) <cycle 1> [67]
-----------------------------------------------
                               85092             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                             1087108             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int> >*) <cycle 1> [343]
[71]     0.9    0.02    0.00 1172200         TEvent* std::__uninitialized_copy_a<TEvent*, TEvent*, TEvent>(TEvent*, TEvent*, TEvent*, std::allocator<TEvent>&) <cycle 1> [71]
                             1087108             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                              273289             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
[72]     0.9    0.02    0.00  273289         std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() const <cycle 1> [72]
                              135307             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
-----------------------------------------------
                0.02    0.00  252002/252002      std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [43]
[73]     0.9    0.02    0.00  252002         std::vector<TEvent, std::allocator<TEvent> >::end() const [73]
-----------------------------------------------
                                                 <spontaneous>
[74]     0.9    0.00    0.02                 std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::insert(std::_Rb_tree_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) [74]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int> >*) <cycle 1> [343]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_begin() <cycle 1> [347]
-----------------------------------------------
                                                 <spontaneous>
[75]     0.8    0.00    0.02                 std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_value(std::_Rb_tree_node_base const*) [75]
                0.01    0.00  709689/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
-----------------------------------------------
                0.00    0.00      21/2438083     std::_Rb_tree_const_iterator<std::pair<int const, int*> >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) [308]
                0.00    0.00      21/2438083     std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [309]
                0.00    0.00      22/2438083     std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::~_Rb_tree() [307]
                0.00    0.00      26/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::find(std::string const&) [287]
                0.00    0.00      28/2438083     std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
                0.00    0.00      82/2438083     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_check_len(unsigned long, char const*) const [206]
                0.00    0.00     187/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.00    0.00     283/2438083     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [236]
                0.00    0.00     286/2438083     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() [291]
                0.00    0.00     428/2438083     std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
                0.00    0.00    1712/2438083     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [184]
                0.00    0.00    3071/2438083     std::pair<int, int>* std::__uninitialized_move_a<std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> > >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [204]
                0.00    0.00    3073/2438083     __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::difference_type __gnu_cxx::operator-<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [229]
                0.00    0.00   45580/2438083     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                0.00    0.00   48736/2438083     std::pair<double, int> std::make_pair<double, int>(double, int) [172]
                0.00    0.00   88589/2438083     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator!=(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const [167]
                0.00    0.00  284780/2438083     TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00  870148/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_erase(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [22]
                0.00    0.00 1091010/2438083     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
[76]     0.8    0.01    0.01 2438083         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.01    0.00 2248115/6008019     std::pair<std::string const, std::string>::pair(std::string const&, std::string const&) [62]
-----------------------------------------------
                                                 <spontaneous>
[77]     0.7    0.02    0.00                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::~_Rb_tree_impl() [77]
-----------------------------------------------
                0.00    0.00  252002/3382708     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
                0.00    0.00  252002/3382708     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.00    0.00  868680/3382708     getNodeSet(std::vector<TEvent, std::allocator<TEvent> >*) [17]
                0.00    0.00 1002016/3382708     std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                0.00    0.00 1008008/3382708     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[78]     0.7    0.02    0.00 3382708         std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map() [78]
-----------------------------------------------
                0.00    0.01 1254018/1254018     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[79]     0.6    0.00    0.01 1254018         TEvent* std::__uninitialized_copy<true>::uninitialized_copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) [79]
                0.01    0.00 1254018/2262026     std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl(std::allocator<std::pair<int, int> > const&) [47]
-----------------------------------------------
                                                 <spontaneous>
[80]     0.6    0.00    0.01                 std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_rightmost() [80]
                0.01    0.00  454413/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.00    0.00  454413/7568957     TEvent* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*) [36]
-----------------------------------------------
                                                 <spontaneous>
[81]     0.6    0.00    0.01                 std::_Vector_base<TEvent, std::allocator<TEvent> >::_M_get_Tp_allocator() const [81]
                0.01    0.00  548336/61021898     std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) <cycle 1> [28]
-----------------------------------------------
                0.00    0.00       1/504150      graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.00    0.00       3/504150      generate_vector_file(std::string, std::string, std::string) [12]
                0.00    0.00     142/504150      graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.01  504004/504150      encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
[82]     0.6    0.00    0.01  504150         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::~_Rb_tree() [82]
                0.01    0.00  504004/61021898     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
-----------------------------------------------
                                                 <spontaneous>
[83]     0.6    0.00    0.01                 std::_Rb_tree_iterator<std::pair<int const, int> >::operator*() const [83]
                0.00    0.00  252002/61021898     TEvent* std::copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [27]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                                                 <spontaneous>
[84]     0.6    0.00    0.01                 std::_Rb_tree_const_iterator<std::pair<int const, int> >::operator->() const [84]
                0.01    0.00  504004/61021898     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
-----------------------------------------------
                                                 <spontaneous>
[85]     0.6    0.00    0.01                 std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::lower_bound(int const&) [85]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                0.00    0.00  252002/61021898     std::vector<TEvent, std::allocator<TEvent> >::_M_range_check(unsigned long) const <cycle 1> [390]
-----------------------------------------------
                                                 <spontaneous>
[86]     0.6    0.00    0.01                 std::pair<int const, int>::pair(int const&, int const&) [86]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int> >*) <cycle 1> [343]
                0.00    0.00  252002/61021898     TEvent* std::copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [27]
-----------------------------------------------
                                                 <spontaneous>
[87]     0.6    0.00    0.01                 std::_Rb_tree_const_iterator<std::pair<int const, int> >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<int const, int> > const&) [87]
                0.01    0.00  503985/61021898     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
-----------------------------------------------
                                                 <spontaneous>
[88]     0.6    0.01    0.00                 std::pair<double, int>::pair(double const&, int const&) [88]
                0.00    0.00   97628/61021898     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                              190150             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                                   2             main <cycle 1> [63]
                                 167             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                                3156             TemporalNetwork::get_nodeNames(int) <cycle 1> [121]
                0.00    0.00     142/61021898     initialize_gdvs(int) [281]
                0.00    0.00    3156/61021898     std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::operator[](int const&) [156]
                0.00    0.00    3156/61021898     std::pair<int, int>::pair<double, int>(std::pair<double, int> const&) [210]
                0.00    0.00    3156/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::push_back(std::pair<int, int> const&) [188]
                0.00    0.00    6076/61021898     graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.00    0.00   14250/61021898     TemporalNetwork::TemporalNetwork(bool, std::string, char) [180]
                0.00    0.00   88616/61021898     std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::begin() [169]
                0.00    0.00  132542/61021898     graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00  255276/61021898     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.01    0.00  341684/61021898     TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[89]     0.6    0.01    0.00  851379+190150  TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00  284780/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00   94812/94812       std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::~_Rb_tree_impl() [181]
                0.00    0.00       7/171         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::~_Rb_tree() [293]
                0.00    0.00   94841/94841       std::_Rb_tree_iterator<std::pair<int const, int*> >::operator->() const [410]
                0.00    0.00   88616/88616       std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator++() [414]
                0.00    0.00     151/151         std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::find(std::string const&) [511]
                0.00    0.00     151/151         std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&) const [507]
                0.00    0.00       2/183462      std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::end() [397]
                             1635104             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                              327051             std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::map() <cycle 1> [122]
                              195099             std::_Rb_tree_iterator<std::pair<int const, int*> >::operator++(int) <cycle 1> [383]
                              148300             std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator++() <cycle 1> [152]
                              140226             std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&) <cycle 1> [373]
                              140225             std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const <cycle 1> [360]
                                 315             std::pair<std::string const, std::string>::~pair() <cycle 1> [297]
                              190150             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
-----------------------------------------------
                0.00    0.00   85092/425460      std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator*() const [157]
                0.00    0.00   85092/425460      std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator==(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&) const [132]
                0.01    0.00  255276/425460      std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::pair(std::string const&, std::vector<TEvent, std::allocator<TEvent> > const&) [91]
[90]     0.6    0.01    0.00  425460         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::lower_bound(int const&) [90]
                0.00    0.00   85092/61021898     main <cycle 1> [63]
-----------------------------------------------
                                                 <spontaneous>
[91]     0.5    0.00    0.01                 std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::pair(std::string const&, std::vector<TEvent, std::allocator<TEvent> > const&) [91]
                0.01    0.00  255276/425460      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::lower_bound(int const&) [90]
                0.00    0.00  170184/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                                                 <spontaneous>
[92]     0.5    0.00    0.01                 std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator()(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) const [92]
                0.01    0.00  454413/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
-----------------------------------------------
                                5932             std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [93]
                0.00    0.01       1/2           bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [147]
                0.00    0.01       1/2           int const& std::max<int>(int const&, int const&) [148]
[93]     0.5    0.00    0.01       2+5932    std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [93]
                0.01    0.00    5932/5932        int* std::__uninitialized_move_a<int*, int*, std::allocator<int> >(int*, int*, int*, std::allocator<int>&) [108]
                0.00    0.00   11865/6253339     std::_Vector_base<int, std::allocator<int> >::_M_allocate(unsigned long) [15]
                                5932             std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [93]
-----------------------------------------------
                0.01    0.00 6241474/6241474     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_create_node(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 3> [56]
[94]     0.5    0.01    0.00 6241474         __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::new_allocator() [94]
-----------------------------------------------
                0.01    0.00 3006048/3006048     std::pair<int, int>* std::uninitialized_copy<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*>(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*) [61]
[95]     0.5    0.01    0.00 3006048         std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator--() [95]
-----------------------------------------------
                0.01    0.00 1091010/1091010     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_rightmost() [104]
[96]     0.5    0.01    0.00 1091010         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_right(std::_Rb_tree_node_base const*) [96]
-----------------------------------------------
                0.00    0.00     164/870476      std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::~_Rb_tree() [293]
                0.00    0.00     164/870476      std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::begin() [280]
                0.01    0.00  870148/870476      std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_erase(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [22]
[97]     0.5    0.01    0.00  870476         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::begin() [97]
-----------------------------------------------
                0.01    0.00  616930/616930      encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
[98]     0.5    0.01    0.00  616930         std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&) const [98]
-----------------------------------------------
                0.00    0.00   85092/595644      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_right(std::_Rb_tree_node_base*) [175]
                0.00    0.00  255276/595644      std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_key(std::_Rb_tree_node_base const*) [159]
                0.00    0.00  255276/595644      std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) [158]
[99]     0.5    0.00    0.01  595644         std::pair<int, int>* std::__uninitialized_copy_a<std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int> >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [99]
                0.01    0.00  255276/255276      __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::deallocate(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, unsigned long) [101]
-----------------------------------------------
                0.01    0.00  320890/320890      TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[100]    0.5    0.01    0.00  320890         std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator==(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&) const [100]
                0.00    0.00  641780/644904      std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator*() const [359]
-----------------------------------------------
                0.01    0.00  255276/255276      std::pair<int, int>* std::__uninitialized_copy_a<std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int> >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [99]
[101]    0.5    0.01    0.00  255276         __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::deallocate(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, unsigned long) [101]
-----------------------------------------------
                                                 <spontaneous>
[102]    0.5    0.01    0.00                 std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::end() [102]
-----------------------------------------------
                                                 <spontaneous>
[103]    0.5    0.01    0.00                 std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::end() [103]
                0.00    0.00  321671/328915      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::key_comp() const [375]
-----------------------------------------------
                                                 <spontaneous>
[104]    0.5    0.00    0.01                 std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_rightmost() [104]
                0.01    0.00 1091010/1091010     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_right(std::_Rb_tree_node_base const*) [96]
                0.00    0.00 1091010/1205984     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node_base const*) [349]
-----------------------------------------------
                                                 <spontaneous>
[105]    0.5    0.01    0.00                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_get_node() [105]
-----------------------------------------------
                0.00    0.00 1002016/2514028     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, std::string> > const*) [51]
                0.01    0.00 1512012/2514028     std::string* std::__uninitialized_copy<false>::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) <cycle 4> [142]
[106]    0.5    0.01    0.00 2514028         std::allocator<std::pair<int, int> >::allocator() [106]
-----------------------------------------------
                0.01    0.00 1008008/1008008     int* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<int>(int const*, int const*, int*) [50]
[107]    0.5    0.01    0.00 1008008         TEvent* std::__copy_move_a<false, TEvent const*, TEvent*>(TEvent const*, TEvent const*, TEvent*) [107]
-----------------------------------------------
                0.01    0.00    5932/5932        std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [93]
[108]    0.5    0.01    0.00    5932         int* std::__uninitialized_move_a<int*, int*, std::allocator<int> >(int*, int*, int*, std::allocator<int>&) [108]
                0.00    0.00    5932/11864       __gnu_cxx::new_allocator<int>::~new_allocator() [427]
                0.00    0.00    5932/5932        std::__miter_base<int*, false>::__b(int*) [439]
-----------------------------------------------
                0.00    0.00  137982/919006      std::pair<std::_Rb_tree_iterator<std::pair<int const, int*> >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, int*> > const&, bool const&) [173]
                0.01    0.00  781024/919006      std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::string const&) <cycle 1> [129]
[109]    0.5    0.01    0.00  919006         unsigned long const& std::max<unsigned long>(unsigned long const&, unsigned long const&) [109]
-----------------------------------------------
                0.00    0.00       1/702469      bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [147]
                0.00    0.00       1/702469      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique(std::pair<int const, int> const&) [194]
                0.00    0.00     481/702469      __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >::__normal_iterator(TEvent const* const&) [267]
                0.00    0.00   98110/702469      std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map(std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > > const&) [177]
                0.00    0.00   99872/702469      std::vector<int, std::allocator<int> >::begin() [176]
                0.01    0.00  504004/702469      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[110]    0.5    0.01    0.00  702469         void std::_Destroy<int*, int>(int*, int*, std::allocator<int>&) [110]
-----------------------------------------------
                              504004             TEvent* std::__copy_move_a<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [144]
                             3006048             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
[111]    0.5    0.01    0.00 3510052         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree(std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > > const&) <cycle 1> [111]
                             3006048             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                                 151             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() <cycle 1> [512]
                                 302             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::get_allocator() const <cycle 1> [487]
                                1083             std::allocator<std::pair<std::string const, int> >::~allocator() <cycle 1> [466]
                0.00    0.00     302/61021898     std::allocator<TEvent>::allocator() [256]
                0.00    0.00     302/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::get_allocator() const [255]
                0.00    0.00     302/61021898     std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::~allocator() [257]
                0.04    0.01 2196827/61021898     __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::destroy(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*) [23]
[112]    0.5    0.00    0.01 2199269         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
                0.01    0.00 2196978/2196978     std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::operator--() [113]
                0.00    0.00     302/302         __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::new_allocator() [486]
                             2196827             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [344]
-----------------------------------------------
                0.01    0.00 2196978/2196978     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
[113]    0.5    0.01    0.00 2196978         std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::operator--() [113]
-----------------------------------------------
                0.01    0.00 1339110/1339110     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[114]    0.5    0.01    0.00 1339110         std::__niter_base<__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, true>::__b(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >) [114]
-----------------------------------------------
                0.01    0.00 1091010/1091010     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
[115]    0.5    0.01    0.00 1091010         std::pair<int const, int*>::pair(int const&, int* const&) [115]
-----------------------------------------------
                0.01    0.00 1008008/1008008     __gnu_cxx::new_allocator<TEvent>::allocate(unsigned long, void const*) <cycle 1> [64]
[116]    0.5    0.01    0.00 1008008         std::vector<TEvent, std::allocator<TEvent> >::max_size() const [116]
-----------------------------------------------
                0.01    0.00 1008008/1008008     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
[117]    0.5    0.01    0.00 1008008         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::key_comp() const [117]
-----------------------------------------------
                0.01    0.00 1002016/1002016     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[118]    0.5    0.01    0.00 1002016         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::get_allocator() const [118]
                0.00    0.00 2004032/2004032     __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::__normal_iterator(std::pair<int, int> const* const&) [346]
-----------------------------------------------
                              870463             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
[119]    0.5    0.01    0.00  870463         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() <cycle 1> [119]
                                 315             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_create_node(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [448]
-----------------------------------------------
                              170184             std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) <cycle 1> [19]
                              255276             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
                              304242             std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [43]
[120]    0.5    0.01    0.00  729702         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) <cycle 1> [120]
                             1315524             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                              504004             std::vector<TEvent, std::allocator<TEvent> >::begin() const <cycle 1> [65]
                              504004             std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) <cycle 1> [28]
                              504004             std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [43]
                              504004             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
-----------------------------------------------
                               85092             TemporalNetwork::getEvents() <cycle 1> [146]
                0.00    0.00   85092/61021898     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.00    0.00  170184/61021898     encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
                0.00    0.00  170184/61021898     graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
[121]    0.5    0.01    0.00  510552         TemporalNetwork::get_nodeNames(int) <cycle 1> [121]
                0.00    0.00   85092/255276      std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::end() [387]
                              340368             std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator++() <cycle 1> [372]
                                3156             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
-----------------------------------------------
                              327051             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00     152/61021898     TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[122]    0.5    0.01    0.00  327203         std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::map() <cycle 1> [122]
                              327203             std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::lower_bound(std::string const&) <cycle 1> [378]
-----------------------------------------------
                0.01    0.00  220371/220371      std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
[123]    0.5    0.01    0.00  220371         TEvent::~TEvent() [123]
-----------------------------------------------
                              195256             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::string const&) <cycle 1> [129]
[124]    0.5    0.01    0.00  195256         __gnu_cxx::new_allocator<std::pair<int, int> >::allocate(unsigned long, void const*) <cycle 1> [124]
                0.00    0.00  195256/333719      __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, int> > >::deallocate(std::_Rb_tree_node<std::pair<std::string const, int> >*, unsigned long) [374]
                              195256             std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                0.01    0.00     481/481         TEvent* std::uninitialized_copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*) [126]
[125]    0.5    0.01    0.00     481         std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::max_size() const [125]
-----------------------------------------------
                0.00    0.01     481/481         std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
[126]    0.5    0.00    0.01     481         TEvent* std::uninitialized_copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*) [126]
                0.01    0.00     481/481         std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::max_size() const [125]
-----------------------------------------------
                                                 <spontaneous>
[127]    0.4    0.00    0.01                 __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::new_allocator() [127]
                0.00    0.01 1002016/2508036     int* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<int>(int const*, int const*, int*) [50]
                0.00    0.00 1002016/1002016     int* std::__uninitialized_copy<true>::uninitialized_copy<int*, int*>(int*, int*, int*) [358]
-----------------------------------------------
                                                 <spontaneous>
[128]    0.4    0.00    0.01                 std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::~vector() [128]
                0.00    0.00  195256/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const <cycle 1> [360]
                0.00    0.00   97628/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00   97628/117894      std::less<std::string>::operator()(std::string const&, std::string const&) const [166]
                0.00    0.00   97628/394522      __gnu_cxx::new_allocator<int>::construct(int*, int const&) [369]
-----------------------------------------------
                              645788             std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
[129]    0.4    0.00    0.01  645788         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::string const&) <cycle 1> [129]
                0.01    0.00  781024/919006      unsigned long const& std::max<unsigned long>(unsigned long const&, unsigned long const&) [109]
                              195256             __gnu_cxx::new_allocator<std::pair<int, int> >::allocate(unsigned long, void const*) <cycle 1> [124]
-----------------------------------------------
                                                 <spontaneous>
[130]    0.4    0.00    0.01                 std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator->() const [130]
                0.01    0.00  340368/61021898     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                                                 <spontaneous>
[131]    0.4    0.00    0.01                 encoding_nodeCodes::encoding_nodeCodes() [131]
                0.01    0.00  327202/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
-----------------------------------------------
                                                 <spontaneous>
[132]    0.3    0.00    0.01                 std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator==(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&) const [132]
                0.00    0.00   85092/170184      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int> >*) [135]
                0.00    0.00   85092/425460      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::lower_bound(int const&) [90]
                0.00    0.00   85092/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                                                 <spontaneous>
[133]    0.3    0.00    0.01                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_begin() const [133]
                0.01    0.00    5910/44716       std::_Select1st<std::pair<int const, int> >::operator()(std::pair<int const, int> const&) const <cycle 3> [423]
                0.00    0.00    5910/61021898     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
-----------------------------------------------
                                                 <spontaneous>
[134]    0.3    0.00    0.01                 std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::~pair() [134]
                0.01    0.00  270614/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
-----------------------------------------------
                0.00    0.00   85092/170184      std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator==(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&) const [132]
                0.00    0.00   85092/170184      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_end() [164]
[135]    0.3    0.00    0.01  170184         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int> >*) [135]
                0.00    0.00  255276/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
-----------------------------------------------
                                                 <spontaneous>
[136]    0.3    0.00    0.01                 checkEndPoints(int, std::vector<int, std::allocator<int> >) [136]
                0.00    0.00  252002/61021898     TemporalNetwork::getEvents() <cycle 1> [146]
-----------------------------------------------
                                                 <spontaneous>
[137]    0.3    0.00    0.01                 std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::key_comp() const [137]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int> >*) <cycle 1> [343]
-----------------------------------------------
                                                 <spontaneous>
[138]    0.3    0.00    0.01                 std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_leftmost() [138]
                0.00    0.00  252002/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_create_node(std::pair<std::string const, int> const&) <cycle 1> [18]
-----------------------------------------------
                                                 <spontaneous>
[139]    0.3    0.00    0.01                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::find(int const&) [139]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                                                 <spontaneous>
[140]    0.3    0.00    0.01                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::begin() [140]
                0.00    0.00  252002/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
[141]    0.3    0.00    0.01 3510052+1008008 <cycle 4 as a whole> [141]
                0.00    0.01 4014056             std::string* std::__uninitialized_copy<false>::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) <cycle 4> [142]
                0.00    0.00  504004             __gnu_cxx::new_allocator<std::pair<int const, int*> >::construct(std::pair<int const, int*>*, std::pair<int const, int*> const&) <cycle 4> [365]
-----------------------------------------------
                              504004             __gnu_cxx::new_allocator<std::pair<int const, int*> >::construct(std::pair<int const, int*>*, std::pair<int const, int*> const&) <cycle 4> [365]
                0.00    0.00 1002016/3510052     std::__miter_base<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, false>::__b(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >) [171]
                0.00    0.00 2508036/3510052     int* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<int>(int const*, int const*, int*) [50]
[142]    0.3    0.00    0.01 4014056         std::string* std::__uninitialized_copy<false>::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) <cycle 4> [142]
                0.01    0.00 1512012/2514028     std::allocator<std::pair<int, int> >::allocator() [106]
                              504004             __gnu_cxx::new_allocator<std::pair<int const, int*> >::construct(std::pair<int const, int*>*, std::pair<int const, int*> const&) <cycle 4> [365]
-----------------------------------------------
                0.00    0.01 1506020/1506020     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[143]    0.3    0.00    0.01 1506020         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [143]
                0.00    0.00  504004/2262026     std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl(std::allocator<std::pair<int, int> > const&) [47]
-----------------------------------------------
                              504004             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[144]    0.3    0.00    0.01  504004         TEvent* std::__copy_move_a<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [144]
                0.00    0.00  504004/2262026     std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl(std::allocator<std::pair<int, int> > const&) [47]
                              504004             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree(std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > > const&) <cycle 1> [111]
-----------------------------------------------
                               49352             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                               85092             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() <cycle 1> [345]
                0.00    0.00   81818/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int> >*, std::_Rb_tree_node<std::pair<int const, int> >*, int const&) [170]
                0.00    0.00  255276/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int> >*) [135]
[145]    0.2    0.00    0.01  471538         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
                0.01    0.00  255276/1465695     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const*) [42]
                0.00    0.00  255276/255276      std::pair<std::_Rb_tree_iterator<std::pair<std::string const, int> >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&, bool const&) [388]
                0.00    0.00   85092/170468      std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const*) [399]
                              255276             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                              255276             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) <cycle 1> [120]
                              255276             __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator++() <cycle 1> [69]
-----------------------------------------------
                               11864             std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&) <cycle 1> [353]
                0.00    0.00       1/61021898     split(std::string const&, char) [296]
                0.00    0.00       1/61021898     TemporalNetwork::TemporalNetwork(bool, std::string, char) [180]
                0.00    0.00      44/61021898     graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.00    0.00  252002/61021898     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.00    0.00  252002/61021898     checkEndPoints(int, std::vector<int, std::allocator<int> >) [136]
[146]    0.2    0.00    0.01  515914         TemporalNetwork::getEvents() <cycle 1> [146]
                0.00    0.01       1/1           bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [147]
                0.00    0.00       1/45          std::vector<std::string, std::allocator<std::string> >::push_back(std::string const&) [320]
                0.00    0.00       1/1           std::set<int, std::less<int>, std::allocator<int> >::insert(int const&) [337]
                               85092             TemporalNetwork::get_nodeNames(int) <cycle 1> [121]
                                  42             std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) <cycle 1> [497]
                                   1             std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) <cycle 1> [567]
-----------------------------------------------
                0.00    0.01       1/1           TemporalNetwork::getEvents() <cycle 1> [146]
[147]    0.2    0.00    0.01       1         bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [147]
                0.00    0.01       1/2           std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [93]
                0.00    0.00       1/702469      void std::_Destroy<int*, int>(int*, int*, std::allocator<int>&) [110]
-----------------------------------------------
                0.00    0.01       1/1           void std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::insert<std::_Rb_tree_iterator<std::pair<int const, int> > >(std::_Rb_tree_iterator<std::pair<int const, int> >, std::_Rb_tree_iterator<std::pair<int const, int> >) [149]
[148]    0.2    0.00    0.01       1         int const& std::max<int>(int const&, int const&) [148]
                0.00    0.01       1/2           std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [93]
-----------------------------------------------
                                                 <spontaneous>
[149]    0.2    0.00    0.01                 void std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::insert<std::_Rb_tree_iterator<std::pair<int const, int> > >(std::_Rb_tree_iterator<std::pair<int const, int> >, std::_Rb_tree_iterator<std::pair<int const, int> >) [149]
                0.00    0.01       1/1           int const& std::max<int>(int const&, int const&) [148]
-----------------------------------------------
                                                 <spontaneous>
[150]    0.2    0.01    0.00                 std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator->() const [150]
-----------------------------------------------
                0.01    0.00 1254018/1254018     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[151]    0.2    0.01    0.00 1254018         std::__niter_base<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, true>::__b(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >) [151]
-----------------------------------------------
                              148300             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
[152]    0.2    0.01    0.00  148300         std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator++() <cycle 1> [152]
                                8075             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::find(int const&) <cycle 1> [400]
-----------------------------------------------
                0.00    0.00  504004/504004      std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl(std::allocator<std::pair<int, int> > const&) [47]
[153]    0.2    0.00    0.00  504004         std::pair<std::_Rb_tree_iterator<std::pair<std::string const, std::string> >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&, bool const&) [153]
                0.00    0.00  504004/2508036     int* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<int>(int const*, int const*, int*) [50]
-----------------------------------------------
                                                 <spontaneous>
[154]    0.2    0.00    0.00                 std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator==(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const&) const [154]
                0.00    0.00  195256/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
-----------------------------------------------
                                                 <spontaneous>
[155]    0.2    0.00    0.00                 std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::pair(int const&, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&) [155]
                0.00    0.00   97628/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00   97628/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const <cycle 1> [360]
                0.00    0.00   97628/394522      __gnu_cxx::new_allocator<int>::construct(int*, int const&) [369]
-----------------------------------------------
                               48819             std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::operator[](int const&) [156]
                0.00    0.00    3156/188964      TemporalNetwork::getNodeCount() [207]
                0.00    0.00    3156/188964      TemporalNetwork::getEventCount() [187]
                0.00    0.00    3156/188964      std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::push_back(std::pair<int, int> const&) [188]
                0.00    0.00  179496/188964      TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[156]    0.2    0.00    0.00  188964+48819   std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::operator[](int const&) [156]
                0.00    0.00  188964/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                0.00    0.00    3156/61021898     TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                               48819             std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::operator[](int const&) [156]
-----------------------------------------------
                                                 <spontaneous>
[157]    0.2    0.00    0.00                 std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator*() const [157]
                0.00    0.00   85092/425460      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::lower_bound(int const&) [90]
                0.00    0.00   85092/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
-----------------------------------------------
                                                 <spontaneous>
[158]    0.2    0.00    0.00                 std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) [158]
                0.00    0.00  255276/595644      std::pair<int, int>* std::__uninitialized_copy_a<std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int> >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [99]
-----------------------------------------------
                                                 <spontaneous>
[159]    0.2    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_key(std::_Rb_tree_node_base const*) [159]
                0.00    0.00  255276/595644      std::pair<int, int>* std::__uninitialized_copy_a<std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int> >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [99]
-----------------------------------------------
                                                 <spontaneous>
[160]    0.2    0.00    0.00                 std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::lower_bound(std::string const&) [160]
                0.00    0.00  170184/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() <cycle 1> [345]
-----------------------------------------------
                                                 <spontaneous>
[161]    0.2    0.00    0.00                 std::less<int>::operator()(int const&, int const&) const [161]
                0.00    0.00   97628/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00   97628/98110       std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map(std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > > const&) [177]
-----------------------------------------------
                                                 <spontaneous>
[162]    0.2    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_leftmost() [162]
                0.00    0.00    3224/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
-----------------------------------------------
                                                 <spontaneous>
[163]    0.2    0.00    0.00                 std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::find(int const&) [163]
                0.00    0.00  140225/61021898     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                                                 <spontaneous>
[164]    0.1    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_end() [164]
                0.00    0.00   85092/170184      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int> >*) [135]
-----------------------------------------------
                                                 <spontaneous>
[165]    0.1    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_maximum(std::_Rb_tree_node_base*) [165]
                0.00    0.00    2686/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
-----------------------------------------------
                0.00    0.00   20266/117894      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
                0.00    0.00   97628/117894      std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::~vector() [128]
[166]    0.1    0.00    0.00  117894         std::less<std::string>::operator()(std::string const&, std::string const&) const [166]
                0.00    0.00  117894/61021898     main <cycle 1> [63]
-----------------------------------------------
                                                 <spontaneous>
[167]    0.1    0.00    0.00                 std::_Rb_tree_iterator<std::pair<int const, int*> >::operator!=(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const [167]
                0.00    0.00   88589/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_begin() <cycle 1> [413]
                0.00    0.00   88589/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00     173/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator++(int) <cycle 1> [383]
-----------------------------------------------
                                                 <spontaneous>
[168]    0.1    0.00    0.00                 std::_Rb_tree_iterator<std::pair<int const, int*> >::_Rb_tree_iterator() [168]
                0.00    0.00   88616/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator++(int) <cycle 1> [383]
                0.00    0.00   88616/183457      std::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >::~allocator() [398]
-----------------------------------------------
                                                 <spontaneous>
[169]    0.1    0.00    0.00                 std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::begin() [169]
                0.00    0.00   88616/61021898     TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
-----------------------------------------------
                                                 <spontaneous>
[170]    0.1    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int> >*, std::_Rb_tree_node<std::pair<int const, int> >*, int const&) [170]
                0.00    0.00   81818/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
                0.00    0.00  252002/252002      std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_right(std::_Rb_tree_node_base const*) [393]
-----------------------------------------------
                                                 <spontaneous>
[171]    0.1    0.00    0.00                 std::__miter_base<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, false>::__b(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >) [171]
                0.00    0.00 1002016/3510052     std::string* std::__uninitialized_copy<false>::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) <cycle 4> [142]
-----------------------------------------------
                                                 <spontaneous>
[172]    0.1    0.00    0.00                 std::pair<double, int> std::make_pair<double, int>(double, int) [172]
                0.00    0.00   48736/48736       __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::__normal_iterator(std::string* const&) [178]
                0.00    0.00   48736/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00   48819/94483       std::pair<int, int>::pair(int const&, int const&) [411]
                0.00    0.00   48736/97555       __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::base() const [408]
-----------------------------------------------
                0.00    0.00  137982/137982      std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >::operator--() [174]
[173]    0.1    0.00    0.00  137982         std::pair<std::_Rb_tree_iterator<std::pair<int const, int*> >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, int*> > const&, bool const&) [173]
                0.00    0.00  137982/919006      unsigned long const& std::max<unsigned long>(unsigned long const&, unsigned long const&) [109]
                0.00    0.00  137982/276926      std::__miter_base<std::pair<int, int>*, false>::__b(std::pair<int, int>*) [386]
-----------------------------------------------
                                                 <spontaneous>
[174]    0.1    0.00    0.00                 std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >::operator--() [174]
                0.00    0.00  137982/137982      std::pair<std::_Rb_tree_iterator<std::pair<int const, int*> >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, int*> > const&, bool const&) [173]
                0.00    0.00  137982/276926      __gnu_cxx::new_allocator<TEvent>::destroy(TEvent*) [384]
-----------------------------------------------
                                                 <spontaneous>
[175]    0.1    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_right(std::_Rb_tree_node_base*) [175]
                0.00    0.00   85092/595644      std::pair<int, int>* std::__uninitialized_copy_a<std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int> >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [99]
-----------------------------------------------
                0.00    0.00     481/99872       std::vector<TEvent, std::allocator<TEvent> >::size() const [235]
                0.00    0.00    1763/99872       graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00   97628/99872       std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
[176]    0.1    0.00    0.00   99872         std::vector<int, std::allocator<int> >::begin() [176]
                0.00    0.00   99872/702469      void std::_Destroy<int*, int>(int*, int*, std::allocator<int>&) [110]
-----------------------------------------------
                0.00    0.00       1/98110       graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00     481/98110       std::_Rb_tree_const_iterator<std::pair<std::string const, int> >::_Rb_tree_const_iterator() [225]
                0.00    0.00   97628/98110       std::less<int>::operator()(int const&, int const&) const [161]
[177]    0.1    0.00    0.00   98110         std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map(std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > > const&) [177]
                0.00    0.00   98110/702469      void std::_Destroy<int*, int>(int*, int*, std::allocator<int>&) [110]
-----------------------------------------------
                0.00    0.00   48736/48736       std::pair<double, int> std::make_pair<double, int>(double, int) [172]
[178]    0.1    0.00    0.00   48736         __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::__normal_iterator(std::string* const&) [178]
                0.00    0.00   48736/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
-----------------------------------------------
                0.00    0.00       9/46720       TemporalNetwork::TemporalNetwork(bool, std::string, char) [180]
                0.00    0.00    3525/46720       TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
                0.00    0.00   43186/46720       graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[179]    0.1    0.00    0.00   46720         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::~_Rb_tree() [179]
                0.00    0.00   46711/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
-----------------------------------------------
                0.00    0.00       1/1           generate_vector_file(std::string, std::string, std::string) [12]
[180]    0.0    0.00    0.00       1         TemporalNetwork::TemporalNetwork(bool, std::string, char) [180]
                0.00    0.00   14250/61021898     TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00       9/46720       std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::~_Rb_tree() [179]
                0.00    0.00       1/61021898     TemporalNetwork::getEvents() <cycle 1> [146]
                0.00    0.00       1/61021898     std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::~map() <cycle 1> [558]
-----------------------------------------------
                0.00    0.00   94812/94812       TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
[181]    0.0    0.00    0.00   94812         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::~_Rb_tree_impl() [181]
                0.00    0.00   94812/6008019     std::pair<std::string const, std::string>::pair(std::string const&, std::string const&) [62]
-----------------------------------------------
                0.00    0.00    5932/5932        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_create_node(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 3> [56]
[182]    0.0    0.00    0.00    5932         __gnu_cxx::new_allocator<std::pair<std::string const, int> >::construct(std::pair<std::string const, int>*, std::pair<std::string const, int> const&) [182]
                0.00    0.00    5932/5932        std::pair<std::string const, int>::pair(std::pair<std::string const, int> const&) [195]
                0.00    0.00    5932/61021898     main <cycle 1> [63]
-----------------------------------------------
                                                 <spontaneous>
[183]    0.0    0.00    0.00                 bool __gnu_cxx::operator!=<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) [183]
                0.00    0.00    2675/2675        __gnu_cxx::new_allocator<TEvent>::construct(TEvent*, TEvent const&) [199]
                0.00    0.00    2675/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                0.00    0.00    2675/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const <cycle 1> [360]
-----------------------------------------------
                0.00    0.00       1/3156        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [306]
                0.00    0.00       2/3156        std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_allocate(unsigned long) [311]
                0.00    0.00      82/3156        std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_check_len(unsigned long, char const*) const [206]
                0.00    0.00    3071/3156        std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_deallocate(std::pair<int, int>*, unsigned long) [186]
[184]    0.0    0.00    0.00    3156         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [184]
                0.00    0.00    6581/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00    3156/3156        std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >::operator++() [217]
                0.00    0.00    1712/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00    1712/1205984     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node_base const*) [349]
-----------------------------------------------
                                                 <spontaneous>
[185]    0.0    0.00    0.00                 std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_Rb_tree_impl<std::less<std::pair<int, std::string> >, false>::~_Rb_tree_impl() [185]
                0.00    0.00    5932/61021898     std::vector<std::string, std::allocator<std::string> >::_M_range_check(unsigned long) const <cycle 1> [425]
                0.00    0.00    5932/12015       std::vector<std::string, std::allocator<std::string> >::operator[](unsigned long) [191]
-----------------------------------------------
                                                 <spontaneous>
[186]    0.0    0.00    0.00                 std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_deallocate(std::pair<int, int>*, unsigned long) [186]
                0.00    0.00    3071/3156        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [184]
-----------------------------------------------
                                                 <spontaneous>
[187]    0.0    0.00    0.00                 TemporalNetwork::getEventCount() [187]
                0.00    0.00    3156/776212      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
                0.00    0.00    3156/188964      std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::operator[](int const&) [156]
                0.00    0.00    3156/3156        std::vector<std::string, std::allocator<std::string> >::begin() [454]
-----------------------------------------------
                                                 <spontaneous>
[188]    0.0    0.00    0.00                 std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::push_back(std::pair<int, int> const&) [188]
                0.00    0.00    3156/188964      std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::operator[](int const&) [156]
                0.00    0.00    3156/61021898     TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00   48819/97555       __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::base() const [408]
                0.00    0.00    3156/3156        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::begin() [456]
-----------------------------------------------
                                                 <spontaneous>
[189]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, std::string> > const*) [189]
                0.00    0.00    3156/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.00    0.00    3156/3156        std::allocator<std::pair<std::string const, std::string> >::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >(std::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > > const&) [208]
-----------------------------------------------
                                                 <spontaneous>
[190]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::end() [190]
                0.00    0.00    6312/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
-----------------------------------------------
                0.00    0.00    5932/12015       std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_Rb_tree_impl<std::less<std::pair<int, std::string> >, false>::~_Rb_tree_impl() [185]
                0.00    0.00    6083/12015       std::vector<TEvent, std::allocator<TEvent> >::begin() [211]
[191]    0.0    0.00    0.00   12015         std::vector<std::string, std::allocator<std::string> >::operator[](unsigned long) [191]
                0.00    0.00    5932/5932        std::string* std::__uninitialized_move_a<std::string*, std::string*, std::allocator<std::string> >(std::string*, std::string*, std::string*, std::allocator<std::string>&) [192]
-----------------------------------------------
                0.00    0.00    5932/5932        std::vector<std::string, std::allocator<std::string> >::operator[](unsigned long) [191]
[192]    0.0    0.00    0.00    5932         std::string* std::__uninitialized_move_a<std::string*, std::string*, std::allocator<std::string> >(std::string*, std::string*, std::string*, std::allocator<std::string>&) [192]
                0.00    0.00    6083/61021898     std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
-----------------------------------------------
                                                 <spontaneous>
[193]    0.0    0.00    0.00                 std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::map() [193]
                0.00    0.00    6083/61021898     std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&) <cycle 1> [417]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_copy(std::_Rb_tree_node<std::pair<int const, int> > const*, std::_Rb_tree_node<std::pair<int const, int> >*) [55]
[194]    0.0    0.00    0.00       1         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique(std::pair<int const, int> const&) [194]
                0.00    0.00    5933/61021898     std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
                0.00    0.00       1/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
                0.00    0.00       1/61021898     std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                0.00    0.00       1/61021898     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
                0.00    0.00       1/702469      void std::_Destroy<int*, int>(int*, int*, std::allocator<int>&) [110]
                0.00    0.00       1/513180      std::allocator<std::pair<int const, int> >::~allocator() [363]
                0.00    0.00       1/1           std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator--() [579]
-----------------------------------------------
                0.00    0.00    5932/5932        __gnu_cxx::new_allocator<std::pair<std::string const, int> >::construct(std::pair<std::string const, int>*, std::pair<std::string const, int> const&) [182]
[195]    0.0    0.00    0.00    5932         std::pair<std::string const, int>::pair(std::pair<std::string const, int> const&) [195]
                0.00    0.00    5932/61021898     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&) <cycle 1> [353]
-----------------------------------------------
                                                 <spontaneous>
[196]    0.0    0.00    0.00                 std::_Rb_tree_const_iterator<std::pair<int const, int> >::operator!=(std::_Rb_tree_const_iterator<std::pair<int const, int> > const&) const [196]
                0.00    0.00    5932/61021898     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
-----------------------------------------------
                                                 <spontaneous>
[197]    0.0    0.00    0.00                 std::_Rb_tree_const_iterator<std::pair<int const, int> >::operator++() [197]
                0.00    0.00    5932/61021898     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&) <cycle 1> [353]
                0.00    0.00    5932/5932        __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >::base() const [437]
-----------------------------------------------
                                                 <spontaneous>
[198]    0.0    0.00    0.00                 std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::~_Rb_tree() [198]
                0.00    0.00    5932/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.00    0.00     151/151         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree() [515]
                0.00    0.00     151/151         std::allocator<std::_Rb_tree_node<int> >::~allocator() [509]
-----------------------------------------------
                0.00    0.00    2675/2675        bool __gnu_cxx::operator!=<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) [183]
[199]    0.0    0.00    0.00    2675         __gnu_cxx::new_allocator<TEvent>::construct(TEvent*, TEvent const&) [199]
                0.00    0.00    2675/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00    2675/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const <cycle 1> [360]
-----------------------------------------------
                0.00    0.00    4740/4740        std::allocator<std::pair<int const, int*> >::allocator<std::_Rb_tree_node<std::pair<int const, int*> > >(std::allocator<std::_Rb_tree_node<std::pair<int const, int*> > > const&) [201]
[200]    0.0    0.00    0.00    4740         std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::pair(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [200]
                0.00    0.00    4740/61021898     main <cycle 1> [63]
-----------------------------------------------
                                                 <spontaneous>
[201]    0.0    0.00    0.00                 std::allocator<std::pair<int const, int*> >::allocator<std::_Rb_tree_node<std::pair<int const, int*> > >(std::allocator<std::_Rb_tree_node<std::pair<int const, int*> > > const&) [201]
                0.00    0.00    4740/4740        std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::pair(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [200]
-----------------------------------------------
                0.00    0.00    3156/6312        std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >::operator++() [217]
                0.00    0.00    3156/6312        __gnu_cxx::new_allocator<std::pair<std::string const, std::string> >::~new_allocator() [218]
[202]    0.0    0.00    0.00    6312         void std::_Construct<std::string, std::string>(std::string*, std::string const&) [202]
                0.00    0.00    3156/776212      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
                0.00    0.00    3156/3307        __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::construct(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [451]
-----------------------------------------------
                                                 <spontaneous>
[203]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::begin() [203]
                0.00    0.00    3156/776212      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
-----------------------------------------------
                                                 <spontaneous>
[204]    0.0    0.00    0.00                 std::pair<int, int>* std::__uninitialized_move_a<std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> > >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [204]
                0.00    0.00    3071/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00    3071/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00    3071/1205984     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node_base const*) [349]
                0.00    0.00    3071/3071        std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator--() [458]
-----------------------------------------------
                0.00    0.00     781/4305        std::pair<int, std::string>::~pair() [238]
                0.00    0.00     781/4305        std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base() [237]
                0.00    0.00    2743/4305        encoding_nodeCodes::encoding_nodeCodes(encoding_nodeCodes const&) [216]
[205]    0.0    0.00    0.00    4305         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_erase(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [205]
                0.00    0.00    3524/61021898     main <cycle 1> [63]
-----------------------------------------------
                                                 <spontaneous>
[206]    0.0    0.00    0.00                 std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_check_len(unsigned long, char const*) const [206]
                0.00    0.00    3073/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00      82/3156        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [184]
                0.00    0.00      82/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00       1/1           std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [306]
                0.00    0.00    3073/1205984     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node_base const*) [349]
                0.00    0.00      82/164         std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator()(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) const [500]
-----------------------------------------------
                                                 <spontaneous>
[207]    0.0    0.00    0.00                 TemporalNetwork::getNodeCount() [207]
                0.00    0.00    3156/188964      std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::operator[](int const&) [156]
-----------------------------------------------
                0.00    0.00    3156/3156        std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, std::string> > const*) [189]
[208]    0.0    0.00    0.00    3156         std::allocator<std::pair<std::string const, std::string> >::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >(std::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > > const&) [208]
                0.00    0.00    3156/61021898     main <cycle 1> [63]
-----------------------------------------------
                                                 <spontaneous>
[209]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_get_Node_allocator() const [209]
                0.00    0.00    3156/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                                                 <spontaneous>
[210]    0.0    0.00    0.00                 std::pair<int, int>::pair<double, int>(std::pair<double, int> const&) [210]
                0.00    0.00    3156/61021898     TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00    3156/3156        std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::size() const [453]
-----------------------------------------------
                0.00    0.00     142/142         graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[211]    0.0    0.00    0.00     142         std::vector<TEvent, std::allocator<TEvent> >::begin() [211]
                0.00    0.00    6083/12015       std::vector<std::string, std::allocator<std::string> >::operator[](unsigned long) [191]
-----------------------------------------------
                                                 <spontaneous>
[212]    0.0    0.00    0.00                 std::_Vector_base<TEvent, std::allocator<TEvent> >::~_Vector_base() [212]
                0.00    0.00    2343/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&) <cycle 1> [446]
                0.00    0.00    1562/2645        std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::vector(std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&) [231]
                0.00    0.00    1562/644904      std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator*() const [359]
-----------------------------------------------
                                                 <spontaneous>
[213]    0.0    0.00    0.00                 __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::operator++() [213]
                0.00    0.00    2675/61021898     std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&) <cycle 1> [373]
-----------------------------------------------
                                                 <spontaneous>
[214]    0.0    0.00    0.00                 std::vector<std::string, std::allocator<std::string> >::end() [214]
                0.00    0.00    2675/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                0.00    0.00    3156/3276068     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map() [342]
                0.00    0.00    3156/3156        __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::__normal_iterator(std::pair<int, int>* const&) [452]
-----------------------------------------------
                                                 <spontaneous>
[215]    0.0    0.00    0.00                 std::pair<int, int> std::make_pair<int, int>(int, int) [215]
                0.00    0.00    2675/61021898     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                0.00    0.00    3524/3524        TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[216]    0.0    0.00    0.00    3524         encoding_nodeCodes::encoding_nodeCodes(encoding_nodeCodes const&) [216]
                0.00    0.00    2743/4305        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_erase(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [205]
                0.00    0.00     781/321671      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) [381]
-----------------------------------------------
                0.00    0.00    3156/3156        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [184]
[217]    0.0    0.00    0.00    3156         std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >::operator++() [217]
                0.00    0.00    3156/6312        void std::_Construct<std::string, std::string>(std::string*, std::string const&) [202]
-----------------------------------------------
                                                 <spontaneous>
[218]    0.0    0.00    0.00                 __gnu_cxx::new_allocator<std::pair<std::string const, std::string> >::~new_allocator() [218]
                0.00    0.00    3156/6312        void std::_Construct<std::string, std::string>(std::string*, std::string const&) [202]
-----------------------------------------------
                                                 <spontaneous>
[219]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl(std::less<int> const&, std::allocator<std::_Rb_tree_node<std::pair<int const, int> > > const&) [219]
                0.00    0.00      37/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
                0.00    0.00    5932/513180      std::allocator<std::pair<int const, int> >::~allocator() [363]
                0.00    0.00      18/36          std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_value(std::_Rb_tree_node_base const*) [545]
-----------------------------------------------
                0.00    0.00     781/781         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_begin() [223]
[220]    0.0    0.00    0.00     781         std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::~_Vector_base() [220]
                0.00    0.00    1562/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, int const&) <cycle 1> [371]
                0.00    0.00    1562/3426        __gnu_cxx::new_allocator<std::pair<std::string const, int> >::destroy(std::pair<std::string const, int>*) [450]
-----------------------------------------------
                0.00    0.00     630/630         std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const&) [222]
[221]    0.0    0.00    0.00     630         std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size() const [221]
                0.00    0.00    1562/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
-----------------------------------------------
                                                 <spontaneous>
[222]    0.0    0.00    0.00                 std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const&) [222]
                0.00    0.00     630/630         std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size() const [221]
-----------------------------------------------
                                                 <spontaneous>
[223]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_begin() [223]
                0.00    0.00     781/781         std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::~_Vector_base() [220]
-----------------------------------------------
                                                 <spontaneous>
[224]    0.0    0.00    0.00                 std::_Rb_tree_iterator<std::pair<int const, int> >::operator->() const [224]
                0.00    0.00     308/308         std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::insert(std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) [226]
                0.00    0.00     308/308         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [249]
-----------------------------------------------
                                                 <spontaneous>
[225]    0.0    0.00    0.00                 std::_Rb_tree_const_iterator<std::pair<std::string const, int> >::_Rb_tree_const_iterator() [225]
                0.00    0.00     962/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                0.00    0.00     481/98110       std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map(std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > > const&) [177]
-----------------------------------------------
                0.00    0.00     308/308         std::_Rb_tree_iterator<std::pair<int const, int> >::operator->() const [224]
[226]    0.0    0.00    0.00     308         std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::insert(std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) [226]
                0.00    0.00    1066/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                                                 <spontaneous>
[227]    0.0    0.00    0.00                 std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::begin() [227]
                0.00    0.00     962/61021898     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                                                 <spontaneous>
[228]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, int> >, std::pair<std::string const, int> const&) [228]
                0.00    0.00       1/1           std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, int> const&) [243]
                0.00    0.00     150/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [344]
                0.00    0.00     150/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.00    0.00     450/600         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) [476]
                0.00    0.00     151/327354      std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::~allocator() [377]
                0.00    0.00     151/151         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_value(std::_Rb_tree_node_base const*) [513]
                0.00    0.00     150/151         std::_Select1st<std::pair<std::string const, int> >::operator()(std::pair<std::string const, int> const&) const [506]
-----------------------------------------------
                                                 <spontaneous>
[229]    0.0    0.00    0.00                 __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::difference_type __gnu_cxx::operator-<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [229]
                0.00    0.00    3073/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00    3075/3077        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_leftmost() [457]
-----------------------------------------------
                                                 <spontaneous>
[230]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_root() const [230]
                0.00    0.00      18/44716       std::_Select1st<std::pair<int const, int> >::operator()(std::pair<int const, int> const&) const <cycle 3> [423]
                0.00    0.00      18/61021898     __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
-----------------------------------------------
                0.00    0.00     302/2645        std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_end() [288]
                0.00    0.00     781/2645        void std::_Destroy<TEvent*, TEvent>(TEvent*, TEvent*, std::allocator<TEvent>&) [268]
                0.00    0.00    1562/2645        std::_Vector_base<TEvent, std::allocator<TEvent> >::~_Vector_base() [212]
[231]    0.0    0.00    0.00    2645         std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::vector(std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&) [231]
                0.00    0.00     781/781         std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl() [232]
                0.00    0.00    1562/1562        void std::_Destroy<std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*) [465]
-----------------------------------------------
                0.00    0.00     781/781         std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::vector(std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&) [231]
[232]    0.0    0.00    0.00     781         std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl() [232]
                0.00    0.00     781/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
-----------------------------------------------
                                                 <spontaneous>
[233]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::key_comp() const [233]
                0.00    0.00     781/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, int const&) <cycle 1> [371]
-----------------------------------------------
                                                 <spontaneous>
[234]    0.0    0.00    0.00                 std::_Vector_base<TEvent, std::allocator<TEvent> >::_M_get_Tp_allocator() [234]
                0.00    0.00     781/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&) <cycle 1> [446]
-----------------------------------------------
                                                 <spontaneous>
[235]    0.0    0.00    0.00                 std::vector<TEvent, std::allocator<TEvent> >::size() const [235]
                0.00    0.00     481/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const <cycle 1> [360]
                0.00    0.00     481/99872       std::vector<int, std::allocator<int> >::begin() [176]
                0.00    0.00     481/3276068     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map() [342]
-----------------------------------------------
                                                 <spontaneous>
[236]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [236]
                0.00    0.00     283/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_begin() <cycle 1> [413]
                0.00    0.00     283/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.00    0.00     283/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00     566/566         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::get_allocator() const [478]
-----------------------------------------------
                                                 <spontaneous>
[237]    0.0    0.00    0.00                 std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base() [237]
                0.00    0.00     781/4305        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_erase(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [205]
-----------------------------------------------
                                                 <spontaneous>
[238]    0.0    0.00    0.00                 std::pair<int, std::string>::~pair() [238]
                0.00    0.00     781/4305        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_erase(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [205]
-----------------------------------------------
                                                 <spontaneous>
[239]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::get_allocator() const [239]
                0.00    0.00     315/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.00    0.00     315/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_create_node(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [448]
-----------------------------------------------
                0.00    0.00       1/152         __gnu_cxx::new_allocator<std::string>::deallocate(std::string*, unsigned long) [313]
                0.00    0.00     151/152         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_leftmost() [244]
[240]    0.0    0.00    0.00     152         TEvent* std::__copy_move<false, true, std::random_access_iterator_tag>::__copy_m<TEvent>(TEvent const*, TEvent const*, TEvent*) [240]
                0.00    0.00     302/61021898     __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::construct(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [472]
                0.00    0.00     302/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
-----------------------------------------------
                                                 <spontaneous>
[241]    0.0    0.00    0.00                 std::_Rb_tree_iterator<std::pair<std::string const, int> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<std::string const, int> >*) [241]
                0.00    0.00     302/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&) <cycle 1> [446]
                0.00    0.00     302/302         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::get_allocator() const [255]
-----------------------------------------------
                                                 <spontaneous>
[242]    0.0    0.00    0.00                 std::string* std::copy_backward<std::string*, std::string*>(std::string*, std::string*, std::string*) [242]
                0.00    0.00     604/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, int> >, std::pair<std::string const, int> const&) [228]
[243]    0.0    0.00    0.00       1         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, int> const&) [243]
                0.00    0.00     151/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
                0.00    0.00     151/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00     150/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [344]
                0.00    0.00     150/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.00    0.00     150/600         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) [476]
                0.00    0.00       1/327052      std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::~_Rb_tree_impl() [379]
-----------------------------------------------
                                                 <spontaneous>
[244]    0.0    0.00    0.00                 std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_leftmost() [244]
                0.00    0.00     151/152         TEvent* std::__copy_move<false, true, std::random_access_iterator_tag>::__copy_m<TEvent>(TEvent const*, TEvent const*, TEvent*) [240]
-----------------------------------------------
                                                 <spontaneous>
[245]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::end() [245]
                0.00    0.00     286/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_begin() <cycle 1> [413]
                0.00    0.00     286/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                                                 <spontaneous>
[246]    0.0    0.00    0.00                 std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_Rb_tree_impl<std::less<std::pair<int, std::string> >, false>::_Rb_tree_impl() [246]
                0.00    0.00     342/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                0.00    0.00     100/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
-----------------------------------------------
                                                 <spontaneous>
[247]    0.0    0.00    0.00                 std::_Vector_base<std::string, std::allocator<std::string> >::~_Vector_base() [247]
                0.00    0.00     384/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                                                 <spontaneous>
[248]    0.0    0.00    0.00                 __gnu_cxx::new_allocator<std::string>::construct(std::string*, std::string const&) [248]
                0.00    0.00     200/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                0.00    0.00     100/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.00    0.00      42/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) <cycle 1> [522]
-----------------------------------------------
                                 308             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [249]
                0.00    0.00     308/308         std::_Rb_tree_iterator<std::pair<int const, int> >::operator->() const [224]
[249]    0.0    0.00    0.00     308+308     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [249]
                0.00    0.00     166/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                0.00    0.00     166/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.00    0.00     142/942         std::pair<std::pair<int, std::string> const, int>::pair(std::pair<int, std::string> const&, int const&) [468]
                                 308             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [249]
-----------------------------------------------
                                                 <spontaneous>
[250]    0.0    0.00    0.00                 std::_Vector_base<std::string, std::allocator<std::string> >::_Vector_base() [250]
                0.00    0.00     158/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                0.00    0.00     158/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
-----------------------------------------------
                                                 <spontaneous>
[251]    0.0    0.00    0.00                 __gnu_cxx::new_allocator<std::pair<std::string const, std::string> >::destroy(std::pair<std::string const, std::string>*) [251]
                0.00    0.00     315/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                                                 <spontaneous>
[252]    0.0    0.00    0.00                 std::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::~allocator() [252]
                0.00    0.00     308/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                0.00    0.00     308/942         std::pair<std::pair<int, std::string> const, int>::pair(std::pair<int, std::string> const&, int const&) [468]
-----------------------------------------------
                                                 <spontaneous>
[253]    0.0    0.00    0.00                 std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_Rb_tree() [253]
                0.00    0.00     308/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                0.00    0.00       1/2           bool __gnu_cxx::operator!=<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > const&, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > const&) [273]
                0.00    0.00       1/2           std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [272]
[254]    0.0    0.00    0.00       2         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_erase(std::_Rb_tree_node<int>*) [254]
                0.00    0.00     151/151         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() [258]
                0.00    0.00       2/61021898     __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) <cycle 1> [419]
                0.00    0.00     151/151         __gnu_cxx::new_allocator<std::string>::destroy(std::string*) [503]
-----------------------------------------------
                0.00    0.00     302/302         std::_Rb_tree_iterator<std::pair<std::string const, int> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<std::string const, int> >*) [241]
[255]    0.0    0.00    0.00     302         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::get_allocator() const [255]
                0.00    0.00     302/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
-----------------------------------------------
                0.00    0.00     302/302         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node_base const*) [261]
[256]    0.0    0.00    0.00     302         std::allocator<TEvent>::allocator() [256]
                0.00    0.00     302/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
-----------------------------------------------
                0.00    0.00     302/302         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::lower_bound(std::string const&) [260]
[257]    0.0    0.00    0.00     302         std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::~allocator() [257]
                0.00    0.00     302/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
-----------------------------------------------
                0.00    0.00     151/151         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_erase(std::_Rb_tree_node<int>*) [254]
[258]    0.0    0.00    0.00     151         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() [258]
                0.00    0.00     151/61021898     std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
                0.00    0.00     151/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
-----------------------------------------------
                                                 <spontaneous>
[259]    0.0    0.00    0.00                 __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::destroy(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >*) [259]
                0.00    0.00     302/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
-----------------------------------------------
                                                 <spontaneous>
[260]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::lower_bound(std::string const&) [260]
                0.00    0.00     302/302         std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::~allocator() [257]
                0.00    0.00     302/302         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() [490]
-----------------------------------------------
                                                 <spontaneous>
[261]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node_base const*) [261]
                0.00    0.00     302/302         std::allocator<TEvent>::allocator() [256]
                0.00    0.00     302/1864        std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, int> >*) [461]
                0.00    0.00     302/3426        __gnu_cxx::new_allocator<std::pair<std::string const, int> >::destroy(std::pair<std::string const, int>*) [450]
-----------------------------------------------
                                                 <spontaneous>
[262]    0.0    0.00    0.00                 std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_destroy_node(std::_Rb_tree_node<int>*) [262]
                0.00    0.00     300/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
                0.00    0.00       1/1           std::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::allocator() [576]
-----------------------------------------------
                                                 <spontaneous>
[263]    0.0    0.00    0.00                 std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_right(std::_Rb_tree_node_base*) [263]
                0.00    0.00     150/61021898     __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) <cycle 1> [419]
                0.00    0.00     150/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
-----------------------------------------------
                                                 <spontaneous>
[264]    0.0    0.00    0.00                 std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::operator==(std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> > const&) const [264]
                0.00    0.00     284/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                                                 <spontaneous>
[265]    0.0    0.00    0.00                 std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [265]
                0.00    0.00     284/61021898     std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                0.00    0.00     142/142         __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::__normal_iterator(TEvent* const&) [518]
-----------------------------------------------
                                                 <spontaneous>
[266]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_left(std::_Rb_tree_node_base*) [266]
                0.00    0.00     283/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                                                 <spontaneous>
[267]    0.0    0.00    0.00                 __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >::__normal_iterator(TEvent const* const&) [267]
                0.00    0.00     481/702469      void std::_Destroy<int*, int>(int*, int*, std::allocator<int>&) [110]
                0.00    0.00     481/138944      std::pair<int, int>* std::__copy_move_backward_a2<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [403]
-----------------------------------------------
                                                 <spontaneous>
[268]    0.0    0.00    0.00                 void std::_Destroy<TEvent*, TEvent>(TEvent*, TEvent*, std::allocator<TEvent>&) [268]
                0.00    0.00     781/2645        std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::vector(std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&) [231]
-----------------------------------------------
                0.00    0.00     164/164         std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> > const&) [270]
[269]    0.0    0.00    0.00     164         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::end() [269]
                0.00    0.00     164/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                                                 <spontaneous>
[270]    0.0    0.00    0.00                 std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> > const&) [270]
                0.00    0.00     164/164         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::end() [269]
-----------------------------------------------
                                                 <spontaneous>
[271]    0.0    0.00    0.00                 std::_Vector_base<std::string, std::allocator<std::string> >::_Vector_impl::~_Vector_impl() [271]
                0.00    0.00     158/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                                                 <spontaneous>
[272]    0.0    0.00    0.00                 std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [272]
                0.00    0.00       1/2           std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_erase(std::_Rb_tree_node<int>*) [254]
                0.00    0.00       1/61021898     std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&) <cycle 1> [417]
-----------------------------------------------
                0.00    0.00       2/2           graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[273]    0.0    0.00    0.00       2         bool __gnu_cxx::operator!=<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > const&, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > const&) [273]
                0.00    0.00       1/2           std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_erase(std::_Rb_tree_node<int>*) [254]
-----------------------------------------------
                                                 <spontaneous>
[274]    0.0    0.00    0.00                 std::_Vector_base<int, std::allocator<int> >::_Vector_base(unsigned long, std::allocator<int> const&) [274]
                0.00    0.00      76/61021898     std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
                0.00    0.00      38/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
                0.00    0.00      38/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                                                 <spontaneous>
[275]    0.0    0.00    0.00                 __gnu_cxx::new_allocator<std::_Rb_tree_node<int> >::new_allocator() [275]
                0.00    0.00     151/61021898     main <cycle 1> [63]
-----------------------------------------------
                                                 <spontaneous>
[276]    0.0    0.00    0.00                 std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::end() [276]
                0.00    0.00     151/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&) <cycle 1> [446]
-----------------------------------------------
                                                 <spontaneous>
[277]    0.0    0.00    0.00                 std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_right(std::_Rb_tree_node_base const*) [277]
                0.00    0.00     151/61021898     __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) <cycle 1> [419]
-----------------------------------------------
                                                 <spontaneous>
[278]    0.0    0.00    0.00                 __gnu_cxx::new_allocator<std::_Rb_tree_node<int> >::~new_allocator() [278]
                0.00    0.00     150/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
-----------------------------------------------
                                                 <spontaneous>
[279]    0.0    0.00    0.00                 std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_left(std::_Rb_tree_node_base*) [279]
                0.00    0.00     150/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
-----------------------------------------------
                                                 <spontaneous>
[280]    0.0    0.00    0.00                 std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::begin() [280]
                0.00    0.00     164/870476      std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::begin() [97]
                0.00    0.00     164/171         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::~_Rb_tree() [293]
-----------------------------------------------
                                                 <spontaneous>
[281]    0.0    0.00    0.00                 initialize_gdvs(int) [281]
                0.00    0.00     142/61021898     TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
-----------------------------------------------
                                                 <spontaneous>
[282]    0.0    0.00    0.00                 __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::base() const [282]
                0.00    0.00     142/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                                                 <spontaneous>
[283]    0.0    0.00    0.00                 std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_right(std::_Rb_tree_node_base*) [283]
                0.00    0.00     142/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [462]
-----------------------------------------------
                                                 <spontaneous>
[284]    0.0    0.00    0.00                 __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<int const, int> > >::deallocate(std::_Rb_tree_node<std::pair<int const, int> >*, unsigned long) [284]
                0.00    0.00     141/61021898     main <cycle 1> [63]
-----------------------------------------------
[285]    0.0    0.00    0.00     196+221     <cycle 2 as a whole> [285]
                0.00    0.00     217             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
                0.00    0.00     133+22          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
                0.00    0.00      44             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int*> >*, std::_Rb_tree_node<std::pair<int const, int*> >*, int const&) <cycle 2> [534]
                0.00    0.00      22             std::allocator<std::_Rb_tree_node<std::pair<int const, int*> > >::allocator() <cycle 2> [550]
                0.00    0.00       1             __gnu_cxx::new_allocator<std::pair<int const, int*> >::destroy(std::pair<int const, int*>*) <cycle 2> [572]
-----------------------------------------------
                                  22             std::allocator<std::_Rb_tree_node<std::pair<int const, int*> > >::allocator() <cycle 2> [550]
                                  88             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int*> >*, std::_Rb_tree_node<std::pair<int const, int*> >*, int const&) <cycle 2> [534]
                0.00    0.00       1/196         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, int*> >*) [331]
                0.00    0.00      22/196         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::lower_bound(int const&) [305]
                0.00    0.00      84/196         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
[286]    0.0    0.00    0.00     217         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
                0.00    0.00     428/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00     428/2556        std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&) [460]
                0.00    0.00     428/473         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int*> >*) [481]
                0.00    0.00      21/604         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_create_node(int const&) [474]
                                  21             std::allocator<std::_Rb_tree_node<std::pair<int const, int*> > >::allocator() <cycle 2> [550]
                                   1             __gnu_cxx::new_allocator<std::pair<int const, int*> >::destroy(std::pair<int const, int*>*) <cycle 2> [572]
-----------------------------------------------
                                                 <spontaneous>
[287]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::find(std::string const&) [287]
                0.00    0.00      81/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.00    0.00      26/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_begin() <cycle 1> [413]
                0.00    0.00      26/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
-----------------------------------------------
                                                 <spontaneous>
[288]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_end() [288]
                0.00    0.00     302/2645        std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::vector(std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&) [231]
-----------------------------------------------
                                 104             std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
                0.00    0.00       1/903206      std::set<int, std::less<int>, std::allocator<int> >::insert(int const&) [337]
                0.00    0.00       1/903206      std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int*> const&) [330]
                0.00    0.00      44/903206      std::set<int, std::less<int>, std::allocator<int> >::set() [336]
                0.00    0.00      44/903206      std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::~_Rb_tree() [307]
                0.00    0.00     128/903206      std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char) [335]
                0.00    0.00  902988/903206      std::allocator<std::_Rb_tree_node<std::pair<std::string const, int> > >::allocator() [290]
[289]    0.0    0.00    0.00  903206+104     std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
                0.00    0.00      84/196         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
                0.00    0.00      42/196         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
                0.00    0.00      28/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00     176/242         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_Rb_tree_impl() [495]
                0.00    0.00      22/44          std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_S_key(std::_Rb_tree_node_base const*) [535]
                0.00    0.00      22/22          std::_Rb_tree_iterator<std::pair<int const, int*> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<int const, int*> >*) [552]
                0.00    0.00       1/1           __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >::~new_allocator() [571]
                0.00    0.00       1/1           std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_right(std::_Rb_tree_node_base*) [581]
                                 104             std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
-----------------------------------------------
                                                 <spontaneous>
[290]    0.0    0.00    0.00                 std::allocator<std::_Rb_tree_node<std::pair<std::string const, int> > >::allocator() [290]
                0.00    0.00  902988/903206      std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
-----------------------------------------------
                                                 <spontaneous>
[291]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() [291]
                0.00    0.00     286/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00     289/292         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [492]
-----------------------------------------------
                                                 <spontaneous>
[292]    0.0    0.00    0.00                 std::pair<int, int>* std::copy_backward<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [292]
                0.00    0.00      82/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00      83/83          std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::size() const [530]
                0.00    0.00      82/1205984     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node_base const*) [349]
                0.00    0.00      82/164         std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator()(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) const [500]
-----------------------------------------------
                0.00    0.00       7/171         TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00     164/171         std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::begin() [280]
[293]    0.0    0.00    0.00     171         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::~_Rb_tree() [293]
                0.00    0.00     164/870476      std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::begin() [97]
                0.00    0.00       3/3           std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int*> >*) [566]
                0.00    0.00       2/2           std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_begin() [569]
-----------------------------------------------
                                                 <spontaneous>
[294]    0.0    0.00    0.00                 std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::insert(std::_Rb_tree_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) [294]
                0.00    0.00      29/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
                0.00    0.00      26/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.00    0.00     315/183965      std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree() [396]
-----------------------------------------------
                              870335             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                                   1             std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::lower_bound(int const&) <cycle 1> [580]
                               89371             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_begin() <cycle 1> [413]
                               89371             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) <cycle 1> [367]
                              148792             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::find(int const&) <cycle 1> [400]
                              240528             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::end() <cycle 1> [395]
                0.00    0.00       1/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator*() const [326]
                0.00    0.00       3/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_right(std::_Rb_tree_node_base*) [317]
                0.00    0.00       3/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_end() [316]
                0.00    0.00      26/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::insert(std::_Rb_tree_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) [294]
                0.00    0.00      81/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::find(std::string const&) [287]
                0.00    0.00     164/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::end() [269]
                0.00    0.00     283/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_left(std::_Rb_tree_node_base*) [266]
                0.00    0.00     283/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [236]
                0.00    0.00     286/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::end() [245]
                0.00    0.00     315/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::get_allocator() const [239]
                0.00    0.00     315/61021898     __gnu_cxx::new_allocator<std::pair<std::string const, std::string> >::destroy(std::pair<std::string const, std::string>*) [251]
                0.00    0.00    3156/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, std::string> > const*) [189]
                0.00    0.00    3156/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_get_Node_allocator() const [209]
                0.02    0.01  870148/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_erase(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [22]
[295]    0.0    0.00    0.00 1446283+870335  std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.00    0.00     187/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00    8076/8076        std::_Rb_tree_const_iterator<std::pair<int const, int*> >::operator--() [432]
                0.00    0.00    3156/3156        std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_S_right(std::_Rb_tree_node_base const*) [455]
                0.00    0.00    1601/2556        std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&) [460]
                0.00    0.00     193/183965      std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree() [396]
                0.00    0.00       3/183462      std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::end() [397]
                              870463             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() <cycle 1> [119]
                                6312             std::_Rb_tree_const_iterator<std::pair<int const, int*> >::operator++() <cycle 1> [433]
                                 318             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) <cycle 1> [367]
                                 187             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_begin() <cycle 1> [413]
                                 167             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                                   3             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
                              870335             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                                                 <spontaneous>
[296]    0.0    0.00    0.00                 split(std::string const&, char) [296]
                0.00    0.00      43/61021898     std::vector<int, std::allocator<int> >::push_back(int const&) <cycle 1> [494]
                0.00    0.00       1/6           bool __gnu_cxx::operator!=<int*, std::vector<int, std::allocator<int> > >(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&) [310]
                0.00    0.00       1/61021898     TemporalNetwork::getEvents() <cycle 1> [146]
-----------------------------------------------
                                 315             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
[297]    0.0    0.00    0.00     315         std::pair<std::string const, std::string>::~pair() <cycle 1> [297]
                0.00    0.00     315/6008019     std::pair<std::string const, std::string>::pair(std::string const&, std::string const&) [62]
                                 315             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::~_Rb_tree() <cycle 1> [424]
-----------------------------------------------
                                                 <spontaneous>
[298]    0.0    0.00    0.00                 std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::operator*() const [298]
                0.00    0.00      42/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                                                 <spontaneous>
[299]    0.0    0.00    0.00                 std::_Rb_tree_iterator<std::pair<int const, int> >::operator!=(std::_Rb_tree_iterator<std::pair<int const, int> > const&) const [299]
                0.00    0.00      42/61021898     std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) <cycle 1> [497]
-----------------------------------------------
                                                 <spontaneous>
[300]    0.0    0.00    0.00                 void std::_Destroy<std::string*, std::string>(std::string*, std::string*, std::allocator<std::string>&) [300]
                0.00    0.00      42/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                0.00    0.00      10/10          TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[301]    0.0    0.00    0.00      10         std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::~map() [301]
                0.00    0.00      29/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
-----------------------------------------------
                0.00    0.00      44/44          graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[302]    0.0    0.00    0.00      44         std::vector<std::string, std::allocator<std::string> >::at(unsigned long) [302]
                0.00    0.00      44/196         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
-----------------------------------------------
                                                 <spontaneous>
[303]    0.0    0.00    0.00                 __gnu_cxx::new_allocator<int>::new_allocator() [303]
                0.00    0.00      22/61021898     TEvent* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<TEvent>(TEvent const*, TEvent const*, TEvent*) <cycle 1> [483]
-----------------------------------------------
                                                 <spontaneous>
[304]    0.0    0.00    0.00                 std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~map() [304]
                0.00    0.00      20/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
-----------------------------------------------
                                                 <spontaneous>
[305]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::lower_bound(int const&) [305]
                0.00    0.00      22/196         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
                0.00    0.00      22/604         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_create_node(int const&) [474]
-----------------------------------------------
                0.00    0.00       1/1           std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_check_len(unsigned long, char const*) const [206]
[306]    0.0    0.00    0.00       1         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [306]
                0.00    0.00       1/3156        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [184]
                0.00    0.00       2/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00       1/61021898     std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&) <cycle 1> [373]
                0.00    0.00       1/1           __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::deallocate(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, unsigned long) [323]
                0.00    0.00       1/1           __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::~new_allocator() [573]
                0.00    0.00       1/94483       std::pair<int, int>::pair(int const&, int const&) [411]
-----------------------------------------------
                                                 <spontaneous>
[307]    0.0    0.00    0.00                 std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::~_Rb_tree() [307]
                0.00    0.00      22/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00      44/903206      std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
-----------------------------------------------
                                                 <spontaneous>
[308]    0.0    0.00    0.00                 std::_Rb_tree_const_iterator<std::pair<int const, int*> >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) [308]
                0.00    0.00      21/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00      21/242         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_Rb_tree_impl() [495]
-----------------------------------------------
                                                 <spontaneous>
[309]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [309]
                0.00    0.00      21/2438083     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [76]
                0.00    0.00      21/242         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_Rb_tree_impl() [495]
                0.00    0.00      21/604         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_create_node(int const&) [474]
-----------------------------------------------
                0.00    0.00       1/6           graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00       1/6           split(std::string const&, char) [296]
                0.00    0.00       1/6           generate_vector_file(std::string, std::string, std::string) [12]
                0.00    0.00       3/6           graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[310]    0.0    0.00    0.00       6         bool __gnu_cxx::operator!=<int*, std::vector<int, std::allocator<int> > >(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&) [310]
                0.00    0.00       6/61021898     std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
-----------------------------------------------
                                                 <spontaneous>
[311]    0.0    0.00    0.00                 std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_allocate(unsigned long) [311]
                0.00    0.00       2/3156        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [184]
                0.00    0.00       2/3077        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_leftmost() [457]
-----------------------------------------------
                                                 <spontaneous>
[312]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique(std::pair<std::string const, int> const&) [312]
                0.00    0.00       1/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00       1/2           std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::end() [318]
                0.00    0.00       1/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.00    0.00       1/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
                0.00    0.00       1/327354      std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::~allocator() [377]
                0.00    0.00       1/151         std::_Select1st<std::pair<std::string const, int> >::operator()(std::pair<std::string const, int> const&) const [506]
-----------------------------------------------
                                                 <spontaneous>
[313]    0.0    0.00    0.00                 __gnu_cxx::new_allocator<std::string>::deallocate(std::string*, unsigned long) [313]
                0.00    0.00       1/152         TEvent* std::__copy_move<false, true, std::random_access_iterator_tag>::__copy_m<TEvent>(TEvent const*, TEvent const*, TEvent*) [240]
-----------------------------------------------
                0.00    0.00      42/93          graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00      51/93          graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[314]    0.0    0.00    0.00      93         std::vector<int, std::allocator<int> >::~vector() [314]
                0.00    0.00       3/61021898     std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
-----------------------------------------------
                                                 <spontaneous>
[315]    0.0    0.00    0.00                 std::vector<int, std::allocator<int> >::vector() [315]
                0.00    0.00       3/61021898     std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
-----------------------------------------------
                                                 <spontaneous>
[316]    0.0    0.00    0.00                 std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_end() [316]
                0.00    0.00       3/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                                                 <spontaneous>
[317]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_right(std::_Rb_tree_node_base*) [317]
                0.00    0.00       3/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                0.00    0.00       1/2           std::vector<TEvent, std::allocator<TEvent> >::~vector() [321]
                0.00    0.00       1/2           std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique(std::pair<std::string const, int> const&) [312]
[318]    0.0    0.00    0.00       2         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::end() [318]
                0.00    0.00       2/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
-----------------------------------------------
                                                 <spontaneous>
[319]    0.0    0.00    0.00                 std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_Rb_tree_impl<std::less<std::pair<int, std::string> >, false>::_M_initialize() [319]
                0.00    0.00       1/61021898     std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                0.00    0.00       1/61021898     std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
-----------------------------------------------
                0.00    0.00       1/45          TemporalNetwork::getEvents() <cycle 1> [146]
                0.00    0.00      22/45          std::set<int, std::less<int>, std::allocator<int> >::count(int const&) const [332]
                0.00    0.00      22/45          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_value(std::_Rb_tree_node_base const*) [333]
[320]    0.0    0.00    0.00      45         std::vector<std::string, std::allocator<std::string> >::push_back(std::string const&) [320]
                0.00    0.00       2/196         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
                0.00    0.00       1/21595       std::vector<std::string, std::allocator<std::string> >::~vector() [421]
-----------------------------------------------
                0.00    0.00      66/23019       graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00   22953/23019       TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[321]    0.0    0.00    0.00   23019         std::vector<TEvent, std::allocator<TEvent> >::~vector() [321]
                0.00    0.00       1/2           std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::end() [318]
-----------------------------------------------
                0.00    0.00    5932/11867       std::_Vector_base<int, std::allocator<int> >::_Vector_impl::~_Vector_impl() [334]
                0.00    0.00    5935/11867       graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[322]    0.0    0.00    0.00   11867         std::pair<int, std::string> std::make_pair<int, std::string>(int, std::string) [322]
                0.00    0.00       1/61021898     std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [306]
[323]    0.0    0.00    0.00       1         __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::deallocate(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, unsigned long) [323]
                0.00    0.00       1/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
-----------------------------------------------
                                                 <spontaneous>
[324]    0.0    0.00    0.00                 __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::destroy(std::pair<std::pair<int, std::string> const, int>*) [324]
                0.00    0.00       1/61021898     __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) <cycle 1> [419]
-----------------------------------------------
                                                 <spontaneous>
[325]    0.0    0.00    0.00                 __gnu_cxx::new_allocator<std::pair<std::string const, std::string> >::construct(std::pair<std::string const, std::string>*, std::pair<std::string const, std::string> const&) [325]
                0.00    0.00       1/61021898     main <cycle 1> [63]
-----------------------------------------------
                                                 <spontaneous>
[326]    0.0    0.00    0.00                 std::_Rb_tree_iterator<std::pair<int const, int*> >::operator*() const [326]
                0.00    0.00       1/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                                                 <spontaneous>
[327]    0.0    0.00    0.00                 std::allocator<std::string>::allocator() [327]
                0.00    0.00       1/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
-----------------------------------------------
                                                 <spontaneous>
[328]    0.0    0.00    0.00                 std::allocator<std::string>::~allocator() [328]
                0.00    0.00       1/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
-----------------------------------------------
                                                 <spontaneous>
[329]    0.0    0.00    0.00                 std::pair<int, std::string>::pair(std::pair<int, std::string> const&) [329]
                0.00    0.00       1/61021898     std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) <cycle 1> [567]
-----------------------------------------------
                                                 <spontaneous>
[330]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int*> const&) [330]
                0.00    0.00       1/196         std::allocator<std::_Rb_tree_node<std::pair<int const, int*> > >::allocator() <cycle 2> [550]
                0.00    0.00       1/903206      std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
                0.00    0.00       1/1           __gnu_cxx::new_allocator<int>::new_allocator(__gnu_cxx::new_allocator<int> const&) [574]
-----------------------------------------------
                                                 <spontaneous>
[331]    0.0    0.00    0.00                 std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, int*> >*) [331]
                0.00    0.00       1/196         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
-----------------------------------------------
                                                 <spontaneous>
[332]    0.0    0.00    0.00                 std::set<int, std::less<int>, std::allocator<int> >::count(int const&) const [332]
                0.00    0.00      22/45          std::vector<std::string, std::allocator<std::string> >::push_back(std::string const&) [320]
                0.00    0.00      44/88          std::_Rb_tree_const_iterator<int>::operator==(std::_Rb_tree_const_iterator<int> const&) const [528]
-----------------------------------------------
                                                 <spontaneous>
[333]    0.0    0.00    0.00                 std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_value(std::_Rb_tree_node_base const*) [333]
                0.00    0.00      22/45          std::vector<std::string, std::allocator<std::string> >::push_back(std::string const&) [320]
-----------------------------------------------
                                                 <spontaneous>
[334]    0.0    0.00    0.00                 std::_Vector_base<int, std::allocator<int> >::_Vector_impl::~_Vector_impl() [334]
                0.00    0.00    5932/11867       std::pair<int, std::string> std::make_pair<int, std::string>(int, std::string) [322]
                0.00    0.00    5932/5932        std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_get_Node_allocator() const [438]
-----------------------------------------------
                0.00    0.00      44/170         std::set<int, std::less<int>, std::allocator<int> >::set() [336]
                0.00    0.00     126/170         graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[335]    0.0    0.00    0.00     170         std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char) [335]
                0.00    0.00     128/903206      std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
-----------------------------------------------
                                                 <spontaneous>
[336]    0.0    0.00    0.00                 std::set<int, std::less<int>, std::allocator<int> >::set() [336]
                0.00    0.00      44/903206      std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
                0.00    0.00      44/170         std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char) [335]
-----------------------------------------------
                0.00    0.00       1/1           TemporalNetwork::getEvents() <cycle 1> [146]
[337]    0.0    0.00    0.00       1         std::set<int, std::less<int>, std::allocator<int> >::insert(int const&) [337]
                0.00    0.00       1/903206      std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
-----------------------------------------------
                0.00    0.00       3/3276068     TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
                0.00    0.00     481/3276068     std::vector<TEvent, std::allocator<TEvent> >::size() const [235]
                0.00    0.00    3156/3276068     std::vector<std::string, std::allocator<std::string> >::end() [214]
                0.00    0.00  130755/3276068     getNodeSet(std::vector<TEvent, std::allocator<TEvent> >*) [17]
                0.00    0.00  135307/3276068     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
                0.00    0.00  359260/3276068     encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
                0.00    0.00  390512/3276068     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00  577249/3276068     graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00 1679345/3276068     std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
[342]    0.0    0.00    0.00 3276068         std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map() [342]
-----------------------------------------------
                             2089124             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                0.00    0.00  252002/61021898     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::key_comp() const [137]
                0.00    0.00  252002/61021898     std::pair<int const, int>::pair(int const&, int const&) [86]
                0.00    0.00  252002/61021898     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::insert(std::_Rb_tree_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) [74]
[343]    0.0    0.00    0.00 2845130         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int> >*) <cycle 1> [343]
                             1087108             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                             1087108             TEvent* std::__uninitialized_copy_a<TEvent*, TEvent*, TEvent>(TEvent*, TEvent*, TEvent*, std::allocator<TEvent>&) <cycle 1> [71]
-----------------------------------------------
                                 300             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [344]
                             2196827             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
                0.00    0.00     150/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, int> >, std::pair<std::string const, int> const&) [228]
                0.00    0.00     150/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, int> const&) [243]
[344]    0.0    0.00    0.00 2197127+300     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [344]
                                 300             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
                                 300             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [344]
-----------------------------------------------
                             2016016             TEvent* std::__copy_move_backward_a2<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) <cycle 1> [68]
                0.00    0.00  170184/61021898     std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::lower_bound(std::string const&) [160]
[345]    0.0    0.00    0.00 2186200         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() <cycle 1> [345]
                               85092             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
-----------------------------------------------
                0.00    0.00 2004032/2004032     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::get_allocator() const [118]
[346]    0.0    0.00    0.00 2004032         __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::__normal_iterator(std::pair<int, int> const* const&) [346]
-----------------------------------------------
                             1087108             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
                0.00    0.00  252002/61021898     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::insert(std::_Rb_tree_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) [74]
[347]    0.0    0.00    0.00 1339110         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_begin() <cycle 1> [347]
                             1339110             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                0.00    0.00 1293839/1293839     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [21]
[348]    0.0    0.00    0.00 1293839         std::_Rb_tree_const_iterator<int>::_Rb_tree_const_iterator(std::_Rb_tree_iterator<int> const&) [348]
-----------------------------------------------
                0.00    0.00      82/1205984     std::pair<int, int>* std::copy_backward<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [292]
                0.00    0.00    1712/1205984     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [184]
                0.00    0.00    3071/1205984     std::pair<int, int>* std::__uninitialized_move_a<std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> > >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [204]
                0.00    0.00    3073/1205984     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_check_len(unsigned long, char const*) const [206]
                0.00    0.00  107036/1205984     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                0.00    0.00 1091010/1205984     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_rightmost() [104]
[349]    0.0    0.00    0.00 1205984         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node_base const*) [349]
-----------------------------------------------
                0.00    0.00 1091010/1091010     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
[350]    0.0    0.00    0.00 1091010         std::pair<int, int>* std::__uninitialized_copy_a<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*, std::pair<int, int> >(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [350]
                0.00    0.00  137982/137982      std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_leftmost() [404]
-----------------------------------------------
                             1087108             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
[351]    0.0    0.00    0.00 1087108         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree() <cycle 1> [351]
                               85092             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                                 151             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
                                6083             std::_Vector_base<std::string, std::allocator<std::string> >::_M_allocate(unsigned long) <cycle 1> [434]
                              521803             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                0.00    0.00       1/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_Rb_tree_impl<std::less<std::pair<int, std::string> >, false>::_M_initialize() [319]
                0.00    0.00     151/61021898     std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() [258]
                0.00    0.00    5933/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique(std::pair<int const, int> const&) [194]
                0.00    0.00    6083/61021898     std::string* std::__uninitialized_move_a<std::string*, std::string*, std::allocator<std::string> >(std::string*, std::string*, std::string*, std::allocator<std::string>&) [192]
                0.01    0.00  504004/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_key(std::_Rb_tree_node<std::pair<int const, int> > const*) [34]
[352]    0.0    0.00    0.00 1044209         std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
                0.00    0.00   92986/93138       std::_Vector_base<std::string, std::allocator<std::string> >::_M_deallocate(std::string*, unsigned long) [412]
                0.00    0.00   11713/12015       void std::_Destroy<std::string*>(std::string*, std::string*) [426]
                              104699             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
                              104699             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                               12015             __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) <cycle 1> [419]
-----------------------------------------------
                                5932             __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
                                5932             int* std::__copy_move_backward_a2<false, int*, int*>(int*, int*, int*) <cycle 1> [435]
                0.00    0.00    5932/61021898     std::_Rb_tree_const_iterator<std::pair<int const, int> >::operator++() [197]
                0.00    0.00    5932/61021898     std::pair<std::string const, int>::pair(std::pair<std::string const, int> const&) [195]
                0.02    0.01 1008008/61021898     encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
[353]    0.0    0.00    0.00 1031736         std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&) <cycle 1> [353]
                             1512012             __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag) <cycle 1> [10]
                              504004             std::pair<std::pair<int, std::string> const, int>::~pair() <cycle 1> [364]
                               11864             TemporalNetwork::getEvents() <cycle 1> [146]
-----------------------------------------------
                0.00    0.00    3307/1011315     __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::construct(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [451]
                0.00    0.00 1008008/1011315     __gnu_cxx::new_allocator<std::pair<int const, int> >::construct(std::pair<int const, int>*, std::pair<int const, int> const&) [355]
[354]    0.0    0.00    0.00 1011315         std::string* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::string*, std::string*>(std::string*, std::string*, std::string*) [354]
-----------------------------------------------
                0.00    0.00 1008008/1008008     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_create_node(std::pair<std::string const, std::string> const&) <cycle 1> [67]
[355]    0.0    0.00    0.00 1008008         __gnu_cxx::new_allocator<std::pair<int const, int> >::construct(std::pair<int const, int>*, std::pair<int const, int> const&) [355]
                0.00    0.00 1008008/1011315     std::string* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::string*, std::string*>(std::string*, std::string*, std::string*) [354]
-----------------------------------------------
                             1002016             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
[356]    0.0    0.00    0.00 1002016         __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >::__normal_iterator(int* const&) <cycle 1> [356]
                             1002016             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                             1002016             std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) <cycle 1> [19]
[357]    0.0    0.00    0.00 1002016         std::vector<TEvent, std::allocator<TEvent> >::capacity() const <cycle 1> [357]
                             1002016             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
-----------------------------------------------
                0.00    0.00 1002016/1002016     __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::new_allocator() [127]
[358]    0.0    0.00    0.00 1002016         int* std::__uninitialized_copy<true>::uninitialized_copy<int*, int*>(int*, int*, int*) [358]
-----------------------------------------------
                0.00    0.00    1562/644904      std::_Vector_base<TEvent, std::allocator<TEvent> >::~_Vector_base() [212]
                0.00    0.00    1562/644904      std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_get_Tp_allocator() [733]
                0.00    0.00  641780/644904      std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator==(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&) const [100]
[359]    0.0    0.00    0.00  644904         std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator*() const [359]
-----------------------------------------------
                              140225             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00     481/61021898     std::vector<TEvent, std::allocator<TEvent> >::size() const [235]
                0.00    0.00    2675/61021898     bool __gnu_cxx::operator!=<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) [183]
                0.00    0.00    2675/61021898     __gnu_cxx::new_allocator<TEvent>::construct(TEvent*, TEvent const&) [199]
                0.00    0.00   97628/61021898     std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::pair(int const&, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&) [155]
                0.00    0.00  135307/61021898     std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
                0.00    0.00  195256/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::~vector() [128]
[360]    0.0    0.00    0.00  574247         std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const <cycle 1> [360]
                              140225             std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator!=(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> > const&) const <cycle 1> [402]
-----------------------------------------------
                                 300             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, int> > const*) <cycle 1> [344]
                                1562             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, int const&) <cycle 1> [371]
                              135307             std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() const <cycle 1> [72]
                              418303             std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_base(unsigned long, std::allocator<std::pair<int, int> > const&) <cycle 1> [368]
                0.00    0.00       1/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique(std::pair<std::string const, int> const&) [312]
                0.00    0.00     151/61021898     std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, int> const&) [243]
                0.00    0.00     302/61021898     __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::destroy(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >*) [259]
                0.00    0.00     781/61021898     std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl() [232]
                0.00    0.00    1562/61021898     std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size() const [221]
[361]    0.0    0.00    0.00  558269         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
                0.00    0.00    1562/1562        std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_get_Node_allocator() const [464]
                0.00    0.00     302/302         std::allocator<std::pair<std::pair<int, std::string> const, int> >::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >(std::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > > const&) [488]
                0.00    0.00     302/302         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [489]
                0.00    0.00     151/302         std::string* std::__copy_move_backward_a<false, std::string*, std::string*>(std::string*, std::string*, std::string*) [491]
                                 151             std::string* std::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) <cycle 1> [516]
-----------------------------------------------
                               12166             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                                   4             std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) <cycle 1> [567]
                                6083             std::_Vector_base<std::string, std::allocator<std::string> >::_M_allocate(unsigned long) <cycle 1> [434]
                               18099             std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&) <cycle 1> [417]
                              509937             std::pair<std::pair<int, std::string> const, int>::~pair() <cycle 1> [364]
                0.00    0.00       1/61021898     std::pair<int, std::string> std::make_pair<int, std::string>(int, std::string) [322]
                0.00    0.00       1/61021898     std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique(std::pair<int const, int> const&) [194]
                0.00    0.00       1/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_Rb_tree_impl<std::less<std::pair<int, std::string> >, false>::_M_initialize() [319]
                0.00    0.00     284/61021898     std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [265]
[362]    0.0    0.00    0.00  534410+12166   std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                0.00    0.00     302/12015       void std::_Destroy<std::string*>(std::string*, std::string*) [426]
                0.00    0.00     152/93138       std::_Vector_base<std::string, std::allocator<std::string> >::_M_deallocate(std::string*, unsigned long) [412]
                              521803             std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
                               24031             __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) <cycle 1> [419]
                                5932             std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&) <cycle 1> [417]
                                5781             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                                 100             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                                 100             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) <cycle 1> [522]
                                   1             std::_Vector_base<std::string, std::allocator<std::string> >::_Vector_impl::_Vector_impl() <cycle 1> [577]
                               12166             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
-----------------------------------------------
                0.00    0.00       1/513180      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique(std::pair<int const, int> const&) [194]
                0.00    0.00    3243/513180      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
                0.00    0.00    5932/513180      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl(std::less<int> const&, std::allocator<std::_Rb_tree_node<std::pair<int const, int> > > const&) [219]
                0.00    0.00  504004/513180      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[363]    0.0    0.00    0.00  513180         std::allocator<std::pair<int const, int> >::~allocator() [363]
-----------------------------------------------
                              504004             std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&) <cycle 1> [353]
                0.00    0.00    5933/61021898     graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[364]    0.0    0.00    0.00  509937         std::pair<std::pair<int, std::string> const, int>::~pair() <cycle 1> [364]
                              509937             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
-----------------------------------------------
                              504004             std::string* std::__uninitialized_copy<false>::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) <cycle 4> [142]
[365]    0.0    0.00    0.00  504004         __gnu_cxx::new_allocator<std::pair<int const, int*> >::construct(std::pair<int const, int*>*, std::pair<int const, int*> const&) <cycle 4> [365]
                              504004             std::string* std::__uninitialized_copy<false>::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) <cycle 4> [142]
-----------------------------------------------
                0.00    0.00  504004/504004      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
[366]    0.0    0.00    0.00  504004         std::pair<int const, int>::~pair() [366]
-----------------------------------------------
                                 156             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
                                 318             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                              283888             std::_Rb_tree_iterator<std::pair<int const, int*> >::operator++(int) <cycle 1> [383]
                0.00    0.00  183457/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_erase(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [22]
[367]    0.0    0.00    0.00  467819         std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) <cycle 1> [367]
                               89371             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                              418303             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
[368]    0.0    0.00    0.00  418303         std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_base(unsigned long, std::allocator<std::pair<int, int> > const&) <cycle 1> [368]
                              418303             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
                              195256             std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
-----------------------------------------------
                0.00    0.00       3/394522      std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
                0.00    0.00     481/394522      std::pair<int, int>* std::__copy_move_backward_a2<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [403]
                0.00    0.00    3526/394522      std::vector<int, std::allocator<int> >::end() [463]
                0.00    0.00   97628/394522      std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::~vector() [128]
                0.00    0.00   97628/394522      std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::pair(int const&, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&) [155]
                0.00    0.00  195256/394522      std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
[369]    0.0    0.00    0.00  394522         __gnu_cxx::new_allocator<int>::construct(int*, int const&) [369]
-----------------------------------------------
                0.00    0.00  390512/390512      std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
[370]    0.0    0.00    0.00  390512         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_end() [370]
-----------------------------------------------
                                  19             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                               97628             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                              252002             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                0.00    0.00     781/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::key_comp() const [233]
                0.00    0.00    1562/61021898     std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::~_Vector_base() [220]
[371]    0.0    0.00    0.00  351992         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, int const&) <cycle 1> [371]
                0.00    0.00    1562/1864        std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, int> >*) [461]
                                1562             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
-----------------------------------------------
                              340368             TemporalNetwork::get_nodeNames(int) <cycle 1> [121]
[372]    0.0    0.00    0.00  340368         std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator++() <cycle 1> [372]
                              340368             std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                               45663             std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                               48819             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                              140226             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00       1/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [306]
                0.00    0.00    2675/61021898     __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::operator++() [213]
                0.00    0.00   97628/61021898     std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::insert(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [53]
[373]    0.0    0.00    0.00  335012         std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&) <cycle 1> [373]
                              240528             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::end() <cycle 1> [395]
                                   1             std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::lower_bound(int const&) <cycle 1> [580]
-----------------------------------------------
                0.00    0.00  138463/333719      std::pair<int, int>* std::__copy_move_backward_a2<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [403]
                0.00    0.00  195256/333719      __gnu_cxx::new_allocator<std::pair<int, int> >::allocate(unsigned long, void const*) <cycle 1> [124]
[374]    0.0    0.00    0.00  333719         __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, int> > >::deallocate(std::_Rb_tree_node<std::pair<std::string const, int> >*, unsigned long) [374]
-----------------------------------------------
                0.00    0.00    7244/328915      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) [381]
                0.00    0.00  321671/328915      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::end() [103]
[375]    0.0    0.00    0.00  328915         std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::key_comp() const [375]
-----------------------------------------------
                                 302             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&) <cycle 1> [446]
                              327353             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
[376]    0.0    0.00    0.00  327655         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) <cycle 1> [376]
                                 302             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::get_allocator() const <cycle 1> [487]
                                 151             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() <cycle 1> [512]
-----------------------------------------------
                0.00    0.00       1/327354      std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique(std::pair<std::string const, int> const&) [312]
                0.00    0.00     151/327354      std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, int> >, std::pair<std::string const, int> const&) [228]
                0.00    0.00     151/327354      std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_rightmost() [805]
                0.00    0.00  327051/327354      std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_right(std::_Rb_tree_node_base*) [802]
[377]    0.0    0.00    0.00  327354         std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::~allocator() [377]
-----------------------------------------------
                              327203             std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::map() <cycle 1> [122]
[378]    0.0    0.00    0.00  327203         std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::lower_bound(std::string const&) <cycle 1> [378]
                              327203             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
-----------------------------------------------
                0.00    0.00       1/327052      std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, int> const&) [243]
                0.00    0.00  327051/327052      std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_right(std::_Rb_tree_node_base*) [802]
[379]    0.0    0.00    0.00  327052         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::~_Rb_tree_impl() [379]
-----------------------------------------------
                0.00    0.00  327051/327051      std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
[380]    0.0    0.00    0.00  327051         __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::~new_allocator() [380]
-----------------------------------------------
                0.00    0.00     781/321671      encoding_nodeCodes::encoding_nodeCodes(encoding_nodeCodes const&) [216]
                0.00    0.00  320890/321671      TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[381]    0.0    0.00    0.00  321671         std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) [381]
                0.00    0.00    7244/328915      std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::key_comp() const [375]
-----------------------------------------------
                0.00    0.00  314427/314427      TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[382]    0.0    0.00    0.00  314427         std::pair<std::string const, int>::~pair() [382]
-----------------------------------------------
                              195099             TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00     173/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator!=(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const [167]
                0.00    0.00   88616/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::_Rb_tree_iterator() [168]
[383]    0.0    0.00    0.00  283888         std::_Rb_tree_iterator<std::pair<int const, int*> >::operator++(int) <cycle 1> [383]
                              283888             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) <cycle 1> [367]
-----------------------------------------------
                0.00    0.00     962/276926      std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
                0.00    0.00  137982/276926      std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_leftmost() [404]
                0.00    0.00  137982/276926      std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >::operator--() [174]
[384]    0.0    0.00    0.00  276926         __gnu_cxx::new_allocator<TEvent>::destroy(TEvent*) [384]
-----------------------------------------------
                0.00    0.00  276926/276926      std::pair<int, int>* std::__copy_move_backward_a2<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [403]
[385]    0.0    0.00    0.00  276926         __gnu_cxx::new_allocator<std::pair<std::string const, int> >::~new_allocator() [385]
-----------------------------------------------
                0.00    0.00     962/276926      std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_impl::_Vector_impl(std::allocator<TEvent> const&) [479]
                0.00    0.00  137982/276926      std::pair<std::_Rb_tree_iterator<std::pair<int const, int*> >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, int*> > const&, bool const&) [173]
                0.00    0.00  137982/276926      std::_Rb_tree_iterator<std::pair<int const, int*> >::operator--() [748]
[386]    0.0    0.00    0.00  276926         std::__miter_base<std::pair<int, int>*, false>::__b(std::pair<int, int>*) [386]
-----------------------------------------------
                0.00    0.00   85092/255276      encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
                0.00    0.00   85092/255276      encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
                0.00    0.00   85092/255276      TemporalNetwork::get_nodeNames(int) <cycle 1> [121]
[387]    0.0    0.00    0.00  255276         std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::end() [387]
-----------------------------------------------
                0.00    0.00  255276/255276      std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
[388]    0.0    0.00    0.00  255276         std::pair<std::_Rb_tree_iterator<std::pair<std::string const, int> >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&, bool const&) [388]
-----------------------------------------------
                              255276             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
[389]    0.0    0.00    0.00  255276         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [389]
                             1011282             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [8]
                              756006             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_create_node(std::pair<std::string const, int> const&) <cycle 1> [18]
                              255276             std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
-----------------------------------------------
                                 142             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [462]
                0.00    0.00  252002/61021898     std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::lower_bound(int const&) [85]
[390]    0.0    0.00    0.00  252144         std::vector<TEvent, std::allocator<TEvent> >::_M_range_check(unsigned long) const <cycle 1> [390]
                              252144             main <cycle 1> [63]
-----------------------------------------------
                0.00    0.00  252002/252002      encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [2]
[391]    0.0    0.00    0.00  252002         std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::find(int const&) [391]
-----------------------------------------------
                0.00    0.00  252002/252002      std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
[392]    0.0    0.00    0.00  252002         std::vector<TEvent, std::allocator<TEvent> >::operator[](unsigned long) [392]
-----------------------------------------------
                0.00    0.00  252002/252002      std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int> >*, std::_Rb_tree_node<std::pair<int const, int> >*, int const&) [170]
[393]    0.0    0.00    0.00  252002         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_right(std::_Rb_tree_node_base const*) [393]
-----------------------------------------------
                              252002             std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [43]
[394]    0.0    0.00    0.00  252002         TEvent* std::__uninitialized_copy_a<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, TEvent>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, std::allocator<TEvent>&) <cycle 1> [394]
                              252002             std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [43]
-----------------------------------------------
                              240528             std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&) <cycle 1> [373]
[395]    0.0    0.00    0.00  240528         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::end() <cycle 1> [395]
                              240528             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                0.00    0.00     193/183965      std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.00    0.00     315/183965      std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::insert(std::_Rb_tree_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) [294]
                0.00    0.00   88616/183965      std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator++() [414]
                0.00    0.00   94841/183965      std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator*() const [409]
[396]    0.0    0.00    0.00  183965         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree() [396]
-----------------------------------------------
                0.00    0.00       2/183462      TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
                0.00    0.00       3/183462      std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.00    0.00   88616/183462      std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator->() const [661]
                0.00    0.00   94841/183462      std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator==(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&) const [660]
[397]    0.0    0.00    0.00  183462         std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::end() [397]
-----------------------------------------------
                0.00    0.00   88616/183457      std::_Rb_tree_iterator<std::pair<int const, int*> >::_Rb_tree_iterator() [168]
                0.00    0.00   94841/183457      std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator==(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&) const [660]
[398]    0.0    0.00    0.00  183457         std::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >::~allocator() [398]
-----------------------------------------------
                0.00    0.00     284/170468      std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_create_node(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [469]
                0.00    0.00   85092/170468      std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) <cycle 1> [145]
                0.00    0.00   85092/170468      std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator++() [45]
[399]    0.0    0.00    0.00  170468         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const*) [399]
-----------------------------------------------
                                8075             std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator++() <cycle 1> [152]
                              140225             std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator!=(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> > const&) const <cycle 1> [402]
[400]    0.0    0.00    0.00  148300         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::find(int const&) <cycle 1> [400]
                              148792             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                0.00    0.00  146898/146898      encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [5]
[401]    0.0    0.00    0.00  146898         std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) [401]
-----------------------------------------------
                              140225             std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const <cycle 1> [360]
[402]    0.0    0.00    0.00  140225         std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator!=(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> > const&) const <cycle 1> [402]
                              140225             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::find(int const&) <cycle 1> [400]
-----------------------------------------------
                0.00    0.00     481/138944      std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_impl::_Vector_impl(std::allocator<TEvent> const&) [479]
                0.00    0.00     481/138944      __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >::__normal_iterator(TEvent const* const&) [267]
                0.00    0.00  137982/138944      std::_Rb_tree_iterator<std::pair<int const, int*> >::operator--() [748]
[403]    0.0    0.00    0.00  138944         std::pair<int, int>* std::__copy_move_backward_a2<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [403]
                0.00    0.00  276926/276926      __gnu_cxx::new_allocator<std::pair<std::string const, int> >::~new_allocator() [385]
                0.00    0.00  138463/333719      __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, int> > >::deallocate(std::_Rb_tree_node<std::pair<std::string const, int> >*, unsigned long) [374]
                0.00    0.00     481/394522      __gnu_cxx::new_allocator<int>::construct(int*, int const&) [369]
-----------------------------------------------
                0.00    0.00  137982/137982      std::pair<int, int>* std::__uninitialized_copy_a<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*, std::pair<int, int> >(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [350]
[404]    0.0    0.00    0.00  137982         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_leftmost() [404]
                0.00    0.00  137982/276926      __gnu_cxx::new_allocator<TEvent>::destroy(TEvent*) [384]
-----------------------------------------------
                              105000             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
                                   1             std::_Vector_base<std::string, std::allocator<std::string> >::_Vector_impl::_Vector_impl() <cycle 1> [577]
                               12162             __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) <cycle 1> [419]
                              104699             std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
                0.00    0.00       1/61021898     std::allocator<std::string>::~allocator() [328]
                0.00    0.00       1/61021898     std::allocator<std::string>::allocator() [327]
                0.00    0.00     150/61021898     __gnu_cxx::new_allocator<std::_Rb_tree_node<int> >::~new_allocator() [278]
                0.00    0.00     150/61021898     std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_right(std::_Rb_tree_node_base*) [263]
                0.00    0.00     151/61021898     std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() [258]
                0.00    0.00     300/61021898     std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_destroy_node(std::_Rb_tree_node<int>*) [262]
                0.00    0.00     302/61021898     TEvent* std::__copy_move<false, true, std::random_access_iterator_tag>::__copy_m<TEvent>(TEvent const*, TEvent const*, TEvent*) [240]
                0.00    0.00     604/61021898     std::string* std::copy_backward<std::string*, std::string*>(std::string*, std::string*, std::string*) [242]
[405]    0.0    0.00    0.00  118521+105000  std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
                0.00    0.00  104699/104699      __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >::base() const [406]
                0.00    0.00     303/303         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::begin() [485]
                0.00    0.00     151/151         std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator--() [510]
                                 604             std::pair<std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&, bool const&) <cycle 1> [473]
                                 151             std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
                                 150             __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) <cycle 1> [419]
                                 150             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                                 142             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                              105000             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
-----------------------------------------------
                0.00    0.00  104699/104699      std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
[406]    0.0    0.00    0.00  104699         __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >::base() const [406]
-----------------------------------------------
                0.00    0.00   97628/97628       std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [44]
[407]    0.0    0.00    0.00   97628         std::pair<std::string const, int>::pair(std::string const&, int const&) [407]
-----------------------------------------------
                0.00    0.00   48736/97555       std::pair<double, int> std::make_pair<double, int>(double, int) [172]
                0.00    0.00   48819/97555       std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::push_back(std::pair<int, int> const&) [188]
[408]    0.0    0.00    0.00   97555         __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::base() const [408]
-----------------------------------------------
                0.00    0.00   94841/94841       std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::map() [765]
[409]    0.0    0.00    0.00   94841         std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator*() const [409]
                0.00    0.00   94841/183965      std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree() [396]
-----------------------------------------------
                0.00    0.00   94841/94841       TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
[410]    0.0    0.00    0.00   94841         std::_Rb_tree_iterator<std::pair<int const, int*> >::operator->() const [410]
-----------------------------------------------
                0.00    0.00       1/94483       std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [306]
                0.00    0.00   45663/94483       std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) <cycle 1> [54]
                0.00    0.00   48819/94483       std::pair<double, int> std::make_pair<double, int>(double, int) [172]
[411]    0.0    0.00    0.00   94483         std::pair<int, int>::pair(int const&, int const&) [411]
-----------------------------------------------
                0.00    0.00     152/93138       std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                0.00    0.00   92986/93138       std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
[412]    0.0    0.00    0.00   93138         std::_Vector_base<std::string, std::allocator<std::string> >::_M_deallocate(std::string*, unsigned long) [412]
-----------------------------------------------
                                 187             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                0.00    0.00      26/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::find(std::string const&) [287]
                0.00    0.00     283/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [236]
                0.00    0.00     286/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::end() [245]
                0.00    0.00   88589/61021898     std::_Rb_tree_iterator<std::pair<int const, int*> >::operator!=(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const [167]
[413]    0.0    0.00    0.00   89371         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_begin() <cycle 1> [413]
                               89371             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                0.00    0.00   88616/88616       TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
[414]    0.0    0.00    0.00   88616         std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator++() [414]
                0.00    0.00   88616/183965      std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree() [396]
-----------------------------------------------
                               85092             std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) <cycle 1> [19]
[415]    0.0    0.00    0.00   85092         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::end() <cycle 1> [415]
                              674188             std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) <cycle 1> [49]
-----------------------------------------------
                0.00    0.00   85092/85092       std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::key_comp() const [668]
[416]    0.0    0.00    0.00   85092         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_left(std::_Rb_tree_node_base*) [416]
-----------------------------------------------
                                6083             std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&) <cycle 1> [417]
                                5932             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                0.00    0.00       1/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [272]
                0.00    0.00    6083/61021898     std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::map() [193]
                0.00    0.00   59775/61021898     graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[417]    0.0    0.00    0.00   71791+6083    std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&) <cycle 1> [417]
                               18099             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                                6083             std::vector<std::string, std::allocator<std::string> >::_M_range_check(unsigned long) const <cycle 1> [425]
                                6083             std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&) <cycle 1> [417]
-----------------------------------------------
                                   3             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
                                  20             std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::~map() <cycle 1> [558]
                                  38             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                                 153             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::~_Rb_tree() <cycle 1> [424]
                0.00    0.00      20/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~map() [304]
                0.00    0.00      29/61021898     std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::~map() [301]
                0.00    0.00      29/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::insert(std::_Rb_tree_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) [294]
                0.00    0.00      38/61021898     std::_Vector_base<int, std::allocator<int> >::_Vector_base(unsigned long, std::allocator<int> const&) [274]
                0.00    0.00   46711/61021898     std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::~_Rb_tree() [179]
[418]    0.0    0.00    0.00   47041         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
                                 156             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) <cycle 1> [367]
-----------------------------------------------
                                 150             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
                               12015             std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
                               24031             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                0.00    0.00       1/61021898     __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::destroy(std::pair<std::pair<int, std::string> const, int>*) [324]
                0.00    0.00       2/61021898     std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_erase(std::_Rb_tree_node<int>*) [254]
                0.00    0.00     150/61021898     std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_right(std::_Rb_tree_node_base*) [263]
                0.00    0.00     151/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_right(std::_Rb_tree_node_base const*) [277]
[419]    0.0    0.00    0.00   36500         __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) <cycle 1> [419]
                               12162             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
-----------------------------------------------
                0.00    0.00   11864/23728       __gnu_cxx::new_allocator<int>::deallocate(int*, unsigned long) [630]
                0.00    0.00   11864/23728       void std::_Destroy_aux<true>::__destroy<int*>(int*, int*) [429]
[420]    0.0    0.00    0.00   23728         std::pair<int, int>* std::uninitialized_copy<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [420]
                0.00    0.00   11864/11864       std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_value(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const*) [430]
-----------------------------------------------
                0.00    0.00       1/21595       std::vector<std::string, std::allocator<std::string> >::push_back(std::string const&) [320]
                0.00    0.00   21594/21595       graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[421]    0.0    0.00    0.00   21595         std::vector<std::string, std::allocator<std::string> >::~vector() [421]
                0.00    0.00       2/2           std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::end() const [568]
-----------------------------------------------
                0.00    0.00     781/16507       std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<std::string const, int> >*) [810]
                0.00    0.00   15726/16507       TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[422]    0.0    0.00    0.00   16507         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::~_Rb_tree() [422]
-----------------------------------------------
                                3242             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&) <cycle 3> [40]
                0.00    0.00      18/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_root() const [230]
                0.01    0.00    5910/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_begin() const [133]
                0.01    0.00    5913/44716       std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_copy(std::_Rb_tree_node<std::pair<int const, int> > const*, std::_Rb_tree_node<std::pair<int const, int> >*) [55]
[423]    0.0    0.00    0.00   15083         std::_Select1st<std::pair<int const, int> >::operator()(std::pair<int const, int> const&) const <cycle 3> [423]
                               15083             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_create_node(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 3> [56]
-----------------------------------------------
                                 315             std::pair<std::string const, std::string>::~pair() <cycle 1> [297]
                0.00    0.00       1/61021898     graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.00    0.00      25/61021898     graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00   11929/61021898     TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[424]    0.0    0.00    0.00   12270         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::~_Rb_tree() <cycle 1> [424]
                                 153             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
-----------------------------------------------
                                6083             std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&) <cycle 1> [417]
                0.00    0.00    5932/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_Rb_tree_impl<std::less<std::pair<int, std::string> >, false>::~_Rb_tree_impl() [185]
[425]    0.0    0.00    0.00   12015         std::vector<std::string, std::allocator<std::string> >::_M_range_check(unsigned long) const <cycle 1> [425]
                                6083             std::_Vector_base<std::string, std::allocator<std::string> >::_M_allocate(unsigned long) <cycle 1> [434]
-----------------------------------------------
                0.00    0.00     302/12015       std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                0.00    0.00   11713/12015       std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
[426]    0.0    0.00    0.00   12015         void std::_Destroy<std::string*>(std::string*, std::string*) [426]
-----------------------------------------------
                0.00    0.00    5932/11864       int* std::__uninitialized_move_a<int*, int*, std::allocator<int> >(int*, int*, int*, std::allocator<int>&) [108]
                0.00    0.00    5932/11864       std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_create_node(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 3> [56]
[427]    0.0    0.00    0.00   11864         __gnu_cxx::new_allocator<int>::~new_allocator() [427]
                0.00    0.00   11864/11864       __gnu_cxx::new_allocator<std::pair<int, int> >::max_size() const [428]
-----------------------------------------------
                0.00    0.00   11864/11864       __gnu_cxx::new_allocator<int>::~new_allocator() [427]
[428]    0.0    0.00    0.00   11864         __gnu_cxx::new_allocator<std::pair<int, int> >::max_size() const [428]
-----------------------------------------------
                0.00    0.00    5932/11864       std::_Vector_base<int, std::allocator<int> >::_Vector_impl::_Vector_impl(std::allocator<int> const&) <cycle 1> [563]
                0.00    0.00    5932/11864       std::pair<std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const&, bool const&) [782]
[429]    0.0    0.00    0.00   11864         void std::_Destroy_aux<true>::__destroy<int*>(int*, int*) [429]
                0.00    0.00   11864/23728       std::pair<int, int>* std::uninitialized_copy<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [420]
-----------------------------------------------
                0.00    0.00   11864/11864       std::pair<int, int>* std::uninitialized_copy<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [420]
[430]    0.0    0.00    0.00   11864         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_value(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const*) [430]
-----------------------------------------------
                0.00    0.00      23/11499       graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
                0.00    0.00   11476/11499       TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[431]    0.0    0.00    0.00   11499         std::vector<TEvent, std::allocator<TEvent> >::vector() [431]
-----------------------------------------------
                0.00    0.00    8076/8076        std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
[432]    0.0    0.00    0.00    8076         std::_Rb_tree_const_iterator<std::pair<int const, int*> >::operator--() [432]
-----------------------------------------------
                                6312             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
[433]    0.0    0.00    0.00    6312         std::_Rb_tree_const_iterator<std::pair<int const, int*> >::operator++() <cycle 1> [433]
                                3156             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_create_node(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [448]
-----------------------------------------------
                                6083             std::vector<std::string, std::allocator<std::string> >::_M_range_check(unsigned long) const <cycle 1> [425]
[434]    0.0    0.00    0.00    6083         std::_Vector_base<std::string, std::allocator<std::string> >::_M_allocate(unsigned long) <cycle 1> [434]
                                6083             std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const <cycle 1> [352]
                                6083             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
-----------------------------------------------
                                5935             std::_Vector_base<int, std::allocator<int> >::_Vector_impl::_Vector_impl(std::allocator<int> const&) <cycle 1> [563]
[435]    0.0    0.00    0.00    5935         int* std::__copy_move_backward_a2<false, int*, int*>(int*, int*, int*) <cycle 1> [435]
                0.00    0.00    5932/5932        TEvent* std::__copy_move_backward_a<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) [442]
                0.00    0.00       3/237         __gnu_cxx::new_allocator<TEvent>::max_size() const [496]
                                5932             std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&) <cycle 1> [353]
-----------------------------------------------
                0.00    0.00    5932/5932        int* std::__copy_move_a2<false, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [441]
[436]    0.0    0.00    0.00    5932         __gnu_cxx::new_allocator<std::_Rb_tree_node<int> >::allocate(unsigned long, void const*) [436]
-----------------------------------------------
                0.00    0.00    5932/5932        std::_Rb_tree_const_iterator<std::pair<int const, int> >::operator++() [197]
[437]    0.0    0.00    0.00    5932         __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >::base() const [437]
-----------------------------------------------
                0.00    0.00    5932/5932        std::_Vector_base<int, std::allocator<int> >::_Vector_impl::~_Vector_impl() [334]
[438]    0.0    0.00    0.00    5932         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_get_Node_allocator() const [438]
-----------------------------------------------
                0.00    0.00    5932/5932        int* std::__uninitialized_move_a<int*, int*, std::allocator<int> >(int*, int*, int*, std::allocator<int>&) [108]
[439]    0.0    0.00    0.00    5932         std::__miter_base<int*, false>::__b(int*) [439]
-----------------------------------------------
                0.00    0.00    5932/5932        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_create_node(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 3> [56]
[440]    0.0    0.00    0.00    5932         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_get_node() [440]
                0.00    0.00    5932/5932        int* std::__copy_move_a2<false, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [441]
-----------------------------------------------
                0.00    0.00    5932/5932        std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_get_node() [440]
[441]    0.0    0.00    0.00    5932         int* std::__copy_move_a2<false, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [441]
                0.00    0.00    5932/5932        __gnu_cxx::new_allocator<std::_Rb_tree_node<int> >::allocate(unsigned long, void const*) [436]
-----------------------------------------------
                0.00    0.00    5932/5932        int* std::__copy_move_backward_a2<false, int*, int*>(int*, int*, int*) <cycle 1> [435]
[442]    0.0    0.00    0.00    5932         TEvent* std::__copy_move_backward_a<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) [442]
-----------------------------------------------
                0.00    0.00    5919/5919        std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_copy(std::_Rb_tree_node<std::pair<int const, int> > const*, std::_Rb_tree_node<std::pair<int const, int> >*) [55]
[443]    0.0    0.00    0.00    5919         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_right(std::_Rb_tree_node_base const*) [443]
-----------------------------------------------
                0.00    0.00       2/5912        std::vector<int, std::allocator<int> >::_M_check_len(unsigned long, char const*) const [575]
                0.00    0.00    5910/5912        std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_root() [836]
[444]    0.0    0.00    0.00    5912         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_clone_node(std::_Rb_tree_node<std::pair<int const, int> > const*) [444]
                0.00    0.00       1/1           std::pair<int, int>* std::__copy_move_backward_a<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [584]
-----------------------------------------------
                0.00    0.00    5910/5910        std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_copy(std::_Rb_tree_node<std::pair<int const, int> > const*, std::_Rb_tree_node<std::pair<int const, int> >*) [55]
[445]    0.0    0.00    0.00    5910         std::allocator<std::_Rb_tree_node<std::pair<int const, int> > >::allocator(std::allocator<std::_Rb_tree_node<std::pair<int const, int> > > const&) [445]
-----------------------------------------------
                                 151             std::string* std::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) <cycle 1> [516]
                                 604             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                0.00    0.00     151/61021898     std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::end() [276]
                0.00    0.00     302/61021898     std::_Rb_tree_iterator<std::pair<std::string const, int> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<std::string const, int> >*) [241]
                0.00    0.00     781/61021898     std::_Vector_base<TEvent, std::allocator<TEvent> >::_M_get_Tp_allocator() [234]
                0.00    0.00    2343/61021898     std::_Vector_base<TEvent, std::allocator<TEvent> >::~_Vector_base() [212]
[446]    0.0    0.00    0.00    4332         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&) <cycle 1> [446]
                                1083             std::allocator<std::pair<std::string const, int> >::~allocator() <cycle 1> [466]
                                 302             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) <cycle 1> [376]
-----------------------------------------------
                                1838             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                                  38             std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
                                  42             std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::key_comp() const <cycle 1> [538]
                                 100             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                                 142             std::less<std::pair<int, std::string> >::operator()(std::pair<int, std::string> const&, std::pair<int, std::string> const&) const <cycle 1> [539]
                                 142             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) <cycle 1> [522]
                0.00    0.00      38/61021898     std::_Vector_base<int, std::allocator<int> >::_Vector_base(unsigned long, std::allocator<int> const&) [274]
                0.00    0.00      42/61021898     std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::operator*() const [298]
                0.00    0.00      42/61021898     void std::_Destroy<std::string*, std::string>(std::string*, std::string*, std::allocator<std::string>&) [300]
                0.00    0.00     142/61021898     __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::base() const [282]
                0.00    0.00     158/61021898     std::_Vector_base<std::string, std::allocator<std::string> >::_Vector_impl::~_Vector_impl() [271]
                0.00    0.00     158/61021898     std::_Vector_base<std::string, std::allocator<std::string> >::_Vector_base() [250]
                0.00    0.00     166/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [249]
                0.00    0.00     200/61021898     __gnu_cxx::new_allocator<std::string>::construct(std::string*, std::string const&) [248]
                0.00    0.00     284/61021898     std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::operator==(std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> > const&) const [264]
                0.00    0.00     308/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_Rb_tree() [253]
                0.00    0.00     308/61021898     std::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::~allocator() [252]
                0.00    0.00     342/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_Rb_tree_impl<std::less<std::pair<int, std::string> >, false>::_Rb_tree_impl() [246]
                0.00    0.00     384/61021898     std::_Vector_base<std::string, std::allocator<std::string> >::~_Vector_base() [247]
                0.00    0.00    1066/61021898     std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::insert(std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) [226]
[447]    0.0    0.00    0.00    4102+1838    std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                0.00    0.00     142/284         std::_Select1st<std::pair<std::pair<int, std::string> const, int> >::operator()(std::pair<std::pair<int, std::string> const, int> const&) const [493]
                0.00    0.00      80/80          std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::pair<int, std::string> const&) [531]
                0.00    0.00      42/42          std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_rightmost() [541]
                0.00    0.00      19/38          int* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [543]
                0.00    0.00      19/19          std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_end() [559]
                                1630             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [462]
                                 482             std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) <cycle 1> [26]
                                 284             std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&) <cycle 1> [4]
                                  76             std::vector<int, std::allocator<int> >::push_back(int const&) <cycle 1> [494]
                                  38             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
                                  19             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, int const&) <cycle 1> [371]
                                1838             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                                 315             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_create_node(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [448]
                                 315             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() <cycle 1> [119]
                                3156             std::_Rb_tree_const_iterator<std::pair<int const, int*> >::operator++() <cycle 1> [433]
                0.00    0.00     315/61021898     std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::get_allocator() const [239]
[448]    0.0    0.00    0.00    3786+315     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_create_node(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [448]
                                 315             TEvent* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<TEvent>(TEvent const*, TEvent const*, TEvent*) <cycle 1> [483]
                                 315             main <cycle 1> [63]
                                 315             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_create_node(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [448]
-----------------------------------------------
                0.00    0.00    3524/3524        graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
[449]    0.0    0.00    0.00    3524         __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) [449]
-----------------------------------------------
                0.00    0.00     302/3426        std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node_base const*) [261]
                0.00    0.00     781/3426        std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::~_Vector_impl() [732]
                0.00    0.00     781/3426        std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_base() [734]
                0.00    0.00    1562/3426        std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::~_Vector_base() [220]
[450]    0.0    0.00    0.00    3426         __gnu_cxx::new_allocator<std::pair<std::string const, int> >::destroy(std::pair<std::string const, int>*) [450]
-----------------------------------------------
                0.00    0.00     151/3307        std::string* std::__copy_move_backward_a<false, std::string*, std::string*>(std::string*, std::string*, std::string*) [491]
                0.00    0.00    3156/3307        void std::_Construct<std::string, std::string>(std::string*, std::string const&) [202]
[451]    0.0    0.00    0.00    3307         __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::construct(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [451]
                0.00    0.00    3307/1011315     std::string* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::string*, std::string*>(std::string*, std::string*, std::string*) [354]
-----------------------------------------------
                0.00    0.00    3156/3156        std::vector<std::string, std::allocator<std::string> >::end() [214]
[452]    0.0    0.00    0.00    3156         __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::__normal_iterator(std::pair<int, int>* const&) [452]
-----------------------------------------------
                0.00    0.00    3156/3156        std::pair<int, int>::pair<double, int>(std::pair<double, int> const&) [210]
[453]    0.0    0.00    0.00    3156         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::size() const [453]
-----------------------------------------------
                0.00    0.00    3156/3156        TemporalNetwork::getEventCount() [187]
[454]    0.0    0.00    0.00    3156         std::vector<std::string, std::allocator<std::string> >::begin() [454]
-----------------------------------------------
                0.00    0.00    3156/3156        std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
[455]    0.0    0.00    0.00    3156         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_S_right(std::_Rb_tree_node_base const*) [455]
-----------------------------------------------
                0.00    0.00    3156/3156        std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::push_back(std::pair<int, int> const&) [188]
[456]    0.0    0.00    0.00    3156         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::begin() [456]
-----------------------------------------------
                0.00    0.00       2/3077        std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_allocate(unsigned long) [311]
                0.00    0.00    3075/3077        __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::difference_type __gnu_cxx::operator-<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [229]
[457]    0.0    0.00    0.00    3077         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_leftmost() [457]
-----------------------------------------------
                0.00    0.00    3071/3071        std::pair<int, int>* std::__uninitialized_move_a<std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> > >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [204]
[458]    0.0    0.00    0.00    3071         std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator--() [458]
-----------------------------------------------
                0.00    0.00    3071/3071        std::pair<int, int>::~pair() [785]
[459]    0.0    0.00    0.00    3071         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_right(std::_Rb_tree_node_base const*) [459]
-----------------------------------------------
                0.00    0.00       1/2556        __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >::~new_allocator() [571]
                0.00    0.00       3/2556        std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) [565]
                0.00    0.00      70/2556        std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_Rb_tree_impl() [495]
                0.00    0.00     428/2556        std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
                0.00    0.00     453/2556        std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [489]
                0.00    0.00    1601/2556        std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
[460]    0.0    0.00    0.00    2556         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&) [460]
                0.00    0.00     579/579         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > const*) [477]
                0.00    0.00     479/479         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_value(std::_Rb_tree_node_base const*) [480]
                0.00    0.00     428/604         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_create_node(int const&) [474]
-----------------------------------------------
                0.00    0.00     302/1864        std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node_base const*) [261]
                0.00    0.00    1562/1864        std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, int const&) <cycle 1> [371]
[461]    0.0    0.00    0.00    1864         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, int> >*) [461]
-----------------------------------------------
                                1630             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                0.00    0.00     142/61021898     std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_right(std::_Rb_tree_node_base*) [283]
[462]    0.0    0.00    0.00    1772         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [462]
                0.00    0.00     284/932         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_create_node(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [469]
                0.00    0.00     142/284         std::_Select1st<std::pair<std::pair<int, std::string> const, int> >::operator()(std::pair<std::pair<int, std::string> const, int> const&) const [493]
                                 142             std::vector<TEvent, std::allocator<TEvent> >::_M_range_check(unsigned long) const <cycle 1> [390]
-----------------------------------------------
                0.00    0.00    1763/1763        graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
[463]    0.0    0.00    0.00    1763         std::vector<int, std::allocator<int> >::end() [463]
                0.00    0.00    3526/394522      __gnu_cxx::new_allocator<int>::construct(int*, int const&) [369]
-----------------------------------------------
                0.00    0.00    1562/1562        std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
[464]    0.0    0.00    0.00    1562         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_get_Node_allocator() const [464]
-----------------------------------------------
                0.00    0.00    1562/1562        std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::vector(std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&) [231]
[465]    0.0    0.00    0.00    1562         void std::_Destroy<std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*) [465]
-----------------------------------------------
                                1083             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&) <cycle 1> [446]
[466]    0.0    0.00    0.00    1083         std::allocator<std::pair<std::string const, int> >::~allocator() <cycle 1> [466]
                                1083             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
-----------------------------------------------
                0.00    0.00     302/1083        void std::_Destroy_aux<true>::__destroy<TEvent*>(TEvent*, TEvent*) [726]
                0.00    0.00     781/1083        std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_impl::~_Vector_impl() [730]
[467]    0.0    0.00    0.00    1083         void std::_Destroy<std::pair<int, int>*, std::pair<int, int> >(std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&) [467]
-----------------------------------------------
                0.00    0.00      42/942         std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) <cycle 1> [497]
                0.00    0.00     142/942         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [249]
                0.00    0.00     142/942         __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::__normal_iterator(TEvent* const&) [518]
                0.00    0.00     308/942         std::_Rb_tree_iterator<std::pair<int const, int> >::operator++() [484]
                0.00    0.00     308/942         std::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::~allocator() [252]
[468]    0.0    0.00    0.00     942         std::pair<std::pair<int, std::string> const, int>::pair(std::pair<int, std::string> const&, int const&) [468]
-----------------------------------------------
                0.00    0.00      80/932         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::pair<int, std::string> const&) [531]
                0.00    0.00     284/932         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [462]
                0.00    0.00     568/932         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::size() const [687]
[469]    0.0    0.00    0.00     932         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_create_node(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [469]
                0.00    0.00     284/170468      std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const*) [399]
                0.00    0.00      38/38          std::pair<int, int>* std::__uninitialized_copy<false>::uninitialized_copy<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*>(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*) [542]
-----------------------------------------------
                0.00    0.00     781/781         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<std::string const, int> >*) [810]
[470]    0.0    0.00    0.00     781         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::lower_bound(int const&) [470]
-----------------------------------------------
                0.00    0.00     302/604         TEvent* std::__copy_move_a2<false, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*) [475]
                0.00    0.00     302/604         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_get_node() [798]
[471]    0.0    0.00    0.00     604         __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::new_allocator() [471]
-----------------------------------------------
                                 302             std::pair<std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&, bool const&) <cycle 1> [473]
                0.00    0.00     302/61021898     TEvent* std::__copy_move<false, true, std::random_access_iterator_tag>::__copy_m<TEvent>(TEvent const*, TEvent const*, TEvent*) [240]
[472]    0.0    0.00    0.00     604         __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::construct(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [472]
                0.00    0.00     151/151         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_get_node() [514]
                                 151             main <cycle 1> [63]
-----------------------------------------------
                                 604             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
[473]    0.0    0.00    0.00     604         std::pair<std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&, bool const&) <cycle 1> [473]
                                 302             __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::construct(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [472]
-----------------------------------------------
                0.00    0.00      21/604         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
                0.00    0.00      21/604         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [309]
                0.00    0.00      22/604         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::lower_bound(int const&) [305]
                0.00    0.00      42/604         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::key_comp() const [691]
                0.00    0.00      70/604         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_Rb_tree_impl() [495]
                0.00    0.00     428/604         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&) [460]
[474]    0.0    0.00    0.00     604         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_create_node(int const&) [474]
                0.00    0.00      22/66          std::pair<std::_Rb_tree_iterator<std::pair<int const, int> >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, int> > const&, bool const&) [532]
-----------------------------------------------
                0.00    0.00     302/604         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_get_Node_allocator() const [686]
                0.00    0.00     302/604         __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::deallocate(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, unsigned long) [596]
[475]    0.0    0.00    0.00     604         TEvent* std::__copy_move_a2<false, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*) [475]
                0.00    0.00     302/604         __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::new_allocator() [471]
-----------------------------------------------
                0.00    0.00     150/600         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, int> const&) [243]
                0.00    0.00     450/600         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, int> >, std::pair<std::string const, int> const&) [228]
[476]    0.0    0.00    0.00     600         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) [476]
-----------------------------------------------
                0.00    0.00     579/579         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&) [460]
[477]    0.0    0.00    0.00     579         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > const*) [477]
-----------------------------------------------
                0.00    0.00     566/566         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*) [236]
[478]    0.0    0.00    0.00     566         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::get_allocator() const [478]
-----------------------------------------------
                0.00    0.00     481/481         std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) <cycle 1> [11]
[479]    0.0    0.00    0.00     481         std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_impl::_Vector_impl(std::allocator<TEvent> const&) [479]
                0.00    0.00     962/276926      std::__miter_base<std::pair<int, int>*, false>::__b(std::pair<int, int>*) [386]
                0.00    0.00     481/138944      std::pair<int, int>* std::__copy_move_backward_a2<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [403]
-----------------------------------------------
                0.00    0.00     479/479         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&) [460]
[480]    0.0    0.00    0.00     479         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_value(std::_Rb_tree_node_base const*) [480]
-----------------------------------------------
                0.00    0.00       1/473         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::end() const [568]
                0.00    0.00      44/473         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
                0.00    0.00     428/473         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
[481]    0.0    0.00    0.00     473         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int*> >*) [481]
                0.00    0.00       1/2           std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [570]
-----------------------------------------------
                0.00    0.00      22/337         std::pair<int, int>* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [529]
                0.00    0.00     315/337         TEvent* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<TEvent>(TEvent const*, TEvent const*, TEvent*) <cycle 1> [483]
[482]    0.0    0.00    0.00     337         __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::construct(std::pair<std::pair<int, std::string> const, int>*, std::pair<std::pair<int, std::string> const, int> const&) [482]
                0.00    0.00      22/22          std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_get_node() [555]
-----------------------------------------------
                                 315             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_create_node(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [448]
                0.00    0.00      22/61021898     __gnu_cxx::new_allocator<int>::new_allocator() [303]
[483]    0.0    0.00    0.00     337         TEvent* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<TEvent>(TEvent const*, TEvent const*, TEvent*) <cycle 1> [483]
                0.00    0.00     315/337         __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::construct(std::pair<std::pair<int, std::string> const, int>*, std::pair<std::pair<int, std::string> const, int> const&) [482]
                0.00    0.00      22/88          std::pair<int, int>* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [529]
                                  22             main <cycle 1> [63]
-----------------------------------------------
                0.00    0.00     308/308         graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
[484]    0.0    0.00    0.00     308         std::_Rb_tree_iterator<std::pair<int const, int> >::operator++() [484]
                0.00    0.00     308/942         std::pair<std::pair<int, std::string> const, int>::pair(std::pair<int, std::string> const&, int const&) [468]
-----------------------------------------------
                0.00    0.00     303/303         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
[485]    0.0    0.00    0.00     303         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::begin() [485]
                0.00    0.00     142/142         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_get_node() [524]
-----------------------------------------------
                0.00    0.00     302/302         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
[486]    0.0    0.00    0.00     302         __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::new_allocator() [486]
-----------------------------------------------
                                 302             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) <cycle 1> [376]
[487]    0.0    0.00    0.00     302         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::get_allocator() const <cycle 1> [487]
                                 302             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
-----------------------------------------------
                0.00    0.00     302/302         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
[488]    0.0    0.00    0.00     302         std::allocator<std::pair<std::pair<int, std::string> const, int> >::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >(std::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > > const&) [488]
-----------------------------------------------
                0.00    0.00     302/302         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
[489]    0.0    0.00    0.00     302         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [489]
                0.00    0.00     453/2556        std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&) [460]
-----------------------------------------------
                0.00    0.00     302/302         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::lower_bound(std::string const&) [260]
[490]    0.0    0.00    0.00     302         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() [490]
-----------------------------------------------
                0.00    0.00     151/302         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
                0.00    0.00     151/302         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_get_Node_allocator() const [695]
[491]    0.0    0.00    0.00     302         std::string* std::__copy_move_backward_a<false, std::string*, std::string*>(std::string*, std::string*, std::string*) [491]
                0.00    0.00     151/3307        __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::construct(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [451]
-----------------------------------------------
                0.00    0.00       3/292         __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::~new_allocator() [613]
                0.00    0.00     289/292         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() [291]
[492]    0.0    0.00    0.00     292         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [492]
-----------------------------------------------
                0.00    0.00     142/284         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                0.00    0.00     142/284         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [462]
[493]    0.0    0.00    0.00     284         std::_Select1st<std::pair<std::pair<int, std::string> const, int> >::operator()(std::pair<std::pair<int, std::string> const, int> const&) const [493]
-----------------------------------------------
                                  76             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                                 106             std::pair<int, std::string>::pair(int const&, std::string const&) <cycle 1> [498]
                0.00    0.00      43/61021898     graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.00    0.00      43/61021898     split(std::string const&, char) [296]
[494]    0.0    0.00    0.00     268         std::vector<int, std::allocator<int> >::push_back(int const&) <cycle 1> [494]
                0.00    0.00      19/29          std::set<int, std::less<int>, std::allocator<int> >::~set() [546]
                                  93             std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
-----------------------------------------------
                                  86             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_Rb_tree_impl() [495]
                0.00    0.00       1/242         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_rightmost() [818]
                0.00    0.00       1/242         int* std::uninitialized_copy<int*, int*>(int*, int*, int*) [583]
                0.00    0.00      21/242         std::_Rb_tree_const_iterator<std::pair<int const, int*> >::_Rb_tree_const_iterator(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) [308]
                0.00    0.00      21/242         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [309]
                0.00    0.00      22/242         std::pair<int const, int*>::~pair() [779]
                0.00    0.00     176/242         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
[495]    0.0    0.00    0.00     242+86      std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_Rb_tree_impl() [495]
                0.00    0.00      70/2556        std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&) [460]
                0.00    0.00      70/604         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_create_node(int const&) [474]
                                  86             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_Rb_tree_impl() [495]
-----------------------------------------------
                0.00    0.00       3/237         int* std::__copy_move_backward_a2<false, int*, int*>(int*, int*, int*) <cycle 1> [435]
                0.00    0.00     234/237         __gnu_cxx::new_allocator<int>::allocate(unsigned long, void const*) [548]
[496]    0.0    0.00    0.00     237         __gnu_cxx::new_allocator<TEvent>::max_size() const [496]
-----------------------------------------------
                                  42             TemporalNetwork::getEvents() <cycle 1> [146]
                0.00    0.00      42/61021898     std::_Rb_tree_iterator<std::pair<int const, int> >::operator!=(std::_Rb_tree_iterator<std::pair<int const, int> > const&) const [299]
                0.00    0.00      64/61021898     graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.00    0.00      84/61021898     graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
[497]    0.0    0.00    0.00     232         std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) <cycle 1> [497]
                0.00    0.00      42/42          std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::lower_bound(std::pair<int, std::string> const&) [540]
                0.00    0.00      42/942         std::pair<std::pair<int, std::string> const, int>::pair(std::pair<int, std::string> const&, int const&) [468]
                                 212             std::pair<int, std::string>::pair(int const&, std::string const&) <cycle 1> [498]
                                  42             std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::key_comp() const <cycle 1> [538]
                                  42             std::less<std::pair<int, std::string> >::operator()(std::pair<int, std::string> const&, std::pair<int, std::string> const&) const <cycle 1> [539]
-----------------------------------------------
                                 212             std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) <cycle 1> [497]
[498]    0.0    0.00    0.00     212         std::pair<int, std::string>::pair(int const&, std::string const&) <cycle 1> [498]
                                 106             std::vector<int, std::allocator<int> >::push_back(int const&) <cycle 1> [494]
-----------------------------------------------
                                  19             std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
                                  93             std::vector<int, std::allocator<int> >::push_back(int const&) <cycle 1> [494]
                0.00    0.00       3/61021898     std::vector<int, std::allocator<int> >::vector() [315]
                0.00    0.00       3/61021898     std::vector<int, std::allocator<int> >::~vector() [314]
                0.00    0.00       6/61021898     bool __gnu_cxx::operator!=<int*, std::vector<int, std::allocator<int> > >(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&) [310]
                0.00    0.00      76/61021898     std::_Vector_base<int, std::allocator<int> >::_Vector_base(unsigned long, std::allocator<int> const&) [274]
[499]    0.0    0.00    0.00     181+19      std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
                0.00    0.00      22/22          std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::lower_bound(std::pair<int, std::string> const&) [554]
                0.00    0.00      19/19          bool std::operator< <int, std::string>(std::pair<int, std::string> const&, std::pair<int, std::string> const&) [560]
                0.00    0.00       6/25          int* std::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [547]
                0.00    0.00       3/394522      __gnu_cxx::new_allocator<int>::construct(int*, int const&) [369]
                                  93             main <cycle 1> [63]
                                  38             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                                  19             std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::~map() <cycle 1> [558]
                                   3             std::_Vector_base<int, std::allocator<int> >::_Vector_impl::_Vector_impl(std::allocator<int> const&) <cycle 1> [563]
                                  19             std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
-----------------------------------------------
                0.00    0.00      82/164         std::pair<int, int>* std::copy_backward<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [292]
                0.00    0.00      82/164         std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_check_len(unsigned long, char const*) const [206]
[500]    0.0    0.00    0.00     164         std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator()(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) const [500]
-----------------------------------------------
                0.00    0.00     152/152         graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[501]    0.0    0.00    0.00     152         __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::operator++() [501]
-----------------------------------------------
                0.00    0.00     152/152         TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[502]    0.0    0.00    0.00     152         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_Rb_tree_impl<std::less<std::string>, false>::~_Rb_tree_impl() [502]
-----------------------------------------------
                0.00    0.00     151/151         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_erase(std::_Rb_tree_node<int>*) [254]
[503]    0.0    0.00    0.00     151         __gnu_cxx::new_allocator<std::string>::destroy(std::string*) [503]
-----------------------------------------------
                0.00    0.00     151/151         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_get_node() [514]
[504]    0.0    0.00    0.00     151         __gnu_cxx::new_allocator<std::pair<int const, int*> >::new_allocator() [504]
-----------------------------------------------
                0.00    0.00     151/151         graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[505]    0.0    0.00    0.00     151         __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::operator*() const [505]
-----------------------------------------------
                0.00    0.00       1/151         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique(std::pair<std::string const, int> const&) [312]
                0.00    0.00     150/151         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, int> >, std::pair<std::string const, int> const&) [228]
[506]    0.0    0.00    0.00     151         std::_Select1st<std::pair<std::string const, int> >::operator()(std::pair<std::string const, int> const&) const [506]
-----------------------------------------------
                0.00    0.00     151/151         TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
[507]    0.0    0.00    0.00     151         std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&) const [507]
                0.00    0.00     151/151         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::key_comp() const [508]
-----------------------------------------------
                0.00    0.00     151/151         std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&) const [507]
[508]    0.0    0.00    0.00     151         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::key_comp() const [508]
-----------------------------------------------
                0.00    0.00     151/151         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::~_Rb_tree() [198]
[509]    0.0    0.00    0.00     151         std::allocator<std::_Rb_tree_node<int> >::~allocator() [509]
-----------------------------------------------
                0.00    0.00     151/151         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
[510]    0.0    0.00    0.00     151         std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator--() [510]
-----------------------------------------------
                0.00    0.00     151/151         TemporalNetwork::getNextEvents(TEvent, int) <cycle 1> [89]
[511]    0.0    0.00    0.00     151         std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::find(std::string const&) [511]
-----------------------------------------------
                                 151             std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) <cycle 1> [376]
[512]    0.0    0.00    0.00     151         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() <cycle 1> [512]
                              327051             std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [30]
                                 151             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) <cycle 1> [112]
-----------------------------------------------
                0.00    0.00     151/151         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, int> >, std::pair<std::string const, int> const&) [228]
[513]    0.0    0.00    0.00     151         std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_value(std::_Rb_tree_node_base const*) [513]
-----------------------------------------------
                0.00    0.00     151/151         __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::construct(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) <cycle 1> [472]
[514]    0.0    0.00    0.00     151         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_get_node() [514]
                0.00    0.00     151/151         __gnu_cxx::new_allocator<std::pair<int const, int*> >::new_allocator() [504]
-----------------------------------------------
                0.00    0.00     151/151         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::~_Rb_tree() [198]
[515]    0.0    0.00    0.00     151         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree() [515]
-----------------------------------------------
                                 151             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) <cycle 1> [361]
[516]    0.0    0.00    0.00     151         std::string* std::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) <cycle 1> [516]
                                 151             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&) <cycle 1> [446]
-----------------------------------------------
                0.00    0.00     151/151         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_Rb_tree() [831]
[517]    0.0    0.00    0.00     151         bool std::operator< <char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [517]
-----------------------------------------------
                0.00    0.00     142/142         std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [265]
[518]    0.0    0.00    0.00     142         __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::__normal_iterator(TEvent* const&) [518]
                0.00    0.00     142/942         std::pair<std::pair<int, std::string> const, int>::pair(std::pair<int, std::string> const&, int const&) [468]
-----------------------------------------------
                0.00    0.00     142/142         graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
[519]    0.0    0.00    0.00     142         std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&) const [519]
-----------------------------------------------
                0.00    0.00     142/142         graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[520]    0.0    0.00    0.00     142         std::vector<TEvent, std::allocator<TEvent> >::end() [520]
-----------------------------------------------
                0.00    0.00     142/142         graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
[521]    0.0    0.00    0.00     142         std::vector<int, std::allocator<int> >::at(unsigned long) [521]
-----------------------------------------------
                                 100             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
                0.00    0.00      42/61021898     __gnu_cxx::new_allocator<std::string>::construct(std::string*, std::string const&) [248]
[522]    0.0    0.00    0.00     142         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) <cycle 1> [522]
                                 142             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                0.00    0.00     142/142         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_get_node() [524]
[523]    0.0    0.00    0.00     142         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_value(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > const*) [523]
-----------------------------------------------
                0.00    0.00     142/142         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::begin() [485]
[524]    0.0    0.00    0.00     142         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_get_node() [524]
                0.00    0.00     142/142         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_value(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > const*) [523]
-----------------------------------------------
                0.00    0.00     141/141         std::pair<int, int>* std::__uninitialized_copy<false>::uninitialized_copy<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*>(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*) [542]
[525]    0.0    0.00    0.00     141         __gnu_cxx::new_allocator<std::pair<int const, int> >::~new_allocator() [525]
-----------------------------------------------
                                  22             std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
                                   1             __gnu_cxx::new_allocator<std::pair<int const, int*> >::destroy(std::pair<int const, int*>*) <cycle 2> [572]
                                  44             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int*> >*, std::_Rb_tree_node<std::pair<int const, int*> >*, int const&) <cycle 2> [534]
                0.00    0.00       2/196         std::vector<std::string, std::allocator<std::string> >::push_back(std::string const&) [320]
                0.00    0.00      42/196         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
                0.00    0.00      44/196         std::vector<std::string, std::allocator<std::string> >::at(unsigned long) [302]
[526]    0.0    0.00    0.00     133+22      std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
                0.00    0.00      44/473         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int*> >*) [481]
                0.00    0.00      22/22          std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [551]
                                  44             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int*> >*, std::_Rb_tree_node<std::pair<int const, int*> >*, int const&) <cycle 2> [534]
                                  22             std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
-----------------------------------------------
                0.00    0.00       1/89          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [570]
                0.00    0.00      88/89          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_put_node(std::_Rb_tree_node<int>*) [536]
[527]    0.0    0.00    0.00      89         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_create_node(std::pair<int const, int> const&) [527]
                0.00    0.00      44/88          std::pair<int, int>* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [529]
-----------------------------------------------
                0.00    0.00      44/88          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::~_Rb_tree_impl() [841]
                0.00    0.00      44/88          std::set<int, std::less<int>, std::allocator<int> >::count(int const&) const [332]
[528]    0.0    0.00    0.00      88         std::_Rb_tree_const_iterator<int>::operator==(std::_Rb_tree_const_iterator<int> const&) const [528]
                0.00    0.00      22/44          std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_S_key(std::_Rb_tree_node_base const*) [535]
-----------------------------------------------
                0.00    0.00      22/88          std::_Rb_tree_iterator<std::pair<int const, int> >::operator--() [553]
                0.00    0.00      22/88          TEvent* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<TEvent>(TEvent const*, TEvent const*, TEvent*) <cycle 1> [483]
                0.00    0.00      44/88          std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_create_node(std::pair<int const, int> const&) [527]
[529]    0.0    0.00    0.00      88         std::pair<int, int>* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [529]
                0.00    0.00      22/337         __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::construct(std::pair<std::pair<int, std::string> const, int>*, std::pair<std::pair<int, std::string> const, int> const&) [482]
-----------------------------------------------
                0.00    0.00      83/83          std::pair<int, int>* std::copy_backward<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [292]
[530]    0.0    0.00    0.00      83         std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::size() const [530]
-----------------------------------------------
                0.00    0.00      80/80          std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
[531]    0.0    0.00    0.00      80         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::pair<int, std::string> const&) [531]
                0.00    0.00      80/932         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_create_node(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [469]
                0.00    0.00      19/57          std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const*) [533]
-----------------------------------------------
                0.00    0.00      22/66          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_create_node(int const&) [474]
                0.00    0.00      44/66          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_left(std::_Rb_tree_node_base const*) [537]
[532]    0.0    0.00    0.00      66         std::pair<std::_Rb_tree_iterator<std::pair<int const, int> >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, int> > const&, bool const&) [532]
-----------------------------------------------
                0.00    0.00      19/57          std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::pair<int, std::string> const&) [531]
                0.00    0.00      38/57          int* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [543]
[533]    0.0    0.00    0.00      57         std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const*) [533]
-----------------------------------------------
                                  44             std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
[534]    0.0    0.00    0.00      44         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int*> >*, std::_Rb_tree_node<std::pair<int const, int*> >*, int const&) <cycle 2> [534]
                0.00    0.00      22/44          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_left(std::_Rb_tree_node_base const*) [537]
                0.00    0.00      22/22          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_value(std::_Rb_tree_node<int> const*) [557]
                                  88             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
                                  44             std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
-----------------------------------------------
                0.00    0.00      22/44          std::_Rb_tree_const_iterator<int>::operator==(std::_Rb_tree_const_iterator<int> const&) const [528]
                0.00    0.00      22/44          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
[535]    0.0    0.00    0.00      44         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_S_key(std::_Rb_tree_node_base const*) [535]
-----------------------------------------------
                0.00    0.00      22/44          std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [551]
                0.00    0.00      22/44          __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<int const, int> > >::new_allocator(__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<int const, int> > > const&) [615]
[536]    0.0    0.00    0.00      44         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_put_node(std::_Rb_tree_node<int>*) [536]
                0.00    0.00      88/89          std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_create_node(std::pair<int const, int> const&) [527]
-----------------------------------------------
                0.00    0.00      22/44          std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int*> >*, std::_Rb_tree_node<std::pair<int const, int*> >*, int const&) <cycle 2> [534]
                0.00    0.00      22/44          int* std::__copy_move_backward_a<false, int*, int*>(int*, int*, int*) [856]
[537]    0.0    0.00    0.00      44         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_left(std::_Rb_tree_node_base const*) [537]
                0.00    0.00      44/66          std::pair<std::_Rb_tree_iterator<std::pair<int const, int> >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, int> > const&, bool const&) [532]
-----------------------------------------------
                                  42             std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) <cycle 1> [497]
[538]    0.0    0.00    0.00      42         std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::key_comp() const <cycle 1> [538]
                                  42             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
-----------------------------------------------
                                 142             std::less<std::pair<int, std::string> >::operator()(std::pair<int, std::string> const&, std::pair<int, std::string> const&) const <cycle 1> [539]
                                  42             std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) <cycle 1> [497]
[539]    0.0    0.00    0.00      42+142     std::less<std::pair<int, std::string> >::operator()(std::pair<int, std::string> const&, std::pair<int, std::string> const&) const <cycle 1> [539]
                                 142             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
                                 142             std::less<std::pair<int, std::string> >::operator()(std::pair<int, std::string> const&, std::pair<int, std::string> const&) const <cycle 1> [539]
-----------------------------------------------
                0.00    0.00      42/42          std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) <cycle 1> [497]
[540]    0.0    0.00    0.00      42         std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::lower_bound(std::pair<int, std::string> const&) [540]
-----------------------------------------------
                0.00    0.00      42/42          std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
[541]    0.0    0.00    0.00      42         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_rightmost() [541]
-----------------------------------------------
                0.00    0.00      38/38          std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_create_node(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [469]
[542]    0.0    0.00    0.00      38         std::pair<int, int>* std::__uninitialized_copy<false>::uninitialized_copy<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*>(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*) [542]
                0.00    0.00     141/141         __gnu_cxx::new_allocator<std::pair<int const, int> >::~new_allocator() [525]
-----------------------------------------------
                0.00    0.00      19/38          bool std::operator< <int, std::string>(std::pair<int, std::string> const&, std::pair<int, std::string> const&) [560]
                0.00    0.00      19/38          std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
[543]    0.0    0.00    0.00      38         int* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [543]
                0.00    0.00      38/57          std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const*) [533]
                0.00    0.00      38/38          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_begin() [544]
-----------------------------------------------
                0.00    0.00      38/38          int* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [543]
[544]    0.0    0.00    0.00      38         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_begin() [544]
-----------------------------------------------
                0.00    0.00      18/36          std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl(std::less<int> const&, std::allocator<std::_Rb_tree_node<std::pair<int const, int> > > const&) [219]
                0.00    0.00      18/36          std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_copy(std::_Rb_tree_node<std::pair<int const, int> > const*, std::_Rb_tree_node<std::pair<int const, int> >*) [55]
[545]    0.0    0.00    0.00      36         std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_value(std::_Rb_tree_node_base const*) [545]
-----------------------------------------------
                0.00    0.00      10/29          TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
                0.00    0.00      19/29          std::vector<int, std::allocator<int> >::push_back(int const&) <cycle 1> [494]
[546]    0.0    0.00    0.00      29         std::set<int, std::less<int>, std::allocator<int> >::~set() [546]
-----------------------------------------------
                0.00    0.00       6/25          std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
                0.00    0.00      19/25          std::vector<int, std::allocator<int> >::end() const [677]
[547]    0.0    0.00    0.00      25         int* std::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [547]
                0.00    0.00       3/22          std::vector<int, std::allocator<int> >::max_size() const [549]
-----------------------------------------------
                0.00    0.00      22/22          std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::lower_bound(std::pair<int, std::string> const&) [554]
[548]    0.0    0.00    0.00      22         __gnu_cxx::new_allocator<int>::allocate(unsigned long, void const*) [548]
                0.00    0.00     234/237         __gnu_cxx::new_allocator<TEvent>::max_size() const [496]
-----------------------------------------------
                0.00    0.00       3/22          int* std::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [547]
                0.00    0.00      19/22          std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::lower_bound(std::pair<int, std::string> const&) [554]
[549]    0.0    0.00    0.00      22         std::vector<int, std::allocator<int> >::max_size() const [549]
-----------------------------------------------
                                  21             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
                0.00    0.00       1/196         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int*> const&) [330]
[550]    0.0    0.00    0.00      22         std::allocator<std::_Rb_tree_node<std::pair<int const, int*> > >::allocator() <cycle 2> [550]
                                  22             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
-----------------------------------------------
                0.00    0.00      22/22          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
[551]    0.0    0.00    0.00      22         std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [551]
                0.00    0.00      22/44          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_put_node(std::_Rb_tree_node<int>*) [536]
-----------------------------------------------
                0.00    0.00      22/22          std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
[552]    0.0    0.00    0.00      22         std::_Rb_tree_iterator<std::pair<int const, int*> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<int const, int*> >*) [552]
-----------------------------------------------
                0.00    0.00      22/22          std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::get_allocator() const [689]
[553]    0.0    0.00    0.00      22         std::_Rb_tree_iterator<std::pair<int const, int> >::operator--() [553]
                0.00    0.00      22/88          std::pair<int, int>* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [529]
-----------------------------------------------
                0.00    0.00      22/22          std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
[554]    0.0    0.00    0.00      22         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::lower_bound(std::pair<int, std::string> const&) [554]
                0.00    0.00      22/22          __gnu_cxx::new_allocator<int>::allocate(unsigned long, void const*) [548]
                0.00    0.00      19/22          std::vector<int, std::allocator<int> >::max_size() const [549]
-----------------------------------------------
                0.00    0.00      22/22          __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::construct(std::pair<std::pair<int, std::string> const, int>*, std::pair<std::pair<int, std::string> const, int> const&) [482]
[555]    0.0    0.00    0.00      22         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_get_node() [555]
-----------------------------------------------
                0.00    0.00      22/22          std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_end() [821]
[556]    0.0    0.00    0.00      22         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_right(std::_Rb_tree_node_base const*) [556]
-----------------------------------------------
                0.00    0.00      22/22          std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int*> >*, std::_Rb_tree_node<std::pair<int const, int*> >*, int const&) <cycle 2> [534]
[557]    0.0    0.00    0.00      22         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_value(std::_Rb_tree_node<int> const*) [557]
-----------------------------------------------
                                  19             std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
                0.00    0.00       1/61021898     TemporalNetwork::TemporalNetwork(bool, std::string, char) [180]
[558]    0.0    0.00    0.00      20         std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::~map() <cycle 1> [558]
                                  20             std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) <cycle 1> [418]
-----------------------------------------------
                0.00    0.00      19/19          std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [447]
[559]    0.0    0.00    0.00      19         std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_end() [559]
-----------------------------------------------
                0.00    0.00      19/19          std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
[560]    0.0    0.00    0.00      19         bool std::operator< <int, std::string>(std::pair<int, std::string> const&, std::pair<int, std::string> const&) [560]
                0.00    0.00      19/38          int* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [543]
-----------------------------------------------
                0.00    0.00       9/9           TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [33]
[561]    0.0    0.00    0.00       9         std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::map() [561]
-----------------------------------------------
                0.00    0.00       3/3           std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int*> >*) [566]
[562]    0.0    0.00    0.00       3         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::key_comp() const [562]
-----------------------------------------------
                                   3             std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) <cycle 1> [499]
[563]    0.0    0.00    0.00       3         std::_Vector_base<int, std::allocator<int> >::_Vector_impl::_Vector_impl(std::allocator<int> const&) <cycle 1> [563]
                0.00    0.00    5932/11864       void std::_Destroy_aux<true>::__destroy<int*>(int*, int*) [429]
                                5935             int* std::__copy_move_backward_a2<false, int*, int*>(int*, int*, int*) <cycle 1> [435]
-----------------------------------------------
                0.00    0.00       3/3           std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, std::string> >*, std::_Rb_tree_node<std::pair<std::string const, std::string> >*, std::string const&) [793]
[564]    0.0    0.00    0.00       3         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [564]
-----------------------------------------------
                0.00    0.00       3/3           std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int*> >*) [566]
[565]    0.0    0.00    0.00       3         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) [565]
                0.00    0.00       3/2556        std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&) [460]
-----------------------------------------------
                0.00    0.00       3/3           std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::~_Rb_tree() [293]
[566]    0.0    0.00    0.00       3         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int*> >*) [566]
                0.00    0.00       3/3           std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) [565]
                0.00    0.00       3/3           std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::key_comp() const [562]
-----------------------------------------------
                                   1             TemporalNetwork::getEvents() <cycle 1> [146]
                0.00    0.00       1/61021898     graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [13]
                0.00    0.00       1/61021898     std::pair<int, std::string>::pair(std::pair<int, std::string> const&) [329]
[567]    0.0    0.00    0.00       3         std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) <cycle 1> [567]
                                   4             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
-----------------------------------------------
                0.00    0.00       2/2           std::vector<std::string, std::allocator<std::string> >::~vector() [421]
[568]    0.0    0.00    0.00       2         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::end() const [568]
                0.00    0.00       1/1           std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() [582]
                0.00    0.00       1/473         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int*> >*) [481]
-----------------------------------------------
                0.00    0.00       2/2           std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::~_Rb_tree() [293]
[569]    0.0    0.00    0.00       2         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_begin() [569]
-----------------------------------------------
                0.00    0.00       1/2           __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<int const, int*> > >::~new_allocator() [610]
                0.00    0.00       1/2           std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int*> >*) [481]
[570]    0.0    0.00    0.00       2         std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::_M_initialize() [570]
                0.00    0.00       1/89          std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_create_node(std::pair<int const, int> const&) [527]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
[571]    0.0    0.00    0.00       1         __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >::~new_allocator() [571]
                0.00    0.00       1/2556        std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&) [460]
-----------------------------------------------
                                   1             std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&) <cycle 2> [286]
[572]    0.0    0.00    0.00       1         __gnu_cxx::new_allocator<std::pair<int const, int*> >::destroy(std::pair<int const, int*>*) <cycle 2> [572]
                                   1             std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const <cycle 2> [526]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [306]
[573]    0.0    0.00    0.00       1         __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::~new_allocator() [573]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int*> const&) [330]
[574]    0.0    0.00    0.00       1         __gnu_cxx::new_allocator<int>::new_allocator(__gnu_cxx::new_allocator<int> const&) [574]
-----------------------------------------------
                0.00    0.00       1/1           std::_Vector_base<int, std::allocator<int> >::_Vector_base() [578]
[575]    0.0    0.00    0.00       1         std::vector<int, std::allocator<int> >::_M_check_len(unsigned long, char const*) const [575]
                0.00    0.00       2/5912        std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_clone_node(std::_Rb_tree_node<std::pair<int const, int> > const*) [444]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_destroy_node(std::_Rb_tree_node<int>*) [262]
[576]    0.0    0.00    0.00       1         std::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::allocator() [576]
-----------------------------------------------
                                   1             std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) <cycle 1> [362]
[577]    0.0    0.00    0.00       1         std::_Vector_base<std::string, std::allocator<std::string> >::_Vector_impl::_Vector_impl() <cycle 1> [577]
                                   1             std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&) <cycle 1> [405]
-----------------------------------------------
                0.00    0.00       1/1           int const& std::min<int>(int const&, int const&) [585]
[578]    0.0    0.00    0.00       1         std::_Vector_base<int, std::allocator<int> >::_Vector_base() [578]
                0.00    0.00       1/1           std::vector<int, std::allocator<int> >::_M_check_len(unsigned long, char const*) const [575]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique(std::pair<int const, int> const&) [194]
[579]    0.0    0.00    0.00       1         std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator--() [579]
-----------------------------------------------
                                   1             std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&) <cycle 1> [373]
[580]    0.0    0.00    0.00       1         std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::lower_bound(int const&) <cycle 1> [580]
                                   1             std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) <cycle 1> [295]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&) [289]
[581]    0.0    0.00    0.00       1         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_right(std::_Rb_tree_node_base*) [581]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::end() const [568]
[582]    0.0    0.00    0.00       1         std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl() [582]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::size() const [690]
[583]    0.0    0.00    0.00       1         int* std::uninitialized_copy<int*, int*>(int*, int*, int*) [583]
                0.00    0.00       1/242         std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_Rb_tree_impl() [495]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_clone_node(std::_Rb_tree_node<std::pair<int const, int> > const*) [444]
[584]    0.0    0.00    0.00       1         std::pair<int, int>* std::__copy_move_backward_a<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [584]
-----------------------------------------------
                0.00    0.00       1/1           graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [14]
[585]    0.0    0.00    0.00       1         int const& std::min<int>(int const&, int const&) [585]
                0.00    0.00       1/1           std::_Vector_base<int, std::allocator<int> >::_Vector_base() [578]
-----------------------------------------------

 This table describes the call tree of the program, and was sorted by
 the total amount of time spent in each function and its children.

 Each entry in this table consists of several lines.  The line with the
 index number at the left hand margin lists the current function.
 The lines above it list the functions that called this function,
 and the lines below it list the functions this one called.
 This line lists:
     index	A unique number given to each element of the table.
		Index numbers are sorted numerically.
		The index number is printed next to every function name so
		it is easier to look up where the function in the table.

     % time	This is the percentage of the `total' time that was spent
		in this function and its children.  Note that due to
		different viewpoints, functions excluded by options, etc,
		these numbers will NOT add up to 100%.

     self	This is the total amount of time spent in this function.

     children	This is the total amount of time propagated into this
		function by its children.

     called	This is the number of times the function was called.
		If the function called itself recursively, the number
		only includes non-recursive calls, and is followed by
		a `+' and the number of recursive calls.

     name	The name of the current function.  The index number is
		printed after it.  If the function is a member of a
		cycle, the cycle number is printed between the
		function's name and the index number.


 For the function's parents, the fields have the following meanings:

     self	This is the amount of time that was propagated directly
		from the function into this parent.

     children	This is the amount of time that was propagated from
		the function's children into this parent.

     called	This is the number of times this parent called the
		function `/' the total number of times the function
		was called.  Recursive calls to the function are not
		included in the number after the `/'.

     name	This is the name of the parent.  The parent's index
		number is printed after it.  If the parent is a
		member of a cycle, the cycle number is printed between
		the name and the index number.

 If the parents of the function cannot be determined, the word
 `<spontaneous>' is printed in the `name' field, and all the other
 fields are blank.

 For the function's children, the fields have the following meanings:

     self	This is the amount of time that was propagated directly
		from the child into the function.

     children	This is the amount of time that was propagated from the
		child's children to the function.

     called	This is the number of times the function called
		this child `/' the total number of times the child
		was called.  Recursive calls by the child are not
		listed in the number after the `/'.

     name	This is the name of the child.  The child's index
		number is printed after it.  If the child is a
		member of a cycle, the cycle number is printed
		between the name and the index number.

 If there are any cycles (circles) in the call graph, there is an
 entry for the cycle-as-a-whole.  This entry shows who called the
 cycle (as parents) and the members of the cycle (as children.)
 The `+' recursive calls entry shows the number of function calls that
 were internal to the cycle, and the calls entry for each member shows,
 for that member, how many times it was called from other members of
 the cycle.


Index by function name

  [13] graphletCount(TemporalNetwork*, int, int, int, std::basic_ofstream<char, std::char_traits<char> >*, std::basic_ofstream<char, std::char_traits<char> >*, std::string, int, char) [151] std::__niter_base<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, true>::__b(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >) [422] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::~_Rb_tree()
   [5] encodeGraphlet(std::vector<TEvent, std::allocator<TEvent> >*) [551] std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*) [243] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, int> const&)
  [14] graphletCountFromPrefix(TemporalNetwork*, TEvent, encoding_nodeCodes, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >*, std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >*, int, int, int) [113] std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >::operator--() [440] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_get_node()
   [2] encodeGraphletFromPrefix(encoding_nodeCodes, TEvent) [95] std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator--() [461] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, int> >*)
  [89] TemporalNetwork::getNextEvents(TEvent, int) [510] std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator--() [512] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize()
 [121] TemporalNetwork::get_nodeNames(int) [414] std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator++() [18] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_create_node(std::pair<std::string const, int> const&)
 [146] TemporalNetwork::getEvents() [552] std::_Rb_tree_iterator<std::pair<int const, int*> >::_Rb_tree_iterator(std::_Rb_tree_node<std::pair<int const, int*> >*) [446] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, int> >*, std::_Rb_tree_node<std::pair<std::string const, int> >*, std::string const&)
 [180] TemporalNetwork::TemporalNetwork(bool, std::string, char) [383] std::_Rb_tree_iterator<std::pair<int const, int*> >::operator++(int) [318] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::end()
  [33] TemporalNetwork::TemporalNetwork(bool, std::vector<std::string, std::allocator<std::string> >, char) [579] std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator--() [418] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&)
 [216] encoding_nodeCodes::encoding_nodeCodes(encoding_nodeCodes const&) [372] std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator++() [344] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, int> > const*)
 [123] TEvent::~TEvent()     [553] std::_Rb_tree_iterator<std::pair<int const, int> >::operator--() [70] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, int> > const*)
 [384] __gnu_cxx::new_allocator<TEvent>::destroy(TEvent*) [484] std::_Rb_tree_iterator<std::pair<int const, int> >::operator++() [513] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::_S_value(std::_Rb_tree_node_base const*)
  [64] __gnu_cxx::new_allocator<TEvent>::allocate(unsigned long, void const*) [354] std::string* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::string*, std::string*>(std::string*, std::string*, std::string*) [424] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::~_Rb_tree()
 [199] __gnu_cxx::new_allocator<TEvent>::construct(TEvent*, TEvent const&) [529] std::pair<int, int>* std::__copy_move_backward<false, false, std::random_access_iterator_tag>::__copy_move_b<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*) [462] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::pair<int, std::string> const, int> const&)
 [503] __gnu_cxx::new_allocator<std::string>::destroy(std::string*) [483] TEvent* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<TEvent>(TEvent const*, TEvent const*, TEvent*) [514] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_get_node()
 [486] __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::new_allocator() [50] int* std::__copy_move_backward<false, true, std::random_access_iterator_tag>::__copy_move_b<int>(int const*, int const*, int*) [554] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::lower_bound(std::pair<int, std::string> const&)
 [571] __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >::~new_allocator() [542] std::pair<int, int>* std::__uninitialized_copy<false>::uninitialized_copy<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*>(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*) [541] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_rightmost()
 [101] __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::deallocate(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, unsigned long) [142] std::string* std::__uninitialized_copy<false>::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*) [448] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_create_node(std::pair<std::pair<int, std::string> const, int> const&)
 [380] __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::~new_allocator() [36] TEvent* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*) [531] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*, std::pair<int, std::string> const&)
 [374] __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::string const, int> > >::deallocate(std::_Rb_tree_node<std::pair<std::string const, int> >*, unsigned long) [543] int* std::__uninitialized_copy<true>::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*) [522] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*)
 [323] __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::deallocate(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, unsigned long) [79] TEvent* std::__uninitialized_copy<true>::uninitialized_copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*) [405] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique(std::pair<std::pair<int, std::string> const, int> const&)
 [436] __gnu_cxx::new_allocator<std::_Rb_tree_node<int> >::allocate(unsigned long, void const*) [358] int* std::__uninitialized_copy<true>::uninitialized_copy<int*, int*>(int*, int*, int*) [447] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&)
 [482] __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::construct(std::pair<std::pair<int, std::string> const, int>*, std::pair<std::pair<int, std::string> const, int> const&) [152] std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator++() [269] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::end()
 [471] __gnu_cxx::new_allocator<std::pair<std::pair<int, std::string> const, int> >::new_allocator() [217] std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >::operator++() [97] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::begin()
 [451] __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::construct(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [45] std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator++() [559] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_end()
  [94] __gnu_cxx::new_allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::new_allocator() [432] std::_Rb_tree_const_iterator<std::pair<int const, int*> >::operator--() [477] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_key(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > const*)
 [450] __gnu_cxx::new_allocator<std::pair<std::string const, int> >::destroy(std::pair<std::string const, int>*) [433] std::_Rb_tree_const_iterator<std::pair<int const, int*> >::operator++() [249] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> >*)
 [182] __gnu_cxx::new_allocator<std::pair<std::string const, int> >::construct(std::pair<std::string const, int>*, std::pair<std::string const, int> const&) [458] std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator--() [523] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_value(std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > const*)
  [41] __gnu_cxx::new_allocator<std::pair<std::string const, int> >::new_allocator() [348] std::_Rb_tree_const_iterator<int>::_Rb_tree_const_iterator(std::_Rb_tree_iterator<int> const&) [480] std::_Rb_tree<std::pair<int, std::string>, std::pair<std::pair<int, std::string> const, int>, std::_Select1st<std::pair<std::pair<int, std::string> const, int> >, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::_S_value(std::_Rb_tree_node_base const*)
 [385] __gnu_cxx::new_allocator<std::pair<std::string const, int> >::~new_allocator() [367] std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) [555] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_get_node()
 [572] __gnu_cxx::new_allocator<std::pair<int const, int*> >::destroy(std::pair<int const, int*>*) [511] std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::find(std::string const&) [582] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl()
 [365] __gnu_cxx::new_allocator<std::pair<int const, int*> >::construct(std::pair<int const, int*>*, std::pair<int const, int*> const&) [26] std::map<std::string, std::string, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::operator[](std::string const&) [379] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_Rb_tree_impl<std::less<int>, false>::~_Rb_tree_impl()
 [504] __gnu_cxx::new_allocator<std::pair<int const, int*> >::new_allocator() [102] std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::end() [534] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, int*> >*, std::_Rb_tree_node<std::pair<int const, int*> >*, int const&)
  [23] __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::destroy(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*) [401] std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) [481] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int*> >*)
 [472] __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::construct(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [66] std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::insert(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [460] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique(std::pair<int const, int*> const&)
 [573] __gnu_cxx::new_allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::~new_allocator() [122] std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::map() [286] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int*> >, std::pair<int const, int*> const&)
 [355] __gnu_cxx::new_allocator<std::pair<int const, int> >::construct(std::pair<int const, int>*, std::pair<int const, int> const&) [19] std::map<std::string, std::vector<TEvent, std::allocator<TEvent> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::operator[](std::string const&) [395] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::end()
 [525] __gnu_cxx::new_allocator<std::pair<int const, int> >::~new_allocator() [378] std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::lower_bound(std::string const&) [400] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::find(int const&)
 [124] __gnu_cxx::new_allocator<std::pair<int, int> >::allocate(unsigned long, void const*) [103] std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::end() [535] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_S_key(std::_Rb_tree_node_base const*)
 [548] __gnu_cxx::new_allocator<int>::allocate(unsigned long, void const*) [381] std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::find(std::string const&) [569] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_begin()
 [369] __gnu_cxx::new_allocator<int>::construct(int*, int const&) [342] std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::map() [566] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int*> >*)
 [574] __gnu_cxx::new_allocator<int>::new_allocator(__gnu_cxx::new_allocator<int> const&) [44] std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::operator[](std::string const&) [455] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_S_right(std::_Rb_tree_node_base const*)
 [427] __gnu_cxx::new_allocator<int>::~new_allocator() [540] std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::lower_bound(std::pair<int, std::string> const&) [293] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::~_Rb_tree()
 [518] __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::__normal_iterator(TEvent* const&) [397] std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::end() [184] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&)
 [501] __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::operator++() [226] std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::insert(std::_Rb_tree_iterator<std::pair<std::pair<int, std::string> const, int> >, std::pair<std::pair<int, std::string> const, int> const&) [524] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_get_node()
 [346] __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::__normal_iterator(std::pair<int, int> const* const&) [558] std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::~map() [457] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_leftmost()
 [178] __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::__normal_iterator(std::string* const&) [417] std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::operator[](std::pair<int, std::string> const&) [21] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*)
 [452] __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::__normal_iterator(std::pair<int, int>* const&) [580] std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::lower_bound(int const&) [470] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::lower_bound(int const&)
  [69] __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator++() [301] std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::~map() [492] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize()
 [356] __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >::__normal_iterator(int* const&) [373] std::map<int, int*, std::less<int>, std::allocator<std::pair<int const, int*> > >::operator[](int const&) [56] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_create_node(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&)
 [419] __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::difference_type __gnu_cxx::operator-<std::string*, std::vector<std::string, std::allocator<std::string> > >(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&, __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > > const&) [387] std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::end() [371] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*, int const&)
 [273] bool __gnu_cxx::operator!=<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > const&, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > > const&) [53] std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::insert(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [306] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&)
  [20] bool __gnu_cxx::operator!=<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) [561] std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::map() [30] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&)
 [310] bool __gnu_cxx::operator!=<int*, std::vector<int, std::allocator<int> > >(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > const&) [156] std::map<int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::operator[](int const&) [456] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::begin()
 [496] __gnu_cxx::new_allocator<TEvent>::max_size() const [391] std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::find(int const&) [399] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const*)
 [428] __gnu_cxx::new_allocator<std::pair<int, int> >::max_size() const [177] std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map(std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > > const&) [349] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_key(std::_Rb_tree_node_base const*)
 [505] __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >::operator*() const [78] std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::map() [205] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_M_erase(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >*)
 [406] __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >::base() const [353] std::map<int, int, std::less<int>, std::allocator<std::pair<int const, int> > >::operator[](int const&) [459] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_right(std::_Rb_tree_node_base const*)
 [408] __gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >::base() const [337] std::set<int, std::less<int>, std::allocator<int> >::insert(int const&) [430] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_value(std::_Rb_tree_node<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const*)
  [60] __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >::operator->() const [546] std::set<int, std::less<int>, std::allocator<int> >::~set() [57] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::_S_value(std::_Rb_tree_node_base const*)
 [437] __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >::base() const [468] std::pair<std::pair<int, std::string> const, int>::pair(std::pair<int, std::string> const&, int const&) [179] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::~_Rb_tree()
 [493] std::_Select1st<std::pair<std::pair<int, std::string> const, int> >::operator()(std::pair<std::pair<int, std::string> const, int> const&) const [364] std::pair<std::pair<int, std::string> const, int>::~pair() [40] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<int const, int> const&)
 [506] std::_Select1st<std::pair<std::string const, int> >::operator()(std::pair<std::string const, int> const&) const [62] std::pair<std::string const, std::string>::pair(std::string const&, std::string const&) [105] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_get_node()
 [500] std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator()(std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > const&) const [297] std::pair<std::string const, std::string>::~pair() [7] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_put_node(std::_Rb_tree_node<std::pair<int const, int> >*)
 [423] std::_Select1st<std::pair<int const, int> >::operator()(std::pair<int const, int> const&) const [200] std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::pair(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [90] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::lower_bound(int const&)
 [409] std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator*() const [58] std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >::~pair() [444] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_clone_node(std::_Rb_tree_node<std::pair<int const, int> > const*)
 [507] std::_Rb_tree_iterator<std::pair<std::string const, std::string> >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&) const [407] std::pair<std::string const, int>::pair(std::string const&, int const&) [143] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_M_initialize()
  [98] std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&) const [195] std::pair<std::string const, int>::pair(std::pair<std::string const, int> const&) [345] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl()
 [359] std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator*() const [382] std::pair<std::string const, int>::~pair() [77] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree_impl<std::less<int>, false>::~_Rb_tree_impl()
 [100] std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator==(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&) const [115] std::pair<int const, int*>::pair(int const&, int* const&) [527] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_create_node(std::pair<int const, int> const&)
 [519] std::_Rb_tree_iterator<std::pair<std::string const, int> >::operator!=(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&) const [366] std::pair<int const, int>::~pair() [135] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<int const, int> >*)
 [360] std::_Rb_tree_iterator<std::pair<int const, int*> >::operator==(std::_Rb_tree_iterator<std::pair<int const, int*> > const&) const [153] std::pair<std::_Rb_tree_iterator<std::pair<std::string const, std::string> >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, std::string> > const&, bool const&) [194] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique(std::pair<int const, int> const&)
 [410] std::_Rb_tree_iterator<std::pair<int const, int*> >::operator->() const [473] std::pair<std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const&, bool const&) [4] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<int const, int> >, std::pair<int const, int> const&)
  [38] std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::operator!=(std::_Rb_tree_iterator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > const&) const [388] std::pair<std::_Rb_tree_iterator<std::pair<std::string const, int> >, bool>::pair(std::_Rb_tree_iterator<std::pair<std::string const, int> > const&, bool const&) [52] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::end()
 [402] std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator!=(std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> > const&) const [173] std::pair<std::_Rb_tree_iterator<std::pair<int const, int*> >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, int*> > const&, bool const&) [34] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_key(std::_Rb_tree_node<std::pair<int const, int> > const*)
 [150] std::_Rb_tree_const_iterator<std::pair<std::pair<int, std::string> const, int> >::operator->() const [532] std::pair<std::_Rb_tree_iterator<std::pair<int const, int> >, bool>::pair(std::_Rb_tree_iterator<std::pair<int const, int> > const&, bool const&) [416] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_left(std::_Rb_tree_node_base*)
 [528] std::_Rb_tree_const_iterator<int>::operator==(std::_Rb_tree_const_iterator<int> const&) const [88] std::pair<double, int>::pair(double const&, int const&) [347] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_begin()
 [375] std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::key_comp() const [498] std::pair<int, std::string>::pair(int const&, std::string const&) [343] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<int const, int> >*)
 [538] std::map<std::pair<int, std::string>, int, std::less<std::pair<int, std::string> >, std::allocator<std::pair<std::pair<int, std::string> const, int> > >::key_comp() const [411] std::pair<int, int>::pair(int const&, int const&) [443] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_right(std::_Rb_tree_node_base const*)
 [166] std::less<std::string>::operator()(std::string const&, std::string const&) const [11] std::vector<TEvent, std::allocator<TEvent> >::_M_insert_aux(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent const&) [545] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_S_value(std::_Rb_tree_node_base const*)
 [539] std::less<std::pair<int, std::string> >::operator()(std::pair<int, std::string> const&, std::pair<int, std::string> const&) const [520] std::vector<TEvent, std::allocator<TEvent> >::end() [111] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree(std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > > const&)
 [390] std::vector<TEvent, std::allocator<TEvent> >::_M_range_check(unsigned long) const [211] std::vector<TEvent, std::allocator<TEvent> >::begin() [351] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_Rb_tree()
  [73] std::vector<TEvent, std::allocator<TEvent> >::end() const [6] std::vector<TEvent, std::allocator<TEvent> >::push_back(TEvent const&) [82] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::~_Rb_tree()
  [65] std::vector<TEvent, std::allocator<TEvent> >::begin() const [43] std::vector<TEvent, std::allocator<TEvent> >::vector(std::vector<TEvent, std::allocator<TEvent> > const&) [536] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_put_node(std::_Rb_tree_node<int>*)
 [357] std::vector<TEvent, std::allocator<TEvent> >::capacity() const [431] std::vector<TEvent, std::allocator<TEvent> >::vector() [570] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::_M_initialize()
 [116] std::vector<TEvent, std::allocator<TEvent> >::max_size() const [321] std::vector<TEvent, std::allocator<TEvent> >::~vector() [258] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree_impl<std::less<int>, false>::_Rb_tree_impl()
 [352] std::vector<std::string, std::allocator<std::string> >::_M_check_len(unsigned long, char const*) const [49] std::vector<TEvent, std::allocator<TEvent> >::operator=(std::vector<TEvent, std::allocator<TEvent> > const&) [474] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_create_node(int const&)
 [425] std::vector<std::string, std::allocator<std::string> >::_M_range_check(unsigned long) const [392] std::vector<TEvent, std::allocator<TEvent> >::operator[](unsigned long) [289] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_insert_unique(int const&)
  [72] std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() const [362] std::vector<std::string, std::allocator<std::string> >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::string*, std::vector<std::string, std::allocator<std::string> > >, std::string const&) [537] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_left(std::_Rb_tree_node_base const*)
 [221] std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size() const [302] std::vector<std::string, std::allocator<std::string> >::at(unsigned long) [544] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_begin()
 [125] std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::max_size() const [454] std::vector<std::string, std::allocator<std::string> >::begin() [254] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_M_erase(std::_Rb_tree_node<int>*)
 [575] std::vector<int, std::allocator<int> >::_M_check_len(unsigned long, char const*) const [320] std::vector<std::string, std::allocator<std::string> >::push_back(std::string const&) [556] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_right(std::_Rb_tree_node_base const*)
 [549] std::vector<int, std::allocator<int> >::max_size() const [421] std::vector<std::string, std::allocator<std::string> >::~vector() [557] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_S_value(std::_Rb_tree_node<int> const*)
 [562] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::key_comp() const [191] std::vector<std::string, std::allocator<std::string> >::operator[](unsigned long) [515] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::_Rb_tree()
 [255] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::get_allocator() const [54] std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int> const&) [202] void std::_Construct<std::string, std::string>(std::string*, std::string const&)
 [117] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::key_comp() const [35] std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::end() [144] TEvent* std::__copy_move_a<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*)
 [487] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::get_allocator() const [231] std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::vector(std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > const&) [107] TEvent* std::__copy_move_a<false, TEvent const*, TEvent*>(TEvent const*, TEvent const*, TEvent*)
 [453] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::size() const [499] std::vector<int, std::allocator<int> >::_M_insert_aux(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&) [475] TEvent* std::__copy_move_a2<false, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*)
 [508] std::_Rb_tree<std::string, std::pair<std::string const, int>, std::_Select1st<std::pair<std::string const, int> >, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >::key_comp() const [521] std::vector<int, std::allocator<int> >::at(unsigned long) [441] int* std::__copy_move_a2<false, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*)
 [464] std::_Rb_tree<int, std::pair<int const, int*>, std::_Select1st<std::pair<int const, int*> >, std::less<int>, std::allocator<std::pair<int const, int*> > >::_M_get_Node_allocator() const [463] std::vector<int, std::allocator<int> >::end() [126] TEvent* std::uninitialized_copy<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*)
 [478] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::get_allocator() const [176] std::vector<int, std::allocator<int> >::begin() [61] std::pair<int, int>* std::uninitialized_copy<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*>(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*)
 [530] std::_Rb_tree<int, std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::_Select1st<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >, std::less<int>, std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > > >::size() const [494] std::vector<int, std::allocator<int> >::push_back(int const&) [547] int* std::uninitialized_copy<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*>(__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int> > >, int*)
 [118] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::get_allocator() const [497] std::vector<int, std::allocator<int> >::vector(std::vector<int, std::allocator<int> > const&) [516] std::string* std::uninitialized_copy<std::string*, std::string*>(std::string*, std::string*, std::string*)
 [438] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::_M_get_Node_allocator() const [314] std::vector<int, std::allocator<int> >::~vector() [420] std::pair<int, int>* std::uninitialized_copy<std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*)
  [37] std::_Rb_tree<int, std::pair<int const, int>, std::_Select1st<std::pair<int const, int> >, std::less<int>, std::allocator<std::pair<int const, int> > >::size() const [112] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::string> const&) [583] int* std::uninitialized_copy<int*, int*>(int*, int*, int*)
 [568] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::end() const [404] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_leftmost() [442] TEvent* std::__copy_move_backward_a<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*)
 [526] std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::find(int const&) const [564] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [491] std::string* std::__copy_move_backward_a<false, std::string*, std::string*>(std::string*, std::string*, std::string*)
   [9] std::allocator<TEvent>::allocator(std::allocator<TEvent> const&) [565] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::lower_bound(std::string const&) [584] std::pair<int, int>* std::__copy_move_backward_a<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*)
 [256] std::allocator<TEvent>::allocator() [119] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() [394] TEvent* std::__uninitialized_copy_a<__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, TEvent>(__gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent const*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent*, std::allocator<TEvent>&)
 [576] std::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >::allocator() [495] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::_Rb_tree_impl() [350] std::pair<int, int>* std::__uninitialized_copy_a<__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*, std::pair<int, int> >(__gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > >, std::pair<int, int>*, std::allocator<std::pair<int, int> >&)
 [398] std::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >::~allocator() [181] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree_impl<std::less<std::string>, false>::~_Rb_tree_impl() [71] TEvent* std::__uninitialized_copy_a<TEvent*, TEvent*, TEvent>(TEvent*, TEvent*, TEvent*, std::allocator<TEvent>&)
 [550] std::allocator<std::_Rb_tree_node<std::pair<int const, int*> > >::allocator() [67] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_create_node(std::pair<std::string const, std::string> const&) [99] std::pair<int, int>* std::__uninitialized_copy_a<std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int> >(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&)
 [445] std::allocator<std::_Rb_tree_node<std::pair<int const, int> > >::allocator(std::allocator<std::_Rb_tree_node<std::pair<int const, int> > > const&) [489] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [192] std::string* std::__uninitialized_move_a<std::string*, std::string*, std::allocator<std::string> >(std::string*, std::string*, std::string*, std::allocator<std::string>&)
 [509] std::allocator<std::_Rb_tree_node<int> >::~allocator() [361] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique(std::pair<std::string const, std::string> const&) [108] int* std::__uninitialized_move_a<int*, int*, std::allocator<int> >(int*, int*, int*, std::allocator<int>&)
 [488] std::allocator<std::pair<std::pair<int, std::string> const, int> >::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > >(std::allocator<std::_Rb_tree_node<std::pair<std::pair<int, std::string> const, int> > > const&) [295] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::string> >, std::pair<std::string const, std::string> const&) [68] TEvent* std::__copy_move_backward_a2<false, TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*)
 [208] std::allocator<std::pair<std::string const, std::string> >::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > >(std::allocator<std::_Rb_tree_node<std::pair<std::string const, std::string> > > const&) [413] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_begin() [403] std::pair<int, int>* std::__copy_move_backward_a2<false, std::pair<int, int>*, std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*, std::pair<int, int>*)
 [257] std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >::~allocator() [22] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_M_erase(std::_Rb_tree_node<std::pair<std::string const, std::string> >*) [435] int* std::__copy_move_backward_a2<false, int*, int*>(int*, int*, int*)
 [466] std::allocator<std::pair<std::string const, int> >::~allocator() [96] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_right(std::_Rb_tree_node_base const*) [148] int const& std::max<int>(int const&, int const&)
 [377] std::allocator<std::pair<int const, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > > > >::~allocator() [581] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_right(std::_Rb_tree_node_base*) [109] unsigned long const& std::max<unsigned long>(unsigned long const&, unsigned long const&)
 [363] std::allocator<std::pair<int const, int> >::~allocator() [51] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, std::string> > const*) [585] int const& std::min<int>(int const&, int const&)
 [106] std::allocator<std::pair<int, int> >::allocator() [396] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::_Rb_tree() [27] TEvent* std::copy<TEvent*, TEvent*>(TEvent*, TEvent*, TEvent*)
 [240] TEvent* std::__copy_move<false, true, std::random_access_iterator_tag>::__copy_m<TEvent>(TEvent const*, TEvent const*, TEvent*) [76] std::_Rb_tree<std::string, std::pair<std::string const, std::string>, std::_Select1st<std::pair<std::string const, std::string> >, std::less<std::string>, std::allocator<std::pair<std::string const, std::string> > >::~_Rb_tree() [449] __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&)
 [429] void std::_Destroy_aux<true>::__destroy<int*>(int*, int*) [389] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_(std::_Rb_tree_node_base const*, std::_Rb_tree_node_base const*, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [10] __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > > std::__find<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, int const&, std::random_access_iterator_tag)
 [479] std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_impl::_Vector_impl(std::allocator<TEvent> const&) [476] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_put_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) [32] void std::_Destroy<__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, TEvent>(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, __gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, std::allocator<TEvent>&)
  [28] std::_Vector_base<TEvent, std::allocator<TEvent> >::_Vector_base(unsigned long, std::allocator<TEvent> const&) [16] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::lower_bound(std::string const&) [426] void std::_Destroy<std::string*>(std::string*, std::string*)
 [434] std::_Vector_base<std::string, std::allocator<std::string> >::_M_allocate(unsigned long) [490] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_Rb_tree_impl<std::less<std::string>, false>::_M_initialize() [465] void std::_Destroy<std::pair<int, int>*>(std::pair<int, int>*, std::pair<int, int>*)
 [577] std::_Vector_base<std::string, std::allocator<std::string> >::_Vector_impl::_Vector_impl() [502] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_Rb_tree_impl<std::less<std::string>, false>::~_Rb_tree_impl() [467] void std::_Destroy<std::pair<int, int>*, std::pair<int, int> >(std::pair<int, int>*, std::pair<int, int>*, std::allocator<std::pair<int, int> >&)
 [412] std::_Vector_base<std::string, std::allocator<std::string> >::_M_deallocate(std::string*, unsigned long) [469] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_create_node(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [110] void std::_Destroy<int*, int>(int*, int*, std::allocator<int>&)
 [232] std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl() [129] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_lower_bound(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*, std::string const&) [322] std::pair<int, std::string> std::make_pair<int, std::string>(int, std::string)
  [47] std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_impl::_Vector_impl(std::allocator<std::pair<int, int> > const&) [376] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_destroy_node(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >*) [147] bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*)
 [368] std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::_Vector_base(unsigned long, std::allocator<std::pair<int, int> > const&) [145] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique(std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [517] bool std::operator< <char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
 [220] std::_Vector_base<std::pair<int, int>, std::allocator<std::pair<int, int> > >::~_Vector_base() [8] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_insert_unique_(std::_Rb_tree_const_iterator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > const&) [560] bool std::operator< <int, std::string>(std::pair<int, std::string> const&, std::pair<int, std::string> const&)
  [15] std::_Vector_base<int, std::allocator<int> >::_M_allocate(unsigned long) [415] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::end() [335] std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char)
 [563] std::_Vector_base<int, std::allocator<int> >::_Vector_impl::_Vector_impl(std::allocator<int> const&) [120] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::find(std::string const&) [567] std::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
 [578] std::_Vector_base<int, std::allocator<int> >::_Vector_base() [485] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::begin() [63] main
  [93] std::_Vector_base<int, std::allocator<int> >::~_Vector_base() [370] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_M_end() [1] <cycle 1>
 [386] std::__miter_base<std::pair<int, int>*, false>::__b(std::pair<int, int>*) [42] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_key(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const*) [285] <cycle 2>
 [439] std::__miter_base<int*, false>::__b(int*) [393] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_right(std::_Rb_tree_node_base const*) [25] <cycle 3>
 [114] std::__niter_base<__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >, true>::__b(__gnu_cxx::__normal_iterator<TEvent*, std::vector<TEvent, std::allocator<TEvent> > >) [533] std::_Rb_tree<std::string, std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > >, std::_Select1st<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > >, std::less<std::string>, std::allocator<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > >::_S_value(std::_Rb_tree_node<std::pair<std::string const, std::vector<TEvent, std::allocator<TEvent> > > > const*) [141] <cycle 4>
