/dports/graphics/qgis/qgis-3.22.3/src/core/classification/ |
H A D | qgsclassificationequalinterval.cpp | 39 const QList<double> &values, int nclasses ) in calculateBreaks() argument 48 const double step = ( maximum - minimum ) / nclasses; in calculateBreaks() 51 breaks.reserve( nclasses ); in calculateBreaks() 52 for ( int i = 0; i < nclasses; i++ ) in calculateBreaks() 59 breaks[nclasses - 1] = maximum; in calculateBreaks() 68 if ( nclasses % 2 == 0 ) // we want odd number of classes in calculateBreaks() 69 ++nclasses; in calculateBreaks() 74 ++nclasses; in calculateBreaks() 78 breaks.reserve( nclasses ); in calculateBreaks() 81 for ( int i = 0; i < nclasses; i++ ) in calculateBreaks() [all …]
|
H A D | qgsclassificationjenks.cpp | 54 const QList<double> &values, int nclasses ) in calculateBreaks() argument 69 if ( nclasses <= 1 ) in calculateBreaks() 74 if ( nclasses >= values.size() ) in calculateBreaks() 130 matrixOne[i].resize( nclasses + 1 ); in calculateBreaks() 131 matrixTwo[i].resize( nclasses + 1 ); in calculateBreaks() 134 for ( int i = 1; i <= nclasses; i++ ) in calculateBreaks() 167 for ( int j = 2; j <= nclasses; j++ ) in calculateBreaks() 181 QVector<double> breaks( nclasses ); in calculateBreaks() 182 breaks[nclasses - 1] = sample[n - 1]; in calculateBreaks() 184 for ( int j = nclasses, k = n; j >= 2; j-- ) in calculateBreaks()
|
/dports/graphics/qgis-ltr/qgis-3.16.16/src/core/classification/ |
H A D | qgsclassificationequalinterval.cpp | 39 const QList<double> &values, int nclasses ) in calculateBreaks() argument 48 double step = ( maximum - minimum ) / nclasses; in calculateBreaks() 51 breaks.reserve( nclasses ); in calculateBreaks() 52 for ( int i = 0; i < nclasses; i++ ) in calculateBreaks() 59 breaks[nclasses - 1] = maximum; in calculateBreaks() 68 if ( nclasses % 2 == 0 ) // we want odd number of classes in calculateBreaks() 69 ++nclasses; in calculateBreaks() 74 ++nclasses; in calculateBreaks() 78 breaks.reserve( nclasses ); in calculateBreaks() 81 for ( int i = 0; i < nclasses; i++ ) in calculateBreaks() [all …]
|
H A D | qgsclassificationjenks.cpp | 54 const QList<double> &values, int nclasses ) in calculateBreaks() argument 69 if ( nclasses <= 1 ) in calculateBreaks() 74 if ( nclasses >= values.size() ) in calculateBreaks() 125 matrixOne[i].resize( nclasses + 1 ); in calculateBreaks() 126 matrixTwo[i].resize( nclasses + 1 ); in calculateBreaks() 129 for ( int i = 1; i <= nclasses; i++ ) in calculateBreaks() 162 for ( int j = 2; j <= nclasses; j++ ) in calculateBreaks() 176 QVector<double> breaks( nclasses ); in calculateBreaks() 177 breaks[nclasses - 1] = sample[n - 1]; in calculateBreaks() 179 for ( int j = nclasses, k = n; j >= 2; j-- ) in calculateBreaks()
|
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/thirdparty/pybind11/docs/ |
H A D | benchmark.py | 11 def generate_dummy_code_pybind11(nclasses=10): argument 15 for cl in range(nclasses): 19 for cl in range(nclasses): 24 ret = random.randint(0, nclasses - 1) 42 def generate_dummy_code_boost(nclasses=10): argument 46 for cl in range(nclasses): 50 for cl in range(nclasses): 55 ret = random.randint(0, nclasses - 1) 79 nclasses = 2 ** i variable 81 f.write(codegen(nclasses)) [all …]
|
/dports/cad/netgen/netgen-6.2.2105/external_dependencies/pybind11/docs/ |
H A D | benchmark.py | 10 def generate_dummy_code_pybind11(nclasses=10): argument 14 for cl in range(nclasses): 18 for cl in range(nclasses): 23 ret = random.randint(0, nclasses - 1) 42 def generate_dummy_code_boost(nclasses=10): argument 46 for cl in range(nclasses): 50 for cl in range(nclasses): 55 ret = random.randint(0, nclasses - 1) 77 nclasses = 2 ** i variable 79 f.write(codegen(nclasses)) [all …]
|
/dports/devel/pybind11/pybind11-2.8.1/docs/ |
H A D | benchmark.py | 10 def generate_dummy_code_pybind11(nclasses=10): argument 14 for cl in range(nclasses): 18 for cl in range(nclasses): 23 ret = random.randint(0, nclasses - 1) 41 def generate_dummy_code_boost(nclasses=10): argument 45 for cl in range(nclasses): 49 for cl in range(nclasses): 54 ret = random.randint(0, nclasses - 1) 78 nclasses = 2 ** i variable 80 f.write(codegen(nclasses)) [all …]
|
/dports/misc/py-onnx/onnx-1.10.2/third_party/pybind11/docs/ |
H A D | benchmark.py | 11 def generate_dummy_code_pybind11(nclasses=10): argument 15 for cl in range(nclasses): 19 for cl in range(nclasses): 24 ret = random.randint(0, nclasses - 1) 42 def generate_dummy_code_boost(nclasses=10): argument 46 for cl in range(nclasses): 50 for cl in range(nclasses): 55 ret = random.randint(0, nclasses - 1) 79 nclasses = 2 ** i variable 81 f.write(codegen(nclasses)) [all …]
|
/dports/graphics/open3d/Open3D-0.2/src/External/pybind11/docs/ |
H A D | benchmark.py | 10 def generate_dummy_code_pybind11(nclasses=10): argument 14 for cl in range(nclasses): 18 for cl in range(nclasses): 23 ret = random.randint(0, nclasses - 1) 42 def generate_dummy_code_boost(nclasses=10): argument 46 for cl in range(nclasses): 50 for cl in range(nclasses): 55 ret = random.randint(0, nclasses - 1) 77 nclasses = 2 ** i variable 79 f.write(codegen(nclasses)) [all …]
|
/dports/devel/nextpnr/nextpnr-48cd407/3rdparty/pybind11/docs/ |
H A D | benchmark.py | 10 def generate_dummy_code_pybind11(nclasses=10): argument 14 for cl in range(nclasses): 18 for cl in range(nclasses): 23 ret = random.randint(0, nclasses - 1) 42 def generate_dummy_code_boost(nclasses=10): argument 46 for cl in range(nclasses): 50 for cl in range(nclasses): 55 ret = random.randint(0, nclasses - 1) 77 nclasses = 2 ** i variable 79 f.write(codegen(nclasses)) [all …]
|
/dports/science/smoldyn/smoldyn-2.67/source/pybind11/docs/ |
H A D | benchmark.py | 10 def generate_dummy_code_pybind11(nclasses=10): argument 14 for cl in range(nclasses): 18 for cl in range(nclasses): 23 ret = random.randint(0, nclasses - 1) 41 def generate_dummy_code_boost(nclasses=10): argument 45 for cl in range(nclasses): 49 for cl in range(nclasses): 54 ret = random.randint(0, nclasses - 1) 78 nclasses = 2 ** i variable 80 f.write(codegen(nclasses)) [all …]
|
/dports/graphics/py-open3d-python/Open3D-0.2/src/External/pybind11/docs/ |
H A D | benchmark.py | 10 def generate_dummy_code_pybind11(nclasses=10): argument 14 for cl in range(nclasses): 18 for cl in range(nclasses): 23 ret = random.randint(0, nclasses - 1) 42 def generate_dummy_code_boost(nclasses=10): argument 46 for cl in range(nclasses): 50 for cl in range(nclasses): 55 ret = random.randint(0, nclasses - 1) 77 nclasses = 2 ** i variable 79 f.write(codegen(nclasses)) [all …]
|
/dports/graphics/opencv/opencv-4.5.3/modules/ml/src/ |
H A D | nbayes.cpp | 74 count.resize(nclasses); in train() 75 sum.resize(nclasses); in train() 76 productsum.resize(nclasses); in train() 77 avg.resize(nclasses); in train() 356 for( i = 0; i < nclasses; i++ ) in write() 360 for( i = 0; i < nclasses; i++ ) in write() 364 for( i = 0; i < nclasses; i++ ) in write() 410 count.resize(nclasses); in read() 411 sum.resize(nclasses); in read() 412 productsum.resize(nclasses); in read() [all …]
|
/dports/science/py-dipy/dipy-1.4.1/dipy/segment/tests/ |
H A D | test_mrf.py | 20 nclasses = 4 variable 75 npt.assert_(initial_segmentation.max() == nclasses - 1) 121 npt.assert_(icm_segmentation.max() == nclasses - 1) 163 nclasses) 236 nclasses) 257 nclasses) 328 nclasses) 387 npt.assert_(seg_final.max() == nclasses) 394 npt.assert_(seg_final.max() == nclasses) 400 npt.assert_(seg_final.max() == nclasses) [all …]
|
/dports/databases/grass7/grass-7.8.6/lib/cluster/ |
H A D | c_execmem.c | 27 C->npoints, C->nclasses, C->nbands); in I_cluster_exec_allocate() 30 C->reclass = I_alloc_int(C->nclasses); in I_cluster_exec_allocate() 31 C->count = I_alloc_int(C->nclasses); in I_cluster_exec_allocate() 32 C->countdiff = I_alloc_int(C->nclasses); in I_cluster_exec_allocate() 33 C->sum = I_alloc_double2(C->nbands, C->nclasses); in I_cluster_exec_allocate() 34 C->sumdiff = I_alloc_double2(C->nbands, C->nclasses); in I_cluster_exec_allocate() 35 C->sum2 = I_alloc_double2(C->nbands, C->nclasses); in I_cluster_exec_allocate() 36 C->mean = I_alloc_double2(C->nbands, C->nclasses); in I_cluster_exec_allocate()
|
H A D | c_means.c | 32 C->nbands, C->nclasses); in I_cluster_means() 39 for (class = 0; class < C->nclasses; class++) in I_cluster_means() 41 if (C->nclasses > 1) in I_cluster_means() 42 for (class = 0; class < C->nclasses; class++) in I_cluster_means() 44 ((2.0 * class) / (C->nclasses - 1) - 1.0) * v; in I_cluster_means()
|
H A D | c_reclass.c | 29 for (c = 0; c < C->nclasses; c++) in I_cluster_reclass() 33 for (hole = 0; hole < C->nclasses; hole++) in I_cluster_reclass() 38 if (hole >= C->nclasses) in I_cluster_reclass() 41 for (move = hole; move < C->nclasses; move++) in I_cluster_reclass() 54 C->nclasses = hole; in I_cluster_reclass()
|
/dports/science/py-dipy/dipy-1.4.1/dipy/segment/ |
H A D | tissue.py | 22 def classify(self, image, nclasses, beta, tolerance=None, max_iter=None): argument 58 nclasses = nclasses + 1 # One extra class for the background 67 mu, sigmasq = com.initialize_param_uniform(image, nclasses) 72 neglogl = com.negloglikelihood(image, mu, sigmasq, nclasses) 75 mu, sigmasq = com.seg_stats(image, seg_init, nclasses) 97 PLN = icm.prob_neighborhood(seg_init, beta, nclasses) 98 PVE = com.prob_image(image_gauss, nclasses, mu, sigmasq, PLN) 101 PVE, mu, nclasses) 107 mu_upd, sigmasq_upd, nclasses)
|
H A D | mrf.pyx | 155 for l in range(nclasses): 191 for l in range(nclasses): 195 for l in range(nclasses): 232 for l in range(nclasses): 269 cnp.npy_intp nclasses = mu.shape[0] 282 for i in range(nclasses): 495 for classid in range(nclasses): 504 for l in range(nclasses): 536 cnp.npy_intp nclasses = nloglike.shape[3] 545 for k in range(nclasses): [all …]
|
/dports/math/gecode/gecode-0916a1a/examples/ |
H A D | car-sequencing.cpp | 228 const int nclasses; member in CarSequencing 248 nclasses(problems[problem][2]), in CarSequencing() 250 stallval(nclasses), in CarSequencing() 251 endval(nclasses+1), in CarSequencing() 268 IntArgs ncc(nclasses); in CarSequencing() 295 IntSetArgs c(nclasses+2); in CarSequencing() 296 for (int i = nclasses; i--; ) { in CarSequencing() 325 IntArgs notend(nclasses), notstallend(nclasses+1); in CarSequencing() 326 for (int i = nclasses; i--; ) { in CarSequencing() 375 int width = nclasses > 9 ? 2 : 1; in print() [all …]
|
/dports/science/R-cran-e1071/e1071/src/ |
H A D | Rsvm.c | 217 int *nclasses, in svmtrain() argument 286 *nclasses = model->nr_class; in svmtrain() 287 memcpy (rho, model->rho, *nclasses * (*nclasses - 1)/2 * sizeof(double)); in svmtrain() 294 *nclasses * (*nclasses - 1)/2 * sizeof(double)); in svmtrain() 296 *nclasses * (*nclasses - 1)/2 * sizeof(double)); in svmtrain() 300 for (i = 0; i < *nclasses-1; i++) in svmtrain() 338 int *nclasses, in svmpredict() argument 365 m.nr_class = *nclasses; in svmpredict() 412 svm_predict_values(&m, train[i], dec + i * *nclasses * (*nclasses - 1) / 2); in svmpredict() 436 int *nclasses, in svmwrite() argument [all …]
|
/dports/math/yices/yices-2.6.2/src/context/ |
H A D | eq_abstraction.c | 41 tmp->nclasses = n; in alloc_epartition() 89 m->nclasses = 0; in init_epartition_manager() 133 i = m->nclasses; in get_class_index() 144 m->nclasses = i+1; in get_class_index() 251 m->nclasses = 0; in get_epartition() 402 n = p->nclasses; in epartition_init_for_meet() 427 n = p->nclasses; in epartition_meet() 520 n = p->nclasses; in epartition_set_labels() 572 n = m->nclasses; in refine_class() 603 n = m->nclasses; in epartition_remove_singletons() [all …]
|
/dports/science/hdf5-18/hdf5-1.8.21/src/ |
H A D | H5FS.c | 119 HDassert(nclasses == 0 || classes); in H5FS_create() 124 if(NULL == (fspace = H5FS_new(f, nclasses, classes, cls_init_udata))) in H5FS_create() 192 H5FS_open(H5F_t *f, hid_t dxpl_id, haddr_t fs_addr, size_t nclasses, in H5FS_open() argument 206 HDassert(nclasses); in H5FS_open() 211 cache_udata.nclasses = nclasses; in H5FS_open() 280 cache_udata.nclasses = 0; in H5FS_delete() 529 HDassert(nclasses == 0 || (nclasses > 0 && classes)); in H5FS_new() 538 fspace->nclasses = nclasses; in H5FS_new() 539 if(nclasses > 0) { in H5FS_new() 544 for(u = 0; u < nclasses; u++) { in H5FS_new() [all …]
|
/dports/math/vtk6/VTK-6.2.0/ThirdParty/hdf5/vtkhdf5/src/ |
H A D | H5FS.c | 121 HDassert(nclasses == 0 || classes); in H5FS_create() 126 if(NULL == (fspace = H5FS_new(f, nclasses, classes, cls_init_udata))) in H5FS_create() 194 H5FS_open(H5F_t *f, hid_t dxpl_id, haddr_t fs_addr, size_t nclasses, in H5FS_open() argument 208 HDassert(nclasses); in H5FS_open() 213 cache_udata.nclasses = nclasses; in H5FS_open() 282 cache_udata.nclasses = 0; in H5FS_delete() 531 HDassert(nclasses == 0 || (nclasses > 0 && classes)); in H5FS_new() 540 fspace->nclasses = nclasses; in H5FS_new() 541 if(nclasses > 0) { in H5FS_new() 546 for(u = 0; u < nclasses; u++) { in H5FS_new() [all …]
|
/dports/x11/libXi/libXi-1.8/src/ |
H A D | XIQueryDevice.c | 37 extern int copy_classes(XIDeviceInfo* to, xXIAnyInfo* from, int *nclasses); 38 extern int size_classes(xXIAnyInfo* from, int nclasses); 90 int nclasses; in XIQueryDevice() local 102 nclasses = wire->num_classes; in XIQueryDevice() 116 sz = size_classes((xXIAnyInfo*)ptr, nclasses); in XIQueryDevice() 123 ptr += copy_classes(lib, (xXIAnyInfo*)ptr, &nclasses); in XIQueryDevice() 125 lib->num_classes = nclasses; in XIQueryDevice()
|