a_mat_r.cxx

Go to the documentation of this file.

/*
Copyright 2010-2012 Pierre SMARS (smars@yuntech.edu.tw)
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) any later version.
 
This program 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 General Public License for more details.
 
You should have received a copy of the GNU General Public License
along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/
#include "a_mat_r.h"
#include <math.h>
 
// .PORTABILITY : ansi C++
 
//***************************************************************************
//member functions
//-operator=-----------------------------------------------------------------
a_mat_r & a_mat_r::operator=(const a_mat& m)
{
        if (m.maxj() != maxj_)     throw compatibility_error();
        if (m.maxi() != 1) throw compatibility_error();
        (*x_) = m.x();
        return (*this);
}
//-sumsq---------------------------------------------------------------------
double a_mat_r::sumsq() const
{
        double v = 0;
        for (UI i = 0; i<maxi_; i++)
                v += (*x_)[i]*(*x_)[i];
        return v;
}
//-norm----------------------------------------------------------------------
double a_mat_r::norm() const
{
        return sqrt(sumsq());
}
//-normalise-----------------------------------------------------------------
void a_mat_r::normalise()
{
        double n = norm();
        if (n != 0)     (*x_) /= n;
}
//***************************************************************************
//-cross---------------------------------------------------------------------
a_mat_r cross(a_mat_r & a, a_mat_r & b)
{
        if ((a.maxj() != 3)||(b.maxj() != 3)) throw a_mat::compatibility_error();
        a_mat_r r(3);
        r(0) = a(1)*b(2)-a(2)*b(1);
        r(1) = a(2)*b(0)-a(0)*b(2);
        r(2) = a(0)*b(1)-a(1)*b(0);
        return r;
}