sf_mathieu.hpp

Go to the documentation of this file.

/*
 * $Id: sf_mathieu.hpp 293 2012-12-17 20:27:36Z jdl3 $
 * Copyright (C) 2010, 2011 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_SF_MATHIEU_HPP
#define CCGSL_SF_MATHIEU_HPP
 
#include<gsl/gsl_sf_mathieu.h>
 
#include<new>
#include<algorithm>
#include"mode.hpp"
#include"sf_result.hpp"
 
namespace gsl {
  namespace sf {
    namespace mathieu {
      class workspace {
      public:
    workspace(){
      ccgsl_pointer = 0;
      count = 0; // initially nullptr will do
    }
    // Refines random access container
    // Refines assignable
    explicit workspace( size_t const nn, double const qq ){
      ccgsl_pointer = gsl_sf_mathieu_alloc( nn, qq );
      // just plausibly we could allocate mathieu_workspace but not count
      try { count = new size_t; } catch( std::bad_alloc& e ){
        // try to tidy up before rethrowing
        gsl_sf_mathieu_free( ccgsl_pointer );
        throw e;
      }
      *count = 1; // initially there is just one reference to ccgsl_pointer
    }
    explicit workspace( gsl_sf_mathieu_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_sf_mathieu_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_sf_mathieu_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 );
    }
    size_t size() const { return ccgsl_pointer == 0 ? 0 : ccgsl_pointer->size; }
      private:
    gsl_sf_mathieu_workspace* ccgsl_pointer;
    size_t* count;
      public:
    // shared reference functions
    gsl_sf_mathieu_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; }
      };
      inline int a_array( int order_min, int order_max, double qq,
              workspace& work, double result_array[] ){
    return gsl_sf_mathieu_a_array( order_min, order_max, qq, work.get(), result_array ); } 
      inline int b_array( int order_min, int order_max, double qq,
              workspace& work, double result_array[] ){
    return gsl_sf_mathieu_b_array( order_min, order_max, qq, work.get(), result_array ); }  
      inline double a( int order, double qq ){
    return gsl_sf_mathieu_a( order, qq ); } 
      inline int a_e( int order, double qq, result& result ){
    return gsl_sf_mathieu_a_e( order, qq, &result ); } 
      inline int b_e( int order, double qq, result& result ){
    return gsl_sf_mathieu_b_e( order, qq, &result ); } 
      inline double b( int order, double qq ){
    return gsl_sf_mathieu_b( order, qq ); } 
      inline int a_coeff( int order, double qq, double aa, double coeff[] ){
    return gsl_sf_mathieu_a_coeff( order, qq, aa, coeff ); } 
      inline int b_coeff( int order, double qq, double aa, double coeff[] ){
    return gsl_sf_mathieu_b_coeff( order, qq, aa, coeff ); } 
      inline double ce( int order, double qq, double zz ){
    return gsl_sf_mathieu_ce( order, qq, zz ); } 
      inline int ce_e( int order, double qq, double zz, result& result ){
    return gsl_sf_mathieu_ce_e( order, qq, zz, &result ); } 
      inline int se_e( int order, double qq, double zz, result& result ){
    return gsl_sf_mathieu_se_e( order, qq, zz, &result ); } 
      inline double se( int order, double qq, double zz ){
    return gsl_sf_mathieu_se( order, qq, zz ); } 
      inline int ce_array( int nmin, int nmax, double qq, double zz,
               workspace& work, double result_array[] ){
    return gsl_sf_mathieu_ce_array( nmin, nmax, qq, zz, work.get(), result_array ); } 
      inline int se_array( int nmin, int nmax, double qq, double zz,
               workspace& work, double result_array[] ){
    return gsl_sf_mathieu_se_array( nmin, nmax, qq, zz, work.get(), result_array ); } 
      inline double Mc( int kind, int order, double qq, double zz ){
    return gsl_sf_mathieu_Mc( kind, order, qq, zz ); }  
      inline int Mc_e( int kind, int order, double qq, double zz, result& result ){
    return gsl_sf_mathieu_Mc_e( kind, order, qq, zz, &result ); } 
      inline double Ms( int kind, int order, double qq, double zz ){
    return gsl_sf_mathieu_Ms( kind, order, qq, zz ); } 
      inline int Ms_e( int kind, int order, double qq, double zz, result& result ){
    return gsl_sf_mathieu_Ms_e( kind, order, qq, zz, &result ); } 
      inline int Mc_array( int kind, int nmin, int nmax, double qq, double zz,
               workspace& work, double result_array[] ){
    return gsl_sf_mathieu_Mc_array( kind, nmin, nmax, qq, zz, work.get(), result_array ); } 
      inline int Ms_array( int kind, int nmin, int nmax, double qq, double zz,
               workspace& work, double result_array[] ){
    return gsl_sf_mathieu_Ms_array( kind, nmin, nmax, qq, zz, work.get(), result_array ); }
    }
  }
}
 
#endif