field_impl.hpp

Go to the documentation of this file.

/*
 * Copyright (c) 2015:  G-CSC, Goethe University Frankfurt
 * Author: Sebastian Reiter
 * 
 * This file is part of UG4.
 * 
 * UG4 is free software: you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License version 3 (as published by the
 * Free Software Foundation) with the following additional attribution
 * requirements (according to LGPL/GPL v3 §7):
 * 
 * (1) The following notice must be displayed in the Appropriate Legal Notices
 * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (2) The following notice must be displayed at a prominent place in the
 * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (3) The following bibliography is recommended for citation and must be
 * preserved in all covered files:
 * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
 *   parallel geometric multigrid solver on hierarchically distributed grids.
 *   Computing and visualization in science 16, 4 (2013), 151-164"
 * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
 *   flexible software system for simulating pde based models on high performance
 *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
 * 
 * This program 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.
 */
 
#ifndef __H__UG_field_impl__
#define __H__UG_field_impl__
 
#include <cstring>
#include <algorithm>
 
namespace ug{
 
template <class T> Field<T>::
Field() :
  m_width(0),
  m_height(0),
  m_capacity(0),
  m_data(NULL)
{
}
 
template <class T> Field<T>::
Field(size_t width, size_t height) :
  m_width(width),
  m_height(height)
{
  m_capacity = m_width * m_height;
  m_data = new T[m_capacity];
}
 
template <class T> Field<T>::
Field(size_t width, size_t height, const T& value) :
  m_width(width),
  m_height(height)
{
  m_capacity = m_width * m_height;
  m_data = new T[m_capacity];
  fill_all(value);
}
 
template <class T> Field<T>::
Field(const Field& f){
  m_width = f.width();
  m_height = f.height();
  m_capacity = m_width * m_height;
  m_data = new T[m_capacity];
  memcpy(m_data, f.data(), m_capacity * sizeof(T));
}
 
template <class T> Field<T>::
~Field(){
  if(m_data)
    delete[] m_data;
}
 
template <class T> Field<T>& Field<T>::
operator=(const Field& f){
  m_width = f.m_width;
  m_height = f.m_height;
  if(m_data && (m_capacity != m_width * m_height)){
    delete[] m_data;
    m_data = NULL;
  }
  m_capacity = m_width * m_height;
  if(!m_data)
    m_data = new T[m_capacity];
  memcpy(m_data, f.data(), m_capacity * sizeof(T));
  return *this;
}
 
template <class T> void Field<T>::
resize_no_copy(size_t width, size_t height){
 
  if(width * height > m_capacity){
    if(m_data)
      delete[] m_data;
    m_capacity += width * height;
    m_data = new T[m_capacity];
  }
  m_width = width;
  m_height = height;
}
 
template <class T> T& Field<T>::
at(size_t x, size_t y){
  return m_data[array_index(x, y)];
}
 
template <class T> const T& Field<T>::
at(size_t x, size_t y) const{
  return m_data[array_index(x, y)];
}
 
template <class T> void Field<T>::
fill(size_t x, size_t y, size_t w, size_t h, const T& value)
{
  using std::min;
  using std::max;
 
  const size_t xEnd = max(x + w, m_width);
  const size_t yEnd = max(y + h, m_height);
 
  for(size_t iy = max(y, size_t(0)); iy < yEnd; ++iy){
    for(size_t ix = max(x, size_t(0)); ix < xEnd; ++ix){
      m_data[array_index(ix, iy)] = value;
    }
  }
}
 
template <class T> void Field<T>::
fill_all(const T& value)
{
  const size_t dataSize = size();
  for(size_t i = 0; i < dataSize; ++i)
    m_data[i] = value;
}
 
template <class T> void Field<T>::
copy(size_t x, size_t y, const Field& f){
  using std::min;
  using std::max;
 
  const size_t xEnd = max(x + f.width(), m_width);
  const size_t yEnd = max(y + f.height(), m_height);
 
  for(size_t iy = max(y, size_t(0)); iy < yEnd; ++iy){
    for(size_t ix = max(x, size_t(0)); ix < xEnd; ++ix){
      m_data[array_index(ix, iy)] = f.at(ix, iy);
    }
  }
}
 
template <class T> void Field<T>::
swap(Field& f){
  using std::swap;
  swap(m_width, f.m_width);
  swap(m_height, f.m_height);
  swap(m_capacity, f.m_capacity);
  swap(m_data, f.m_data);
}
 
 
template <class T> size_t Field<T>::
array_index(size_t x, size_t y) const{
  return x + y * m_width;
}
 
 
template <class T>
template <class Archive>
void Field<T>::
save( Archive& ar, const unsigned int version) const
{
  ar & m_width;
  ar & m_height;
  const size_t s = size();
  for(size_t i = 0; i < s; ++i){
    ar & m_data[i];
  }
}
 
template <class T>
template <class Archive>
void Field<T>::
load( Archive& ar, const unsigned int version)
{
  size_t w = 0, h = 0;
  ar & w;
  ar & h;
  resize_no_copy(w, h);
  const size_t s = size();
  for(size_t i = 0; i < s; ++i){
    ar & m_data[i];
  }
}
 
}// end of namespace
 
#endif  //__H__UG_field_impl__