/dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Mumps/MUMPS/PORD/lib/ |
H A D | gelim.c | 109 { gelim_t *Gelim; in newElimGraph() local 121 return(Gelim); in newElimGraph() 131 free(Gelim->len); in freeElimGraph() 136 free(Gelim); in freeElimGraph() 147 G = Gelim->G; in printElimGraph() 156 if ((Gelim->score[u] == -1) || (Gelim->score[u] >= 0)) in printElimGraph() 193 "\n", u, Gelim->degree[u], Gelim->score[u]); in printElimGraph() 230 { gelim_t *Gelim; in setupElimGraph() local 245 len = Gelim->len; in setupElimGraph() 295 return(Gelim); in setupElimGraph() [all …]
|
H A D | minpriority.c | 87 minprior->Gelim = NULL; in newMinPriority() 233 { gelim_t *Gelim; in eliminateStage() local 240 Gelim = minprior->Gelim; in eliminateStage() 250 nvtx = Gelim->G->nvtx; in eliminateStage() 252 score = Gelim->score; in eliminateStage() 256 Gelim->G->nedges, Gelim->maxedges); in eliminateStage() 362 { gelim_t *Gelim; in eliminateStep() local 370 Gelim = minprior->Gelim; in eliminateStep() 382 len = Gelim->len; in eliminateStep() 384 score = Gelim->score; in eliminateStep() [all …]
|
/dports/math/coinmumps/MUMPS_4.10.0/PORD/lib/ |
H A D | gelim.c | 109 { gelim_t *Gelim; in newElimGraph() local 121 return(Gelim); in newElimGraph() 131 free(Gelim->len); in freeElimGraph() 136 free(Gelim); in freeElimGraph() 147 G = Gelim->G; in printElimGraph() 156 if ((Gelim->score[u] == -1) || (Gelim->score[u] >= 0)) in printElimGraph() 193 "\n", u, Gelim->degree[u], Gelim->score[u]); in printElimGraph() 230 { gelim_t *Gelim; in setupElimGraph() local 245 len = Gelim->len; in setupElimGraph() 295 return(Gelim); in setupElimGraph() [all …]
|
H A D | minpriority.c | 87 minprior->Gelim = NULL; in newMinPriority() 233 { gelim_t *Gelim; in eliminateStage() local 240 Gelim = minprior->Gelim; in eliminateStage() 250 nvtx = Gelim->G->nvtx; in eliminateStage() 252 score = Gelim->score; in eliminateStage() 256 Gelim->G->nedges, Gelim->maxedges); in eliminateStage() 362 { gelim_t *Gelim; in eliminateStep() local 370 Gelim = minprior->Gelim; in eliminateStep() 382 len = Gelim->len; in eliminateStep() 384 score = Gelim->score; in eliminateStep() [all …]
|
/dports/math/mumps4/MUMPS_4.10.0/PORD/lib/ |
H A D | gelim.c | 109 { gelim_t *Gelim; in newElimGraph() local 121 return(Gelim); in newElimGraph() 131 free(Gelim->len); in freeElimGraph() 136 free(Gelim); in freeElimGraph() 147 G = Gelim->G; in printElimGraph() 156 if ((Gelim->score[u] == -1) || (Gelim->score[u] >= 0)) in printElimGraph() 193 "\n", u, Gelim->degree[u], Gelim->score[u]); in printElimGraph() 230 { gelim_t *Gelim; in setupElimGraph() local 245 len = Gelim->len; in setupElimGraph() 295 return(Gelim); in setupElimGraph() [all …]
|
H A D | minpriority.c | 87 minprior->Gelim = NULL; in newMinPriority() 233 { gelim_t *Gelim; in eliminateStage() local 240 Gelim = minprior->Gelim; in eliminateStage() 250 nvtx = Gelim->G->nvtx; in eliminateStage() 252 score = Gelim->score; in eliminateStage() 256 Gelim->G->nedges, Gelim->maxedges); in eliminateStage() 362 { gelim_t *Gelim; in eliminateStep() local 370 Gelim = minprior->Gelim; in eliminateStep() 382 len = Gelim->len; in eliminateStep() 384 score = Gelim->score; in eliminateStep() [all …]
|
/dports/math/mumps/mumps-5.1.2/PORD/lib/ |
H A D | gelim.c | 109 { gelim_t *Gelim; in newElimGraph() local 121 return(Gelim); in newElimGraph() 131 free(Gelim->len); in freeElimGraph() 136 free(Gelim); in freeElimGraph() 147 G = Gelim->G; in printElimGraph() 156 if ((Gelim->score[u] == -1) || (Gelim->score[u] >= 0)) in printElimGraph() 193 "\n", u, Gelim->degree[u], Gelim->score[u]); in printElimGraph() 230 { gelim_t *Gelim; in setupElimGraph() local 245 len = Gelim->len; in setupElimGraph() 295 return(Gelim); in setupElimGraph() [all …]
|
H A D | minpriority.c | 87 minprior->Gelim = NULL; in newMinPriority() 233 { gelim_t *Gelim; in eliminateStage() local 240 Gelim = minprior->Gelim; in eliminateStage() 250 nvtx = Gelim->G->nvtx; in eliminateStage() 252 score = Gelim->score; in eliminateStage() 256 Gelim->G->nedges, Gelim->maxedges); in eliminateStage() 362 { gelim_t *Gelim; in eliminateStep() local 370 Gelim = minprior->Gelim; in eliminateStep() 382 len = Gelim->len; in eliminateStep() 384 score = Gelim->score; in eliminateStep() [all …]
|
/dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Mumps/MUMPS/PORD/include/ |
H A D | types.h | 118 gelim_t *Gelim; member
|
H A D | protos.h | 93 void buildElement(gelim_t *Gelim, int me);
|
/dports/math/coinmumps/MUMPS_4.10.0/PORD/include/ |
H A D | types.h | 118 gelim_t *Gelim; member
|
H A D | protos.h | 93 void buildElement(gelim_t *Gelim, int me);
|
/dports/math/mumps4/MUMPS_4.10.0/PORD/include/ |
H A D | types.h | 118 gelim_t *Gelim; member
|
H A D | protos.h | 93 void buildElement(gelim_t *Gelim, int me);
|
/dports/math/mumps/mumps-5.1.2/PORD/include/ |
H A D | types.h | 128 gelim_t *Gelim; member
|
H A D | protos.h | 93 void buildElement(gelim_t *Gelim, PORD_INT me);
|
/dports/devel/cld2/cld-20150505/internal/ |
H A D | test_shuffle_1000_48_666.utf8 | 95961 …ünärmenleri taýýarlaýar. Uniwersitetimiziň ~ başlanam bolsa ýygjam däldi. Gelim-gidim iki-üç ~ enç…
|