/cluster/comp/gcc/15.1.0/include/c++/15.1.0/tuple: 2886 - 2887
--------------------------------------------------------------------------------

2886:       : first(std::forward<_Args1>(std::get<_Indexes1>(__tuple1))...),
2887: 	second(std::forward<_Args2>(std::get<_Indexes2>(__tuple2))...)
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/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: }
/cluster/comp/gcc/15.1.0/include/c++/15.1.0/bits/new_allocator.h: 126 - 172
--------------------------------------------------------------------------------

126:       allocate(size_type __n, const void* = static_cast<const void*>(0))
[...]
151: 	return static_cast<_Tp*>(_GLIBCXX_OPERATOR_NEW(__n * sizeof(_Tp)));
[...]
172: 	_GLIBCXX_OPERATOR_DELETE(_GLIBCXX_SIZED_DEALLOC(__p, __n));
/cluster/comp/gcc/15.1.0/include/c++/15.1.0/bits/chrono.h: 218 - 720
--------------------------------------------------------------------------------

218: 	      static_cast<_CR>(__d.count()) / static_cast<_CR>(_CF::den)));
[...]
720: 	return __cd(__cd(__lhs).count() - __cd(__rhs).count());
/cluster/comp/gcc/15.1.0/include/c++/15.1.0/bits/stl_tree.h: 389 - 3085
--------------------------------------------------------------------------------

389:       : _M_node(__x) { }
[...]
400:       operator++() _GLIBCXX_NOEXCEPT
401:       {
402: 	_M_node = _Rb_tree_increment(_M_node);
[...]
417: 	_M_node = _Rb_tree_decrement(_M_node);
418: 	return *this;
[...]
693: 	return _Rb_tree_insert_and_rebalance(__insert_left, __x, __p, __header);
[...]
1275:       }
[...]
1378:       { return this->_M_impl._M_header._M_parent; }
[...]
1391:       { return this->_M_impl._M_header._M_base_ptr(); }
[...]
1425:       { return __x->_M_left; }
[...]
1437:       { return __x->_M_right; }
[...]
1621:       { return iterator(this->_M_impl._M_header._M_left); }
[...]
2288: 	~_Auto_node()
[...]
2603:       while (__x)
2604: 	if (!_M_impl._M_key_compare(_S_key(__x), __k))
2605: 	  __y = __x, __x = _S_left(__x);
[...]
2737:       while (__x)
2738: 	{
2739: 	  __y = __x;
2740: 	  __comp = _M_impl._M_key_compare(__k, _S_key(__x));
2741: 	  __x = __comp ? _S_left(__x) : _S_right(__x);
2742: 	}
2743:       iterator __j = iterator(__y);
2744:       if (__comp)
2745: 	{
2746: 	  if (__j == begin())
2747: 	    return _Res(__x, __y);
2748: 	  else
2749: 	    --__j;
2750: 	}
2751:       if (_M_impl._M_key_compare(_S_key(__j._M_node), __k))
[...]
2842: 	      && _M_impl._M_key_compare(_S_key(_M_rightmost()), __k))
2843: 	    return _Res(_Base_ptr(), _M_rightmost());
2844: 	  else
2845: 	    return _M_get_insert_unique_pos(__k);
2846: 	}
2847:       else if (_M_impl._M_key_compare(__k, _S_key(__position._M_node)))
2848: 	{
2849: 	  // First, try before...
2850: 	  iterator __before(__position._M_node);
2851: 	  if (__position._M_node == _M_leftmost()) // begin()
2852: 	    return _Res(_M_leftmost(), _M_leftmost());
2853: 	  else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k))
2854: 	    {
2855: 	      if (!_S_right(__before._M_node))
[...]
2867: 	  if (__position._M_node == _M_rightmost())
2868: 	    return _Res(_Base_ptr(), _M_rightmost());
2869: 	  else if (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node)))
2870: 	    {
2871: 	      if (!_S_right(__position._M_node))
[...]
3001:       bool __insert_left = (__x || __p == _M_end()
3002: 			    || _M_impl._M_key_compare(_S_key(__z),
3003: 						      _S_key(__p)));
3004: 
3005:       _Base_ptr __base_z = __z->_M_base_ptr();
3006:       _Node_traits::_S_insert_and_rebalance
3007: 	(__insert_left, __base_z, __p, this->_M_impl._M_header);
3008:       ++_M_impl._M_node_count;
[...]
3085: 	auto __res = _M_get_insert_hint_unique_pos(__pos, __z._M_key());
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Utilities/NewTimer.h: 117 - 121
--------------------------------------------------------------------------------

117:     for (int j = 0; j < N; j++)
118:     {
119:       if (!(this->long_buckets[j] == rhs.long_buckets[j]))
120:       {
121:         return this->long_buckets[j] < rhs.long_buckets[j];
/cluster/comp/gcc/15.1.0/include/c++/15.1.0/bits/stl_map.h: 534 - 534
--------------------------------------------------------------------------------

534: 	if (__i == end() || key_comp()(__k, (*__i).first))
