vnl_vector_fixed.txx

InsightToolkit-1.4.0(有大量的优化算法程序)

// This is core/vnl/vnl_vector_fixed.txx
#ifndef vnl_vector_fixed_txx_
#define vnl_vector_fixed_txx_
//:
// \file
#include "vnl_vector_fixed.h"

#include <vcl_cassert.h>
#include <vcl_algorithm.h> // for vcl_swap
#include <vcl_iostream.h>  // for vcl_cerr
#include <vcl_cstdlib.h>   // for vcl_abort
#include "vnl_math.h"      // for vnl_math_isfinite

template<class T, unsigned int n>
vnl_vector_fixed<T,n>
vnl_vector_fixed<T,n>::apply( T (*f)(T) )
{
  vnl_vector_fixed<T,n> ret;
  for ( size_type i = 0; i < n; ++i )
    ret[i] = f( data_[i] );
  return ret;
}

template<class T, unsigned int n>
vnl_vector_fixed<T,n>
vnl_vector_fixed<T,n>::apply( T (*f)(const T&) )
{
  vnl_vector_fixed<T,n> ret;
  for ( size_type i = 0; i < n; ++i )
    ret[i] = f( data_[i] );
  return ret;
}


template<class T, unsigned int n>
vnl_vector<T>
vnl_vector_fixed<T,n>::extract( unsigned int len, unsigned int start ) const
{
  assert( start < n && start + len <= n );
  return vnl_vector<T>( data_ + start, len );
}

template<class T, unsigned int n>
vnl_vector_fixed<T,n>&
vnl_vector_fixed<T,n>::update( const vnl_vector<T>& v, unsigned int start )
{
  size_type end = start + v.size();
  assert( end <= n );
  for (size_type i = start; i < end; i++)
    this->data_[i] = v[i-start];
  return *this;
}

template <class T, unsigned int n>
void
vnl_vector_fixed<T,n>::flip()
{
  for ( unsigned int i=0; 2*i+1 < n; ++i )
    vcl_swap( data_[i], data_[n-1-i] );
}

template <class T, unsigned int n>
bool
vnl_vector_fixed<T,n>::is_finite() const
{
  for ( size_type i = 0; i < this->size(); ++i )
    if ( !vnl_math_isfinite( (*this)[i] ) )
      return false;

  return true;
}


template <class T, unsigned int n>
bool
vnl_vector_fixed<T,n>::is_zero() const
{
  T const zero(0);
  for ( size_type i = 0; i < this->size(); ++i )
    if ( !( (*this)[i] == zero) )
      return false;

  return true;
}


template <class T, unsigned int n>
bool
vnl_vector_fixed<T,n>::read_ascii(vcl_istream& s)
{
  for (unsigned i = 0; i < this->size(); ++i)
    s >> (*this)(i);

  return s.good() || s.eof();
}

template <class T, unsigned int n>
void
vnl_vector_fixed<T,n>::assert_finite_internal() const
{
  if (this->is_finite())
    return;

  vcl_cerr << __FILE__ ": *** NAN FEVER **\n" << *this;
  vcl_abort();
}

template <class T, unsigned int n>
void
vnl_vector_fixed<T,n>::print( vcl_ostream& s ) const
{
  if ( this->size() > 0 )
    s << (*this)[0];
  for ( size_type i = 1; i < this->size(); ++i )
    s << " " << (*this)[i];
}


// we don't need to explicitly instantiate all the operator+ and such
// since they appear in the .h file and are inline.

#define VNL_VECTOR_FIXED_INSTANTIATE(T,n) \
template class vnl_vector_fixed<T, n >

#endif // vnl_vector_fixed_txx_