/usr/include/dune/pdelab/ordering/decorator.hh is in libdune-pdelab-dev 2.5.0~20170124g7cf9f47a-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 | // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_PDELAB_ORDERING_DECORATOR_HH
#define DUNE_PDELAB_ORDERING_DECORATOR_HH
#include <dune/typetree/typetree.hh>
#include <dune/pdelab/common/typetraits.hh>
#include <dune/pdelab/ordering/utility.hh>
#include <dune/pdelab/ordering/orderingbase.hh>
namespace Dune {
namespace PDELab {
//! \addtogroup Ordering
//! \{
namespace ordering {
#ifndef DOXYGEN
// Forward declaration for is_decorated specialization
template<typename D, typename U>
struct decorated_ordering_tag;
namespace impl {
struct is_decorated
{};
template<typename DecoratedOrderingTag, std::size_t level>
struct basetag_access_provider
{};
// provide access to the base tag for disambiguation of member
// accesses in case those are overloaded by a decorator.
template<typename D, typename U>
struct basetag_access_provider<decorated_ordering_tag<D,U>,0>
: public is_decorated
{
typedef U BaseTag;
const BaseTag& baseTag() const
{
return static_cast<decorated_ordering_tag<D,U>& >(*this);
}
BaseTag& baseTag()
{
return static_cast<decorated_ordering_tag<D,U>& >(*this);
}
};
template<typename T, T v>
struct lazy_constant
{
typedef std::integral_constant<T,v> type;
};
template<typename D>
struct lazy_level
{
typedef std::integral_constant<std::size_t,D::level> type;
};
template<typename D>
struct decoration_level
: public std::conditional<
std::is_base_of<is_decorated, D>::value,
lazy_level<D>,
lazy_constant<std::size_t,0>
>::type::type
{};
} // namespace impl
#endif // DOXYGEN
template<typename D, typename U>
struct decorated_ordering_tag
: U
, impl::basetag_access_provider<decorated_ordering_tag<D,U>,impl::decoration_level<U>::value>
{
typedef D Decorator;
typedef U Undecorated;
static const std::size_t level = impl::decoration_level<U>::value + 1;
decorated_ordering_tag()
{}
decorated_ordering_tag(const Undecorated& u)
: Undecorated(u)
{}
decorated_ordering_tag(Undecorated&& u)
: Undecorated(std::move(u))
{}
};
namespace {
// recursive helper for undecorated_ordering that traverses down the Ordering tree level times
// end of recursion
template<typename Ordering>
const Ordering& _unwind_decorators(const Ordering& ordering, std::integral_constant<std::size_t,0>)
{
return ordering;
}
// recursive implementation - this uses decltype to avoid implementing a separate meta function
// for calculating the return type
template<typename Ordering, std::size_t level>
auto _unwind_decorators(const Ordering& ordering, std::integral_constant<std::size_t,level>)
-> decltype(
_unwind_decorators(
ordering.template child<0>(),
std::integral_constant<std::size_t,level-1>()
)
)
{
return _unwind_decorators(
ordering.template child<0>(),
std::integral_constant<std::size_t,level-1>()
);
}
}
//! Unwinds the stack of decorators on top of the base ordering of gfs and returns the base ordering.
/**
* This support functionality is required for the DataHandleProvider of dune-multidomaingrid.
*/
template<typename GFS>
auto undecorated_ordering(const GFS& gfs)
-> decltype(
_unwind_decorators(
gfs.ordering(),
impl::decoration_level<typename GFS::OrderingTag>()
)
)
{
return _unwind_decorators(
gfs.ordering(),
impl::decoration_level<typename GFS::OrderingTag>()
);
}
template<typename GFS,typename Transformation,typename Undecorated,typename GlueTag, typename Tag>
struct gfs_to_decorator_descriptor
: public TypeTree::meta_function
{
typedef decltype(
register_gfs_to_decorator_descriptor(
TypeTree::declptr<GFS>(), // the source GridFunctionSpace
TypeTree::declptr<Transformation>(), // the full transformation descriptor
TypeTree::declptr<Undecorated>(), // the type of the undecorated Ordering to be wrapped in the decorator
TypeTree::declptr<GlueTag>(), // the decorated_ordering_tag for the current decoration nesting level
TypeTree::declptr<Tag>() // the decorator tag
)
) type;
};
template<typename GFS, typename Transformation, typename OrderingTag>
struct leaf_gfs_to_decorated
{
static const bool recursive = false;
typedef typename leaf_gfs_to_ordering_descriptor<
GFS,
Transformation,
typename OrderingTag::Undecorated
>::type undecorated_descriptor;
typedef typename undecorated_descriptor::transformed_type undecorated_type;
typedef typename gfs_to_decorator_descriptor<
GFS,
Transformation,
undecorated_type,
OrderingTag,
typename OrderingTag::Decorator
>::type decorator_descriptor;
typedef typename decorator_descriptor::transformed_type transformed_type;
typedef typename decorator_descriptor::transformed_storage_type transformed_storage_type;
static transformed_type transform(const GFS& gfs, const Transformation& t)
{
return decorator_descriptor::transform(gfs,t,std::make_shared<undecorated_type>(undecorated_descriptor::transform(gfs,t)));
}
static transformed_storage_type transform(std::shared_ptr<const GFS>& gfs_pointer, const Transformation& t)
{
return decorator_descriptor::transform(gfs_pointer,t,undecorated_descriptor::transform(gfs_pointer,t));
}
};
template<typename GFS, typename Transformation, typename D, typename U>
leaf_gfs_to_decorated<GFS,Transformation,decorated_ordering_tag<D,U> >
register_leaf_gfs_to_ordering_descriptor(GFS*,Transformation*,decorated_ordering_tag<D,U>*);
template<typename GFS, typename Transformation, typename OrderingTag>
struct recursive_power_gfs_to_decorated
{
static const bool recursive = true;
template<typename TC>
struct result
{
typedef typename power_gfs_to_ordering_descriptor<
GFS,
Transformation,
typename OrderingTag::Undecorated
>::type undecorated_descriptor;
typedef typename undecorated_descriptor::template result<TC>::type undecorated_type;
typedef typename gfs_to_decorator_descriptor<
GFS,
Transformation,
undecorated_type,
OrderingTag,
typename OrderingTag::Decorator
>::type decorator_descriptor;
typedef typename decorator_descriptor::transformed_type type;
typedef typename decorator_descriptor::transformed_storage_type storage_type;
};
template<typename TC>
static typename result<TC>::type transform(const GFS& gfs, const Transformation& t, const array<std::shared_ptr<TC>,TypeTree::StaticDegree<GFS>::value>& children)
{
return result<TC>::decorator_descriptor::transform(gfs,t,std::make_shared<typename result<TC>::undecorated_type>(result<TC>::undecorated_descriptor::transform(gfs,t,children)));
}
template<typename TC>
static typename result<TC>::storage_type transform_storage(std::shared_ptr<const GFS> gfs_pointer, const Transformation& t, const array<std::shared_ptr<TC>,TypeTree::StaticDegree<GFS>::value>& children)
{
return result<TC>::decorator_descriptor::transform(gfs_pointer,t,result<TC>::undecorated_descriptor::transform_storage(gfs_pointer,t,children));
}
};
template<typename GFS, typename Transformation, typename OrderingTag>
struct nonrecursive_power_gfs_to_decorated
{
static const bool recursive = false;
typedef typename power_gfs_to_ordering_descriptor<
GFS,
Transformation,
typename OrderingTag::Undecorated
>::type undecorated_descriptor;
typedef typename undecorated_descriptor::transformed_type undecorated_type;
typedef typename gfs_to_decorator_descriptor<
GFS,
Transformation,
undecorated_type,
OrderingTag,
typename OrderingTag::Decorator
>::type decorator_descriptor;
typedef typename decorator_descriptor::transformed_type transformed_type;
typedef typename decorator_descriptor::transformed_storage_type transformed_storage_type;
static transformed_type transform(const GFS& gfs, const Transformation& t)
{
return decorator_descriptor::transform(gfs,t,std::make_shared<undecorated_type>(undecorated_descriptor::transform(gfs,t)));
}
static transformed_storage_type transform_storage(std::shared_ptr<const GFS>& gfs_pointer, const Transformation& t)
{
return decorator_descriptor::transform_storage(gfs_pointer,t,undecorated_descriptor::transform_storage(gfs_pointer,t));
}
};
template<typename GFS, typename Transformation, typename OrderingTag>
struct power_gfs_to_decorated
: public std::conditional<
power_gfs_to_ordering_descriptor<
GFS,
Transformation,
typename OrderingTag::Undecorated
>::type::recursive,
recursive_power_gfs_to_decorated<
GFS,
Transformation,
OrderingTag
>,
nonrecursive_power_gfs_to_decorated<
GFS,
Transformation,
OrderingTag>
>::type
{};
template<typename GFS, typename Transformation, typename D, typename U>
power_gfs_to_decorated<
GFS,
Transformation,
decorated_ordering_tag<D,U>
>
register_power_gfs_to_ordering_descriptor(GFS*,Transformation*,decorated_ordering_tag<D,U>*);
template<typename GFS, typename Transformation, typename OrderingTag>
struct recursive_composite_gfs_to_decorated
{
static const bool recursive = true;
template<typename... TC>
struct result
{
typedef typename composite_gfs_to_ordering_descriptor<
GFS,
Transformation,
typename OrderingTag::Undecorated
>::type undecorated_descriptor;
typedef typename undecorated_descriptor::template result<TC...>::type undecorated_type;
typedef typename gfs_to_decorator_descriptor<
GFS,
Transformation,
undecorated_type,
OrderingTag,
typename OrderingTag::Decorator
>::type decorator_descriptor;
typedef typename decorator_descriptor::transformed_type type;
typedef typename decorator_descriptor::transformed_storage_type storage_type;
};
template<typename... TC>
static typename result<TC...>::type transform(const GFS& gfs, const Transformation& t, std::shared_ptr<TC>... children)
{
return result<TC...>::decorator_descriptor::transform(gfs,t,std::make_shared<typename result<TC...>::undecorated_type>(result<TC...>::undecorated_descriptor::transform(gfs,t,children...)));
}
template<typename... TC>
static typename result<TC...>::storage_type transform_storage(std::shared_ptr<const GFS> gfs_pointer, const Transformation& t, std::shared_ptr<TC>... children)
{
return result<TC...>::decorator_descriptor::transform_storage(gfs_pointer,t,result<TC...>::undecorated_descriptor::transform(gfs_pointer,t,children...));
}
};
template<typename GFS, typename Transformation, typename OrderingTag>
struct nonrecursive_composite_gfs_to_decorated
{
static const bool recursive = false;
typedef typename composite_gfs_to_ordering_descriptor<
GFS,
Transformation,
typename OrderingTag::Undecorated
>::type undecorated_descriptor;
typedef typename undecorated_descriptor::transformed_type undecorated_type;
typedef typename gfs_to_decorator_descriptor<
GFS,
Transformation,
undecorated_type,
OrderingTag,
typename OrderingTag::Decorator
>::type decorator_descriptor;
typedef typename decorator_descriptor::transformed_type transformed_type;
typedef typename decorator_descriptor::transformed_storage_type transformed_storage_type;
static transformed_type transform(const GFS& gfs, const Transformation& t)
{
return decorator_descriptor::transform(gfs,t,std::make_shared<undecorated_type>(undecorated_descriptor::transform(gfs,t)));
}
static transformed_storage_type transform_storage(std::shared_ptr<const GFS>& gfs_pointer, const Transformation& t)
{
return decorator_descriptor::transform_storage(gfs_pointer,t,undecorated_descriptor::transform(gfs_pointer,t));
}
};
template<typename GFS, typename Transformation, typename OrderingTag>
struct composite_gfs_to_decorated
: public std::conditional<
composite_gfs_to_ordering_descriptor<
GFS,
Transformation,
typename OrderingTag::Undecorated
>::type::recursive,
recursive_composite_gfs_to_decorated<
GFS,
Transformation,
OrderingTag
>,
nonrecursive_composite_gfs_to_decorated<
GFS,
Transformation,
OrderingTag>
>::type
{};
template<typename GFS, typename Transformation, typename D, typename U>
composite_gfs_to_decorated<GFS,Transformation,decorated_ordering_tag<D,U> >
register_composite_gfs_to_ordering_descriptor(GFS*,Transformation*,decorated_ordering_tag<D,U>*);
} // namespace ordering
//! \} group ordering
} // namespace PDELab
} // namespace Dune
#endif // DUNE_PDELAB_ORDERING_DECORATOR_HH
|