83         reference operator[] (std::size_t index) {
84             __TBB_ASSERT(index < items_per_page, "Index out of range");
85             return items[index];
88         const_reference operator[] (std::size_t index) const {
89             __TBB_ASSERT(index < items_per_page, "Index out of range");
90             return items[index];
115         size_type index = modulo_power_of_two(k / queue_rep_type::n_queue, items_per_page);  in prepare_page()  local
116         if (!index) {  in prepare_page()
141         return index;  in prepare_page()
149         size_type index = prepare_page(k, base, page_allocator, p);  in push()  local
160         page_allocator_traits::construct(page_allocator, &(*p)[index], std::forward<Args>(args)...);  in push()
162 …p->mask.store(p->mask.load(std::memory_order_relaxed) | uintptr_t(1) << index, std::memory_order_r…  in push()
184         size_type index = modulo_power_of_two( k/queue_rep_type::n_queue, items_per_page );  in pop()  local
189                 k + queue_rep_type::n_queue, index == items_per_page - 1 ? p : nullptr );  in pop()
190             if (p->mask.load(std::memory_order_relaxed) & (std::uintptr_t(1) << index)) {  in pop()
192                 assign_and_destroy_item(dst, *p, index);  in pop()
211 …size_type index = modulo_power_of_two(head_counter.load(std::memory_order_relaxed) / queue_rep_typ…  in assign()  local
212 …size_type end_in_first_page = (index+n_items < items_per_page) ? (index + n_items) : items_per_pag…  in assign()
215 …head_page.store(make_copy(allocator, srcp, index, end_in_first_page, g_index, construct_item), std…  in assign()
285 …size_type index = (head_counter.load(std::memory_order_relaxed) / queue_rep_type::n_queue) % items…  variable
289             while (index != items_per_page) {
290 …              if (curr_page->mask.load(std::memory_order_relaxed) & (std::uintptr_t(1) << index)) {
291                     page_allocator_traits::destroy(page_allocator, &curr_page->operator[](index));
293                 ++index;
296             index = 0;
334     void assign_and_destroy_item( void* dst, padded_page& src, size_type index ) {  in assign_and_destroy_item()  argument
335         auto& from = src[index];  in assign_and_destroy_item()
435         for (size_type index = 0; index < n_queue; ++index) {  in clear()  local
436             array[index].clear(alloc);  in clear()
488     static size_type index( ticket_type k ) {  in index()  function
494         return array[index(k)];  in choose()
553             padded_page*& root = my_array[queue_rep_type::index(k)];  in advance()
571             padded_page* p = my_array[queue_rep_type::index(k)];  in get_item()