Home
last modified time | relevance | path

Searched refs:clusterid (Results 1 – 25 of 202) sorted by relevance

123456789

/dports/devel/p5-Algorithm-Cluster/Algorithm-Cluster-1.59/perl/t/
H A D13_somcluster.t72 my ($clusterid);
87 $clusterid = Algorithm::Cluster::somcluster(%params);
89 is (scalar(@$data1), scalar(@$clusterid) );
90 is (scalar(@{$clusterid->[0]}), 2 );
103 $clusterid = Algorithm::Cluster::somcluster(%params);
105 is (scalar(@$data2), scalar(@$clusterid) );
106 is (scalar(@{$clusterid->[0]}), 2 );
/dports/devel/p5-Algorithm-Cluster/Algorithm-Cluster-1.59/src/
H A Dcluster.h48 double** data, int** mask, int clusterid[], double** cdata, int** cmask,
51 int clusterid[], int centroids[], double errors[]);
54 int clusterid[], double* error, int* ifound);
56 int npass, int clusterid[], double* error, int* ifound);
73 int cuttree(int nelements, const Node* tree, int nclusters, int clusterid[]);
79 int clusterid[][2]);
/dports/biology/py-biopython/biopython-1.79/Bio/Cluster/
H A Dcluster.h48 double** data, int** mask, int clusterid[], double** cdata, int** cmask,
51 int clusterid[], int centroids[], double errors[]);
54 int clusterid[], double* error, int* ifound);
56 int npass, int clusterid[], double* error, int* ifound);
73 int cuttree(int nelements, const Node* tree, int nclusters, int clusterid[]);
79 int clusterid[][2]);
H A D__init__.py173 clusterid, npass = __check_initialid(initialid, npass, nitems)
177 return clusterid, error, nfound
238 clusterid, npass = __check_initialid(initialid, npass, nitems)
240 return clusterid, error, nfound
504 if clusterid is None:
506 clusterid = numpy.zeros(n, dtype="intc")
509 clusterid = numpy.require(clusterid, dtype="intc", requirements="C")
510 nclusters = max(clusterid + 1)
1246 clusterid = numpy.empty(nitems, dtype="intc")
1249 clusterid = numpy.array(initialid, dtype="intc")
[all …]
/dports/science/afni/afni-AFNI_21.3.16/src/avovk/
H A Dcluster.h55 double** data, int** mask, int clusterid[], double** cdata, int** cmask,
58 int clusterid[], int centroids[], double errors[]);
61 int clusterid[], double* error, int* ifound);
63 int npass, int clusterid[], double* error, int* ifound);
79 void cuttree (int nelements, Node* tree, int nclusters, int clusterid[]);
85 int clusterid[][2]);
H A DAclustering_floatNOMASK.c165 int* clusterid; in example_hierarchical() local
290 clusterid = malloc(nrows*sizeof(int)); in example_hierarchical()
292 cuttree (nrows, tree, k, clusterid); in example_hierarchical()
294 fprintf(out1, "%09d\t%2d\n", i, clusterid[i]); in example_hierarchical()
300 free(clusterid); in example_hierarchical()
306 int* clusterid, float** data, char* jobname, in getvoxlclusterdist() argument
353 int* clusterid, float** data, char* jobname, in getvoxlclustersdist() argument
423 int* clusterid = malloc(nrows*sizeof(int)); in example_kmeans() local
480 clusterid, &error, &ifound); in example_kmeans()
498 { int id = clusterid[i]; in example_kmeans()
[all …]
H A Dthd_segtools_fNM.c441 clusterid = malloc(nrows*sizeof(int)); in example_hierarchical()
443 cuttree (nrows, tree, k, clusterid); in example_hierarchical()
544 vcdata[i][0] = 100*clusterid[i]+100*difference/(max_vcdata[clusterid[i]]); in getvoxlclusterdist()
829 ++count[clusterid[i]]; in example_kmeans()
843 clusterid[i] = imap[clusterid[i]]; in example_kmeans()
877 clusterid[i] = imap[clusterid[i]]; in example_kmeans()
914 int id = clusterid[i]; in example_kmeans()
1237 int* clusterid = NULL; in thd_Acluster() local
1391 if (clusterid[nl]<0) { in thd_Acluster()
1467 clusterid[ii] = vmap[clusterid[ii]+1]; in thd_Acluster()
[all …]
H A Dcluster_doubleNOMASK.h55 double** data, int clusterid[], double** cdata,
58 int clusterid[], int centroids[], double errors[]);
61 int clusterid[], double* error, int* ifound);
63 int npass, int clusterid[], double* error, int* ifound);
79 void cuttree (int nelements, Node* tree, int nclusters, int clusterid[]);
H A Dthd_segtools.c282 int *clusterid) in example_hierarchical() argument
423 clusterid = malloc(nrows*sizeof(int)); in example_hierarchical()
425 cuttree (nrows, tree, k, clusterid); in example_hierarchical()
448 int *clusterid) in example_kmeans() argument
533 clusterid, &error, &ifound); in example_kmeans()
552 int id = clusterid[i]; in example_kmeans()
622 int* clusterid = NULL; in thd_Acluster() local
681 oc.jobname, clusterid); in thd_Acluster()
692 clusterid); in thd_Acluster()
723 sc[nl] = (short)clusterid[ii]+1; in thd_Acluster()
[all …]
H A Dcluster_floatNOMASK.h56 float** data, int clusterid[], float** cdata,
59 int clusterid[], int centroids[], float errors[]);
62 int clusterid[], float* error, int* ifound);
64 int npass, int clusterid[], float* error, int* ifound);
81 void cuttree (int nelements, Node* tree, int nclusters, int clusterid[]);
H A Dcluster_doubleNOMASK.c1644 k = clusterid[j]; in randomassign()
1645 clusterid[j] = clusterid[i]; in randomassign()
3237 int* clusterid; in pmlcluster() local
3244 { free(clusterid); in pmlcluster()
3271 clusterid[is] = clusterid[n-1]; in pmlcluster()
3273 free(clusterid); in pmlcluster()
3312 int* clusterid; in palcluster() local
3320 { free(clusterid); in palcluster()
3325 { free(clusterid); in palcluster()
3375 clusterid[is] = clusterid[n-1]; in palcluster()
[all …]
H A Dcluster_floatNOMASK.c1675 k = clusterid[j]; in randomassign()
1676 clusterid[j] = clusterid[i]; in randomassign()
3296 int* clusterid; in pmlcluster() local
3303 { free(clusterid); in pmlcluster()
3330 clusterid[is] = clusterid[n-1]; in pmlcluster()
3332 free(clusterid); in pmlcluster()
3371 int* clusterid; in palcluster() local
3379 { free(clusterid); in palcluster()
3384 { free(clusterid); in palcluster()
3434 clusterid[is] = clusterid[n-1]; in palcluster()
[all …]
H A DAclustering_NOMASK.c163 int* clusterid; in example_hierarchical() local
288 clusterid = malloc(nrows*sizeof(int)); in example_hierarchical()
290 cuttree (nrows, tree, k, clusterid); in example_hierarchical()
292 fprintf(out1, "%09d\t%2d\n", i, clusterid[i]); in example_hierarchical()
298 free(clusterid); in example_hierarchical()
304 int* clusterid, double** data, char* jobname, in getvoxlclusterdist() argument
378 int* clusterid = malloc(nrows*sizeof(int)); in example_kmeans() local
423 clusterid, &error, &ifound); in example_kmeans()
429 fprintf (out1, "%09d\t %d\n", i, clusterid[i]); in example_kmeans()
441 { int id = clusterid[i]; in example_kmeans()
[all …]
H A DAclustering.c179 int* clusterid; in example_hierarchical() local
315 clusterid = malloc(nrows*sizeof(int)); in example_hierarchical()
317 cuttree (nrows, tree, k, clusterid); in example_hierarchical()
319 fprintf(out1, "%09d\t%2d\n", i, clusterid[i]); in example_hierarchical()
329 free(clusterid); in example_hierarchical()
335 int* clusterid, double** data, char* jobname, in getvoxlclusterdist() argument
409 int* clusterid = malloc(nrows*sizeof(int)); in example_kmeans() local
465 clusterid, &error, &ifound); in example_kmeans()
471 fprintf (out1, "%09d\t %d\n", i, clusterid[i]); in example_kmeans()
483 { int id = clusterid[i]; in example_kmeans()
[all …]
H A Dcluster.c1654 clusterid[j] = clusterid[i]; in randomassign()
3234 int* clusterid; in pmlcluster() local
3241 { free(clusterid); in pmlcluster()
3268 clusterid[is] = clusterid[n-1]; in pmlcluster()
3270 free(clusterid); in pmlcluster()
3309 int* clusterid; in palcluster() local
3317 { free(clusterid); in palcluster()
3322 { free(clusterid); in palcluster()
3372 clusterid[is] = clusterid[n-1]; in palcluster()
3374 free(clusterid); in palcluster()
[all …]
H A Dthd_segtools_fNM.h23 int *clusterid, float **vcdata,
34 int *clusterid);
36 int* clusterid, float** data, char* jobname,
40 int* clusterid, float** data, char* jobname,
/dports/devel/p5-Algorithm-Cluster/Algorithm-Cluster-1.59/perl/
H A DCluster.xs1019 int* clusterid; variable
1036 if (!clusterid) {
1045 free(clusterid);
1289 if (!clusterid) {
1340 free(clusterid);
1377 if (!clusterid) {
1437 free(clusterid);
1582 if (!clusterid) {
1660 free(clusterid);
1819 if (!clusterid) {
[all …]
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-clustering/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/hierarchical/extraction/
H A DAbstractCutDendrogram.java209 if(clusterid >= 0) { in buildLeafClusters()
210 cluster_dbids.get(clusterid).add(it); in buildLeafClusters()
211 cluster_map.putInt(it, clusterid); in buildLeafClusters()
214 clusterHeight.set(clusterid, dist); in buildLeafClusters()
223 cluster_map.putInt(succ, clusterid); in buildLeafClusters()
225 cluster_map.putInt(it, clusterid); in buildLeafClusters()
259 int clusterid = cluster_map.intValue(it); in buildFlat() local
260 if(clusterid < 0) { in buildFlat()
297 int clusterid = cluster_map.intValue(it); in buildHierarchical() local
300 if(clusterid >= 0) { in buildHierarchical()
[all …]
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-clustering/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/gdbscan/
H A DGeneralizedDBSCAN.java206 int clusterid = NOISE + 1; in run() local
218 … clustersizes.add(expandCluster(id, clusterid, clusterids, neighbors, activeSet, progress)); in run()
220 ++clusterid; in run()
235 ArrayModifiableDBIDs[] clusterlists = new ArrayModifiableDBIDs[clusterid]; in run()
236 ArrayModifiableDBIDs[] corelists = coremodel ? new ArrayModifiableDBIDs[clusterid] : null; in run()
275 …protected int expandCluster(final DBIDRef seed, final int clusterid, final WritableIntegerDataStor… in expandCluster() argument
277 int clustersize = 1 + processCorePoint(seed, neighbors, clusterid, clusterids, activeSet); in expandCluster()
286 clustersize += processCorePoint(id, newneighbors, clusterid, clusterids, activeSet); in expandCluster()
303 …protected int processCorePoint(final DBIDRef seed, T newneighbors, final int clusterid, final Writ… in processCorePoint() argument
304 clusterids.putInt(seed, clusterid); // Core point now in processCorePoint()
[all …]
/dports/net/librdkafka/librdkafka-1.8.2/tests/
H A D0063-clusterid.cpp67 std::string clusterid; in do_test_clusterid() local
73 std::string clusterid_good_1 = p_good->clusterid(tmout_multip(2000)); in do_test_clusterid()
79 std::string clusterid_good_2 = p_good->clusterid(0); in do_test_clusterid()
91 std::string clusterid_bad_1 = p_bad->clusterid(tmout_multip(2000)); in do_test_clusterid()
95 std::string clusterid_bad_2 = p_bad->clusterid(0); in do_test_clusterid()
/dports/sysutils/vector/vector-0.10.0/cargo-crates/rdkafka-sys-2.0.0+1.4.2/librdkafka/tests/
H A D0063-clusterid.cpp67 std::string clusterid; in do_test_clusterid() local
73 std::string clusterid_good_1 = p_good->clusterid(tmout_multip(2000)); in do_test_clusterid()
79 std::string clusterid_good_2 = p_good->clusterid(0); in do_test_clusterid()
91 std::string clusterid_bad_1 = p_bad->clusterid(tmout_multip(2000)); in do_test_clusterid()
95 std::string clusterid_bad_2 = p_bad->clusterid(0); in do_test_clusterid()
/dports/sysutils/fluent-bit/fluent-bit-1.8.11/plugins/out_kafka/librdkafka-1.7.0/tests/
H A D0063-clusterid.cpp67 std::string clusterid; in do_test_clusterid() local
73 std::string clusterid_good_1 = p_good->clusterid(tmout_multip(2000)); in do_test_clusterid()
79 std::string clusterid_good_2 = p_good->clusterid(0); in do_test_clusterid()
91 std::string clusterid_bad_1 = p_bad->clusterid(tmout_multip(2000)); in do_test_clusterid()
95 std::string clusterid_bad_2 = p_bad->clusterid(0); in do_test_clusterid()
/dports/devel/p5-Algorithm-Cluster/Algorithm-Cluster-1.59/perl/examples/
H A Dex4_somcluster69 my ($clusterid);
72 $clusterid = Algorithm::Cluster::somcluster(%params);
75 foreach(@{$clusterid}) {
/dports/biology/mmseqs2/MMseqs2-13-45111/src/clustering/
H A DClusteringAlgorithms.cpp183 void ClusteringAlgorithms::removeClustersize(unsigned int clusterid){ in removeClustersize() argument
184 clustersizes[clusterid]=0; in removeClustersize()
185 sorted_clustersizes[clusterid_to_arrayposition[clusterid]] = UINT_MAX; in removeClustersize()
186 clusterid_to_arrayposition[clusterid]=UINT_MAX; in removeClustersize()
189 void ClusteringAlgorithms::decreaseClustersize(unsigned int clusterid){ in decreaseClustersize() argument
190 const unsigned int oldposition=clusterid_to_arrayposition[clusterid]; in decreaseClustersize()
191 const unsigned int newposition=borders_of_set[clustersizes[clusterid]]; in decreaseClustersize()
198 sorted_clustersizes[newposition]=clusterid; in decreaseClustersize()
199 clusterid_to_arrayposition[clusterid]=newposition; in decreaseClustersize()
200 borders_of_set[clustersizes[clusterid]]++; in decreaseClustersize()
[all …]
/dports/biology/py-biopython/biopython-1.79/Tests/
H A Dtest_Cluster.py435 clusterid=clusterid,
460 clusterid=clusterid,
473 clusterid=clusterid,
486 clusterid=clusterid,
499 clusterid=clusterid[:3],
512 clusterid=clusterid,
526 clusterid=clusterid,
540 clusterid=clusterid,
592 data, mask=mask, clusterid=clusterid, method="a", transpose=False
631 data, mask=mask, clusterid=clusterid, method="a", transpose=True
[all …]

123456789