А>class TCollect
А>{
А>public:
А>    TCollect(int aSizeIt);
А>    ~TCollect() { delete items; };
А>    int Count() const { return count; };
А>    UINT SizeBytes() const { return count*size_it; }
А>    UINT SizeElem()  const { return size_it; }
А>    char* At(int index) const { return items+(index*size_it); };
А>    BOOL Insert(int index, const void *item);
А>protected:
А>    char *items;
А>    int count;
А>    unsigned size_it;
А>};
А>template <class T> class TCollection : public TCollect
А>{
А>public:
А>    TCollection() : TCollect(sizeof(T)) {}
А>    BOOL Insert(const T &item, int i=-1) { return TCollect::Insert(i, &item); };
А>    T* At(int i) const { return (T*)TCollect::At(i); };
А>};
А>

K>BOOL TCollect::Insert(int i, const void *item)
K>{
K>    if( i == -1 ) i = Count();
K>    if( count == limit )
K>    {
K>        int newLimit = min(limit+delta, MaxCount());
K>        if( newLimit == count ) return error(IDS_SE_MANYITEMS, g_hInstanceNCall), FALSE;
K>        char *ni;
K>        if( ISNULL(ni=new char[newLimit*size_it]) ) return FALSE;
K>        if( count != 0 ) memcpy(ni, items, count*size_it);
K>        delete items; items = ni; limit = newLimit;
K>    }
K>    if( i < count )    memmove(items+(i+1)*size_it, items+i*size_it, (count-i)*size_it);
K>    count++;
K>    if( item ) memcpy(items+i*size_it, item, size_it);
K>    else memset(items+i*size_it, 0, size_it);
K>    return TRUE;
K>}

K>

K>>BOOL TCollect::Insert(int i, const void *item)
K>>{
K>>    if( i == -1 ) i = Count();
K>>    if( count == limit )
K>>    {
K>>        int newLimit = min(limit+delta, MaxCount());
K>>        if( newLimit == count ) return error(IDS_SE_MANYITEMS, g_hInstanceNCall), FALSE;
K>>        char *ni;
K>>        if( ISNULL(ni=new char[newLimit*size_it]) ) return FALSE;
K>>        if( count != 0 ) memcpy(ni, items, count*size_it);
K>>        delete items; items = ni; limit = newLimit;
K>>    }
K>>    if( i < count )    memmove(items+(i+1)*size_it, items+i*size_it, (count-i)*size_it);
K>>    count++;
K>>    if( item ) memcpy(items+i*size_it, item, size_it);
K>>    else memset(items+i*size_it, 0, size_it);
K>>    return TRUE;
K>>}

K>>