/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/chrono.h: 212 - 727
--------------------------------------------------------------------------------

212: 	      static_cast<_CR>(__d.count()) / static_cast<_CR>(_CF::den)));
[...]
727: 	return __cd(__cd(__lhs).count() - __cd(__rhs).count());
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/stl_map.h: 511 - 511
--------------------------------------------------------------------------------

511: 	if (__i == end() || key_comp()(__k, (*__i).first))
/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/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];
/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/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/13.2.0/include/c++/13.2.0/bits/stl_tree.h: 273 - 2463
--------------------------------------------------------------------------------

273:       _Rb_tree_iterator(_Base_ptr __x) _GLIBCXX_NOEXCEPT
274:       : _M_node(__x) { }
[...]
285:       operator++() _GLIBCXX_NOEXCEPT
286:       {
287: 	_M_node = _Rb_tree_increment(_M_node);
[...]
302: 	_M_node = _Rb_tree_decrement(_M_node);
303: 	return *this;
[...]
737:       { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); }
[...]
752:       { return &this->_M_impl._M_header; }
[...]
782:       { return static_cast<_Link_type>(__x->_M_left); }
[...]
790:       { return static_cast<_Link_type>(__x->_M_right); }
[...]
1640: 	~_Auto_node()
[...]
1951:       while (__x != 0)
1952: 	if (!_M_impl._M_key_compare(_S_key(__x), __k))
1953: 	  __y = __x, __x = _S_left(__x);
[...]
2113:       _Base_ptr __y = _M_end();
2114:       bool __comp = true;
2115:       while (__x != 0)
2116: 	{
2117: 	  __y = __x;
2118: 	  __comp = _M_impl._M_key_compare(__k, _S_key(__x));
2119: 	  __x = __comp ? _S_left(__x) : _S_right(__x);
2120: 	}
2121:       iterator __j = iterator(__y);
2122:       if (__comp)
2123: 	{
2124: 	  if (__j == begin())
2125: 	    return _Res(__x, __y);
2126: 	  else
2127: 	    --__j;
2128: 	}
2129:       if (_M_impl._M_key_compare(_S_key(__j._M_node), __k))
[...]
2221: 	      && _M_impl._M_key_compare(_S_key(_M_rightmost()), __k))
2222: 	    return _Res(0, _M_rightmost());
2223: 	  else
2224: 	    return _M_get_insert_unique_pos(__k);
2225: 	}
2226:       else if (_M_impl._M_key_compare(__k, _S_key(__pos._M_node)))
2227: 	{
2228: 	  // First, try before...
2229: 	  iterator __before = __pos;
2230: 	  if (__pos._M_node == _M_leftmost()) // begin()
2231: 	    return _Res(_M_leftmost(), _M_leftmost());
2232: 	  else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k))
2233: 	    {
2234: 	      if (_S_right(__before._M_node) == 0)
[...]
2246: 	  if (__pos._M_node == _M_rightmost())
2247: 	    return _Res(0, _M_rightmost());
2248: 	  else if (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node)))
2249: 	    {
2250: 	      if (_S_right(__pos._M_node) == 0)
[...]
2377:     _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2378:     _M_insert_node(_Base_ptr __x, _Base_ptr __p, _Link_type __z)
2379:     -> iterator
2380:     {
2381:       bool __insert_left = (__x != 0 || __p == _M_end()
2382: 			    || _M_impl._M_key_compare(_S_key(__z),
2383: 						      _S_key(__p)));
2384: 
2385:       _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
2386: 				    this->_M_impl._M_header);
2387:       ++_M_impl._M_node_count;
[...]
2463: 	auto __res = _M_get_insert_hint_unique_pos(__pos, __z._M_key());
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/tuple: 2253 - 2254
--------------------------------------------------------------------------------

2253:       : first(std::forward<_Args1>(std::get<_Indexes1>(__tuple1))...),
2254: 	second(std::forward<_Args2>(std::get<_Indexes2>(__tuple2))...)
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/new_allocator.h: 147 - 168
--------------------------------------------------------------------------------

147: 	return static_cast<_Tp*>(_GLIBCXX_OPERATOR_NEW(__n * sizeof(_Tp)));
[...]
168: 	_GLIBCXX_OPERATOR_DELETE(_GLIBCXX_SIZED_DEALLOC(__p, __n));
