smart_ptr_vector.h

Go to the documentation of this file.

/*
 * Copyright (c) 2013:  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.
 */
 
#include <vector>
 
#ifndef SMART_PTR_VECTOR_H
#define SMART_PTR_VECTOR_H
 
namespace ug{
template<typename T>
class SmartPtrVector : public std::vector<SmartPtr<T> >
{
  typedef std::vector<SmartPtr<T> > super;
private:
  SmartPtrVector(SmartPtrVector &);
public:
  SmartPtrVector() : super() {}
  SmartPtrVector(size_t size) : super(size)
  {
  }
 
  const T &operator () (size_t i) const
  {
    assert(i < super::size());
    return *super::operator[](i);
  }
  T &operator () (size_t i)
  {
    assert(i < super::size());
    return *super::operator[](i);
  }
};
 
/*
{
private:
  SmartPtrVector(SmartPtrVector &);
public:
  SmartPtrVector();
  SmartPtrVector(size_t size) : m_data(size)
  {
  }
 
  T &operator [] (size_t i)
  {
    assert(i < m_data.size());
    return *m_data[i];
  }
 
  const T &operator [] (size_t i) const
  {
    assert(i < m_data.size());
    return *m_data[i];
  }
 
  SmartPtr<T> get_smart_ptr(size_t i)
  {
    assert(i < m_data.size());
    return m_data[i];
  }
 
 
  void push_back(SmartPtr<T> t)
  {
    m_data.push_back(t);
  }
 
  size_t size() const
  {
    return m_data.size();
  }
 
  void clear()
  {
    m_data.clear();
  }
 
private:
  std::vector<SmartPtr<T> > m_data;
};*/
 
 
 
 
}
 
 
#endif