4 #ifndef DUNE_PDELAB_ORDERING_PERMUTEDORDERING_HH
5 #define DUNE_PDELAB_ORDERING_PERMUTEDORDERING_HH
7 #include <dune/typetree/typetree.hh>
18 #ifndef DOXYGEN // implementation internals
25 std::vector<std::size_t>& permutation()
30 const std::vector<std::size_t>& permutation()
const
37 std::vector<std::size_t> _permutation;
41 template<std::
size_t i>
62 template<
typename OrderingTag>
64 :
public permuted::base_holder<decorated_ordering_tag<Permuted<OrderingTag>,OrderingTag>::level>
79 template<std::
size_t i>
80 const permuted::base_holder<i>&
permuted()
const
85 template<std::
size_t i>
99 template<
typename Ordering>
101 :
public TypeTree::CompositeNode<Ordering>
103 typename Ordering::Traits::ContainerIndex>
104 ,
public OrderingBase<typename Ordering::Traits::DOFIndex,
105 typename Ordering::Traits::ContainerIndex>
108 typedef typename Ordering::Traits
Traits;
116 typedef TypeTree::CompositeNode<Ordering> NodeT;
118 typedef OrderingBase<
typename Ordering::Traits::DOFIndex,
119 typename Ordering::Traits::ContainerIndex>
BaseT;
125 return this->
template child<0>();
130 return this->
template child<0>();
136 ,
BaseT(*this,false,nullptr,this)
141 : NodeT(r.nodeStorage())
149 : NodeT(r.nodeStorage())
150 ,
BaseT(std::move(r))
156 virtual void map_index_dynamic(
typename Traits::DOFIndexView di,
typename Traits::ContainerIndex& ci)
const override
159 ci.back() = _tag.permutation()[ci.back()];
162 template<
typename ItIn,
typename ItOut>
165 for (; in != end; ++in, ++out)
167 out->back() = _tag.permutation()[out->back()];
171 template<
typename CIOutIterator>
172 typename Traits::SizeType
174 typename Traits::SizeType child_index,
175 CIOutIterator ci_out,
const CIOutIterator ci_end)
const
177 for (; ci_out != ci_end; ++ci_out)
179 ci_out->back() = _tag.permutation()[ci_out->back()];
188 if (!_tag.permutation().empty() && _tag.permutation().size() != this->blockCount())
190 "Size of permutation array does not match block count of ordering: "
191 << _tag.permutation().size()
193 << this->blockCount()
197 auto& mutable_tag =
const_cast<ordering::permuted::tag_base&
>(_tag);
198 mutable_tag.permutation().resize(this->
blockCount());
200 mutable_tag.permutation().begin(),
201 mutable_tag.permutation().end(),
209 const ordering::permuted::tag_base& _tag;
217 template<
typename GFS,
typename Transformation,
typename Undecorated,
typename Tag>
226 return transformed_type(make_tuple(undecorated),gfs.orderingTag().template permuted<Tag::level>());
231 return std::make_shared<transformed_type>(make_tuple(undecorated),gfs_pointer->orderingTag().template permuted<Tag::level>());
236 template<
typename GFS,
typename Transformation,
typename Undecorated,
typename GlueTag,
typename UndecoratedTag>
237 gfs_to_permuted<GFS,Transformation,Undecorated,GlueTag>
244 template<
typename GFS,
typename Transformation,
typename U>
245 struct power_gfs_to_local_ordering_descriptor<GFS,Transformation,ordering::Permuted<U> >
246 :
public power_gfs_to_local_ordering_descriptor<GFS,Transformation,U>
250 template<
typename GFS,
typename Transformation,
typename U>
251 struct composite_gfs_to_local_ordering_descriptor<GFS,Transformation,ordering::Permuted<U> >
252 :
public composite_gfs_to_local_ordering_descriptor<GFS,Transformation,U>
259 #endif // DUNE_PDELAB_ORDERING_PERMUTEDORDERING_HH