fvar_ar1.cpp

Go to the documentation of this file.

/*
 * $Id$
 *
 * Author: David Fournier
 * Copyright (c) 2008-2012 Regents of the University of California
 */
#include "fvar.hpp"

dvar_vector::~dvar_vector()
{
  deallocate();
}
void dvar_vector::deallocate()
{
  if (shape)
  {
#if defined(DIAG)
     cout << " Deallocating dvar_vector with ptr_address\n  "
          << &va << "  pointing at  " << (va+indexmin()) << "\n";
#endif
    if (shape->ncopies > 0)
    {
      --(shape->ncopies);
    }
    else
    {
      va = (double_and_int*) shape->trueptr;
      *(arr_link**) va = link_ptr;
      gradient_structure* gs = gradient_structure::_instance;
      gs->ARR_LIST1->arr_free(va);
      delete shape;
    }
    allocate();
  }
#if defined(DIAG)
  else
  {
    cerr << "Warning -- Unable to deallocate an unallocated dvar_vector.\n";
  }
#endif
}
dvar_vector::dvar_vector(const dvar_vector& other)
{
  shallow_copy(other);

#if defined(DIAG)
  cout << " Making copy for dvar_vector with ptr_address\n  "
       << &va << "  pointing at  " << (va+indexmin()) << "\n";
#endif
}
void dvar_vector::shallow_copy(const dvar_vector& other)
{
  if (other.shape)
  {
    shape = other.shape;
    ++(shape->ncopies);

    index_min = other.index_min;
    index_max = other.index_max;

    link_ptr = other.link_ptr;
    va = other.va;
  }
  else
  {
#if defined(DIAG)
    cerr << "Warning -- Unable to shallow copy an unallocated dvar_vector.\n";
#endif
    allocate();
  }
}

dvar_vector::dvar_vector(const predvar_vector& pdv)
 {
#ifndef OPT_LIB
   if (pdv.ub<pdv.lb)
   {
     cerr << "lower index greater than upper index in dvar_vector::"
       " dvar-vector(const predvar_vector&) " << endl;
     ad_exit (1);
   }
   if ((pdv.lb<pdv.p->indexmin()) || (pdv.lb>pdv.p->indexmax()))
   {
     cerr << "lower index out of bounds in dvar_vector::"
       " operator(int lb,int ub) " << endl;
     ad_exit (1);
   }

   if ((pdv.ub<pdv.p->indexmin()) || (pdv.ub>pdv.p->indexmax()))
   {
     cerr << " upper index out of bounds in dvar_vector::"
       " operator(int lb,int ub) " << endl;
     ad_exit (1);
   }
#endif
   index_min=pdv.lb;
   index_max=pdv.ub;
   shape=pdv.p->shape;
   link_ptr=pdv.p->link_ptr;
   (shape->ncopies)++;
   va = pdv.p->va;
#if defined(DIAG)
     cout << " Making copy for dvar_vector with ptr_address\n  "
           << &va << "  pointing at  " << (va+indexmin()) << "\n";
#endif
 }

/*
dvar_vector::dvar_vector(const dvar_vector& t, int lb, int ub)
 {
#ifndef OPT_LIB
   if (ub<lb)
   {
     cerr << "lower index greater than upper index in dvar_vector::"
       " operator(int lb,int ub) " << endl;
     ad_exit (1);
   }
   if ((lb<t.indexmin()) || (lb>t.indexmax()))
   {
     cerr << "lower index out of bounds in dvar_vector::"
       " operator(int lb,int ub) " << endl;
     ad_exit (1);
   }

   if ((ub<t.indexmin()) || (ub>t.indexmax()))
   {
     cerr << " upper index out of bounds in dvar_vector::"
       " operator(int lb,int ub) " << endl;
     ad_exit (1);
   }
#endif

   index_min=lb;
   index_max=ub;
   shape=t.shape;
   link_ptr=t.link_ptr;
   (shape->ncopies)++;
   va = t.va;
#if defined(DIAG)
     cout << " Making copy for dvar_vector with ptr_address\n  "
           << &va << "  pointing at  " << (va+indexmin()) << "\n";
#endif
 }
*/