Home
last modified time | relevance | path

Searched refs:xproj (Results 1 – 25 of 41) sorted by relevance

12

/dports/math/vtk6/VTK-6.2.0/Common/DataModel/
H A DvtkPlane.cxx39 double normal[3], double xproj[3]) in ProjectPoint()
49 xproj[0] = x[0] - t * normal[0]; in ProjectPoint()
50 xproj[1] = x[1] - t * normal[1]; in ProjectPoint()
51 xproj[2] = x[2] - t * normal[2]; in ProjectPoint()
54 void vtkPlane::ProjectPoint(double x[3], double xproj[3]) in ProjectPoint()
112 xproj[0] = x[0] - t * normal[0]/n2; in GeneralizedProjectPoint()
113 xproj[1] = x[1] - t * normal[1]/n2; in GeneralizedProjectPoint()
114 xproj[2] = x[2] - t * normal[2]/n2; in GeneralizedProjectPoint()
118 xproj[0] = x[0]; in GeneralizedProjectPoint()
119 xproj[1] = x[1]; in GeneralizedProjectPoint()
[all …]
H A DvtkPlane.h70 double xproj[3]);
71 void ProjectPoint(double x[3], double xproj[3]);
85 double normal[3], double xproj[3]);
86 void GeneralizedProjectPoint(double x[3], double xproj[3]);
/dports/math/vtk8/VTK-8.2.0/Common/DataModel/
H A DvtkPlane.cxx49 const double normal[3], double xproj[3]) in ProjectPoint()
59 xproj[0] = x[0] - t * normal[0]; in ProjectPoint()
60 xproj[1] = x[1] - t * normal[1]; in ProjectPoint()
61 xproj[2] = x[2] - t * normal[2]; in ProjectPoint()
65 void vtkPlane::ProjectPoint(const double x[3], double xproj[3]) in ProjectPoint()
127 xproj[0] = x[0] - t * normal[0]/n2; in GeneralizedProjectPoint()
128 xproj[1] = x[1] - t * normal[1]/n2; in GeneralizedProjectPoint()
129 xproj[2] = x[2] - t * normal[2]/n2; in GeneralizedProjectPoint()
133 xproj[0] = x[0]; in GeneralizedProjectPoint()
134 xproj[1] = x[1]; in GeneralizedProjectPoint()
[all …]
H A DvtkPlane.h87 double xproj[3]);
88 void ProjectPoint(const double x[3], double xproj[3]);
108 const double normal[3], double xproj[3]);
109 void GeneralizedProjectPoint(const double x[3], double xproj[3]);
/dports/science/lammps/lammps-stable_29Sep2021/src/
H A Dregion_block.cpp351 double xr[3],xproj[3],p[3]; in find_closest_point() local
357 xproj[0] = xr[0] - dot*face[i][0]; in find_closest_point()
358 xproj[1] = xr[1] - dot*face[i][1]; in find_closest_point()
359 xproj[2] = xr[2] - dot*face[i][2]; in find_closest_point()
365 if (inside_face(xproj, i)) { in find_closest_point()
425 if (xproj[1] > 0 && (xproj[1] < yhi-ylo) && in inside_face()
426 xproj[2] > 0 && (xproj[2] < zhi-zlo)) return 1; in inside_face()
428 if (xproj[0] > 0 && (xproj[0] < (xhi-xlo)) && in inside_face()
429 xproj[2] > 0 && (xproj[2] < (zhi-zlo))) return 1; in inside_face()
431 if (xproj[0] > 0 && xproj[0] < (xhi-xlo) && in inside_face()
[all …]
H A Dregion_prism.cpp372 double xproj[3],xline[3],nearest[3]; in find_nearest() local
394 xproj[0] = x[0] - dot*face[iface][0]; in find_nearest()
395 xproj[1] = x[1] - dot*face[iface][1]; in find_nearest()
396 xproj[2] = x[2] - dot*face[iface][2]; in find_nearest()
397 if (inside_tri(xproj,corners[i],corners[j],corners[k],face[iface])) { in find_nearest()
398 distsq = closest(x,xproj,nearest,distsq); in find_nearest()
401 point_on_line_segment(corners[i],corners[j],xproj,xline); in find_nearest()
403 point_on_line_segment(corners[j],corners[k],xproj,xline); in find_nearest()
405 point_on_line_segment(corners[i],corners[k],xproj,xline); in find_nearest()
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/
H A DvtkPlane.cxx60 xproj[0] = x[0] - t * normal[0]; in ProjectPoint()
61 xproj[1] = x[1] - t * normal[1]; in ProjectPoint()
62 xproj[2] = x[2] - t * normal[2]; in ProjectPoint()
66 void vtkPlane::ProjectPoint(const double x[3], double xproj[3]) in ProjectPoint()
68 this->ProjectPoint(x, this->GetOrigin(), this->GetNormal(), xproj); in ProjectPoint()
126 xproj[0] = x[0] - t * normal[0] / n2; in GeneralizedProjectPoint()
127 xproj[1] = x[1] - t * normal[1] / n2; in GeneralizedProjectPoint()
128 xproj[2] = x[2] - t * normal[2] / n2; in GeneralizedProjectPoint()
132 xproj[0] = x[0]; in GeneralizedProjectPoint()
133 xproj[1] = x[1]; in GeneralizedProjectPoint()
[all …]
H A DvtkPlane.h89 const double x[3], const double origin[3], const double normal[3], double xproj[3]);
90 void ProjectPoint(const double x[3], double xproj[3]);
110 const double x[3], const double origin[3], const double normal[3], double xproj[3]);
111 void GeneralizedProjectPoint(const double x[3], double xproj[3]);
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Numerics/FEM/src/
H A DitkFEMElement3DC0LinearTriangular.cxx335 … const VectorType & normal, VectorType & xproj) const in GeneralizedProjectPoint()
348 xproj[0] = x[0] - t * normal[0] / n2; in GeneralizedProjectPoint()
349 xproj[1] = x[1] - t * normal[1] / n2; in GeneralizedProjectPoint()
350 xproj[2] = x[2] - t * normal[2] / n2; in GeneralizedProjectPoint()
354 xproj[0] = x[0]; in GeneralizedProjectPoint()
355 xproj[1] = x[1]; in GeneralizedProjectPoint()
356 xproj[2] = x[2]; in GeneralizedProjectPoint()
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/src/
H A Dregion_prism.cpp382 double xproj[3],xline[3],nearest[3]={}; in find_nearest() local
403 xproj[0] = x[0] - dot*face[iface][0]; in find_nearest()
404 xproj[1] = x[1] - dot*face[iface][1]; in find_nearest()
405 xproj[2] = x[2] - dot*face[iface][2]; in find_nearest()
406 if (inside_tri(xproj,corners[i],corners[j],corners[k],face[iface])) in find_nearest()
407 distsq = closest(x,xproj,nearest,distsq); in find_nearest()
409 point_on_line_segment(corners[i],corners[j],xproj,xline); in find_nearest()
411 point_on_line_segment(corners[j],corners[k],xproj,xline); in find_nearest()
413 point_on_line_segment(corners[i],corners[k],xproj,xline); in find_nearest()
/dports/devel/newtonsoft-json/Newtonsoft.Json-9.0.1/Src/
H A DNewtonsoft.Json.Dotnet.sln12 …3B}") = "Newtonsoft.Json.Dotnet", "Newtonsoft.Json\Newtonsoft.Json.Dotnet.xproj", "{779E052E-7218-…
14 …t.Json.Tests.Dotnet", "Newtonsoft.Json.Tests\Newtonsoft.Json.Tests.Dotnet.xproj", "{13E906AE-5A47-…
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/mesquite/
H A Dwedge_test.cpp189 Vector3D xproj( vertices[i] ); in main() local
190 xproj[0] = 0; in main()
191 CPPUNIT_ASSERT_DOUBLES_EQUAL( 2.0, xproj.length(), 1e-6 ); in main()
/dports/misc/vxl/vxl-3.3.2/core/vgl/algo/
H A Dvgl_h_matrix_2d_optimize.h66 double xproj = p_proj.x(), yproj = p_proj.y(); in f() local
67 proj_err[k]=(xp-xproj); proj_err[k+1]=(yp-yproj); in f()
/dports/science/gromacs/gromacs-2021.4/src/gromacs/gmxana/
H A Dgmx_covar.cpp159 rvec * x, *xread, *xref, *xav, *xproj; in gmx_covar() local
415 snew(xproj, natoms); in gmx_covar()
418 copy_rvec(xref[index[i]], xproj[i]); in gmx_covar()
423 xproj = xav; in gmx_covar()
647 write_eigenvectors(eigvecfile, natoms, mat, TRUE, 1, end, WriteXref, x, bDiffMass1, xproj, bM, in gmx_covar()
/dports/science/gromacs/gromacs-2021.4/src/gromacs/essentialdynamics/
H A Dedsam.cpp125 real* xproj = nullptr; member
456 vec->xproj[i] = projectx(edi, x, vec->vec[i]); in project_to_eigvectors()
493 rad += gmx::square((vec.refproj[i] - vec.xproj[i])); in calc_radius()
722 fprintf(fp, EDcol_efmt, edi.flood.vecs.xproj[i]); in write_edo_flood()
1237 nblock_bc(cr->mpi_comm_mygroup, ev->neig, ev->xproj); in bc_ed_vecs()
1603 snew(tvec->xproj, tvec->neig); in setup_edvec()
2289 fprintf(fp, EDcol_efmt, edi.vecs.mon.xproj[i]); in write_edo()
2294 fprintf(fp, EDcol_efmt, edi.vecs.linfix.xproj[i]); in write_edo()
2299 fprintf(fp, EDcol_efmt, edi.vecs.linacc.xproj[i]); in write_edo()
2304 fprintf(fp, EDcol_efmt, edi.vecs.radfix.xproj[i]); in write_edo()
[all …]
/dports/lang/swi-pl/swipl-8.2.3/packages/xpce/src/gra/
H A Dline.c453 { int xproj = rfloat((px - a*(float)(y1-py)+a*a*(float)x1)/(1.0+a*a)); in distanceLineToPoint() local
458 { if ( xproj < x1 ) in distanceLineToPoint()
460 else if ( xproj > x2 ) in distanceLineToPoint()
465 { if ( xproj < x2 ) in distanceLineToPoint()
467 else if ( xproj > x1 ) in distanceLineToPoint()
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Numerics/FEM/include/
H A DitkFEMElement3DC0LinearTriangular.h111 VectorType & xproj) const;
/dports/graphics/opendx/dx-4.4.4/src/exec/dxmods/
H A D_maptoplane.c1939 int xproj; in MTP_cubes_reg() local
2087 xproj = (plane.normal.x != 0.0); in MTP_cubes_reg()
2511 if (t00 == 0.0 && xproj) in MTP_cubes_reg()
2513 else if (t01 == 0.0 && xproj) in MTP_cubes_reg()
2520 if (t00 == 0.0 && xproj) in MTP_cubes_reg()
2529 if (t11 == 0.0 && xproj) in MTP_cubes_reg()
2538 if (t11 == 0.0 && xproj) in MTP_cubes_reg()
2547 if (t00 == 0.0 && !xproj) in MTP_cubes_reg()
2556 if (t00 == 0.0 && !xproj) in MTP_cubes_reg()
2565 if (t01 == 0.0 && !xproj) in MTP_cubes_reg()
[all …]
/dports/math/faiss/faiss-1.7.1/faiss/
H A DVectorTransform.cpp1060 std::vector<float> xproj(d2 * n), pq_recons(d2 * n), xxr(d * n), in train() local
1083 xproj.data(), in train()
1090 pq_regular.train(n, xproj.data()); in train()
1097 xproj.data(), codes.data(), n); in train()
1099 pq_regular.compute_codes(xproj.data(), codes.data(), n); in train()
1103 float pq_err = fvec_L2sqr(pq_recons.data(), xproj.data(), n * d2) / n; in train()
/dports/science/helfem/HelFEM-21461e9/libhelfem/src/
H A DRadialBasis.cpp193 arma::vec xproj, wproj; in model_potential() local
194 chebyshev::chebyshev(n_quad, xproj, wproj); in model_potential()
245 arma::vec r(intmid * arma::ones<arma::vec>(xproj.n_elem) + intlen * xproj); in model_potential()
/dports/devel/py-celery/celery-4.4.7/t/unit/app/
H A Dtest_app.py1033 with self.Celery('xproj', set_as_current=True) as xproj:
1034 xproj.finalize()
1044 assert foo.app is xproj
1045 assert bar.app is xproj
/dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/src/build-system/project_tree_builder/
H A Dmac_prj_generator.hpp71 void Save(const string& solution_name, ncbi::objects::CPlist& xproj);
H A Dmac_prj_generator.cpp118 CRef<CPlist> xproj( new CPlist); in Generate() local
119 CDict& dict_root = xproj->SetPlistObject().SetDict(); in Generate()
121 xproj->SetAttlist().SetVersion("1.0"); in Generate()
383 Save(solution_name, *xproj); in Generate()
386 void CMacProjectGenerator::Save(const string& solution_name, CPlist& xproj) in Save() argument
406 *out << xproj; in Save()
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/build-system/project_tree_builder/
H A Dmac_prj_generator.hpp71 void Save(const string& solution_name, ncbi::objects::CPlist& xproj);
H A Dmac_prj_generator.cpp118 CRef<CPlist> xproj( new CPlist); in Generate() local
119 CDict& dict_root = xproj->SetPlistObject().SetDict(); in Generate()
121 xproj->SetAttlist().SetVersion("1.0"); in Generate()
383 Save(solution_name, *xproj); in Generate()
386 void CMacProjectGenerator::Save(const string& solution_name, CPlist& xproj) in Save() argument
406 *out << xproj; in Save()

12