/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/Utilities/NewTimer.h: 119 - 121
--------------------------------------------------------------------------------

119:       if (!(this->long_buckets[j] == rhs.long_buckets[j]))
120:       {
121:         return this->long_buckets[j] < rhs.long_buckets[j];
/usr/include/c++/11/bits/stl_tree.h: 273 - 2437
--------------------------------------------------------------------------------

273:       _Rb_tree_iterator(_Base_ptr __x) _GLIBCXX_NOEXCEPT
[...]
287: 	_M_node = _Rb_tree_increment(_M_node);
[...]
302: 	_M_node = _Rb_tree_decrement(_M_node);
303: 	return *this;
[...]
735:       { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); }
[...]
750:       { return &this->_M_impl._M_header; }
[...]
780:       { return static_cast<_Link_type>(__x->_M_left); }
[...]
788:       { return static_cast<_Link_type>(__x->_M_right); }
[...]
1904:       while (__x != 0)
1905: 	if (!_M_impl._M_key_compare(_S_key(__x), __k))
[...]
2068:       while (__x != 0)
2069: 	{
2070: 	  __y = __x;
2071: 	  __comp = _M_impl._M_key_compare(__k, _S_key(__x));
2072: 	  __x = __comp ? _S_left(__x) : _S_right(__x);
2073: 	}
2074:       iterator __j = iterator(__y);
2075:       if (__comp)
2076: 	{
2077: 	  if (__j == begin())
2078: 	    return _Res(__x, __y);
2079: 	  else
2080: 	    --__j;
2081: 	}
2082:       if (_M_impl._M_key_compare(_S_key(__j._M_node), __k))
2083: 	return _Res(__x, __y);
[...]
2174: 	      && _M_impl._M_key_compare(_S_key(_M_rightmost()), __k))
2175: 	    return _Res(0, _M_rightmost());
2176: 	  else
2177: 	    return _M_get_insert_unique_pos(__k);
2178: 	}
2179:       else if (_M_impl._M_key_compare(__k, _S_key(__pos._M_node)))
2180: 	{
2181: 	  // First, try before...
2182: 	  iterator __before = __pos;
2183: 	  if (__pos._M_node == _M_leftmost()) // begin()
2184: 	    return _Res(_M_leftmost(), _M_leftmost());
2185: 	  else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k))
2186: 	    {
2187: 	      if (_S_right(__before._M_node) == 0)
[...]
2195:       else if (_M_impl._M_key_compare(_S_key(__pos._M_node), __k))
2196: 	{
2197: 	  // ... then try after.
2198: 	  iterator __after = __pos;
2199: 	  if (__pos._M_node == _M_rightmost())
2200: 	    return _Res(0, _M_rightmost());
2201: 	  else if (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node)))
2202: 	    {
2203: 	      if (_S_right(__pos._M_node) == 0)
[...]
2333:       bool __insert_left = (__x != 0 || __p == _M_end()
2334: 			    || _M_impl._M_key_compare(_S_key(__z),
2335: 						      _S_key(__p)));
2336: 
2337:       _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
2338: 				    this->_M_impl._M_header);
2339:       ++_M_impl._M_node_count;
2340:       return iterator(__z);
[...]
2437: 	    if (__res.second)
/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/Utilities/NewTimer.cpp: 84 - 120
--------------------------------------------------------------------------------

84: void TimerType<CLOCK>::stop()
85: {
86:   if (active)
[...]
98:     bool is_true_master(true);
99:     for (int level = omp_get_level(); level > 0; level--)
100:       if (omp_get_ancestor_thread_num(level) != 0)
101:         is_true_master = false;
102:     if (is_true_master)
103:     {
104:       std::chrono::duration<double> elapsed = CLOCK::now() - start_time;
105:       total_time += elapsed.count();
106:       num_calls++;
107: 
108:       per_stack_total_time[current_stack_key] += elapsed.count();
109:       per_stack_num_calls[current_stack_key] += 1;
110: 
111:       if (manager)
112:         manager->pop_timer(this);
[...]
120: }
/usr/include/c++/11/tuple: 1833 - 1834
--------------------------------------------------------------------------------

1833:       : first(std::forward<_Args1>(std::get<_Indexes1>(__tuple1))...),
1834: 	second(std::forward<_Args2>(std::get<_Indexes2>(__tuple2))...)
/usr/include/c++/11/bits/stl_map.h: 499 - 499
--------------------------------------------------------------------------------

499: 	if (__i == end() || key_comp()(__k, (*__i).first))
/usr/include/c++/11/chrono: 227 - 666
--------------------------------------------------------------------------------

227: 	      static_cast<_CR>(__d.count()) / static_cast<_CR>(_CF::den)));
[...]
666: 	return __cd(__cd(__lhs).count() - __cd(__rhs).count());
/usr/include/c++/11/ext/new_allocator.h: 127 - 145
--------------------------------------------------------------------------------

127: 	return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));
[...]
145: 	::operator delete(__p
