/usr/include/c++/14/bits/chrono.h: 214 - 716
--------------------------------------------------------------------------------

214: 	      static_cast<_CR>(__d.count()) / static_cast<_CR>(_CF::den)));
[...]
716: 	return __cd(__cd(__lhs).count() - __cd(__rhs).count());
/usr/include/c++/14/bits/stl_map.h: 511 - 511
--------------------------------------------------------------------------------

511: 	if (__i == end() || key_comp()(__k, (*__i).first))
/usr/include/c++/14/tuple: 2887 - 2888
--------------------------------------------------------------------------------

2887:       : first(std::forward<_Args1>(std::get<_Indexes1>(__tuple1))...),
2888: 	second(std::forward<_Args2>(std::get<_Indexes2>(__tuple2))...)
/home/eoseret/qaas/qaas_runs/178-212-9071/intel/miniqmc/build/miniqmc/src/Utilities/NewTimer.h: 119 - 124
--------------------------------------------------------------------------------

119:       if (!(this->long_buckets[j] == rhs.long_buckets[j]))
120:       {
121:         return this->long_buckets[j] < rhs.long_buckets[j];
122:       }
123:     }
124:     return this->long_buckets[N - 1] < rhs.long_buckets[N - 1];
/usr/include/c++/14/bits/stl_tree.h: 269 - 2459
--------------------------------------------------------------------------------

269:       _Rb_tree_iterator(_Base_ptr __x) _GLIBCXX_NOEXCEPT
[...]
283: 	_M_node = _Rb_tree_increment(_M_node);
[...]
298: 	_M_node = _Rb_tree_decrement(_M_node);
299: 	return *this;
[...]
631:       }
[...]
733:       { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); }
[...]
748:       { return &this->_M_impl._M_header; }
[...]
778:       { return static_cast<_Link_type>(__x->_M_left); }
[...]
786:       { return static_cast<_Link_type>(__x->_M_right); }
[...]
1636: 	~_Auto_node()
[...]
1947:       while (__x != 0)
1948: 	if (!_M_impl._M_key_compare(_S_key(__x), __k))
1949: 	  __y = __x, __x = _S_left(__x);
[...]
2109:       _Base_ptr __y = _M_end();
2110:       bool __comp = true;
2111:       while (__x != 0)
2112: 	{
2113: 	  __y = __x;
2114: 	  __comp = _M_impl._M_key_compare(__k, _S_key(__x));
2115: 	  __x = __comp ? _S_left(__x) : _S_right(__x);
2116: 	}
2117:       iterator __j = iterator(__y);
2118:       if (__comp)
2119: 	{
2120: 	  if (__j == begin())
2121: 	    return _Res(__x, __y);
2122: 	  else
2123: 	    --__j;
2124: 	}
2125:       if (_M_impl._M_key_compare(_S_key(__j._M_node), __k))
[...]
2217: 	      && _M_impl._M_key_compare(_S_key(_M_rightmost()), __k))
2218: 	    return _Res(0, _M_rightmost());
2219: 	  else
2220: 	    return _M_get_insert_unique_pos(__k);
2221: 	}
2222:       else if (_M_impl._M_key_compare(__k, _S_key(__pos._M_node)))
2223: 	{
2224: 	  // First, try before...
2225: 	  iterator __before = __pos;
2226: 	  if (__pos._M_node == _M_leftmost()) // begin()
2227: 	    return _Res(_M_leftmost(), _M_leftmost());
2228: 	  else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k))
2229: 	    {
2230: 	      if (_S_right(__before._M_node) == 0)
[...]
2242: 	  if (__pos._M_node == _M_rightmost())
2243: 	    return _Res(0, _M_rightmost());
2244: 	  else if (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node)))
2245: 	    {
2246: 	      if (_S_right(__pos._M_node) == 0)
[...]
2373:     _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2374:     _M_insert_node(_Base_ptr __x, _Base_ptr __p, _Link_type __z)
2375:     -> iterator
2376:     {
2377:       bool __insert_left = (__x != 0 || __p == _M_end()
2378: 			    || _M_impl._M_key_compare(_S_key(__z),
2379: 						      _S_key(__p)));
2380: 
2381:       _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
2382: 				    this->_M_impl._M_header);
2383:       ++_M_impl._M_node_count;
[...]
2459: 	auto __res = _M_get_insert_hint_unique_pos(__pos, __z._M_key());
/home/eoseret/qaas/qaas_runs/178-212-9071/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++/14/bits/new_allocator.h: 151 - 172
--------------------------------------------------------------------------------

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