Home
last modified time | relevance | path

Searched refs:n2x (Results 1 – 25 of 78) sorted by relevance

1234

/dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/arrow/java/gandiva/src/test/java/org/apache/arrow/gandiva/evaluator/
H A DMicroBenchmarkTest.java42 Field n2x = Field.nullable("n2x", int32); in testAdd3() local
48 "add", Lists.newArrayList(TreeBuilder.makeField(x), TreeBuilder.makeField(n2x)), int32); in testAdd3()
54 List<Field> cols = Lists.newArrayList(x, n2x, n3x); in testAdd3()
130 Field n2x = Field.nullable("n2x", int32); in testFilterAdd2() local
135 Lists.newArrayList(TreeBuilder.makeField(x), TreeBuilder.makeField(n2x)), int32); in testFilterAdd2()
140 List<Field> cols = Lists.newArrayList(x, n2x, n3x); in testFilterAdd2()
/dports/databases/arrow/apache-arrow-6.0.1/java/gandiva/src/test/java/org/apache/arrow/gandiva/evaluator/
H A DMicroBenchmarkTest.java42 Field n2x = Field.nullable("n2x", int32); in testAdd3() local
48 "add", Lists.newArrayList(TreeBuilder.makeField(x), TreeBuilder.makeField(n2x)), int32); in testAdd3()
54 List<Field> cols = Lists.newArrayList(x, n2x, n3x); in testAdd3()
130 Field n2x = Field.nullable("n2x", int32); in testFilterAdd2() local
135 Lists.newArrayList(TreeBuilder.makeField(x), TreeBuilder.makeField(n2x)), int32); in testFilterAdd2()
140 List<Field> cols = Lists.newArrayList(x, n2x, n3x); in testFilterAdd2()
/dports/security/vault/vault-1.8.2/vendor/github.com/apache/arrow/java/gandiva/src/test/java/org/apache/arrow/gandiva/evaluator/
H A DMicroBenchmarkTest.java42 Field n2x = Field.nullable("n2x", int32); in testAdd3() local
48 "add", Lists.newArrayList(TreeBuilder.makeField(x), TreeBuilder.makeField(n2x)), int32); in testAdd3()
54 List<Field> cols = Lists.newArrayList(x, n2x, n3x); in testAdd3()
130 Field n2x = Field.nullable("n2x", int32); in testFilterAdd2() local
135 Lists.newArrayList(TreeBuilder.makeField(x), TreeBuilder.makeField(n2x)), int32); in testFilterAdd2()
140 List<Field> cols = Lists.newArrayList(x, n2x, n3x); in testFilterAdd2()
/dports/archivers/py-rarfile/rarfile-4.0/test/
H A Dtest_util.py56 n2x = n2 + timedelta(seconds=0)
57 assert not isinstance(n2x, nsdatetime)
58 assert not hasattr(n2x, "_nanoseconds")
59 assert n2x == d2
60 assert hash(n2x) == hash(d2)
/dports/misc/bb/bb-1.3.0/
H A Dtex.c99 …e void makej(long x1, long x2, long n1z, long n2z, long ii, long n1x, long n1y, long n2x, long n2y) in makej() argument
120 n3Dx = (n2x - n1x) / e; in makej()
152 long n2x, n2y, n2z; in optfsp() local
196 n2x = rot[wh][a].n_x; in optfsp()
205 makej(bb, aa, n2z, n1z, ii, n2x, n2y, n1x, n1y); in optfsp()
207 makej(aa, bb, n1z, n2z, ii, n1x, n1y, n2x, n2y); in optfsp()
213 n2x += n2Dx; in optfsp()
222 n2x = rot[wh][b].n_x; in optfsp()
231 makej(bb, aa, n2z, n1z, ii, n2x, n2y, n1x, n1y); in optfsp()
233 makej(aa, bb, n1z, n2z, ii, n1x, n1y, n2x, n2y); in optfsp()
[all …]
/dports/science/ergo/ergo-3.8/source/integrals/
H A Dintegrals_2el_single.cc75 int n2x = psi2->monomialInts[0]; in do_2e_integral_using_symb_info_h() local
116 int monomialIndex2 = integralInfo.monomial_info.monomial_index_list[n2x][n2y][n2z]; in do_2e_integral_using_symb_info_h()
/dports/games/opencity/opencity-0.0.6.5stable/src/
H A Drenderer.cpp1178 static GLfloat n2x, n2y, n2z; // normal 2 coordinates in _DisplayTerrain() local
1228 n2x = -ay; n2y = 1.; n2z = by; in _DisplayTerrain()
1251 glNormal3f( n2x, n2y, n2z ); in _DisplayTerrain()
1262 n2x = -ay; n2y = 1.; n2z = by; in _DisplayTerrain()
1269 glNormal3f( n2x, n2y, n2z ); in _DisplayTerrain()
1295 n2x = -ay; n2y = 1.; n2z = by; in _DisplayTerrain()
1318 glNormal3f( n2x, n2y, n2z ); in _DisplayTerrain()
1329 n2x = -ay; n2y = 1.; n2z = by; in _DisplayTerrain()
1336 glNormal3f( n2x, n2y, n2z ); in _DisplayTerrain()
/dports/games/libretro-scummvm/scummvm-7b1e929/engines/fullpipe/
H A Danihandler.cpp269 int n2x = point1.x; in makeRunQueue() local
277 n2x *= mult; in makeRunQueue()
281 n2x = point.x; in makeRunQueue()
287 n2x = mult * point1.x; in makeRunQueue()
322 int dx1 = n1x - n2x; in makeRunQueue()
343 if (n1x - n2x == px * x1) in makeRunQueue()
/dports/games/scummvm/scummvm-2.5.1/engines/ngi/
H A Danihandler.cpp269 int n2x = point1.x; in makeRunQueue() local
277 n2x *= mult; in makeRunQueue()
281 n2x = point.x; in makeRunQueue()
287 n2x = mult * point1.x; in makeRunQueue()
322 int dx1 = n1x - n2x; in makeRunQueue()
343 if (n1x - n2x == px * x1) in makeRunQueue()
/dports/games/angband/Angband-4.2.2/src/
H A Dproject.c829 int n2y, n2x, tmp, rotate, diff; in project() local
833 n2x = x - start.x + 20; in project()
839 tmp = ABS(get_angle_to_grid[n2y][n2x] + rotate) % 180; in project()
/dports/net/p5-Net-Interface/Net-Interface-1.016/t/
H A Dinet_xtox.t55 ## test 26 check bad length n2x
/dports/math/cgal/CGAL-5.3/include/CGAL/Shape_detection/Efficient_RANSAC/
H A DCylinder.h135 FT n2x = this->scalar_pdct(n2, yDir); in create_shape() local
143 FT lineDist = n2x * Ox + n2y * Oy; in create_shape()
145 m_radius = lineDist / n2x; in create_shape()
/dports/games/csmash/csmash-0.6.6/
H A DPlayerView.cpp249 double n1x, n1y, n1z, n2x, n2y, n2z; in DrawTargetCircle() local
259 n2x = vx*vz/(v*hypot(vx, vy)) * v*tan(diff); in DrawTargetCircle()
264 v1x = vx+n1x*cos(rad)+n2x*sin(rad); in DrawTargetCircle()
/dports/net-mgmt/p5-NetAddr-IP-Lite/NetAddr-IP-Lite-1.01/Util/t/
H A Dipv6func.t60 ## test 26 check bad length n2x
/dports/net-mgmt/p5-NetAddr-IP/NetAddr-IP-4.079/Lite/Util/t/
H A Dbipv6func.t61 ## test 26 check bad length n2x
H A Dipv6func.t60 ## test 26 check bad length n2x
/dports/textproc/miller/miller-5.10.2/go/reg-test/cases/
H A Dcase-c-io-format-conversion-keystroke-savers.sh29 run_mlr --n2x cat $indir/abixy.nidx
/dports/cad/openroad/OpenROAD-2.0/src/grt/src/fastroute/src/
H A Dmaze.cpp1066 int i, j, deg, edgeID, n1, n2, n1x, n1y, n2x, n2y, ymin, ymax, xmin, xmax, in mazeRouteMSMD() local
1172 n2x = treenodes[n2].x; in mazeRouteMSMD()
1174 treeedge->len = abs(n2x - n1x) + abs(n2y - n1y); in mazeRouteMSMD()
1180 treeedge, n1x, n1y, n2x, n2y, ripup_threshold, netID, edgeID); in mazeRouteMSMD()
1192 if (n1x <= n2x) { in mazeRouteMSMD()
1194 xmax = n2x; in mazeRouteMSMD()
1196 xmin = n2x; in mazeRouteMSMD()
1649 if (n2 >= deg && (E2x != n2x || E2y != n2y)) in mazeRouteMSMD()
H A Dmaze3D.cpp884 int i, j, k, deg, n1, n2, n1x, n1y, n2x, n2y, ymin, ymax, xmin, xmax, curX, in mazeRouteMSMDOrder3D() local
951 n2x = treenodes[n2].x; in mazeRouteMSMDOrder3D()
963 if (n1x <= n2x) { in mazeRouteMSMDOrder3D()
965 xmax = n2x; in mazeRouteMSMDOrder3D()
967 xmin = n2x; in mazeRouteMSMDOrder3D()
1483 if (n2 >= deg && (E2x != n2x || E2y != n2y)) in mazeRouteMSMDOrder3D()
/dports/editors/impress/impress-1.1b9/font3d/
H A Dfont3d.cc278 double n1x,n1y,n1z,n2x,n2y,n2z,n3x,n3y,n3z; in OutputTriangles() local
295 n2x=t->n2.x; n2y=t->n2.y; if (csystem==RIGHT_HANDED) n2z=t->n2.z; else n2z=-t->n2.z; in OutputTriangles()
316 outputFile<<'<'<<n2x<<','<<n2y<<','<<n2z<<'>'<<','; in OutputTriangles()
326 outputFile<<'<'<<n2x<<','<<n2y<<','<<n2z<<'>'<<','; in OutputTriangles()
352 outputFile<<n2x<<' '<<n2y<<' '<<n2z<<' '; in OutputTriangles()
392 <<"normal "<<n2x<<" "<<n2y<<" "<<n2z<<" " in OutputTriangles()
479 <<"normal "<<n2x<<" "<<n2y<<" "<<n2z<<" " in OutputTriangles()
/dports/math/optpp/optpp-2.4/newmat11/
H A Dtmtd.cpp49 TestUpdateQRZ(int mx, int n1x, int n2x=0, int n3x=0) in TestUpdateQRZ() argument
50 : m(mx), n1(n1x), n2(n2x), n3(n3x) { Reset(); } in TestUpdateQRZ()
/dports/net-mgmt/librenms/librenms-21.5.1/includes/definitions/discovery/
H A Dmbg-ltos6.yaml85 - { value: 51, descr: n2x, graph: 51, generic: 0 }
/dports/x11/libgnomekbd/libgnomekbd-3.26.1/libgnomekbd/
H A Dgkbd-keyboard-drawing.c163 gdouble n2x, gdouble n2y, gdouble d2, gdouble * x, gdouble * y) in intersect() argument
167 inverse (n1x, n1y, n2x, n2y, &e, &f, &g, &h); in intersect()
182 gdouble n2x, n2y, d2; in rounded_corner() local
204 normal_form (bx, by, cx, cy, &n2x, &n2y, &d2); in rounded_corner()
213 if (point_line_distance (ax, ay, n2x, n2y) < d2) in rounded_corner()
219 intersect (n1x, n1y, pd1, n2x, n2y, pd2, &ix, &iy); in rounded_corner()
233 intersect (n2x, n2y, d2, nx, ny, d, &c1x, &c1y); in rounded_corner()
/dports/x11/libmatekbd/libmatekbd-1.26.0/libmatekbd/
H A Dmatekbd-keyboard-drawing.c147 gdouble n2x, gdouble n2y, gdouble d2, gdouble * x, gdouble * y) in intersect() argument
151 inverse (n1x, n1y, n2x, n2y, &e, &f, &g, &h); in intersect()
166 gdouble n2x, n2y, d2; in rounded_corner() local
188 normal_form (bx, by, cx, cy, &n2x, &n2y, &d2); in rounded_corner()
197 if (point_line_distance (ax, ay, n2x, n2y) < d2) in rounded_corner()
203 intersect (n1x, n1y, pd1, n2x, n2y, pd2, &ix, &iy); in rounded_corner()
217 intersect (n2x, n2y, d2, nx, ny, d, &c1x, &c1y); in rounded_corner()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/sdet/
H A Dsdet_third_order_edge_det.cxx566 double n1, n2, n1x, n1y, n2x, n2y; in apply_color() local
576 n2x = (lx-Ax)/f - (l-A)*(B*Bx + (l-A)*(lx-Ax))/(f*f*f); in apply_color()
587 n2x = Bx/f - B*(B*Bx + (l-C)*(lx-Cx))/(f*f*f); in apply_color()
592 double Fx = lx*n1x + n1*lxx + n2x*ly + n2*lxy; in apply_color()

1234