| /third_party/boost/boost/range/algorithm/ |
| D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap()
39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap()
48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap()
57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap()
71 inline RandomAccessRange& pop_heap(RandomAccessRange& rng) in pop_heap()
80 inline const RandomAccessRange& pop_heap(const RandomAccessRange& rng) in pop_heap()
89 inline RandomAccessRange& pop_heap(RandomAccessRange& rng, Compare comp_pred) in pop_heap()
98 inline const RandomAccessRange& pop_heap(const RandomAccessRange& rng, Compare comp_pred) in pop_heap()
112 inline RandomAccessRange& make_heap(RandomAccessRange& rng) in make_heap()
121 inline const RandomAccessRange& make_heap(const RandomAccessRange& rng) in make_heap()
[all …]
|
| D | permutation.hpp | 30 inline bool next_permutation(BidirectionalRange& rng) in next_permutation()
38 inline bool next_permutation(const BidirectionalRange& rng) in next_permutation()
46 inline bool next_permutation(BidirectionalRange& rng, Compare comp_pred) in next_permutation()
55 inline bool next_permutation(const BidirectionalRange& rng, in next_permutation()
70 inline bool prev_permutation(BidirectionalRange& rng) in prev_permutation()
78 inline bool prev_permutation(const BidirectionalRange& rng) in prev_permutation()
86 inline bool prev_permutation(BidirectionalRange& rng, Compare comp_pred) in prev_permutation()
95 inline bool prev_permutation(const BidirectionalRange& rng, in prev_permutation()
|
| D | unique.hpp | 31 unique( ForwardRange& rng ) in unique()
42 unique( const ForwardRange& rng ) in unique()
52 unique( ForwardRange& rng, BinaryPredicate pred ) in unique()
62 unique( const ForwardRange& rng, BinaryPredicate pred ) in unique()
73 unique( ForwardRange& rng ) in unique()
81 unique( const ForwardRange& rng ) in unique()
89 unique( ForwardRange& rng, BinaryPredicate pred ) in unique()
97 unique( const ForwardRange& rng, BinaryPredicate pred ) in unique()
|
| D | adjacent_find.hpp | 33 adjacent_find(ForwardRange & rng) in adjacent_find()
42 adjacent_find(const ForwardRange& rng) in adjacent_find()
51 adjacent_find(ForwardRange & rng, BinaryPredicate pred) in adjacent_find()
63 adjacent_find(const ForwardRange& rng, BinaryPredicate pred) in adjacent_find()
77 adjacent_find(ForwardRange & rng) in adjacent_find()
88 adjacent_find(const ForwardRange& rng) in adjacent_find()
99 adjacent_find(ForwardRange& rng, BinaryPredicate pred) in adjacent_find()
113 adjacent_find(const ForwardRange& rng, BinaryPredicate pred) in adjacent_find()
|
| D | max_element.hpp | 54 max_element(ForwardRange& rng) in max_element()
63 max_element(const ForwardRange& rng) in max_element()
72 max_element(ForwardRange& rng, BinaryPredicate pred) in max_element()
81 max_element(const ForwardRange& rng, BinaryPredicate pred) in max_element()
92 max_element(ForwardRange& rng) in max_element()
103 max_element(const ForwardRange& rng) in max_element()
114 max_element(ForwardRange& rng, BinaryPredicate pred) in max_element()
125 max_element(const ForwardRange& rng, BinaryPredicate pred) in max_element()
|
| D | min_element.hpp | 54 min_element(ForwardRange& rng) in min_element()
63 min_element(const ForwardRange& rng) in min_element()
72 min_element(ForwardRange& rng, BinaryPredicate pred) in min_element()
81 min_element(const ForwardRange& rng, BinaryPredicate pred) in min_element()
92 min_element(ForwardRange& rng) in min_element()
103 min_element(const ForwardRange& rng) in min_element()
114 min_element(ForwardRange& rng, BinaryPredicate pred) in min_element()
125 min_element(const ForwardRange& rng, BinaryPredicate pred) in min_element()
|
| D | lower_bound.hpp | 34 lower_bound( ForwardRange& rng, const Value& val ) in lower_bound()
43 lower_bound( const ForwardRange& rng, const Value& val ) in lower_bound()
55 lower_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound()
64 lower_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound()
76 lower_bound( ForwardRange& rng, const Value& val ) in lower_bound()
87 lower_bound( const ForwardRange& rng, const Value& val ) in lower_bound()
101 lower_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound()
112 lower_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound()
|
| D | upper_bound.hpp | 35 upper_bound( ForwardRange& rng, const Value& val ) in upper_bound()
44 upper_bound( const ForwardRange& rng, const Value& val ) in upper_bound()
56 upper_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound()
65 upper_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound()
77 upper_bound( ForwardRange& rng, const Value& val ) in upper_bound()
88 upper_bound( const ForwardRange& rng, const Value& val ) in upper_bound()
103 upper_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound()
115 upper_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound()
|
| D | stable_sort.hpp | 30 inline RandomAccessRange& stable_sort(RandomAccessRange& rng) in stable_sort()
39 inline const RandomAccessRange& stable_sort(const RandomAccessRange& rng) in stable_sort()
48 inline RandomAccessRange& stable_sort(RandomAccessRange& rng, BinaryPredicate sort_pred) in stable_sort()
57 inline const RandomAccessRange& stable_sort(const RandomAccessRange& rng, BinaryPredicate sort_pred) in stable_sort()
|
| D | sort.hpp | 30 inline RandomAccessRange& sort(RandomAccessRange& rng) in sort()
39 inline const RandomAccessRange& sort(const RandomAccessRange& rng) in sort()
48 inline RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred) in sort()
57 inline const RandomAccessRange& sort(const RandomAccessRange& rng, BinaryPredicate pred) in sort()
|
| D | remove_if.hpp | 32 remove_if(ForwardRange& rng, UnaryPredicate pred) in remove_if()
41 remove_if(const ForwardRange& rng, UnaryPredicate pred) in remove_if()
52 remove_if(ForwardRange& rng, UnaryPredicate pred) in remove_if()
63 remove_if(const ForwardRange& rng, UnaryPredicate pred) in remove_if()
|
| D | find.hpp | 34 find( SinglePassRange& rng, const Value& val ) in find()
43 find( const SinglePassRange& rng, const Value& val ) in find()
57 find( SinglePassRange& rng, const Value& val ) in find()
68 find( const SinglePassRange& rng, const Value& val ) in find()
|
| D | partition.hpp | 31 partition(ForwardRange& rng, UnaryPredicate pred) in partition()
40 partition(const ForwardRange& rng, UnaryPredicate pred) in partition()
52 partition(ForwardRange& rng, UnaryPredicate pred) in partition()
63 partition(const ForwardRange& rng, UnaryPredicate pred) in partition()
|
| D | remove.hpp | 31 remove(ForwardRange& rng, const Value& val) in remove()
40 remove(const ForwardRange& rng, const Value& val) in remove()
51 remove(ForwardRange& rng, const Value& val) in remove()
62 remove(const ForwardRange& rng, const Value& val) in remove()
|
| D | find_if.hpp | 35 find_if( SinglePassRange& rng, UnaryPredicate pred ) in find_if()
44 find_if( const SinglePassRange& rng, UnaryPredicate pred ) in find_if()
58 find_if( SinglePassRange& rng, UnaryPredicate pred ) in find_if()
69 find_if( const SinglePassRange& rng, UnaryPredicate pred ) in find_if()
|
| D | stable_partition.hpp | 32 stable_partition(BidirectionalRange& rng, UnaryPredicate pred) in stable_partition()
41 stable_partition(const BidirectionalRange& rng, UnaryPredicate pred) in stable_partition()
50 stable_partition(BidirectionalRange& rng, UnaryPredicate pred) in stable_partition()
61 stable_partition(const BidirectionalRange& rng, UnaryPredicate pred) in stable_partition()
|
| D | partial_sort.hpp | 30 inline RandomAccessRange& partial_sort(RandomAccessRange& rng, in partial_sort()
40 inline const RandomAccessRange& partial_sort(const RandomAccessRange& rng, in partial_sort()
50 inline RandomAccessRange& partial_sort(RandomAccessRange& rng, in partial_sort()
62 inline const RandomAccessRange& partial_sort(const RandomAccessRange& rng, in partial_sort()
|
| D | inplace_merge.hpp | 30 inline BidirectionalRange& inplace_merge(BidirectionalRange& rng, in inplace_merge()
40 inline const BidirectionalRange& inplace_merge(const BidirectionalRange& rng, in inplace_merge()
50 inline BidirectionalRange& inplace_merge(BidirectionalRange& rng, in inplace_merge()
61 inline const BidirectionalRange& inplace_merge(const BidirectionalRange& rng, in inplace_merge()
|
| /third_party/boost/libs/foreach/test/ |
| D | utility.hpp | 18 inline bool sequence_equal_byval_n( foreach_container_type & rng, char const * result ) in sequence_equal_byval_n()
31 inline bool sequence_equal_byval_c( foreach_const_container_type & rng, char const * result ) in sequence_equal_byval_c()
44 inline bool sequence_equal_byref_n( foreach_container_type & rng, char const * result ) in sequence_equal_byref_n()
57 inline bool sequence_equal_byref_c( foreach_const_container_type & rng, char const * result ) in sequence_equal_byref_c()
71 inline void mutate_foreach_byref( foreach_container_type & rng ) in mutate_foreach_byref()
82 inline bool sequence_equal_byval_n_r( foreach_container_type & rng, char const * result ) in sequence_equal_byval_n_r()
95 inline bool sequence_equal_byval_c_r( foreach_const_container_type & rng, char const * result ) in sequence_equal_byval_c_r()
108 inline bool sequence_equal_byref_n_r( foreach_container_type & rng, char const * result ) in sequence_equal_byref_n_r()
121 inline bool sequence_equal_byref_c_r( foreach_const_container_type & rng, char const * result ) in sequence_equal_byref_c_r()
135 inline void mutate_foreach_byref_r( foreach_container_type & rng ) in mutate_foreach_byref_r()
|
| /third_party/boost/boost/geometry/util/ |
| D | range.hpp | 66 pos(RandomAccessRange const& rng, in pos()
79 pos(RandomAccessRange & rng, in pos()
92 at(RandomAccessRange const& rng, in at()
105 at(RandomAccessRange & rng, in at()
118 front(Range const& rng) in front()
130 front(Range & rng) in front()
144 back(BidirectionalRange const& rng) in back()
157 back(BidirectionalRange & rng) in back()
171 inline void clear(Range & rng) in clear()
183 inline void push_back(Range & rng, in push_back()
[all …]
|
| /third_party/boost/libs/range/test/ |
| D | mfc.cpp | 118 rng_t rng; in test_CByteArray() local
134 rng_t rng; in test_CDWordArray() local
150 rng_t rng; in test_CObArray() local
166 rng_t rng; in test_CPtrArray() local
182 rng_t rng; in test_CStringArray() local
198 rng_t rng; in test_CUIntArray() local
214 rng_t rng; in test_CWordArray() local
238 rng_t rng; in test_CObList() local
259 rng_t rng; in test_CPtrList() local
280 rng_t rng; in test_CStringList() local
[all …]
|
| D | atl.cpp | 150 rng_t rng; in test_CAtlArray() local
166 rng_t rng; in test_CAutoPtrArray() local
182 rng_t rng; in test_CInterfaceArray() local
201 rng_t rng; in test_CAtlList() local
217 rng_t rng; in test_CAutoPtrList() local
233 rng_t rng; in test_CHeapPtrList() local
249 rng_t rng; in test_CInterfaceList() local
274 rng_t& rng = drng; in test_CSimpleStringT() local
295 rng_t rng; in test_CFixedStringT() local
315 rng_t rng; in test_CStringT() local
[all …]
|
| D | begin.cpp | 27 begin(SinglePassRange& rng) in begin()
34 begin(const SinglePassRange& rng) in begin()
40 void mock_algorithm_using_begin(const SinglePassRange& rng) in mock_algorithm_using_begin()
46 void mock_algorithm_using_begin(SinglePassRange& rng) in mock_algorithm_using_begin()
57 begin(SinglePassRange& rng) in begin()
64 begin(const SinglePassRange& rng) in begin()
|
| D | end.cpp | 27 end(SinglePassRange& rng) in end()
34 end(const SinglePassRange& rng) in end()
40 void mock_algorithm_using_end(const SinglePassRange& rng) in mock_algorithm_using_end()
46 void mock_algorithm_using_end(SinglePassRange& rng) in mock_algorithm_using_end()
57 end(SinglePassRange& rng) in end()
64 end(const SinglePassRange& rng) in end()
|
| /third_party/boost/libs/sort/test/ |
| D | test_pdqsort.cpp | 41 std::vector<uint32_t> shuffled(size_t size, std::mt19937_64& rng) { in shuffled()
48 std::vector<uint32_t> shuffled_16_values(size_t size, std::mt19937_64& rng) { in shuffled_16_values()
55 std::vector<uint32_t> all_equal(size_t size, std::mt19937_64& rng) { in all_equal()
61 std::vector<uint32_t> ascending(size_t size, std::mt19937_64& rng) { in ascending()
67 std::vector<uint32_t> descending(size_t size, std::mt19937_64& rng) { in descending()
76 std::vector<uint32_t> pipe_organ(size_t size, std::mt19937_64& rng) { in pipe_organ()
83 std::vector<uint32_t> push_front(size_t size, std::mt19937_64& rng) { in push_front()
90 std::vector<uint32_t> push_middle(size_t size, std::mt19937_64& rng) { in push_middle()
111 std::mt19937_64 rng; rng.seed(0); in execute_test() local
|