an efficient C++ finite element environment
|
|
Go to the documentation of this file. 1 #ifndef _RHEOLEF_GEO_NEAREST_H
2 #define _RHEOLEF_GEO_NEAREST_H
31 #include "rheolef/point.h"
32 #include "rheolef/disarray.h"
37 template <
class T,
class M>
class geo_base_rep;
38 template <
class T,
class M>
class geo_nearest_abstract_rep;
40 template <
class T,
class M>
59 mutable geo_nearest_abstract_rep<T,M>*
_ptr;
63 #endif // _RHEOLEF_GEO_NEAREST_H
disarray< T, M >::size_type size_type
base class for M=sequential or distributed meshes representations
size_type dis_nearest(const geo_base_rep< T, M > &omega, const point_basic< T > &x, point_basic< T > &x_nearest) const
geo_nearest(const geo_nearest< T, M > &)
static geo_nearest_abstract_rep< T, M > * make_ptr(const geo_base_rep< T, M > &omega)
geo_nearest< T, M > & operator=(const geo_nearest< T, M > &)
This file is part of Rheolef.
geo_nearest_abstract_rep< T, M > * _ptr
see the disarray page for the full documentation
field::size_type size_type
size_type seq_nearest(const geo_base_rep< T, M > &omega, const point_basic< T > &x, point_basic< T > &x_nearest) const