Home
last modified time | relevance | path

Searched refs:nPts (Results 1 – 25 of 356) sorted by relevance

12345678910>>...15

/dports/math/pdal/PDAL-2.3.0/plugins/i3s/lepcc/src/
H A DTest_C_Api.cpp116 uint32 nPts = 0; in main() local
168 uint32 nPts = 0; in main() local
220 uint32 nPts = 0; in main() local
348 int nPts = 0; in main() local
358 ptVec.resize(nPts); in main()
376 nPts = nPts2; in main()
377 rgbVec.resize(nPts); in main()
393 nPts = nPts2; in main()
575 int nPts = 0; in main() local
611 nPts = nPts2; in main()
[all …]
/dports/math/jts/jts-jts-1.18.1/modules/core/src/test/java/test/jts/perf/operation/union/
H A DPolygonUnionPerfTest.java54 int nPts = 1000; in testRampItems() local
56 test(5, nPts, 10.0); in testRampItems()
57 test(5, nPts, 10.0); in testRampItems()
58 test(25, nPts, 10.0); in testRampItems()
59 test(50, nPts, 10.0); in testRampItems()
60 test(100, nPts, 10.0); in testRampItems()
61 test(200, nPts, 10.0); in testRampItems()
62 test(400, nPts, 10.0); in testRampItems()
63 test(500, nPts, 10.0); in testRampItems()
64 test(1000, nPts, 10.0); in testRampItems()
[all …]
/dports/science/rdkit/rdkit-Release_2021_03_5/rdkit/ML/Cluster/
H A DUnitTestButina.py15 nPts = 6
16 cs = Butina.ClusterData(dists, nPts, 1.1, isDistData=1)
52 nPts = 8
53 cs = Butina.ClusterData(dists, nPts, 2.1, isDistData=1)
66 nPts = 3
82 nPts = 4
83 cs = Butina.ClusterData(dists, nPts, 2, isDistData=1)
99 nPts = 5
118 nPts = 5
128 nPts = 6
[all …]
H A DMurtagh.py57 def _ToClusters(data, nPts, ia, ib, crit, isDistData=0): argument
64 cs = [None] * nPts
65 for i in range(nPts):
74 newClust = Clusters.Cluster(metric=crit[i], children=[c1, c2], index=nPts + i + 1)
80 def ClusterData(data, nPts, method, isDistData=0): argument
108 ia, ib, crit = MurtaghCluster(data, nPts, sz, method)
110 ia, ib, crit = MurtaghDistCluster(data, nPts, method)
111 c = _ToClusters(data, nPts, ia, ib, crit, isDistData=isDistData)
/dports/math/jts/jts-jts-1.18.1/modules/app/src/main/java/org/locationtech/jtstest/function/
H A DCreateRandomShapeFunctions.java32 shapeBuilder.setNumPoints(nPts); in randomPointsInGrid()
39 shapeBuilder.setNumPoints(nPts); in randomPointsInGridCircles()
49 shapeBuilder.setNumPoints(nPts); in randomPointsInGridWithGutter()
57 shapeBuilder.setNumPoints(nPts); in randomPoints()
64 shapeBuilder.setNumPoints(nPts); in randomPointsInPolygon()
77 for (int i = 0; i < nPts; i++) { in randomPointsInTriangle()
113 for (int i = 0; i < nPts; i++) { in randomRadialPoints()
152 while (i < nPts) { in haltonPointsWithBases()
184 for (int i = 0; i < nPts; i++) { in randomSegments()
227 for (int i = 0; i < nPts; i++) { in randomSegmentsRectilinear()
[all …]
H A DCreateShapeFunctions.java137 return supercircle(g, nPts, 3); in supercircle3()
142 return supercircle(g, nPts, 4); in squircle()
147 return supercircle(g, nPts, 5); in supercircle5()
152 return supercircle(g, nPts, 0.5); in supercirclePoint5()
158 int nPts, in supercircle()
163 gsf.setNumPoints(nPts); in supercircle()
174 gsf.setNumPoints(nPts); in ellipse()
186 gsf.setNumPoints(nPts); in ellipseRotate()
199 int nPts) in sineStar()
208 shape.setNumPoints(nPts); in sineStar()
[all …]
/dports/astro/tclgeomap/tclgeomap-2.11.6/generic/
H A DgeoLines.c116 lnPtr->nPts = 0;
189 lnPtr->nPts = lnPtr->nPtsMax;
237 lnPtr->nPts++;
297 ctr.x /= lnPtr->nPts;
298 ctr.y /= lnPtr->nPts;
299 ctr.z /= lnPtr->nPts;
530 lnArrPtr->nPts += ln->nPts;
531 lnArrPtr->nMax = (lnArrPtr->nMax > ln->nPts) ? lnArrPtr->nMax : ln->nPts;
541 lnArrPtr->lines[nLines]->nPts = ln->nPts;
581 lnArrPtr->nPts += ln->nPts;
[all …]
H A DmapLines.c80 mapLnPtr->nPts = mapLnPtr->nPtsMax = 0;
108 mapLnPtr->nPts = 0;
189 mapLnPtr->nPts = mapLnPtr->nPtsMax;
233 mapLnPtr->pts[mapLnPtr->nPts] = p;
234 mapLnPtr->nPts++;
480 mapLnArrPtr->nPts += mapLnPtr->nPts;
482 ? mapLnArrPtr->nMax : mapLnPtr->nPts;
492 mapLnPtr->nPts * sizeof(MapPt));
493 mapLnArrPtr->lines[nLines]->nPts = mapLnPtr->nPts;
537 mapLnArrPtr->nPts += mapLnPtr->nPts;
[all …]
/dports/devel/agar/agar-1.5.0/vg/
H A Dvg_polygon.c48 vp->nPts = 0; in Init()
62 for (i = 0; i < vp->nPts; i++) { in Load()
77 for (i = 0; i < vp->nPts; i++) in Save()
103 if (vp->nPts < 2) { in DrawOutline()
109 for (i = 1; i < vp->nPts; i++) { in DrawOutline()
129 vp->nInts = vp->nPts; in DrawFB()
131 if (vp->nPts > vp->nInts) { in DrawFB()
133 vp->nInts = vp->nPts; in DrawFB()
156 i1 = vp->nPts - 1; in DrawFB()
235 if (vp->nPts < 1) { in Extent()
[all …]
H A Dvg_polygon.h6 Uint nPts; member
40 vP->pts = (VG_Point **)AG_Realloc(vP->pts, (vP->nPts+1)*sizeof(VG_Point *)); in VG_PolygonVertex()
41 vP->pts[vP->nPts] = pt; in VG_PolygonVertex()
44 return (vP->nPts++); in VG_PolygonVertex()
51 if (vtx < vP->nPts) { in VG_PolygonDelVertex()
53 if (vtx < vP->nPts-1) { in VG_PolygonDelVertex()
55 (vP->nPts - vtx - 1)*sizeof(VG_Point *)); in VG_PolygonDelVertex()
57 vP->nPts--; in VG_PolygonDelVertex()
/dports/science/rdkit/rdkit-Release_2021_03_5/rdkit/ML/Data/
H A DMLData.py64 if nPts is None:
65 nPts = len(data)
66 self.nPts = nPts
121 return self.nPts
149 res = [None] * self.nPts
150 for i in range(self.nPts):
192 self.nPts += 1
242 res = [None] * self.nPts
312 if nPts is None:
313 nPts = len(data)
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/Mesh/
H A DHighOrder.cpp344 if(nPts >= 30) in getEdgeVerticesOnGeo()
964 if(nPts == 1) { in setHighOrder()
983 if(nPts == 1) { in setHighOrder()
996 if(nPts == 1) { in setHighOrder()
1042 if(nPts == 1) { in setHighOrder()
1066 if(nPts == 1) { in setHighOrder()
1083 if(nPts == 1) { in setHighOrder()
1107 if(nPts == 1) { in setHighOrder()
1121 if(nPts == 1) { in setHighOrder()
1145 if(nPts > 1) { getVolumeVertices(gr, p, v, nPts); } in setHighOrder()
[all …]
/dports/graphics/graphviz/graphviz-2.44.1/lib/mingle/
H A Dnearest_neighbor_graph.c18 SparseMatrix nearest_neighbor_graph(int nPts, int num_neigbors, int dim, double *x, double eps){ in nearest_neighbor_graph() argument
35 irn = MALLOC(sizeof(int)*nPts*k*2); in nearest_neighbor_graph()
36 jcn = MALLOC(sizeof(int)*nPts*k*2); in nearest_neighbor_graph()
37 val = MALLOC(sizeof(double)*nPts*k*2); in nearest_neighbor_graph()
40 nearest_neighbor_graph_ann(nPts, dim, num_neigbors, eps, x, &nz, &irn, &jcn, &val); in nearest_neighbor_graph()
42 …A = SparseMatrix_from_coordinate_arrays(nz, nPts, nPts, irn, jcn, (void *) val, MATRIX_TYPE_REAL, … in nearest_neighbor_graph()
H A Dnearest_neighbor_graph_ann.cpp74 extern "C" void nearest_neighbor_graph_ann(int nPts, int dim, int k, double eps, double *x, int *nz…
76 void nearest_neighbor_graph_ann(int nPts, int dim, int k, double eps, double *x, int *nz0, int **ir… in nearest_neighbor_graph_ann() argument
107 dataPts = annAllocPts(nPts, dim); // allocate data points in nearest_neighbor_graph_ann()
111 for (int i = 0; i < nPts; i++){ in nearest_neighbor_graph_ann()
118 sortPtsX(nPts, dataPts); in nearest_neighbor_graph_ann()
121 nPts, // number of points in nearest_neighbor_graph_ann()
123 for (int ip = 0; ip < nPts; ip++){ in nearest_neighbor_graph_ann()
146 sortPtsY(nPts, dataPts); in nearest_neighbor_graph_ann()
149 nPts, // number of points in nearest_neighbor_graph_ann()
151 for (int ip = 0; ip < nPts; ip++){ in nearest_neighbor_graph_ann()
/dports/science/iboview/ibo-view.20150427/src/IboView/
H A DIvIsoSurface.cpp55 nPts[3]; member
57 assert(iX < nPts[0] && iY < nPts[1] && iZ < nPts[2]); in vPt()
194 unsigned nPts[3]; member
200 size_t nPtsTotal() const { return nPts[0] * nPts[1] * nPts[2]; } in nPtsTotal()
214 if (nPts[i] < 8) in FixAxisDensity()
215 nPts[i] = 8; in FixAxisDensity()
227 fmti(nPts[0],4), fmti(nPts[1],4), fmti(nPts[2],4)); in PrintInfo()
422 Values(nPts); in FindIsoSettings()
456 IntWt(nPts); in FindIsoSettings()
575 CaGrid.nPts[i] = ob.nPts[i]; in MakeIsoSurface()
[all …]
/dports/math/jts/jts-jts-1.18.1/modules/core/src/test/java/org/locationtech/jts/geom/prep/
H A DStressTestHarness.java40 public void setTargetSize(int nPts) in setTargetSize() argument
42 numTargetPts =nPts; in setTargetSize()
57 Geometry createCircle(Coordinate origin, double size, int nPts) { in createCircle() argument
61 gsf.setNumPoints(nPts); in createCircle()
68 Geometry createSineStar(Coordinate origin, double size, int nPts) { in createSineStar() argument
72 gsf.setNumPoints(nPts); in createSineStar()
79 Geometry createRandomTestGeometry(Envelope env, double size, int nPts) in createRandomTestGeometry() argument
87 Geometry test = createTestCircle(basePt, size, nPts); in createRandomTestGeometry()
94 Geometry createTestCircle(Coordinate base, double size, int nPts) in createTestCircle() argument
99 gsf.setNumPoints(nPts); in createTestCircle()
H A DPreparedPolygonIntersectsStressTest.java60 public void run(int nPts) in run() argument
63 Geometry poly = createSineStar(new Coordinate(0, 0), 100, nPts); in run()
71 Geometry createCircle(Coordinate origin, double size, int nPts) { in createCircle() argument
75 gsf.setNumPoints(nPts); in createCircle()
82 Geometry createSineStar(Coordinate origin, double size, int nPts) { in createSineStar() argument
86 gsf.setNumPoints(nPts); in createSineStar()
93 LineString createTestLine(Envelope env, double size, int nPts) in createTestLine() argument
101 LineString line = createTestLine(basePt, size, nPts); in createTestLine()
105 LineString createTestLine(Coordinate base, double size, int nPts) in createTestLine() argument
110 gsf.setNumPoints(nPts); in createTestLine()
/dports/graphics/plotutils/plotutils-2.6/libxmi/
H A Dmi_plygen.c53 int nPts = 0; /* number of pts in buffer */ in miFillGeneralPoly() local
103 nPts++; in miFillGeneralPoly()
108 if (nPts == NUMPTSTOBUFFER) in miFillGeneralPoly()
110 MI_COPY_AND_PAINT_SPANS(paintedSet, pGC->pixels[1], nPts, FirstPoint, FirstWidth) in miFillGeneralPoly()
113 nPts = 0; in miFillGeneralPoly()
157 nPts++; in miFillGeneralPoly()
162 if (nPts == NUMPTSTOBUFFER) in miFillGeneralPoly()
164 MI_COPY_AND_PAINT_SPANS(paintedSet, pGC->pixels[1], nPts, FirstPoint, FirstWidth) in miFillGeneralPoly()
167 nPts = 0; in miFillGeneralPoly()
193 MI_COPY_AND_PAINT_SPANS(paintedSet, pGC->pixels[1], nPts, FirstPoint, FirstWidth) in miFillGeneralPoly()
/dports/net/tightvnc/vnc_unixsrc/Xvnc/programs/Xserver/mi/
H A Dmipolygen.c74 register int nPts = 0; /* number of pts in buffer */ local
130 nPts++;
135 if (nPts == NUMPTSTOBUFFER)
138 nPts, FirstPoint, FirstWidth,
142 nPts = 0;
186 nPts++;
191 if (nPts == NUMPTSTOBUFFER)
193 (*pgc->ops->FillSpans)(dst, pgc, nPts, FirstPoint,
197 nPts = 0;
223 (*pgc->ops->FillSpans)(dst, pgc, nPts, FirstPoint, FirstWidth, 1);
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/ML/Cluster/Murtagh/
H A DClustering.cpp57 static PyObject *Clustering_MurtaghCluster(python::object data, int nPts, in Clustering_MurtaghCluster() argument
74 ia = (boost::int64_t *)calloc(nPts, sizeof(boost::int64_t)); in Clustering_MurtaghCluster()
75 ib = (boost::int64_t *)calloc(nPts, sizeof(boost::int64_t)); in Clustering_MurtaghCluster()
76 crit = (real *)calloc(nPts, sizeof(real)); in Clustering_MurtaghCluster()
78 clusterit((real *)PyArray_DATA(dataContig), nPts, sz, option, ia, ib, crit); in Clustering_MurtaghCluster()
80 dims[0] = nPts; in Clustering_MurtaghCluster()
107 static PyObject *Clustering_MurtaghDistCluster(python::object data, int nPts, in Clustering_MurtaghDistCluster() argument
124 ia = (boost::int64_t *)calloc(nPts, sizeof(boost::int64_t)); in Clustering_MurtaghDistCluster()
125 ib = (boost::int64_t *)calloc(nPts, sizeof(boost::int64_t)); in Clustering_MurtaghDistCluster()
126 crit = (real *)calloc(nPts, sizeof(real)); in Clustering_MurtaghDistCluster()
[all …]
/dports/science/rdkit/rdkit-Release_2021_03_5/rdkit/ML/
H A DAnalyzeComposite.py112 nPts = len(data)
113 if not nPts:
126 for i in range(nPts):
156 avgOverall = sum(overall) / nPts
157 oCorConf /= nPts
158 oInCorConf /= nPts
159 overallMatrix /= nPts
179 avgHoldout = sum(holdout) / nPts
180 hCorConf /= nPts
181 hInCorConf /= nPts
[all …]
/dports/textproc/irstlm/irstlm-5.80.03/src/
H A Dquantize-lm.cpp214 unsigned int nPts = 0; // actual number of points in main() local
282 for (nPts=0; nPts<N; nPts++) { in main()
296 dataPts[nPts].pt=logprob; //exp(logprob * logten); in main()
297 dataPts[nPts].idx=nPts; in main()
317 for (nPts=0; nPts<N; nPts++) { in main()
326 dataPts[nPts].pt=logbow; in main()
327 dataPts[nPts].idx=nPts; in main()
352 for (nPts=0; nPts<numNgrams[Order]; nPts++) { in main()
358 *out << mapP[nPts]; in main()
362 if (Order < MaxOrder) *out << "\t" << mapB[nPts]; in main()
/dports/graphics/geos/geos-3.9.1/tests/bigtest/
H A DGeometryTestFactory.cpp73 GeometryTestFactory::createCircle(double basex, double basey, double size, uint32_t nPts) in createCircle() argument
75 CoordinateArraySequence* pts = new CoordinateArraySequence(nPts + 1); in createCircle()
78 for(int i = 0; i < nPts; i++) { in createCircle()
79 double ang = i * (2 * PI / nPts); in createCircle()
89 …actory::createCircle(GeometryFactory* fact, double basex, double basey, double size, uint32_t nPts) in createCircle() argument
91 CoordinateSequence* pts = createCircle(basex, basey, size, nPts); in createCircle()
105 …actory::createSineStar(double basex, double basey, double size, double armLen, int nArms, int nPts) in createSineStar() argument
113 int nArmPt = nPts / nArms; in createSineStar()
143 int nArms, int nPts) in createSineStar() argument
145 CoordinateSequence* pts = createSineStar(basex, basey, size, armLen, nArms, nPts); in createSineStar()
/dports/science/rdkit/rdkit-Release_2021_03_5/rdkit/Chem/Pharm2D/
H A DSigFactory.py65 nPts, combo, scaffold = self.GetBitInfo(bitIdx)
68 dMat = numpy.zeros((nPts, nPts), numpy.int)
69 dVect = Utils.nPointDistDict[nPts]
75 return nPts, combo, scaffold, labels, dMat
279 nPts = self.minPointCount
280 while nPts < self.maxPointCount and self._starts[nPts + 1] <= idx:
281 nPts += 1
284 offsetFromStart = idx - self._starts[nPts]
289 nDists = len(Utils.nPointDistDict[nPts])
296 indexCombos = Utils.GetIndexCombinations(self._nFeats, nPts)
[all …]
/dports/math/jts/jts-jts-1.18.1/modules/core/src/test/java/test/jts/perf/geom/prep/
H A DTestDataBuilder.java55 public Geometry createCircle(int nPts) { in createCircle() argument
59 gsf.setNumPoints(nPts); in createCircle()
66 public Geometry createSineStar(int nPts) { in createSineStar() argument
70 gsf.setNumPoints(nPts); in createSineStar()
77 public List createTestGeoms(Envelope env, int nItems, double size, int nPts) in createTestGeoms() argument
90 Geometry line = createLine(base, size, nPts); in createTestGeoms()
97 Geometry createLine(Coordinate base, double size, int nPts) in createLine() argument
102 gsf.setNumPoints(nPts); in createLine()

12345678910>>...15