Home
last modified time | relevance | path

Searched refs:currentrank (Results 1 – 2 of 2) sorted by relevance

/dports/math/linbox/linbox-1.6.3/linbox/algorithms/
H A Dsmith-form-sparseelim-poweroftwo.h260 const size_t & currentrank, in PermuteSubMatrix() argument
264 PermuteColumn(LigneA[(size_t)l], LigneA[(size_t)l].size(), currentrank, c); in PermuteSubMatrix()
269 PermuteSubMatrix(LigneA, 0, k, currentrank, c); in PermuteUpperMatrix()
466 const size_t currentrank(indcol-1); in gauss_rankin()
468 if (c != (long)currentrank) { in gauss_rankin()
472 Q.permute(currentrank,c); in gauss_rankin()
473 std::swap(col_density[currentrank],col_density[c]); in gauss_rankin()
475 PermuteSubMatrix(LigneA, k+1, Ni, currentrank, c); in gauss_rankin()
506 const size_t currentrank(indcol-1); in gauss_rankin()
507 if (c != (long)currentrank) { in gauss_rankin()
[all …]
H A Dsmith-form-sparseelim-local.h313 const size_t & currentrank, const long & c) {
316 PermuteColumn(LigneA[(size_t)l], LigneA[(size_t)l].size(), currentrank, c);
321 PermuteSubMatrix(LigneA, 0, k, currentrank, c);
530 const size_t currentrank(indcol-1);
531 if (c != (long)currentrank) {
536 std::swap(col_density[currentrank],col_density[c]);
537 …PermuteUpperMatrix(LigneA, k, currentrank, c, typename Boolean_Trait<PreserveUpperMatrix>::Boolean…
538 PermuteSubMatrix(LigneA, k+1, Ni, currentrank, c);
544 for(size_t l=k + 1; (l < Ni) && (col_density[currentrank]); ++l)
567 const size_t currentrank(indcol-1);
[all …]