- Generated by
1.9.8
|
BDE 4.14.0 Production release
|
This is the complete list of members for bdlc::Queue< T >, including all inherited members.
| append(const T &item) | bdlc::Queue< T > | inline |
| append(const Queue &srcQueue) | bdlc::Queue< T > | |
| append(const Queue &srcQueue, int srcIndex, int numElements) | bdlc::Queue< T > | |
| back() | bdlc::Queue< T > | inline |
| back() const | bdlc::Queue< T > | inline |
| bdexStreamIn(STREAM &stream, int version) | bdlc::Queue< T > | |
| bdexStreamOut(STREAM &stream, int version) const | bdlc::Queue< T > | |
| BSLMF_NESTED_TRAIT_DECLARATION(Queue, bdlb::HasPrintMethod) | bdlc::Queue< T > | |
| BSLMF_NESTED_TRAIT_DECLARATION(Queue, bslma::UsesBslmaAllocator) | bdlc::Queue< T > | |
| front() | bdlc::Queue< T > | inline |
| front() const | bdlc::Queue< T > | inline |
| insert(int dstIndex, const T &item) | bdlc::Queue< T > | |
| insert(int dstIndex, const Queue &srcQueue) | bdlc::Queue< T > | inline |
| insert(int dstIndex, const Queue &srcQueue, int srcIndex, int numElements) | bdlc::Queue< T > | |
| length() const | bdlc::Queue< T > | inline |
| maxSupportedBdexVersion(int versionSelector) | bdlc::Queue< T > | inlinestatic |
| maxSupportedBdexVersion() | bdlc::Queue< T > | inlinestatic |
| maxSupportedVersion() | bdlc::Queue< T > | inlinestatic |
| operator=(const Queue &rhs) | bdlc::Queue< T > | |
| operator[](int index) | bdlc::Queue< T > | inline |
| operator[](int index) const | bdlc::Queue< T > | inline |
| popBack() | bdlc::Queue< T > | inline |
| popFront() | bdlc::Queue< T > | inline |
| print(bsl::ostream &stream, int level, int spacesPerLevel) const | bdlc::Queue< T > | |
| pushBack(const T &item) | bdlc::Queue< T > | |
| pushFront(const T &item) | bdlc::Queue< T > | |
| Queue(bslma::Allocator *basicAllocator=0) | bdlc::Queue< T > | explicit |
| Queue(unsigned int initialLength, bslma::Allocator *basicAllocator=0) | bdlc::Queue< T > | explicit |
| Queue(int initialLength, const T &initialValue, bslma::Allocator *basicAllocator=0) | bdlc::Queue< T > | |
| Queue(const InitialCapacity &numElements, bslma::Allocator *basicAllocator=0) | bdlc::Queue< T > | explicit |
| Queue(const T *srcArray, int numElements, bslma::Allocator *basicAllocator=0) | bdlc::Queue< T > | |
| Queue(const Queue &original, bslma::Allocator *basicAllocator=0) | bdlc::Queue< T > | |
| remove(int index) | bdlc::Queue< T > | |
| remove(int index, int numElements) | bdlc::Queue< T > | |
| removeAll(bsl::vector< T > *buffer=0) | bdlc::Queue< T > | |
| replace(int dstIndex, const T &item) | bdlc::Queue< T > | |
| replace(int dstIndex, const Queue &srcQueue, int srcIndex, int numElements) | bdlc::Queue< T > | |
| reserveCapacity(int numElements) | bdlc::Queue< T > | |
| reserveCapacityRaw(int numElements) | bdlc::Queue< T > | |
| setLength(int newLength) | bdlc::Queue< T > | |
| setLength(int newLength, const T &initialValue) | bdlc::Queue< T > | |
| setLengthRaw(int newLength) | bdlc::Queue< T > | |
| streamOut(bsl::ostream &stream) const | bdlc::Queue< T > | inline |
| swap(int index1, int index2) | bdlc::Queue< T > | |
| ~Queue() | bdlc::Queue< T > |
1.9.8