Changeset 0d4424 for src

Timestamp:

Dec 4, 2010, 11:54:32 PM (14 years ago)

Author:

Frederik Heber <heber@…>

Branches:

Action_Thermostats, Add_AtomRandomPerturbation, Add_FitFragmentPartialChargesAction, Add_RotateAroundBondAction, Add_SelectAtomByNameAction, Added_ParseSaveFragmentResults, AddingActions_SaveParseParticleParameters, Adding_Graph_to_ChangeBondActions, Adding_MD_integration_tests, Adding_ParticleName_to_Atom, Adding_StructOpt_integration_tests, AtomFragments, Automaking_mpqc_open, AutomationFragmentation_failures, Candidate_v1.5.4, Candidate_v1.6.0, Candidate_v1.6.1, ChangeBugEmailaddress, ChangingTestPorts, ChemicalSpaceEvaluator, CombiningParticlePotentialParsing, Combining_Subpackages, Debian_Package_split, Debian_package_split_molecuildergui_only, Disabling_MemDebug, Docu_Python_wait, EmpiricalPotential_contain_HomologyGraph, EmpiricalPotential_contain_HomologyGraph_documentation, Enable_parallel_make_install, Enhance_userguide, Enhanced_StructuralOptimization, Enhanced_StructuralOptimization_continued, Example_ManyWaysToTranslateAtom, Exclude_Hydrogens_annealWithBondGraph, FitPartialCharges_GlobalError, Fix_BoundInBox_CenterInBox_MoleculeActions, Fix_ChargeSampling_PBC, Fix_ChronosMutex, Fix_FitPartialCharges, Fix_FitPotential_needs_atomicnumbers, Fix_ForceAnnealing, Fix_IndependentFragmentGrids, Fix_ParseParticles, Fix_ParseParticles_split_forward_backward_Actions, Fix_PopActions, Fix_QtFragmentList_sorted_selection, Fix_Restrictedkeyset_FragmentMolecule, Fix_StatusMsg, Fix_StepWorldTime_single_argument, Fix_Verbose_Codepatterns, Fix_fitting_potentials, Fixes, ForceAnnealing_goodresults, ForceAnnealing_oldresults, ForceAnnealing_tocheck, ForceAnnealing_with_BondGraph, ForceAnnealing_with_BondGraph_continued, ForceAnnealing_with_BondGraph_continued_betteresults, ForceAnnealing_with_BondGraph_contraction-expansion, FragmentAction_writes_AtomFragments, FragmentMolecule_checks_bonddegrees, GeometryObjects, Gui_Fixes, Gui_displays_atomic_force_velocity, ImplicitCharges, IndependentFragmentGrids, IndependentFragmentGrids_IndividualZeroInstances, IndependentFragmentGrids_IntegrationTest, IndependentFragmentGrids_Sole_NN_Calculation, JobMarket_RobustOnKillsSegFaults, JobMarket_StableWorkerPool, JobMarket_unresolvable_hostname_fix, MoreRobust_FragmentAutomation, ODR_violation_mpqc_open, PartialCharges_OrthogonalSummation, PdbParser_setsAtomName, PythonUI_with_named_parameters, QtGui_reactivate_TimeChanged_changes, Recreated_GuiChecks, Rewrite_FitPartialCharges, RotateToPrincipalAxisSystem_UndoRedo, SaturateAtoms_findBestMatching, SaturateAtoms_singleDegree, StoppableMakroAction, Subpackage_CodePatterns, Subpackage_JobMarket, Subpackage_LinearAlgebra, Subpackage_levmar, Subpackage_mpqc_open, Subpackage_vmg, Switchable_LogView, ThirdParty_MPQC_rebuilt_buildsystem, TrajectoryDependenant_MaxOrder, TremoloParser_IncreasedPrecision, TremoloParser_MultipleTimesteps, TremoloParser_setsAtomName, Ubuntu_1604_changes, stable

Children:

c134d9

Parents:

cca9ef

git-author:

Frederik Heber <heber@…> (11/15/10 14:02:38)

git-committer:

Frederik Heber <heber@…> (12/04/10 23:54:32)

Message:

Made gslmatrix obsolete.

• Transfered property and swap...() functions from GSLMatrix to MatrixContent.
• Line::getIntersection() uses now MatrixContent.
• made unit tests for gslmatrix into unit test for MatrixContent.

Location:

src

Files:

• LinearAlgebra/Line.cpp (modified) (2 diffs)
• LinearAlgebra/MatrixContent.cpp (modified) (7 diffs)
• LinearAlgebra/MatrixContent.hpp (modified) (4 diffs)
• LinearAlgebra/linearsystemofequations.cpp (modified) (4 diffs)
• LinearAlgebra/linearsystemofequations.hpp (modified) (2 diffs)
• unittests/Makefile.am (modified) (7 diffs)
• unittests/MatrixContentSymmetricUnittest.cpp (moved) (moved from src/unittests/gslmatrixsymmetricunittest.cpp ) (21 diffs)
• unittests/MatrixContentSymmetricUnittest.hpp (moved) (moved from src/unittests/gslmatrixsymmetricunittest.hpp ) (3 diffs)
• unittests/MatrixContentUnittest.cpp (moved) (moved from src/unittests/gslmatrixunittest.cpp ) (19 diffs)
• unittests/MatrixContentUnittest.hpp (moved) (moved from src/unittests/gslmatrixunittest.hpp ) (3 diffs)

src/LinearAlgebra/Line.cpp

@@ -28 +28 @@
 #include "Helpers/Log.hpp"
 #include "Helpers/Verbose.hpp"
-#include "LinearAlgebra/gslmatrix.hpp"
+#include "LinearAlgebra/MatrixContent.hpp"
 #include "Helpers/Info.hpp"
 #include "Exceptions/LinearDependenceException.hpp"
@@ -116 +116 @@
   Vector res;
 
-  auto_ptr<GSLMatrix> M = auto_ptr<GSLMatrix>(new GSLMatrix(4,4));
-
-  M->SetAll(1.);
+  auto_ptr<MatrixContent> M = auto_ptr<MatrixContent>(new MatrixContent(4,4));
+
+  M->setValue(1.);
   for (int i=0;i<3;i++) {
-    M->Set(0, i, Line1a[i]);
-    M->Set(1, i, Line1b[i]);
-    M->Set(2, i, Line2a[i]);
-    M->Set(3, i, Line2b[i]);
+    M->set(0, i, Line1a[i]);
+    M->set(1, i, Line1b[i]);
+    M->set(2, i, Line2a[i]);
+    M->set(3, i, Line2b[i]);
   }
 

src/LinearAlgebra/MatrixContent.cpp

@@ -25 +25 @@
 #include <gsl/gsl_blas.h>
 #include <gsl/gsl_eigen.h>
+#include <gsl/gsl_linalg.h>
 #include <gsl/gsl_matrix.h>
 #include <gsl/gsl_multimin.h>
@@ -131 +132 @@
     for(int j=columns;j--;){
       set(i,j,0.);
+    }
+  }
+}
+
+/** Set all matrix components to a given value.
+ * \param _value value to set each component to
+ */
+void MatrixContent::setValue(double _value)
+{
+  for(int i=rows;i--;){
+    for(int j=columns;j--;){
+      set(i,j,_value);
     }
   }
@@ -196 +209 @@
 }
 
+/* ========================== Accessing =============================== */
+
 /** Accessor for manipulating component (i,j).
  * \param i row number
@@ -224 +239 @@
 }
 
+/** These functions return a pointer to the \a m-th element of a matrix.
+ *  If \a m or \a n lies outside the allowed range of 0 to GSLMatrix::dimension-1 then the error handler is invoked and a null pointer is returned.
+ * \param m index
+ * \return pointer to \a m-th element
+ */
+double *MatrixContent::Pointer(size_t m, size_t n)
+{
+  return gsl_matrix_ptr (content, m, n);
+};
+
+/** These functions return a constant pointer to the \a m-th element of a matrix.
+ *  If \a m or \a n lies outside the allowed range of 0 to GSLMatrix::dimension-1 then the error handler is invoked and a null pointer is returned.
+ * \param m index
+ * \return const pointer to \a m-th element
+ */
+const double *MatrixContent::const_Pointer(size_t m, size_t n) const
+{
+  return gsl_matrix_const_ptr (content, m, n);
+};
+
+/* ========================== Initializing =============================== */
+
 /** Setter for component (i,j).
  * \param i row numbr
@@ -238 +275 @@
 }
 
+/** This function sets the matrix from a double array.
+ * Creates a matrix view of the array and performs a memcopy.
+ * \param *x array of values (no dimension check is performed)
+ */
+void MatrixContent::setFromDoubleArray(double * x)
+{
+  gsl_matrix_view m = gsl_matrix_view_array (x, rows, columns);
+  gsl_matrix_memcpy (content, &m.matrix);
+};
+
+/* ====================== Exchanging elements ============================ */
+/** This function exchanges the \a i-th and \a j-th row of the matrix in-place.
+ * \param i i-th row to swap with ...
+ * \param j ... j-th row to swap against
+ */
+bool MatrixContent::SwapRows(size_t i, size_t j)
+{
+  return (gsl_matrix_swap_rows (content, i, j) == GSL_SUCCESS);
+};
+
+/** This function exchanges the \a i-th and \a j-th column of the matrix in-place.
+ * \param i i-th column to swap with ...
+ * \param j ... j-th column to swap against
+ */
+bool MatrixContent::SwapColumns(size_t i, size_t j)
+{
+  return (gsl_matrix_swap_columns (content, i, j) == GSL_SUCCESS);
+};
+
+/** This function exchanges the \a i-th row and \a j-th column of the matrix in-place.
+ * The matrix must be square for this operation to be possible.
+ * \param i i-th row to swap with ...
+ * \param j ... j-th column to swap against
+ */
+bool MatrixContent::SwapRowColumn(size_t i, size_t j)
+{
+  assert (rows == columns && "The matrix must be square for swapping row against column to be possible.");
+  return (gsl_matrix_swap_rowcol (content, i, j) == GSL_SUCCESS);
+};
+
 /** Return transposed matrix.
  * \return new matrix that is transposed of this.
@@ -244 +321 @@
 {
   std::cout << "const MatrixContent::transpose()." << std::endl;
-  gsl_matrix *res = gsl_matrix_alloc(rows, columns);
+  gsl_matrix *res = gsl_matrix_alloc(columns, rows);  // column and row dimensions exchanged!
   gsl_matrix_transpose_memcpy(res, content);
   MatrixContent newContent(res);
@@ -286 +363 @@
   return eval;
 }
+
+/* ============================ Properties ============================== */
+/** Checks whether matrix' elements are strictly null.
+ * \return true - is null, false - else
+ */
+bool MatrixContent::IsNull() const
+{
+  return gsl_matrix_isnull (content);
+};
+
+/** Checks whether matrix' elements are strictly positive.
+ * \return true - is positive, false - else
+ */
+bool MatrixContent::IsPositive() const
+{
+  return gsl_matrix_ispos (content);
+};
+
+/** Checks whether matrix' elements are strictly negative.
+ * \return true - is negative, false - else
+ */
+bool MatrixContent::IsNegative() const
+{
+  return gsl_matrix_isneg (content);
+};
+
+/** Checks whether matrix' elements are strictly non-negative.
+ * \return true - is non-negative, false - else
+ */
+bool MatrixContent::IsNonNegative() const
+{
+  return gsl_matrix_isnonneg (content);
+};
+
+/** This function performs a Cholesky decomposition to determine whether matrix is positive definite.
+ * We check whether GSL returns GSL_EDOM as error, indicating that decomposition failed due to matrix not being positive-definite.
+ * \return true - matrix is positive-definite, false - else
+ */
+bool MatrixContent::IsPositiveDefinite() const
+{
+  if (rows != columns)  // only possible for square matrices.
+    return false;
+  else
+    return (gsl_linalg_cholesky_decomp (content) != GSL_EDOM);
+};
+
+
+/** Calculates the determinant of the matrix.
+ * if matrix is square, uses LU decomposition.
+ */
+double MatrixContent::Determinant() const
+{
+  int signum = 0;
+  assert (rows == columns && "Determinant can only be calculated for square matrices.");
+  gsl_permutation *p = gsl_permutation_alloc(rows);
+  gsl_linalg_LU_decomp(content, p, &signum);
+  gsl_permutation_free(p);
+  return gsl_linalg_LU_det(content, signum);
+};
+
+/* ============================= Operators =============================== */
 
 /** Scalar multiplication operator.

src/LinearAlgebra/MatrixContent.hpp

@@ -41 +41 @@
   friend Vector operator*(const MatrixContent &mat,const Vector &vec);
   friend class RealSpaceMatrix;
+  friend class LinearSystemOfEquations;
+
+  friend class MatrixContentTest;
+  friend class MatrixContentSymmetricTest;
 public:
   MatrixContent(size_t rows, size_t columns);
@@ -53 +57 @@
   const double at(size_t i, size_t j) const;
   void set(size_t i, size_t j, const double value);
+  void setFromDoubleArray(double * x);
+
+  // Exchanging elements
+  bool SwapRows(size_t i, size_t j);
+  bool SwapColumns(size_t i, size_t j);
+  bool SwapRowColumn(size_t i, size_t j);
 
   // Transformations
@@ -59 +69 @@
   gsl_vector* transformToEigenbasis();
 
+  // Properties
+  bool IsNull() const;
+  bool IsPositive() const;
+  bool IsNegative() const;
+  bool IsNonNegative() const;
+  bool IsPositiveDefinite() const;
+  double Determinant() const;
+
   // Initializing
   void setIdentity();
   void setZero();
+  void setValue(double _value);
 
   // Operators
@@ -72 +91 @@
   bool operator==(const MatrixContent &rhs) const;
 
+protected:
+  double *Pointer(size_t m, size_t n);
+  const double *const_Pointer(size_t m, size_t n) const;
 
 private:

src/LinearAlgebra/linearsystemofequations.cpp

@@ -21 +21 @@
 
 #include "defs.hpp"
-#include "LinearAlgebra/gslmatrix.hpp"
+#include "LinearAlgebra/MatrixContent.hpp"
 #include "LinearAlgebra/gslvector.hpp"
 #include "LinearAlgebra/linearsystemofequations.hpp"
@@ -37 +37 @@
 LinearSystemOfEquations::LinearSystemOfEquations(int m, int n) : rows(m), columns(n), IsSymmetric(false)
 {
-  A = new GSLMatrix(m, n);
+  A = new MatrixContent(m, n);
   b = new GSLVector(m);
   x = new GSLVector(n);
@@ -85 +85 @@
 void LinearSystemOfEquations::SetA(double *x)
 {
-  A->SetFromDoubleArray(x);
+  A->setFromDoubleArray(x);
 };
 
@@ -129 +129 @@
   if (IsSymmetric) { // use LU
     gsl_permutation * p = gsl_permutation_alloc (x->dimension);
-    gsl_linalg_LU_decomp (A->matrix, p, &s);
-    gsl_linalg_LU_solve (A->matrix, p, b->vector, x->vector);
+    gsl_linalg_LU_decomp (A->content, p, &s);
+    gsl_linalg_LU_solve (A->content, p, b->vector, x->vector);
     gsl_permutation_free (p);
   } else {  // use Householder
-    //GSLMatrix *backup = new GSLMatrix(rows,columns);
+    //MatrixContent *backup = new MatrixContent(rows,columns);
     //*backup = *A;
-    gsl_linalg_HH_solve (A->matrix, b->vector, x->vector);
+    gsl_linalg_HH_solve (A->content, b->vector, x->vector);
     //*A = *backup;
     //delete(backup);

src/LinearAlgebra/linearsystemofequations.hpp

@@ -21 +21 @@
 
 class Vector;
-class GSLMatrix;
+class MatrixContent;
 class GSLVector;
 
@@ -46 +46 @@
   GSLVector *b;
   GSLVector *x;
-  GSLMatrix *A;
+  MatrixContent *A;
 
 private:

src/unittests/Makefile.am

@@ -22 +22 @@
   CountBondsUnitTest \
   FormulaUnittest \
-  GSLMatrixSymmetricUnitTest \
-  GSLMatrixUnitTest \
   GSLVectorUnitTest \
   InfoUnitTest \
@@ -32 +30 @@
   LogUnitTest \
   manipulateAtomsTest \
+  MatrixContentSymmetricUnitTest \
+  MatrixContentUnitTest \
   MatrixUnittest \
   MenuDescriptionUnitTest \
@@ -82 +82 @@
   CountBondsUnitTest.cpp \
   FormulaUnittest.cpp \
-  gslmatrixsymmetricunittest.cpp \
-  gslmatrixunittest.cpp \
   gslvectorunittest.cpp \
   infounittest.cpp \
@@ -91 +89 @@
   listofbondsunittest.cpp \
   logunittest.cpp \
+  MatrixContentSymmetricUnittest.cpp \
+  MatrixContentUnittest.cpp \
   MatrixUnittest.cpp \
   manipulateAtomsTest.cpp \
@@ -122 +122 @@
   CountBondsUnitTest.hpp \
   FormulaUnittest.hpp \
-  gslmatrixsymmetricunittest.hpp \
-  gslmatrixunittest.hpp \
   gslvectorunittest.hpp \
   infounittest.hpp \
@@ -132 +130 @@
   logunittest.hpp \
   manipulateAtomsTest.hpp \
+  MatrixContentSymmetricUnittest.hpp \
+  MatrixContentUnittest.hpp \
   MatrixUnittest.hpp \
   MenuDescriptionUnitTest.hpp \
@@ -187 +187 @@
 FormulaUnittest_LDADD = ${ALLLIBS}
 
-GSLMatrixSymmetricUnitTest_SOURCES = UnitTestMain.cpp gslmatrixsymmetricunittest.cpp gslmatrixsymmetricunittest.hpp
-GSLMatrixSymmetricUnitTest_LDADD = ${ALLLIBS}
-
-GSLMatrixUnitTest_SOURCES = UnitTestMain.cpp gslmatrixunittest.cpp gslmatrixunittest.hpp
-GSLMatrixUnitTest_LDADD = ${ALLLIBS}
+MatrixContentSymmetricUnitTest_SOURCES = UnitTestMain.cpp MatrixContentSymmetricUnittest.cpp MatrixContentSymmetricUnittest
+MatrixContentSymmetricUnitTest_LDADD = ${ALLLIBS}
+
+MatrixContentUnitTest_SOURCES = UnitTestMain.cpp MatrixContentUnittest.cpp MatrixContentUnittest.hpp
+MatrixContentUnitTest_LDADD = ${ALLLIBS}
 
 GSLVectorUnitTest_SOURCES = UnitTestMain.cpp gslvectorunittest.cpp gslvectorunittest.hpp

src/unittests/MatrixContentSymmetricUnittest.cpp

@@ -7 +7 @@
 
 /*
- * gslmatrixunittest.cpp
+ * MatrixContentSymmetricUnittest.cpp
  *
  *  Created on: Jan 8, 2010
@@ -24 +24 @@
 #include <cppunit/ui/text/TestRunner.h>
 
-#include "gslmatrixsymmetricunittest.hpp"
+#include "MatrixContentSymmetricUnittest.hpp"
+
+#include "LinearAlgebra/MatrixContent.hpp"
 
 #ifdef HAVE_TESTRUNNER
@@ -33 +35 @@
 
 // Registers the fixture into the 'registry'
-CPPUNIT_TEST_SUITE_REGISTRATION( GSLMatrixSymmetricTest );
-
-
-void GSLMatrixSymmetricTest::setUp()
-{
-  m = new GSLMatrix(3,3);
-};
-
-void GSLMatrixSymmetricTest::tearDown()
+CPPUNIT_TEST_SUITE_REGISTRATION( MatrixContentSymmetricTest );
+
+
+void MatrixContentSymmetricTest::setUp()
+{
+  m = new MatrixContent(3,3);
+};
+
+void MatrixContentSymmetricTest::tearDown()
 {
   delete(m);
@@ -49 +51 @@
  *
  */
-void GSLMatrixSymmetricTest::AccessTest()
+void MatrixContentSymmetricTest::AccessTest()
 {
   // check whether all elements are initially zero
   for (int i=0;i<3;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( 0., m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( 0., m->at(i,j) );
 
   // set
   for (int i=0;i<3;i++)
     for (int j=0;j<3;j++)
-      m->Set(i,j, i*3+j );
+      m->set(i,j, i*3+j );
 
   // and check
@@ -65 +67 @@
   for (int i=0;i<3;i++)
     for (int j=0;j<3;j++) {
-      CPPUNIT_ASSERT_EQUAL( (double)(i*3+j), m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( (double)(i*3+j), m->at(i,j) );
       ptr = m->Pointer(i,j);
       CPPUNIT_ASSERT_EQUAL( (double)(i*3+j), *ptr );
@@ -73 +75 @@
   for (int i=0;i<3;i++)
     for (int j=0;j<3;j++)
-      m->Set(i,j, i*3+j );
-  GSLMatrix *dest = new GSLMatrix(3,3);
+      m->set(i,j, i*3+j );
+  MatrixContent *dest = new MatrixContent(3,3);
   *dest = *m;
   for (int i=0;i<3;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( dest->Get(i,j), m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( dest->at(i,j), m->at(i,j) );
   delete(dest);
 
   // out of bounds
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(4,2) );
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(2,17) );
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(1024,140040) );
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(-1,0) );
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(0,-1) );
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(-1,-1) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(4,2) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(2,17) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(1024,140040) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(-1,0) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(0,-1) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(-1,-1) );
 };
 
@@ -93 +95 @@
  *
  */
-void GSLMatrixSymmetricTest::InitializationTest()
+void MatrixContentSymmetricTest::InitializationTest()
 {
   // set zero
-  m->SetZero();
-  for (int i=0;i<3;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( 0., m->Get(i,j) );
+  m->setZero();
+  for (int i=0;i<3;i++)
+    for (int j=0;j<3;j++)
+      CPPUNIT_ASSERT_EQUAL( 0., m->at(i,j) );
 
   // set all
-  m->SetAll(1.5);
-  for (int i=0;i<3;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( 1.5, m->Get(i,j) );
+  m->setValue(1.5);
+  for (int i=0;i<3;i++)
+    for (int j=0;j<3;j++)
+      CPPUNIT_ASSERT_EQUAL( 1.5, m->at(i,j) );
 
   // set basis
-  m->SetIdentity();
-  for (int i=0;i<3;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( i == j ? 1. : 0. , m->Get(i,j) );
+  m->setIdentity();
+  for (int i=0;i<3;i++)
+    for (int j=0;j<3;j++)
+      CPPUNIT_ASSERT_EQUAL( i == j ? 1. : 0. , m->at(i,j) );
 
   // set from array
@@ -117 +119 @@
                      0., 1., 0.,
                      0., 0., 1. };
-  m->SetFromDoubleArray(array);
-  for (int i=0;i<3;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( i == j ? 1. : 0. , m->Get(i,j) );
+  m->setFromDoubleArray(array);
+  for (int i=0;i<3;i++)
+    for (int j=0;j<3;j++)
+      CPPUNIT_ASSERT_EQUAL( i == j ? 1. : 0. , m->at(i,j) );
 
 };
@@ -127 +129 @@
  *
  */
-void GSLMatrixSymmetricTest::CopyTest()
+void MatrixContentSymmetricTest::CopyTest()
 {
   // set basis
-  GSLMatrix *dest = NULL;
+  MatrixContent *dest = NULL;
   for (int i=0;i<3;i++) {
-    m->SetAll(i);
-    dest = new GSLMatrix(m);
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( m->Get(i,j) , dest->Get(i,j) );
+    m->setValue(i);
+    dest = new MatrixContent(m);
+    for (int j=0;j<3;j++)
+      CPPUNIT_ASSERT_EQUAL( m->at(i,j) , dest->at(i,j) );
 
     delete(dest);
@@ -144 +146 @@
  *
  */
-void GSLMatrixSymmetricTest::ExchangeTest()
+void MatrixContentSymmetricTest::ExchangeTest()
 {
   // set to 1,1,1,2, ...
   for (int i=0;i<3;i++)
     for (int j=0;j<3;j++)
-      m->Set(i,j, i+1 );
+      m->set(i,j, i+1 );
 
   // swap such that nothing happens
@@ -155 +157 @@
   for (int i=0;i<3;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)i+1., m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( (double)i+1., m->at(i,j) );
 
   // swap two rows
@@ -163 +165 @@
       switch (j) {
         case 0:
-          CPPUNIT_ASSERT_EQUAL( 1., m->Get(j,i) );
+          CPPUNIT_ASSERT_EQUAL( 1., m->at(j,i) );
           break;
         case 1:
-          CPPUNIT_ASSERT_EQUAL( 3., m->Get(j,i) );
+          CPPUNIT_ASSERT_EQUAL( 3., m->at(j,i) );
           break;
         case 2:
-          CPPUNIT_ASSERT_EQUAL( 2., m->Get(j,i) );
+          CPPUNIT_ASSERT_EQUAL( 2., m->at(j,i) );
           break;
         default:
-          CPPUNIT_ASSERT_EQUAL( -1., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( -1., m->at(i,j) );
       }
   // check that op is reversable
@@ -178 +180 @@
   for (int i=0;i<3;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)i+1., m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( (double)i+1., m->at(i,j) );
 
   // set to 1,2,3,1, ...
   for (int i=0;i<3;i++)
     for (int j=0;j<3;j++)
-      m->Set(i,j, j+1. );
+      m->set(i,j, j+1. );
 
   // swap such that nothing happens
@@ -189 +191 @@
   for (int i=0;i<3;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)j+1., m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( (double)j+1., m->at(i,j) );
 
   // swap two columns
@@ -197 +199 @@
       switch (j) {
         case 0:
-          CPPUNIT_ASSERT_EQUAL( 3., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( 3., m->at(i,j) );
           break;
         case 1:
-          CPPUNIT_ASSERT_EQUAL( 2., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( 2., m->at(i,j) );
           break;
         case 2:
-          CPPUNIT_ASSERT_EQUAL( 1., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( 1., m->at(i,j) );
           break;
         default:
-          CPPUNIT_ASSERT_EQUAL( -1., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( -1., m->at(i,j) );
       }
   // check that op is reversable
@@ -212 +214 @@
   for (int i=0;i<3;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)j+1., m->Get(i,j) );
-
-
-  // set to 1,2,3,4, ...
-  for (int i=0;i<3;i++)
-    for (int j=0;j<3;j++)
-      m->Set(i,j, 3*i+j+1 );
+      CPPUNIT_ASSERT_EQUAL( (double)j+1., m->at(i,j) );
+
+
+  // set to 1,2,3, ...
+  MatrixContent *n =  new MatrixContent(3,3);
+  for (int i=0;i<3;i++)
+    for (int j=0;j<3;j++) {
+      m->set(i,j, 3*i+j+1 );
+      n->set(i,j, 3*j+i+1 );
+    }
   // transpose
-  m->Transpose();
-  for (int i=0;i<3;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)(3*i+j+1), m->Get(j,i) );
+  MatrixContent res = ((const MatrixContent)*m).transpose();
+  CPPUNIT_ASSERT( *n == res );
   // second transpose
-  m->Transpose();
-  for (int i=0;i<3;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)(3*i+j+1), m->Get(i,j) );
+  res.transpose();
+  CPPUNIT_ASSERT( *m == res );
 };
 
@@ -234 +235 @@
  *
  */
-void GSLMatrixSymmetricTest::PropertiesTest()
+void MatrixContentSymmetricTest::PropertiesTest()
 {
   // is zero
-  m->SetZero();
+  m->setZero();
   CPPUNIT_ASSERT_EQUAL( true, m->IsNull() );
   CPPUNIT_ASSERT_EQUAL( false, m->IsPositive() );
@@ -244 +245 @@
 
   // is positive
-  m->SetAll(0.5);
+  m->setValue(0.5);
   CPPUNIT_ASSERT_EQUAL( false, m->IsNull() );
   CPPUNIT_ASSERT_EQUAL( true, m->IsPositive() );
@@ -251 +252 @@
 
   // is negative
-  m->SetAll(-0.1);
+  m->setValue(-0.1);
   CPPUNIT_ASSERT_EQUAL( false, m->IsNull() );
   CPPUNIT_ASSERT_EQUAL( false, m->IsPositive() );
@@ -261 +262 @@
                      0., 1., 1.,
                      0., 0., 1. };
-  m->SetFromDoubleArray(array);
+  m->setFromDoubleArray(array);
   CPPUNIT_ASSERT_EQUAL( true, m->IsPositiveDefinite() );
 
   //determinant
-  m->SetIdentity();
+  m->setIdentity();
   CPPUNIT_ASSERT_EQUAL( 1., m->Determinant() );
 
-  m->SetZero();
+  m->setZero();
   CPPUNIT_ASSERT_EQUAL( 0., m->Determinant() );
 
-  m->Set( 0, 0, 1.);
-  m->Set( 1, 1, 1.);
-  m->Set( 2, 1, 1.);
+  m->set( 0, 0, 1.);
+  m->set( 1, 1, 1.);
+  m->set( 2, 1, 1.);
   CPPUNIT_ASSERT_EQUAL( 0., m->Determinant() );
   
@@ -279 +280 @@
                      -3., 1., 1.,
                      1., 5.5, 1. };
-  m->SetFromDoubleArray(array2);
+  m->setFromDoubleArray(array2);
   CPPUNIT_ASSERT_EQUAL( -26.5, m->Determinant() );
 };

src/unittests/MatrixContentSymmetricUnittest.hpp

@@ -1 +1 @@
 /*
- * gslmatrixunittest.hpp
+ * MatrixContentSymmetricUnittest.hpp
  *
  *  Created on: Jan 8, 2010
@@ -6 +6 @@
  */
 
-#ifndef GSLMATRIXUNITTEST_HPP_
-#define GSLMATRIXUNITTEST_HPP_
+#ifndef MATRIXCONTENTSYMMETRICUNITTEST_HPP_
+#define MATRIXCONTENTSYMMETRICUNITTEST_HPP_
 
 #include <cppunit/extensions/HelperMacros.h>
 
-#include "LinearAlgebra/gslmatrix.hpp"
+class MatrixContent;
 
 /********************************************** Test classes **************************************/
 
-class GSLMatrixSymmetricTest : public CppUnit::TestFixture
+class MatrixContentSymmetricTest : public CppUnit::TestFixture
 {
-    CPPUNIT_TEST_SUITE( GSLMatrixSymmetricTest) ;
+    CPPUNIT_TEST_SUITE( MatrixContentSymmetricTest) ;
     CPPUNIT_TEST (AccessTest );
     CPPUNIT_TEST (InitializationTest );
@@ -36 +36 @@
 
 private:
-    GSLMatrix *m;
+    MatrixContent *m;
 };
 
 
-#endif /* GSLMATRIXUNITTEST_HPP_ */
+#endif /* MATRIXCONTENTSYMMETRICUNITTEST_HPP_ */

src/unittests/MatrixContentUnittest.cpp

@@ -7 +7 @@
 
 /*
- * gslmatrixunittest.cpp
+ * MatrixContentUnittest.cpp
  *
  *  Created on: Jan 8, 2010
@@ -24 +24 @@
 #include <cppunit/ui/text/TestRunner.h>
 
-#include "gslmatrixunittest.hpp"
+#include "MatrixContentUnittest.hpp"
+
+#include "LinearAlgebra/MatrixContent.hpp"
 
 #ifdef HAVE_TESTRUNNER
@@ -33 +35 @@
 
 // Registers the fixture into the 'registry'
-CPPUNIT_TEST_SUITE_REGISTRATION( GSLMatrixTest );
-
-
-void GSLMatrixTest::setUp()
-{
-  m = new GSLMatrix(4,3);
-};
-
-void GSLMatrixTest::tearDown()
+CPPUNIT_TEST_SUITE_REGISTRATION( MatrixContentTest );
+
+
+void MatrixContentTest::setUp()
+{
+  m = new MatrixContent(4,3);
+};
+
+void MatrixContentTest::tearDown()
 {
   delete(m);
@@ -49 +51 @@
  *
  */
-void GSLMatrixTest::AccessTest()
+void MatrixContentTest::AccessTest()
 {
   // check whether all elements are initially zero
   for (int i=0;i<4;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( 0., m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( 0., m->at(i,j) );
 
   // set
   for (int i=0;i<4;i++)
     for (int j=0;j<3;j++)
-      m->Set(i,j, i*3+j );
+      m->set(i,j, i*3+j );
 
   // and check
@@ -65 +67 @@
   for (int i=0;i<4;i++)
     for (int j=0;j<3;j++) {
-      CPPUNIT_ASSERT_EQUAL( (double)(i*3+j), m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( (double)(i*3+j), m->at(i,j) );
       ptr = m->Pointer(i,j);
       CPPUNIT_ASSERT_EQUAL( (double)(i*3+j), *ptr );
@@ -73 +75 @@
   for (int i=0;i<4;i++)
     for (int j=0;j<3;j++)
-      m->Set(i,j, i*3+j );
-  GSLMatrix *dest = new GSLMatrix(4,3);
+      m->set(i,j, i*3+j );
+  MatrixContent *dest = new MatrixContent(4,3);
   *dest = *m;
   for (int i=0;i<4;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( dest->Get(i,j), m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( dest->at(i,j), m->at(i,j) );
   delete(dest);
 
   // out of bounds
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(5,2) );
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(2,17) );
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(1024,140040) );
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(-1,0) );
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(0,-1) );
-  //CPPUNIT_ASSERT_EQUAL(0., v->Get(-1,-1) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(5,2) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(2,17) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(1024,140040) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(-1,0) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(0,-1) );
+  //CPPUNIT_ASSERT_EQUAL(0., v->at(-1,-1) );
 };
 
@@ -93 +95 @@
  *
  */
-void GSLMatrixTest::InitializationTest()
+void MatrixContentTest::InitializationTest()
 {
   // set zero
-  m->SetZero();
-  for (int i=0;i<4;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( 0., m->Get(i,j) );
+  m->setZero();
+  for (int i=0;i<4;i++)
+    for (int j=0;j<3;j++)
+      CPPUNIT_ASSERT_EQUAL( 0., m->at(i,j) );
 
   // set all
-  m->SetAll(1.5);
-  for (int i=0;i<4;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( 1.5, m->Get(i,j) );
+  m->setValue(1.5);
+  for (int i=0;i<4;i++)
+    for (int j=0;j<3;j++)
+      CPPUNIT_ASSERT_EQUAL( 1.5, m->at(i,j) );
 
   // set basis
-  m->SetIdentity();
-  for (int i=0;i<4;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( i == j ? 1. : 0. , m->Get(i,j) );
+  m->setIdentity();
+  for (int i=0;i<4;i++)
+    for (int j=0;j<3;j++)
+      CPPUNIT_ASSERT_EQUAL( i == j ? 1. : 0. , m->at(i,j) );
 
   // set from array
@@ -118 +120 @@
                      0., 0., 1.,
                      0., 0., 0. };
-  m->SetFromDoubleArray(array);
-  for (int i=0;i<4;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( i == j ? 1. : 0. , m->Get(i,j) );
+  m->setFromDoubleArray(array);
+  for (int i=0;i<4;i++)
+    for (int j=0;j<3;j++)
+      CPPUNIT_ASSERT_EQUAL( i == j ? 1. : 0. , m->at(i,j) );
 
 };
@@ -128 +130 @@
  *
  */
-void GSLMatrixTest::CopyTest()
+void MatrixContentTest::CopyTest()
 {
   // set basis
-  GSLMatrix *dest = NULL;
+  MatrixContent *dest = NULL;
   for (int i=0;i<4;i++) {
-    m->SetAll(i);
-    dest = new GSLMatrix(m);
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( m->Get(i,j) , dest->Get(i,j) );
+    m->setValue(i);
+    dest = new MatrixContent(m);
+    for (int j=0;j<3;j++)
+      CPPUNIT_ASSERT_EQUAL( m->at(i,j) , dest->at(i,j) );
 
     delete(dest);
@@ -145 +147 @@
  *
  */
-void GSLMatrixTest::ExchangeTest()
+void MatrixContentTest::ExchangeTest()
 {
   // set to 1,1,1,2, ...
   for (int i=0;i<4;i++)
     for (int j=0;j<3;j++)
-      m->Set(i,j, i+1 );
+      m->set(i,j, i+1 );
 
   // swap such that nothing happens
@@ -156 +158 @@
   for (int i=0;i<4;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)i+1., m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( (double)i+1., m->at(i,j) );
 
   // swap two rows
@@ -164 +166 @@
       switch (i) {
         case 0:
-          CPPUNIT_ASSERT_EQUAL( 1., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( 1., m->at(i,j) );
           break;
         case 1:
-          CPPUNIT_ASSERT_EQUAL( 3., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( 3., m->at(i,j) );
           break;
         case 2:
-          CPPUNIT_ASSERT_EQUAL( 2., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( 2., m->at(i,j) );
           break;
         case 3:
-          CPPUNIT_ASSERT_EQUAL( 4., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( 4., m->at(i,j) );
           break;
         default:
-          CPPUNIT_ASSERT_EQUAL( -1., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( -1., m->at(i,j) );
       }
   // check that op is reversable
@@ -182 +184 @@
   for (int i=0;i<4;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)i+1., m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( (double)i+1., m->at(i,j) );
 
   // set to 1,2,3,1, ...
   for (int i=0;i<4;i++)
     for (int j=0;j<3;j++)
-      m->Set(i,j, j+1. );
+      m->set(i,j, j+1. );
 
   // swap such that nothing happens
@@ -193 +195 @@
   for (int i=0;i<4;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)j+1., m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( (double)j+1., m->at(i,j) );
 
   // swap two columns
@@ -201 +203 @@
       switch (j) {
         case 0:
-          CPPUNIT_ASSERT_EQUAL( 3., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( 3., m->at(i,j) );
           break;
         case 1:
-          CPPUNIT_ASSERT_EQUAL( 2., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( 2., m->at(i,j) );
           break;
         case 2:
-          CPPUNIT_ASSERT_EQUAL( 1., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( 1., m->at(i,j) );
           break;
         default:
-          CPPUNIT_ASSERT_EQUAL( -1., m->Get(i,j) );
+          CPPUNIT_ASSERT_EQUAL( -1., m->at(i,j) );
       }
   // check that op is reversable
@@ -216 +218 @@
   for (int i=0;i<4;i++)
     for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)j+1., m->Get(i,j) );
+      CPPUNIT_ASSERT_EQUAL( (double)j+1., m->at(i,j) );
 
 
   // set to 1,2,3,4, ...
-  for (int i=0;i<4;i++)
-    for (int j=0;j<3;j++)
-      m->Set(i,j, 3*i+j+1 );
+  MatrixContent *n =  new MatrixContent(3,4);
+  for (int i=0;i<4;i++)
+    for (int j=0;j<3;j++) {
+      m->set(i,j, 3*i+j+1 );
+      n->set(j,i, 3*i+j+1 );
+    }
   // transpose
-  CPPUNIT_ASSERT_EQUAL( true, m->Transpose() );
-  for (int i=0;i<4;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)(3*i+j+1), m->Get(j,i) );
+  MatrixContent res = ((const MatrixContent)(*m)).transpose();
+  CPPUNIT_ASSERT( *n == res );
   // second transpose
-  CPPUNIT_ASSERT_EQUAL( true, m->Transpose() );
-  for (int i=0;i<4;i++)
-    for (int j=0;j<3;j++)
-      CPPUNIT_ASSERT_EQUAL( (double)(3*i+j+1), m->Get(i,j) );
+  MatrixContent res2 = ((const MatrixContent)res).transpose();
+  CPPUNIT_ASSERT( *m == res2 );
 };
 
@@ -238 +239 @@
  *
  */
-void GSLMatrixTest::PropertiesTest()
+void MatrixContentTest::PropertiesTest()
 {
   // is zero
-  m->SetZero();
+  m->setZero();
   CPPUNIT_ASSERT_EQUAL( true, m->IsNull() );
   CPPUNIT_ASSERT_EQUAL( false, m->IsPositive() );
@@ -248 +249 @@
 
   // is positive
-  m->SetAll(0.5);
+  m->setValue(0.5);
   CPPUNIT_ASSERT_EQUAL( false, m->IsNull() );
   CPPUNIT_ASSERT_EQUAL( true, m->IsPositive() );
@@ -255 +256 @@
 
   // is negative
-  m->SetAll(-0.1);
+  m->setValue(-0.1);
   CPPUNIT_ASSERT_EQUAL( false, m->IsNull() );
   CPPUNIT_ASSERT_EQUAL( false, m->IsPositive() );

src/unittests/MatrixContentUnittest.hpp

@@ -1 +1 @@
 /*
- * gslmatrixunittest.hpp
+ * MatrixContentUnittest.hpp
  *
  *  Created on: Jan 8, 2010
@@ -6 +6 @@
  */
 
-#ifndef GSLMATRIXUNITTEST_HPP_
-#define GSLMATRIXUNITTEST_HPP_
+#ifndef MATRIXCONTENTUNITTEST_HPP_
+#define MATRIXCONTENTUNITTEST_HPP_
 
 #include <cppunit/extensions/HelperMacros.h>
 
-#include "LinearAlgebra/gslmatrix.hpp"
+class MatrixContent;
 
 /********************************************** Test classes **************************************/
 
-class GSLMatrixTest : public CppUnit::TestFixture
+class MatrixContentTest : public CppUnit::TestFixture
 {
-    CPPUNIT_TEST_SUITE( GSLMatrixTest) ;
+    CPPUNIT_TEST_SUITE( MatrixContentTest) ;
     CPPUNIT_TEST (AccessTest );
     CPPUNIT_TEST (InitializationTest );
@@ -36 +36 @@
 
 private:
-    GSLMatrix *m;
+    MatrixContent *m;
 };
 
 
-#endif /* GSLMATRIXUNITTEST_HPP_ */
+#endif /* MATRIXCONTENTUNITTEST_HPP_ */