| /third_party/boost/boost/algorithm/ |
| D | minmax_element.hpp | 20 * minmax_element(first, last)
21 * Effect: std::make_pair( std::min_element(first, last),
22 * std::max_element(first, last) );
24 * minmax_element(first, last, comp)
25 * Effect: std::make_pair( std::min_element(first, last, comp),
26 * std::max_element(first, last, comp) );
58 basic_minmax_element(ForwardIter first, ForwardIter last, Compare comp) in basic_minmax_element() argument
60 if (first == last) in basic_minmax_element()
63 ForwardIter min_result = first; in basic_minmax_element()
64 ForwardIter max_result = first; in basic_minmax_element()
[all …]
|
| /third_party/boost/libs/algorithm/minmax/test/ |
| D | minmax_element_test.cpp | 28 void do_shuffle(RandomIt first, RandomIt last) in do_shuffle() argument
29 { std::shuffle(first, last, gen); } in do_shuffle()
32 void do_shuffle(RandomIt first, RandomIt last) in do_shuffle() argument
33 { std::random_shuffle(first, last); } in do_shuffle()
76 void tie(std::pair<T1, T2> p, T3& first, T4& second) in tie() argument
78 first = T3(p.first); second = T4(p.second); in tie()
111 #define CHECK_EQUAL_ITERATORS( left, right, first ) \ argument
112 BOOST_CHECK_EQUAL( std::distance( first, left ), std::distance( first, right ) )
115 void test_minmax(CIterator first, CIterator last, int n) in test_minmax() argument
123 RCIterator rfirst(last), rlast(first), rmin, rmax; in test_minmax()
[all …]
|
| /third_party/boost/boost/hana/detail/ |
| D | algorithm.hpp | 32 constexpr void reverse(BidirIter first, BidirIter last) { in reverse() argument
33 while (first != last) { in reverse()
34 if (first == --last) in reverse()
36 detail::constexpr_swap(*first, *last); in reverse()
37 ++first; in reverse()
42 constexpr bool next_permutation(BidirIter first, BidirIter last, in next_permutation() argument
46 if (first == last || first == --i) in next_permutation()
58 if (i == first) { in next_permutation()
59 detail::reverse(first, last); in next_permutation()
66 constexpr bool next_permutation(BidirIter first, BidirIter last) in next_permutation() argument
[all …]
|
| /third_party/boost/libs/stl_interfaces/test/ |
| D | random_access.cpp | 400 basic_random_access_iter first(ints.data()); in main() local
403 BOOST_TEST(*first == 0); in main()
404 BOOST_TEST(*(first + 1) == 1); in main()
405 BOOST_TEST(*(first + 2) == 2); in main()
406 BOOST_TEST(*(1 + first) == 1); in main()
407 BOOST_TEST(*(2 + first) == 2); in main()
409 BOOST_TEST(first[0] == 0); in main()
410 BOOST_TEST(first[1] == 1); in main()
411 BOOST_TEST(first[2] == 2); in main()
421 BOOST_TEST(last - first == 10); in main()
[all …]
|
| D | bidirectional.cpp | 333 basic_bidirectional_iter first(ints.data()); in main() local
338 std::copy(first, last, ints_copy.begin()); in main()
346 std::make_reverse_iterator(first), in main()
354 basic_bidirectional_iter first(iota_ints.data()); in main() local
356 std::iota(first, last, 0); in main()
362 basic_bidirectional_iter first(iota_ints.data()); in main() local
366 std::make_reverse_iterator(first), in main()
375 basic_adapted_bidirectional_ptr_iter first(ints.data()); in main() local
380 std::copy(first, last, ints_copy.begin()); in main()
388 std::make_reverse_iterator(first), in main()
[all …]
|
| /third_party/boost/boost/move/algo/detail/ |
| D | merge_sort.hpp | 45 void inplace_stable_sort(RandIt first, RandIt last, Compare comp) in inplace_stable_sort() argument
48 if (size_type(last - first) <= size_type(MergeSortInsertionSortThreshold)) { in inplace_stable_sort()
49 insertion_sort(first, last, comp); in inplace_stable_sort()
52 RandIt middle = first + (last - first) / 2; in inplace_stable_sort()
53 inplace_stable_sort(first, middle, comp); in inplace_stable_sort()
56 (first, middle, last, size_type(middle - first), size_type(last - middle), comp); in inplace_stable_sort()
62 void merge_sort_copy( RandIt first, RandIt last in merge_sort_copy() argument
67 size_type const count = size_type(last - first); in merge_sort_copy()
69 insertion_sort_copy(first, last, dest, comp); in merge_sort_copy()
73 merge_sort_copy(first + half, last , dest+half , comp); in merge_sort_copy()
[all …]
|
| D | merge.hpp | 50 void move_assign(RandIt first, size_type n) in move_assign() argument
53 boost::move(first, first+n, m_ptr); in move_assign()
61 RandRawIt result = boost::move(first, first+m_size, m_ptr); in move_assign()
62 boost::uninitialized_move(first+m_size, first+n, result); in move_assign()
68 void push_back(RandIt first, size_type n) in push_back() argument
71 boost::uninitialized_move(first, first+n, m_ptr+m_size); in push_back()
222 range_xbuf(Iterator first, Iterator last) in range_xbuf() argument
223 : m_first(first), m_last(first), m_cap(last) in range_xbuf()
227 void move_assign(RandIt first, size_type n) in move_assign() argument
230 m_last = Op()(forward_t(), first, first+n, m_first); in move_assign()
[all …]
|
| /third_party/boost/boost/detail/ |
| D | binary_search.hpp | 37 ForwardIter lower_bound(ForwardIter first, ForwardIter last, in lower_bound() argument
42 typename traits::difference_type len = std::distance(first, last); in lower_bound()
48 middle = first; in lower_bound()
51 first = middle; in lower_bound()
52 ++first; in lower_bound()
58 return first; in lower_bound()
62 ForwardIter lower_bound(ForwardIter first, ForwardIter last, in lower_bound() argument
67 typename traits::difference_type len = std::distance(first, last); in lower_bound()
73 middle = first; in lower_bound()
76 first = middle; in lower_bound()
[all …]
|
| /third_party/boost/boost/geometry/index/detail/rtree/node/ |
| D | pairs.hpp | 20 template <typename First, typename Pointer>
24 typedef First first_type;
26 ptr_pair(First const& f, Pointer s) : first(f), second(s) {} in ptr_pair()
27 //ptr_pair(ptr_pair const& p) : first(p.first), second(p.second) {}
28 //ptr_pair & operator=(ptr_pair const& p) { first = p.first; second = p.second; return *this; }
30 first_type first; member in boost::geometry::index::detail::rtree::ptr_pair
34 template <typename First, typename Pointer> inline
35 ptr_pair<First, Pointer>
36 make_ptr_pair(First const& f, Pointer s) in make_ptr_pair()
38 return ptr_pair<First, Pointer>(f, s); in make_ptr_pair()
[all …]
|
| /third_party/boost/boost/graph/distributed/adjlist/ |
| D | initialize.hpp | 23 initialize(EdgeIterator first, EdgeIterator last, in initialize() argument
28 while (first != last) { in initialize()
29 if ((process_id_type)distribution(first->first) == id) { in initialize()
30 vertex_descriptor source(id, distribution.local(first->first)); in initialize()
31 vertex_descriptor target(distribution(first->second), in initialize()
32 distribution.local(first->second)); in initialize()
35 ++first; in initialize()
45 initialize(EdgeIterator first, EdgeIterator last, in initialize() argument
51 while (first != last) { in initialize()
52 if (static_cast<process_id_type>(distribution(first->first)) == id) { in initialize()
[all …]
|
| /third_party/e2fsprogs/lib/ext2fs/ |
| D | tst_bitmaps_exp | 43 First unmarked block is 11
47 First unmarked block is 17
53 First marked block is 12
59 First marked block is 12
63 First marked block is 12
67 First unmarked block is 13
69 First marked block is 14
111 First unmarked inode is 1
115 First unmarked inode is 6
121 First marked inode is 2
[all …]
|
| /third_party/boost/boost/polygon/detail/ |
| D | property_merge.hpp | 79 …element.first = property_merge_point<coordinate_type>((*input_begin).second.first, (*input_begin).… in populate_property_merge_data()
81 …element.first = property_merge_point<coordinate_type>((*input_begin).first, (*input_begin).second.… in populate_property_merge_data()
82 element.second.first = property; in populate_property_merge_data()
122 currentVertex.first = data[i].first; in perform_merge()
125 if(data[i].first != currentVertex.first) { in perform_merge()
126 if(data[i].first.x() != currentVertex.first.x()) { in perform_merge()
130 writeOutput(currentVertex.first.x(), result, output); in perform_merge()
133 currentVertex.first = data[i].first; in perform_merge()
139 currentVertex.first = data[i].first; in perform_merge()
147 writeOutput(currentVertex.first.x(), result, output); in perform_merge()
[all …]
|
| /third_party/boost/boost/fusion/algorithm/transformation/ |
| D | erase.hpp | 27 template <typename Sequence, typename First>
31 typedef typename convert_iterator<First>::type first_type;
42 call(First const& first, mpl::false_) in call()
44 return fusion::next(convert_iterator<First>::call(first)); in call()
49 call(First const& first, mpl::true_) in call()
51 return convert_iterator<First>::call(first); in call()
56 call(First const& first) in call()
58 return call(first, result_of::equal_to<first_type, seq_last_type>()); in call()
76 , typename First
84 typedef First FirstType;
[all …]
|
| /third_party/flutter/skia/third_party/externals/freetype/src/cache/ |
| D | ftcmru.c | 32 FTC_MruNode first = *plist; in FTC_MruNode_Prepend() local
35 if ( first ) in FTC_MruNode_Prepend()
37 FTC_MruNode last = first->prev; in FTC_MruNode_Prepend()
42 FTC_MruNode cnode = first; in FTC_MruNode_Prepend()
54 } while ( cnode != first ); in FTC_MruNode_Prepend()
58 first->prev = node; in FTC_MruNode_Prepend()
60 node->next = first; in FTC_MruNode_Prepend()
76 FTC_MruNode first = *plist; in FTC_MruNode_Up() local
79 FT_ASSERT( first ); in FTC_MruNode_Up()
81 if ( first != node ) in FTC_MruNode_Up()
[all …]
|
| /third_party/boost/libs/iostreams/test/ |
| D | read_input_filter_test.hpp | 31 filtering_istream first; in read_input_filter_test() local
32 first.push(toupper_filter()); in read_input_filter_test()
33 first.push(file_source(test.name())); in read_input_filter_test()
36 compare_streams_in_chars(first, second), in read_input_filter_test()
43 filtering_istream first; in read_input_filter_test() local
44 first.push(toupper_filter()); in read_input_filter_test()
45 first.push(file_source(test.name())); in read_input_filter_test()
48 compare_streams_in_chunks(first, second), in read_input_filter_test()
55 filtering_istream first; in read_input_filter_test() local
56 first.push(toupper_multichar_filter(), 0); in read_input_filter_test()
[all …]
|
| D | wide_stream_test.cpp | 39 filtering_wistream first(source, 0); in read_wide_input_test() local
44 compare_streams_in_chars(first, second), in read_wide_input_test()
50 filtering_wistream first(source, 0); in read_wide_input_test() local
55 compare_streams_in_chunks(first, second), in read_wide_input_test()
61 filtering_wistream first(source); in read_wide_input_test() local
66 compare_streams_in_chars(first, second), in read_wide_input_test()
72 filtering_wistream first(source); in read_wide_input_test() local
77 compare_streams_in_chunks(first, second), in read_wide_input_test()
91 vector<wchar_t> first; in write_wide_output_test() local
93 filtering_wostream out(iostreams::back_inserter(first), 0); in write_wide_output_test()
[all …]
|
| /third_party/boost/boost/bimap/relation/ |
| D | structured_pair.hpp | 67 first_type first; member in boost::bimaps::relation::detail::normal_storage
77 : first(f), second(s) {} in normal_storage()
79 BOOST_DEDUCED_TYPENAME base_:: left_value_type & get_left() { return first; } in get_left()
80 const BOOST_DEDUCED_TYPENAME base_:: left_value_type & get_left()const { return first; } in get_left()
105 first_type first; member in boost::bimaps::relation::detail::mirror_storage
112 : second(s), first(f) {} in mirror_storage()
116 BOOST_DEDUCED_TYPENAME base_::right_value_type & get_right() { return first; } in get_right()
117 const BOOST_DEDUCED_TYPENAME base_::right_value_type & get_right()const { return first; } in get_right()
192 base_(p.first,p.second), in pair_info_hook()
198 base_::first = p.first ; in change_to()
[all …]
|
| /third_party/flutter/skia/third_party/externals/sdl/src/stdlib/ |
| D | SDL_qsort.c | 138 * 1998-03-19 v1.12 First release I have any records of.
187 typedef struct { char * first; char * last; } stack_entry; member
188 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;}
189 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;}
190 #define doLeft {first=ffirst;llast=last;continue;}
191 #define doRight {ffirst=first;last=llast;continue;}
193 first=ffirst=stack[stacktop].first;\
210 * 3. We choose a pivot by looking at the first, last
266 { size_t l=last-ffirst,r=llast-first; \
278 if (last-first>PIVOT_THRESHOLD*sz) mid=pivot_big(first,mid,last,sz,compare);\
[all …]
|
| /third_party/python/Doc/includes/ |
| D | test.py | 16 >>> c1.first
24 >>> c1.first = 'will'
30 >>> del c1.first
34 AttributeError: first
35 >>> c1.first
38 AttributeError: first
39 >>> c1.first = 'drew'
40 >>> c1.first
49 >>> c1.first = 42
55 >>> c2.first
[all …]
|
| /third_party/freetype/src/cache/ |
| D | ftcmru.c | 31 FTC_MruNode first = *plist; in FTC_MruNode_Prepend() local
34 if ( first ) in FTC_MruNode_Prepend()
36 FTC_MruNode last = first->prev; in FTC_MruNode_Prepend()
41 FTC_MruNode cnode = first; in FTC_MruNode_Prepend()
53 } while ( cnode != first ); in FTC_MruNode_Prepend()
57 first->prev = node; in FTC_MruNode_Prepend()
59 node->next = first; in FTC_MruNode_Prepend()
75 FTC_MruNode first = *plist; in FTC_MruNode_Up() local
78 FT_ASSERT( first ); in FTC_MruNode_Up()
80 if ( first != node ) in FTC_MruNode_Up()
[all …]
|
| /third_party/boost/libs/hana/test/detail/ |
| D | algorithm.cpp | 22 int* first = array; in constexpr_context() local
25 hana::detail::reverse(first, last); in constexpr_context()
27 hana::detail::next_permutation(first, last, hana::less); in constexpr_context()
28 hana::detail::next_permutation(first, last); in constexpr_context()
30 hana::detail::lexicographical_compare(first, last, first, last, hana::less); in constexpr_context()
31 hana::detail::lexicographical_compare(first, last, first, last); in constexpr_context()
33 hana::detail::equal(first, last, first, last, hana::equal); in constexpr_context()
34 hana::detail::equal(first, last, first, last); in constexpr_context()
36 hana::detail::sort(first, last, hana::equal); in constexpr_context()
37 hana::detail::sort(first, last); in constexpr_context()
[all …]
|
| /third_party/boost/libs/algorithm/minmax/example/ |
| D | minmax_timer.cpp | 24 min = p.first; max = p.second; in tie()
74 void test_minmax_element(CIterator first, CIterator last, int n, char* name) in test_minmax_element() argument
80 TIMER( n, std::min_element(first, last), in test_minmax_element()
82 TIMER( n, std::max_element(first, last), in test_minmax_element()
84 TIMER( n, boost::first_min_element(first, last), in test_minmax_element()
86 TIMER( n, boost::last_min_element(first, last), in test_minmax_element()
88 TIMER( n, boost::first_max_element(first, last), in test_minmax_element()
90 TIMER( n, boost::last_max_element(first, last), in test_minmax_element()
92 TIMER( n, boost::minmax_element(first, last), in test_minmax_element()
94 TIMER( n, boost::first_min_last_max_element(first, last), in test_minmax_element()
[all …]
|
| /third_party/boost/boost/hana/ |
| D | pair.hpp | 23 #include <boost/hana/fwd/first.hpp>
39 template <typename First, typename Second>
41 struct __declspec(empty_bases) pair : detail::operators::adl<pair<First, Second>>
43 struct pair : detail::operators::adl<pair<First, Second>>
45 , private detail::ebo<detail::pix<0>, First>
50 BOOST_HANA_TT_IS_CONSTRUCTIBLE(First, dummy...) &&
54 : detail::ebo<detail::pix<0>, First>() in pair()
60 BOOST_HANA_TT_IS_CONSTRUCTIBLE(First, First const&, dummy...) &&
63 constexpr pair(First const& fst, Second const& snd) in pair()
64 : detail::ebo<detail::pix<0>, First>(fst) in pair()
[all …]
|
| /third_party/boost/boost/spirit/home/qi/detail/ |
| D | construct.hpp | 30 call(Iterator const& first, Iterator const&, char& attr) in call()
32 attr = *first; in call()
40 call(Iterator const& first, Iterator const&, signed char& attr) in call()
42 attr = *first; in call()
50 call(Iterator const& first, Iterator const&, unsigned char& attr) in call()
52 attr = *first; in call()
61 call(Iterator const& first, Iterator const&, wchar_t& attr) in call()
63 attr = *first; in call()
73 call(Iterator const& first, Iterator const&, unsigned short& attr) in call()
75 attr = *first; in call()
[all …]
|
| /third_party/boost/boost/sort/common/util/ |
| D | search.hpp | 53 /// @brief find if a value exist in the range [first, last).
54 /// Always return as valid iterator in the range [first, last-1]
55 /// If exist return the iterator to the first occurrence. If don't exist
56 /// return the first greater than val.
58 /// If val is lower than (*first), return first
60 /// @param [in] first : iterator to the first element of the range
68 inline Iter_t internal_find_first(Iter_t first, Iter_t last, in internal_find_first() argument
73 Iter_t LI = first, LS = last - 1, it_out = first; in internal_find_first()
86 /// @brief find if a value exist in the range [first, last).
87 /// Always return as valid iterator in the range [first, last-1]
[all …]
|