Home
last modified time | relevance | path

Searched refs:newcost (Results 1 – 25 of 164) sorted by relevance

1234567

/dports/math/spooles-mpich/spooles.2.2/GPart/src/
H A DsmoothBy2layers.c33 float bestcost, newcost ; in GPart_smoothBy2layers() local
89 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBy2layers()
92 "\n\n bestcost = %.2f, newcost = %.2f", bestcost, newcost) ; in GPart_smoothBy2layers()
97 if ( newcost == bestcost ) { in GPart_smoothBy2layers()
125 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBy2layers()
128 "\n\n bestcost = %.2f, newcost = %.2f", bestcost, newcost) ; in GPart_smoothBy2layers()
134 if ( newcost == bestcost ) { in GPart_smoothBy2layers()
141 bestcost = newcost ; in GPart_smoothBy2layers()
H A DsmoothBisector.c32 float balance, bestcost, cost, newcost ; in GPart_smoothBisector() local
115 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBisector()
117 fprintf(msgFile, "\n newcost = %.3f", newcost) ; in GPart_smoothBisector()
132 if ( newcost == bestcost ) { in GPart_smoothBisector()
135 bestcost = newcost ; in GPart_smoothBisector()
/dports/math/spooles-mpich/spooles.2.2_SHARED/GPart/src/
H A DsmoothBy2layers.c33 float bestcost, newcost ; in GPart_smoothBy2layers() local
89 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBy2layers()
92 "\n\n bestcost = %.2f, newcost = %.2f", bestcost, newcost) ; in GPart_smoothBy2layers()
97 if ( newcost == bestcost ) { in GPart_smoothBy2layers()
125 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBy2layers()
128 "\n\n bestcost = %.2f, newcost = %.2f", bestcost, newcost) ; in GPart_smoothBy2layers()
134 if ( newcost == bestcost ) { in GPart_smoothBy2layers()
141 bestcost = newcost ; in GPart_smoothBy2layers()
H A DsmoothBisector.c32 float balance, bestcost, cost, newcost ; in GPart_smoothBisector() local
115 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBisector()
117 fprintf(msgFile, "\n newcost = %.3f", newcost) ; in GPart_smoothBisector()
132 if ( newcost == bestcost ) { in GPart_smoothBisector()
135 bestcost = newcost ; in GPart_smoothBisector()
/dports/math/spooles/spooles.2.2_SHARED/GPart/src/
H A DsmoothBy2layers.c33 float bestcost, newcost ; in GPart_smoothBy2layers() local
89 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBy2layers()
92 "\n\n bestcost = %.2f, newcost = %.2f", bestcost, newcost) ; in GPart_smoothBy2layers()
97 if ( newcost == bestcost ) { in GPart_smoothBy2layers()
125 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBy2layers()
128 "\n\n bestcost = %.2f, newcost = %.2f", bestcost, newcost) ; in GPart_smoothBy2layers()
134 if ( newcost == bestcost ) { in GPart_smoothBy2layers()
141 bestcost = newcost ; in GPart_smoothBy2layers()
H A DsmoothBisector.c32 float balance, bestcost, cost, newcost ; in GPart_smoothBisector() local
115 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBisector()
117 fprintf(msgFile, "\n newcost = %.3f", newcost) ; in GPart_smoothBisector()
132 if ( newcost == bestcost ) { in GPart_smoothBisector()
135 bestcost = newcost ; in GPart_smoothBisector()
/dports/math/spooles/spooles.2.2/GPart/src/
H A DsmoothBy2layers.c33 float bestcost, newcost ; in GPart_smoothBy2layers() local
89 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBy2layers()
92 "\n\n bestcost = %.2f, newcost = %.2f", bestcost, newcost) ; in GPart_smoothBy2layers()
97 if ( newcost == bestcost ) { in GPart_smoothBy2layers()
125 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBy2layers()
128 "\n\n bestcost = %.2f, newcost = %.2f", bestcost, newcost) ; in GPart_smoothBy2layers()
134 if ( newcost == bestcost ) { in GPart_smoothBy2layers()
141 bestcost = newcost ; in GPart_smoothBy2layers()
H A DsmoothBisector.c32 float balance, bestcost, cost, newcost ; in GPart_smoothBisector() local
115 newcost = GPart_smoothYSep(gpart, YVmapIV, YCmapIV, alpha) ; in GPart_smoothBisector()
117 fprintf(msgFile, "\n newcost = %.3f", newcost) ; in GPart_smoothBisector()
132 if ( newcost == bestcost ) { in GPart_smoothBisector()
135 bestcost = newcost ; in GPart_smoothBisector()
/dports/math/spooles-mpich/spooles.2.2_SHARED/BKL/src/
H A DexhSearch.c31 float bestcost, newcost ; in BKL_exhSearch() local
115 newcost = BKL_evalfcn(bkl) ; in BKL_exhSearch()
119 newcost) ; in BKL_exhSearch()
122 if ( newcost < bestcost ) { in BKL_exhSearch()
131 bestcost = newcost ; in BKL_exhSearch()
/dports/math/spooles-mpich/spooles.2.2/BKL/src/
H A DexhSearch.c31 float bestcost, newcost ; in BKL_exhSearch() local
115 newcost = BKL_evalfcn(bkl) ; in BKL_exhSearch()
119 newcost) ; in BKL_exhSearch()
122 if ( newcost < bestcost ) { in BKL_exhSearch()
131 bestcost = newcost ; in BKL_exhSearch()
/dports/math/spooles/spooles.2.2_SHARED/BKL/src/
H A DexhSearch.c31 float bestcost, newcost ; in BKL_exhSearch() local
115 newcost = BKL_evalfcn(bkl) ; in BKL_exhSearch()
119 newcost) ; in BKL_exhSearch()
122 if ( newcost < bestcost ) { in BKL_exhSearch()
131 bestcost = newcost ; in BKL_exhSearch()
/dports/math/spooles/spooles.2.2/BKL/src/
H A DexhSearch.c31 float bestcost, newcost ; in BKL_exhSearch() local
115 newcost = BKL_evalfcn(bkl) ; in BKL_exhSearch()
119 newcost) ; in BKL_exhSearch()
122 if ( newcost < bestcost ) { in BKL_exhSearch()
131 bestcost = newcost ; in BKL_exhSearch()
/dports/math/concorde/concorde/TOOLS/
H A Dlkhalone.c8 double newcost = -1; in main() local
58 if (sscanf (tb, "%lf", &newcost) == EOF) { in main()
68 if (newcost == -1) { in main()
73 printf ("New Tour Cost: %0.0f\n", newcost); fflush (stdout); in main()
/dports/databases/percona56-client/percona-server-5.6.51-91.0/sql/
H A Dsql_planner.h129 double *newcount, double *newcost);
133 double *newcount, double *newcost);
136 double *newcount, double *newcost);
140 double *newcount, double *newcost);
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/sql/
H A Dsql_planner.h129 double *newcount, double *newcost);
133 double *newcount, double *newcost);
136 double *newcount, double *newcost);
140 double *newcount, double *newcost);
/dports/databases/percona56-server/percona-server-5.6.51-91.0/sql/
H A Dsql_planner.h129 double *newcount, double *newcost);
133 double *newcount, double *newcost);
136 double *newcount, double *newcost);
140 double *newcount, double *newcost);
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/sql/
H A Dsql_planner.h129 double *newcount, double *newcost);
133 double *newcount, double *newcost);
136 double *newcount, double *newcost);
140 double *newcount, double *newcost);
/dports/databases/mysql56-client/mysql-5.6.51/sql/
H A Dsql_planner.h129 double *newcount, double *newcost);
133 double *newcount, double *newcost);
136 double *newcount, double *newcost);
140 double *newcount, double *newcost);
/dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/sql/
H A Dsql_planner.h159 double *newcost);
163 double *newcost);
165 double *newcount, double *newcost);
167 double *newcount, double *newcost);
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/Mongoose/Source/
H A DMongoose_Debug.cpp254 double newcost = 0.; in QPcheckCom() local
266 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
281 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
306 if (newcost / QP->check_cost > (1 + tol)) in QPcheckCom()
309 newcost)); in QPcheckCom()
312 QP->check_cost = newcost; in QPcheckCom()
313 PR(("cost: %30.15e\n", newcost)); in QPcheckCom()
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/Mongoose/Source/
H A DMongoose_Debug.cpp254 double newcost = 0.; in QPcheckCom() local
266 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
281 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
306 if (newcost / QP->check_cost > (1 + tol)) in QPcheckCom()
309 newcost)); in QPcheckCom()
312 QP->check_cost = newcost; in QPcheckCom()
313 PR(("cost: %30.15e\n", newcost)); in QPcheckCom()
/dports/math/suitesparse-config/SuiteSparse-5.10.1/Mongoose/Source/
H A DMongoose_Debug.cpp254 double newcost = 0.; in QPcheckCom() local
266 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
281 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
306 if (newcost / QP->check_cost > (1 + tol)) in QPcheckCom()
309 newcost)); in QPcheckCom()
312 QP->check_cost = newcost; in QPcheckCom()
313 PR(("cost: %30.15e\n", newcost)); in QPcheckCom()
/dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/Mongoose/Source/
H A DMongoose_Debug.cpp254 double newcost = 0.; in QPcheckCom() local
266 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
281 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
306 if (newcost / QP->check_cost > (1 + tol)) in QPcheckCom()
309 newcost)); in QPcheckCom()
312 QP->check_cost = newcost; in QPcheckCom()
313 PR(("cost: %30.15e\n", newcost)); in QPcheckCom()
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/Mongoose/Source/
H A DMongoose_Debug.cpp254 double newcost = 0.; in QPcheckCom() local
266 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
281 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
306 if (newcost / QP->check_cost > (1 + tol)) in QPcheckCom()
309 newcost)); in QPcheckCom()
312 QP->check_cost = newcost; in QPcheckCom()
313 PR(("cost: %30.15e\n", newcost)); in QPcheckCom()
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/Mongoose/Source/
H A DMongoose_Debug.cpp254 double newcost = 0.; in QPcheckCom() local
266 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
281 newcost += (t + x[j] * D[j]) * (1. - x[j]); in QPcheckCom()
306 if (newcost / QP->check_cost > (1 + tol)) in QPcheckCom()
309 newcost)); in QPcheckCom()
312 QP->check_cost = newcost; in QPcheckCom()
313 PR(("cost: %30.15e\n", newcost)); in QPcheckCom()

1234567