permutation_util.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 __H__UG__CPU_ALGEBRA__PERMUTATION_UTIL__
#define __H__UG__CPU_ALGEBRA__PERMUTATION_UTIL__
 
#include "common/common.h"
#include "common/profiler/profiler.h"
#include "common/error.h"
#include "lib_algebra/ordering_strategies/algorithms/native_cuthill_mckee.h"
#include <vector>
 
namespace ug{
template<typename TMatrix>
static void SetMatrixAsPermutation(TMatrix &PA, const TMatrix &A, const std::vector<size_t> &perm)
{
  PROFILE_FUNC_GROUP("algebra");
  PA.resize_and_clear(A.num_rows(), A.num_cols());
 
  for(size_t r=0; r<A.num_rows(); r++)
  {
    size_t Pr=perm[r];
    for(typename TMatrix::const_row_iterator it = A.begin_row(r); it != A.end_row(r); ++it)
    {
      size_t Pc = perm[it.index()];
      PA(Pr, Pc) = it.value();
    }
  }
}
static void SetMatrixAsPermutation(TMatrix &PA, const TMatrix &A, const std::vector<size_t> &perm) {…}
 
 
template<typename TVector>
static void SetVectorAsPermutation(TVector &Pv, const TVector &v, const std::vector<size_t> &perm)
{
  if(Pv.size() != v.size()) Pv.resize(v.size());
  for(size_t i=0; i<v.size(); i++)
    Pv[ perm[i] ] = v[i];
}
static void SetVectorAsPermutation(TVector &Pv, const TVector &v, const std::vector<size_t> &perm) {…}
 
 
bool GetInversePermutation(const std::vector<size_t> &perm, std::vector<size_t> &invPerm);
 
// /todo move this to a proper place and remove ordering_strategies dependency
 
template<typename TSparseMatrix>
void GetCuthillMcKeeOrder(const TSparseMatrix &mat, std::vector<size_t> &newIndex, bool reverse=true, bool bPreserveConsec=false)
{
  std::vector<std::vector<size_t> > neighbors;
  neighbors.resize(mat.num_rows());
 
  for(size_t i=0; i<mat.num_rows(); i++)
  {
    for(typename TSparseMatrix::const_row_iterator i_it = mat.begin_row(i); i_it != mat.end_row(i); ++i_it)
      neighbors[i].push_back(i_it.index());
 
    // make sure there are no disconnected DoFs
    //UG_ASSERT(neighbors[i].size(), "Index "<< i << " does not have any connections. This will most probably "
    //  "lead to problems and is therefore disallowed.");
  }
 
  ComputeCuthillMcKeeOrder(newIndex, neighbors, reverse, bPreserveConsec);
}
void GetCuthillMcKeeOrder(const TSparseMatrix &mat, std::vector<size_t> &newIndex, bool reverse=true, bool bPreserveConsec=false) {…}
 
 
#ifndef HAVE_BOOL
#define HAVE_BOOL
 
class BOOL{
public:
  BOOL() : value_(bool()){}
  BOOL(bool const& t): value_(t) {}
  operator bool() const { return value_; }
private:
  char value_;
};
class BOOL {…};
 
#endif
 
#ifndef HAVE_IS_PERMUTATION
#define HAVE_IS_PERMUTATION
 
template <typename O_t>
bool is_permutation(O_t &o){
  std::vector<BOOL> container(o.size(), false);
  for(unsigned i = 0; i < o.size(); ++i){
    if(!container[o[i]]){
      container[o[i]] = true;
    }
    else{
      return false; //no doubles allowed
    }
  }
 
  for(unsigned i = 0; i < o.size(); ++i){
    if(!container[i]){
      return false;
    }
  }
 
  return true;
}
bool is_permutation(O_t &o) {…}
 
#endif
 
} // end namespace ug
 
 
#endif