/dports/net-im/tdlib/td-a53cb30e99f937cfd64e0266fa558785a184a553/tdutils/td/utils/ |
H A D | FloodControlStrict.h | 49 size_t min_pos = events_.size(); in update() local 70 min_pos = min(min_pos, limit.pos_); in update() 73 if (min_pos * 2 > events_.size()) { in update() 75 limit.pos_ -= min_pos; in update() 77 events_.erase(events_.begin(), events_.begin() + min_pos); in update()
|
/dports/misc/vxl/vxl-3.3.2/core/vgl/io/ |
H A D | vgl_io_box_2d.hxx | 32 T min_pos[2]; in vsl_b_read() local 38 vsl_b_read(is, min_pos[0]); in vsl_b_read() 39 vsl_b_read(is, min_pos[1]); in vsl_b_read() 43 p.set_min_x(min_pos[0]); in vsl_b_read() 44 p.set_min_y(min_pos[1]); in vsl_b_read()
|
H A D | vgl_io_box_3d.hxx | 35 T min_pos[3]; in vsl_b_read() local 41 vsl_b_read(is, min_pos[0]); in vsl_b_read() 42 vsl_b_read(is, min_pos[1]); in vsl_b_read() 43 vsl_b_read(is, min_pos[2]); in vsl_b_read() 47 p.set_min_position(min_pos); in vsl_b_read()
|
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/utils/tests/ |
H A D | test_arrayfuncs.py | 5 from sklearn.utils.arrayfuncs import min_pos 13 min_double = min_pos(X) 14 min_float = min_pos(X.astype(np.float32)) 26 assert min_pos(X) == np.finfo(dtype).max
|
/dports/net/tcpview/tcpview-1.0/ |
H A D | search.c | 382 long interpolated_position( min_time, min_pos, max_time, max_pos, desired_time ) in interpolated_position() argument 384 long min_pos, max_pos; 388 long full_span_pos = max_pos - min_pos; 394 return min_pos + (long) (fractional_offset * (double) full_span_pos); 461 int sf_find_packet( min_time, min_pos, max_time, max_pos, desired_time ) in sf_find_packet() argument 463 long min_pos, max_pos; 487 interpolated_position( min_time, min_pos, 510 if ( desired_pos < min_pos ) 511 desired_pos = min_pos; 542 min_pos = desired_pos;
|
/dports/math/py-or-tools/or-tools-9.2/ortools/algorithms/ |
H A D | sparse_permutation.cc | 59 int min_pos = start; 61 if (cycles_[i] < cycles_[min_pos]) min_pos = i; 64 for (int i = min_pos; i < end; ++i) cycle.push_back(cycles_[i]); 65 for (int i = start; i < min_pos; ++i) cycle.push_back(cycles_[i]);
|
/dports/net/libpcapnav/libpcapnav-0.8/src/ |
H A D | pcapnav_trace.c | 57 trace_get_interpolated_position( struct bpf_timeval *min_time, off_t min_pos, in trace_get_interpolated_position() argument 63 off_t full_span_pos = max_pos - min_pos; in trace_get_interpolated_position() 69 return (min_pos + (off_t) (fractional_offset * (double) full_span_pos)); in trace_get_interpolated_position() 131 off_t desired_pos, present_pos, min_pos, max_pos; in __pcapnav_trace_find_packet_at_timestamp() local 137 min_pos = pn->start_offset; in __pcapnav_trace_find_packet_at_timestamp() 155 if (FSEEK(pn->fp, min_pos, SEEK_SET) < 0) in __pcapnav_trace_find_packet_at_timestamp() 172 trace_get_interpolated_position(&min_time, min_pos, in __pcapnav_trace_find_packet_at_timestamp() 200 if (desired_pos < min_pos) in __pcapnav_trace_find_packet_at_timestamp() 201 desired_pos = min_pos; in __pcapnav_trace_find_packet_at_timestamp() 253 min_pos = desired_pos; in __pcapnav_trace_find_packet_at_timestamp()
|
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/lib/gitlab/relative_positioning/ |
H A D | mover.rb | 22 min_pos = focus.min_relative_position 24 move_to_range_start(focus, min_pos) 79 def move_to_range_start(context, min_pos) argument 82 new_pos = if min_pos.nil? 84 elsif gap_too_small?(min_pos, range_end) 90 position_between(min_pos, range_end)
|
/dports/lang/vala/vala-0.48.18/codegen/ |
H A D | valaccodedelegatemodule.vala | 98 int min_pos; 100 min_pos = -1; 102 if (pos > last_pos && (min_pos == -1 || pos < min_pos)) { 103 min_pos = pos; 262 int min_pos; 264 min_pos = -1; 266 if (pos > last_pos && (min_pos == -1 || pos < min_pos)) { 267 min_pos = pos; 388 min_pos = -1; 390 if (pos > last_pos && (min_pos == -1 || pos < min_pos)) { [all …]
|
/dports/cad/uranium/Uranium-3ed9c4de/UM/ |
H A D | SortedList.py | 1022 min_pos, min_idx = _pos(start) 1046 if min_pos > max_pos: 1049 if min_pos == max_pos: 1057 next_pos = min_pos + 1 1135 min_pos = 0 1139 min_pos = bisect_left(_maxes, minimum) 1141 if min_pos == len(_maxes): 1148 if min_pos == len(_maxes): 2165 min_pos = 0 2171 if min_pos == len(_maxes): [all …]
|
/dports/devel/py-sortedcontainers/sortedcontainers-2.3.0/sortedcontainers/ |
H A D | sortedlist.py | 997 min_pos, min_idx = _pos(start) 1021 if min_pos > max_pos: 1024 if min_pos == max_pos: 1032 next_pos = min_pos + 1 1110 min_pos = 0 1114 min_pos = bisect_left(_maxes, minimum) 1116 if min_pos == len(_maxes): 1123 if min_pos == len(_maxes): 2189 min_pos = 0 2195 if min_pos == len(_maxes): [all …]
|
/dports/misc/py-powerline-status/powerline-2.8.2/powerline/segments/common/ |
H A D | time.py | 108 min_pos = 0 114 min_pos = mn 117 min_pos = mn 118 result = format.format(minute_str=minute_str[str(min_pos)], hour_str=hour_str[hour])
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/python/tvm/autotvm/graph_tuner/ |
H A D | dynamic_programming_tuner.py | 113 min_pos = -1 123 min_pos = i 127 min_pos % (states[2] * aligned_node_shape[current_major_axis]) 136 min_pos // multiplier % aligned_node_shape[i] 182 min_pos = np.argmin(tmp) 188 optimal_record_dict[idx] = min_pos // multiplier 189 min_pos %= multiplier
|
/dports/misc/tvm/incubator-tvm-0.6.1/python/tvm/autotvm/graph_tuner/ |
H A D | dynamic_programming_tuner.py | 110 min_pos = -1 120 min_pos = i 123 current_sch_idx = (min_pos % (states[2] * 132 min_pos // multiplier % aligned_node_shape[i] 177 min_pos = np.argmin(tmp) 183 optimal_record_dict[idx] = min_pos // multiplier 184 min_pos %= multiplier
|
/dports/misc/py-tvm/incubator-tvm-0.6.1/python/tvm/autotvm/graph_tuner/ |
H A D | dynamic_programming_tuner.py | 110 min_pos = -1 120 min_pos = i 123 current_sch_idx = (min_pos % (states[2] * 132 min_pos // multiplier % aligned_node_shape[i] 177 min_pos = np.argmin(tmp) 183 optimal_record_dict[idx] = min_pos // multiplier 184 min_pos %= multiplier
|
/dports/cad/graywolf/graywolf-0.1.6-4-gf47937b/src/twsc/ |
H A D | sortpad.c | 238 INT min_pos ; /* min. value of the ideal positions of pad in pg */ local 253 min_pos = child->position ; 257 min_pos = MIN( child->position, min_pos ) ; 261 spacing = (DOUBLE) (max_pos - min_pos) / (DOUBLE) (howmany - 1) ; 266 proposed_fpos = min_pos + ROUND( (i - 1) * spacing ) ;
|
/dports/cad/graywolf/graywolf-0.1.6-4-gf47937b/src/twmc/ |
H A D | sortpad.c | 230 INT min_pos ; /* min. value of the ideal positions of pad in pg */ local 245 min_pos = child->position ; 249 min_pos = MIN( child->position, min_pos ) ; 253 spacing = (DOUBLE) (max_pos - min_pos) / (DOUBLE) (howmany - 1) ; 258 proposed_fpos = min_pos + ROUND( (i - 1) * spacing ) ;
|
/dports/biology/minimap2/minimap2-2.24/ |
H A D | sketch.c | 80 int i, j, l, buf_pos, min_pos, kmer_span = 0; in mm_sketch() local 89 for (i = l = buf_pos = min_pos = 0; i < len; ++i) { in mm_sketch() 125 min = info, min_pos = buf_pos; in mm_sketch() 126 } else if (buf_pos == min_pos) { // old min has moved outside the window in mm_sketch() 129 …if (min.x >= buf[j].x) min = buf[j], min_pos = j; // >= is important s.t. min is always the closes… in mm_sketch() 131 if (min.x >= buf[j].x) min = buf[j], min_pos = j; in mm_sketch()
|
/dports/net/tcpslice/tcpslice-f73194c/ |
H A D | search.c | 437 interpolated_position( const struct timeval *min_time, const int64_t min_pos, in interpolated_position() argument 443 int64_t full_span_pos = max_pos - min_pos; in interpolated_position() 449 return min_pos + (int64_t) (fractional_offset * (double) full_span_pos); in interpolated_position() 512 struct timeval *min_time, int64_t min_pos, in sf_find_packet() argument 535 interpolated_position( min_time, min_pos, in sf_find_packet() 561 if ( desired_pos < min_pos ) in sf_find_packet() 562 desired_pos = min_pos; in sf_find_packet() 594 min_pos = desired_pos; in sf_find_packet()
|
/dports/databases/libcouchbase/libcouchbase-2.10.7/src/jsparse/ |
H A D | parser.cc | 57 const char *ret = current_buf.c_str() + pos - min_pos; 61 if (min_pos > pos) { 130 if (ctx->keep_pos > ctx->min_pos) { 131 ctx->current_buf.erase(0, ctx->keep_pos - ctx->min_pos); 132 ctx->min_pos = ctx->keep_pos; 279 if (keep_pos > min_pos) { 280 current_buf.erase(0, keep_pos - min_pos); 283 min_pos = keep_pos; 312 min_pos(0),
|
/dports/games/minetest/minetest-5.4.1/src/gui/ |
H A D | guiScrollBar.cpp | 23 draw_center(0), thumb_size(0), min_pos(0), max_pos(100), small_step(10), in GUIScrollBar() 51 setPos(min_pos); in OnEvent() 250 return core::isnotzero(range()) ? s32(f32(p) / f32(w) * range() + 0.5f) + min_pos : 0; in getPosFromMousePos() 271 scroll_pos = core::s32_clamp(pos, min_pos, max_pos); in setPos() 275 draw_center = s32((f32(scroll_pos - min_pos) * f) + (f32(thumb_size) * 0.5f)) + in setPos() 292 if (min_pos > max_pos) in setMax() 293 min_pos = max_pos; in setMax() 303 min_pos = min; in setMin() 304 if (max_pos < min_pos) in setMin() 305 max_pos = min_pos; in setMin()
|
H A D | guiScrollBar.h | 38 s32 getMin() const { return min_pos; } in getMin() 54 f32 range() const { return f32(max_pos - min_pos); } in range() 67 s32 min_pos; variable
|
/dports/math/disco/DisCO-releases-1.0.0-33-g68720be/src/ |
H A D | DcoBranchStrategyStrong.cpp | 143 int min_pos = -1; in createCandBranchObjects() local 179 min_pos = num_bobjects; in createCandBranchObjects() 184 delete bobjects[min_pos]; in createCandBranchObjects() 185 bobjects[min_pos] = curr_branch_object; in createCandBranchObjects() 191 min_pos = k; in createCandBranchObjects()
|
/dports/graphics/luminance-qt5/luminance-hdr-2.6.1.1/src/TonemappingOperators/durand02/ |
H A D | tmo_durand02.cpp | 115 float min_pos = 1e10f; // minimum positive value (to avoid log(0)) in tmo_durand02() local 158 min_pos = std::min(min_pos, min_posthr); in tmo_durand02() 165 min_pos = std::min(min_pos, vhmin(min_posv)); in tmo_durand02() 173 vfloat min_posv = F2V(min_pos); in tmo_durand02() 194 L = std::max(L, min_pos); in tmo_durand02()
|
/dports/games/minetest/minetest-5.4.1/src/mapgen/ |
H A D | mg_biome.cpp | 49 b->min_pos = v3s16(-MAX_MAP_GENERATION_LIMIT, in BiomeManager() 137 pos.Y < b->min_pos.Y || pos.Y > b->max_pos.Y + b->vertical_blend || in getBiomeFromNoiseOriginal() 138 pos.X < b->min_pos.X || pos.X > b->max_pos.X || in getBiomeFromNoiseOriginal() 139 pos.Z < b->min_pos.Z || pos.Z > b->max_pos.Z) in getBiomeFromNoiseOriginal() 301 pos.Y < b->min_pos.Y || pos.Y > b->max_pos.Y + b->vertical_blend || in calcBiomeFromNoise() 302 pos.X < b->min_pos.X || pos.X > b->max_pos.X || in calcBiomeFromNoise() 303 pos.Z < b->min_pos.Z || pos.Z > b->max_pos.Z) in calcBiomeFromNoise() 364 obj->min_pos = min_pos; in clone()
|