Home
last modified time | relevance | path

Searched refs:ncount (Results 1 – 25 of 1290) sorted by relevance

12345678910>>...52

/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/UTIL/
H A Dgetdata.c191 int *ncount;
533 int ncount;
858 int ncount; in make_weights_nonnegative()
1164 int ncount; in CCutil_datagroup_perm()
1244 int ncount; in CCutil_getedgelist()
1318 int ncount; in CCutil_getcycle_edgelist()
1343 if (i != ncount || k != ncount) {
1374 int ncount; in CCutil_getcycle()
1510 int ncount; in CCutil_writeedges()
1540 int ncount; in CCutil_writecycle_edgelist()
[all …]
/dports/math/concorde/concorde/UTIL/
H A Dgetdata.c462 ncount = ncount - ndepot; in CCutil_writemaster()
605 *ncount = 0; in CCutil_readmaster()
639 for (i = *ncount; i < *ncount + ndepot; i++) { in CCutil_readmaster()
714 for (i = *ncount; i < *ncount + ndepot; i++) { in CCutil_readmaster()
766 for (i = *ncount; i < *ncount + ndepot; i++) { in CCutil_readmaster()
862 *ncount = -1; in CCutil_gettsplib()
1585 if (ecount > (ncount * (ncount - 1)) / 2) { in CCutil_genedgelist()
1598 if (ecount > (ncount * (ncount - 1)) / 20) { in CCutil_genedgelist()
1599 int eleft = (ncount * (ncount - 1)) / 2; in CCutil_genedgelist()
1697 if (i != ncount || k != ncount) { in CCutil_getcycle_edgelist()
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/EDGEGEN/
H A Dedgegen.c183 int ncount;
444 int ncount;
506 int ncount; in call_nearest()
581 int ncount; in call_quadnearest()
657 int ncount; in call_random_tour()
704 int ncount; in call_nearest_tour()
787 int ncount; in call_greedy_tour()
835 int ncount; in call_twoopt_tour()
954 int ncount; in call_linkern()
1162 int ncount; in call_f2match()
[all …]
H A Dxnear.c160 int ncount, num; in CC_PTR_ALLOC_ROUTINE()
176 int ncount, num; in CCedgegen_x_quadrant_k_nearest()
191 int ncount, num; in CCedgegen_junk_k_nearest()
208 int ncount, num; in run_x_k_nearest()
594 int ncount, ni;
717 int ncount, n;
775 int ncount, start; in CCedgegen_x_nearest_neighbor_tour()
791 if (ncount < 3) {
841 int ncount, start; in CCedgegen_junk_nearest_neighbor_tour()
925 int ncount; in CCedgegen_xnear_build()
[all …]
/dports/math/concorde/concorde/EDGEGEN/
H A Dedgegen.c226 if (ncount < 3) { in CC_PTRWORLD_LIST_ROUTINES()
228 ncount); in CC_PTRWORLD_LIST_ROUTINES()
237 for (i = 0; i < ncount; i++) in CC_PTRWORLD_LIST_ROUTINES()
826 if (work_nearest_tour (kt, ncount, CCutil_lprand (rstate) % ncount, in call_nearest_tour()
933 if (ncount < 9) { in call_greedy_tour()
934 t = ncount - 1; in call_greedy_tour()
1117 if (work_nearest_tour (kt, ncount, CCutil_lprand (rstate) % ncount, in call_twoopt_tour()
1477 if (work_nearest_tour (kt, ncount, CCutil_lprand (rstate) % ncount, in call_linkern()
1634 for (i = 0; i < ncount; i++) in call_f2match_nearest()
1686 for (i = 0; i < ncount; i++) in f2match_initial_edgeset()
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/src/BODY/
H A Dcompute_body_local.cpp111 int ncount = compute_body(0); in init() local
112 if (ncount > nmax) reallocate(ncount); in init()
113 size_local_rows = ncount; in init()
124 int ncount = compute_body(0); in compute_local() local
125 if (ncount > nmax) reallocate(ncount); in compute_local()
126 size_local_rows = ncount; in compute_local()
144 int ncount = 0; in compute_body() local
162 ncount = 0; in compute_body()
177 ncount++; in compute_body()
195 ncount++; in compute_body()
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/FMATCH/
H A Dfm_main.c83 int ncount, ecount; local
100 ncount = nnodes_want;
171 dump_dual (thedual, ncount);
345 if (*ncount != 0 && k != *ncount) {
350 *ncount = k;
393 *ecount = *ncount;
401 *ncount, CCutil_lprand () % (*ncount), dat,
513 int ncount;
525 for (k = 0; k < ncount; k++)
535 int ncount;
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/KDTREE/
H A Dkdspan.c102 int ncount;
218 int ncount;
345 if (ncount >= 10000)
400 int ncount;
522 if (ncount >= 10000)
559 int ncount;
644 for (i = 0; i < ncount && count < ncount; i++) {
699 if (ncount >= 10000)
731 int ncount;
805 getemcount = ncount;
[all …]
H A Dkd_main.c78 int ncount; local
102 ncount = nnodes_want;
132 ttour = CC_SAFE_MALLOC (ncount, int);
139 tour2 = CC_SAFE_MALLOC (ncount, int);
181 for (i = 0; i < ncount; i++)
183 for (i = 0; i < ncount; i++) {
266 for (i = 0; i < ncount; i++)
268 for (i = 0; i < ncount; i++) {
289 ecount = ncount - 1;
332 ecount = ncount;
[all …]
/dports/math/concorde/concorde/HELDKARP/
H A Dheldkarp.c119 ecount = ncount * (ncount-1) / 2; in CCheldkarp_small()
180 if (ncount > MAX_NODES) { in CCheldkarp_small_elist()
194 padjlist = CC_SAFE_MALLOC ((ncount-1)*(ncount-1), int); in CCheldkarp_small_elist()
202 for (i=0, p = padjlist; i<ncount-1; i++, p += (ncount-1)) { in CCheldkarp_small_elist()
205 for (i = 0; i < (ncount-1)*(ncount-1); i++) padjlist[i] = 0; in CCheldkarp_small_elist()
254 for (i = 0; i < ncount; i++) { in CCheldkarp_small_elist()
284 for (i = 0; i < ncount; i++) { in initial_y()
425 for (i = 1; i < ncount; i++) { in one_tree()
450 tree[ncount-2] = emin1; in one_tree()
451 tree[ncount-1] = emin2; in one_tree()
[all …]
/dports/math/concorde/concorde/TSP/
H A Dtsp_call.c207 perm_bound (&val, ncount, &dat); in CCtsp_solve_dat()
213 for (i = 0; i < ncount; i++) { in CCtsp_solve_dat()
346 int ncount = lp->graph.ncount; in tsp_solve_lp() local
418 if (ncount >= 100000) { in tsp_solve_lp()
522 kicks = (ncount > 400 ? 100 : ncount/4); in find_good_tour()
524 kicks = (ncount > 1000 ? 500 : ncount/2); in find_good_tour()
553 if (tcount != ncount) { in find_good_tour()
569 rval = CClinkern_tour (ncount, dat, ecount, elist, ncount, kicks, in find_good_tour()
578 rval = CClinkern_tour (ncount, dat, ecount, elist, ncount, kicks, in find_good_tour()
592 rval = CClinkern_tour (ncount, dat, ecount, elist, ncount, 2 * kicks, in find_good_tour()
[all …]
H A Dconcorde.c219 if (ncount < 10) { in main()
229 ncount = nnodes_want; in main()
247 if (ncount < 3) { in main()
249 ncount); in main()
255 if (ncount == 3) { in main()
872 kicks = (ncount > 400 ? 100 : ncount/4); in find_tour()
874 kicks = (ncount > 1000 ? 500 : ncount/2); in find_tour()
899 if (tcount != ncount) { in find_tour()
912 rval = CClinkern_tour (ncount, dat, ecount, elist, ncount, kicks, in find_tour()
919 rval = CClinkern_tour (ncount, dat, ecount, elist, ncount, kicks, in find_tour()
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/LINKERN/
H A Dlk_main.c60 randcycle (int ncount, int *cyc),
84 int k, ncount; local
121 ncount = nnodes_want;
134 incycle = CC_SAFE_MALLOC (ncount, int);
416 CCutil_freedatagroup (ncount, &dat);
429 static void setupnames (n1, n2, ncount) in setupnames()
432 int ncount;
452 static void randcycle (ncount, cyc) in randcycle()
453 int ncount; in randcycle()
459 for (i = 0; i < ncount; i++)
[all …]
/dports/math/concorde/concorde/KDTREE/
H A Dkdspan.c151 for (i = 0; i < ncount; i++) in CCkdtree_prim_spanningtree()
158 for (i = 1; i < ncount; i++) { in CCkdtree_prim_spanningtree()
337 if (ncount >= 10000) in CCkdtree_greedy_tour()
503 if (ncount >= 10000) in CCkdtree_far_add_tour()
609 while (count < ncount) { in CCkdtree_qboruvka_tour()
610 for (i = 0; i < ncount && count < ncount; i++) { in CCkdtree_qboruvka_tour()
665 if (ncount >= 10000) in CCkdtree_qboruvka_tour()
766 getemcount = ncount; in CCkdtree_boruvka_tour()
776 while (count < ncount) { in CCkdtree_boruvka_tour()
858 if (ncount >= 10000) in CCkdtree_boruvka_tour()
[all …]
H A Dkd_main.c78 int ncount; in main() local
106 ncount = nnodes_want; in main()
141 ttour = CC_SAFE_MALLOC (ncount, int); in main()
148 tour2 = CC_SAFE_MALLOC (ncount, int); in main()
185 marks = CC_SAFE_MALLOC (ncount, char); in main()
190 for (i = 0; i < ncount; i++) in main()
192 for (i = 0; i < ncount; i++) { in main()
275 for (i = 0; i < ncount; i++) in main()
277 for (i = 0; i < ncount; i++) { in main()
298 ecount = ncount - 1; in main()
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/TSP/
H A Dconcorde.c96 int i, ncount; local
134 ncount = nnodes_want;
184 if (ncount < 10) {
395 for (i = 0; i < ncount; i++) {
664 int ncount; in find_good_tour()
688 kicks = (ncount > 400 ? 100 : ncount/4);
690 kicks = (ncount > 1000 ? 500 : ncount/2);
720 if (tcount != ncount) {
732 rval = CClinkern_tour (ncount, dat, ecount, elist, ncount, kicks,
739 rval = CClinkern_tour (ncount, dat, ecount, elist, ncount, kicks,
[all …]
H A Dxtour.c51 int ncount, ecount;
71 gcyc = CC_SAFE_MALLOC (ncount, int);
92 rval = CClinkern_tour (ncount, dat, tcount, tlist, ncount,
93 ncount > 1000 ? 500 : ncount/2, gcyc, cyc, val, 0, 0.0,
112 int ncount, ecount;
138 degree = CC_SAFE_MALLOC (ncount, char);
139 tail = CC_SAFE_MALLOC (ncount, int);
140 tcyc = CC_SAFE_MALLOC (2 * ncount, int);
146 for (i = 0; i < ncount; i++) {
173 while (tcount < (2*ncount - 2)) {
[all …]
/dports/math/concorde/concorde/TOOLS/
H A Dfconvert.c58 int ncount = 0, ecount = 0; in main() local
102 if (dumpdat (ncount, xcoord, ycoord)) in main()
246 *ncount = CCutil_readint (in); in getgraph()
288 if (edgefile && i != *ncount) { in getgraph()
298 *ncount = i; in getgraph()
360 if (edgefile && i != *ncount) { in getgraph()
369 *ncount = i; in getgraph()
417 if (CCutil_swrite_int (f, ncount)) { in dumpedges()
473 for (i = 0; i < ncount; i++) { in dumpdat()
492 fprintf (out, "%d\n", ncount); in dumpdat()
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/src/MISC/
H A Dfix_pair_tracker.cpp124 ncount = 0; in FixPairTracker()
154 ncount = 0; in init()
156 if (ncount > nmax) reallocate(ncount); in init()
158 size_local_rows = ncount; in init()
179 if (ncount == nmax) reallocate(ncount); in lost_contact()
196 ncount += 1; in lost_contact()
205 ncount = 0; in post_force()
257 vector[ncount] = time; in pack_time_broken()
259 array[ncount][n] = time; in pack_time_broken()
338 vector[ncount] = rmin; in pack_rmin()
[all …]
/dports/math/concorde/concorde/INCLUDE/
H A Dedgegen.h85 CCedgegen_edges (CCedgegengroup *plan, int ncount, CCdatagroup *dat,
110 CCedgegen_x_k_nearest (int ncount, int num, CCdatagroup *dat,
112 CCedgegen_x_quadrant_k_nearest (int ncount, int num, CCdatagroup *dat,
114 CCedgegen_x_node_k_nearest (CCxnear *xn, int n, int nearnum, int ncount,
117 int ncount, int *list),
121 CCedgegen_x_greedy_tour (int ncount, CCdatagroup *dat, int *outcycle,
123 CCedgegen_x_qboruvka_tour (int ncount, CCdatagroup *dat, int *outcycle,
125 CCedgegen_junk_k_nearest (int ncount, int num, CCdatagroup *dat,
128 int nearnum, int ncount, int *list),
131 CCedgegen_junk_nearest_neighbor_tour (int ncount, int start,
[all …]
/dports/math/concorde/concorde/FMATCH/
H A Dfm_main.c64 dump_dual (int *thedual, int ncount),
77 int ncount, ecount; in main() local
99 ncount = nnodes_want; in main()
179 dump_dual (thedual, ncount); in main()
181 dump_basis (thebasis, ncount); in main()
334 if (*ncount != 0 && k != *ncount) { in getgraph()
339 *ncount = k; in getgraph()
383 *ecount = *ncount; in getgraph()
391 *ncount, CCutil_lprand (rstate) % (*ncount), dat, in getgraph()
507 for (k = 0; k < ncount; k++) in dump_dual()
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/MATCH/
H A Dmp_main.c85 int ncount; local
112 ncount = 0;
136 printf ("Number of nodes: %d\n", ncount);
186 for (i = 0; i < ncount/2; i++ )
211 CCutil_freedatagroup (ncount, &dat);
324 int ncount;
337 if (mcount != ncount / 2) {
363 int ncount;
372 int bcount = 3 * ncount/2;
407 for (i = 0; i < ncount; i++) {
[all …]
/dports/math/openturns/openturns-1.18/lib/src/Base/Diff/Ev3/
H A Dtree.h44 Int* ncount; variable
52 ncount = new Int(1); in Pointer()
79 ncount = NULL; in Pointer()
90 ncount = t.ncount; in SetTo()
91 (*ncount)++; in SetTo()
97 ncount = NULL; in Pointer()
118 assert(ncount); in SetToCopyOf()
119 ncount--; in SetToCopyOf()
137 if (ncount) in Destroy()
146 delete ncount; in Destroy() local
[all …]
/dports/math/concorde/concorde/LINKERN/
H A Dlk_main.c79 randcycle (int ncount, int *cyc, CCrandstate *rstate),
85 int k, ncount; in main() local
118 if (CCutil_gettsplib (nodefile, &ncount, &dat)) { in main()
125 ncount = nnodes_want; in main()
143 if (in_repeater == -1) in_repeater = ncount; in main()
145 incycle = CC_SAFE_MALLOC (ncount, int); in main()
323 randcycle (ncount, incycle, &rstate); in main()
369 randcycle (ncount, incycle, &rstate); in main()
386 outcycle = CC_SAFE_MALLOC (ncount, int); in main()
470 for (i = 0; i < ncount; i++) in randcycle()
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/INCLUDE/
H A Dkdtree.h37 CCkdtree_delete_all (CCkdtree *kt, int ncount),
39 CCkdtree_undelete_all (CCkdtree *kt, int ncount);
44 CCkdtree_quadrant_k_nearest (CCkdtree *kt, int ncount, int k,
47 CCkdtree_node_k_nearest (CCkdtree *kt, int ncount, int n, int k,
56 CCkdtree_nearest_neighbor_tour (CCkdtree *kt, int ncount, int start,
62 CCkdtree_greedy_tour (CCkdtree *kt, int ncount, CCdatagroup *dat,
64 CCkdtree_far_add_tour (CCkdtree *kt, int ncount, int start,
66 CCkdtree_qboruvka_tour (CCkdtree *kt, int ncount, CCdatagroup *dat,
68 CCkdtree_boruvka_tour (CCkdtree *kt, int ncount, CCdatagroup *dat,
70 CCkdtree_twoopt_tour (CCkdtree *kt, int ncount, CCdatagroup *dat,
[all …]

12345678910>>...52