We test the various CRA algorithms here. More...
#include "linbox/linbox-config.h"#include <givaro/zring.h>#include "linbox/integer.h"#include "linbox/randiter/random-prime.h"#include "linbox/algorithms/cra-domain.h"#include "linbox/algorithms/cra-builder-single.h"#include "linbox/algorithms/cra-builder-early-multip.h"#include "linbox/algorithms/rational-cra-builder-full-multip.h"#include "linbox/matrix/dense-matrix.h"#include "linbox/algorithms/cra-builder-full-multip.h"#include "linbox/algorithms/cra-builder-full-multip-fixed.h"#include "test-common.h"#include "linbox/util/timer.h"
Include dependency graph for test-cra.C:
Functions | |
| template<class T > | |
| int | test_full_multip_matrix (std::ostream &report, size_t PrimeSize, size_t Size, std::pair< size_t, size_t > dims) |
Detailed Description
We test the various CRA algorithms here.
- Test:
- cra algorithms
Function Documentation
◆ test_full_multip_matrix()
| int test_full_multip_matrix | ( | std::ostream & | report, |
| size_t | PrimeSize, | ||
| size_t | Size, | ||
| std::pair< size_t, size_t > | dims | ||
| ) |
- Bug:
- it is not possible to allocate some memory and use submatrices ?
