unsorted_sparse_vector.h

Go to the documentation of this file.

/*
 * Copyright (c) 2013-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 UNSORTED_VECTOR_H_
#define UNSORTED_VECTOR_H_
 
#include <vector>
#include "connection.h"
 
namespace ug{
 
template<typename TValue>
class UnsortedSparseVector
{
public:
  typedef TValue value_type;
  typedef AlgebraicConnection<TValue> connection;
 
  typedef typename std::vector<connection>::iterator iterator;
  typedef typename std::vector<connection>::const_iterator const_iterator;
 
private:
  std::vector<int> posInConnections;
  std::vector<connection > con;
  size_t m_size;
public:
 
  UnsortedSparseVector(size_t s) : posInConnections(s, -1), m_size(s)
  {
    con.reserve(32);
  }
  UnsortedSparseVector(size_t s) : posInConnections(s, -1), m_size(s) {…}
  iterator begin()
  {
    return con.begin();
  }
  iterator begin() {…}
  iterator end()
  {
    return con.end();
  }
  iterator end() {…}
  const_iterator begin() const
  {
    return con.begin();
  }
  const_iterator begin() const {…}
  const_iterator end() const
  {
    return con.end();
  }
  const_iterator end() const {…}
 
  size_t num_connections() const
  {
    return con.size();
  }
  size_t num_connections() const {…}
 
  size_t size() const
  {
    return m_size;
  }
  size_t size() const {…}
 
  connection *unsorted_raw_ptr()
  {
    return &con[0];
  }
  connection *unsorted_raw_ptr() {…}
 
 
  void clear()
  {
    for(size_t i=0; i<con.size(); i++)
      posInConnections[con[i].iIndex] = -1;
    con.clear();
  }
  void clear() {…}
 
  const value_type &operator()(size_t c) const
  {
    assert(c < m_size);
    int p = posInConnections[c];
    if(p != -1)
      return con[p].value();
    else
      assert(0 && "const_and_not_available");
  }
  const value_type &operator()(size_t c) const {…}
  value_type &operator()(size_t c)
  {
    assert(c < m_size);
    int p = posInConnections[c];
    if(p != -1)
      return con[p].value();
    else
    {
      p = posInConnections[c] = con.size();
      con.push_back(connection(c, TValue(0)));
      return con[p].value();
    }
  }
  value_type &operator()(size_t c) {…}
  bool has_connection(size_t c) const
  {
    assert(c < m_size);
    return posInConnections[c] != -1;
  }
  bool has_connection(size_t c) const {…}
};
class UnsortedSparseVector {…};
 
 
}
#endif /* UNSORTED_VECTOR_H_ */