/dports/science/berkeleygw/BGW-2.0.0/Common/qhull/ |
H A D | merge.h | 130 vertexT *qh_find_newvertex(vertexT *oldvertex, setT *vertices, setT *ridges); 138 void qh_hashridge(setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 140 vertexT *vertex, vertexT *oldvertex, int *hashslot); 166 void qh_renameridgevertex(ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 167 void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
H A D | merge.c | 783 oldvertex->id); in qh_find_newvertex() 806 oldvertex->id)); in qh_find_newvertex() 840 oldvertex->id, qh furthest_id)); in qh_find_newvertex() 3222 oldvertex->id, newvertex->id); in qh_renamevertex() 3223 FOREACHneighbor_(oldvertex) { in qh_renamevertex() 3229 if (!oldvertex->deleted) { in qh_renamevertex() 3230 oldvertex->deleted= True; in qh_renamevertex() 3238 FOREACHneighbor_(oldvertex) in qh_renamevertex() 3240 oldvertex->deleted= True; in qh_renamevertex() 3241 qh_setappend(&qh del_vertices, oldvertex); in qh_renamevertex() [all …]
|
/dports/science/afni/afni-AFNI_21.3.16/src/qhulldir/ |
H A D | merge.h | 130 vertexT *qh_find_newvertex(vertexT *oldvertex, setT *vertices, setT *ridges); 138 void qh_hashridge(setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 140 vertexT *vertex, vertexT *oldvertex, int *hashslot); 166 void qh_renameridgevertex(ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 167 void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
H A D | merge.c | 783 oldvertex->id); in qh_find_newvertex() 806 oldvertex->id)); in qh_find_newvertex() 840 oldvertex->id, qh furthest_id)); in qh_find_newvertex() 3222 oldvertex->id, newvertex->id); in qh_renamevertex() 3223 FOREACHneighbor_(oldvertex) { in qh_renamevertex() 3229 if (!oldvertex->deleted) { in qh_renamevertex() 3230 oldvertex->deleted= True; in qh_renamevertex() 3238 FOREACHneighbor_(oldvertex) in qh_renamevertex() 3240 oldvertex->deleted= True; in qh_renamevertex() 3241 qh_setappend(&qh del_vertices, oldvertex); in qh_renamevertex() [all …]
|
/dports/math/py-matplotlib2/matplotlib-2.2.4/extern/libqhull/ |
H A D | merge.h | 130 vertexT *qh_find_newvertex(vertexT *oldvertex, setT *vertices, setT *ridges); 138 void qh_hashridge(setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 140 vertexT *vertex, vertexT *oldvertex, int *hashslot); 166 void qh_renameridgevertex(ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 167 void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
H A D | merge.c | 783 oldvertex->id); in qh_find_newvertex() 806 oldvertex->id)); in qh_find_newvertex() 840 oldvertex->id, qh furthest_id)); in qh_find_newvertex() 3227 oldvertex->id, newvertex->id); in qh_renamevertex() 3228 FOREACHneighbor_(oldvertex) { in qh_renamevertex() 3234 if (!oldvertex->deleted) { in qh_renamevertex() 3235 oldvertex->deleted= True; in qh_renamevertex() 3243 FOREACHneighbor_(oldvertex) in qh_renamevertex() 3245 oldvertex->deleted= True; in qh_renamevertex() 3246 qh_setappend(&qh del_vertices, oldvertex); in qh_renamevertex() [all …]
|
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/external/qhull-2003.1/src/ |
H A D | merge.h | 126 vertexT *qh_find_newvertex (vertexT *oldvertex, setT *vertices, setT *ridges); 134 void qh_hashridge (setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 136 vertexT *vertex, vertexT *oldvertex, int *hashslot); 162 void qh_renameridgevertex(ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 163 void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
H A D | merge.c | 781 oldvertex->id); in qh_find_newvertex() 804 oldvertex->id)); in qh_find_newvertex() 838 oldvertex->id, qh furthest_id)); in qh_find_newvertex() 3218 oldvertex->id, newvertex->id); in qh_renamevertex() 3219 FOREACHneighbor_(oldvertex) { in qh_renamevertex() 3225 if (!oldvertex->deleted) { in qh_renamevertex() 3226 oldvertex->deleted= True; in qh_renamevertex() 3234 FOREACHneighbor_(oldvertex) in qh_renamevertex() 3236 oldvertex->deleted= True; in qh_renamevertex() 3237 qh_setappend (&qh del_vertices, oldvertex); in qh_renamevertex() [all …]
|
/dports/math/libmesh/libmesh-1.6.2/contrib/qhull/2012.1/src/libqhull/ |
H A D | merge.h | 130 vertexT *qh_find_newvertex(vertexT *oldvertex, setT *vertices, setT *ridges); 138 void qh_hashridge(setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 140 vertexT *vertex, vertexT *oldvertex, int *hashslot); 166 void qh_renameridgevertex(ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 167 void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
H A D | merge.c | 783 oldvertex->id); in qh_find_newvertex() 806 oldvertex->id)); in qh_find_newvertex() 840 oldvertex->id, qh furthest_id)); in qh_find_newvertex() 3222 oldvertex->id, newvertex->id); in qh_renamevertex() 3223 FOREACHneighbor_(oldvertex) { in qh_renamevertex() 3229 if (!oldvertex->deleted) { in qh_renamevertex() 3230 oldvertex->deleted= True; in qh_renamevertex() 3238 FOREACHneighbor_(oldvertex) in qh_renamevertex() 3240 oldvertex->deleted= True; in qh_renamevertex() 3241 qh_setappend(&qh del_vertices, oldvertex); in qh_renamevertex() [all …]
|
/dports/graphics/py-gdal/gdal-3.3.3/alg/internal_libqhull/ |
H A D | merge.h | 130 vertexT *qh_find_newvertex(vertexT *oldvertex, setT *vertices, setT *ridges); 138 void qh_hashridge(setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 140 vertexT *vertex, vertexT *oldvertex, int *hashslot); 166 void qh_renameridgevertex(ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 167 void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
H A D | merge.c | 783 oldvertex->id); in qh_find_newvertex() 806 oldvertex->id)); in qh_find_newvertex() 840 oldvertex->id, qh furthest_id)); in qh_find_newvertex() 3222 oldvertex->id, newvertex->id); in qh_renamevertex() 3223 FOREACHneighbor_(oldvertex) { in qh_renamevertex() 3229 if (!oldvertex->deleted) { in qh_renamevertex() 3230 oldvertex->deleted= True; in qh_renamevertex() 3238 FOREACHneighbor_(oldvertex) in qh_renamevertex() 3240 oldvertex->deleted= True; in qh_renamevertex() 3241 qh_setappend(&qh del_vertices, oldvertex); in qh_renamevertex() [all …]
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/qhull/src/libqhull/ |
H A D | merge.h | 130 vertexT *qh_find_newvertex(vertexT *oldvertex, setT *vertices, setT *ridges); 138 void qh_hashridge(setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 140 vertexT *vertex, vertexT *oldvertex, int *hashslot); 166 void qh_renameridgevertex(ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 167 void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
H A D | merge.c | 783 oldvertex->id); in qh_find_newvertex() 806 oldvertex->id)); in qh_find_newvertex() 840 oldvertex->id, qh furthest_id)); in qh_find_newvertex() 3227 oldvertex->id, newvertex->id); in qh_renamevertex() 3228 FOREACHneighbor_(oldvertex) { in qh_renamevertex() 3234 if (!oldvertex->deleted) { in qh_renamevertex() 3235 oldvertex->deleted= True; in qh_renamevertex() 3243 FOREACHneighbor_(oldvertex) in qh_renamevertex() 3245 oldvertex->deleted= True; in qh_renamevertex() 3246 qh_setappend(&qh del_vertices, oldvertex); in qh_renamevertex() [all …]
|
/dports/math/py-pyhull/pyhull-2015.2.1/src/libqhull/ |
H A D | merge.h | 130 vertexT *qh_find_newvertex(vertexT *oldvertex, setT *vertices, setT *ridges); 138 void qh_hashridge(setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 140 vertexT *vertex, vertexT *oldvertex, int *hashslot); 166 void qh_renameridgevertex(ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 167 void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
/dports/graphics/p5-Geo-GDAL/gdal-3.3.3/alg/internal_libqhull/ |
H A D | merge.h | 130 vertexT *qh_find_newvertex(vertexT *oldvertex, setT *vertices, setT *ridges); 138 void qh_hashridge(setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 140 vertexT *vertex, vertexT *oldvertex, int *hashslot); 166 void qh_renameridgevertex(ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 167 void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
/dports/math/qhull8/qhull-8.0.2/src/libqhull/ |
H A D | merge.h | 161 vertexT *qh_find_newvertex(vertexT *oldvertex, setT *vertices, setT *ridges); 174 void qh_hashridge(setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 176 vertexT *vertex, vertexT *oldvertex, int *hashslot); 211 void qh_rename_adjacentvertex(vertexT *oldvertex, vertexT *newvertex, realT dist); 213 boolT qh_renameridgevertex(ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 214 void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
H A D | merge.c | 1120 oldvertex->id); in qh_find_newvertex() 1152 oldvertex->id)); in qh_find_newvertex() 4498 oldvertex->id, oldvertex->deleted, newvertex->id, newvertex->deleted); in qh_rename_adjacentvertex() 4507 FOREACHneighbor_(oldvertex) { in qh_rename_adjacentvertex() 4528 FOREACHneighbor_(oldvertex) { in qh_rename_adjacentvertex() 4541 if (oldvertex->deleted && !oldvertex->partitioned) { in qh_rename_adjacentvertex() 4552 qh_pointid(oldvertex->point), oldvertex->id, maxfacet->id, maxdist2)) in qh_rename_adjacentvertex() 4554 oldvertex->partitioned= True; in qh_rename_adjacentvertex() 4783 if (!oldvertex->deleted) { in qh_renamevertex() 4784 oldvertex->deleted= True; in qh_renamevertex() [all …]
|
/dports/math/qhull/qhull-7.3.2/src/libqhull/ |
H A D | merge.h | 161 vertexT *qh_find_newvertex(vertexT *oldvertex, setT *vertices, setT *ridges); 174 void qh_hashridge(setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 176 vertexT *vertex, vertexT *oldvertex, int *hashslot); 211 void qh_rename_adjacentvertex(vertexT *oldvertex, vertexT *newvertex, realT dist); 213 boolT qh_renameridgevertex(ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 214 void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
H A D | merge.c | 1120 oldvertex->id); in qh_find_newvertex() 1152 oldvertex->id)); in qh_find_newvertex() 4498 oldvertex->id, oldvertex->deleted, newvertex->id, newvertex->deleted); in qh_rename_adjacentvertex() 4507 FOREACHneighbor_(oldvertex) { in qh_rename_adjacentvertex() 4528 FOREACHneighbor_(oldvertex) { in qh_rename_adjacentvertex() 4541 if (oldvertex->deleted && !oldvertex->partitioned) { in qh_rename_adjacentvertex() 4552 qh_pointid(oldvertex->point), oldvertex->id, maxfacet->id, maxdist2)) in qh_rename_adjacentvertex() 4554 oldvertex->partitioned= True; in qh_rename_adjacentvertex() 4783 if (!oldvertex->deleted) { in qh_renamevertex() 4784 oldvertex->deleted= True; in qh_renamevertex() [all …]
|
/dports/math/R-cran-geometry/geometry/src/ |
H A D | merge_r.h | 134 vertexT *qh_find_newvertex(qhT *qh, vertexT *oldvertex, setT *vertices, setT *ridges); 142 void qh_hashridge(qhT *qh, setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 144 vertexT *vertex, vertexT *oldvertex, int *hashslot); 170 void qh_renameridgevertex(qhT *qh, ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 171 void qh_renamevertex(qhT *qh, vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/qhull/src/libqhull_r/ |
H A D | merge_r.h | 134 vertexT *qh_find_newvertex(qhT *qh, vertexT *oldvertex, setT *vertices, setT *ridges); 142 void qh_hashridge(qhT *qh, setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 144 vertexT *vertex, vertexT *oldvertex, int *hashslot); 170 void qh_renameridgevertex(qhT *qh, ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 171 void qh_renamevertex(qhT *qh, vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
/dports/science/py-scipy/scipy-1.7.1/scipy/spatial/qhull_src/src/ |
H A D | merge_r.h | 165 vertexT *qh_find_newvertex(qhT *qh, vertexT *oldvertex, setT *vertices, setT *ridges); 178 void qh_hashridge(qhT *qh, setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 180 vertexT *vertex, vertexT *oldvertex, int *hashslot); 215 void qh_rename_adjacentvertex(qhT *qh, vertexT *oldvertex, vertexT *newvertex, realT dist); 217 boolT qh_renameridgevertex(qhT *qh, ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 218 void qh_renamevertex(qhT *qh, vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|
/dports/math/qhull8/qhull-8.0.2/src/libqhull_r/ |
H A D | merge_r.h | 165 vertexT *qh_find_newvertex(qhT *qh, vertexT *oldvertex, setT *vertices, setT *ridges); in w1_gpio_triplet() 178 void qh_hashridge(qhT *qh, setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); in w1_gpio_triplet() 180 vertexT *vertex, vertexT *oldvertex, int *hashslot); in w1_gpio_triplet() 215 void qh_rename_adjacentvertex(qhT *qh, vertexT *oldvertex, vertexT *newvertex, realT dist); in w1_gpio_triplet() 217 boolT qh_renameridgevertex(qhT *qh, ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); in w1_gpio_triplet() 218 void qh_renamevertex(qhT *qh, vertexT *oldvertex, vertexT *newvertex, setT *ridges, in w1_gpio_triplet()
|
/dports/math/qhull/qhull-7.3.2/src/libqhull_r/ |
H A D | merge_r.h | 165 vertexT *qh_find_newvertex(qhT *qh, vertexT *oldvertex, setT *vertices, setT *ridges); 178 void qh_hashridge(qhT *qh, setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex); 180 vertexT *vertex, vertexT *oldvertex, int *hashslot); 215 void qh_rename_adjacentvertex(qhT *qh, vertexT *oldvertex, vertexT *newvertex, realT dist); 217 boolT qh_renameridgevertex(qhT *qh, ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex); 218 void qh_renamevertex(qhT *qh, vertexT *oldvertex, vertexT *newvertex, setT *ridges,
|