! * \return Constant iterator to the first element of the container. */

Get the begin iterator

Declared in linked_streambuf.

Construct a new socket implementation.

Get the end iterator

begin() is equal to end()

end of buffer

replacement if STL lower bound algorithm for use of inplace_merge

! \brief Returns parameters. \return The parameters object. \par Throws Nothing. */

* @brief add a coordinate to the polygon at this active tail end, properly handle degenerate edges by removing redundant coordinate */

Return a pointer to the underlying streambuf.

size:

swap (note: linear complexity)

Get a random-access iterator to the first element.

begin() is equal to end()

@brief Removes all elements from the container. @par Throws Nothing. @par Complexity Constant O(1).

////////////////////////////////////////////////////////////////////////// flags

* @brief Returns a property map that maps from vertices in a * communicator's graph topology to their index values. * * Since the vertices are

Access.