where {LinearProcessGroup<ProcessGroup>, MessagingProcessGroup<ProcessGroup>}

<b>Requires</b>: p must be a valid iterator of *this. <b>Effects</b>: Inserts a copy of the value after the p pointed by prev_p. <b>Returns</b>: An

* @returns @c true if this Cardinality is empty, the <tt>empty-sequence()</tt>, otherwise * @c false. */

Iterates over all direct child nodes of the node. This iterates over all fields and yields the values of they are nodes. If the value

Accessor functions.

Move-assign from another socket implementation.

Replace an element.

<b>Effects</b>: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x. <b>Throws</b>: If memor

copy ctor doesn't initialize anything neither as conversion can only be deduced on first use

default ctor constructs the 0 time span

Returns name of the family

Allocates memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

Compare an boost::uint32_t's value with "cmp". If they are the same swap the value with "with" "mem": pointer to the value "with": what to swap it wit

<b>Effects</b>: Returns an iterator to the first element contained in the list. <b>Throws</b>: Nothing. <b>Complexity</b>: Constant.

Cancel any asynchronous operations that are waiting on the resolver. * This function forces the completion of any pending asynchronous * operation

Return the maximum size for data in the buffer.

<b>Effects</b>: Returns a const_iterator to the end of the container. <b>Throws</b>: Nothing. <b>Complexity</b>: Constant.

<b>Effects</b>: Returns a const_iterator to the end of the list. <b>Throws</b>: Nothing. <b>Complexity</b>: Constant.