| /third_party/boost/boost/sort/common/util/ |
| D | merge.hpp | 91 typedef value_iter<Iter1_t> value1_t; in merge()
92 typedef value_iter<Iter2_t> value2_t; in merge()
93 typedef value_iter<Iter3_t> value3_t; in merge()
153 typedef value_iter<Iter1_t> type1; in merge_construct()
154 typedef value_iter<Iter2_t> type2; in merge_construct()
216 typedef value_iter<Iter1_t> value1_t; in merge_half()
217 typedef value_iter<Iter2_t> value2_t; in merge_half()
278 typedef value_iter<Iter1_t> value1_t; in merge_half_backward()
279 typedef value_iter<Iter2_t> value2_t; in merge_half_backward()
343 typedef value_iter<Iter1_t> type1; in merge_uncontiguous()
[all …]
|
| D | algorithm.hpp | 167 template <class Iter_t, class Value_t = value_iter<Iter_t> >
173 typedef value_iter<Iter_t> value_t; in initialize()
206 typedef value_iter<Iter1_t> value1_t; in move_forward()
207 typedef value_iter<Iter2_t> value2_t; in move_forward()
234 typedef value_iter<Iter1_t> value1_t; in move_backward()
235 typedef value_iter<Iter2_t> value2_t; in move_backward()
257 template<class Iter_t, class Value_t = value_iter<Iter_t> >
|
| D | search.hpp | 66 template <class Iter_t, class Filter = filter_pass<value_iter<Iter_t> >,
100 template<class Iter_t, class Filter = filter_pass<value_iter<Iter_t> >,
139 template<class Iter_t, class Filter = filter_pass<value_iter<Iter_t> >,
164 template <class Iter_t, class Filter = filter_pass<value_iter<Iter_t> >,
186 template<class Iter_t, class Filter = filter_pass<value_iter<Iter_t> >,
210 template<class Iter_t, class Filter = filter_pass<value_iter<Iter_t> >,
234 template<class Iter_t, class Filter = filter_pass<value_iter<Iter_t> >,
256 template<class Iter_t, class Filter = filter_pass<value_iter<Iter_t> >,
278 template<class Iter_t, class Filter = filter_pass<value_iter<Iter_t> >,
|
| D | insert.hpp | 66 typedef value_iter<Iter1_t> value_t; in insert_sorted()
67 typedef value_iter<Iter2_t> value2_t; in insert_sorted()
104 typedef value_iter<Iter1_t> value_t; in insert_sorted_backward()
105 typedef value_iter<Iter2_t> value2_t; in insert_sorted_backward()
|
| D | circular_buffer.hpp | 370 static_assert ( std::is_same <value_iter<iter_t>, Value_t>::value, in pop_copy_front()
398 static_assert ( std::is_same <value_iter<iter_t>, Value_t>::value, in pop_move_front()
425 static_assert ( std::is_same <value_iter<iter_t>, Value_t>::value, in pop_copy_back()
450 static_assert ( std::is_same <value_iter<iter_t>, Value_t>::value, in pop_move_back()
475 static_assert ( std::is_same <value_iter<iter_t>, Value_t>::value, in push_copy_front()
502 static_assert ( std::is_same <value_iter<iter_t>, Value_t>::value, in push_move_front()
527 static_assert ( std::is_same <value_iter<iter_t>, Value_t>::value, in push_copy_back()
552 static_assert ( std::is_same <value_iter<iter_t>, Value_t>::value, in push_move_back()
|
| D | traits.hpp | 40 using value_iter = typename iterator_traits< iter_t >::value_type; typedef
51 using compare_iter = std::less< value_iter< iter_t > >;
|
| /third_party/grpc/src/compiler/ |
| D | ruby_generator_map-inl.h | 44 auto value_iter = values.begin(); in ListToDict() local
46 std::string key = *value_iter; in ListToDict()
47 ++value_iter; in ListToDict()
48 std::string value = *value_iter; in ListToDict()
50 ++value_iter; in ListToDict()
|
| /third_party/boost/boost/sort/common/ |
| D | sort_basic.hpp | 50 template<class Iter_t, class Compare = std::less<value_iter<Iter_t> > >
73 template<class Iter_t, class Compare = std::less<value_iter<Iter_t> > >
96 template<class Iter_t, class Compare = std::less<value_iter<Iter_t> > >
134 template<class Iter_t, class Compare = std::less<value_iter<Iter_t> > >
157 template<class Iter_t, class Compare = std::less<value_iter<Iter_t> > >
181 template<class Iter_t, class Compare = std::less<value_iter<Iter_t> > >
222 typedef value_iter<Iter1_t> value_t; in internal_sort()
223 typedef value_iter<Iter2_t> value2_t; in internal_sort()
269 typedef value_iter<Iter1_t> value_t; in range_sort_data()
270 typedef value_iter<Iter2_t> value2_t; in range_sort_data()
[all …]
|
| D | range.hpp | 154 template<class Iter_t, class Value_t = util::value_iter<Iter_t> >
180 template<class Iter_t, class Value_t = util::value_iter<Iter_t> >
203 typedef util::value_iter<Iter1_t> type1; in is_mergeable()
204 typedef util::value_iter<Iter2_t> type2; in is_mergeable()
229 typedef util::value_iter<Iter1_t> type1; in is_mergeable_stable()
230 typedef util::value_iter<Iter2_t> type2; in is_mergeable_stable()
371 typedef util::value_iter<Iter1_t> type1; in merge_flow()
372 typedef util::value_iter<Iter2_t> type2; in merge_flow()
|
| D | merge_vector.hpp | 57 typedef util::value_iter<Iter1_t> type1; in merge_level4()
58 typedef util::value_iter<Iter2_t> type2; in merge_level4()
105 typedef util::value_iter<Iter_t> type1; in uninit_merge_level4()
155 typedef util::value_iter<Iter1_t> type1; in merge_vector4()
156 typedef util::value_iter<Iter2_t> type2; in merge_vector4()
|
| D | rearrange.hpp | 70 typedef util::value_iter<Iter_data> value_data; in rearrange()
71 typedef util::value_iter<Iter_index> value_index; in rearrange()
|
| D | merge_four.hpp | 78 typedef util::value_iter<Iter1_t> type1; in full_merge4()
79 typedef util::value_iter<Iter2_t> type2; in full_merge4()
209 typedef util::value_iter<Iter_t> type1; in uninit_full_merge4()
|
| D | indirect.hpp | 95 typedef util::value_iter<Iter_t> value_t; in sort_index()
|
| D | scheduler.hpp | 187 typedef value_iter<it_func> value2_t; in insert_range()
|
| D | merge_block.hpp | 40 typedef util::value_iter<Iter_t> value_t;
|
| /third_party/boost/boost/sort/spinsort/ |
| D | spinsort.hpp | 44 using bsc::util::value_iter;
90 typedef value_iter<Iter1_t> value_t; in insert_partial_sort()
91 typedef value_iter<Iter2_t> value2_t; in insert_partial_sort()
159 typedef value_iter<Iter1_t> value_t; in check_stable_sort()
160 typedef value_iter<Iter2_t> value2_t; in check_stable_sort()
246 typedef value_iter<Iter1_t> value_t; in range_sort()
247 typedef value_iter<Iter2_t> value2_t; in range_sort()
313 typedef value_iter<Iter1_t> value_t; in sort_range_sort()
314 typedef value_iter<Iter2_t> value2_t; in sort_range_sort()
368 typedef value_iter<Iter_t> value_t;
|
| /third_party/boost/boost/sort/insert_sort/ |
| D | insert_sort.hpp | 28 using common::util::value_iter;
45 typedef value_iter< Iter_t > value_t; in insert_sort()
|
| /third_party/boost/boost/sort/block_indirect_sort/ |
| D | block_indirect_sort.hpp | 43 using bscu::value_iter;
381 enable_if_string<value_iter<Iter_t>> * = nullptr>
405 enable_if_not_string<value_iter<Iter_t>> * = nullptr>
409 block_indirect_sort<block_size<sizeof (value_iter<Iter_t> )>::data, 64, in block_indirect_sort_call()
|
| /third_party/boost/boost/sort/flat_stable_sort/ |
| D | flat_stable_sort.hpp | 263 bscu::enable_if_string<value_iter<Iter_t> > * = nullptr>
288 bscu::enable_if_not_string<value_iter<Iter_t> >* = nullptr>
293 block_size_fss<sizeof(value_iter<Iter_t> )>::data> in flat_stable_sort()
|
| /third_party/boost/boost/sort/heap_sort/ |
| D | heap_sort.hpp | 39 typedef bscu::value_iter<Iter_t> value_t;
|
| /third_party/boost/boost/sort/parallel_stable_sort/ |
| D | parallel_stable_sort.hpp | 52 typedef value_iter<Iter_t> value_t;
|
| /third_party/boost/boost/sort/sample_sort/ |
| D | sample_sort.hpp | 63 typedef value_iter<Iter_t> value_t;
|