d7arr.cpp

Go to the documentation of this file.

#if (__cplusplus > 199711L)
  #include <algorithm>
  #include <iterator>
#endif
#include "fvar.hpp"

void d7_array::initialize()
{
#if (__cplusplus <= 199711L)
  for (int i = indexmin(); i <= indexmax(); ++i)
  {
    elem(i).initialize();
  }
#else
  if (operator!() == false)
  {
    auto begin = &elem(indexmin());
    auto end = begin + size();
    std::for_each(begin, end, [](d6_array& darray)
    {
      darray.initialize();
    });
  }
#endif
}
d7_array::d7_array(const d7_array& other)
{
  shallow_copy(other);
}
void d7_array::shallow_copy(const d7_array& other)
{
  if (other.shape)
  {
    shape = other.shape;
    ++(shape->ncopies);
    t = other.t;
  }
  else
  {
#ifdef DEBUG
    cerr << "Warning -- Unable to shallow copy an unallocated d6_array.\n";
#endif
    allocate();
  }
}
void d7_array::deallocate()
{
  if (shape)
  {
    if (shape->ncopies)
    {
      --(shape->ncopies);
    }
    else
    {
      t += indexmin();
      delete [] t;
      delete shape;
    }
    allocate();
  }
#if defined(DIAG)
  else
  {
    cerr << "Warning -- Unable to deallocate an unallocated d6_array.\n";
  }
#endif
}
d7_array::~d7_array()
{
  deallocate();
}
d7_array& d7_array::operator=(const d7_array& other)
{
  int min = indexmin();
  int max = indexmax();
  if (min != other.indexmin() || max != other.indexmax())
  {
    cerr << "Incompatible bounds in"
         << " d7_array& d7_array::operator=(const d7_array&).\n";
    ad_exit(1);
  }
  for (int i = min; i <= max; ++i)
  {
    elem(i) = other.elem(i);
  }
  return *this;
}
void d7_array::allocate(const d7_array& other)
{
  allocate(other.indexmin(), other.indexmax());
  for (int i = indexmin(); i <= indexmax(); ++i)
  {
    elem(i).allocate(other.elem(i));
  }
}
d7_array::d7_array(int l7,int u7,int hsl,int hsu,int sl,int sh,int nrl,
   int nrh,int ncl,int nch,int l5,int u5,int l6,int u6)
{
  allocate(l7,u7,hsl,hsu,sl,sh,nrl,nrh,ncl,nch,l5,u5,l6,u6);
}

d7_array::d7_array(const ad_integer& l7,const ad_integer& u7,
  const index_type& hsl,const index_type& hsu,
  const index_type& sl,const index_type& sh,const index_type& nrl,
  const index_type& nrh,const index_type& ncl,const index_type& nch,
  const index_type& l5,const index_type& u5,
  const index_type& l6,const index_type& u6)
{
  allocate(l7,u7,hsl,hsu,sl,sh,nrl,nrh,ncl,nch,l5,u5,l6,u6);
}
void d7_array::allocate(int l7, int u7, int hsl, int hsu, int sl, int sh,
  int nrl, int nrh, int ncl, int nch, int l5, int u5, int l6, int u6)
{
  allocate(l7, u7);
  for (int i = l7; i <= u7; ++i)
  {
    elem(i).allocate(hsl, hsu, sl, sh, nrl, nrh, ncl, nch, l5, u5, l6, u6);
  }
}
void d7_array::allocate(int l7, int u7)
{
  if (l7 > u7)
  {
    return allocate();
  }
  if ((shape = new vector_shape(l7, u7)) == 0)
  {
    cerr << "Error: Unable to allocate d7_array memory in "
         << "d7_array::allocate(int, int).\n"; 
    ad_exit(1);
  }
  if ((t = new d6_array[size()]) == 0)
  {
    cerr << "Error: Unable to allocate d7_array memory in "
         << "d7_array::allocate(int, int).\n"; 
    ad_exit(1);
  }
  t -= indexmin();
  for (int i = l7; i <= u7; ++i)
  {
    elem(i).allocate();
  }
}

 void d7_array::allocate(const ad_integer& l7,const ad_integer& u7,
   const index_type& hsl,const index_type& hsu,
   const index_type& sl,const index_type& sh,const index_type& nrl,
   const index_type& nrh,const index_type& ncl,const index_type& nch,
   const index_type& l5,const index_type& u5,
   const index_type& l6,const index_type& u6)
 {
   if ( (shape=new vector_shape (l7,u7)) == 0)
   {
     cerr << " Error allocating memory in d6_array contructor\n";
   }

   unsigned int ss = size();
   if ( (t = new d6_array[ss]) == 0)
   {
     cerr << " Error allocating memory in d6_array contructor\n";
     ad_exit(21);
   }
   t -= indexmin();
   int i1=l7;
   int iu=u7;
   for (int i=i1; i<=iu; i++)
   {
     (*this)(i).allocate(ad_integer(hsl(i)),ad_integer(hsu(i)),
       sl(i),sh(i),nrl(i),nrh(i),ncl(i),nch(i),l5(i),u5(i),l6(i),u6(i));
   }
 }