Lines Matching refs:last

137                                 BidirectionalIterator last)  in next_partial_permutation()  argument
139 reverse (middle, last); in next_partial_permutation()
140 return next_permutation(first, last); in next_partial_permutation()
146 BidirectionalIterator last, Compare comp) in next_partial_permutation() argument
148 reverse (middle, last); in next_partial_permutation()
149 return next_permutation(first, last, comp); in next_partial_permutation()
168 BidirectionalIterator last) in prev_partial_permutation() argument
170 bool result = prev_permutation(first, last); in prev_partial_permutation()
171 reverse (middle, last); in prev_partial_permutation()
179 BidirectionalIterator last, Compare comp) in prev_partial_permutation() argument
181 bool result = prev_permutation(first, last); in prev_partial_permutation()
182 reverse (middle, last); in prev_partial_permutation()
202 BidirectionalIterator last) in next_combination() argument
204 return detail::next_combination(first, middle, middle, last); in next_combination()
210 BidirectionalIterator last, Compare comp) in next_combination() argument
212 return detail::next_combination(first, middle, middle, last, comp); in next_combination()
232 BidirectionalIterator last) in prev_combination() argument
234 return detail::next_combination(middle, last, first, middle); in prev_combination()
241 BidirectionalIterator last, Compare comp) in prev_combination() argument
243 return detail::next_combination(middle, last, first, middle, comp); in prev_combination()
262 BidirectionalIterator last, in next_mapping() argument
265 if (last == first ) { in next_mapping()
269 if (++(*(--last)) != last_value) { in next_mapping()
272 *last = first_value; in next_mapping()
273 } while (last != first); in next_mapping()
280 BidirectionalIterator last, in next_mapping() argument
283 if (last == first ) { in next_mapping()
287 if (incrementer(*(--last)) != last_value) { in next_mapping()
290 *last = first_value; in next_mapping()
291 } while (last != first); in next_mapping()
311 BidirectionalIterator last, in prev_mapping() argument
314 if (last == first) { in prev_mapping()
319 if (*(--last) != first_value) { in prev_mapping()
320 --(*last); in prev_mapping()
323 *last = last_value; in prev_mapping()
324 } while (last != first); in prev_mapping()
331 BidirectionalIterator last, in prev_mapping() argument
334 if (last == first) { in prev_mapping()
339 if (*(--last) != first_value) { in prev_mapping()
340 decrement(*last); in prev_mapping()
343 *last = last_value; in prev_mapping()
344 } while (last != first); in prev_mapping()
358 BidirectionalIterator last) in next_combination_counts() argument
360 BidirectionalIterator current = last; in next_combination_counts()
364 if (first != last && *first != 0) in next_combination_counts()
365 std::iter_swap(--last, first); in next_combination_counts()
369 std::iter_swap(--last, current); in next_combination_counts()
384 BidirectionalIterator last) in prev_combination_counts() argument
386 if (first == last) in prev_combination_counts()
388 BidirectionalIterator current = --last; in prev_combination_counts()
391 if (current == last || current == first && *current == 0) { in prev_combination_counts()
392 if (first != last) in prev_combination_counts()
393 std::iter_swap(first, last); in prev_combination_counts()
398 if (0 != *last) { in prev_combination_counts()
399 std::iter_swap(current, last); in prev_combination_counts()