| /third_party/boost/boost/range/algorithm/ |
| D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() argument
33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap()
34 return rng; in push_heap()
39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() argument
42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap()
43 return rng; in push_heap()
48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() argument
51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap()
52 return rng; in push_heap()
57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() argument
[all …]
|
| D | permutation.hpp | 30 inline bool next_permutation(BidirectionalRange& rng) in next_permutation() argument
33 return std::next_permutation(boost::begin(rng), boost::end(rng)); in next_permutation()
38 inline bool next_permutation(const BidirectionalRange& rng) in next_permutation() argument
41 return std::next_permutation(boost::begin(rng), boost::end(rng)); in next_permutation()
46 inline bool next_permutation(BidirectionalRange& rng, Compare comp_pred) in next_permutation() argument
49 return std::next_permutation(boost::begin(rng), boost::end(rng), in next_permutation()
55 inline bool next_permutation(const BidirectionalRange& rng, in next_permutation() argument
59 return std::next_permutation(boost::begin(rng), boost::end(rng), in next_permutation()
70 inline bool prev_permutation(BidirectionalRange& rng) in prev_permutation() argument
73 return std::prev_permutation(boost::begin(rng), boost::end(rng)); in prev_permutation()
[all …]
|
| D | adjacent_find.hpp | 33 adjacent_find(ForwardRange & rng) in adjacent_find() argument
36 return std::adjacent_find(boost::begin(rng),boost::end(rng)); in adjacent_find()
42 adjacent_find(const ForwardRange& rng) in adjacent_find() argument
45 return std::adjacent_find(boost::begin(rng),boost::end(rng)); in adjacent_find()
51 adjacent_find(ForwardRange & rng, BinaryPredicate pred) in adjacent_find() argument
57 return std::adjacent_find(boost::begin(rng),boost::end(rng),pred); in adjacent_find()
63 adjacent_find(const ForwardRange& rng, BinaryPredicate pred) in adjacent_find() argument
69 return std::adjacent_find(boost::begin(rng),boost::end(rng),pred); in adjacent_find()
77 adjacent_find(ForwardRange & rng) in adjacent_find() argument
81 pack(std::adjacent_find(boost::begin(rng),boost::end(rng)), in adjacent_find()
[all …]
|
| D | min_element.hpp | 54 min_element(ForwardRange& rng) in min_element() argument
57 return detail::min_element(boost::begin(rng), boost::end(rng), detail::less()); in min_element()
63 min_element(const ForwardRange& rng) in min_element() argument
66 return detail::min_element(boost::begin(rng), boost::end(rng), detail::less()); in min_element()
72 min_element(ForwardRange& rng, BinaryPredicate pred) in min_element() argument
75 return detail::min_element(boost::begin(rng), boost::end(rng), pred); in min_element()
81 min_element(const ForwardRange& rng, BinaryPredicate pred) in min_element() argument
84 return detail::min_element(boost::begin(rng), boost::end(rng), pred); in min_element()
92 min_element(ForwardRange& rng) in min_element() argument
96 detail::min_element(boost::begin(rng), boost::end(rng), detail::less()), in min_element()
[all …]
|
| D | max_element.hpp | 54 max_element(ForwardRange& rng) in max_element() argument
57 return detail::max_element(boost::begin(rng), boost::end(rng), detail::less()); in max_element()
63 max_element(const ForwardRange& rng) in max_element() argument
66 return detail::max_element(boost::begin(rng), boost::end(rng), detail::less()); in max_element()
72 max_element(ForwardRange& rng, BinaryPredicate pred) in max_element() argument
75 return detail::max_element(boost::begin(rng), boost::end(rng), pred); in max_element()
81 max_element(const ForwardRange& rng, BinaryPredicate pred) in max_element() argument
84 return detail::max_element(boost::begin(rng), boost::end(rng), pred); in max_element()
92 max_element(ForwardRange& rng) in max_element() argument
96 detail::max_element(boost::begin(rng), boost::end(rng), detail::less()), in max_element()
[all …]
|
| D | lower_bound.hpp | 34 lower_bound( ForwardRange& rng, const Value& val ) in lower_bound() argument
37 return std::lower_bound(boost::begin(rng), boost::end(rng), val); in lower_bound()
43 lower_bound( const ForwardRange& rng, const Value& val ) in lower_bound() argument
46 return std::lower_bound(boost::begin(rng), boost::end(rng), val); in lower_bound()
55 lower_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound() argument
58 return std::lower_bound(boost::begin(rng), boost::end(rng), val, pred); in lower_bound()
64 lower_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound() argument
67 return std::lower_bound(boost::begin(rng), boost::end(rng), val, pred); in lower_bound()
76 lower_bound( ForwardRange& rng, const Value& val ) in lower_bound() argument
80 pack(std::lower_bound(boost::begin(rng), boost::end(rng), val), in lower_bound()
[all …]
|
| D | upper_bound.hpp | 35 upper_bound( ForwardRange& rng, const Value& val ) in upper_bound() argument
38 return std::upper_bound(boost::begin(rng), boost::end(rng), val); in upper_bound()
44 upper_bound( const ForwardRange& rng, const Value& val ) in upper_bound() argument
47 return std::upper_bound(boost::begin(rng), boost::end(rng), val); in upper_bound()
56 upper_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound() argument
59 return std::upper_bound(boost::begin(rng), boost::end(rng), val, pred); in upper_bound()
65 upper_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound() argument
68 return std::upper_bound(boost::begin(rng), boost::end(rng), val, pred); in upper_bound()
77 upper_bound( ForwardRange& rng, const Value& val ) in upper_bound() argument
81 pack(std::upper_bound(boost::begin(rng), boost::end(rng), val), in upper_bound()
[all …]
|
| D | unique.hpp | 31 unique( ForwardRange& rng ) in unique() argument
35 pack( std::unique( boost::begin(rng), in unique()
36 boost::end(rng)), rng ); in unique()
42 unique( const ForwardRange& rng ) in unique() argument
46 pack( std::unique( boost::begin(rng), in unique()
47 boost::end(rng)), rng ); in unique()
52 unique( ForwardRange& rng, BinaryPredicate pred ) in unique() argument
56 pack(std::unique(boost::begin(rng), boost::end(rng), pred), in unique()
57 rng); in unique()
62 unique( const ForwardRange& rng, BinaryPredicate pred ) in unique() argument
[all …]
|
| D | stable_sort.hpp | 30 inline RandomAccessRange& stable_sort(RandomAccessRange& rng) in stable_sort() argument
33 std::stable_sort(boost::begin(rng), boost::end(rng)); in stable_sort()
34 return rng; in stable_sort()
39 inline const RandomAccessRange& stable_sort(const RandomAccessRange& rng) in stable_sort() argument
42 std::stable_sort(boost::begin(rng), boost::end(rng)); in stable_sort()
43 return rng; in stable_sort()
48 inline RandomAccessRange& stable_sort(RandomAccessRange& rng, BinaryPredicate sort_pred) in stable_sort() argument
51 std::stable_sort(boost::begin(rng), boost::end(rng), sort_pred); in stable_sort()
52 return rng; in stable_sort()
57 inline const RandomAccessRange& stable_sort(const RandomAccessRange& rng, BinaryPredicate sort_pred) in stable_sort() argument
[all …]
|
| D | sort.hpp | 30 inline RandomAccessRange& sort(RandomAccessRange& rng) in sort() argument
33 std::sort(boost::begin(rng), boost::end(rng)); in sort()
34 return rng; in sort()
39 inline const RandomAccessRange& sort(const RandomAccessRange& rng) in sort() argument
42 std::sort(boost::begin(rng), boost::end(rng)); in sort()
43 return rng; in sort()
48 inline RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred) in sort() argument
51 std::sort(boost::begin(rng), boost::end(rng), pred); in sort()
52 return rng; in sort()
57 inline const RandomAccessRange& sort(const RandomAccessRange& rng, BinaryPredicate pred) in sort() argument
[all …]
|
| D | nth_element.hpp | 30 inline RandomAccessRange& nth_element(RandomAccessRange& rng, in nth_element() argument
34 std::nth_element(boost::begin(rng), nth, boost::end(rng)); in nth_element()
35 return rng; in nth_element()
40 inline const RandomAccessRange& nth_element(const RandomAccessRange& rng, in nth_element() argument
44 std::nth_element(boost::begin(rng), nth, boost::end(rng)); in nth_element()
45 return rng; in nth_element()
50 inline RandomAccessRange& nth_element(RandomAccessRange& rng, in nth_element() argument
55 std::nth_element(boost::begin(rng), nth, boost::end(rng), sort_pred); in nth_element()
56 return rng; in nth_element()
61 inline const RandomAccessRange& nth_element(const RandomAccessRange& rng, in nth_element() argument
[all …]
|
| D | partial_sort.hpp | 30 inline RandomAccessRange& partial_sort(RandomAccessRange& rng, in partial_sort() argument
34 std::partial_sort(boost::begin(rng), middle, boost::end(rng)); in partial_sort()
35 return rng; in partial_sort()
40 inline const RandomAccessRange& partial_sort(const RandomAccessRange& rng, in partial_sort() argument
44 std::partial_sort(boost::begin(rng), middle, boost::end(rng)); in partial_sort()
45 return rng; in partial_sort()
50 inline RandomAccessRange& partial_sort(RandomAccessRange& rng, in partial_sort() argument
55 std::partial_sort(boost::begin(rng), middle, boost::end(rng), in partial_sort()
57 return rng; in partial_sort()
62 inline const RandomAccessRange& partial_sort(const RandomAccessRange& rng, in partial_sort() argument
[all …]
|
| D | inplace_merge.hpp | 30 inline BidirectionalRange& inplace_merge(BidirectionalRange& rng, in inplace_merge() argument
34 std::inplace_merge(boost::begin(rng), middle, boost::end(rng)); in inplace_merge()
35 return rng; in inplace_merge()
40 inline const BidirectionalRange& inplace_merge(const BidirectionalRange& rng, in inplace_merge() argument
44 std::inplace_merge(boost::begin(rng), middle, boost::end(rng)); in inplace_merge()
45 return rng; in inplace_merge()
50 inline BidirectionalRange& inplace_merge(BidirectionalRange& rng, in inplace_merge() argument
55 std::inplace_merge(boost::begin(rng), middle, boost::end(rng), pred); in inplace_merge()
56 return rng; in inplace_merge()
61 inline const BidirectionalRange& inplace_merge(const BidirectionalRange& rng, in inplace_merge() argument
[all …]
|
| D | random_shuffle.hpp | 103 inline RandomAccessRange& random_shuffle(RandomAccessRange& rng) in random_shuffle() argument
106 detail::random_shuffle(boost::begin(rng), boost::end(rng)); in random_shuffle()
107 return rng; in random_shuffle()
112 inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng) in random_shuffle() argument
115 detail::random_shuffle(boost::begin(rng), boost::end(rng)); in random_shuffle()
116 return rng; in random_shuffle()
121 inline RandomAccessRange& random_shuffle(RandomAccessRange& rng, Generator& gen) in random_shuffle() argument
124 detail::random_shuffle(boost::begin(rng), boost::end(rng), gen); in random_shuffle()
125 return rng; in random_shuffle()
130 inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng, Generator& gen) in random_shuffle() argument
[all …]
|
| /third_party/boost/boost/geometry/util/ |
| D | range.hpp | 51 static inline iterator apply(RandomAccessRange & rng, size_type i) in apply()
54 return boost::begin(rng) + static_cast<difference_type>(i); in apply()
66 pos(RandomAccessRange const& rng, in pos() argument
69 BOOST_GEOMETRY_ASSERT(i <= boost::size(rng)); in pos()
70 return detail::pos<RandomAccessRange const>::apply(rng, i); in pos()
79 pos(RandomAccessRange & rng, in pos() argument
82 BOOST_GEOMETRY_ASSERT(i <= boost::size(rng)); in pos()
83 return detail::pos<RandomAccessRange>::apply(rng, i); in pos()
92 at(RandomAccessRange const& rng, in at() argument
95 BOOST_GEOMETRY_ASSERT(i < boost::size(rng)); in at()
[all …]
|
| /third_party/boost/libs/range/test/ |
| D | algorithm.cpp | 106 void test_random_algorithms(Rng & rng, std::random_access_iterator_tag) in test_random_algorithms() argument
121 boost::random_shuffle(rng); in test_random_algorithms()
126 boost::random_shuffle(rng, rng_generator); in test_random_algorithms()
128 boost::sort(rng); in test_random_algorithms()
129 boost::sort(rng, std::less<value_type>()); in test_random_algorithms()
131 boost::stable_sort(rng); in test_random_algorithms()
132 boost::stable_sort(rng, std::less<value_type>()); in test_random_algorithms()
134 boost::partial_sort(rng, boost::begin(rng)); in test_random_algorithms()
135 boost::partial_sort(rng, boost::begin(rng), std::less<value_type>()); in test_random_algorithms()
137 boost::nth_element(rng, boost::begin(rng)); in test_random_algorithms()
[all …]
|
| D | mfc.cpp | 118 rng_t rng; in test_CByteArray() local
119 BOOST_CHECK( brdm::test_init_array(rng, sample) ); in test_CByteArray()
120 BOOST_CHECK( brdm::test_random_access(rng) ); in test_CByteArray()
121 BOOST_CHECK( brdm::test_emptiness(rng) ); in test_CByteArray()
134 rng_t rng; in test_CDWordArray() local
135 BOOST_CHECK( brdm::test_init_array(rng, sample) ); in test_CDWordArray()
136 BOOST_CHECK( brdm::test_random_access(rng) ); in test_CDWordArray()
137 BOOST_CHECK( brdm::test_emptiness(rng) ); in test_CDWordArray()
150 rng_t rng; in test_CObArray() local
151 BOOST_CHECK( brdm::test_init_array(rng, sample) ); in test_CObArray()
[all …]
|
| D | atl.cpp | 150 rng_t rng; in test_CAtlArray() local
151 BOOST_CHECK( brdm::test_init_array(rng, sample) ); in test_CAtlArray()
152 BOOST_CHECK( brdm::test_random_access(rng) ); in test_CAtlArray()
153 BOOST_CHECK( brdm::test_emptiness(rng) ); in test_CAtlArray()
166 rng_t rng; in test_CAutoPtrArray() local
167 BOOST_CHECK( ::test_init_auto_ptr_array(rng, sample) ); in test_CAutoPtrArray()
168 BOOST_CHECK( brdm::test_random_access(rng) ); in test_CAutoPtrArray()
169 BOOST_CHECK( brdm::test_emptiness(rng) ); in test_CAutoPtrArray()
182 rng_t rng; in test_CInterfaceArray() local
183 BOOST_CHECK( brdm::test_init_array(rng, sample) ); in test_CInterfaceArray()
[all …]
|
| D | iterator_range_drop.cpp | 110 single_pass_range(const SinglePassRange& rng) in single_pass_range() argument
113 single_pass_iterator(boost::begin(rng)), in single_pass_range()
114 single_pass_iterator(boost::end(rng))); in single_pass_range()
119 bidirectional_range(const BidirectionalRange& rng) in bidirectional_range() argument
122 bidirectional_iterator(boost::begin(rng)), in bidirectional_range()
123 bidirectional_iterator(boost::end(rng))); in bidirectional_range()
137 boost::iterator_range<single_pass_iterator> rng = single_pass_range(v); in test_drop_front() local
139 BOOST_CHECK_EQUAL_COLLECTIONS(rng.begin(), rng.end(), in test_drop_front()
142 rng.drop_front(); in test_drop_front()
146 BOOST_CHECK_EQUAL_COLLECTIONS(rng.begin(), rng.end(), in test_drop_front()
[all …]
|
| /third_party/boost/libs/lexical_cast/test/ |
| D | lexical_cast_iterator_range_test.cpp | 55 void do_test_iterator_range_impl(const RngT& rng) in do_test_iterator_range_impl() argument
57 BOOST_CHECK_EQUAL(lexical_cast<int>(rng), 1); in do_test_iterator_range_impl()
58 BOOST_CHECK_EQUAL(lexical_cast<int>(rng.begin(), rng.size()), 1); in do_test_iterator_range_impl()
59 BOOST_CHECK_EQUAL(lexical_cast<unsigned int>(rng), 1u); in do_test_iterator_range_impl()
60 BOOST_CHECK_EQUAL(lexical_cast<unsigned int>(rng.begin(), rng.size()), 1u); in do_test_iterator_range_impl()
61 BOOST_CHECK_EQUAL(lexical_cast<short>(rng), 1); in do_test_iterator_range_impl()
62 BOOST_CHECK_EQUAL(lexical_cast<short>(rng.begin(), rng.size()), 1); in do_test_iterator_range_impl()
63 BOOST_CHECK_EQUAL(lexical_cast<unsigned short>(rng), 1u); in do_test_iterator_range_impl()
64 BOOST_CHECK_EQUAL(lexical_cast<unsigned short>(rng.begin(), rng.size()), 1u); in do_test_iterator_range_impl()
65 BOOST_CHECK_EQUAL(lexical_cast<long int>(rng), 1); in do_test_iterator_range_impl()
[all …]
|
| /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() argument
20 BOOST_FOREACH( foreach_value_type i, rng ) 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() argument
33 BOOST_FOREACH( foreach_value_type i, rng ) in sequence_equal_byval_c()
44 inline bool sequence_equal_byref_n( foreach_container_type & rng, char const * result ) in sequence_equal_byref_n() argument
46 BOOST_FOREACH( foreach_reference_type i, rng ) 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() argument
59 BOOST_FOREACH( foreach_const_reference_type i, rng ) in sequence_equal_byref_c()
71 inline void mutate_foreach_byref( foreach_container_type & rng ) in mutate_foreach_byref() argument
73 BOOST_FOREACH( foreach_reference_type i, rng ) in mutate_foreach_byref()
[all …]
|
| /third_party/boost/boost/range/adaptor/ |
| D | define_adaptor.hpp | 20 operator|(Range& rng, adaptor_name##_forwarder) \
22 return range_adaptor <Range>( rng ); \
26 operator|(const Range& rng, adaptor_name##_forwarder) \
28 return range_adaptor <const Range>( rng ); \
35 make_##adaptor_name(Range& rng) \
37 return range_adaptor <Range>(rng); \
42 make_##adaptor_name(const Range& rng) \
44 return range_adaptor <const Range>(rng); \
56 operator|(Range& rng, adaptor_name args) \
58 return range_adaptor <Range>(rng, args.arg1); \
[all …]
|
| /third_party/boost/boost/range/detail/ |
| D | range_return.hpp | 41 SinglePassRange& rng) in pack()
43 return type(found, boost::end(rng)); in pack()
63 static type pack(type found, SinglePassRange& rng) in pack()
65 return found == boost::end(rng) in pack()
76 static type pack(type found, BidirectionalRange& rng) in pack()
78 return found == boost::begin(rng) in pack()
91 SinglePassRange& rng) in pack()
93 return type(boost::begin(rng), found); in pack()
104 SinglePassRange& rng) in pack()
106 return type( boost::begin(rng), in pack()
[all …]
|
| /third_party/libxml2/test/relaxng/ |
| D | tutor1_4.rng | 1 <rng:element name="addressBook" xmlns:rng="http://relaxng.org/ns/structure/1.0">
2 <rng:zeroOrMore>
3 <rng:element name="card">
4 <rng:element name="name">
5 <rng:text/>
6 </rng:element>
7 <rng:element name="email">
8 <rng:text/>
9 </rng:element>
10 </rng:element>
[all …]
|
| /third_party/skia/third_party/externals/tint/src/ |
| D | source.cc | 42 auto rng = source.range; in operator <<() local
47 if (rng.begin.line) { in operator <<()
48 out << rng.begin.line << ":"; in operator <<()
49 if (rng.begin.column) { in operator <<()
50 out << rng.begin.column; in operator <<()
62 for (size_t line = rng.begin.line; line <= rng.end.line; line++) { in operator <<()
70 if (line == rng.begin.line && line == rng.end.line) { in operator <<()
72 repeat(' ', rng.begin.column - 1); in operator <<()
73 repeat('^', std::max<size_t>(rng.end.column - rng.begin.column, 1)); in operator <<()
74 } else if (line == rng.begin.line) { in operator <<()
[all …]
|