BloombergLP::bdlc::Queue::append

append overloads

Synopses

Declared in <bdlc_queue.h>

Append to the end of this queue the sequence of values in the specified srcQueue. Note that this function is logically equivalent to: ` insert(length(), srcQueue); `

void
append(Queue const& srcQueue);
» more...

Append to the end of this queue the value of the specified item. Note that this function is a synonym for pushBack and is logically equivalent to (but generally more efficient than): ` insert(length(), item); `

void
append(T const& item);
» more...

Append to the end of this queue the specified numElements value in the specified srcQueue starting at the specified index position srcIndex. Note that this function is logically equivalent to: ` insert(length(), srcQueue, srcIndex, numElements); ` The behavior is undefined unless 0 <= srcIndex, 0 <= numElements, and srcIndex + numElements <= srcQueue.length().

void
append(
    Queue const& srcQueue,
    int srcIndex,
    int numElements);
» more...