<b>Effects</b>: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If

* Deallocate memory referred to by the pointer @c p. * * @param p The pointer whose memory should be deallocated. This * pointer shall hav

get iterator to end vertex data

Obtain the future to be returned from the initiating function.

Obtain an identifier for the type of the protocol.

<b>Effects</b>: Removes adjacent duplicate elements or adjacent elements that are equal from the list. <b>Throws</b>: If comparison throws. <b>Compl

@pre valid() @post ready() @throws timeout

Obtain an identifier for the protocol.

* Allocate enough memory for @p n elements of type @c T. * * @param n The number of elements for which memory should be * allocated. *

get iterator to begin vertex data

Obtain an identifier for the protocol family.

Obtain the value to be returned from the initiating function.

get iterator to begin vertex data

<b>Effects</b>: Returns an iterator that points to a position before the first element. Equivalent to "end()" <b>Throws</b>: Nothing. <b>Complexity<

get iterator to end vertex data

<b>Effects</b>: Erases the element pointed to by p. <b>Returns</b>: Returns an iterator pointing to the element immediately following q prior to the

<b>Effects</b>: Erases the first element of the list. No destructors are called. <b>Throws</b>: Nothing. <b>Complexity</b>: Constant. <b>Note</b>: