/dports/www/nghttp2/nghttp2-1.46.0/src/ |
H A D | shrpx_log.cc | 629 std::tie(p, last) = copy(' ', p, last); in upstream_accesslog() 634 std::tie(p, last) = copy('.', p, last); in upstream_accesslog() 651 std::tie(p, last) = copy('.', p, last); in upstream_accesslog() 668 std::tie(p, last) = copy('-', p, last); in upstream_accesslog() 678 std::tie(p, last) = copy('-', p, last); in upstream_accesslog() 692 std::tie(p, last) = copy('.', p, last); in upstream_accesslog() 698 std::tie(p, last) = copy(frac, p, last); in upstream_accesslog() 709 std::tie(p, last) = copy('-', p, last); in upstream_accesslog() 716 std::tie(p, last) = copy('-', p, last); in upstream_accesslog() 808 std::tie(p, last) = copy(name, p, last); in upstream_accesslog() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/courgette/third_party/divsufsort/ |
H A D | trsort.cc | 173 t = last - first; in tr_pivot() 187 last = tr_median3(ISAd, last - 1 - (t << 1), last - 1 - t, last - 1); in tr_pivot() 343 tr_partition(ISAd - incr, first, first, last, &a, &b, last - SA - 1); in tr_introsort() 346 if(a < last) { in tr_introsort() 349 if(b < last) { in tr_introsort() 361 STACK_PUSH5(ISAd, b, last, tr_ilg(last - b), trlink); in tr_introsort() 464 last = a; in tr_introsort() 475 last = a; in tr_introsort() 517 last = a; in tr_introsort() 528 last = a; in tr_introsort() [all …]
|
/dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/ThirdParty/range-v3/include/range/v3/algorithm/ |
H A D | sort.hpp | 66 I mid = first + (last - first) / 2, penultimate = ranges::prev(last); in unguarded_partition() 87 --last; in unguarded_partition() 89 --last; in unguarded_partition() 94 pivot_pnt == first ? last : (pivot_pnt == last ? first : pivot_pnt); in unguarded_partition() 107 last = next; in unguarded_linear_insert() 119 move_backward(first, last, last + 1); in linear_insert() 129 if(first == last) in insertion_sort() 177 first, last, last, std::ref(pred), std::ref(proj)), in introsort_loop() 181 last = cut; in introsort_loop() 207 first, last, detail::log2(last - first) * 2, pred, proj); [all …]
|
/dports/devel/range-v3/range-v3-0.11.0/include/range/v3/algorithm/ |
H A D | sort.hpp | 66 I mid = first + (last - first) / 2, penultimate = ranges::prev(last); in unguarded_partition() 87 --last; in unguarded_partition() 89 --last; in unguarded_partition() 94 pivot_pnt == first ? last : (pivot_pnt == last ? first : pivot_pnt); in unguarded_partition() 107 last = next; in unguarded_linear_insert() 119 move_backward(first, last, last + 1); in linear_insert() 129 if(first == last) in insertion_sort() 177 first, last, last, std::ref(pred), std::ref(proj)), in introsort_loop() 181 last = cut; in introsort_loop() 207 first, last, detail::log2(last - first) * 2, pred, proj); [all …]
|
/dports/emulators/mess/mame-mame0226/3rdparty/SDL2/src/stdlib/ |
H A D | SDL_qsort.c | 194 last=llast=stack[stacktop].last;\ 287 if (compare(mid,last)>0) swapper(first,last)\ 290 if (compare(mid,last)>0) swapper(mid,last);\ 304 while (compare(pivot,last)<0) last-=sz; \ 308 else if (first==last) { first+=sz; last-=sz; break; }\ 325 if (compare(first,last)>0) first=last; \ 326 last-=sz; } \ 386 { char *a=last-2*d, *b=last-d, *c=last; in pivot_big() 409 char *first,*last; in qsort_nonaligned() local 440 char *first,*last; in qsort_aligned() local [all …]
|
/dports/emulators/mame/mame-mame0226/3rdparty/SDL2/src/stdlib/ |
H A D | SDL_qsort.c | 194 last=llast=stack[stacktop].last;\ 287 if (compare(mid,last)>0) swapper(first,last)\ 290 if (compare(mid,last)>0) swapper(mid,last);\ 304 while (compare(pivot,last)<0) last-=sz; \ 308 else if (first==last) { first+=sz; last-=sz; break; }\ 325 if (compare(first,last)>0) first=last; \ 326 last-=sz; } \ 386 { char *a=last-2*d, *b=last-d, *c=last; in pivot_big() 409 char *first,*last; in qsort_nonaligned() local 440 char *first,*last; in qsort_aligned() local [all …]
|
/dports/graphics/milton/milton-1.9.1/third_party/SDL2-2.0.8/src/stdlib/ |
H A D | SDL_qsort.c | 194 last=llast=stack[stacktop].last;\ 287 if (compare(mid,last)>0) swapper(first,last)\ 290 if (compare(mid,last)>0) swapper(mid,last);\ 304 while (compare(pivot,last)<0) last-=sz; \ 308 else if (first==last) { first+=sz; last-=sz; break; }\ 325 if (compare(first,last)>0) first=last; \ 326 last-=sz; } \ 386 { char *a=last-2*d, *b=last-d, *c=last; in pivot_big() 409 char *first,*last; in qsort_nonaligned() local 440 char *first,*last; in qsort_aligned() local [all …]
|
/dports/x11/controllermap/SDL2-2.0.18/src/stdlib/ |
H A D | SDL_qsort.c | 197 last=llast=stack[stacktop].last;\ 290 if (compare(mid,last)>0) swapper(first,last)\ 293 if (compare(mid,last)>0) swapper(mid,last);\ 307 while (compare(pivot,last)<0) last-=sz; \ 311 else if (first==last) { first+=sz; last-=sz; break; }\ 330 if (compare(first,last)>0) first=last; \ 331 last-=sz; } \ 391 { char *a=last-2*d, *b=last-d, *c=last; in pivot_big() 414 char *first,*last; in qsort_nonaligned() local 445 char *first,*last; in qsort_aligned() local [all …]
|
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/SDL/src/stdlib/ |
H A D | SDL_qsort.c | 194 last=llast=stack[stacktop].last;\ 287 if (compare(mid,last)>0) swapper(first,last)\ 290 if (compare(mid,last)>0) swapper(mid,last);\ 304 while (compare(pivot,last)<0) last-=sz; \ 308 else if (first==last) { first+=sz; last-=sz; break; }\ 325 if (compare(first,last)>0) first=last; \ 326 last-=sz; } \ 386 { char *a=last-2*d, *b=last-d, *c=last; in pivot_big() 409 char *first,*last; in qsort_nonaligned() local 440 char *first,*last; in qsort_aligned() local [all …]
|
/dports/devel/sdl20/SDL2-2.0.18/src/stdlib/ |
H A D | SDL_qsort.c | 197 last=llast=stack[stacktop].last;\ 290 if (compare(mid,last)>0) swapper(first,last)\ 293 if (compare(mid,last)>0) swapper(mid,last);\ 307 while (compare(pivot,last)<0) last-=sz; \ 311 else if (first==last) { first+=sz; last-=sz; break; }\ 330 if (compare(first,last)>0) first=last; \ 331 last-=sz; } \ 391 { char *a=last-2*d, *b=last-d, *c=last; in pivot_big() 414 char *first,*last; in qsort_nonaligned() local 445 char *first,*last; in qsort_aligned() local [all …]
|
/dports/net-mgmt/librenms/librenms-vendor-21.5.1/psy/psysh/src/CodeCleaner/ |
H A D | ImplicitReturnPass.php | 52 $last = \end($nodes); 58 if ($last instanceof If_) { 59 $last->stmts = $this->addImplicitReturn($last->stmts); 61 foreach ($last->elseifs as $elseif) { 65 if ($last->else) { 66 $last->else->stmts = $this->addImplicitReturn($last->else->stmts); 68 } elseif ($last instanceof Switch_) { 69 foreach ($last->cases as $case) { 77 } elseif ($last instanceof Expr && !($last instanceof Exit_)) { 84 } elseif ($last instanceof Expression && !($last->expr instanceof Exit_)) { [all …]
|
/dports/misc/vifm/vifm-0.11/tests/cmds/ |
H A D | last_argument.c | 15 const char *last; in TEST() local 18 assert_true(last == cmd); in TEST() 26 const char *last; in TEST() local 29 assert_true(last == cmd); in TEST() 37 const char *last; in TEST() local 40 assert_true(last == cmd + 2); in TEST() 48 const char *last; in TEST() local 51 assert_true(last == cmd); in TEST() 59 const char *last; in TEST() local 70 const char *last; in TEST() local [all …]
|
/dports/textproc/py-xhtml2pdf/xhtml2pdf-0.2.5/xhtml2pdf/w3c/ |
H A D | cssSpecial.py | 206 name, parts, last = d 216 dd.append(("font-style", part, last)) 224 dd.append(("font-weight", part, last)) 233 dd.append(("font-size", part, last)) 235 dd.append(("font-face", parts, last)) 280 dd.append(("margin-left", left, last)) 281 dd.append(("margin-right", right, last)) 282 dd.append(("margin-top", top, last)) 303 dd.append(("padding-left", left, last)) 304 dd.append(("padding-right", right, last)) [all …]
|
/dports/math/eukleides/eukleides-1.5.4/src/common/ |
H A D | strings.c | 33 char **last; member 119 stk.last++; in start_buffer() 122 stk.last->cur = stk.last->buf; in start_buffer() 131 pos = stk.last->cur - stk.last->buf; in resize_buffer() 133 while (stk.last->size < size) stk.last->size *= 2; in resize_buffer() 134 stk.last->buf = (char *)realloc(stk.last->buf, stk.last->size); in resize_buffer() 136 stk.last->cur = stk.last->buf + pos; in resize_buffer() 141 if (stk.last->cur - stk.last->buf + l > stk.last->size) resize_buffer(l); in add_string() 148 if (stk.last->cur - stk.last->buf == stk.last->size) resize_buffer(1); in add_char() 172 val = (char *)realloc(stk.last->buf, stk.last->size); in get_buffer() [all …]
|
/dports/www/nginx-full/ngx_postgres-8aa7359/src/ |
H A D | ngx_postgres_output.c | 105 b->last = ngx_copy(b->last, PQgetvalue(res, 0, 0), size); in ngx_postgres_output_value() 297 b->last = ngx_copy(b->last, "\n", 1); in ngx_postgres_output_text() 349 last = last->next; in ngx_postgres_output_rds() 359 last = last->next; in ngx_postgres_output_rds() 369 last = last->next; in ngx_postgres_output_rds() 849 b->last = ngx_copy(b->last, PQgetvalue(res, 0, 0), in ngx_postgres_output_json() 851 b->last = ngx_copy(b->last, "", sizeof("")); in ngx_postgres_output_json() 877 b->last = ngx_copy(b->last, "[", sizeof("[") - 1); in ngx_postgres_output_json() 880 b->last = ngx_copy(b->last, ",", 1); in ngx_postgres_output_json() 885 b->last = ngx_copy(b->last, ",", 1); in ngx_postgres_output_json() [all …]
|
/dports/net-p2p/c-lightning/lightning-0.10.2/external/gheap/ |
H A D | gheap_cpp03.hpp | 237 assert(last >= first); in is_heap_until() 246 return last; in is_heap_until() 266 return (is_heap_until(first, last, less_comparer) == last); in is_heap() 285 assert(last >= first); in make_heap() 317 assert(last > first); in push_heap() 344 assert(last > first); in pop_heap() 397 assert(first < last); in swap_max_item() 454 assert(last > first); in restore_heap_after_item_decrease() 456 assert(item < last); in restore_heap_after_item_decrease() 484 assert(last > first); in remove_from_heap() [all …]
|
/dports/www/nginx-full/rds-json-nginx-module-0.15/src/ |
H A D | ngx_http_rds_json_handler.c | 119 *b->last++ = '{'; in ngx_http_rds_json_ret_handler() 122 *b->last++ = ':'; in ngx_http_rds_json_ret_handler() 123 b->last = ngx_copy(b->last, conf->errcode.data, conf->errcode.len); in ngx_http_rds_json_ret_handler() 127 b->last = ngx_copy(b->last, in ngx_http_rds_json_ret_handler() 133 b->last = ngx_copy(b->last, errstr.data, errstr.len); in ngx_http_rds_json_ret_handler() 135 b->last = (u_char *) ngx_http_rds_json_escape_json_str(b->last, in ngx_http_rds_json_ret_handler() 144 b->last = ngx_copy(b->last, conf->success.data, conf->success.len); in ngx_http_rds_json_ret_handler() 147 b->last = ngx_copy_literal(b->last, ":true"); in ngx_http_rds_json_ret_handler() 150 b->last = ngx_copy_literal(b->last, ":false"); in ngx_http_rds_json_ret_handler() 157 b->last = ngx_copy(b->last, prop[i].key.data, prop[i].key.len); in ngx_http_rds_json_ret_handler() [all …]
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/algorithm/minmax/test/ |
H A D | minmax_element_test.cpp | 130 …CHECK_EQUAL_ITERATORS( boost::first_min_element(first, last), std::min_element(first, last), first… in test_minmax() 134 …CHECK_EQUAL_ITERATORS( boost::first_max_element(first, last), std::max_element(first, last), first… in test_minmax() 189 Container c(first, last); in test_container() 210 test_range(first, last, n); in test() 214 std::fill(middle, last, Value(2)); in test() 215 test_range(first, last, n); in test() 219 test_range(first, last, n); in test() 222 std::reverse(first, last); in test() 223 test_range(first, last, n); in test() 226 std::random_shuffle(first, last); in test() [all …]
|
/dports/databases/xtrabackup/boost_1_59_0/libs/algorithm/minmax/test/ |
H A D | minmax_element_test.cpp | 130 …CHECK_EQUAL_ITERATORS( boost::first_min_element(first, last), std::min_element(first, last), first… in test_minmax() 134 …CHECK_EQUAL_ITERATORS( boost::first_max_element(first, last), std::max_element(first, last), first… in test_minmax() 189 Container c(first, last); in test_container() 210 test_range(first, last, n); in test() 214 std::fill(middle, last, Value(2)); in test() 215 test_range(first, last, n); in test() 219 test_range(first, last, n); in test() 222 std::reverse(first, last); in test() 223 test_range(first, last, n); in test() 226 std::random_shuffle(first, last); in test() [all …]
|
/dports/databases/percona57-server/boost_1_59_0/libs/algorithm/minmax/test/ |
H A D | minmax_element_test.cpp | 130 …CHECK_EQUAL_ITERATORS( boost::first_min_element(first, last), std::min_element(first, last), first… in test_minmax() 134 …CHECK_EQUAL_ITERATORS( boost::first_max_element(first, last), std::max_element(first, last), first… in test_minmax() 189 Container c(first, last); in test_container() 210 test_range(first, last, n); in test() 214 std::fill(middle, last, Value(2)); in test() 215 test_range(first, last, n); in test() 219 test_range(first, last, n); in test() 222 std::reverse(first, last); in test() 223 test_range(first, last, n); in test() 226 std::random_shuffle(first, last); in test() [all …]
|
/dports/databases/percona57-client/boost_1_59_0/libs/algorithm/minmax/test/ |
H A D | minmax_element_test.cpp | 130 …CHECK_EQUAL_ITERATORS( boost::first_min_element(first, last), std::min_element(first, last), first… in test_minmax() 134 …CHECK_EQUAL_ITERATORS( boost::first_max_element(first, last), std::max_element(first, last), first… in test_minmax() 189 Container c(first, last); in test_container() 210 test_range(first, last, n); in test() 214 std::fill(middle, last, Value(2)); in test() 215 test_range(first, last, n); in test() 219 test_range(first, last, n); in test() 222 std::reverse(first, last); in test() 223 test_range(first, last, n); in test() 226 std::random_shuffle(first, last); in test() [all …]
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/algorithm/minmax/test/ |
H A D | minmax_element_test.cpp | 130 …CHECK_EQUAL_ITERATORS( boost::first_min_element(first, last), std::min_element(first, last), first… in test_minmax() 134 …CHECK_EQUAL_ITERATORS( boost::first_max_element(first, last), std::max_element(first, last), first… in test_minmax() 189 Container c(first, last); in test_container() 210 test_range(first, last, n); in test() 214 std::fill(middle, last, Value(2)); in test() 215 test_range(first, last, n); in test() 219 test_range(first, last, n); in test() 222 std::reverse(first, last); in test() 223 test_range(first, last, n); in test() 226 std::random_shuffle(first, last); in test() [all …]
|
/dports/devel/doctorj/doctorj-5.1.2/org/incava/lang/ |
H A D | Range.java | 11 private int last; field in Range 16 this.last = last; in Range() 27 if (first > last) { in setFirst() 28 last = first; in setFirst() 34 return last; in getLast() 39 this.last = last; in setLast() 40 if (first > last) { in setLast() 41 first = last; in setLast() 59 return first == other.first && last == other.last; in equals() 71 if (i > last) { in expandTo() [all …]
|
/dports/devel/boost-docs/boost_1_72_0/libs/algorithm/minmax/example/ |
H A D | minmax_timer.cpp | 107 boost::make_filter_iterator(last, last, pred)), in test_minmax_element() 110 boost::make_filter_iterator(last, last, pred)), in test_minmax_element() 152 Container c(first, last); in test_container() 177 test_range(first, last, n); in test() 183 test_range(first, last, n); in test() 187 std::fill(first, last, Value(1)); in test() 189 test_range(first, last, n); in test() 193 std::reverse(first, last); in test() 194 test_range(first, last, n); in test() 198 std::random_shuffle(first, last); in test() [all …]
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/algorithm/minmax/example/ |
H A D | minmax_timer.cpp | 107 boost::make_filter_iterator(last, last, pred)), in test_minmax_element() 110 boost::make_filter_iterator(last, last, pred)), in test_minmax_element() 152 Container c(first, last); in test_container() 177 test_range(first, last, n); in test() 183 test_range(first, last, n); in test() 187 std::fill(first, last, Value(1)); in test() 189 test_range(first, last, n); in test() 193 std::reverse(first, last); in test() 194 test_range(first, last, n); in test() 198 std::random_shuffle(first, last); in test() [all …]
|