Home
last modified time | relevance | path

Searched refs:last (Results 1 – 25 of 5380) sorted by relevance

12345678910>>...216

/third_party/libwebsockets/minimal-examples/ws-client/minimal-ws-client-pmd-bulk/
DREADME.md26 [2018/04/05 12:08:59:9139] USER: LWS_CALLBACK_CLIENT_RECEIVE: 1024 (rpp 0, last 0)
27 [2018/04/05 12:08:59:9139] USER: LWS_CALLBACK_CLIENT_RECEIVE: 1024 (rpp 0, last 0)
28 [2018/04/05 12:08:59:9139] USER: LWS_CALLBACK_CLIENT_RECEIVE: 1024 (rpp 0, last 0)
29 [2018/04/05 12:08:59:9139] USER: LWS_CALLBACK_CLIENT_RECEIVE: 1024 (rpp 0, last 0)
30 [2018/04/05 12:08:59:9139] USER: LWS_CALLBACK_CLIENT_RECEIVE: 1024 (rpp 0, last 0)
31 [2018/04/05 12:08:59:9140] USER: LWS_CALLBACK_CLIENT_RECEIVE: 1024 (rpp 0, last 0)
32 [2018/04/05 12:08:59:9140] USER: LWS_CALLBACK_CLIENT_RECEIVE: 1024 (rpp 0, last 0)
33 [2018/04/05 12:08:59:9140] USER: LWS_CALLBACK_CLIENT_RECEIVE: 1024 (rpp 0, last 0)
34 [2018/04/05 12:08:59:9140] USER: LWS_CALLBACK_CLIENT_RECEIVE: 1024 (rpp 0, last 0)
35 [2018/04/05 12:08:59:9140] USER: LWS_CALLBACK_CLIENT_RECEIVE: 1024 (rpp 0, last 0)
[all …]
/third_party/boost/boost/algorithm/
Dminmax_element.hpp58 basic_minmax_element(ForwardIter first, ForwardIter last, Compare comp) in basic_minmax_element() argument
60 if (first == last) in basic_minmax_element()
61 return std::make_pair(last,last); in basic_minmax_element()
68 if (second == last) in basic_minmax_element()
72 ForwardIter potential_min_result = last; in basic_minmax_element()
81 first = ++second; if (first != last) ++second; in basic_minmax_element()
82 while (second != last) { in basic_minmax_element()
86 potential_min_result = last; in basic_minmax_element()
99 if (first != last) ++second; in basic_minmax_element()
103 if (first != last) { // odd number of elements in basic_minmax_element()
[all …]
/third_party/boost/libs/range/test/
Dirange.cpp23 void test_irange_impl(Integer last) in test_irange_impl() argument
26 for (Integer i = static_cast<Integer>(0); i < last; ++i) in test_irange_impl()
32 boost::push_back(test, boost::irange(last)); in test_irange_impl()
40 void test_irange_impl(Integer first, Integer last) in test_irange_impl() argument
43 for (Integer i = first; i < last; ++i) in test_irange_impl()
49 boost::push_back(test, boost::irange(first, last)); in test_irange_impl()
57 void test_irange_impl(IntegerInput first, IntegerInput last, int step) in test_irange_impl() argument
64 || (static_cast<IntegerInput>(static_cast<Integer>(last)) != last)) in test_irange_impl()
70 const std::ptrdiff_t last_p = static_cast<std::ptrdiff_t>(last); in test_irange_impl()
78 boost::push_back(test, boost::irange(first, last, step)); in test_irange_impl()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/lib/Demangle/
DItaniumDemangle.cpp40 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/libs/spirit/test/x3/
Dtest.hpp19 Char const* last = in; in test() local
20 while (*last) in test()
21 last++; in test()
22 return boost::spirit::x3::parse(in, last, p) in test()
23 && (!full_match || (in == last)); in test()
30 auto const last = in.end(); in test() local
33 return boost::spirit::x3::parse(pos, last, p) && (!full_match || (pos == last)); in test()
40 Char const* last = in; in test() local
41 while (*last) in test()
42 last++; in test()
[all …]
/third_party/boost/libs/stl_interfaces/test/
Drandom_access.cpp401 basic_random_access_iter last(ints.data() + ints.size()); in main() local
413 BOOST_TEST(*(last - 1) == 9); in main()
414 BOOST_TEST(*(last - 2) == 8); in main()
415 BOOST_TEST(*(last - 3) == 7); in main()
417 BOOST_TEST(last[-1] == 9); in main()
418 BOOST_TEST(last[-2] == 8); in main()
419 BOOST_TEST(last[-3] == 7); in main()
421 BOOST_TEST(last - first == 10); in main()
423 BOOST_TEST(first != last); in main()
424 BOOST_TEST(first < last); in main()
[all …]
Dbidirectional.cpp334 basic_bidirectional_iter last(ints.data() + ints.size()); in main() local
338 std::copy(first, last, ints_copy.begin()); in main()
345 std::make_reverse_iterator(last), in main()
355 basic_bidirectional_iter last(iota_ints.data() + iota_ints.size()); in main() local
356 std::iota(first, last, 0); in main()
363 basic_bidirectional_iter last(iota_ints.data() + iota_ints.size()); in main() local
365 std::make_reverse_iterator(last), in main()
376 basic_adapted_bidirectional_ptr_iter last(ints.data() + ints.size()); in main() local
380 std::copy(first, last, ints_copy.begin()); in main()
387 std::make_reverse_iterator(last), in main()
[all …]
/third_party/boost/libs/algorithm/minmax/test/
Dminmax_element_test.cpp28 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()
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()
129 tie( boost::minmax_element(first, last), min, max ); in test_minmax()
131 CHECK_EQUAL_ITERATORS( min, std::min_element(first, last), first ); in test_minmax()
132 CHECK_EQUAL_ITERATORS( max, std::max_element(first, last), first ); in test_minmax()
136 tie( boost::minmax_element(first, last, lc), min, max ); in test_minmax()
[all …]
/third_party/nghttp2/src/
Dshrpx_log.cc613 auto last = std::end(buf) - 2; in upstream_accesslog() local
618 std::tie(p, last) = copy(lf.value, p, last); in upstream_accesslog()
621 std::tie(p, last) = copy(lgsp.remote_addr, p, last); in upstream_accesslog()
624 std::tie(p, last) = copy(tstamp->time_local, p, last); in upstream_accesslog()
627 std::tie(p, last) = copy(tstamp->time_iso8601, p, last); in upstream_accesslog()
630 std::tie(p, last) = copy(method, p, last); in upstream_accesslog()
631 std::tie(p, last) = copy(' ', p, last); in upstream_accesslog()
632 std::tie(p, last) = copy_escape(path, p, last); in upstream_accesslog()
633 std::tie(p, last) = copy_l(" HTTP/", p, last); in upstream_accesslog()
634 std::tie(p, last) = copy(req.http_major, p, last); in upstream_accesslog()
[all …]
/third_party/flutter/skia/third_party/externals/sdl/src/stdlib/
DSDL_qsort.c187 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;}
194 last=llast=stack[stacktop].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);\
281 if (compare(mid,last)>0) { \
282 swapper(mid,last); \
[all …]
/third_party/boost/libs/algorithm/minmax/example/
Dminmax_timer.cpp74 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()
96 TIMER( n, boost::last_min_first_max_element(first, last), in test_minmax_element()
[all …]
/third_party/boost/libs/hana/test/detail/
Dalgorithm.cpp23 int* last = array + 6; 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/spirit/test/qi/
Dtest.hpp24 Char const* last = in; in test() local
25 while (*last) in test()
26 last++; in test()
27 return boost::spirit::qi::parse(in, last, p) in test()
28 && (!full_match || (in == last)); in test()
39 Char const* last = in; in test() local
40 while (*last) in test()
41 last++; in test()
42 return boost::spirit::qi::phrase_parse(in, last, p, s) in test()
43 && (!full_match || (in == last)); in test()
[all …]
/third_party/skia/src/core/
DSkEdgeBuilder.cpp19 SkEdgeBuilder::Combine SkBasicEdgeBuilder::combineVertical(const SkEdge* edge, SkEdge* last) { in combineVertical() argument
20 if (last->fCurveCount || last->fDX || edge->fX != last->fX) { in combineVertical()
23 if (edge->fWinding == last->fWinding) { in combineVertical()
24 if (edge->fLastY + 1 == last->fFirstY) { in combineVertical()
25 last->fFirstY = edge->fFirstY; in combineVertical()
28 if (edge->fFirstY == last->fLastY + 1) { in combineVertical()
29 last->fLastY = edge->fLastY; in combineVertical()
34 if (edge->fFirstY == last->fFirstY) { in combineVertical()
35 if (edge->fLastY == last->fLastY) { in combineVertical()
38 if (edge->fLastY < last->fLastY) { in combineVertical()
[all …]
/third_party/boost/libs/hana/include/boost/hana/detail/
Dalgorithm.hpp32 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()
42 constexpr bool next_permutation(BidirIter first, BidirIter last, in next_permutation() argument
45 BidirIter i = last; in next_permutation()
46 if (first == last || first == --i) in next_permutation()
51 BidirIter j = last; in next_permutation()
55 detail::reverse(ip1, last); in next_permutation()
59 detail::reverse(first, last); in next_permutation()
[all …]
/third_party/boost/boost/hana/detail/
Dalgorithm.hpp32 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()
42 constexpr bool next_permutation(BidirIter first, BidirIter last, in next_permutation() argument
45 BidirIter i = last; in next_permutation()
46 if (first == last || first == --i) in next_permutation()
51 BidirIter j = last; in next_permutation()
55 detail::reverse(ip1, last); in next_permutation()
59 detail::reverse(first, last); in next_permutation()
[all …]
/third_party/boost/boost/spirit/home/x3/numeric/
Dreal_policies.hpp36 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()
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()
70 parse_exp_n(Iterator& first, Iterator const& last, int& attr_) in parse_exp_n()
72 return extract_int<int, 10, 1, -1>::call(first, last, attr_); in parse_exp_n()
[all …]
/third_party/flutter/skia/src/core/
DSkEdgeBuilder.cpp19 SkEdgeBuilder::Combine SkBasicEdgeBuilder::combineVertical(const SkEdge* edge, SkEdge* last) { in combineVertical() argument
20 if (last->fCurveCount || last->fDX || edge->fX != last->fX) { in combineVertical()
23 if (edge->fWinding == last->fWinding) { in combineVertical()
24 if (edge->fLastY + 1 == last->fFirstY) { in combineVertical()
25 last->fFirstY = edge->fFirstY; in combineVertical()
28 if (edge->fFirstY == last->fLastY + 1) { in combineVertical()
29 last->fLastY = edge->fLastY; in combineVertical()
34 if (edge->fFirstY == last->fFirstY) { in combineVertical()
35 if (edge->fLastY == last->fLastY) { in combineVertical()
38 if (edge->fLastY < last->fLastY) { in combineVertical()
[all …]
/third_party/boost/boost/sort/common/util/
Dsearch.hpp68 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()
102 inline Iter_t internal_find_last(Iter_t first, Iter_t last, in internal_find_last() argument
107 Iter_t LI = first, LS = last - 1, it_out = first; in internal_find_last()
141 inline Iter_t find_first(Iter_t first, Iter_t last, in find_first() argument
146 assert((last - first) >= 0); in find_first()
147 if (first == last) return last; in find_first()
148 Iter_t LS = internal_find_first(first, last, val, comp, flt); in find_first()
149 return (comp(flt(*LS), val) or comp(val, flt(*LS))) ? last : LS; in find_first()
166 inline Iter_t find_last(Iter_t first, Iter_t last, in find_last() argument
[all …]
/third_party/boost/boost/move/algo/detail/
Dmerge_sort.hpp45 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()
54 inplace_stable_sort(middle, last, 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 …]
/third_party/boost/boost/sort/spreadsort/
Dstring_sort.hpp74 inline void string_sort(RandomAccessIter first, RandomAccessIter last, in string_sort() argument
78 if (last - first < detail::min_sort_size) in string_sort()
79 boost::sort::pdqsort(first, last); in string_sort()
81 detail::string_sort(first, last, unused); in string_sort()
165 inline void string_sort(RandomAccessIter first, RandomAccessIter last) in string_sort() argument
168 string_sort(first, last, unused); in string_sort()
259 RandomAccessIter last, Compare comp, Unsigned_char_type unused) in reverse_string_sort() argument
262 if (last - first < detail::min_sort_size) in reverse_string_sort()
263 boost::sort::pdqsort(first, last, comp); in reverse_string_sort()
265 detail::reverse_string_sort(first, last, unused); in reverse_string_sort()
[all …]
/third_party/boost/boost/spirit/home/qi/numeric/
Dreal_policies.hpp66 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()
81 if (extract_uint<unused_type, 10, 1, -1>::call(first, last, unused)) in ignore_excess_digits()
88 parse_dot(Iterator& first, Iterator const& last) in parse_dot()
90 if (first == last || *first != '.') in parse_dot()
98 parse_frac_n(Iterator& first, Iterator const& last, Attribute& attr_, int& frac_digits) in parse_frac_n()
101 bool r = extract_uint<Attribute, 10, 1, -1, true, true>::call(first, last, attr_); in parse_frac_n()
117 extract_uint<unused_type, 10, 1, -1>::call(first, last, unused); in parse_frac_n()
124 parse_exp(Iterator& first, Iterator const& last) in parse_exp()
[all …]
/third_party/typescript/tests/baselines/reference/
DtopLevelBlockExpando.types11 last: string;
12 >last : string
17 >dice : { (): number; first: string; last: string; }
18 >() => Math.floor(Math.random() * 6) : { (): number; first: string; last: string; }
33 >dice : { (): number; first: string; last: string; }
37 dice.last = 'Calrissian';
38 >dice.last = 'Calrissian' : "Calrissian"
39 >dice.last : string
40 >dice : { (): number; first: string; last: string; }
41 >last : string
[all …]
/third_party/boost/boost/sort/common/
Dsort_basic.hpp51 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()
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()
82 for (Iter_t it1 = first; it2 != last and comp(*it2, *it1); it1 = it2++); in is_reverse_stable_sorted_forward()
97 size_t number_stable_sorted_forward (Iter_t first, Iter_t last, in number_stable_sorted_forward() argument
102 assert ( (last- first) >= 0); in number_stable_sorted_forward()
[all …]
/third_party/boost/libs/spirit/repository/test/qi/
Dtest.hpp24 Char const* last = in; in test() local
25 while (*last) in test()
26 last++; in test()
27 return boost::spirit::qi::parse(in, last, p) in test()
28 && (!full_match || (in == last)); in test()
39 Char const* last = in; in test() local
40 while (*last) in test()
41 last++; in test()
42 return boost::spirit::qi::phrase_parse(in, last, p, s) in test()
43 && (!full_match || (in == last)); in test()
[all …]

12345678910>>...216