
//
//              LAPACK++ 1.1 Linear Algebra Package 1.1
//               University of Tennessee, Knoxvilee, TN.
//            Oak Ridge National Laboratory, Oak Ridge, TN.
//        Authors: J. J. Dongarra, E. Greaser, R. Pozo, D. Walker
//                 (C) 1992-1996 All Rights Reserved
//
//                             NOTICE
//
// Permission to use, copy, modify, and distribute this software and
// its documentation for any purpose and without fee is hereby granted
// provided that the above copyright notice appear in all copies and
// that both the copyright notice and this permission notice appear in
// supporting documentation.
//
// Neither the Institutions (University of Tennessee, and Oak Ridge National
// Laboratory) nor the Authors make any representations about the suitability 
// of this software for any purpose.  This software is provided ``as is'' 
// without express or implied warranty.
//
// LAPACK++ was funded in part by the U.S. Department of Energy, the
// National Science Foundation and the State of Tennessee.

#include "lafnames.h"
#include LA_TRIDIAG_MAT_DOUBLE_H


double LaTridiagMatDouble::outofbounds_ = 0; // set outofbounds_. 

int LaTridiagMatDouble::debug_ = 0; // set debug to 0 initially.

int* LaTridiagMatDouble::info_= new int;  // turn off info print flag.

double& LaTridiagMatDouble::operator()(int i,int j)
{
        int tmp = i-j;
        switch (tmp)
    {
        case 0:   // main
            if (i>d_.size()-1)
                return outofbounds_;
            else
                return d_(i);
        case 1:  // lower
            if (i>dl_.size()-1)
                return outofbounds_;
            else
                return dl_(i);
        case -1:   // upper
            if (i>du_.size()-1)
                return outofbounds_;
            else
                return du_(i);
        default:
            return outofbounds_;
    }
}


const double& LaTridiagMatDouble::operator()(int i,int j) const
{
        int tmp = i-j;
        switch (tmp)
    {
        case 0:   // main
            if (i>d_.size()-1)
                return outofbounds_;
            else
                return d_(i);
        case 1:  // lower
            if (i>dl_.size()-1)
                return outofbounds_;
            else
                return dl_(i);
        case -1:   // upper
            if (i>du_.size()-1)
                return outofbounds_;
            else
                return du_(i);
        default:
            return outofbounds_;
    }
}


 LaVectorDouble LaTridiagMatDouble::diag(int k)
{

    LaVectorDouble tmp;

    switch (k)
    {
        case 0:   // main
            tmp.ref(d_);  break;
        case -1:  // lower
            tmp.ref(dl_); break;
        case 1:   // upper
            tmp.ref(du_); break;
        case 2:   // second upper
            tmp.ref(du2_); break;
        default:
            cerr <<"Unrecognized integer representation of diagonal\n";
    }

    return tmp;
}


 LaVectorDouble LaTridiagMatDouble::diag(int k) const
{

    LaVectorDouble tmp;

    switch (k)
    {
        case 0:   // main
            tmp.ref(d_);
            break;
        case -1:  // lower
            tmp.ref(dl_);
            break;
        case 1:   // upper
            tmp.ref(du_);
            break;
        case 2:   // second upper
            tmp.ref(du2_);
            break;
        default:
            cerr <<"Unrecognized integer representation of diagonal\n";
    }
                    
    return tmp;
}


ostream& operator<<(ostream& s, const LaTridiagMatDouble& td)

{
  if (*(td.info_))     // print out only matrix info, not actual values
  {
      *(td.info_) = 0; // reset the flag
      s << "superdiag: (" << td.du_.size() << ") " ;
      s <<" #ref: "<< td.du_.ref_count()<< endl;
      s << "maindiag: (" << td.d_.size() << ") " ;
      s <<" #ref: "<< td.d_.ref_count()<< endl;
      s << "subdiag: (" << td.dl_.size() << ") " ;
      s <<" #ref: "<< td.dl_.ref_count()<< endl;
  }
  else
  {
    s << td.diag(1);
    s << td.diag(0);
    s << td.diag(-1);
    s << endl;
  } 
  return s;
}
