SPH
|
A look-up table approximation of the kernel. More...
#include <Kernel.h>
Public Member Functions | |
LutKernel ()=default | |
LutKernel (const LutKernel &other) | |
LutKernel (LutKernel &&other) | |
LutKernel & | operator= (const LutKernel &other) |
LutKernel & | operator= (LutKernel &&other)=default |
template<typename TKernel , typename = std::enable_if_t<!std::is_same<std::decay_t<TKernel>, LutKernel<D>>::value>> | |
LutKernel (TKernel &&source) | |
Constructs LUT kernel given an exact SPH kernel. More... | |
INLINE bool | isInit () const |
INLINE Float | radius () const noexcept |
INLINE Float | valueImpl (const Float qSqr) const noexcept |
INLINE Float | gradImpl (const Float qSqr) const noexcept |
![]() | |
Kernel ()=default | |
INLINE Float | value (const Vector &r, const Float h) const noexcept |
INLINE Vector | grad (const Vector &r, const Float h) const noexcept |
![]() | |
Noncopyable ()=default | |
Noncopyable (const Noncopyable &)=delete | |
Noncopyable (Noncopyable &&)=default | |
Noncopyable & | operator= (const Noncopyable &)=delete |
Noncopyable & | operator= (Noncopyable &&)=default |
A look-up table approximation of the kernel.
Can be constructed from any SPH kernel. Use this class exclusively for any high-performance computations, it is always faster than using kernel functions directly (except for trivial kerneles, such as TriangleKernel). The precision difference is about 1.e-6.