| /third_party/boost/boost/algorithm/ |
| D | minmax_element.hpp | 58 basic_minmax_element(ForwardIter first, ForwardIter last, Compare comp) in basic_minmax_element()
133 minmax_element(ForwardIter first, ForwardIter last, BinaryPredicate comp) in minmax_element()
215 BinaryPredicate comp) in basic_first_min_element()
228 BinaryPredicate comp) in basic_last_min_element()
241 BinaryPredicate comp) in basic_first_max_element()
254 BinaryPredicate comp) in basic_last_max_element()
276 first_min_element(ForwardIter first, ForwardIter last, BinaryPredicate comp) in first_min_element()
292 last_min_element(ForwardIter first, ForwardIter last, BinaryPredicate comp) in last_min_element()
308 first_max_element(ForwardIter first, ForwardIter last, BinaryPredicate comp) in first_max_element()
324 last_max_element(ForwardIter first, ForwardIter last, BinaryPredicate comp) in last_max_element()
[all …]
|
| /third_party/boost/boost/intrusive/ |
| D | splaytree_algorithms.hpp | 257 (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z) in transfer_unique()
272 (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z) in transfer_equal()
296 (node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in count()
311 (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in count()
318 (node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in lower_bound()
330 (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in lower_bound()
337 (node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in upper_bound()
349 (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in upper_bound()
356 (node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in find()
366 (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp) in find()
[all …]
|
| /third_party/boost/boost/multi_index/detail/ |
| D | ord_index_ops.hpp | 67 const CompatibleCompare& comp) in ordered_index_find()
85 const CompatibleCompare& comp,mpl::true_) in ordered_index_find()
96 const CompatibleCompare& comp,mpl::false_) in ordered_index_find()
117 const CompatibleCompare& comp) in ordered_index_lower_bound()
133 const CompatibleCompare& comp,mpl::true_) in ordered_index_lower_bound()
144 const CompatibleCompare& comp,mpl::false_) in ordered_index_lower_bound()
163 const CompatibleCompare& comp) in ordered_index_upper_bound()
179 const CompatibleCompare& comp,mpl::true_) in ordered_index_upper_bound()
190 const CompatibleCompare& comp,mpl::false_) in ordered_index_upper_bound()
209 const CompatibleCompare& comp) in ordered_index_equal_range()
[all …]
|
| D | rnk_index_ops.hpp | 93 const CompatibleCompare& comp) in ranked_index_find_rank()
111 const CompatibleCompare& comp,mpl::true_) in ranked_index_find_rank()
122 const CompatibleCompare& comp,mpl::false_) in ranked_index_find_rank()
150 const CompatibleCompare& comp) in ranked_index_lower_bound_rank()
166 const CompatibleCompare& comp,mpl::true_) in ranked_index_lower_bound_rank()
177 const CompatibleCompare& comp,mpl::false_) in ranked_index_lower_bound_rank()
203 const CompatibleCompare& comp) in ranked_index_upper_bound_rank()
219 const CompatibleCompare& comp,mpl::true_) in ranked_index_upper_bound_rank()
230 const CompatibleCompare& comp,mpl::false_) in ranked_index_upper_bound_rank()
257 const CompatibleCompare& comp) in ranked_index_equal_range_rank()
[all …]
|
| /third_party/boost/boost/sort/common/util/ |
| D | merge.hpp | 86 const Iter2_t end_buf2, Iter3_t buf_out, Compare comp) in merge()
109 if (not comp(*buf2, *(end_buf1 - 1))) in merge() local
148 Value_t *it_out, Compare comp) in merge_construct()
170 if (not comp(*first2, *(last1 - 1))) in merge_construct() local
211 const Iter2_t end_buf2, Iter2_t buf_out, Compare comp) in merge_half()
234 if (not comp(*buf2, *(end_buf1 - 1))) in merge_half() local
273 Compare comp) in merge_half_backward()
297 if (not comp(*buf2, *(end_buf1 - 1))) in merge_half_backward() local
338 Iter3_t aux, Compare comp) in merge_uncontiguous()
398 Iter2_t buf, Compare comp) in merge_contiguous()
[all …]
|
| D | search.hpp | 70 const Compare & comp = Compare(), in internal_find_first()
104 const Compare & comp = Compare(), Filter flt = in internal_find_last()
143 const Compare & comp = Compare(), in find_first()
168 const Compare & comp = Compare(), in find_last()
190 const Compare & comp = Compare(), in lower_bound()
214 const Compare & comp = Compare(), in upper_bound()
238 const Compare & comp = Compare(), in equal_range()
260 const Compare & comp = Compare(), Filter flt = in insert_first()
282 const Compare & comp = Compare(), Filter flt = in insert_last()
|
| /third_party/boost/libs/bimap/test/ |
| D | test_bimap_operator_bracket.cpp | 54 bool comp; in test_bimap_operator_bracket() local
78 bool comp; in test_bimap_operator_bracket() local
98 bool comp; in test_bimap_operator_bracket() local
132 bool comp; in test_bimap_operator_bracket() local
150 bool comp; in test_bimap_operator_bracket() local
|
| /third_party/boost/boost/sort/common/ |
| D | sort_basic.hpp | 52 Compare comp = Compare()) in is_stable_sorted_forward()
75 Compare comp = Compare()) in is_reverse_stable_sorted_forward()
99 Compare comp = Compare()) in number_stable_sorted_forward()
136 Compare comp = Compare()) in is_stable_sorted_backward()
159 Compare comp = Compare()) in is_reverse_stable_sorted_backward()
184 Compare comp = Compare()) in number_stable_sorted_backward()
217 Compare comp, uint32_t level, bool even = true) in internal_sort()
264 const range<Iter2_t> & rng_aux, Compare comp) in range_sort_data()
301 const range<Iter2_t> & rng_aux, Compare comp) in range_sort_buffer()
|
| D | pivot.hpp | 43 inline Iter_t mid3 (Iter_t iter_1, Iter_t iter_2, Iter_t iter_3, Compare comp) in mid3()
64 inline void pivot3 (Iter_t first, Iter_t last, Compare comp) in pivot3()
91 Iter_t iter_9, Compare comp) in mid9()
110 inline void pivot9 (Iter_t first, Iter_t last, Compare comp) in pivot9()
|
| D | range.hpp | 198 Compare comp) in is_mergeable()
224 const range<Iter2_t> &src2, Compare comp) in is_mergeable_stable()
255 const range<Iter2_t> &src2, Compare comp) in merge()
280 Compare comp) in merge_construct()
303 const range<Iter2_t> &src2, Compare comp) in merge_half()
324 const range<Iter3_t> &aux, Compare comp) in merge_uncontiguous()
343 const range<Iter2_t> &buf, Compare comp) in merge_contiguous()
|
| /third_party/boost/boost/sort/spreadsort/ |
| D | string_sort.hpp | 259 RandomAccessIter last, Compare comp, Unsigned_char_type unused) in reverse_string_sort()
310 inline void reverse_string_sort(Range& range, Compare comp, Unsigned_char_type unused) in reverse_string_sort()
358 RandomAccessIter last, Compare comp) in reverse_string_sort()
401 inline void reverse_string_sort(Range& range, Compare comp) in reverse_string_sort()
559 Get_char get_character, Get_length length, Compare comp) in string_sort()
619 Get_char get_character, Get_length length, Compare comp) in string_sort()
671 RandomAccessIter last, Get_char get_character, Get_length length, Compare comp) in reverse_string_sort()
733 …ine void reverse_string_sort(Range& range, Get_char get_character, Get_length length, Compare comp) in reverse_string_sort()
|
| /third_party/boost/boost/move/algo/detail/ |
| D | heap_sort.hpp | 39 …omAccessIterator first, size_type hole_index, size_type const len, value_type &value, Compare comp) in adjust_heap()
67 static void make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp) in make_heap()
80 static void sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp) in sort_heap()
93 static void sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp) in sort()
102 …OVE_FORCEINLINE void heap_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp) in heap_sort()
|
| D | insertion_sort.hpp | 41 …(ForwardIterator first1, ForwardIterator last1, BirdirectionalIterator first2, Compare comp, Op op) in insertion_sort_op()
61 …rt_swap(ForwardIterator first1, ForwardIterator last1, BirdirectionalIterator first2, Compare comp) in insertion_sort_swap()
68 …rt_copy(ForwardIterator first1, ForwardIterator last1, BirdirectionalIterator first2, Compare comp) in insertion_sort_copy()
76 void insertion_sort(BirdirectionalIterator first, BirdirectionalIterator last, Compare comp) in insertion_sort()
99 , Compare comp) in insertion_sort_uninitialized_copy()
|
| D | merge_sort.hpp | 45 void inplace_stable_sort(RandIt first, RandIt last, Compare comp) in inplace_stable_sort()
63 , RandIt2 dest, Compare comp) in merge_sort_copy()
85 , Compare comp) in merge_sort_uninitialized_copy()
109 void merge_sort( RandIt first, RandIt last, Compare comp in merge_sort()
138 void merge_sort_with_constructed_buffer( RandIt first, RandIt last, Compare comp, RandItRaw buffer) in merge_sort_with_constructed_buffer()
162 …ort_ONlogN_recursive(RandIt first, RandIt last, Pointer buffer, Distance buffer_size, Compare comp) in stable_sort_ONlogN_recursive()
190 Compare comp, in stable_sort_adaptive_ONlogN2()
|
| D | merge.hpp | 363 (RandIt first, const RandIt last, const T& key, Compare comp) in lower_bound()
388 (RandIt first, const RandIt last, const T& key, Compare comp) in upper_bound()
417 , Compare comp in op_merge_left()
447 (RandIt buf_first, RandIt first1, RandIt const last1, RandIt const last2, Compare comp) in merge_left()
458 (RandIt buf_first, RandIt first1, RandIt const last1, RandIt const last2, Compare comp) in swap_merge_left()
465 (RandIt const first1, RandIt last1, RandIt last2, RandIt buf_last, Compare comp, Op op) in op_merge_right()
497 (RandIt first1, RandIt last1, RandIt last2, RandIt buf_last, Compare comp) in merge_right()
507 (RandIt first1, RandIt last1, RandIt last2, RandIt buf_last, Compare comp) in swap_merge_right()
520 , Compare comp, Op op in op_buffered_merge()
545 , Compare comp in buffered_merge()
[all …]
|
| D | pdqsort.hpp | 110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort()
138 inline void sort2(Iter a, Iter b, Compare comp) { in sort2()
144 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3()
156 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right()
200 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left()
227 void pdqsort_loop( Iter begin, Iter end, Compare comp in pdqsort_loop()
322 void pdqsort(Iter begin, Iter end, Compare comp) in pdqsort()
|
| D | set_difference.hpp | 46 (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt result, Compare comp) in set_difference()
74 (InputOutputIt1 first1, InputOutputIt1 last1, InputIt2 first2, InputIt2 last2, Compare comp ) in inplace_set_difference()
109 …orwardIt1 first1, ForwardIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt result, Compare comp) in set_unique_difference()
159 …orwardOutputIt1 first1, ForwardOutputIt1 last1, ForwardIt2 first2, ForwardIt2 last2, Compare comp ) in inplace_set_unique_difference()
|
| /third_party/gstreamer/gstplugins_bad/gst/debugutils/ |
| D | gstcompare.c | 124 GstCompare *comp = GST_COMPARE (object); in gst_compare_finalize() local
182 gst_compare_init (GstCompare * comp) in gst_compare_init()
218 gst_compare_reset (GstCompare * comp) in gst_compare_reset()
225 GstCompare *comp; in gst_compare_query() local
235 gst_compare_meta (GstCompare * comp, GstBuffer * buf1, GstCaps * caps1, in gst_compare_meta()
302 gst_compare_mem (GstCompare * comp, GstBuffer * buf1, GstCaps * caps1, in gst_compare_mem()
320 gst_compare_max (GstCompare * comp, GstBuffer * buf1, GstCaps * caps1, in gst_compare_max()
350 gst_compare_ssim_window (GstCompare * comp, guint8 * data1, guint8 * data2, in gst_compare_ssim_window()
397 gst_compare_ssim_component (GstCompare * comp, guint8 * data1, guint8 * data2, in gst_compare_ssim_component()
426 gst_compare_ssim (GstCompare * comp, GstBuffer * buf1, GstCaps * caps1, in gst_compare_ssim()
[all …]
|
| /third_party/boost/boost/pending/ |
| D | mutable_heap.hpp | 37 inline TreeNode up_heap(TreeNode x, const Compare& comp, ExternalData& edata) in up_heap()
45 inline TreeNode down_heap(TreeNode x, const Compare& comp, ExternalData& edata) in down_heap()
60 inline void update_heap(TreeNode x, const Compare& comp, ExternalData& edata) in update_heap()
|
| /third_party/typescript/tests/baselines/reference/ |
| D | emitCompoundExponentiationOperator2.js | 2 var comp: number; variable
28 var comp; variable
|
| D | emitCompoundExponentiationOperator1.js | 2 var comp: number; variable
24 var comp; variable
|
| /third_party/gn/src/base/containers/ |
| D | flat_map.h | 245 flat_map<Key, Mapped, Compare>::flat_map(const Compare& comp) : tree(comp) {} in flat_map()
252 const Compare& comp) in flat_map()
258 const Compare& comp) in flat_map()
265 const Compare& comp) in flat_map()
|
| /third_party/boost/boost/move/algo/ |
| D | predicate.hpp | 48 Comp unantistable(Comp comp) in unantistable()
52 Comp unantistable(antistable<Comp> comp) in unantistable()
62 explicit negate(Comp comp) in negate()
84 explicit inverse(Comp comp) in inverse()
|
| /third_party/boost/boost/sort/spinsort/ |
| D | spinsort.hpp | 85 Compare comp, const range<Iter2_t> &rng_aux) in insert_partial_sort()
154 const range<Iter2_t> &rng_aux, Compare comp) in check_stable_sort()
240 const range<Iter2_t> &range2, Compare comp, in range_sort()
308 const range<Iter2_t> &rng_aux, Compare comp) in sort_range_sort()
400 spinsort(Iter_t first, Iter_t last, Compare comp = Compare()) in spinsort()
403 spinsort(Iter_t first, Iter_t last, Compare comp, range_buf range_aux) in spinsort()
440 ::spinsort (Iter_t first, Iter_t last, Compare comp, value_t *paux, size_t naux) in spinsort()
545 inline void spinsort (Iter_t first, Iter_t last, Compare comp = Compare()) in spinsort()
552 Compare comp = Compare()) in indirect_spinsort()
|
| /third_party/boost/boost/sort/pdqsort/ |
| D | pdqsort.hpp | 64 inline void insertion_sort(Iter begin, Iter end, Compare comp) { in insertion_sort()
87 inline void unguarded_insertion_sort(Iter begin, Iter end, Compare comp) { in unguarded_insertion_sort()
111 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort()
138 inline void sort2(Iter a, Iter b, Compare comp) { in sort2()
144 inline void sort3(Iter a, Iter b, Iter c, Compare comp) { in sort3()
189 inline std::pair<Iter, bool> partition_right_branchless(Iter begin, Iter end, Compare comp) { in partition_right_branchless()
328 inline std::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right()
372 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left()
399 …inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true… in pdqsort_loop()
520 inline void pdqsort(Iter first, Iter last, Compare comp) { in pdqsort()
[all …]
|