replace overloads

Synopses

Declared in <bdlc_queue.h>

Replace the element at the specified dstIndex in this queue with the specified item. The behavior is undefined unless 0 <= dstIndex < length(). Note that this function is logically equivalent to (but more efficient than): ` insert(dstIndex, item); remove(dstIndex + 1); `

void
replace(
    int dstIndex,
    T const& item);

» more...

Replace the specified numElements values beginning at the specified dstIndex in this queue with values from the specified srcQueue beginning at the specified srcIndex. The behavior is undefined unless 0 <= dstIndex, 0 <= numElements, dstIndex + numElements <= length(), 0 <= srcIndex, and srcIndex + numElements <= srcQueue.length(). Note that this function is logically equivalent to (but more efficient than): ` insert(dstIndex, srcQueue, srcIndex, numElements); remove(dstIndex + numElements, numElements); `

void
replace(
    int dstIndex,
    Queue const& srcQueue,
    int srcIndex,
    int numElements);

» more...

Created with MrDocs