FlatMap Operators

Description

Run a n to m flatMap operation.

Parameters

K	- Key type of the created dataset
T	- Value type of the source dataset
L	- Key type of the created dataset
U	- Value type of the created dataset
funcP	- A function pointer of a user function deque<T> F(T,T) that will be used on each dataset entry

Returns

A pointer to a new dataset

Functions
template<typename U >
fdd< U > *	faster::fdd< T >::flatMap (flatMapFunctionP< T, U > funcP)
	creates a fdd<U>
template<typename U >
fdd< U > *	faster::fdd< T >::flatMap (PflatMapFunctionP< T, U > funcP)
	creates a fdd<U *>
template<typename L , typename U >
indexedFdd< L, U > *	faster::fdd< T >::flatMap (IflatMapFunctionP< T, L, U > funcP)
	creates a indexedFdd<L,U>
template<typename L , typename U >
indexedFdd< L, U > *	faster::fdd< T >::flatMap (IPflatMapFunctionP< T, L, U > funcP)
	creates a indexedFdd<L,U*>
template<typename L , typename U >
indexedFdd< L, U > *	faster::indexedFdd< K, T >::flatMap (IflatMapIFunctionP< K, T, L, U > funcP)
	creates a indexedFdd<L,U>
template<typename L , typename U >
indexedFdd< L, U > *	faster::indexedFdd< K, T >::flatMap (IPflatMapIFunctionP< K, T, L, U > funcP)
	creates a indexedFdd<L,U*>
template<typename L , typename U >
fdd< U > *	faster::indexedFdd< K, T >::flatMap (flatMapIFunctionP< K, T, U > funcP)
	creates a fdd<U>
template<typename L , typename U >
fdd< U > *	faster::indexedFdd< K, T >::flatMap (PflatMapIFunctionP< K, T, U > funcP)
	creates a fdd<U *>
std::pair< K, T >	faster::indexedFdd< K, T >::reduce (IreduceIFunctionP< K, T > funcP)
	summarizes a fdd<K,T> into a single value of type T

Typedefs
template<typename T , typename U >
using	faster::flatMapFunctionP = std::deque< U >(*)(T &input)
template<typename T , typename L , typename U >
using	faster::IflatMapFunctionP = std::deque< std::pair< L, U >>(*)(T &input)
template<typename T , typename U >
using	faster::PflatMapFunctionP = std::deque< std::pair< U, size_t >>(*)(T &input)
template<typename T , typename L , typename U >
using	faster::IPflatMapFunctionP = std::deque< std::tuple< L, U, size_t >>(*)(T &input)
template<typename T , typename U >
using	faster::flatMapPFunctionP = std::deque< U >(*)(T *&input, size_t size)
template<typename T , typename L , typename U >
using	faster::IflatMapPFunctionP = std::deque< std::pair< L, U >>(*)(T *&input, size_t size)
template<typename T , typename U >
using	faster::PflatMapPFunctionP = std::deque< std::pair< U, size_t >>(*)(T *&input, size_t size)
template<typename T , typename L , typename U >
using	faster::IPflatMapPFunctionP = std::deque< std::tuple< L, U, size_t >>(*)(T *&input, size_t size)
template<typename K , typename T , typename L , typename U >
using	faster::IflatMapIFunctionP = std::deque< std::pair< L, U >>(*)(K inKey, T &input)
template<typename K , typename T , typename U >
using	faster::flatMapIFunctionP = std::deque< U >(*)(K inKey, T &input)
template<typename K , typename T , typename L , typename U >
using	faster::IPflatMapIFunctionP = std::deque< std::tuple< L, U, size_t >>(*)(K inKey, T &input)
template<typename K , typename T , typename U >
using	faster::PflatMapIFunctionP = std::deque< std::pair< U, size_t >>(*)(K inKey, T &input)
template<typename K , typename T , typename L , typename U >
using	faster::IflatMapIPFunctionP = std::deque< std::pair< L, U >>(*)(T *&input, size_t size)
template<typename K , typename T , typename U >
using	faster::flatMapIPFunctionP = std::deque< U >(*)(T *&input, size_t size)
template<typename K , typename T , typename L , typename U >
using	faster::IPflatMapIPFunctionP = std::deque< std::tuple< L, U, size_t >>(*)(T *&input, size_t size)
template<typename K , typename T , typename U >
using	faster::PflatMapIPFunctionP = std::deque< std::pair< U, size_t >>(*)(T *&input, size_t size)