93         auto next_node = my_node_ptr->next();
95             next_node = next_node->next();
146     node_ptr next() const {  in next()  function
900         node_ptr next = my_head.next();  in internal_clear()  local
901         node_ptr curr = next;  in internal_clear()
906             next = curr->next();  in internal_clear()
908             curr = next;  in internal_clear()
1024         node_ptr curr = prev->next();  in search_after()
1030             curr = curr->next();  in search_after()
1054             next_node = prev_node->next();  in insert_dummy_node()
1058                 next_node = next_node->next();  in insert_dummy_node()
1149             first_node = first_node->next();  in first_value_node()
1157         node_ptr next_node = node_to_erase->next();  in internal_erase()
1184 …  for (node_ptr node = prev_node->next(); node != nullptr; prev_node = node, node = node->next()) {  in internal_extract()
1186                 unlink_node(prev_node, node, node_to_extract->next());  in internal_extract()
1201         for (node_ptr source_prev = &source.my_head; source_prev->next() != nullptr;) {  in internal_merge()
1202             if (!source_prev->next()->is_dummy()) {  in internal_merge()
1203                 value_node_ptr curr = static_cast<value_node_ptr>(source_prev->next());  in internal_merge()
1207                     node_ptr next_node = curr->next();  in internal_merge()
1220                         __TBB_ASSERT(source_prev->next() == next_node,  in internal_merge()
1241                 source_prev = source_prev->next();  in internal_merge()
1249         __TBB_ASSERT(prev_node->next() == node_to_unlink &&  in unlink_node()
1250                      node_to_unlink->next() == next_node,  in unlink_node()
1275             curr = curr->next();  in internal_find()
1298                     last = last->next();  in internal_equal_range()
1303             curr = curr->next();  in internal_equal_range()
1323         for (node_ptr node = other.my_head.next(); node != nullptr; node = node->next()) {  in internal_copy()
1343         for (node_ptr node = other.my_head.next(); node != nullptr; node = node->next()) {  in internal_move()
1362         my_head.set_next(other.my_head.next());  in move_content()
1419         node_ptr first_node = my_head.next();  in internal_swap_fields()
1420         my_head.set_next(other.my_head.next());  in internal_swap_fields()