| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_pruneL.h | 60 Index kmin = 0, kmax = 0, minloc, maxloc,krow; local
81 kmax = glu.xlsub(irep1) - 1;
82 for (krow = kmin; krow <= kmax; krow++)
100 while (kmin <= kmax)
102 if (perm_r(glu.lsub(kmax)) == emptyIdxLU)
103 kmax--;
108 // kmin below pivrow (not yet pivoted), and kmax
110 std::swap(glu.lsub(kmin), glu.lsub(kmax));
119 maxloc = glu.xlusup(irep) + ( kmax - glu.xlsub(irep) );
123 kmax--
[all...] |
| /external/webp/include/webp/ |
| mux.h | 429 int kmax; // Minimum and maximum distance between consecutive key member in struct:WebPAnimEncoderOptions
432 // Note that these conditions should hold: kmax > kmin
433 // and kmin >= kmax / 2 + 1. Also, if kmax <= 0, then
434 // key-frame insertion is disabled; and if kmax == 1,
|
| /external/webp/src/webp/ |
| mux.h | 429 int kmax; // Minimum and maximum distance between consecutive key member in struct:WebPAnimEncoderOptions
432 // Note that these conditions should hold: kmax > kmin
433 // and kmin >= kmax / 2 + 1. Also, if kmax <= 0, then
434 // key-frame insertion is disabled; and if kmax == 1,
|
| /external/lmfit/lib/ |
| lmmin.c | 807 int i, j, k, kmax; local
826 kmax = j;
828 if (Rdiag[k] > Rdiag[kmax])
829 kmax = k;
831 if (kmax != j) {
832 /* Swap columns j and kmax. */
834 Pivot[j] = Pivot[kmax];
835 Pivot[kmax] = k;
838 A[j*m+i] = A[kmax*m+i];
839 A[kmax*m+i] = temp
[all...] |
