/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/TmpFactorDir/ |
H A D | BM.c | 139 self->npoints = npoints; in BM_ctor() 221 int npoints = self->npoints; in lin_indep() local 314 int npoints = self->npoints; in append_new_pps() local 353 int npoints = self->npoints; in BM_mod_p1() local 405 int npoints = self->npoints; in BM_mod_p2() local 457 int npoints = self->npoints; in fill_projective_sep() local 512 int npoints = self->npoints; in BM_mod_projective_finished() local 582 int npoints = self->npoints; in BM_mod_projective() local 651 int npoints = self->npoints; in BM_mod_p() local 768 self->npoints = npoints; in BMGB_ctor() [all …]
|
/dports/math/giacxcas/CoCoALib-0.99700/src/AlgebraicCore/TmpFactorDir/ |
H A D | BM.c | 139 self->npoints = npoints; in BM_ctor() 221 int npoints = self->npoints; in lin_indep() local 314 int npoints = self->npoints; in append_new_pps() local 353 int npoints = self->npoints; in BM_mod_p1() local 405 int npoints = self->npoints; in BM_mod_p2() local 457 int npoints = self->npoints; in fill_projective_sep() local 512 int npoints = self->npoints; in BM_mod_projective_finished() local 582 int npoints = self->npoints; in BM_mod_projective() local 651 int npoints = self->npoints; in BM_mod_p() local 768 self->npoints = npoints; in BMGB_ctor() [all …]
|
/dports/science/eccodes/eccodes-2.23.0-Source/examples/C/ |
H A D | grib_nearest_multiple.c | 34 int npoints = 0, i = 0, n = 0; in main() local 58 npoints = 0; in main() 60 npoints++; in main() 62 if (npoints==0) { in main() 67 id = (long*)calloc(npoints, sizeof(long)); in main() 72 vlat = (double*)calloc(npoints, sizeof(double)); in main() 77 vlon = (double*)calloc(npoints, sizeof(double)); in main() 82 outlats = (double*)calloc(npoints, sizeof(double)); in main() 92 values = (double*)calloc(npoints, sizeof(double)); in main() 107 indexes = (int*)calloc(npoints, sizeof(int)); in main() [all …]
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/ |
H A D | pao_ml_gaussprocess.F | 48 ALLOCATE (training_matrix%GP(npoints, npoints)) 49 DO i = 1, npoints 50 DO j = i, npoints 59 DO i = 1, npoints 64 CALL dpotrf("U", npoints, training_matrix%GP, npoints, info) 94 DO i = 1, npoints 101 CALL DPOTRS("U", npoints, 1, training_matrix%GP, npoints, weights, npoints, info) 106 DO i = 1, npoints 144 DO i = 1, npoints 151 CALL DPOTRS("U", npoints, 1, training_matrix%GP, npoints, cov_deriv, npoints, info) [all …]
|
/dports/science/cp2k-data/cp2k-7.1.0/src/ |
H A D | pao_ml_gaussprocess.F | 48 ALLOCATE (training_matrix%GP(npoints, npoints)) 49 DO i = 1, npoints 50 DO j = i, npoints 59 DO i = 1, npoints 64 CALL dpotrf("U", npoints, training_matrix%GP, npoints, info) 94 DO i = 1, npoints 101 CALL DPOTRS("U", npoints, 1, training_matrix%GP, npoints, weights, npoints, info) 106 DO i = 1, npoints 144 DO i = 1, npoints 151 CALL DPOTRS("U", npoints, 1, training_matrix%GP, npoints, cov_deriv, npoints, info) [all …]
|
/dports/science/grib_api/grib_api-1.28.0-Source/tools/ |
H A D | grib_nearest_land.c | 33 int npoints=0,i=0,n=0; in main() local 43 npoints=0; in main() 47 vlat=(double*)malloc(npoints*sizeof(double)); in main() 49 vlon=(double*)malloc(npoints*sizeof(double)); in main() 51 outlats=(double*)malloc(npoints*sizeof(double)); in main() 53 outlons=(double*)malloc(npoints*sizeof(double)); in main() 55 values=(double*)malloc(npoints*sizeof(double)); in main() 59 distances=(double*)malloc(npoints*sizeof(double)); in main() 61 indexes=(size_t*)malloc(npoints*sizeof(double)); in main() 77 grib_nearest_find_multiple(h,1,vlat,vlon,npoints, in main() [all …]
|
/dports/science/eccodes/eccodes-2.23.0-Source/tools/ |
H A D | grib_nearest_land.c | 35 int npoints = 0, i = 0, n = 0; in main() local 49 npoints = 0; in main() 51 npoints++; in main() 54 vlat = (double*)malloc(npoints * sizeof(double)); in main() 59 vlon = (double*)malloc(npoints * sizeof(double)); in main() 64 outlats = (double*)malloc(npoints * sizeof(double)); in main() 69 outlons = (double*)malloc(npoints * sizeof(double)); in main() 74 values = (double*)malloc(npoints * sizeof(double)); in main() 89 indexes = (size_t*)malloc(npoints * sizeof(double)); in main() 121 grib_nearest_find_multiple(h, 1, vlat, vlon, npoints, in main() [all …]
|
/dports/science/grib_api/grib_api-1.28.0-Source/examples/C/ |
H A D | points.c | 34 int npoints=0,i=0,n=0; in main() local 51 npoints=0; in main() 55 id=(long*)malloc(npoints*sizeof(long)); in main() 57 vlat=(double*)malloc(npoints*sizeof(double)); in main() 59 vlon=(double*)malloc(npoints*sizeof(double)); in main() 61 outlats=(double*)malloc(npoints*sizeof(double)); in main() 63 outlons=(double*)malloc(npoints*sizeof(double)); in main() 65 values=(double*)malloc(npoints*sizeof(double)); in main() 71 indexes=(int*)malloc(npoints*sizeof(int)); in main() 92 grib_nearest_find_multiple(h,1,vlat,vlon,npoints, in main() [all …]
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.desktop/share/classes/java/awt/ |
H A D | Polygon.java | 71 public int npoints; field in Polygon 150 if (npoints > xpoints.length || npoints > ypoints.length) { in Polygon() 156 if (npoints < 0) { in Polygon() 161 this.npoints = npoints; in Polygon() 184 npoints = 0; in reset() 286 if (npoints >= xpoints.length || npoints >= ypoints.length) { in addPoint() 299 xpoints[npoints] = x; in addPoint() 300 ypoints[npoints] = y; in addPoint() 301 npoints++; in addPoint() 329 if (npoints == 0) { in getBoundingBox() [all …]
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.desktop/share/classes/java/awt/ |
H A D | Polygon.java | 71 public int npoints; field in Polygon 150 if (npoints > xpoints.length || npoints > ypoints.length) { in Polygon() 156 if (npoints < 0) { in Polygon() 161 this.npoints = npoints; in Polygon() 184 npoints = 0; in reset() 286 if (npoints >= xpoints.length || npoints >= ypoints.length) { in addPoint() 299 xpoints[npoints] = x; in addPoint() 300 ypoints[npoints] = y; in addPoint() 301 npoints++; in addPoint() 329 if (npoints == 0) { in getBoundingBox() [all …]
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/awt/ |
H A D | Polygon.java | 71 public int npoints; field in Polygon 150 if (npoints > xpoints.length || npoints > ypoints.length) { in Polygon() 156 if (npoints < 0) { in Polygon() 161 this.npoints = npoints; in Polygon() 184 npoints = 0; in reset() 286 if (npoints >= xpoints.length || npoints >= ypoints.length) { in addPoint() 299 xpoints[npoints] = x; in addPoint() 300 ypoints[npoints] = y; in addPoint() 301 npoints++; in addPoint() 329 if (npoints == 0) { in getBoundingBox() [all …]
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.desktop/share/classes/java/awt/ |
H A D | Polygon.java | 71 public int npoints; field in Polygon 150 if (npoints > xpoints.length || npoints > ypoints.length) { in Polygon() 156 if (npoints < 0) { in Polygon() 161 this.npoints = npoints; in Polygon() 184 npoints = 0; in reset() 286 if (npoints >= xpoints.length || npoints >= ypoints.length) { in addPoint() 299 xpoints[npoints] = x; in addPoint() 300 ypoints[npoints] = y; in addPoint() 301 npoints++; in addPoint() 329 if (npoints == 0) { in getBoundingBox() [all …]
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.desktop/share/classes/java/awt/ |
H A D | Polygon.java | 71 public int npoints; field in Polygon 150 if (npoints > xpoints.length || npoints > ypoints.length) { in Polygon() 156 if (npoints < 0) { in Polygon() 161 this.npoints = npoints; in Polygon() 184 npoints = 0; in reset() 286 if (npoints >= xpoints.length || npoints >= ypoints.length) { in addPoint() 299 xpoints[npoints] = x; in addPoint() 300 ypoints[npoints] = y; in addPoint() 301 npoints++; in addPoint() 329 if (npoints == 0) { in getBoundingBox() [all …]
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.desktop/share/classes/java/awt/ |
H A D | Polygon.java | 74 public int npoints; field in Polygon 154 if (npoints > xpoints.length || npoints > ypoints.length) { in Polygon() 160 if (npoints < 0) { in Polygon() 165 this.npoints = npoints; in Polygon() 188 npoints = 0; in reset() 290 if (npoints >= xpoints.length || npoints >= ypoints.length) { in addPoint() 303 xpoints[npoints] = x; in addPoint() 304 ypoints[npoints] = y; in addPoint() 305 npoints++; in addPoint() 333 if (npoints == 0) { in getBoundingBox() [all …]
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.desktop/share/classes/java/awt/ |
H A D | Polygon.java | 71 public int npoints; field in Polygon 150 if (npoints > xpoints.length || npoints > ypoints.length) { in Polygon() 156 if (npoints < 0) { in Polygon() 161 this.npoints = npoints; in Polygon() 184 npoints = 0; in reset() 286 if (npoints >= xpoints.length || npoints >= ypoints.length) { in addPoint() 299 xpoints[npoints] = x; in addPoint() 300 ypoints[npoints] = y; in addPoint() 301 npoints++; in addPoint() 329 if (npoints == 0) { in getBoundingBox() [all …]
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.desktop/share/classes/java/awt/ |
H A D | Polygon.java | 71 public int npoints; field in Polygon 150 if (npoints > xpoints.length || npoints > ypoints.length) { in Polygon() 156 if (npoints < 0) { in Polygon() 161 this.npoints = npoints; in Polygon() 184 npoints = 0; in reset() 286 if (npoints >= xpoints.length || npoints >= ypoints.length) { in addPoint() 299 xpoints[npoints] = x; in addPoint() 300 ypoints[npoints] = y; in addPoint() 301 npoints++; in addPoint() 329 if (npoints == 0) { in getBoundingBox() [all …]
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.desktop/share/classes/java/awt/ |
H A D | Polygon.java | 71 public int npoints; field in Polygon 150 if (npoints > xpoints.length || npoints > ypoints.length) { in Polygon() 156 if (npoints < 0) { in Polygon() 161 this.npoints = npoints; in Polygon() 184 npoints = 0; in reset() 286 if (npoints >= xpoints.length || npoints >= ypoints.length) { in addPoint() 299 xpoints[npoints] = x; in addPoint() 300 ypoints[npoints] = y; in addPoint() 301 npoints++; in addPoint() 329 if (npoints == 0) { in getBoundingBox() [all …]
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/awt/ |
H A D | Polygon.java | 71 public int npoints; field in Polygon 150 if (npoints > xpoints.length || npoints > ypoints.length) { in Polygon() 156 if (npoints < 0) { in Polygon() 161 this.npoints = npoints; in Polygon() 184 npoints = 0; in reset() 286 if (npoints >= xpoints.length || npoints >= ypoints.length) { in addPoint() 299 xpoints[npoints] = x; in addPoint() 300 ypoints[npoints] = y; in addPoint() 301 npoints++; in addPoint() 329 if (npoints == 0) { in getBoundingBox() [all …]
|
/dports/science/octopus/octopus-10.5/src/grid/ |
H A D | hypercube.F90 | 53 integer, allocatable :: npoints(:) local 59 SAFE_ALLOCATE(npoints(1:ndim)) 85 SAFE_DEALLOCATE_A(npoints) 157 npoints = npoints - 2*enlarge 159 icoord = icoord*npoints(ii) 169 npoints(jj) = npoints(jj) - 2*enlarge 172 npoints(boxnumb-1) = 2*enlarge 174 icoord = icoord*npoints(jj) 224 npoints = npoints - 2*enlarge 234 npoints(ii) = npoints(ii) - 2*enlarge [all …]
|
/dports/science/PETSc/petsc-3.14.1/src/dm/dt/tests/ |
H A D | ex1.c | 15 ierr = PetscMalloc3(npoints*ndegrees,&B,npoints*ndegrees,&D,npoints*ndegrees,&D2);CHKERRQ(ierr); in CheckPoints() 18 for (i=0; i<npoints; i++) { in CheckPoints() 41 for (i = 1; i < npoints; i++) { in CheckQuadrature_Basics() 44 for (i = 0; i < npoints; i++) { in CheckQuadrature_Basics() 59 ierr = PetscMalloc2(npoints, &Pi, npoints, &Pj);CHKERRQ(ierr); in CheckQuadrature() 106 ierr = PetscMalloc2(npoints, &x, npoints, &w);CHKERRQ(ierr); in CheckJacobiQuadrature() 119 ierr = PetscMalloc2(npoints, &x2, npoints, &w2);CHKERRQ(ierr); in CheckJacobiQuadrature() 123 for (i = 0; i < npoints; i++) { in CheckJacobiQuadrature() 161 npoints = 1000; in main() 167 if (!flg) npoints = 3; in main() [all …]
|
/dports/math/e-antic/flint2-ae7ec89/fmpz_mod_poly/test/ |
H A D | t-evaluate_fmpz_vec_fast.c | 37 slong j, n, npoints; in main() local 47 npoints = n_randint(state, 10); in main() 51 x = _fmpz_vec_init(npoints); in main() 52 y = _fmpz_vec_init(npoints); in main() 53 z = _fmpz_vec_init(npoints); in main() 57 for (j = 0; j < npoints; j++) in main() 72 for (j = 0; j < npoints; j++) in main() 75 for (j = 0; j < npoints; j++) in main() 83 _fmpz_vec_clear(x, npoints); in main() 84 _fmpz_vec_clear(y, npoints); in main() [all …]
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_mod_poly/test/ |
H A D | t-evaluate_fmpz_vec_fast.c | 37 slong j, n, npoints; in main() local 47 npoints = n_randint(state, 10); in main() 51 x = _fmpz_vec_init(npoints); in main() 52 y = _fmpz_vec_init(npoints); in main() 53 z = _fmpz_vec_init(npoints); in main() 57 for (j = 0; j < npoints; j++) in main() 72 for (j = 0; j < npoints; j++) in main() 75 for (j = 0; j < npoints; j++) in main() 83 _fmpz_vec_clear(x, npoints); in main() 84 _fmpz_vec_clear(y, npoints); in main() [all …]
|
/dports/math/topaz/topaz-3.41/topaz/ |
H A D | bspline.cc | 118 if (npoints < 8) in BSplineAppr() 147 if (npoints>=6) in BSplineAppr() 197 if (npoints>=6) in BSplineAppr() 199 dx[1]=(*INX)[npoints-5]; in BSplineAppr() 200 dx[2]=(*INX)[npoints-4]; in BSplineAppr() 201 dx[3]=(*INX)[npoints-3]; in BSplineAppr() 202 dx[4]=(*INX)[npoints-2]; in BSplineAppr() 203 dy[1]=(*INY)[npoints-5]; in BSplineAppr() 204 dy[2]=(*INY)[npoints-4]; in BSplineAppr() 205 dy[3]=(*INY)[npoints-3]; in BSplineAppr() [all …]
|
/dports/science/octopus/octopus-10.5/src/ions/ |
H A D | kpoints.F90 | 117 this%npoints = 0 132 this%npoints = npoints 169 aa%weight(1:bb%npoints) = bb%weight(1:bb%npoints) 216 …this%red_point(1:old_grid%dim, old_grid%npoints+1:this%npoints)= that%red_point(1:that%dim, 1:that… 217 …this%point(1:old_grid%dim, old_grid%npoints+1:this%npoints) = that%point(1:that%dim, 1:that%npo… 218 …this%point1BZ(1:old_grid%dim, old_grid%npoints+1:this%npoints) = that%point1BZ(1:that%dim, 1:that%… 219 this%weight(old_grid%npoints+1:this%npoints) = that%weight(1:that%npoints) 746 npoints = this%reduced%npoints 750 num_symm_ops(1:npoints) = this%num_symmetry_ops(1:npoints) 768 this%num_symmetry_ops(npoints+1:this%reduced%npoints) = 1 [all …]
|
/dports/databases/postgis31/postgis-3.1.4/liblwgeom/ |
H A D | ptarray.c | 54 pa->npoints = npoints; in ptarray_construct() 191 npoints = pa2->npoints; in ptarray_append_ptarray() 219 --npoints; in ptarray_append_ptarray() 230 ncap = pa1->npoints + npoints; in ptarray_append_ptarray() 289 pa->npoints = npoints; in ptarray_construct_reference_data() 302 pa->npoints = npoints; in ptarray_construct_copy_data() 484 if ( pa1->npoints != pa2->npoints ) return LW_FALSE; in ptarray_same() 605 pa1->npoints + pa2->npoints); in ptarray_merge() 633 out->npoints = in->npoints; in ptarray_clone_deep() 664 out->npoints = in->npoints; in ptarray_clone() [all …]
|