/dports/math/osi/Osi-0.108.6/CoinUtils/src/ |
H A D | CoinPresolveIsolated.cpp | 45 CoinBigIndex krs = mrstrt[irow]; in presolve() local 55 for (k = krs; k < kre; ++k) in presolve() 68 for (k = krs; k < kre; ++k) { in presolve() 88 int col = hcol[krs+1]; in presolve() 89 tableau[i] = rowels[krs+i]; in presolve() 90 clo[i] = prob->clo[krs+i]; in presolve() 91 cup[i] = prob->cup[krs+i]; in presolve() 99 for (k = krs; k < kre; ++k) { in presolve() 100 costs[k - krs] = dcost[hcol[k]]; in presolve() 106 CoinCopyOfArray(&hcol[krs], nc), in presolve() [all …]
|
H A D | CoinOslFactorization3.cpp | 83 int nel, krs; 97 index=&hcoli[krs]; 98 els=&dluval[krs]; 862 int nz, ndo, krs; in c_ekkcmfd() local 937 dluval[krs + jcol] = dluval[krs + idense]; in c_ekkcmfd() 968 dluval[krs + jcol] = dluval[krs + idense + j]; in c_ekkcmfd() 1063 dluval[krs + jcol] = dluval[krs + idense + j]; in c_ekkcmfd() 1079 dluval[krs + jcol] = dluval[krs + idense]; in c_ekkcmfd() 1142 dluval[krs + idense] = dluval[krs]; in c_ekkcmfd() 1152 dluval[krs + nz - 1] = dluval[krs + i]; in c_ekkcmfd() [all …]
|
H A D | CoinPresolveForcing.cpp | 45 for (CoinBigIndex kk = krs; kk < kre; kk++) { in implied_row_bounds() 207 const CoinBigIndex krs = mrstrt[irow]; in presolve() local 208 const CoinBigIndex kre = krs + hinrow[irow]; in presolve() 294 for (CoinBigIndex k = krs; k < kre; k++) { in presolve() 314 CoinBigIndex lk = krs; in presolve() 316 for (CoinBigIndex k = krs; k < kre; k++) { in presolve() 329 bounds[uk - krs] = lj; in presolve() 330 rowcols[uk - krs] = j; in presolve() 336 bounds[lk - krs] = uj; in presolve() 337 rowcols[lk - krs] = j; in presolve() [all …]
|
H A D | CoinPresolveUseless.cpp | 191 const CoinBigIndex krs = rowStarts[i]; in testRedundant() local 192 const CoinBigIndex kre = krs + rowLengths[i]; in testRedundant() 199 for (CoinBigIndex kcol = krs; kcol < kre; ++kcol) { in testRedundant() 268 for (CoinBigIndex kcol = krs; kcol < kre; ++kcol) { in testRedundant() 492 const CoinBigIndex krs = rowStarts[i]; in testRedundant() local 493 const CoinBigIndex kre = krs + rowLengths[i]; in testRedundant() 495 for (CoinBigIndex krow = krs; krow < kre; ++krow) { in testRedundant() 679 CoinBigIndex krs = mrstrt[irow]; in presolve() local 680 CoinBigIndex kre = krs + hinrow[irow]; in presolve() 689 f->rowcols = CoinCopyOfArray(&hcol[krs], hinrow[irow]); in presolve() [all …]
|
H A D | CoinPresolveDual.cpp | 232 const CoinBigIndex krs = mrstrt[i]; in presolve() local 233 const CoinBigIndex kre = krs + hinrow[i]; in presolve() 238 for (CoinBigIndex k = krs; k < kre; k++) { in presolve() 344 for (CoinBigIndex k = krs ; k < kre ; k++) { in presolve() 362 for (CoinBigIndex k = krs ; k < kre ; k++) { in presolve() 459 for (CoinBigIndex k = krs ; k < kre ; k++) { in presolve() 991 const CoinBigIndex krs = mrstrt[i]; in presolve() local 1283 CoinBigIndex k, krs, kre; in presolve() local 1295 krs = mrstrt[i]; in presolve() 1301 for (k = krs; k < kre; ++k) { in presolve() [all …]
|
H A D | CoinPresolveSubst.cpp | 461 const CoinBigIndex krs = rowStarts[i]; in presolve() local 528 CoinBigIndex krs = rowStarts[i]; in presolve() local 529 CoinBigIndex kre = krs + rowLengths[i]; in presolve() 534 for (CoinBigIndex krow = krs; krow < kre; ++krow) { in presolve() 548 CoinSort_2(colIndices + krs, colIndices + kre, rowCoeffs + krs); in presolve() 556 krs = rowStarts[i]; in presolve() 557 kre = krs + rowLengths[i]; in presolve() 564 for (CoinBigIndex krow = krs; krow < kre; ++krow) { in presolve() 592 assert(colIndices[krs + x_to_y[rowndx]] == j); in presolve() 594 const double coeff = rowCoeffs[krs + x_to_y[rowndx]]; in presolve() [all …]
|
/dports/math/coinutils/CoinUtils-2.11.4/CoinUtils/src/ |
H A D | CoinPresolveIsolated.cpp | 45 CoinBigIndex krs = mrstrt[irow]; in presolve() local 55 for (k = krs; k < kre; ++k) in presolve() 68 for (k = krs; k < kre; ++k) { in presolve() 88 int col = hcol[krs+1]; in presolve() 89 tableau[i] = rowels[krs+i]; in presolve() 90 clo[i] = prob->clo[krs+i]; in presolve() 91 cup[i] = prob->cup[krs+i]; in presolve() 99 for (k = krs; k < kre; ++k) { in presolve() 100 costs[k - krs] = dcost[hcol[k]]; in presolve() 106 CoinCopyOfArray(&hcol[krs], nc), in presolve() [all …]
|
H A D | CoinOslFactorization3.cpp | 83 int nel, krs; 97 index=&hcoli[krs]; 98 els=&dluval[krs]; 862 int nz, ndo, krs; in c_ekkcmfd() local 937 dluval[krs + jcol] = dluval[krs + idense]; in c_ekkcmfd() 968 dluval[krs + jcol] = dluval[krs + idense + j]; in c_ekkcmfd() 1063 dluval[krs + jcol] = dluval[krs + idense + j]; in c_ekkcmfd() 1079 dluval[krs + jcol] = dluval[krs + idense]; in c_ekkcmfd() 1142 dluval[krs + idense] = dluval[krs]; in c_ekkcmfd() 1152 dluval[krs + nz - 1] = dluval[krs + i]; in c_ekkcmfd() [all …]
|
H A D | CoinPresolveForcing.cpp | 45 for (CoinBigIndex kk = krs; kk < kre; kk++) { in implied_row_bounds() 207 const CoinBigIndex krs = mrstrt[irow]; in presolve() local 208 const CoinBigIndex kre = krs + hinrow[irow]; in presolve() 294 for (CoinBigIndex k = krs; k < kre; k++) { in presolve() 314 CoinBigIndex lk = krs; in presolve() 316 for (CoinBigIndex k = krs; k < kre; k++) { in presolve() 329 bounds[uk - krs] = lj; in presolve() 330 rowcols[uk - krs] = j; in presolve() 336 bounds[lk - krs] = uj; in presolve() 337 rowcols[lk - krs] = j; in presolve() [all …]
|
H A D | CoinPresolveUseless.cpp | 191 const CoinBigIndex krs = rowStarts[i]; in testRedundant() local 192 const CoinBigIndex kre = krs + rowLengths[i]; in testRedundant() 199 for (CoinBigIndex kcol = krs; kcol < kre; ++kcol) { in testRedundant() 268 for (CoinBigIndex kcol = krs; kcol < kre; ++kcol) { in testRedundant() 492 const CoinBigIndex krs = rowStarts[i]; in testRedundant() local 493 const CoinBigIndex kre = krs + rowLengths[i]; in testRedundant() 495 for (CoinBigIndex krow = krs; krow < kre; ++krow) { in testRedundant() 679 CoinBigIndex krs = mrstrt[irow]; in presolve() local 680 CoinBigIndex kre = krs + hinrow[irow]; in presolve() 689 f->rowcols = CoinCopyOfArray(&hcol[krs], hinrow[irow]); in presolve() [all …]
|
H A D | CoinPresolveDual.cpp | 232 const CoinBigIndex krs = mrstrt[i]; in presolve() local 233 const CoinBigIndex kre = krs + hinrow[i]; in presolve() 238 for (CoinBigIndex k = krs; k < kre; k++) { in presolve() 344 for (CoinBigIndex k = krs ; k < kre ; k++) { in presolve() 362 for (CoinBigIndex k = krs ; k < kre ; k++) { in presolve() 459 for (CoinBigIndex k = krs ; k < kre ; k++) { in presolve() 991 const CoinBigIndex krs = mrstrt[i]; in presolve() local 1283 CoinBigIndex k, krs, kre; in presolve() local 1295 krs = mrstrt[i]; in presolve() 1301 for (k = krs; k < kre; ++k) { in presolve() [all …]
|
/dports/math/ogdf/OGDF/src/coin/CoinUtils/ |
H A D | CoinPresolveIsolated.cpp | 45 CoinBigIndex krs = mrstrt[irow]; in presolve() local 55 for ( k = krs; k<kre; ++k) in presolve() 68 for ( k = krs; k<kre; ++k) { in presolve() 90 int col = hcol[krs+1]; in presolve() 91 tableau[i] = rowels[krs+i]; in presolve() 92 clo[i] = prob->clo[krs+i]; in presolve() 93 cup[i] = prob->cup[krs+i]; in presolve() 101 for (k = krs; k<kre; ++k) { in presolve() 102 costs[k-krs] = dcost[hcol[k]]; in presolve() 108 CoinCopyOfArray(&hcol[krs], nc), in presolve() [all …]
|
H A D | CoinPresolveSubst.cpp | 53 CoinBigIndex krs = mrstrt[irowy]; in add_row() local 64 CoinSort_2(hcol+krs,hcol+krs+hinrow[irowy],rowels+krs); in add_row() 217 CoinBigIndex krs = mrstrt[i]; in copyrep() local 458 CoinSort_2(hcol+krs,hcol+krs+hinrow[bestrowy_row],rowels+krs); in presolve() 622 CoinBigIndex krs = mrstrt[rowy]; in presolve() local 654 CoinBigIndex krs = mrstrt[rowy]; in presolve() 667 CoinBigIndex krs = mrstrt[rowy]; in presolve() local 669 CoinSort_2(hcol+krs,hcol+krs+hinrow[rowy],rowels+krs); in presolve() 744 CoinBigIndex k = krs + ki; in presolve() 771 krs = mrstrt[rowy]; in presolve() [all …]
|
H A D | CoinOslFactorization3.cpp | 82 int nel, krs; 97 els=&dluval[krs]; 952 dluval[krs + jcol] = dluval[krs + idense]; in c_ekkcmfd() 979 krs = mkrs[i]; in c_ekkcmfd() 983 dluval[krs + jcol] = dluval[krs + idense + j]; in c_ekkcmfd() 1074 krs = mkrs[i]; in c_ekkcmfd() 1078 dluval[krs + jcol] = dluval[krs + idense + j]; in c_ekkcmfd() 1094 dluval[krs + jcol] = dluval[krs + idense]; in c_ekkcmfd() 1157 dluval[krs + idense] = dluval[krs]; in c_ekkcmfd() 1167 dluval[krs + nz - 1] = dluval[krs + i]; in c_ekkcmfd() [all …]
|
H A D | CoinPresolveForcing.cpp | 50 for (kk=krs; kk<kre; kk++) { in implied_bounds() 141 int jcol = hcol[krs]; in implied_row_bounds() 151 for (kk=krs; kk<kre; kk++) { in implied_row_bounds() 217 for (k=krs; k<kre; k++) { 396 for ( k=krs; k<kre; k++) { in presolve() 406 bounds[uk-krs] = clo[jcol]; in presolve() 407 rowcols[uk-krs] = jcol; in presolve() 414 rowcols[lk-krs] = jcol; in presolve() 431 f->nlo = lk-krs; in presolve() 655 for (k=krs; k<kre; k++) { [all …]
|
H A D | CoinPresolveUseless.cpp | 65 CoinBigIndex krs = mrstrt[irow]; in presolve() local 66 CoinBigIndex kre = krs + hinrow[irow]; in presolve() 75 f->rowcols = CoinCopyOfArray(&hcol[krs], hinrow[irow]); in presolve() 76 f->rowels = CoinCopyOfArray(&rowels[krs], hinrow[irow]); in presolve() 78 for (CoinBigIndex k=krs; k<kre; k++) in presolve()
|
/dports/math/clp/Clp-1.17.3/CoinUtils/src/ |
H A D | CoinPresolveIsolated.cpp | 45 CoinBigIndex krs = mrstrt[irow]; in presolve() local 55 for (k = krs; k < kre; ++k) in presolve() 68 for (k = krs; k < kre; ++k) { in presolve() 88 int col = hcol[krs+1]; in presolve() 89 tableau[i] = rowels[krs+i]; in presolve() 90 clo[i] = prob->clo[krs+i]; in presolve() 91 cup[i] = prob->cup[krs+i]; in presolve() 99 for (k = krs; k < kre; ++k) { in presolve() 100 costs[k - krs] = dcost[hcol[k]]; in presolve() 106 CoinCopyOfArray(&hcol[krs], nc), in presolve() [all …]
|
H A D | CoinOslFactorization3.cpp | 82 int nel, krs; 96 index=&hcoli[krs]; 97 els=&dluval[krs]; 861 int nz, ndo, krs; in c_ekkcmfd() local 936 dluval[krs + jcol] = dluval[krs + idense]; in c_ekkcmfd() 967 dluval[krs + jcol] = dluval[krs + idense + j]; in c_ekkcmfd() 1062 dluval[krs + jcol] = dluval[krs + idense + j]; in c_ekkcmfd() 1078 dluval[krs + jcol] = dluval[krs + idense]; in c_ekkcmfd() 1141 dluval[krs + idense] = dluval[krs]; in c_ekkcmfd() 1151 dluval[krs + nz - 1] = dluval[krs + i]; in c_ekkcmfd() [all …]
|
H A D | CoinPresolveForcing.cpp | 45 for (CoinBigIndex kk = krs; kk < kre; kk++) { in implied_row_bounds() 207 const CoinBigIndex krs = mrstrt[irow]; in presolve() local 208 const CoinBigIndex kre = krs + hinrow[irow]; in presolve() 294 for (CoinBigIndex k = krs; k < kre; k++) { in presolve() 314 CoinBigIndex lk = krs; in presolve() 316 for (CoinBigIndex k = krs; k < kre; k++) { in presolve() 329 bounds[uk - krs] = lj; in presolve() 330 rowcols[uk - krs] = j; in presolve() 336 bounds[lk - krs] = uj; in presolve() 337 rowcols[lk - krs] = j; in presolve() [all …]
|
H A D | CoinPresolveUseless.cpp | 191 const CoinBigIndex krs = rowStarts[i]; in testRedundant() local 192 const CoinBigIndex kre = krs + rowLengths[i]; in testRedundant() 199 for (CoinBigIndex kcol = krs; kcol < kre; ++kcol) { in testRedundant() 268 for (CoinBigIndex kcol = krs; kcol < kre; ++kcol) { in testRedundant() 492 const CoinBigIndex krs = rowStarts[i]; in testRedundant() local 493 const CoinBigIndex kre = krs + rowLengths[i]; in testRedundant() 495 for (CoinBigIndex krow = krs; krow < kre; ++krow) { in testRedundant() 679 CoinBigIndex krs = mrstrt[irow]; in presolve() local 680 CoinBigIndex kre = krs + hinrow[irow]; in presolve() 689 f->rowcols = CoinCopyOfArray(&hcol[krs], hinrow[irow]); in presolve() [all …]
|
H A D | CoinPresolveDual.cpp | 232 const CoinBigIndex krs = mrstrt[i]; in presolve() local 233 const CoinBigIndex kre = krs + hinrow[i]; in presolve() 238 for (CoinBigIndex k = krs; k < kre; k++) { in presolve() 344 for (CoinBigIndex k = krs ; k < kre ; k++) { in presolve() 362 for (CoinBigIndex k = krs ; k < kre ; k++) { in presolve() 459 for (CoinBigIndex k = krs ; k < kre ; k++) { in presolve() 991 const CoinBigIndex krs = mrstrt[i]; in presolve() local 1283 CoinBigIndex k, krs, kre; in presolve() local 1295 krs = mrstrt[i]; in presolve() 1301 for (k = krs; k < kre; ++k) { in presolve() [all …]
|
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-secrets-gcpkms/test/cleanup/ |
H A D | main.go | 67 krs := listKRs(parent) 69 for _, kr := range krs { 206 var krs []string 222 krs = append(krs, kr.Name) 226 return krs
|
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/kvstore/ |
H A D | kvstore_dist.h | 631 const int num_servers = krs.size(); in EncodeDefaultKey() 639 CHECK_LT(ps_key, krs[server].end()); in EncodeDefaultKey() 651 ps::Key ps_key = krs[i].begin() + key; in EncodeDefaultKey() 652 CHECK_LT(ps_key, krs[i].end()); in EncodeDefaultKey() 677 const int num_servers = krs.size(); in EncodeCompressedKey() 704 CHECK_LT(ps_key, krs[server].end()); in EncodeCompressedKey() 736 CHECK_LT(ps_key_dummy, krs[i].end()); in EncodeCompressedKey() 742 CHECK_LT(ps_key, krs[i].end()); in EncodeCompressedKey() 775 const int num_servers = krs.size(); in EncodeRowSparseKey() 797 CHECK_LT(ps_key, krs[i].end()); in EncodeRowSparseKey() [all …]
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/kvstore/ |
H A D | kvstore_dist.h | 631 const int num_servers = krs.size(); in EncodeDefaultKey() 639 CHECK_LT(ps_key, krs[server].end()); in EncodeDefaultKey() 651 ps::Key ps_key = krs[i].begin() + key; in EncodeDefaultKey() 652 CHECK_LT(ps_key, krs[i].end()); in EncodeDefaultKey() 677 const int num_servers = krs.size(); in EncodeCompressedKey() 704 CHECK_LT(ps_key, krs[server].end()); in EncodeCompressedKey() 736 CHECK_LT(ps_key_dummy, krs[i].end()); in EncodeCompressedKey() 742 CHECK_LT(ps_key, krs[i].end()); in EncodeCompressedKey() 775 const int num_servers = krs.size(); in EncodeRowSparseKey() 797 CHECK_LT(ps_key, krs[i].end()); in EncodeRowSparseKey() [all …]
|
/dports/x11-toolkits/Xmt/xmt400/contrib/UIL/ |
H A D | README | 1 Return-Path: <krs@kampsax.dk> 3 Cc: krs@kampsax.dk 6 From: "Karsten Spang" <krs@kampsax.dk> 26 E-mail: krs@kampsax.dk Karsten Spang
|