Home
last modified time | relevance | path

Searched refs:ncorner (Results 1 – 25 of 40) sorted by relevance

12

/dports/science/cdo/cdo-2.0.0/src/
H A DVerifygrid.cc373 for (int k = 0; k < ncorner; k++) in set_cell_corners_xyz()
419 auto actual_number_of_corners = ncorner; in get_actual_number_of_corners()
421 for (int k = ncorner - 1; k > 0; k--) in get_actual_number_of_corners()
508 Varray<Point3D> cell_corners_xyz(ncorner + 1); in verify_grid()
529 for (int k = 0; k < ncorner; k++) in verify_grid()
532 …gcLLtoXYZdeg(grid_corner_lon[cell_no * ncorner + k], grid_corner_lat[cell_no * ncorner + k], corne… in verify_grid()
578 … grid_corner_lon[cell_no * ncorner + i], grid_corner_lat[cell_no * ncorner + i], cell_no + 1); in verify_grid()
683 for (int k = 0; k < ncorner; k++) in verify_grid()
684 …intf(stdout, " %.5g/%.5g", grid_corner_lon[cell_no * ncorner + k], grid_corner_lat[cell_no * ncorn… in verify_grid()
695 for (int i = 2; i < ncorner; i++) in verify_grid()
[all …]
H A DRemapstat.cc238 cell.array_size = ncorner; in find_points_yac()
239 cell.num_corners = ncorner; in find_points_yac()
240 cell.edge_type = new enum yac_edge_type[ncorner]; in find_points_yac()
241 cell.coordinates_x = new double[ncorner]; in find_points_yac()
242 cell.coordinates_y = new double[ncorner]; in find_points_yac()
243 cell.coordinates_xyz = new double[ncorner][3]; in find_points_yac()
247 for (size_t k = 0; k < ncorner; ++k) in find_points_yac()
249 const auto lon = xbounds[cell_no * ncorner + k]; in find_points_yac()
250 const auto lat = ybounds[cell_no * ncorner + k]; in find_points_yac()
300 Varray<Point3D> cell_corners_xyz(ncorner + 1); in find_points()
[all …]
H A Dverifygrid.h13 int get_actual_number_of_corners(int ncorner, const Varray<Point3D> &cell_corners_xyz_open_cell);
19 void set_cell_corners_xyz(int ncorner, const double *cell_corners_lon, const double *cell_corners_l…
23 void set_cell_corners_plane_projection(int coordinate_to_ignore, int ncorner, const Varray<Point3D>…
H A DOutputgmt.cc36 check_ncorner(int ncorner, const double *lon_bounds, const double *lat_bounds) in check_ncorner() argument
38 auto ncorner_new = ncorner; in check_ncorner()
41 for (k = ncorner - 1; k > 0; --k) in check_ncorner()
44 if (k < ncorner - 1) ncorner_new = k + 1; in check_ncorner()
367 const int ncorner = (gridInqType(gridID) == GRID_UNSTRUCTURED) ? gridInqNvertex(gridID) : 4; in Outputgmt() local
410 if (ncorner == 0) cdo_abort("Number of cell corners undefined!"); in Outputgmt()
411 const size_t nalloc = ncorner * gridsize; in Outputgmt()
420 …cdo_grid_to_degree(gridID, CDI_XAXIS, ncorner * gridsize, grid_corner_lon.data(), "grid corner lon… in Outputgmt()
641 const double *lon_bounds = grid_corner_lon.data() + i * ncorner; in Outputgmt()
642 const double *lat_bounds = grid_corner_lat.data() + i * ncorner; in Outputgmt()
[all …]
H A DSamplegridicon.cc308 int ncorner = 3; in compute_child_from_bounds() local
320 …set_cell_corners_xyz(ncorner, &grid_corner_lon2[cell_no2 * ncorner], &grid_corner_lat2[cell_no2 * … in compute_child_from_bounds()
321 cell_corners_xyz[ncorner] = cell_corners_xyz[0]; in compute_child_from_bounds()
330 …set_cell_corners_plane_projection(coordinate_to_ignore, ncorner, cell_corners_xyz, cell_corners_pl… in compute_child_from_bounds()
332 … const auto polygon_area = calculate_the_polygon_area(cell_corners_plane_projection, ncorner + 1); in compute_child_from_bounds()
355 …= winding_numbers_algorithm(cell_corners_plane_projection, ncorner + 1, center_point_plane_project… in compute_child_from_bounds()
/dports/science/sparta/sparta-20Oct2021/src/
H A Dwrite_isurf.cpp150 fprintf(screen," corner points = %d\n",ncorner); in command()
157 fprintf(logfile," corner points = %d\n",ncorner); in command()
178 ncorner = bncorner; in collect_values()
180 memory->create(dbuf,ncorner,"write_isurf:dbuf"); in collect_values()
181 memory->create(dbufall,ncorner,"write_isurf:dbufall"); in collect_values()
182 for (int i = 0; i < ncorner; i++) dbuf[i] = 0.0; in collect_values()
230 MPI_Allreduce(dbuf,dbufall,ncorner,MPI_DOUBLE,MPI_SUM,world); in collect_values()
248 memory->create(ibuf8,ncorner,"write_isurf:ibuf8"); in write_file()
249 for (int i = 0; i < ncorner; i++) in write_file()
251 fwrite(ibuf8,sizeof(uint8_t),ncorner,fp); in write_file()
[all …]
H A Dfix_ablate.cpp192 ncorner = size_per_grid_cols; in FixAblate()
321 for (int m = 0; m < ncorner; m++) in store_corners()
891 for (i = 0; i < ncorner; i++) { in sync()
905 jcorner = ncorner; in sync()
956 for (i = 0; i < ncorner; i++) in epsilon_adjust()
1003 for (i = 0; i < ncorner; i++) { in push_lohi()
1022 jcorner = ncorner; in push_lohi()
1159 int ncomm = 1 + ncorner; in comm_neigh_corners()
1218 for (j = 0; j < ncorner; j++) in comm_neigh_corners()
1282 ptr += ncorner*sizeof(double); in pack_grid_one()
[all …]
H A Dread_isurf.cpp331 int icell,ncorner,zeroflag; in assign_corners() local
360 ncorner = 8; in assign_corners()
364 ncorner--; in assign_corners()
370 if (precision == INT) cvalues[icell][ncorner] = ibuf[i]; in assign_corners()
371 else cvalues[icell][ncorner] = dbuf[i]; in assign_corners()
381 ncorner = 4; in assign_corners()
384 ncorner--; in assign_corners()
389 if (precision == INT) cvalues[icell][ncorner] = ibuf[i]; in assign_corners()
390 else cvalues[icell][ncorner] = dbuf[i]; in assign_corners()
H A Dgrid_adapt.cpp38 int dim,ncorner,mark,ip,ipnew; in refine_cell() local
44 ncorner = 8; in refine_cell()
45 if (dim == 2) ncorner = 4; in refine_cell()
103 for (i = 0; i < ncorner; i++) { in refine_cell()
H A Dwrite_isurf.h39 int ncorner;
H A Dfix_ablate.h60 int ncorner;
H A Dgrid.cpp221 int ncorner; in add_child_cell() local
222 if (domain->dimension == 3) ncorner = 8; in add_child_cell()
223 else ncorner = 4; in add_child_cell()
1369 int ncorner,nface,nface_pts; in set_inout() local
1371 ncorner = 8; in set_inout()
1375 ncorner = 4; in set_inout()
1654 for (icorner = 0; icorner < ncorner; icorner++) in set_inout()
1704 for (j = 0; j < ncorner; j++) in set_inout()
1811 int ncorner = 4; in type_check() local
1812 if (dimension == 3) ncorner = 8; in type_check()
[all …]
H A Dgrid_surf.cpp1109 int ncorner = 0; in surf2grid_split() local
1114 if (cinfo[icell].corner[0] == UNKNOWN) ncorner++; in surf2grid_split()
1118 bigint bncorner = ncorner; in surf2grid_split()
1539 int ncorner = 8; in clear_surf() local
1540 if (dimension == 2) ncorner = 4; in clear_surf()
1573 for (int m = 0; m < ncorner; m++) cinfo[icell].corner[m] = UNKNOWN; in clear_surf()
1637 int ncorner = 8; in clear_surf_restart() local
1638 if (dimension == 2) ncorner = 4; in clear_surf_restart()
1644 for (int m = 0; m < ncorner; m++) cinfo[icell].corner[m] = UNKNOWN; in clear_surf_restart()
/dports/science/cdo/cdo-2.0.0/libcdi/interfaces/
H A Dcdi.cpp99 ncorner *= size; in getBounds()
100 xbnds = (double *) malloc((ncorner*size)*sizeof(double)); in getBounds()
101 ybnds = (double *) malloc((ncorner*size)*sizeof(double)); in getBounds()
104 xbounds.resize(ncorner*size); in getBounds()
105 ybounds.resize(ncorner*size); in getBounds()
106 std::copy(xbnds, xbnds + ncorner*size, xbounds.begin()); in getBounds()
107 std::copy(ybnds, ybnds + ncorner*size, ybounds.begin()); in getBounds()
113 ncorner = 0; in getBounds()
115 xbounds.resize(ncorner*size); in getBounds()
116 ybounds.resize(ncorner*size); in getBounds()
[all …]
H A DCdiInfo.cpp49 std::cout << "GridBounds: NumberOfCorners = " << var.grid.ncorner << std::endl; in main()
63 float * xbnds = (float *) malloc(var.grid.size*var.grid.ncorner*sizeof(float)); in main()
64 float * ybnds = (float *) malloc(var.grid.size*var.grid.ncorner*sizeof(float)); in main()
66 std::cout << "xbnds " << xbnds[var.grid.size*var.grid.ncorner - 1] << std::endl; in main()
67 std::cout << "ybnds " << ybnds[var.grid.size*var.grid.ncorner - 1] << std::endl; in main()
H A Dcdi.hpp13 int type, size, xsize, ysize, prec, ncorner; member in CdiGrid
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/mesquite/wrapper_tests/
H A Ddeforming.cpp219 int ncorner = 1; in classify_boundary() local
239 CHKMESH( ncorner < 5, err ); in classify_boundary()
240 if (ncorner < 4) // don't add start vertx twice in classify_boundary()
241 corners_out[ncorner] = next; in classify_boundary()
242 ++ncorner; in classify_boundary()
247 CHKMESH( ncorner == 5, err ); in classify_boundary()
/dports/science/medit/medit-2012.02.05_5/sources/
H A Doutmsh.c.old24 int ncorner,prequis,nbpos,nbneg,nbnul,nedge;
151 ncorner = prequis = 0;
173 if ( ppt->tag & M_CORNER ) ncorner++;
194 if ( ppt->tag & M_CORNER ) ncorner++;
209 if ( ppt->tag & M_CORNER ) ncorner++;
229 if ( ppt->tag & M_CORNER ) ncorner++;
339 if ( ncorner ) {
341 ncorner = 0;
346 te[ncorner++] = tmp[k];
354 ecrire_int(out,ncorner);
[all …]
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/Control/
H A DInstruction.cpp80 unsigned ncorner = TopologyInfo::corners( type ); in initialize_vertex_byte() local
85 if (ncorner < verts.size() && type != POLYGON) in initialize_vertex_byte()
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/mesquite/
H A Dbenchmark_tests.cpp757 int ncorner = 1; in classify_boundary() local
777 CHKMESH( ncorner < 5, err ); in classify_boundary()
778 if (ncorner < 4) // don't add start vertx twice in classify_boundary()
779 corners_out[ncorner] = next; in classify_boundary()
780 ++ncorner; in classify_boundary()
785 CHKMESH( ncorner == 5, err ); in classify_boundary()
/dports/science/qwalk/mainline-1.0.1-300-g1b7e381/src/converter/
H A Dconverter.cpp353 int ncorner=0; in find_centers() local
385 ncorner++; in find_centers()
470 cout << "nedge " << nedge << " nside " << nside << " ncorner " << ncorner << endl; in find_centers()
/dports/devel/bullet/bullet3-3.21/examples/OpenCL/rigidbody/
H A DGpuConvexScene.cpp454 int ncorner = 0; in createFromTetGenData() local
456 sscanf(ele, "%d %d %d", &ntetra, &ncorner, &neattrb); in createFromTetGenData()
/dports/devel/py-bullet3/bullet3-3.21/examples/OpenCL/rigidbody/
H A DGpuConvexScene.cpp454 int ncorner = 0; in createFromTetGenData() local
456 sscanf(ele, "%d %d %d", &ntetra, &ncorner, &neattrb); in createFromTetGenData()
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dsepa_eccuts.c1711 unsigned int ncorner; in checkRikun() local
1719 ncorner = (unsigned int) poweroftwo[ecaggr->nvars]; in checkRikun()
1732 for( i = 1; i < ncorner; ++i ) in checkRikun()
1983 int ncorner; in SCIPcomputeConvexEnvelopeFacet() local
2007 ncorner = poweroftwo[ecaggr->nvars]; in SCIPcomputeConvexEnvelopeFacet()
2009 assert(ncorner <= ncols); in SCIPcomputeConvexEnvelopeFacet()
2026 fvals[i] = i < ncorner ? evalCorner(ecaggr, i) : 0.0; in SCIPcomputeConvexEnvelopeFacet()
2031 ub[i] = i < ncorner ? 1.0 : 0.0; in SCIPcomputeConvexEnvelopeFacet()
/dports/math/freefem++/FreeFem-sources-4.6/plugin/seq/
H A Dfreeyams.cpp186 int is1, is2, ncorner, prequis; in yams_pSurfMesh_to_meshS() local
234 ncorner = prequis = 0; in yams_pSurfMesh_to_meshS()
265 ncorner++; in yams_pSurfMesh_to_meshS()

12