| /third_party/boost/boost/range/algorithm/ |
| D | find_end.hpp | 36 find_end(ForwardRange1 & rng1, const ForwardRange2& rng2) in find_end()
48 find_end(const ForwardRange1 & rng1, const ForwardRange2& rng2) in find_end()
63 find_end(ForwardRange1 & rng1, const ForwardRange2& rng2, BinaryPredicate pred) in find_end()
75 find_end(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in find_end()
90 find_end(ForwardRange1& rng1, const ForwardRange2& rng2) in find_end()
104 find_end(const ForwardRange1& rng1, const ForwardRange2& rng2) in find_end()
122 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in find_end()
137 find_end(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in find_end()
|
| D | find_first_of.hpp | 36 find_first_of(SinglePassRange1 & rng1, ForwardRange2 const & rng2) in find_first_of()
48 find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2) in find_first_of()
63 find_first_of(SinglePassRange1 & rng1, ForwardRange2 const & rng2, BinaryPredicate pred) in find_first_of()
75 find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in find_first_of()
91 find_first_of(SinglePassRange1& rng1, const ForwardRange2& rng2) in find_first_of()
105 find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2) in find_first_of()
123 find_first_of(SinglePassRange1 & rng1, const ForwardRange2& rng2, in find_first_of()
139 find_first_of(const SinglePassRange1 & rng1, const ForwardRange2& rng2, in find_first_of()
|
| D | search.hpp | 33 search(ForwardRange1& rng1, const ForwardRange2& rng2) in search()
44 search(const ForwardRange1& rng1, const ForwardRange2& rng2) in search()
55 search(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in search()
66 search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in search()
79 search(ForwardRange1& rng1, const ForwardRange2& rng2) in search()
92 search(const ForwardRange1& rng1, const ForwardRange2& rng2) in search()
106 search(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in search()
120 search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in search()
|
| D | set_algorithm.hpp | 32 const SinglePassRange2& rng2) in includes()
44 const SinglePassRange2& rng2, in includes()
63 const SinglePassRange2& rng2, in set_union()
76 const SinglePassRange2& rng2, in set_union()
96 const SinglePassRange2& rng2, in set_intersection()
109 const SinglePassRange2& rng2, in set_intersection()
130 const SinglePassRange2& rng2, in set_difference()
143 const SinglePassRange2& rng2, in set_difference()
165 const SinglePassRange2& rng2, in set_symmetric_difference()
179 const SinglePassRange2& rng2, in set_symmetric_difference()
|
| D | mismatch.hpp | 75 mismatch(SinglePassRange1& rng1, const SinglePassRange2 & rng2) in mismatch()
90 mismatch(const SinglePassRange1& rng1, const SinglePassRange2& rng2) in mismatch()
105 mismatch(SinglePassRange1& rng1, SinglePassRange2 & rng2) in mismatch()
120 mismatch(const SinglePassRange1& rng1, SinglePassRange2& rng2) in mismatch()
136 mismatch(SinglePassRange1& rng1, const SinglePassRange2& rng2, BinaryPredicate pred) in mismatch()
151 mismatch(const SinglePassRange1& rng1, const SinglePassRange2& rng2, BinaryPredicate pred) in mismatch()
166 mismatch(SinglePassRange1& rng1, SinglePassRange2& rng2, BinaryPredicate pred) in mismatch()
181 mismatch(const SinglePassRange1& rng1, SinglePassRange2& rng2, BinaryPredicate pred) in mismatch()
|
| D | partial_sort_copy.hpp | 33 partial_sort_copy(const SinglePassRange& rng1, RandomAccessRange& rng2) in partial_sort_copy()
44 partial_sort_copy(const SinglePassRange& rng1, const RandomAccessRange& rng2) in partial_sort_copy()
56 partial_sort_copy(const SinglePassRange& rng1, RandomAccessRange& rng2, in partial_sort_copy()
69 partial_sort_copy(const SinglePassRange& rng1, const RandomAccessRange& rng2, in partial_sort_copy()
|
| D | lexicographical_compare.hpp | 31 const SinglePassRange2& rng2) in lexicographical_compare()
44 const SinglePassRange2& rng2, in lexicographical_compare()
|
| D | merge.hpp | 34 const SinglePassRange2& rng2, in merge()
47 const SinglePassRange2& rng2, in merge()
|
| D | equal.hpp | 172 inline bool equal( const SinglePassRange1& rng1, const SinglePassRange2& rng2 ) in equal()
184 inline bool equal( const SinglePassRange1& rng1, const SinglePassRange2& rng2, in equal()
|
| D | transform.hpp | 80 const SinglePassRange2& rng2, in transform()
|
| /third_party/boost/boost/range/algorithm_ext/ |
| D | for_each.hpp | 40 inline Fn2 for_each(const SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn) in for_each()
51 inline Fn2 for_each(const SinglePassRange1& rng1, SinglePassRange2& rng2, Fn2 fn) in for_each()
62 inline Fn2 for_each(SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn) in for_each()
73 inline Fn2 for_each(SinglePassRange1& rng1, SinglePassRange2& rng2, Fn2 fn) in for_each()
|
| /third_party/boost/libs/range/test/ |
| D | join.cpp | 64 void test_join_traversal(Range1& rng1, Range2& rng2, TraversalTag) in test_join_traversal()
71 void test_join_traversal(Range1& rng1, Range2& rng2, boost::bidirectional_traversal_tag) in test_join_traversal()
94 void test_random_access_join(Range1& rng1, Range2& rng2, JoinedRange joined) in test_random_access_join()
128 void test_join_traversal(Range1& rng1, Range2& rng2, boost::random_access_traversal_tag) in test_join_traversal()
139 void test_write_to_joined_range(const Collection1& rng1, const Collection2& rng2) in test_write_to_joined_range()
181 void test_join_impl(Collection1& rng1, Collection2& rng2) in test_join_impl()
|
| D | algorithm.cpp | 173 value_type rng2[] = {value_type(),value_type(),value_type()}; in test_algorithms() local
|
| /third_party/boost/boost/range/ |
| D | numeric.hpp | 72 const SinglePassRange2& rng2, in inner_product_precondition()
88 const SinglePassRange2& rng2, in inner_product()
117 const SinglePassRange2& rng2, in inner_product()
|
| D | join.hpp | 55 joined_range(SinglePassRange1& rng1, SinglePassRange2& rng2) in joined_range()
|
| /third_party/boost/libs/range/test/algorithm_test/ |
| D | lexicographical_compare.cpp | 29 ForwardRange2& rng2) in test_lexicographical_compare_impl_nopred()
46 ForwardRange2& rng2, in test_lexicographical_compare_impl_pred()
|
| /third_party/boost/libs/lexical_cast/test/ |
| D | lexical_cast_iterator_range_test.cpp | 107 iterator_range<test_char_type*> rng2(eleven, eleven + 1); in test_it_range_using_any_chars() local
125 iterator_range<test_char_type*> rng2(eleven, eleven + 1); in test_it_range_using_char() local
|
| /third_party/boost/libs/phoenix/test/algorithm/ |
| D | querying2.cpp | 33 boost::iterator_range<int*> rng2(array3, array3 + 2); in includes_test() local
|
| /third_party/boost/libs/foreach/test/ |
| D | noncopyable.cpp | 68 noncopy_range const rng2; in main() local
|
| /third_party/boost/boost/random/ |
| D | xor_combine.hpp | 57 xor_combine_engine(const base1_type & rng1, const base2_type & rng2) in xor_combine_engine()
196 xor_combine(const URNG1 & rng1, const URNG2 & rng2) in xor_combine()
|
| /third_party/boost/libs/range/test/algorithm_ext_test/ |
| D | for_each_ext.cpp | 40 void test_for_each_impl( Range1& rng1, Range2& rng2 ) in test_for_each_impl()
|
| /third_party/boost/boost/sort/common/ |
| D | sort_basic.hpp | 216 const range<Iter2_t> &rng2, in internal_sort()
|
| D | range.hpp | 366 range<Iter1_t> rng2, Compare cmp) in merge_flow()
|
| D | merge_block.hpp | 362 range_it rng2 = rng1; in move_range_pos_backward() local
|
| /third_party/boost/boost/range/detail/ |
| D | microsoft.hpp | 726 bool test_equals(Range1 const& rng1, Range2 const& rng2) in test_equals()
|