\n-- Global bench_rank (int carac)
\n-- no gz reader ?
\n - Global BlackboxContainerBase< Field, Blackbox >::BlackboxContainerBase (const Blackbox *BB, const Field &F, size_t Size)
\n - no need for F
\n - Global BlackboxContainerBase< Field, Blackbox >::BlackboxContainerBase (const Blackbox *BB, const Field &F)
\n - no need for F
\n - Class BlasMatrix< _Field, _Storage >
\n - necessitates the inclusion of those things after of before. We should not include directly this but just the matrices and they automatically need their domain (for now)
\n - Global BlasMatrix< _Field, _Storage >::operator[] (size_t i)
\n - Rows and Cols should be BlasVectors
\n - Class BlasMatrix< _Field, _Storage >::rebind< _Tp1, _Rep2 >
\n - other rep
\n - Global BlasMatrixDomain< Field_ >::areEqual (const Matrix1 &A, const Matrix2 &B) const
\n - use refs
\n - Global BlasMatrixDomain< Field_ >::isIdentity (const Matrix1 &A) const
\n-use refs
\n-use refs
\n+use refs
\n+use refs
\n - Global BlasMatrixDomain< Field_ >::isIdentityGeneralized (const Matrix1 &A) const
\n-use refs
\n-use refs
\n+use refs
\n+use refs
\n - Global BlasMatrixDomain< Field_ >::isZero (const Matrix1 &A) const
\n - use refs
\n - Global BlasMatrixDomain< Field_ >::setZero (Matrix &I) const
\n - use fflas-ffpack
\n - Global CRABuilderEarlyMultip< Domain_Type >::dot (DomainElement &z, const Domain &D, const Vect1 &v1, const Vect2 &v2)
\n - why a dot product here ?
\n - Global CRABuilderEarlyMultip< Domain_Type >::dot (Integer &z, const Integer &D, const Vect1 &v1, const Vect2 &v2)
\n - why a dot product here ?
\n-- Global distinct (I1 a, I1 b, Lp &c)
\n-this already exists elsewhere
\n-this already exists elsewhere
\n-- Global field_subtests::testRingTrivia (const Field &F, const char *name)
\n - BlockRing does not know about 0 and 1 !
\n - Global FieldArchetype::constructor (FieldAbstract *trait, Field_qcq *field_ptr)
\n - leaks here (new not deleted)
\n - Global generate_precRatMat (string &filename, RMatrix &M, DVector &den, Integer &denPrec)
\n - non reentrant strtok
\n-- Class indexDomain
\n-- does not belong here
\n - Class IndexedCategory< BlasMatrix< Field, _Rep > >
\n - this is trait, not a Category
\n-- Namespace LinBox
\n-it is dangerous to include matrices defs that include hom for their rebind...
\n-those are not just traits:
\n-- Global LinBox::CheckRank (const Field &F, const typename Field ::Element *A, const size_t &m, const size_t &n, const size_t &lda, const size_t &alledged_rank)
\n - not used
\n - Global LinBox::isPositiveDefinite (const Blackbox &A, const RingCategories::IntegerTag &tag, const Method::Auto &M)
\n-should try a modular minpoly and decide on the degree of that...
\n-this crude size check can be refined
\n-- should try a modular minpoly and decide on the degree of that...
\n - Global LinBox::isPositiveDefinite (const Blackbox &A, const RingCategories::IntegerTag &tag, const Method::DenseElimination &M)
\n - why map (same field)? This is a copy.
\n+- Global LinBox::isPositiveDefinite (const Blackbox &A, const RingCategories::IntegerTag &tag, const Method::Auto &M)
\n+- this crude size check can be refined
\n - Global LinBox::Protected::Identity (const Field &F, typename Field::Element *Id, const size_t ldI, const size_t lig1, const size_t col1, const size_t lig2, const size_t col2)
\n - long et size_t ne cohabitent pas bien.
\n - Global LinBox::Protected::random_rankupdate (Field &F, const Randiter &R, BlasMatrix< Field > &A, int &rank, const RingCategories::IntegerTag &tag)
\n-const !
\n-do perms ?
\n+do perms ?
\n+const !
\n - Global LinBox::randomAns (const Ring &R, Matrix &Mat, size_t n, size_t epr)
\n - use BlasVector.
\n - Global LinBox::RandomMatrixWithDet (const Field &F, typename Field ::Element *A, const size_t &m, const size_t &lda, const typename Field ::Element &det)
\n - not used
\n-- Global LinBox::rank (size_t &res, const Blackbox &A, const RingCategories::ModularTag &tag, const Method::Wiedemann &M)
\n-- This is too much for solutions. It belongs in algorithms
\n-- Global LinBox::rank (size_t &r, const Blackbox &A, const RingCategories::ModularTag &tag, const Method::Auto &m)
\n-- choose (benchmark) better cuttoff (size, nbnz, sparse rep)
\n - Global LinBox::rankInPlace (size_t &r, Blackbox &A)
\n - there is no Elimination() method there.
\n - Namespace LinBox::SparseFileFormat
\n - use the enum!!!!
\n-- Global LinBox::VectorWrapper::constRefSpecialized (Vector &v, size_t i, VectorCategories::SparseSequenceVectorTag)
\n-- who is zero ?
\n - Global LinBox::VectorWrapper::constRefSpecialized (Vector &v, size_t i, VectorCategories::SparseParallelVectorTag)
\n - who is zero ?
\n+- Global LinBox::VectorWrapper::constRefSpecialized (Vector &v, size_t i, VectorCategories::SparseSequenceVectorTag)
\n+- who is zero ?
\n - Global LinBox::VectorWrapper::refSpecialized (Vector &v, size_t i, VectorCategories::SparseSequenceVectorTag)
\n - who is zero ?
\n - Global LinBox::VectorWrapper::refSpecialized (Vector &v, size_t i, VectorCategories::SparseParallelVectorTag)
\n - who is zero ?
\n-- Global main (int argc, char **argv)
\n-testRandomIterator fails
\n-should be tried on NTZ_LL too
\n-- Global main (int ac, char **av)
\n-- : this one completely fails :
\n-- Global main (int argc, char **argv)
\n-- testRandomIterator fails
\n-- Global main (int argc, char *argv[])
\n-- q or not q ?
\n-- Global main (int argc, char **argv)
\n-- should be tried on NTZ_LL too
\n - File matrix/random-matrix.h
\n - this belongs to algorithms...
\n - Global MatrixDomain< Field_ >::Rep_
\n - should be BlasVector
\n - Class MatrixDomain< GF2 >
\n - this is half done and makes MatrixDomain on GF2 hardly usable.
\n - Global MatrixDomain< GF2 >::mulColSpecialized (Vector1 &w, const Matrix &A, const Vector2 &v, VectorCategories::DenseZeroOneVectorTag, VectorCategories::DenseZeroOneVectorTag) const
\n - what's happening here ?
\n-- File modular.h
\n-- move Element& init(const Element&) to FFPACK. use using more..
\n - Global MoorePenrose< Blackbox >::MoorePenrose (const MoorePenrose &A)
\n - Value of pointer '_matB1', which points to allocated memory, is copied in copy constructor instead of allocating new memory.
\n - Global OpenCLMatrixDomain< Field_ >::areEqual (const Matrix1 &A, const Matrix2 &B)
\n - use refs
\n - Global OpenCLMatrixDomain< Field_ >::isIdentity (const Matrix1 &A)
\n use refs
\n use refs
\n@@ -161,16 +131,14 @@\n - Global OpenCLMatrixDomain< Field_ >::isZero (const Matrix1 &A)
\n - use refs
\n - Class PLUQMatrix< Field >
\n - Should really be tempalted by Matrix and be a (sub)domain
\n - Global PLUQMatrix< Field >::PLUQMatrix (BlasMatrix< Field, _Rep > &A, BlasPermutation< size_t > &P, BlasPermutation< size_t > &Q)
\n - in place ?
\n-- Global printPolynomial (const Field &F, const Polynomial &v)
\n-- this should be elsewhere
\n - File rational-reconstruction.h
\n - there seems to be a confusion between Ring _r, [iI]nteger... Besides we have to check that Ring/Integer/NTL_ZZ are the 'same'.
\n - Global ScalarMatrix< Field_ >::ScalarMatrix ()
\n - this should not be allowed (unknown field)
\n - Global SparseMatrix< _Field, SparseMatrixFormat::COO >::SparseMatrix (const _Field &F, VectStream &stream)
\n - may be 0...
\n - Global SparseMatrix< _Field, SparseMatrixFormat::COO::implicit >::apply (Vector &y, const Vector &x, const Element &a) const
\n@@ -181,52 +149,83 @@\n - if too big, create transpose.
\n - Global SparseMatrix< Field_, SparseMatrixFormat::TPL >::write (std::ostream &out) const
\n - we should not support too many formats
\n - Global SparseMatrixGeneric< _Field, _Row, Trait >::size () const
\n - should it be elements or non zero elements ?
\n - Global SparseMatrixWriteHelper< Matrix >::write (const Matrix &A, std::ostream &os, Tag::FileFormat format)
\n - this is reall the \"generic\" one
\n+- File test-commentator.C
\n+- this test does not even test if anything is outputted (and it passes even though)
\n+- File test-matrix-stream.C
\n+- this tests reveals memory leaks
\n+- File test-matrix-utils.h
\n+- put in
matrix/random-matrix.h \n+- File test-smith-form.C
\n+- should work for NTL Integers too
\n+- Global test_full_multip_matrix (std::ostream &report, size_t PrimeSize, size_t Size, std::pair< size_t, size_t > dims)
\n+- it is not possible to allocate some memory and use submatrices ?
\n+- Global Toeplitz< typename _PRing::CoeffField, _PRing >::write (std::ostream &os=std::cout) const
\n+- this is not MM format at all
\n+- Class Transpose< Blackbox >
\n+- no write here. test-blackbox.h requires it
\n+- Class ZOQuad< _Field >
\n+- needs read for test-blackbox.h
\n+- Global bench_rank (int carac)
\n+- no gz reader ?
\n+- Global distinct (I1 a, I1 b, Lp &c)
\n+this already exists elsewhere
\n+this already exists elsewhere
\n+- Class indexDomain
\n+- does not belong here
\n+- Namespace LinBox
\n+it is dangerous to include matrices defs that include hom for their rebind...
\n+those are not just traits:
\n+- Global LinBox::rank (size_t &r, const Blackbox &A, const RingCategories::ModularTag &tag, const Method::Auto &m)
\n+- choose (benchmark) better cuttoff (size, nbnz, sparse rep)
\n+- Global LinBox::rank (size_t &res, const Blackbox &A, const RingCategories::ModularTag &tag, const Method::Wiedemann &M)
\n+- This is too much for solutions. It belongs in algorithms
\n+- Global main (int argc, char **argv)
\n+- should be tried on NTZ_LL too
\n+- Global main (int argc, char *argv[])
\n+- q or not q ?
\n+- Global main (int argc, char **argv)
\n+testRandomIterator fails
\n+testRandomIterator fails
\n+should be tried on NTZ_LL too
\n+- Global main (int ac, char **av)
\n+- : this one completely fails :
\n+- File modular.h
\n+- move Element& init(const Element&) to FFPACK. use using more..
\n+- Global printPolynomial (const Field &F, const Polynomial &v)
\n+- this should be elsewhere
\n - File test-charpoly.C
\n occasionnnaly there is a \"SIGFPE, Arithmetic exception.\" in CRA
\n testRandomCharpoly is not always tested !!
\n - File test-commentator.C
\n-- this test does not even test if anything is outputted (and it passes even though)
\n - File test-ffpack.C
\n - this file does not compile or the test fails for some fields.
\n - File test-ftrmm.C
\n ftrmm fails on non-double transposed versions.
\n is fgemm correct on null A and B ?
\n - File test-matrix-stream.C
\n-- this tests reveals memory leaks
\n-- File test-matrix-utils.h
\n-- put in
matrix/random-matrix.h \n-- File test-smith-form.C
\n-- should work for NTL Integers too
\n - Global test_fgemm (std::ostream &report, const Field &F)
\n needs p prime.
\n if beta != 0 but A and B are 0 (or don't exist) then C != beta C
\n - Global test_ftrmm (std::ostream &report, const Field &F)
\n-same code as above ?
\n-same code as above ?
\n+same code as above ?
\n+same code as above ?
\n same code as above ?
\n same code as above ?
\n-same code as above ?
\n-same code as above ?
\n+same code as above ?
\n+same code as above ?
\n - Global test_full_multip_matrix (std::ostream &report, size_t PrimeSize, size_t Size, std::pair< size_t, size_t > dims)
\n-- it is not possible to allocate some memory and use submatrices ?
\n-- Global Toeplitz< typename _PRing::CoeffField, _PRing >::write (std::ostream &os=std::cout) const
\n-- this is not MM format at all
\n-- Class Transpose< Blackbox >
\n-- no write here. test-blackbox.h requires it
\n-- Class ZOQuad< _Field >
\n-- needs read for test-blackbox.h
\n
![\"doxygen\"/](\"doxygen.svg\")