Sacado_Fad_VectorDynamicStorage.hpp

Go to the documentation of this file.

// $Id$ 
// $Source$ 
// @HEADER
// ***********************************************************************
// 
//                           Sacado Package
//                 Copyright (2006) Sandia Corporation
// 
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
// 
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//  
// This library 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
// Lesser General Public License for more details.
//  
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact David M. Gay (dmgay@sandia.gov) or Eric T. Phipps
// (etphipp@sandia.gov).
// 
// ***********************************************************************
// @HEADER

#ifndef SACADO_FAD_VECTORDYNAMICSTORAGE_HPP
#define SACADO_FAD_VECTORDYNAMICSTORAGE_HPP

#include "Sacado_Traits.hpp"
#include "Sacado_DynamicArrayTraits.hpp"

namespace Sacado {

  namespace Fad {

    template <typename T, typename S = T> 
    class VectorDynamicStorage {

    public:

      VectorDynamicStorage(const T & x) : 
  v_(x), owns_mem(true), sz_(0), len_(0), stride_(1), val_(&v_), dx_(NULL)
      {}


      VectorDynamicStorage(const int sz, const T & x) : 
  v_(x), owns_mem(true), sz_(sz), len_(sz), stride_(1), val_(&v_) {
  dx_ = ds_array<S>::get_and_fill(sz_);
      }

      VectorDynamicStorage(const int sz, T* x, S* dx_p, const int stride,
         bool zero_out) : 
  v_(), owns_mem(false), sz_(sz), len_(sz), stride_(stride), 
  val_(x), dx_(dx_p) {
  if (zero_out)
    zero();
      }

      VectorDynamicStorage(const VectorDynamicStorage& x) : 
  v_(*x.val_), owns_mem(true), sz_(x.sz_), len_(x.sz_), 
  stride_(1), val_(&v_)  {
  dx_ = ds_array<S>::strided_get_and_fill(x.dx_, x.stride_, sz_);
      }
      
      ~VectorDynamicStorage() {
  if (owns_mem) {
    if (len_ != 0)
      ds_array<S>::destroy_and_release(dx_, len_);
  }
      }

      VectorDynamicStorage& operator=(const VectorDynamicStorage& x) { 
  *val_ = *x.val_;
  if (sz_ != x.sz_) {
    sz_ = x.sz_;
    if (x.sz_ > len_) {
      if (!owns_mem)
        throw "Can\'t resize beyond original size when memory isn't owned!";
      if (len_ != 0)
        ds_array<S>::destroy_and_release(dx_, len_);
      len_ = x.sz_;
      dx_ = ds_array<S>::strided_get_and_fill(x.dx_, x.stride_, sz_);
    }
    else 
      ds_array<S>::strided_copy(x.dx_, x.stride_, dx_, stride_, sz_);
  }
  else 
    ds_array<S>::strided_copy(x.dx_, x.stride_, dx_, stride_, sz_);

  return *this; 
      } 

      int size() const { return sz_;}

      int length() const { return len_; }


      void resize(int sz) { 
  if (sz > len_) {
    if (!owns_mem)
        throw "Can\'t resize beyond original size when memory isn't owned!";
    if (len_ != 0)
      ds_array<S>::destroy_and_release(dx_, len_);
    len_ = sz;
    dx_ = ds_array<S>::get_and_fill(len_);
  }
  sz_ = sz;
      }


      void expand(int sz) {
        if (sz > len_) {
          if (!owns_mem)
        throw "Can\'t resize beyond original size when memory isn't owned!";
          S* dx_new = ds_array<S>::get_and_fill(sz);
          ds_array<S>::copy(dx_, dx_new, sz_);
          if (len_ > 0)
            ds_array<S>::destroy_and_release(dx_, len_);
          dx_ = dx_new;
          len_ = sz;
        }
        else if (sz > sz_) 
          ds_array<S>::strided_zero(dx_+stride_*sz_, stride_, sz-sz_);
        sz_ = sz;
      }

      void zero() { 
  ds_array<S>::strided_zero(dx_, stride_, sz_);
      }

      void setMemory(int sz, T* x, S* dx_p, int stride) {

  // Destroy old memory
  if (owns_mem) {
    if (len_ != 0)
      ds_array<S>::destroy_and_release(dx_, len_);
  }

  // Set new values
  owns_mem = false;
  sz_ = sz;
  len_ = sz;
  stride_ = stride;
  val_ = x;
  dx_ = dx_p;
      }

      const T& val() const { return *val_; }

      T& val() { return *val_; }

      const S* dx() const { return dx_;}

      S dx(int i) const { return sz_ ? dx_[i*stride_] : T(0.); }
    
      S& fastAccessDx(int i) { return dx_[i*stride_];}

      const S& fastAccessDx(int i) const { return dx_[i*stride_];}

    private:

      T v_;

    private:

      bool owns_mem;

      int sz_;

      int len_;

      int stride_;

      T* val_;

      S* dx_;

    }; // class VectorDynamicStorage

  } // namespace Fad

} // namespace Sacado

#endif // SACADO_FAD_VECTORDYNAMICSTORAGE_HPP