Searched refs:next_node (Results 1 – 2 of 2) sorted by relevance
94 while(next_node && next_node->is_dummy()) {95 next_node = next_node->next();150 void set_next( node_ptr next_node ) { in set_next() argument1051 node_ptr next_node; in insert_dummy_node() local1056 while (next_node != nullptr && next_node->order_key() < order_key) { in insert_dummy_node()1057 prev_node = next_node; in insert_dummy_node()1058 next_node = next_node->next(); in insert_dummy_node()1061 if (next_node != nullptr && next_node->order_key() == order_key) { in insert_dummy_node()1065 return next_node; in insert_dummy_node()1160 return next_node; in internal_erase()[all …]
1042 node_ptr next_node = erase_node->next(0); in internal_extract() local1052 result.second = next_node; in internal_extract()