| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/lib/Demangle/ |
| D | ItaniumDemangle.cpp | 40 static const char *parse_type(const char *first, const char *last, C &db);
42 static const char *parse_encoding(const char *first, const char *last, C &db);
44 static const char *parse_name(const char *first, const char *last, C &db,
47 static const char *parse_expression(const char *first, const char *last, C &db);
49 static const char *parse_template_args(const char *first, const char *last,
52 static const char *parse_operator_name(const char *first, const char *last,
55 static const char *parse_unqualified_name(const char *first, const char *last,
58 static const char *parse_decltype(const char *first, const char *last, C &db);
62 static const char *parse_number(const char *first, const char *last) { in parse_number() argument
63 if (first != last) { in parse_number()
[all …]
|
| /third_party/boost/boost/algorithm/ |
| D | minmax_element.hpp | 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()
67 ForwardIter second = first; ++second; in basic_minmax_element()
73 if (comp(first, second)) in basic_minmax_element()
77 potential_min_result = first; in basic_minmax_element()
81 first = ++second; if (first != last) ++second; in basic_minmax_element()
83 if (comp(first, second)) { in basic_minmax_element()
84 if (comp(first, min_result)) { 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/spirit/home/x3/numeric/ |
| D | real_policies.hpp | 36 parse_n(Iterator& first, Iterator const& last, Attribute& attr_) in parse_n()
38 return extract_uint<T, 10, 1, -1>::call(first, last, attr_); in parse_n()
43 parse_dot(Iterator& first, Iterator const& last) in parse_dot()
45 if (first == last || *first != '.') in parse_dot()
47 ++first; in parse_dot()
53 parse_frac_n(Iterator& first, Iterator const& last, Attribute& attr_) in parse_frac_n()
55 return extract_uint<T, 10, 1, -1, true>::call(first, last, attr_); in parse_frac_n()
60 parse_exp(Iterator& first, Iterator const& last) in parse_exp()
62 if (first == last || (*first != 'e' && *first != 'E')) in parse_exp()
64 ++first; in parse_exp()
[all …]
|
| /third_party/boost/boost/spirit/home/qi/numeric/ |
| D | real_policies.hpp | 66 parse_n(Iterator& first, Iterator const& last, Attribute& attr_) in parse_n()
72 return extract_uint::call(first, last, attr_); in parse_n()
78 ignore_excess_digits(Iterator& first, Iterator const& last) in ignore_excess_digits()
80 Iterator save = first; in ignore_excess_digits()
81 if (extract_uint<unused_type, 10, 1, -1>::call(first, last, unused)) in ignore_excess_digits()
82 return std::distance(save, first); in ignore_excess_digits()
88 parse_dot(Iterator& first, Iterator const& last) in parse_dot()
90 if (first == last || *first != '.') in parse_dot()
92 ++first; in parse_dot()
98 parse_frac_n(Iterator& first, Iterator const& last, Attribute& attr_, int& frac_digits) in parse_frac_n()
[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 | heap_sort.hpp | 39 …static void adjust_heap(RandomAccessIterator first, size_type hole_index, size_type const len, val… in adjust_heap() argument
45 if (comp(*(first + second_child), *(first + (second_child - 1)))) in adjust_heap()
47 *(first + hole_index) = boost::move(*(first + second_child)); in adjust_heap()
52 *(first + hole_index) = boost::move(*(first + (second_child - 1))); in adjust_heap()
58 while (hole_index > top_index && comp(*(first + parent), value)) { in adjust_heap()
59 *(first + hole_index) = boost::move(*(first + parent)); in adjust_heap()
63 *(first + hole_index) = boost::move(value); in adjust_heap()
67 static void make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp) in make_heap() argument
69 size_type const len = size_type(last - first); in make_heap()
74 value_type v(boost::move(*(first + parent))); in make_heap()
[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/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/flutter/skia/third_party/externals/sdl/src/stdlib/ |
| D | SDL_qsort.c | 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;\
266 { size_t l=last-ffirst,r=llast-first; \
278 if (last-first>PIVOT_THRESHOLD*sz) mid=pivot_big(first,mid,last,sz,compare);\
280 if (compare(first,mid)<0) { \
283 if (compare(first,mid)>0) swapper(first,mid);\
[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 …]
|
| /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/nghttp2/src/ |
| D | base64.h | 49 template <typename InputIt> std::string encode(InputIt first, InputIt last) { in encode() argument
51 size_t len = last - first; in encode()
59 while (first != j) { in encode()
60 uint32_t n = static_cast<uint8_t>(*first++) << 16; in encode()
61 n += static_cast<uint8_t>(*first++) << 8; in encode()
62 n += static_cast<uint8_t>(*first++); in encode()
70 uint32_t n = static_cast<uint8_t>(*first++) << 16; in encode()
71 n += static_cast<uint8_t>(*first++) << 8; in encode()
77 uint32_t n = static_cast<uint8_t>(*first++) << 16; in encode()
89 OutputIt encode(InputIt first, InputIt last, OutputIt d_first) { in encode() argument
[all …]
|
| D | http2.cc | 1018 template <typename InputIt> InputIt skip_lws(InputIt first, InputIt last) { in skip_lws() argument
1019 for (; first != last; ++first) { in skip_lws()
1020 switch (*first) { in skip_lws()
1025 return first; in skip_lws()
1028 return first; in skip_lws()
1034 InputIt skip_to_next_field(InputIt first, InputIt last) { in skip_to_next_field() argument
1035 for (; first != last; ++first) { in skip_to_next_field()
1036 switch (*first) { in skip_to_next_field()
1042 return first; in skip_to_next_field()
1045 return first; in skip_to_next_field()
[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 …]
|
| D | array_test.cpp | 31 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
34 compare_streams_in_chars(first, second), in array_test()
41 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
44 compare_streams_in_chunks(first, second), in array_test()
52 vector<char> first(data_reps * data_length(), '?'); in array_test() local
53 stream<array_sink> out(&first[0], &first[0] + first.size()); in array_test()
57 compare_container_and_stream(first, second), in array_test()
63 vector<char> first(data_reps * data_length(), '?'); in array_test() local
64 stream<array_sink> out(&first[0], &first[0] + first.size()); in array_test()
68 compare_container_and_stream(first, second), in array_test()
[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/boost/boost/sort/common/ |
| D | sort_basic.hpp | 51 inline Iter_t is_stable_sorted_forward (Iter_t first, Iter_t last, in is_stable_sorted_forward() argument
55 assert ( (last- first) >= 0); in is_stable_sorted_forward()
57 if ((last - first) < 2) return first; in is_stable_sorted_forward()
58 Iter_t it2 = first + 1; in is_stable_sorted_forward()
59 for (Iter_t it1 = first; it2 != last and not comp(*it2, *it1); it1 = it2++); in is_stable_sorted_forward()
74 inline Iter_t is_reverse_stable_sorted_forward(Iter_t first, Iter_t last, in is_reverse_stable_sorted_forward() argument
78 assert ( (last- first) >= 0); in is_reverse_stable_sorted_forward()
80 if ((last - first) < 2) return first; in is_reverse_stable_sorted_forward()
81 Iter_t it2 = first + 1; in is_reverse_stable_sorted_forward()
82 for (Iter_t it1 = first; it2 != last and comp(*it2, *it1); it1 = it2++); in is_reverse_stable_sorted_forward()
[all …]
|
| D | range.hpp | 39 Iter_t first, last; member
53 range(const Iter_t &frs, const Iter_t &lst): first(frs), last(lst) { }; in range()
60 bool empty(void) const { return (first == last); }; in empty()
67 bool not_empty(void) const {return (first != last); }; in not_empty()
74 bool valid(void) const { return ((last - first) >= 0); }; in valid()
81 size_t size(void) const { return (last - first); }; in size()
88 Iter_t front(void) const { return first; }; in front()
109 return range<Iter_t>(it1.first, it2.last); in concat()
125 Iter2_t it_aux = util::move_forward(dest.first, src.first, src.last); in move_forward()
126 return range<Iter2_t>(dest.first, it_aux); in move_forward()
[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/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/boost/geometry/strategies/ |
| D | side_info.hpp | 42 sides[0].first = side_a1; in side_info()
44 sides[1].first = side_b1; in side_info()
49 inline void set(int first, int second) in set() argument
51 sides[Which].first = first; in set()
60 sides[Which].first = 0; in correct_to_zero()
71 return Index == 0 ? sides[Which].first : sides[Which].second; in get()
80 return sides[Which].first * sides[Which].second == 1; in same()
85 return sides[0].first == 0 in collinear()
87 && sides[1].first == 0 in collinear()
93 return sides[0].first * sides[0].second == -1 in crossing()
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | classCanExtendConstructorFunction.symbols | 1 === tests/cases/conformance/salsa/first.js ===
7 >Wagon : Symbol(Wagon, Decl(first.js, 0, 0), Decl(first.js, 6, 1))
8 >numberOxen : Symbol(numberOxen, Decl(first.js, 4, 15))
11 >this.numberOxen : Symbol(Wagon.numberOxen, Decl(first.js, 4, 28))
12 >this : Symbol(Wagon, Decl(first.js, 0, 0), Decl(first.js, 6, 1))
13 >numberOxen : Symbol(Wagon.numberOxen, Decl(first.js, 4, 28))
14 >numberOxen : Symbol(numberOxen, Decl(first.js, 4, 15))
18 >Wagon.circle : Symbol(Wagon.circle, Decl(first.js, 6, 1))
19 >Wagon : Symbol(Wagon, Decl(first.js, 0, 0), Decl(first.js, 6, 1))
20 >circle : Symbol(Wagon.circle, Decl(first.js, 6, 1))
[all …]
|
| /third_party/boost/libs/spirit/example/qi/ |
| D | actions.cpp | 62 char const *first = "{42}", *last = first + std::strlen(first); in main() local
64 parse(first, last, '{' >> int_[&print] >> '}'); in main()
70 char const *first = "{43}", *last = first + std::strlen(first); in main() local
72 parse(first, last, '{' >> int_[print_action()] >> '}'); in main()
78 char const *first = "{44}", *last = first + std::strlen(first); in main() local
81 parse(first, last, '{' >> int_[boost::bind(&print, _1)] >> '}'); in main()
87 char const *first = "{44}", *last = first + std::strlen(first); in main() local
91 parse(first, last, '{' >> int_[boost::bind(&writer::print, &w, _1)] >> '}'); in main()
98 char const *first = "{45}", *last = first + std::strlen(first); in main() local
101 parse(first, last, '{' >> int_[std::cout << _1 << '\n'] >> '}'); in main()
|