devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add exception handler to memory allocation

Browse Source
This commit is contained in:
Desire NUENTSA
2012-07-19 18:03:44 +02:00
parent b0cba2d988
commit 59642da88b
11 changed files with 104 additions and 99 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
Eigen/src/OrderingMethods/Eigen_Colamd.h
View File

@@ -155,7 +155,6 @@
#endif /* MATLAB_MEX_FILE */
// == Row and Column structures ==
typedef struct EIGEN_Colamd_Col_struct
{
int start ; /* index for A of first row in this column, or EIGEN_DEAD */
@@ -248,11 +247,9 @@ void eigen_colamd_report (int stats [EIGEN_COLAMD_STATS]);
int eigen_init_rows_cols (int n_row, int n_col, EIGEN_Colamd_Row Row [], EIGEN_Colamd_Col col [], int A [], int p [], int stats[EIGEN_COLAMD_STATS] );
void eigen_init_scoring (int n_row, int n_col, EIGEN_Colamd_Row Row [], EIGEN_Colamd_Col Col [], int A [], int head [],
double knobs[EIGEN_COLAMD_KNOBS], int *p_n_row2, int *p_n_col2, int *p_max_deg);
void eigen_init_scoring (int n_row, int n_col, EIGEN_Colamd_Row Row [], EIGEN_Colamd_Col Col [], int A [], int head [], double knobs[EIGEN_COLAMD_KNOBS], int *p_n_row2, int *p_n_col2, int *p_max_deg);
int eigen_find_ordering (int n_row, int n_col, int Alen, EIGEN_Colamd_Row Row [], EIGEN_Colamd_Col Col [], int A [], int head [],
int n_col2, int max_deg, int pfree);
int eigen_find_ordering (int n_row, int n_col, int Alen, EIGEN_Colamd_Row Row [], EIGEN_Colamd_Col Col [], int A [], int head [], int n_col2, int max_deg, int pfree);
void eigen_order_children (int n_col, EIGEN_Colamd_Col Col [], int p []);
@@ -2514,5 +2511,4 @@ bool eigen_colamd(int n_row, int n_col, int Alen, int *A, int *p, double knobs[E
}
#endif /* NDEBUG */
#endif

6
Eigen/src/OrderingMethods/Ordering.h
View File

@@ -124,9 +124,6 @@ class COLAMDOrdering
typedef PermutationMatrix<Dynamic, Dynamic, Index> PermutationType;
typedef Matrix<Index, Dynamic, 1> IndexVector;
/** Compute the permutation vector form a sparse matrix */
template <typename MatrixType>
void operator() (const MatrixType& mat, PermutationType& perm)
{
@@ -152,9 +149,6 @@ class COLAMDOrdering
for (int i = 0; i < n; i++) perm.indices()(p(i)) = i;
}
private:
};