Panzer Version of the Day
Loading...
Searching...
No Matches
Panzer_STK_Utilities.hpp
Go to the documentation of this file.
1// @HEADER
2// ***********************************************************************
3//
4// Panzer: A partial differential equation assembly
5// engine for strongly coupled complex multiphysics systems
6// Copyright (2011) Sandia Corporation
7//
8// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
9// the U.S. Government retains certain rights in this software.
10//
11// Redistribution and use in source and binary forms, with or without
12// modification, are permitted provided that the following conditions are
13// met:
14//
15// 1. Redistributions of source code must retain the above copyright
16// notice, this list of conditions and the following disclaimer.
17//
18// 2. Redistributions in binary form must reproduce the above copyright
19// notice, this list of conditions and the following disclaimer in the
20// documentation and/or other materials provided with the distribution.
21//
22// 3. Neither the name of the Corporation nor the names of the
23// contributors may be used to endorse or promote products derived from
24// this software without specific prior written permission.
25//
26// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
27// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
30// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
31// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
32// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
33// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
34// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
35// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
36// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37//
38// Questions? Contact Roger P. Pawlowski (rppawlo@sandia.gov) and
39// Eric C. Cyr (eccyr@sandia.gov)
40// ***********************************************************************
41// @HEADER
42
43#ifdef PANZER_HAVE_EPETRA_STACK
44
45#ifndef __Panzer_STK_Utilities_hpp__
46#define __Panzer_STK_Utilities_hpp__
47
49
50#include "Epetra_Vector.h"
51#include "Epetra_MultiVector.h"
52
53namespace panzer {
54 class GlobalIndexer;
55}
56
57namespace panzer_stk {
58
67void write_cell_data(panzer_stk::STK_Interface & mesh,const std::vector<double> & data,const std::string & fieldName);
68
69void write_solution_data(const panzer::GlobalIndexer& dofMngr,panzer_stk::STK_Interface & mesh,const Epetra_MultiVector & x,const std::string & prefx="",const std::string & postfix="");
70void write_solution_data(const panzer::GlobalIndexer& dofMngr,panzer_stk::STK_Interface & mesh,const Epetra_Vector & x,const std::string & prefix="",const std::string & postfix="");
71
78template <typename RAContainer,class Compare>
79void sorted_permutation(const RAContainer & cont,std::vector<std::size_t> & permutation,const Compare & comp);
80
87template <typename RAContainer>
88void sorted_permutation(const RAContainer & cont,std::vector<std::size_t> & permutation);
89
90}
91
92namespace panzer_stk {
93// utility class used by the sorted permutation objects
94template <typename RAContainer,typename Compare>
95struct PermFunctor {
96 PermFunctor(const RAContainer & cont,const Compare & comp)
97 : compare(comp), values(cont) {}
98 PermFunctor(const PermFunctor & p)
99 : compare(p.compare), values(p.values) {}
100
101 bool operator()(std::size_t a,std::size_t b) const
102 { return compare(values[a],values[b]); }
103
104private:
105 const Compare & compare;
106 const RAContainer & values;
107
108 PermFunctor();
109};
110
111template <typename RAContainer>
112void sorted_permutation(const RAContainer & cont,std::vector<std::size_t> & permutation)
113{
114 std::less<typename RAContainer::value_type> comp;
115 sorted_permutation(cont,permutation,comp);
116}
117
118template <typename RAContainer,class Compare>
119void sorted_permutation(const RAContainer & cont,std::vector<std::size_t> & permutation,const Compare & comp)
120{
121 PermFunctor<RAContainer,Compare> pf(cont,comp);
122
123 permutation.resize(cont.size());
124 for(std::size_t i=0;i<cont.size();i++)
125 permutation[i] = i;
126
127 std::sort(permutation.begin(),permutation.end(),pf);
128}
129
130}
131
132#endif
133
134#endif // PANZER_HAVE_EPETRA_STACK