array1d.h

Go to the documentation of this file.

/*
*
* Template Numerical Toolkit (TNT)
*
* Mathematical and Computational Sciences Division
* National Institute of Technology,
* Gaithersburg, MD USA
*
*
* This software was developed at the National Institute of Standards and
* Technology (NIST) by employees of the Federal Government in the course
* of their official duties. Pursuant to title 17 Section 105 of the
* United States Code, this software is not subject to copyright protection
* and is in the public domain. NIST assumes no responsibility whatsoever for
* its use by other parties, and makes no guarantees, expressed or implied,
* about its quality, reliability, or any other characteristic.
*
*/



#ifndef SPUC_ARRAY1D_H
#define SPUC_ARRAY1D_H

#include <cstdlib>
#include <iostream>

#ifdef SPUC_BOUNDS_CHECK
#include <assert.h>
#endif

namespace SPUC {
template <class T>
class Array1D 
{


  private:
    T* v_;                  
    int n_;
    int *ref_count_;

        void initialize_(int n);
    void copy_(T* p, const T*  q, int len) const;
    void set_(const T& val);
    void destroy_();
        inline const T* begin_() const;
        inline T* begin_();

  public:

    typedef         T   value_type;

                 Array1D();
        explicit Array1D(int n);
                 Array1D(int n,  T *a);
                 Array1D(int n, const T &a);
    inline   Array1D(const Array1D &A);
        inline   Array1D & operator=(const T &a);
        inline   Array1D & operator=(const Array1D &A);
        inline   Array1D & ref(const Array1D &A);
                 Array1D copy() const;
                     Array1D & inject(const Array1D & A);
        inline   T& operator[](int i);
        inline   const T& operator[](int i) const;
        inline   int dim1() const;
        inline   int dim() const;
        inline   int ref_count() const;
        ~Array1D();
        // NEW
    Array1D<T> mid(int s, int nr) const;
    void replace_mid(int s, const Array1D<T>& v) const;
        inline   int length() const;
        Array1D<T>& set_size(int M, bool f) { return(set_size(M)); }
        Array1D<T>& newsize(int M, bool f) { return(set_size(M)); }
        Array1D<T>& newsize(int M) { return(set_size(M)); }
        Array1D<T>& set_size(int M) {
                if (dim1() == M) return *this;
        destroy_();
        initialize_(M);
        return *this;
        }
        // NEW
        
};
template <class T>
Array1D<T>::Array1D() : v_(0), n_(0), ref_count_(0) 
{
        ref_count_ = new int;
        *ref_count_ = 1;
}

template <class T>
Array1D<T>::Array1D(const Array1D<T> &A) : v_(A.v_),  
        n_(A.n_), ref_count_(A.ref_count_)
{
        (*ref_count_)++;
}



template <class T>
Array1D<T>::Array1D(int n) : v_(0), n_(n), ref_count_(0)
{
        initialize_(n);
        ref_count_ = new int;
        *ref_count_ = 1;
}



template <class T>
Array1D<T>::Array1D(int n, const T &val) : v_(0), n_(n) ,
        ref_count_(0)
{
        initialize_(n);
        set_(val);
        ref_count_ = new int;
        *ref_count_ = 1;

}

template <class T>
Array1D<T>::Array1D(int n, T *a) : v_(a), n_(n) ,
        ref_count_(0)
{
        ref_count_ = new int;
        *ref_count_ = 2;                /* this avoid destorying original data. */

}

template <class T>
inline T& Array1D<T>::operator[](int i) 
{ 
#ifdef SPUC_BOUNDS_CHECK
        assert(i>= 0);
        assert(i < n_);
#endif
        return v_[i]; 
}

template <class T>
inline const T& Array1D<T>::operator[](int i) const 
{ 
#ifdef SPUC_BOUNDS_CHECK
        assert(i>= 0);
        assert(i < n_);
#endif
        return v_[i]; 
}

template <class T>
Array1D<T> & Array1D<T>::operator=(const T &a)
{
        set_(a);
        return *this;
}
template <class T>
Array1D<T> Array1D<T>::copy() const
{
        Array1D A( n_);
        copy_(A.begin_(), begin_(), n_);

        return A;
}



template <class T>
Array1D<T> & Array1D<T>::inject(const Array1D &A)
{
        if (A.n_ == n_)
                copy_(begin_(), A.begin_(), n_);

        return *this;
}





template <class T>
Array1D<T> & Array1D<T>::ref(const Array1D<T> &A)
{
        if (this != &A)
        {
                (*ref_count_) --;
                if ( *ref_count_ < 1)
                {
                        destroy_();
                }

                n_ = A.n_;
                v_ = A.v_;
                ref_count_ = A.ref_count_;

                (*ref_count_) ++ ;
                
        }
        return *this;
}

template <class T>
Array1D<T> & Array1D<T>::operator=(const Array1D<T> &A)
{
        return ref(A);
}

template <class T>
inline int Array1D<T>::dim1() const { return n_; }

template <class T>
inline int Array1D<T>::length() const { return n_; }

template <class T>
inline int Array1D<T>::dim() const { return n_; }



template <class T>
inline int Array1D<T>::ref_count() const
{
        return *ref_count_;
}

template <class T>
Array1D<T>::~Array1D()
{
        (*ref_count_) --;

        if (*ref_count_ < 1)
                destroy_();
}

/* private internal functions */

template <class T>
void Array1D<T>::initialize_(int n)
{


        v_ = new T[n];
        n_ = n;
}

template <class T>
void Array1D<T>::set_(const T& a)
{
        T *begin = &(v_[0]);
        T *end = begin+ n_;

        for (T* p=begin; p<end; p++)
                *p = a;

}

template <class T>
void Array1D<T>::copy_(T* p, const T* q, int len) const
{
        T *end = p + len;
        while (p<end )
                *p++ = *q++;

}

template <class T>
void Array1D<T>::destroy_()
{

        if (v_ != 0)
        {
                delete[] (v_);
        }

        if (ref_count_ != 0)
                delete ref_count_;
}

template <class T>
const T* Array1D<T>::begin_() const { return &(v_[0]); }

template <class T>
T* Array1D<T>::begin_() { return &(v_[0]); }

template <class T>
Array1D<T> Array1D<T>::mid(int s, int nr) const
{
        Array1D A( nr );
        for (int i=0;i<nr;i++) A[i] = v_[s+i];
        return A;
}
template <class T>
void Array1D<T>::replace_mid(int s, const Array1D<T>& v) const
{
        for (int i=0;i<v.dim();i++) v_[s+i] = v[i];
}



} /* namespace SPUC */

#endif
/* ARRAY1D_H */

---