Lines Matching defs:projection
29 auto projection = [](Value const& val) -> Value { return val; };
36 (void)func(it, it, pred, projection);
37 (void)func(in, pred, projection);
44 (void)func(it, it, it, it, pred, projection);
45 (void)func(in, in, pred, projection);
70 (void)std::ranges::lower_bound(it, it, val, pred2, projection);
71 (void)std::ranges::lower_bound(in, val, pred2, projection);
77 (void)std::ranges::upper_bound(it, it, val, pred2, projection);
78 (void)std::ranges::upper_bound(in, val, pred2, projection);
84 (void)std::ranges::equal_range(it, it, val, pred2, projection);
85 (void)std::ranges::equal_range(in, val, pred2, projection);
91 (void)std::ranges::binary_search(it, it, val, pred2, projection);
92 (void)std::ranges::binary_search(in, val, pred2, projection);
97 (void)std::ranges::min(val, val, pred2, projection);
99 (void)std::ranges::min(ilist, pred2, projection);
101 (void)std::ranges::min(in, pred2, projection);
106 (void)std::ranges::max(val, val, pred2, projection);
108 (void)std::ranges::max(ilist, pred2, projection);
110 (void)std::ranges::max(in, pred2, projection);
115 (void)std::ranges::minmax(val, val, pred2, projection);
117 (void)std::ranges::minmax(ilist, pred2, projection);
119 (void)std::ranges::minmax(in, pred2, projection);
131 (void)std::ranges::search_n(it, it, n, val, pred2, projection);
132 (void)std::ranges::search_n(in, n, val, pred2, projection);
145 (void)std::ranges::clamp(val, val, val, pred2, projection);
152 (void)std::ranges::copy_if(it, it, out, pred1, projection);
153 (void)std::ranges::copy_if(in, out, pred1, projection);
158 (void)std::ranges::remove_copy_if(it, it, out, pred1, projection);
159 (void)std::ranges::remove_copy_if(in, out, pred1, projection);
165 (void)std::ranges::remove_copy(it, it, out, val, projection);
166 (void)std::ranges::remove_copy(in, out, val, projection);
172 (void)std::ranges::replace(it, it, val, val, projection);
173 (void)std::ranges::replace(in, val, val, projection);
179 (void)std::ranges::replace_if(it, it, pred1, val, projection);
180 (void)std::ranges::replace_if(in, pred1, val, projection);
186 (void)std::ranges::replace_copy_if(it, it, out, pred1, val, projection);
187 (void)std::ranges::replace_copy_if(in, out, pred1, val, projection);
193 (void)std::ranges::replace_copy(it, it, out, val, val, projection);
194 (void)std::ranges::replace_copy(in, out, val, val, projection);
200 (void)std::ranges::unique_copy(it, it, out, pred2, projection);
201 (void)std::ranges::unique_copy(in, out, pred2, projection);
207 (void)std::ranges::partition_copy(it, it, out, out, pred1, projection);
208 (void)std::ranges::partition_copy(in, out, out, pred1, projection);
218 (void)std::ranges::merge(it, it, it, it, out, pred2, projection, projection);
219 (void)std::ranges::merge(in, in, out, pred2, projection, projection);
225 (void)std::ranges::set_difference(it, it, it, it, out, pred2, projection, projection);
226 (void)std::ranges::set_difference(in, in, out, pred2, projection, projection);
232 (void)std::ranges::set_intersection(it, it, it, it, out, pred2, projection, projection);
233 (void)std::ranges::set_intersection(in, in, out, pred2, projection, projection);
239 (void)std::ranges::set_symmetric_difference(it, it, it, it, out, pred2, projection, projection);
240 (void)std::ranges::set_symmetric_difference(in, in, out, pred2, projection, projection);
246 (void)std::ranges::set_union(it, it, it, it, out, pred2, projection, projection);
247 (void)std::ranges::set_union(in, in, out, pred2, projection, projection);
253 (void)std::ranges::remove(it, it, val, projection);
255 (void)std::ranges::remove(in, val, projection);
266 (void)std::ranges::partial_sort(it, it, it, pred2, projection);
267 (void)std::ranges::partial_sort(in, it, pred2, projection);
273 (void)std::ranges::nth_element(it, it, it, pred2, projection);
274 (void)std::ranges::nth_element(in, it, pred2, projection);
280 (void)std::ranges::inplace_merge(it, it, it, pred2, projection);
281 (void)std::ranges::inplace_merge(in, it, pred2, projection);