| /dports/games/libretro-mame2000/mame2000-libretro-e364a15/src/machine/ |
| H A D | atarifb.c | 65 int new_x,new_y; in READ_HANDLER() local
72 counter_x = new_x; in READ_HANDLER()
96 int new_x,new_y; in READ_HANDLER() local
103 counter_x = new_x; in READ_HANDLER()
138 int new_x,new_y; in READ_HANDLER() local
145 counter_x = new_x; in READ_HANDLER()
161 int new_x,new_y; in READ_HANDLER() local
168 counter_x = new_x; in READ_HANDLER()
195 int new_x,new_y; in READ_HANDLER() local
202 counter_x = new_x; in READ_HANDLER()
[all …]
|
| /dports/games/libretro-mame2003/mame2003-libretro-4358db4/src/machine/ |
| H A D | atarifb_machine.c | 130 int new_x,new_y; in READ_HANDLER() local
137 counter_x = new_x; in READ_HANDLER()
161 int new_x,new_y; in READ_HANDLER() local
168 counter_x = new_x; in READ_HANDLER()
203 int new_x,new_y; in READ_HANDLER() local
210 counter_x = new_x; in READ_HANDLER()
226 int new_x,new_y; in READ_HANDLER() local
233 counter_x = new_x; in READ_HANDLER()
260 int new_x,new_y; in READ_HANDLER() local
267 counter_x = new_x; in READ_HANDLER()
[all …]
|
| /dports/games/libretro-mame2003_plus/mame2003-plus-libretro-17e9889/src/machine/ |
| H A D | atarifb_machine.c | 130 int new_x,new_y; in READ_HANDLER() local
137 counter_x = new_x; in READ_HANDLER()
161 int new_x,new_y; in READ_HANDLER() local
168 counter_x = new_x; in READ_HANDLER()
203 int new_x,new_y; in READ_HANDLER() local
210 counter_x = new_x; in READ_HANDLER()
226 int new_x,new_y; in READ_HANDLER() local
233 counter_x = new_x; in READ_HANDLER()
260 int new_x,new_y; in READ_HANDLER() local
267 counter_x = new_x; in READ_HANDLER()
[all …]
|
| /dports/science/py-scimath/scimath-4.2.0/scimath/interpolate/ |
| H A D | interpolate.py | 16 def linear(x, y, new_x): argument
30 new_x = make_array_safe(new_x, numpy.float64)
44 def logarithmic(x, y, new_x): argument
58 new_x = make_array_safe(new_x, numpy.float64)
87 new_x = make_array_safe(new_x, numpy.float64)
114 new_x = make_array_safe(new_x, numpy.float64)
135 new_x = arange(N) + 0.5
146 new_x = arange(N / 2) * 2
156 new_x = arange(N) + 0.5
167 new_x = arange(N)
[all …]
|
| H A D | interpolate.h | 12 T new_x = new_x_vec[i]; in linear() local
14 if (new_x <= x_vec[0]) in linear()
16 else if (new_x >=x_vec[len-1]) in linear()
24 if(new_x == x_vec[index]) in linear()
48 T new_x = new_x_vec[i]; in loginterp() local
50 if (new_x <= x_vec[0]) in loginterp()
60 if(new_x == x_vec[index]) in loginterp()
89 T new_x = new_x_vec[i]; in block_average_above() local
90 if ((new_x < x_vec[0]) || (new_x > x_vec[len-1])) in block_average_above()
142 T new_x = new_x_vec[i]; in window_average() local
[all …]
|
| /dports/emulators/mess/mame-mame0226/src/mame/machine/ |
| H A D | atarifb.cpp | 131 int new_x, new_y; in atarifb_in0_r() local
138 m_counter_x_in0 = new_x; in atarifb_in0_r()
161 int new_x, new_y; in atarifb_in2_r() local
168 m_counter_x_in2 = new_x; in atarifb_in2_r()
202 int new_x, new_y; in atarifb4_in0_r() local
209 m_counter_x_in0 = new_x; in atarifb4_in0_r()
224 int new_x, new_y; in atarifb4_in0_r() local
231 m_counter_x_in0b = new_x; in atarifb4_in0_r()
257 int new_x, new_y; in atarifb4_in2_r() local
264 m_counter_x_in2 = new_x; in atarifb4_in2_r()
[all …]
|
| /dports/emulators/mame/mame-mame0226/src/mame/machine/ |
| H A D | atarifb.cpp | 131 int new_x, new_y; in atarifb_in0_r() local
138 m_counter_x_in0 = new_x; in atarifb_in0_r()
161 int new_x, new_y; in atarifb_in2_r() local
168 m_counter_x_in2 = new_x; in atarifb_in2_r()
202 int new_x, new_y; in atarifb4_in0_r() local
209 m_counter_x_in0 = new_x; in atarifb4_in0_r()
224 int new_x, new_y; in atarifb4_in0_r() local
231 m_counter_x_in0b = new_x; in atarifb4_in0_r()
257 int new_x, new_y; in atarifb4_in2_r() local
264 m_counter_x_in2 = new_x; in atarifb4_in2_r()
[all …]
|
| /dports/editors/mined/mined-2015.25/src/ |
| H A D | textbuf.c | 191 int new_x;
212 } else if (tab_left && new_x == old_x && tab (tx) > new_x) {
258 if (tx > new_x && new_x < * cur_x && new_x < old_x) {
262 new_x = tx;
263 } else if (tab_left && tx > new_x && new_x == old_x) {
267 new_x = tx;
322 new_x = 0;
348 new_x = tx;
361 new_x ++;
368 new_x --;
[all …]
|
| /dports/games/openclonk/openclonk-release-8.1-src/planet/Tutorials.ocf/Sandbox.ocs/System.ocg/ |
| H A D | SprayCan.c | 25 public func ControlUseHolding(object clonk, int new_x, int new_y) in ControlUseHolding() argument
28 new_x += GetX(); new_y += GetY(); in ControlUseHolding()
32 StartSpraying(clonk, new_x, new_y); in ControlUseHolding()
35 if (new_x == last_x && new_y == last_y) in ControlUseHolding()
38 var dx = new_x - last_x, dy = new_y - last_y; in ControlUseHolding()
49 …dx, last_y - last_ldy, last_x + last_ldx, last_y + last_ldy, new_x + ldx,new_y + ldy, new_x - ldx,… in ControlUseHolding()
54 …lQuad(paint_col, new_x - (wdt / 2), new_y - (wdt / 2), new_x + (wdt / 2), new_y - (wdt / 2), new_x… in ControlUseHolding()
60 …lQuad(paint_col, new_x - (wdt / 2), new_y - (wdt / 2), new_x + (wdt / 2), new_y - (wdt / 2), new_x… in ControlUseHolding()
61 ClearFreeRect(new_x - (wdt / 2), new_y - (wdt / 2), wdt, wdt); in ControlUseHolding()
64 last_x = new_x; last_y = new_y; in ControlUseHolding()
|
| /dports/x11-wm/afterstep-stable/afterstep-devel-2.2.12/libAfterStep/ |
| H A D | shape.c | 59 new_x, new_y); in assimilate_rectangle()
63 if (shape_rects[i].x >= new_x && in assimilate_rectangle()
70 shape_rects[i].x = new_x; in assimilate_rectangle()
80 int w1 = new_x + new_width; in assimilate_rectangle()
142 int left = (x1 > new_x) ? x1 - new_x : 0; in assimilate_rectangle()
143 int right = (new_x + new_width > x2) ? new_x + new_width - x2 : 0; in assimilate_rectangle()
152 if (assimilate_rectangle (new_x, new_y, x1 - new_x, top, shape)) in assimilate_rectangle()
166 if (assimilate_rectangle (new_x, y2, x1 - new_x, bottom, shape)) in assimilate_rectangle()
192 new_rect.x = new_x; in assimilate_rectangle()
220 new_x, new_y); in subtract_rectangle()
[all …]
|
| /dports/audio/praat/praat-6.2.03/external/gsl/ |
| H A D | gsl_siman__siman.c | 63 void *x, *new_x, *best_x; in gsl_siman_solve() local
80 new_x = copy_constructor(x0_p); in gsl_siman_solve()
85 new_x = (void *) malloc (element_size); in gsl_siman_solve()
109 take_step (r, new_x, params.step_size); in gsl_siman_solve()
110 new_E = Ef (new_x); in gsl_siman_solve()
114 copyfunc(new_x,best_x); in gsl_siman_solve()
132 copy_state(new_x, x, element_size, copyfunc); in gsl_siman_solve()
172 destructor(new_x); in gsl_siman_solve()
176 free (new_x); in gsl_siman_solve()
192 void *x, *new_x; in gsl_siman_solve_many() local
[all …]
|
| /dports/math/gsl/gsl-2.7/siman/ |
| H A D | siman.c | 63 void *x, *new_x, *best_x; in gsl_siman_solve() local
80 new_x = copy_constructor(x0_p); in gsl_siman_solve()
85 new_x = (void *) malloc (element_size); in gsl_siman_solve()
109 take_step (r, new_x, params.step_size); in gsl_siman_solve()
110 new_E = Ef (new_x); in gsl_siman_solve()
114 copyfunc(new_x,best_x); in gsl_siman_solve()
132 copy_state(new_x, x, element_size, copyfunc); in gsl_siman_solve()
172 destructor(new_x); in gsl_siman_solve()
176 free (new_x); in gsl_siman_solve()
192 void *x, *new_x; in gsl_siman_solve_many() local
[all …]
|
| /dports/misc/dartsim/dart-6.11.1/dart/constraint/ |
| H A D | PgsBoxedLcpSolver.cpp | 123 double new_x = b[i]; in solve() local
131 new_x /= A[nskip * i + i]; in solve()
138 if (new_x > hi_tmp) in solve()
140 else if (new_x < lo_tmp) in solve()
143 x[i] = new_x; in solve()
147 if (new_x > hi[i]) in solve()
149 else if (new_x < lo[i]) in solve()
152 x[i] = new_x; in solve()
214 if (new_x > hi_tmp) in solve()
219 x[index] = new_x; in solve()
[all …]
|
| /dports/graphics/pear-Image_Transform/Image_Transform-0.9.5/Image/ |
| H A D | Transform.php | 112 var $new_x = ''; variable in Image_Transform
302 $new_x = (0 == $new_x)
323 function scaleByX($new_x) argument
325 if ($new_x <= 0) {
416 $new_x = round($size * $this->img_x, 0);
438 $new_x = $size;
645 $this->img_x = $this->new_x = $data[0];
793 $this->new_x = $size;
861 if (isset($this->new_x)) {
862 return (int)$this->new_x;
[all …]
|
| /dports/devel/py-xarray/xarray-0.20.1/xarray/core/ |
| H A D | missing.py | 559 minval = np.nanmin(new_x.values)
570 def _floatize_x(x, new_x): argument
576 new_x = list(new_x)
586 new_x[i] = new_x[i]._to_numeric(offset=xmin, dtype=np.float64)
587 return x, new_x
726 else new_x[0].shape[i]
766 x, new_x = x[0], new_x[0]
768 if new_x.ndim > 1:
770 if new_x.ndim == 0:
776 x, new_x = _floatize_x(x, new_x)
[all …]
|
| /dports/games/prboom-plus/prboom-plus-2.5.1.3/src/TEXTSCREEN/ |
| H A D | txt_table.c | 282 int new_x, new_y; in TXT_TableKeyPress() local
290 if (new_x >= 0) in TXT_TableKeyPress()
304 int new_x, new_y; in TXT_TableKeyPress() local
312 if (new_x >= 0) in TXT_TableKeyPress()
326 int new_x; in TXT_TableKeyPress() local
330 for (new_x = table->selected_x - 1; new_x >= 0; --new_x) in TXT_TableKeyPress()
345 int new_x; in TXT_TableKeyPress() local
349 for (new_x = table->selected_x + 1; new_x < table->columns; ++new_x) in TXT_TableKeyPress()
370 int new_x, new_y; in CheckValidSelection() local
378 if (new_x >= 0) in CheckValidSelection()
[all …]
|
| /dports/math/gravity/Gravity-da941e9/include/gravity/ |
| H A D | IpoptProgram.h | 130 return eval_f_(n, x, new_x, obj_value); in eval_f()
138 _model->fill_in_obj(x, obj_value,new_x); in eval_f_()
143 return eval_grad_f_(n, x, new_x, grad_f); in eval_grad_f()
151 _model->fill_in_grad_obj(x, grad_f, new_x); in eval_grad_f_()
156 return eval_g_(n, x, new_x, m, g); in eval_g()
164 _model->fill_in_cstr(x, g, new_x); in eval_g_()
168 bool eval_jac_g(Index n, const Number* x, bool new_x, in eval_jac_g() argument
179 bool eval_jac_g_(Index n, const Number* x, bool new_x, in eval_jac_g_() argument
189 _model->fill_in_jac(x, values, new_x); in eval_jac_g_()
195 bool eval_h(Index n, const Number* x, bool new_x, in eval_h() argument
[all …]
|
| /dports/x11/xscreensaver/xscreensaver-5.44/hacks/ |
| H A D | blaster.c | 38 int new_x, new_y; member
49 int old_x,new_x; member
145 st->robots[index].new_x=0; in make_new_robot()
237 st->robots[x].new_x = st->robots[x].new_x + dx; in move_robots()
279 st->robots[x].new_x = st->robots[x].new_x + dx; in move_robots()
288 st->robots[x].new_x = 0; in move_robots()
854 st->mother->new_x=0; in blaster_draw()
868 st->mother->new_x=3; in blaster_draw()
871 st->mother->new_x=st->mother->new_x-3; in blaster_draw()
877 st->mother->new_x = st->mother->new_x-3; in blaster_draw()
[all …]
|
| /dports/graphics/pfstools/pfstools-2.1.0/src/filter/ |
| H A D | pfssize.cpp | 269 int new_x, new_y; in resizeFrames() local
273 new_x = (int)(frame->getWidth()*ratio); in resizeFrames()
277 new_x = frame->getWidth(); in resizeFrames()
280 if( minX != -1 && new_x < minX ) { in resizeFrames()
281 new_x = minX; in resizeFrames()
282 new_y = (int)((float)new_x/mm_ratio); in resizeFrames()
288 if( maxX != -1 && new_x > maxX ) { in resizeFrames()
289 new_x = maxX; in resizeFrames()
297 new_x = xSize; in resizeFrames()
299 if( new_x == -1 ) in resizeFrames()
[all …]
|
| /dports/net/nload/nload-0.7.4/src/ |
| H A D | window.cpp | 197 void Window::setX(int new_x) in setX() argument
202 wmove(m_window, getY(), new_x); in setX()
215 void Window::setXY(int new_x, int new_y) in setXY() argument
220 wmove(m_window, new_y, new_x); in setXY()
228 if(new_x <= -1) in print()
229 new_x = getX(); in print()
233 mvwaddstr(m_window, new_y, new_x, text.c_str()); in print()
237 void Window::print(char text, int new_x, int new_y) in print() argument
241 if(new_x <= -1) in print()
242 new_x = getX(); in print()
[all …]
|
| /dports/science/fasthenry/fasthenry-3.0wr/src/fasthenry/ |
| H A D | regurgitate.c | 48 void translate(x,y,z,new_x, new_y, new_z) in translate() argument
49 double x,y,z,*new_x, *new_y, *new_z; in translate()
51 *new_x = x + delta_x;
58 double x,y,z,*new_x, *new_y, *new_z; in reflect_x()
60 *new_x = x;
68 double x,y,z,*new_x, *new_y, *new_z; in reflect_y()
70 *new_x = -x;
78 double x,y,z,*new_x, *new_y, *new_z; in reflect_origin()
80 *new_x = -x;
86 double x,y,z,*new_x, *new_y, *new_z; in do_nothing()
[all …]
|
| /dports/science/simbody/simbody-Simbody-3.7/SimTKmath/Optimizers/src/IpOpt/ |
| H A D | IpStdInterfaceTNLP.cpp | 185 bool StdInterfaceTNLP::eval_f(Index n, const Number* x, bool new_x, in eval_f() argument
190 apply_new_x(new_x, n, x); in eval_f()
192 Bool retval = (*eval_f_)(n, non_const_x_, (Bool)new_x, in eval_f()
202 apply_new_x(new_x, n, x); in eval_grad_f()
209 bool StdInterfaceTNLP::eval_g(Index n, const Number* x, bool new_x, in eval_g() argument
215 apply_new_x(new_x, n, x); in eval_g()
232 apply_new_x(new_x, n, x); in eval_jac_g()
242 bool StdInterfaceTNLP::eval_h(Index n, const Number* x, bool new_x, in eval_h() argument
255 apply_new_x(new_x, n, x); in eval_h()
263 retval = (*eval_h_)(n, non_const_x_, (Bool)new_x, obj_factor, m, in eval_h()
[all …]
|
| /dports/games/odamex/odamex-src-0.7.0/libraries/textscreen/ |
| H A D | txt_table.c | 333 int new_x, new_y; in TXT_TableKeyPress() local
341 if (new_x >= 0) in TXT_TableKeyPress()
354 int new_x, new_y; in TXT_TableKeyPress() local
362 if (new_x >= 0) in TXT_TableKeyPress()
375 int new_x; in TXT_TableKeyPress() local
379 for (new_x = table->selected_x - 1; new_x >= 0; --new_x) in TXT_TableKeyPress()
394 int new_x; in TXT_TableKeyPress() local
398 for (new_x = table->selected_x + 1; new_x < table->columns; ++new_x) in TXT_TableKeyPress()
419 int new_x, new_y; in CheckValidSelection() local
427 if (new_x >= 0) in CheckValidSelection()
[all …]
|
| /dports/games/ecwolf/ecwolf-1.3.3-src/textscreen/ |
| H A D | txt_table.c | 333 int new_x, new_y; in TXT_TableKeyPress() local
341 if (new_x >= 0) in TXT_TableKeyPress()
354 int new_x, new_y; in TXT_TableKeyPress() local
362 if (new_x >= 0) in TXT_TableKeyPress()
375 int new_x; in TXT_TableKeyPress() local
379 for (new_x = table->selected_x - 1; new_x >= 0; --new_x) in TXT_TableKeyPress()
394 int new_x; in TXT_TableKeyPress() local
398 for (new_x = table->selected_x + 1; new_x < table->columns; ++new_x) in TXT_TableKeyPress()
419 int new_x, new_y; in CheckValidSelection() local
427 if (new_x >= 0) in CheckValidSelection()
[all …]
|
| /dports/math/py-yt/yt-4.0.1/yt/visualization/volume_rendering/ |
| H A D | create_spline.py | 6 def create_spline(old_x, old_y, new_x, tension=0.5, sorted=False):
25 N = len(new_x)
32 new_x = np.minimum(new_x, old_x[-1])
33 new_x = np.maximum(new_x, old_x[0])
34 ind = np.searchsorted(old_x, new_x)
40 u = (new_x[i] - old_x[im1[i]]) / (old_x[ind[i]] - old_x[im1[i]])
|