/usr/include/linbox/algorithms/gauss/gauss-rank-gf2.inl is in liblinbox-dev 1.3.2-1.1build2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 | /* linbox/algorithms/gauss-rank-gf2.inl
* Copyright (C) 2009 The LinBox group
*
* Time-stamp: <14 Jun 10 15:26:01 Jean-Guillaume.Dumas@imag.fr>
*
*
* ========LICENCE========
* This file is part of the library LinBox.
*
* LinBox is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
* ========LICENCE========
*.
*
* SparseElimination rank calls over GF2
*/
// =================================================================== //
// =================================================================== //
#ifndef __LINBOX_gauss_rank_gf2_INL
#define __LINBOX_gauss_rank_gf2_INL
namespace LinBox
{
template <class SparseSeqMatrix> unsigned long&
GaussDomain<GF2>::rankin(unsigned long &Rank,
SparseSeqMatrix &A,
unsigned long Ni,
unsigned long Nj,
SparseEliminationTraits::PivotStrategy reord) const
{
Element determinant;
const GF2 F2;
Permutation<GF2> P((int)A.coldim(),F2);
if (reord == SparseEliminationTraits::PIVOT_NONE)
return NoReordering(Rank, determinant, A, Ni, Nj);
else
return InPlaceLinearPivoting(Rank, determinant, A, P, Ni, Nj);
}
template <class SparseSeqMatrix> unsigned long&
GaussDomain<GF2>::rankin(unsigned long &Rank,
SparseSeqMatrix &A,
SparseEliminationTraits::PivotStrategy reord) const
{
return rankin(Rank, A, A.rowdim (), A.coldim (), reord);
}
template <class SparseSeqMatrix> unsigned long&
GaussDomain<GF2>::rank(unsigned long &rk,
const SparseSeqMatrix &A,
SparseEliminationTraits::PivotStrategy reord) const
{
return rank(rk, A, A.rowdim (), A.coldim (), reord);
}
template <class SparseSeqMatrix> unsigned long&
GaussDomain<GF2>::rank(unsigned long &Rank,
const SparseSeqMatrix &A,
unsigned long Ni,
unsigned long Nj,
SparseEliminationTraits::PivotStrategy reord) const
{
SparseSeqMatrix CopyA(Ni);
for(unsigned long i = 0; i < Ni; ++i)
CopyA[i] = A[i];
return rankin(Rank, CopyA, Ni, Nj, reord);
}
} // namespace LinBox
#endif // __LINBOX_gauss_rank_gf2_INL
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,:0,t0,+0,=s
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
|