[#BloombergLP-bdlc-Queue-append-0b]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlc.adoc[bdlc]::xref:BloombergLP/bdlc/Queue.adoc[Queue]::append
:relfileprefix: ../../../
:mrdocs:

`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); `


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
xref:BloombergLP/bdlc/Queue/append-0d.adoc[append](xref:BloombergLP/bdlc/Queue.adoc[Queue] const& srcQueue);
----

[.small]#xref:BloombergLP/bdlc/Queue/append-0d.adoc[_» 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); `


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
xref:BloombergLP/bdlc/Queue/append-0f.adoc[append](T const& item);
----

[.small]#xref:BloombergLP/bdlc/Queue/append-0f.adoc[_» 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()`.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
xref:BloombergLP/bdlc/Queue/append-06.adoc[append](
    xref:BloombergLP/bdlc/Queue.adoc[Queue] const& srcQueue,
    int srcIndex,
    int numElements);
----

[.small]#xref:BloombergLP/bdlc/Queue/append-06.adoc[_» more..._]#


[.small]#Created with https://www.mrdocs.com[MrDocs]#