diy::Master::ProxyWithLink Struct Reference

Inheritance diagram for diy::Master::ProxyWithLink:

Public Member Functions
	ProxyWithLink (const Proxy &proxy, void *block__, Link *link__)
Link *	link () const
void *	block () const
Public Member Functions inherited from diy::Master::Proxy
	Proxy (Master *master__, int gid__)
int	gid () const
template<class T >
void	enqueue (const BlockID &to, const T &x, void(*save)(BinaryBuffer &, const T &)=&::diy::save< T >) const
	Enqueue data whose size can be determined automatically, e.g., an STL vector. More...
template<class T >
void	enqueue (const BlockID &to, const T *x, size_t n, void(*save)(BinaryBuffer &, const T &)=&::diy::save< T >) const
	Enqueue data whose size is given explicitly by the user, e.g., an array. More...
template<class T >
void	dequeue (int from, T &x, void(*load)(BinaryBuffer &, T &)=&::diy::load< T >) const
	Dequeue data whose size can be determined automatically (e.g., STL vector) and that was previously enqueued so that diy knows its size when it is received. In this case, diy will allocate the receive buffer; the user does not need to do so. More...
template<class T >
void	dequeue (int from, T *x, size_t n, void(*load)(BinaryBuffer &, T &)=&::diy::load< T >) const
	Dequeue an array of data whose size is given explicitly by the user. In this case, the user needs to allocate the receive buffer prior to calling dequeue. More...
template<class T >
EnqueueIterator< T >	enqueuer (const T &x, void(*save)(BinaryBuffer &, const T &)=&::diy::save< T >) const
IncomingQueues *	incoming () const
MemoryBuffer &	incoming (int from) const
void	incoming (std::vector< int > &v) const
OutgoingQueues *	outgoing () const
MemoryBuffer &	outgoing (const BlockID &to) const
template<class T , class Op >
void	all_reduce (const T &in, Op op) const
	Post an all-reduce collective using an existing communication proxy. Available operators are: maximum<T>, minimum<T>, std::plus<T>, std::multiplies<T>, std::logical_and<T>, and std::logical_or<T>. More...
template<class T >
T	read () const
	Return the result of a proxy collective without popping it off the collectives list (same result would be returned multiple times). The list can be cleared with collectives()->clear().
template<class T >
T	get () const
	Return the result of a proxy collective; result is popped off the collectives list.
template<class T >
void	scratch (const T &in) const
CollectivesList *	collectives () const
	Return the list of proxy collectives (values and operations)
Master *	master () const

Detailed Description

Examples:

decomposition/regular-decomposer-long.cpp, decomposition/regular-decomposer-short.cpp, decomposition/test-direct-master.cpp, reduce/all-done.cpp, reduce/all-to-all.cpp, reduce/kd-tree.cpp, reduce/merge-reduce.cpp, reduce/sample-sort.cpp, reduce/sort.cpp, reduce/swap-reduce.cpp, simple/read-blocks.cpp, simple/simple.cpp, and simple/until-done.cpp.

---

The documentation for this struct was generated from the following file:

• include/diy/proxy.hpp