192     depth_t my_head;  variable
200     range_vector(const T& elem) : my_head(0), my_tail(0), my_size(1) {  in range_vector()
213             depth_t prev = my_head;  in split_to_fill()
214             my_head = (my_head + 1) % MaxCapacity;  in split_to_fill()
215             new(my_pool.begin()+my_head) T(my_pool.begin()[prev]); // copy TODO: std::move?  in split_to_fill()
217 …      new(my_pool.begin()+prev) T(my_pool.begin()[my_head], detail::split()); // do 'inverse' split  in split_to_fill()
218             my_depth[my_head] = ++my_depth[prev];  in split_to_fill()
224         my_pool.begin()[my_head].~T();  in pop_back()
226         my_head = (my_head + MaxCapacity - 1) % MaxCapacity;  in pop_back()
236         return my_pool.begin()[my_head];  in back()
249         return my_depth[my_head];  in back_depth()
363     std::size_t my_head;  member
366     linear_affinity_mode() : proportional_mode<Partition>(), my_head(get_initial_partition_head()),  in linear_affinity_mode()
369 …, my_head((src.my_head + src.my_divisor) % src.my_max_affinity), my_max_affinity(src.my_max_affini…  in linear_affinity_mode()
371 …, my_head((src.my_head + src.my_divisor) % src.my_max_affinity), my_max_affinity(src.my_max_affini…  in linear_affinity_mode()
374             spawn(t, ctx, slot_id(my_head));  in spawn_task()
549             my_array[my_head] = id;  in note_affinity()
553             if (!my_array[my_head]) {  in spawn_task()
555                 spawn(t, ctx, slot_id(my_head / factor));  in spawn_task()
557                 spawn(t, ctx, my_array[my_head]);  in spawn_task()