Lines Matching refs:prev
168 node_pointer first_node = static_cast<node_pointer>(prev->next_);
172 - std::size_t count = this->delete_nodes(prev, end);
173 + std::size_t count_var = this->delete_nodes(prev, end_var);
174 this->fix_bucket(bucket_index, prev);
194 - link_pointer prev = split_groups(begin, end);
195 + link_pointer prev = split_groups(begin_arg, end_arg);
197 - // If we don't have a 'prev' it means that begin is at the
198 + // If we don't have a 'prev' it means that begin_arg is at the
201 if (!prev) {
202 prev = this->get_previous_start(bucket_index);
203 - while (prev->next_ != begin)
204 + while (prev->next_ != begin_arg)
205 prev = static_cast<node_pointer>(prev->next_)->group_prev_;
209 static_cast<node_pointer>(prev->next_)->group_prev_->next_;
210 this->delete_nodes(prev, group_end);
211 bucket_index = this->fix_bucket(bucket_index, prev);
212 - } while(prev->next_ != end);
213 + } while(prev->next_ != end_arg);
215 return prev;
221 - node_pointer prev = begin->group_prev_;
222 - if (prev->next_ != begin) prev = node_pointer();
223 + node_pointer prev = begin_arg->group_prev_;
224 + if (prev->next_ != begin_arg) prev = node_pointer();
236 - if (first == begin) return prev;
238 + if (first == begin_arg) return prev;
241 if (prev) {
250 return prev;
255 return prev ? iterator(prev->next_) : iterator();
294 link_pointer end = static_cast<node_pointer>(prev->next_)->next_;
296 - std::size_t count = this->delete_nodes(prev, end);
297 + std::size_t count_var = this->delete_nodes(prev, end);
298 this->fix_bucket(bucket_index, prev);
316 link_pointer prev = this->get_previous_start(bucket_index);
317 - while(prev->next_ != begin) prev = prev->next_;
318 + while(prev->next_ != begin_arg) prev = prev->next_;
322 this->delete_node(prev);
323 bucket_index = this->fix_bucket(bucket_index, prev);
324 - } while (prev->next_ != end);
325 + } while (prev->next_ != end_arg);