---

LayoutDataI.H

Go to the documentation of this file.

/*   _______              __
    / ___/ /  ___  __ _  / /  ___
   / /__/ _ \/ _ \/  V \/ _ \/ _ \
   \___/_//_/\___/_/_/_/_.__/\___/
*/
// CHOMBO Copyright (c) 2000-2004, The Regents of the University of
// California, through Lawrence Berkeley National Laboratory (subject to
// receipt of any required approvals from U.S. Dept. of Energy).  All
// rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// (1) Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// (2) Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// (3) Neither the name of Lawrence Berkeley National Laboratory, U.S.
// Dept. of Energy nor the names of its contributors may be used to endorse
// or promote products derived from this software without specific prior
// written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
// TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
// PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
// OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// You are under no obligation whatsoever to provide any bug fixes,
// patches, or upgrades to the features, functionality or performance of
// the source code ("Enhancements") to anyone; however, if you choose to
// make your Enhancements available either publicly, or directly to
// Lawrence Berkeley National Laboratory, without imposing a separate
// written license agreement for such Enhancements, then you hereby grant
// the following license: a non-exclusive, royalty-free perpetual license
// to install, use, modify, prepare derivative works, incorporate into
// other computer software, distribute, and sublicense such Enhancements or
// derivative works thereof, in binary and source code form.
//
// TRADEMARKS. Product and company names mentioned herein may be the
// trademarks of their respective owners.  Any rights not expressly granted
// herein are reserved.
//

#ifndef _LAYOUTDATAI_H_
#define _LAYOUTDATAI_H_

#include "MayDay.H"
#include "DataIterator.H"
#include "SPMD.H"

template<class T>
inline const T& LayoutData<T>::operator [] (const DataIndex& a_index) const
{
  assert(m_boxLayout.check(a_index));

  // using a DataIndex for data on another processor -
  // if you are reading this error in a debugger, then you haven't used
  // addBox(Box, int) correctly, or you are using a LayoutIterator to
  // access a data holder.
  assert(m_boxLayout.procID(a_index) == procID());

  return *(m_vector[m_boxLayout.index(a_index)]);
}

template<class T>
inline const T& LayoutData<T>::operator [] (const DataIterator& a_index) const
{
  return (*this)[a_index()];
}

template<class T>
inline T& LayoutData<T>::operator [] (const DataIndex& a_index)
{
  assert(m_boxLayout.check(a_index));

  // using a DataIndex for data on another processor -
  // if you are reading this error in a debugger, then you haven't used
  // addBox(Box, int) correctly, or you are using a LayoutIterator to
  // access a data holder.
  assert(m_boxLayout.procID(a_index) == procID());

  return *(m_vector[m_boxLayout.index(a_index)]);
}

template<class T>
inline T& LayoutData<T>::operator [] (const DataIterator& a_index)
{

  return (*this)[a_index()];
}

template<class T>
inline Box LayoutData<T>::box(const DataIndex& a_index) const
{
  return m_boxLayout.get(a_index);
}

template<class T>
inline Box LayoutData<T>::box(const DataIterator& a_index) const
{
  return m_boxLayout.get(a_index());
}

template<class T>
inline DataIterator LayoutData<T>::dataIterator() const
{
  return m_boxLayout.dataIterator();
}

template<class T>
inline LayoutData<T>::LayoutData()
{
  m_boxLayout.close();
  m_callDelete = true;
}

template<class T>
inline LayoutData<T>::LayoutData(const BoxLayout& a_dp)
  :
  m_boxLayout(a_dp)
{
  assert(a_dp.isClosed());
  m_callDelete = true;
  allocate();
}

template<class T>
inline void LayoutData<T>::define(const BoxLayout& a_dp)
{
  assert(a_dp.isClosed());
  m_boxLayout = a_dp;
  allocate();
}

template<class T>
inline LayoutData<T>::~LayoutData()
{
  if (m_callDelete == true)
  {
    for (DataIterator it(dataIterator()); it.ok(); ++it)
    {
      delete m_vector[m_boxLayout.index(it())];
    }
  }
}

template<class T>
inline void LayoutData<T>::allocate()
{
  m_callDelete = true;

  for (unsigned int i = 0; i < m_vector.size(); ++i)
  {
    delete m_vector[i];
    m_vector[i] = NULL;
  }

  m_vector.resize(m_boxLayout.size(), NULL);

  for (DataIterator it(dataIterator()); it.ok(); ++it)
  {
    unsigned int index = m_boxLayout.index(it());
    if (m_vector[index] == NULL)
    {
      m_vector[index] = new T();
      if (m_vector[index] == NULL)
      {
        MayDay::Error("OutOfMemory in boxlayoutdata::setVector");
      }
    }
  }
}

#endif

---