StateArray.hpp File Reference

#include "fub/State.hpp"
#include "fub/ext/Eigen.hpp"
#include <boost/mp11/algorithm.hpp>

Go to the source code of this file.

Classes
struct	fub::ArrayState< Depths, Width >
struct	fub::StateTraits< ArrayState< Depths, Width > >
struct	fub::PrimitiveArray< Eq, Width >
struct	fub::StateTraits< PrimitiveArray< Eq, Width > >
struct	fub::CharacteristicsArray< Eq, Width >
struct	fub::KineticStateArray< Eq, Width >
struct	fub::StateTraits< KineticStateArray< Eq, Width > >
struct	fub::StateTraits< CharacteristicsArray< Eq, Width > >
struct	fub::ConservativeArray< Eq, Width >
struct	fub::StateTraits< ConservativeArray< Eq, Width > >
struct	fub::CompleteArray< Eq, Width >
struct	fub::StateTraits< CompleteArray< Eq, Width > >

Namespaces
	fub
	The fub namespace.

Typedefs
template<typename Depths , int Width>
using	fub::ArrayStateBase = typename detail::ArrayStateBaseImpl< Depths, Width >::type
template<typename Eq , int Width = kDefaultChunkSize>
using	fub::ConservativeArrayBase = typename detail::ConservativeArrayBaseImpl< Eq, Width >::type
template<typename Eq , int Width>
using	fub::CompleteArrayBase = typename detail::CompleteArrayBaseImpl< Eq, Width >::type

Functions
template<typename Eq , int N>
const ConservativeArray< Eq, N > &	fub::AsCons (const ConservativeArray< Eq, N > &x)
template<typename Eq , int N>
ConservativeArray< Eq, N > &	fub::AsCons (ConservativeArray< Eq, N > &x)
template<typename Eq , int N>
const ConservativeArrayBase< Eq, N > &	fub::AsCons (const CompleteArray< Eq, N > &x)
template<typename Eq , int N>
ConservativeArrayBase< Eq, N > &	fub::AsCons (CompleteArray< Eq, N > &x)
template<typename Eq , int N>
void	fub::Load (Conservative< Eq > &q, const ConservativeArray< Eq, N > &qs, int i)
template<typename Eq , int N>
void	fub::Load (Complete< Eq > &q, const CompleteArray< Eq, N > &qs, int i)
template<typename Eq , int N, typename Layout , std::size_t Rank>
void	fub::Load (ConservativeArray< Eq, N > &state, nodeduce_t< const BasicView< const Conservative< Eq >, Layout, static_cast< int >(Rank)> & > view, std::array< std::ptrdiff_t, Rank > index)
template<typename Eq , int N, typename Layout , int Rank>
void	fub::Load (ConservativeArray< Eq, N > &state, const BasicView< const Conservative< Eq >, Layout, Rank > &view, nodeduce_t< const std::array< std::ptrdiff_t, std::size_t(Rank)> & > index)
template<typename Eq >
void	fub::Load (ConservativeArray< Eq > &state, nodeduce_t< ViewPointer< const Conservative< Eq >>> pointer)
template<typename Eq , int N, typename Layout , int Rank>
void	fub::Load (CompleteArray< Eq, N > &state, const BasicView< const Complete< Eq >, Layout, Rank > &view, nodeduce_t< const std::array< std::ptrdiff_t, std::size_t(Rank)> & > index)
template<typename Eq >
void	fub::Load (CompleteArray< Eq > &state, nodeduce_t< ViewPointer< const Complete< Eq >>> pointer)
template<typename Eq , int N, typename Layout , int Rank>
void	fub::LoadN (CompleteArray< Eq, N > &state, const BasicView< const Complete< Eq >, Layout, Rank > &view, int size, nodeduce_t< const std::array< std::ptrdiff_t, std::size_t(Rank)> & > pos)
template<typename Eq , int N, typename Layout , int Rank>
void	fub::LoadN (ConservativeArray< Eq, N > &state, const BasicView< const Conservative< Eq >, Layout, Rank > &view, int size, nodeduce_t< const std::array< std::ptrdiff_t, std::size_t(Rank)> & > pos)
template<typename Eq >
void	fub::LoadN (CompleteArray< Eq > &state, nodeduce_t< ViewPointer< const Complete< Eq >>> pointer, int n)
template<typename Eq >
void	fub::LoadN (ConservativeArray< Eq > &state, nodeduce_t< ViewPointer< const Conservative< Eq >>> pointer, int n)
template<typename Eq >
void	fub::Store (nodeduce_t< ViewPointer< Conservative< Eq >>> pointer, const ConservativeArray< Eq > &state)
template<typename Eq >
void	fub::Store (nodeduce_t< ViewPointer< Complete< Eq >>> pointer, const CompleteArray< Eq > &state)
template<typename Eq >
void	fub::StoreN (nodeduce_t< ViewPointer< Conservative< Eq >>> pointer, const ConservativeArray< Eq > &state, int n)
template<typename Eq >
void	fub::StoreN (nodeduce_t< ViewPointer< Complete< Eq >>> pointer, const CompleteArray< Eq > &state, int n)
template<typename Eq , int N, typename Layout , int Rank>
void	fub::Store (const BasicView< Conservative< Eq >, Layout, Rank > &view, const ConservativeArray< Eq, N > &state, nodeduce_t< const std::array< std::ptrdiff_t, std::size_t(Rank)> & > index)
template<typename Eq , int N, typename Layout , int Rank>
void	fub::Store (const BasicView< Complete< Eq >, Layout, Rank > &view, const CompleteArray< Eq, N > &state, nodeduce_t< const std::array< std::ptrdiff_t, std::size_t(Rank)> & > index)
template<typename Eq , int N, typename Layout , int Rank>
void	fub::StoreN (const BasicView< Complete< Eq >, Layout, Rank > &view, const CompleteArray< Eq, N > &state, int size, nodeduce_t< const std::array< std::ptrdiff_t, std::size_t(Rank)> & > pos)
template<typename Eq , int N, typename Layout , int Rank>
void	fub::StoreN (const BasicView< Conservative< Eq >, Layout, Rank > &view, const ConservativeArray< Eq, N > &state, int size, nodeduce_t< const std::array< std::ptrdiff_t, std::size_t(Rank)> & > pos)