Matrix_TriangPacked.cxx

// Copyright (C) 2001-2011 Vivien Mallet
// Copyright (C) 2003-2011 Marc Duruflé
//
// This file is part of the linear-algebra library Seldon,
// http://seldon.sourceforge.net/.
//
// Seldon 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.
//
// Seldon 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 Seldon. If not, see http://www.gnu.org/licenses/.
 
 
#ifndef SELDON_FILE_MATRIX_TRIANGPACKED_CXX
 
#include "Matrix_TriangPacked.hxx"
 
namespace Seldon
{
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  Matrix_TriangPacked<T, Prop, Storage, Allocator>
  ::Matrix_TriangPacked(int i, int j): Matrix_Base<T, Allocator>(i, i)
  {
 
#ifdef SELDON_CHECK_MEMORY
    try
      {
#endif
 
        this->data_ = Allocator::allocate((i * long(i + 1)) / 2, this);
 
#ifdef SELDON_CHECK_MEMORY
      }
    catch (...)
      {
        this->m_ = 0;
        this->n_ = 0;
        this->data_ = NULL;
        return;
      }
    if (this->data_ == NULL)
      {
        this->m_ = 0;
        this->n_ = 0;
        return;
      }
#endif
 
  }
 
 
  template <class T, class Prop, class Storage, class Allocator>
  Matrix_TriangPacked<T, Prop, Storage, Allocator>
  ::Matrix_TriangPacked(const Matrix_TriangPacked<T, Prop,
                        Storage, Allocator>& A)
    : Matrix_Base<T, Allocator>()
  {
    this->m_ = 0;
    this->n_ = 0;
    this->data_ = NULL;
 
    this->Copy(A);
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::Clear()
  {
    
#ifdef SELDON_CHECK_MEMORY
    try
      {
#endif
 
        if (this->data_ != NULL)
          {
            Allocator::deallocate(this->data_,
                                  (this->m_ * long(this->m_ + 1)) / 2);
            this->data_ = NULL;
          }
 
#ifdef SELDON_CHECK_MEMORY
      }
    catch (...)
      {
        this->m_ = 0;
        this->n_ = 0;
        this->data_ = NULL;
      }
#endif
 
    this->m_ = 0;
    this->n_ = 0;
  }
 
 
  /*********************
   * MEMORY MANAGEMENT *
   *********************/
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>
  ::Reallocate(int i, int j)
  {
 
    if (i != this->m_)
      {
        this->m_ = i;
        this->n_ = i;
 
#ifdef SELDON_CHECK_MEMORY
        try
          {
#endif
 
            this->data_ =
              reinterpret_cast<pointer>(Allocator::reallocate(this->data_,
                                                              (i*long(i+1))/2, this) );
 
#ifdef SELDON_CHECK_MEMORY
          }
        catch (...)
          {
            this->m_ = 0;
            this->n_ = 0;
            this->data_ = NULL;
            throw NoMemory("Matrix_TriangPacked::Reallocate(int, int)",
                           "Unable to reallocate memory for data_.");
          }
        if (this->data_ == NULL)
          {
            this->m_ = 0;
            this->n_ = 0;
            throw NoMemory("Matrix_TriangPacked::Reallocate(int, int)",
                           "Unable to reallocate memory for data_.");
          }
#endif
 
      }
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::
  SetData(int i, int j,
          typename Matrix_TriangPacked<T, Prop, Storage, Allocator>
          ::pointer data)
  {
    this->Clear();
 
    this->m_ = i;
    this->n_ = i;
 
    this->data_ = data;
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::Nullify()
  {
    this->data_ = NULL;
    this->m_ = 0;
    this->n_ = 0;
  }
 
  
  /************************
   * CONVENIENT FUNCTIONS *
   ************************/
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::Zero()
  {
    Allocator::memoryset(this->data_, char(0),
                         this->GetDataSize() * sizeof(value_type));
  }
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::SetIdentity()
  {
    T zero, one;
    SetComplexZero(zero);
    SetComplexOne(one);
    
    this->Fill(zero);
 
    bool storage_col = (Storage::GetFirst(1,0) == 0);
    if ((Storage::UpLo() && storage_col)||(!Storage::UpLo() && !storage_col))
      {
        long index(-1);
        for (int i = 0; i < min(this->m_, this->n_); i++)
          {
            index += i+1;
            this->data_[index] = one;
          }
      }
    else if (Storage::UpLo() && !storage_col)
      {
        long index(0);
        for (int i = 0; i < min(this->m_, this->n_); i++)
          {
            this->data_[index] = one;
            index += this->m_-i;
          }
      }
    else if (!Storage::UpLo() && storage_col)
      {
        long index(0);
        for (int i = 0; i < min(this->m_, this->n_); i++)
          {
            this->data_[index] = one;
            index += this->n_-i;
          }
      }
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::Fill()
  {
    for (long i = 0; i < this->GetDataSize(); i++)
      SetComplexReal(i, this->data_[i]);
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  template <class T0>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::Fill(const T0& x)
  {
    T x_;
    SetComplexReal(x, x_);
    for (long i = 0; i < this->GetDataSize(); i++)
      this->data_[i] = x_;
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  template <class T0>
  Matrix_TriangPacked<T, Prop, Storage, Allocator>&
  Matrix_TriangPacked<T, Prop, Storage, Allocator>::operator= (const T0& x)
  {
    this->Fill(x);
 
    return *this;
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::FillRand()
  {
#ifndef SELDON_WITHOUT_REINIT_RANDOM
    srand(time(NULL));
#endif
    for (long i = 0; i < this->GetDataSize(); i++)
      SetComplexReal(rand(), this->data_[i]);
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::Print() const
  {
    for (int i = 0; i < this->m_; i++)
      {
        for (int j = 0; j < this->n_; j++)
          cout << (*this)(i, j) << "\t";
        cout << endl;
      }
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>
  ::Print(int a, int b, int m, int n) const
  {
    for (int i = a; i < min(this->m_, a + m); i++)
      {
        for (int j = b; j < min(this->n_, b + n); j++)
          cout << (*this)(i, j) << "\t";
        cout << endl;
      }
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::Print(int l) const
  {
    Print(0, 0, l, l);
  }
 
 
  /**************************
   * INPUT/OUTPUT FUNCTIONS *
   **************************/
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>
  ::Write(string FileName) const
  {
    ofstream FileStream;
    FileStream.open(FileName.c_str(), ofstream::binary);
 
#ifdef SELDON_CHECK_IO
    // Checks if the file was opened.
    if (!FileStream.is_open())
      throw IOError("Matrix_TriangPacked::Write(string FileName)",
                    string("Unable to open file \"") + FileName + "\".");
#endif
 
    this->Write(FileStream);
 
    FileStream.close();
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>
  ::Write(ostream& FileStream) const
  {
 
#ifdef SELDON_CHECK_IO
    // Checks if the file is ready.
    if (!FileStream.good())
      throw IOError("Matrix_TriangPacked::Write(ofstream& FileStream)",
                    "Stream is not ready.");
#endif
 
    FileStream.write(reinterpret_cast<char*>(const_cast<int*>(&this->m_)),
                     sizeof(int));
    FileStream.write(reinterpret_cast<char*>(const_cast<int*>(&this->n_)),
                     sizeof(int));
 
    FileStream.write(reinterpret_cast<char*>(this->data_),
                     this->GetDataSize() * sizeof(value_type));
 
#ifdef SELDON_CHECK_IO
    // Checks if data was written.
    if (!FileStream.good())
      throw IOError("Matrix_TriangPacked::Write(ofstream& FileStream)",
                    string("Output operation failed.")
                    + string(" The output file may have been removed")
                    + " or there is no space left on device.");
#endif
 
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>
  ::WriteText(string FileName) const
  {
    ofstream FileStream;
    FileStream.precision(cout.precision());
    FileStream.flags(cout.flags());
    FileStream.open(FileName.c_str());
 
#ifdef SELDON_CHECK_IO
    // Checks if the file was opened.
    if (!FileStream.is_open())
      throw IOError("Matrix_TriangPacked::WriteText(string FileName)",
                    string("Unable to open file \"") + FileName + "\".");
#endif
 
    this->WriteText(FileStream);
 
    FileStream.close();
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>
  ::WriteText(ostream& FileStream) const
  {
 
#ifdef SELDON_CHECK_IO
    // Checks if the stream is ready.
    if (!FileStream.good())
      throw IOError("Matrix_TriangPacked::WriteText(ofstream& FileStream)",
                    "Stream is not ready.");
#endif
 
    int i, j;
    for (i = 0; i < this->GetM(); i++)
      {
        for (j = 0; j < this->GetN(); j++)
          FileStream << (*this)(i, j) << '\t';
        FileStream << '\n';
      }
 
#ifdef SELDON_CHECK_IO
    // Checks if data was written.
    if (!FileStream.good())
      throw IOError("Matrix_TriangPacked::WriteText(ofstream& FileStream)",
                    string("Output operation failed.")
                    + string(" The output file may have been removed")
                    + " or there is no space left on device.");
#endif
 
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::Read(string FileName)
  {
    ifstream FileStream;
    FileStream.open(FileName.c_str(), ifstream::binary);
 
#ifdef SELDON_CHECK_IO
    // Checks if the file was opened.
    if (!FileStream.good())
      throw IOError("Matrix_TriangPacked::Read(string FileName)",
                    string("Unable to open file \"") + FileName + "\".");
#endif
 
    this->Read(FileStream);
 
    FileStream.close();
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>
  ::Read(istream& FileStream)
  {
 
#ifdef SELDON_CHECK_IO
    // Checks if the stream is ready.
    if (!FileStream.good())
      throw IOError("Matrix_TriangPacked::Read(ifstream& FileStream)",
                    "Stream is not ready.");
#endif
 
    int new_m, new_n;
    FileStream.read(reinterpret_cast<char*>(&new_m), sizeof(int));
    FileStream.read(reinterpret_cast<char*>(&new_n), sizeof(int));
    this->Reallocate(new_m, new_n);
 
    FileStream.read(reinterpret_cast<char*>(this->data_),
                    this->GetDataSize() * sizeof(value_type));
 
#ifdef SELDON_CHECK_IO
    // Checks if data was read.
    if (!FileStream.good())
      throw IOError("Matrix_TriangPacked::Read(ifstream& FileStream)",
                    string("Input operation failed.")
                    + string(" The input file may have been removed")
                    + " or may not contain enough data.");
#endif
 
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>::ReadText(string FileName)
  {
    ifstream FileStream;
    FileStream.open(FileName.c_str());
 
#ifdef SELDON_CHECK_IO
    // Checks if the file was opened.
    if (!FileStream.is_open())
      throw IOError("Matrix_Pointers::ReadText(string FileName)",
                    string("Unable to open file \"") + FileName + "\".");
#endif
 
    this->ReadText(FileStream);
 
    FileStream.close();
  }
 
 
 
  template <class T, class Prop, class Storage, class Allocator>
  void Matrix_TriangPacked<T, Prop, Storage, Allocator>
  ::ReadText(istream& FileStream)
  {
    // clears previous matrix
    Clear();
 
#ifdef SELDON_CHECK_IO
    // Checks if the stream is ready.
    if (!FileStream.good())
      throw IOError("Matrix_Pointers::ReadText(ifstream& FileStream)",
                    "Stream is not ready.");
#endif
 
    // we read first line
    string line;
    getline(FileStream, line);
 
    if (FileStream.fail())
      {
        // empty file ?
        return;
      }
 
    // converting first line into a vector
    istringstream line_stream(line);
    Vector<T> first_row;
    first_row.ReadText(line_stream);
 
    // and now the other rows
    Vector<T> other_rows;
    other_rows.ReadText(FileStream);
 
    // number of rows and columns
    int n = first_row.GetM();
    int m = 1 + other_rows.GetM()/n;
 
#ifdef SELDON_CHECK_IO
    // Checking number of elements
    if (other_rows.GetM() != (m-1)*n)
      throw IOError("Matrix_Pointers::ReadText(ifstream& FileStream)",
                    "The file should contain same number of columns.");
#endif
 
    this->Reallocate(m,n);
    // filling matrix
    if (Storage::UpLo())
      for (int j = 0; j < n; j++)
        this->Val(0, j) = first_row(j);
    else
      this->Val(0, 0) = first_row(0);
 
    long nb = 0;
    if (Storage::UpLo())
      for (int i = 1; i < m; i++)
        {
          for (int j = 0; j < i; j++)
            nb++;
 
          for (int j = i; j < n; j++)
            this->Val(i, j) = other_rows(nb++);
        }
    else
      for (int i = 1; i < m; i++)
        {
          for (int j = 0; j <= i; j++)
            this->Val(i, j) = other_rows(nb++);
 
          for (int j = i+1; j < n; j++)
            nb++;
        }
  }
 
 
  
  // MATRIX<COLUPTRIANGPACKED> //
 
 
  /*****************
   * OTHER METHODS *
   *****************/
 
 
 
  template <class T, class Prop, class Allocator>
  void Matrix<T, Prop, ColUpTriangPacked, Allocator>
  ::Resize(int i, int j)
  {
 
    // Storing the old values of the matrix.
    long nold = this->GetDataSize();
    Vector<T, VectFull, Allocator> xold(nold);
    for (long k = 0; k < nold; k++)
      xold(k) = this->data_[k];
 
    // Reallocation.
    this->Reallocate(i, j);
 
    // Filling the matrix with its old values.
    long nmin = min(nold, this->GetDataSize());
    for (long k = 0; k < nmin; k++)
      this->data_[k] = xold(k);
  }
 
 
  // MATRIX<COLLOTRIANGPACKED> //
 
 
  /*****************
   * OTHER METHODS *
   *****************/
 
 
 
  template <class T, class Prop, class Allocator>
  void Matrix<T, Prop, ColLoTriangPacked, Allocator>
  ::Resize(int i, int j)
  {
 
    // Storing the old values of the matrix.
    long nold = this->GetDataSize(), iold = this->m_;
    Vector<T, VectFull, Allocator> xold(nold);
    for (long k = 0; k < nold; k++)
      xold(k) = this->data_[k];
 
    // Reallocation.
    this->Reallocate(i, j);
 
    // Filling the matrix with its old values.
    long imin = min(iold, long(i));
    nold = 0;
    long n = 0;
    for (long k = 0; k < imin; k++)
      {
        for (long l = k; l < imin; l++)
          this->data_[n+l-k] = xold(nold+l-k);
 
        n += i - k;
        nold += iold - k;
      }
  }
 
 
  // MATRIX<ROWUPTRIANGPACKED> //
 
 
  /*****************
   * OTHER METHODS *
   *****************/
 
 
 
  template <class T, class Prop, class Allocator>
  void Matrix<T, Prop, RowUpTriangPacked, Allocator>
  ::Resize(int i, int j)
  {
 
    // Storing the old values of the matrix.
    long nold = this->GetDataSize(), iold = this->m_;
    Vector<T, VectFull, Allocator> xold(nold);
    for (long k = 0; k < nold; k++)
      xold(k) = this->data_[k];
 
    // Reallocation.
    this->Reallocate(i, j);
 
    // Filling the matrix with its old values.
    long imin = min(iold, long(i));
    nold = 0;
    long n = 0;
    for (long k = 0; k < imin; k++)
      {
        for (long l = k; l < imin; l++)
          this->data_[n+l-k] = xold(nold+l-k);
 
        n += i - k;
        nold += iold - k;
      }
  }
 
 
 
  // MATRIX<ROWLOTRIANGPACKED> //
 
 
  /*****************
   * OTHER METHODS *
   *****************/
 
 
 
  template <class T, class Prop, class Allocator>
  void Matrix<T, Prop, RowLoTriangPacked, Allocator>
  ::Resize(int i, int j)
  {
 
    // Storing the old values of the matrix.
    long nold = this->GetDataSize();
    Vector<T, VectFull, Allocator> xold(nold);
    for (long k = 0; k < nold; k++)
      xold(k) = this->data_[k];
 
    // Reallocation.
    this->Reallocate(i, j);
 
    // Filling the matrix with its old values.
    long nmin = min(nold, this->GetDataSize());
    for (long k = 0; k < nmin; k++)
      this->data_[k] = xold(k);
  }
 
  
} // namespace Seldon.
 
#define SELDON_FILE_MATRIX_TRIANGPACKED_CXX
#endif