fixed_array.h

Go to the documentation of this file.

/*
 * Copyright (c) 2010-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__FIXED_ARRAY_H__
#define __H__UG__COMMON__FIXED_ARRAY_H__
 
#include "storage.h"
#include <iostream>
#include <cassert>
 
//  FixedArray1
namespace ug{
 
template<typename T, size_t n>
class FixedArray1
{
public:
  typedef T value_type;
  typedef size_t size_type;
  typedef static_type storage_type;
 
public:
  FixedArray1();
  FixedArray1(size_type n_);
  FixedArray1(const FixedArray1<T, n> &other);
 
//protected:
  // see Alexandrescu: non-virtual destructors should be protected
  ~FixedArray1();
 
public:
  // capacity
  inline size_type
  size() const;
 
  inline size_type
  capacity() const;
 
  inline bool
  resize(size_type newN, bool bCopyValues=true);
 
  inline bool
  reserve(size_type newN) const;
 
  // Element access
  inline const T &
  at(size_type i) const
  {
    return operator[](i);
  }
  at(size_type i) const {…}
 
  inline T &
  at(size_type i)
  {
    return operator[](i);
  }
  at(size_type i) {…}
 
  inline const T &
  operator[](size_type i) const ;
 
  inline T &
  operator[](size_type i) ;
 
  // output
  template<typename _T, size_type _n>
  friend
  std::ostream &
  operator << (std::ostream &out, const FixedArray1<_T, _n> &arr);
 
protected:
  T values[n];
};
class FixedArray1 {…};
 
template<typename T, size_t N>
struct storage_traits1<FixedArray1<T, N> >
{
  enum {is_static = true};
  enum {static_size = N};
};
struct storage_traits1<FixedArray1<T, N> > {…};
 
 
//  FixedArray2
template<typename T, size_t rowsT, size_t colsT, eMatrixOrdering T_ordering=ColMajor>
class FixedArray2
{
public:
  typedef T value_type;
  typedef size_t size_type;
  static const eMatrixOrdering ordering = T_ordering;
  enum { is_static=true};
  enum { static_num_rows=rowsT};
  enum { static_num_cols=colsT};
  typedef static_type storage_type;
 
public:
  FixedArray2();
  FixedArray2(size_type rows, size_type cols);
  FixedArray2(const FixedArray2<T, rowsT, colsT, T_ordering> &other);
 
//protected:
  // see Alexandrescu: non-virtual destructors should be protected
  ~FixedArray2();
 
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 rowsT; }
 
  inline size_type
  capacity_num_cols() const { return colsT; };
 
  inline bool
  empty() const;
 
  inline bool
  reserve(size_type nrRows, size_type nrCols) const
  {
    assert(nrRows == rowsT && nrCols == colsT);
    return nrRows == rowsT && nrCols == colsT;
  }
  reserve(size_type nrRows, size_type nrCols) const {…}
 
 
  // Element access
  inline const T &
  at(size_type r, size_type c) const
  {
    // todo: if(r >= rowsT || c >= colsT) throw
    return operator()(r, c);
  }
  at(size_type r, size_type c) const {…}
 
  inline T &
  at(size_type r, size_type c)
  {
    // todo: if(r >= rowsT || c >= colsT) throw
    return operator()(r, c);
  }
  at(size_type r, size_type c) {…}
 
  inline const T &
  operator()(size_type r, size_type c) const ;
 
  inline T &
  operator()(size_type r, size_type c) ;
 
  // output
  template<typename a, size_type b, size_type c, eMatrixOrdering d>
  friend
  std::ostream &
  operator << (std::ostream &out, const FixedArray2<a, b, c, d> &arr);
 
protected:
  T values[rowsT*colsT];
};
class FixedArray2 {…};
 
 
}
#include "fixed_array_impl.h"
// #include "fixed_array_specialization.h"
 
#endif // __H__UG__COMMON__FIXED_ARRAY_H__