| Add(const TYP &t) | CSharedQueueT< TYP, SIZ > | virtual |
| AddElements(size_t size, const TYP *P=NULL) | CSharedQueueT< TYP, SIZ > | virtual |
| AddEx(const TYP &t) | ICollectionT< TYP > | |
| Append(const IConstCollectionT< TYP > &c) | ICollectionT< TYP > | virtual |
| At(INDEX index) const | ICollectionMidT< TYP > | virtual |
| begin(void) const | ICollectionT< TYP > | |
| begin(void) | ICollectionT< TYP > | |
| Close(void) | CSharedQueueT< TYP, SIZ > | |
| Compare(const IConstCollectionT< TYP > &c) const | IConstCollectionT< TYP > | virtual |
| Copy(const IConstCollectionT< TYP > &c) | ICollectionT< TYP > | virtual |
| CopyElements(size_t size, const TYP *P=NULL) | ICollectionT< TYP > | virtual |
| CSharedQueueT(bool boCanClose=true) | CSharedQueueT< TYP, SIZ > | |
| Cull(const IChecker &checker, bool boIsReverse=false) | ICollectionT< TYP > | virtual |
| Deserialize(const IDeserializer &ds) | ICollectionT< TYP > | virtual |
| end(void) const | ICollectionT< TYP > | |
| end(void) | ICollectionT< TYP > | |
| EraseElements(size_t size) | IQueueT< TYP > | virtual |
| Find(const IChecker &checker, INDEX startIndex=0, bool boIsReverse=false) const | IConstCollectionT< TYP > | |
| Find(const IConstCollectionT< TYP > &t, const IComparatorT< TYP > &comparator, INDEX startIndex=0) const | IConstCollectionT< TYP > | |
| Find(const IConstCollectionT< TYP > &t, INDEX startIndex=0) const | IConstCollectionT< TYP > | |
| Find(const TYP &t, const IComparatorT< TYP > &comparator, INDEX startIndex=0) const | IConstCollectionT< TYP > | |
| Find(const TYP &t, INDEX startIndex=0) const | IConstCollectionT< TYP > | |
| FindMax(const IComparatorT< TYP > &comparator, const TYP &def) const | IConstCollectionT< TYP > | |
| FindMax(const TYP &def) const | IConstCollectionT< TYP > | |
| FindMin(const IComparatorT< TYP > &comparator, const TYP &def) const | IConstCollectionT< TYP > | |
| FindMin(const TYP &def) const | IConstCollectionT< TYP > | |
| Get(INDEX index) const | ICollectionMidT< TYP > | virtual |
| GetElements(size_t size, TYP *_P, INDEX offset=0) const | IConstCollectionT< TYP > | virtual |
| GetEx(INDEX index) const | IConstCollectionT< TYP > | |
| GetFreeSize(void) const | CSharedQueueT< TYP, SIZ > | |
| GetSize(void) const | CSharedQueueT< TYP, SIZ > | virtual |
| ICollectionMidT(void) | ICollectionMidT< TYP > | |
| ICollectionT(void) | ICollectionT< TYP > | |
| IConstCollectionT(void) | IConstCollectionT< TYP > | |
| Insert(INDEX index, const TYP &t) | ICollectionT< TYP > | virtual |
| InsertEx(INDEX index, const TYP &t) | ICollectionT< TYP > | virtual |
| IsEmpty(void) const | IConstCollectionT< TYP > | |
| IsEqual(const IConstCollectionT< TYP > &c) const | IConstCollectionT< TYP > | virtual |
| IsInRange(INDEX index) const | IConstCollectionT< TYP > | |
| Lock(DWORD dwTime=INFINITE) const | CSharedQueueT< TYP, SIZ > | virtual |
| m_GetConstPointer(INDEX index) const | CSharedQueueT< TYP, SIZ > | protectedvirtual |
| m_GetPointer(INDEX index) | CSharedQueueT< TYP, SIZ > | protectedvirtual |
| Open(LPCTSTR lpszName) | CSharedQueueT< TYP, SIZ > | |
| operator size_t(void) const | IConstCollectionT< TYP > | |
| operator!=(const TNB::IConstCollectionT< TYP > &t) const | IComparableT< TNB::IConstCollectionT< TYP > > | |
| operator-(const TNB::IConstCollectionT< TYP > &t) const | IComparableT< TNB::IConstCollectionT< TYP > > | |
| operator<(const TNB::IConstCollectionT< TYP > &t) const | IComparableT< TNB::IConstCollectionT< TYP > > | |
| operator<=(const TNB::IConstCollectionT< TYP > &t) const | IComparableT< TNB::IConstCollectionT< TYP > > | |
| TNB::operator=(const ICollectionT &other) | ICollectionT< TYP > | |
| operator==(const TNB::IConstCollectionT< TYP > &t) const | IComparableT< TNB::IConstCollectionT< TYP > > | |
| operator>(const TNB::IConstCollectionT< TYP > &t) const | IComparableT< TNB::IConstCollectionT< TYP > > | |
| operator>=(const TNB::IConstCollectionT< TYP > &t) const | IComparableT< TNB::IConstCollectionT< TYP > > | |
| operator[](INDEX index) const | ICollectionMidT< TYP > | |
| operator[](INDEX index) | ICollectionMidT< TYP > | |
| push_back(const TYP &t) | ICollectionT< TYP > | |
| Ref(INDEX index) | ICollectionMidT< TYP > | virtual |
| Remove(INDEX index)=0 | ICollectionT< TYP > | pure virtual |
| RemoveAll(void) | CSharedQueueT< TYP, SIZ > | virtual |
| RemoveElements(INDEX index, size_t size=0) | ICollectionT< TYP > | virtual |
| RemoveEx(INDEX index) | ICollectionT< TYP > | |
| Serialize(ISerializer &_sr) const | IConstCollectionT< TYP > | virtual |
| Set(INDEX index, const TYP &t) | ICollectionMidT< TYP > | virtual |
| SetElements(size_t size, const TYP *P=NULL) | ICollectionT< TYP > | virtual |
| SetEx(INDEX index, const TYP &t) | ICollectionT< TYP > | |
| SetSize(size_t size) | ICollectionT< TYP > | virtual |
| Shuffle(int iDepth=1) | ICollectionT< TYP > | |
| Sort(const IComparatorT< TYP > &comparator, bool boIsReverse=false, bool boIsBubble=false) | ICollectionT< TYP > | |
| Sort(bool boIsReverse=false, bool boIsBubble=false) | ICollectionT< TYP > | |
| Swap(INDEX index1, INDEX index2) | ICollectionT< TYP > | virtual |
| Take(void) | IQueueT< TYP > | virtual |
| TakeElements(size_t size, TYP *P=NULL) | CSharedQueueT< TYP, SIZ > | virtual |
| TakeoutToVector(size_t size) | IQueueT< TYP > | |
| TrimBottom(const TYP &t, const IComparatorT< TYP > &comparator) | ICollectionT< TYP > | |
| TrimBottom(const TYP &t) | ICollectionT< TYP > | |
| Unlock(void) const | CSharedQueueT< TYP, SIZ > | virtual |
| ~CSharedQueueT(void) | CSharedQueueT< TYP, SIZ > | virtual |
| ~ICollectionT(void) | ICollectionT< TYP > | virtual |
| ~IComparableT(void) | IComparableT< TNB::IConstCollectionT< TYP > > | virtual |
| ~IQueueT(void) | IQueueT< TYP > | virtual |
| ~ISerializable(void) | ISerializable | virtual |
| ~ISynchronized(void) | ISynchronized | virtual |
