cmtkVector.txx

Go to the documentation of this file.

/*
//
//  Copyright 1997-2009 Torsten Rohlfing
//  Copyright 2004-2009 SRI International
//
//  This file is part of the Computational Morphometry Toolkit.
//
//  http://www.nitrc.org/projects/cmtk/
//
//  The Computational Morphometry Toolkit 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 3 of
//  the License, or (at your option) any later version.
//
//  The Computational Morphometry Toolkit 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 the Computational Morphometry Toolkit.  If not, see
//  <http://www.gnu.org/licenses/>.
//
//  $Revision: 11 $
//
//  $LastChangedDate: 2009-05-30 11:30:08 -0700 (Sat, 30 May 2009) $
//
//  $LastChangedBy: torstenrohlfing $
//
*/

namespace
cmtk
{


template<class T>
Vector<T> operator+ ( const Vector<T>& p, const Vector<T>& delta )
{
  assert ( p.Dim == delta.Dim );

  T* Result = Memory::AllocateArray<T>( p.Dim );
#pragma omp parallel for if (p.Dim>1e4)
  for ( size_t i=0; i<p.Dim; ++i )
    Result[i] = p.Elements[i] + delta.Elements[i];

  return Vector<T>( p.Dim, Result );
}

template<class T>
inline Vector<T> operator- 
( const Vector<T>& p, const Vector<T>& delta )
{
  assert ( p.Dim == delta.Dim );

  T* Result = Memory::AllocateArray<T>( p.Dim );
#pragma omp parallel for if (p.Dim>1e4)
  for ( size_t i=0; i<p.Dim; ++i )
    Result[i] = p.Elements[i] - delta.Elements[i];

  return Vector<T>( p.Dim, Result );
}

template<class T>
Vector<T> operator* ( const T c, const Vector<T>& p ) 
{
  T* Result = Memory::AllocateArray<T>( p.Dim );
#pragma omp parallel for if (p.Dim>1e4)
  for ( size_t i=0; i<p.Dim; ++i )
    Result[i] = c * p.Elements[i];

  return Vector<T>( p.Dim, Result );
}

template<class T>
Vector<T> CoordMult ( const Vector<T>& p, const Vector<T>& q ) 
{
  assert ( p.Dim == q.Dim );

  T* Result = Memory::AllocateArray<T>( p.Dim );
#pragma omp parallel for if (p.Dim>1e4)
  for ( size_t i=0; i<p.Dim; ++i )
    Result[i] = p.Elements[i] * q.Elements[i];

  return Vector<T>( p.Dim, Result );
}

template<class T> 
inline T operator* ( const Vector<T>& p, const Vector<T>& q ) 
{
  assert ( p.Dim == q.Dim );

  T Result = 0;
#pragma omp parallel for if (p.Dim>1e4)
  for ( size_t i=0; i<p.Dim; ++i )
    Result += p.Elements[i] * q.Elements[i];

  return Result;
}

} // namespace cmtk