| /dports/math/concorde/concorde/TSP/ |
| H A D | prclique.c | 123 intptrfree, intptr_listadd, intptr_listfree) in CC_PTRWORLD_LIST_ROUTINES() argument
364 intptr_listfree (intptr_world, onelist); in search_component()
365 intptr_listfree (intptr_world, extralist); in search_component()
504 intptr_listfree (intptr_world, T); in check_comp()
506 intptr_listfree (intptr_world, u1); in check_comp()
563 intptr_listfree (intptr_world, T); in check_comp()
564 intptr_listfree (intptr_world, u1); in check_comp()
565 intptr_listfree (intptr_world, u2); in check_comp()
701 intptr_listfree (intptr_world, teeth); in grab_cliquetree()
1113 intptr_listfree (intptr_world, *u1); in divide_comp()
[all …]
|
| H A D | teething.c | 85 intptrfree, intptr_listadd, intptr_listfree) in CC_PTRWORLD_LIST_ROUTINES() argument
442 intptr_listfree (intptr_world, newteeth); in optimal_pseudocomb()
691 intptr_listfree (intptr_world, inteeth[k]); in clean_pseudocomb()
698 intptr_listfree (intptr_world, hlist); in clean_pseudocomb()
|
| H A D | growcomb.c | 95 intptrfree, intptr_listadd, intptr_listfree) in CC_PTRWORLD_LIST_ROUTINES() argument
282 intptr_listfree (&intptr_world, ones); in CC_PTRWORLD_LIST_ROUTINES()
|
| H A D | blkcomb.c | 109 intptrfree, intptr_listadd, intptr_listfree) in CC_PTRWORLD_LIST_ROUTINES() argument
426 intptr_listfree (&intptr_world, cutadj[i]); in block_combs_work()
|
| /dports/math/concorde/concorde/COMBS/ |
| H A D | block.c | 100 intptrfree, intptr_listadd, intptr_listfree) in CC_PTRWORLD_LIST_ROUTINES() argument
260 intptr_listfree (&G.intptr_world, clist); in CC_PTRWORLD_LIST_ROUTINES()
264 intptr_listfree (&G.intptr_world, ipp->this); in CC_PTRWORLD_LIST_ROUTINES()
|
| /dports/math/concorde/concorde/PQ/ |
| H A D | necklace.c | 142 intptr_free, intptr_listadd, intptr_listfree)
374 intptr_listfree (&g->intptr_world, nodelist[i].toroot); in neckgraph_free()
978 intptr_listfree (&g->intptr_world, sollst); in necklace_try_solutions()
985 intptr_listfree (&g->intptr_world, sollst); in necklace_try_solutions()
992 intptr_listfree (s->intptr_world, sys->lhs); in free_equation()
1090 intptr_listfree (intptr_world, sum); in intptr_add()
1184 intptr_listfree (intptr_world, a); in intptr_addto()
1185 intptr_listfree (intptr_world, sum); in intptr_addto()
1217 intptr_listfree (intptr_world, sum); in intptr_copy()
1906 intptr_listfree (s->intptr_world, *p_sollst); in binsys_list_solution()
[all …]
|
| /dports/math/concorde/concorde/EDGEGEN/ |
| H A D | delaunay.c | 143 intptrfree, intptr_listadd, intptr_listfree)
347 intptr_listfree (&dd.intptr_world, dd.table[i]); in CCedgegen_delaunay()
|
| H A D | xnear.c | 172 intptrfree, intptr_listadd, intptr_listfree) in CC_PTRWORLD_LIST_ROUTINES() argument
349 intptr_listfree (&td.intptr_world, td.table[i]); in run_x_k_nearest()
|
| H A D | edgegen.c | 200 intptrfree, intptr_listadd, intptr_listfree) in CC_PTRWORLD_LIST_ROUTINES() argument
|
| /dports/math/concorde/concorde/KDTREE/ |
| H A D | kdnear.c | 171 intptrfree, intptr_listadd, intptr_listfree) in CC_PTRWORLD_LIST_ROUTINES() argument
315 intptr_listfree (&intptr_world, table[i]); in run_kdtree_k_nearest()
|
| /dports/math/concorde/concorde/LINKERN/ |
| H A D | linkern_fixed.c | 232 CC_PTRWORLD_LISTFREE_ROUTINE(intptr, intptr_listfree, intptrfree) in CC_PTRWORLD_ROUTINES()
330 intptr_listfree (&intptr_world, G.fixlist[i]); in CC_PTRWORLD_ROUTINES()
1676 intptr_listfree (intptr_world, Q->active_queue);
|
| H A D | linkern_path.c | 236 CC_PTRWORLD_LISTFREE_ROUTINE(intptr, intptr_listfree, intptrfree) in CC_PTRWORLD_ROUTINES()
1728 intptr_listfree (intptr_world, Q->active_queue);
|
| H A D | linkern.c | 291 CC_PTRWORLD_LISTFREE_ROUTINE(intptr, intptr_listfree, intptrfree) in CC_PTRWORLD_ROUTINES()
2336 intptr_listfree (intptr_world, Q->active_queue);
|