sum.hpp

Go to the documentation of this file.

/*
 * $Id: sum.hpp 293 2012-12-17 20:27:36Z jdl3 $
 * Copyright (C) 2012, 2020 John D Lamb
 *
 * 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, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */
 
#ifndef CCGSL_SUM_HPP
#define CCGSL_SUM_HPP
 
#include<new>
#include<gsl/gsl_sum.h>
 
namespace gsl {
  namespace sum {
    namespace levin_u {
      class workspace {
      public:
    workspace(){
      ccgsl_pointer = 0;
      count = 0; // initially nullptr will do
    }
    // Refines random access container
    // Refines assignable
    explicit workspace( size_t const n ){
      ccgsl_pointer = gsl_sum_levin_u_alloc( n );
      // just plausibly we could allocate workspace but not count
      try { count = new size_t; } catch( std::bad_alloc& e ){
        // try to tidy up before rethrowing
        gsl_sum_levin_u_free( ccgsl_pointer );
        throw e;
      }
      *count = 1; // initially there is just one reference to ccgsl_pointer
    }
    explicit workspace( gsl_sum_levin_u_workspace* v ){
      ccgsl_pointer = v;
      // just plausibly we could fail to allocate count: no further action needed.
      count = new size_t;
      *count = 1; // initially there is just one reference to ccgsl_pointer
    }
    // copy constructor
    workspace( workspace const& v ){ ccgsl_pointer = v.ccgsl_pointer;
      count = v.count; if( count != 0 ) ++*count; }
    // assignment operator
    workspace& operator=( workspace const& v ){
      // first, possibly delete anything pointed to by this
      if( count == 0 or --*count == 0 ){
        if( ccgsl_pointer != 0 ) gsl_sum_levin_u_free( ccgsl_pointer );
        delete count;
      } // Then copy
      ccgsl_pointer = v.ccgsl_pointer; count = v.count; if( count != 0 ) ++*count; return *this;
    }
    // destructor
    ~workspace(){
      if( count == 0 or --*count == 0 ){
        // could have allocated null pointer
        if( ccgsl_pointer != 0 ) gsl_sum_levin_u_free( ccgsl_pointer );
        delete count;
      }
    }
#ifdef __GXX_EXPERIMENTAL_CXX0X__
    workspace( workspace&& v ) : ccgsl_pointer( v.ccgsl_pointer ), count( nullptr ){
      std::swap( count, v.count );
      v.ccgsl_pointer = nullptr;
    }
    workspace& operator=( workspace&& v ){
      workspace( std::move( v ) ).swap( *this );
      return *this;
    }
#endif
    // Refines equality comparable
    // == operator
    bool operator==( workspace const& v ) const { return ccgsl_pointer == v.ccgsl_pointer; }
    // != operator
    bool operator!=( workspace const& v ) const { return not operator==( v ); }
    // Refines forward container
    // Refines less than comparable
    // operator<
    bool operator<( workspace const& v ) const { return ccgsl_pointer < v.ccgsl_pointer; }
    // operator>
    bool operator>( workspace const& v ) const { return ccgsl_pointer > v.ccgsl_pointer; }
    // operator<=
    bool operator<=( workspace const& v ) const { return ccgsl_pointer <= v.ccgsl_pointer; }
    // operator>=
    bool operator>=( workspace const& v ) const { return ccgsl_pointer >= v.ccgsl_pointer; }
    bool empty() const { return ccgsl_pointer == 0; }
    // swap() --- should work even if sizes don't match
    void swap( workspace& v ){
      std::swap( ccgsl_pointer, v.ccgsl_pointer );
      std::swap( count, v.count );
    }
      private:
    gsl_sum_levin_u_workspace* ccgsl_pointer;
    size_t* count;
      public:
    // shared reference functions
    gsl_sum_levin_u_workspace* get() const { return ccgsl_pointer; }
    bool unique() const { return count != 0 and *count == 1; }
    size_t use_count() const { return count == 0 ? 0 : *count; }
#ifdef __GXX_EXPERIMENTAL_CXX0X__
    explicit
#endif
    operator bool() const { return ccgsl_pointer != 0; }
    size_t size() const { return ccgsl_pointer->size; }
    size_t i() const { return ccgsl_pointer->i; }
    size_t terms_used() const { return ccgsl_pointer->terms_used; }
    double sum_plain() const { return ccgsl_pointer->sum_plain; }
      };
#ifndef DOXYGEN_SKIP 
      inline int accel( const double* array, size_t array_size, workspace& w, double* sum_accel,
            double* abserr ){
    return gsl_sum_levin_u_accel( array, array_size, w.get(), sum_accel, abserr );
      }
#endif // DOXYGEN_SKIP 
      template<typename ARRAY>
      inline int accel( ARRAY const& array, workspace& w, double& sum_accel,
            double& abserr ){
    return gsl_sum_levin_u_accel( array.data(), array.size(), w.get(), &sum_accel, &abserr );
      }
    }
    namespace levin_utrunc {
      class workspace {
      public:
    workspace(){
      ccgsl_pointer = 0;
      count = 0; // initially nullptr will do
    }
    // Refines random access container
    // Refines assignable
    explicit workspace( size_t const n ){
      ccgsl_pointer = gsl_sum_levin_utrunc_alloc( n );
      // just plausibly we could allocate workspace but not count
      try { count = new size_t; } catch( std::bad_alloc& e ){
        // try to tidy up before rethrowing
        gsl_sum_levin_utrunc_free( ccgsl_pointer );
        throw e;
      }
      *count = 1; // initially there is just one reference to ccgsl_pointer
    }
    explicit workspace( gsl_sum_levin_utrunc_workspace* v ){
      ccgsl_pointer = v;
      // just plausibly we could fail to allocate count: no further action needed.
      count = new size_t;
      *count = 1; // initially there is just one reference to ccgsl_pointer
    }
    // copy constructor
    workspace( workspace const& v ){ ccgsl_pointer = v.ccgsl_pointer;
      count = v.count; if( count != 0 ) ++*count; }
    // assignment operator
    workspace& operator=( workspace const& v ){
      // first, possibly delete anything pointed to by this
      if( count == 0 or --*count == 0 ){
        if( ccgsl_pointer != 0 ) gsl_sum_levin_utrunc_free( ccgsl_pointer );
        delete count;
      } // Then copy
      ccgsl_pointer = v.ccgsl_pointer; count = v.count; if( count != 0 ) ++*count; return *this;
    }
    // destructor
    ~workspace(){
      if( count == 0 or --*count == 0 ){
        // could have allocated null pointer
        if( ccgsl_pointer != 0 ) gsl_sum_levin_utrunc_free( ccgsl_pointer );
        delete count;
      }
    }
#ifdef __GXX_EXPERIMENTAL_CXX0X__
    workspace( workspace&& v ) : ccgsl_pointer( v.ccgsl_pointer ), count( nullptr ){
      std::swap( count, v.count );
      v.ccgsl_pointer = nullptr;
    }
    workspace& operator=( workspace&& v ){
      workspace( std::move( v ) ).swap( *this );
      return *this;
    }
#endif
    // Refines equality comparable
    // == operator
    bool operator==( workspace const& v ) const { return ccgsl_pointer == v.ccgsl_pointer; }
    // != operator
    bool operator!=( workspace const& v ) const { return not operator==( v ); }
    // Refines forward container
    // Refines less than comparable
    // operator<
    bool operator<( workspace const& v ) const { return ccgsl_pointer < v.ccgsl_pointer; }
    // operator>
    bool operator>( workspace const& v ) const { return ccgsl_pointer > v.ccgsl_pointer; }
    // operator<=
    bool operator<=( workspace const& v ) const { return ccgsl_pointer <= v.ccgsl_pointer; }
    // operator>=
    bool operator>=( workspace const& v ) const { return ccgsl_pointer >= v.ccgsl_pointer; }
    bool empty() const { return ccgsl_pointer == 0; }
    // swap() --- should work even if sizes don't match
    void swap( workspace& v ){
      std::swap( ccgsl_pointer, v.ccgsl_pointer );
      std::swap( count, v.count );
    }
      private:
    gsl_sum_levin_utrunc_workspace* ccgsl_pointer;
    size_t* count;
      public:
    // shared reference functions
    gsl_sum_levin_utrunc_workspace* get() const { return ccgsl_pointer; }
    bool unique() const { return count != 0 and *count == 1; }
    size_t use_count() const { return count == 0 ? 0 : *count; }
#ifdef __GXX_EXPERIMENTAL_CXX0X__
    explicit
#endif
    operator bool() const { return ccgsl_pointer != 0; }
    size_t size() const { return ccgsl_pointer->size; }
    size_t i() const { return ccgsl_pointer->i; }
    size_t terms_used() const { return ccgsl_pointer->terms_used; }
    double sum_plain() const { return ccgsl_pointer->sum_plain; }
      };
#ifndef DOXYGEN_SKIP 
      inline int accel( const double* array, size_t array_size, workspace& w, double* sum_accel,
            double* abserr_trunc ){
    return gsl_sum_levin_utrunc_accel( array, array_size, w.get(), sum_accel, abserr_trunc );
      }
#endif // DOXYGEN_SKIP 
      template<typename ARRAY>
      inline int accel( ARRAY const& array, workspace& w, double* sum_accel, double* abserr_trunc ){
    return gsl_sum_levin_utrunc_accel( array.data(), array.size(), w.get(), sum_accel, abserr_trunc );
      }
    }
  }
}
#endif