reservable_array.h

Go to the documentation of this file.

/*
 * Copyright (c) 2011-2015:  G-CSC, Goethe University Frankfurt
 * Author: Martin Rupp
 * 
 * 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__COMMON__VARIABLE_ARRAY_H__
#define __H__UG__COMMON__VARIABLE_ARRAY_H__
 
#include "storage.h"
#include <iostream>
#include <cassert>
 
namespace ug{
 
//  ReservableArray2
template<typename T, eMatrixOrdering T_ordering=ColMajor>
class ReservableArray2
{
public:
  typedef T value_type;
  typedef size_t size_type;
  static const eMatrixOrdering ordering = T_ordering;
  enum { is_static=false };
  enum { static_num_rows=0};
  enum { static_num_cols=0};
  typedef variable_type storage_type;
 
public:
  ReservableArray2();
  ReservableArray2(size_type rows_, size_type cols_);
  ReservableArray2(const VariableArray2<T, T_ordering> &other);
 
//protected:
  // see Alexandrescu: non-virtual destructors should be protected
  ~ReservableArray2();
 
public:
  // Capacity
  inline size_type
  num_rows() const;
 
  inline size_type
  num_cols() const;
 
  inline bool
  resize(size_type newRows, size_type newCols, bool bCopyValues=true);
 
  inline size_type
  capacity_num_rows() const { return rows; }
 
  inline size_type
  capacity_num_cols() const { return cols; };
 
  inline bool
  reserve(size_type nrRows, size_type nrCols) const   { return; }
 
  // Element Access
 
  inline const T &
  at(size_type r, size_type c) const
  {
    // todo: if(r >= rows || c >= cols) throw
    return operator()(r, c);
  }
 
  inline T &
  at(size_type r, size_type c)
  {
    // todo: if(r >= rows || c >= cols) throw
    return operator()(r, c);
  }
 
  inline const T &
  operator()(size_type r, size_type c) const ;
 
  inline T &
  operator()(size_type r, size_type c) ;
 
  // output
 
  template<typename _T, eMatrixOrdering _T_Ordering>
  friend std::ostream &operator << (std::ostream &out, const ReservableArray2<_T, _T_Ordering> &arr);
 
protected:
  T *values;
  size_type rows;
  size_type cols;
  size_type arraySize;
};
 
}
 
#include "variable_array_impl.h"
 
#endif // #define __H__UG__COMMON__VARIABLE_ARRAY_H__