Shards_SimpleArrayOps.hpp

// @HEADER
// *****************************************************************************
//                Shards : Shared Discretization Tools
//
// Copyright 2008-2011 NTESS and the Shards contributors.
// SPDX-License-Identifier: BSD-3-Clause
// *****************************************************************************
// @HEADER
 
#ifndef Shards_SimpleArrayOps_hpp
#define Shards_SimpleArrayOps_hpp
 
namespace shards {
 
template< unsigned n , unsigned i = 0 >
struct Copy {
  enum { N = n , I = i };
 
  template<typename T>
  inline Copy( T * const dst , const T * const src )
    { dst[I] = src[I] ; Copy<N-1,I+1>(dst,src); }
 
  template<typename T>
  inline Copy( T * const dst , const T src )
    { dst[I] = src ; Copy<N-1,I+1>(dst,src); }
 
  Copy() {}
};
 
template< unsigned n , unsigned i = 0 >
struct Sum {
  enum { N = n , I = i };
 
  template<typename T>
  inline Sum( T * const dst , const T * const src )
    { dst[I] += src[I] ; Sum<N-1,I+1>(dst,src); }
 
  template<typename T>
  inline Sum( T * const dst , const T a , const T * const src )
    { dst[I] += a * src[I] ; Sum<N-1,I+1>(dst,a,src); }
 
  Sum() {}
};
 
template< unsigned n , unsigned i = 0 >
struct Prod {
  enum { N = n , I = i };
 
  template<typename T>
  inline Prod( T * const dst , const T * const src )
    { dst[I] *= src[I] ; Prod<N-1,I+1>(dst,src); }
  Prod() {}
};
 
template< unsigned n , unsigned i = 0 >
struct BitOr {
  enum { N = n , I = i };
 
  template<typename T>
  inline BitOr( T * const dst , const T * const src )
    { dst[I] |= src[I] ; BitOr<N-1,I+1>(dst,src); }
 
  BitOr() {}
};
 
template< unsigned n , unsigned i = 0 >
struct BitAnd {
  enum { N = n , I = i };
 
  template<typename T>
  inline BitAnd( T * const dst , const T * const src )
    { dst[I] &= src[I] ; BitAnd<N-1,I+1>(dst,src); }
 
  BitAnd() {}
};
 
template< unsigned n , unsigned i = 0 >
struct Max {
  enum { N = n , I = i };
 
  template<typename T>
  inline Max( T * const dst , const T * const src )
    { if ( dst[I] < src[I] ) { dst[I] = src[I] ; } Max<N-1,I+1>(dst,src); }
 
  Max() {}
};
 
template< unsigned n , unsigned i = 0 >
struct Min {
  enum { N = n , I = i };
 
  template<typename T>
  inline Min( T * const dst , const T * const src )
    { if ( src[I] < dst[I] ) { dst[I] = src[I] ; } Min<N-1,I+1>(dst,src); }
 
  Min() {}
};
 
template< unsigned n , unsigned i = 0 >
struct InnerProduct {
  enum { N = n , I = i };
 
  template<typename T>
  inline InnerProduct( T & value , const T * const x , const T * const y )
    { value += x[I] * y[I] ; InnerProduct<N-1,I+1>( value , x , y ); }
 
  InnerProduct() {}
};
 
template< unsigned n , unsigned i = 0 >
struct Compare {
  enum { N = n , I = i };
 
  template<typename T>
  inline static bool equal( const T * const x , const T * const y )
    { return x[I] == y[I] && Compare<N-1,I+1>::equal(x,y); }
 
  template<typename T>
  inline static bool not_equal( const T * const x , const T * const y )
    { return x[I] != y[I] || Compare<N-1,I+1>::not_equal(x,y); }
 
  template<typename T>
  inline static bool less( const T * const x , const T * const y )
    {
      return x[I] != y[I] ? x[I] < y[I] : Compare<N-1,I+1>::less(x,y);
    }
 
  template<typename T>
  inline static bool less_equal( const T * const x , const T * const y )
    {
      return x[I] != y[I] ? x[I] < y[I] : Compare<N-1,I+1>::less_equal(x,y);
    }
 
  template<typename T>
  inline static bool greater( const T * const x , const T * const y )
    {
      return x[I] != y[I] ? x[I] > y[I] : Compare<N-1,I+1>::greater(x,y);
    }
 
  template<typename T>
  inline static bool greater_equal( const T * const x , const T * const y )
    {
      return x[I] != y[I] ? x[I] > y[I] : Compare<N-1,I+1>::greater_equal(x,y);
    }
 
  Compare() {}
};
 
//----------------------------------------------------------------------
 
#ifndef DOXYGEN_COMPILE
 
template<unsigned i>
struct Copy<0,i> {
  enum { N = 0 };
  Copy() {}
  template<typename T> inline Copy( T * const , const T * const ) {}
  template<typename T> inline Copy( T * const , const T ) {}
};
 
template<unsigned i>
struct Sum<0,i> {
  enum { N = 0 };
  Sum() {}
  template<typename T> inline Sum( T * const , const T * const ) {}
  template<typename T> inline Sum( T * const , const T , const T * const ) {}
};
 
template<unsigned i>
struct Prod<0,i> {
  enum { N = 0 };
  Prod() {}
  template<typename T> inline Prod( T * const , const T * const ) {}
};
 
template<unsigned i>
struct Max<0,i> {
  enum { N = 0 };
  Max() {}
  template<typename T> inline Max( T * const , const T * const ) {}
};
 
template<unsigned i>
struct Min<0,i> {
  enum { N = 0 };
  Min() {}
  template<typename T> inline Min( T * const , const T * const ) {}
};
 
template<unsigned i>
struct BitOr<0,i> {
  enum { N = 0 };
  BitOr() {}
  template<typename T> inline BitOr( T * const , const T * const ) {}
};
 
template<unsigned i>
struct BitAnd<0,i> {
  enum { N = 0 };
  BitAnd() {}
  template<typename T> inline BitAnd( T * const , const T * const ) {}
};
 
template<unsigned i>
struct InnerProduct<0,i> {
  enum { N = 0 };
  InnerProduct() {}
  template<typename T>
  inline InnerProduct( T & , const T * const , const T * const ) {}
};
 
template<unsigned i>
struct Compare<0,i> {
  enum { N = 0 };
  Compare() {}
 
  template<typename T>
  inline static bool equal( const T * const , const T * const )
    { return true ; }
 
  template<typename T>
  inline static bool not_equal( const T * const , const T * const )
    { return false ; }
 
  template<typename T>
  inline static bool less( const T * const , const T * const )
    { return false ; }
 
  template<typename T>
  inline static bool less_equal( const T * const , const T * const )
    { return true ; }
 
  template<typename T>
  inline static bool greater( const T * const , const T * const )
    { return false ; }
 
  template<typename T>
  inline static bool greater_equal( const T * const , const T * const )
    { return true ; }
};
 
 
#endif /* DOXYGEN_COMPILE */
 
} // namespace shards
 
#endif