请问CStringArray有没有容量大小上限问题

[max_xy]

如题，也就是说CStringArray有没有最大的size

[zswzwy]

4G

[mz02005]

一下是其根类的代码
所以大小只与内存有关，而在调试版中可以监测出太大的，不切实际的分配。

void CObArray::SetSize(int nNewSize, int nGrowBy)
{
ASSERT_VALID(this);
ASSERT(nNewSize >= 0);

if (nGrowBy != -1)
m_nGrowBy = nGrowBy; // set new size

if (nNewSize == 0)
{
// shrink to nothing
delete[] (BYTE*)m_pData;
m_pData = NULL;
m_nSize = m_nMaxSize = 0;
}
else if (m_pData == NULL)
{
// create one with exact size
#ifdef SIZE_T_MAX
ASSERT(nNewSize <= SIZE_T_MAX/sizeof(CObject*)); // no overflow
#endif
m_pData = (CObject**) new BYTE[nNewSize * sizeof(CObject*)];

memset(m_pData, 0, nNewSize * sizeof(CObject*)); // zero fill

m_nSize = m_nMaxSize = nNewSize;
}
else if (nNewSize <= m_nMaxSize)
{
// it fits
if (nNewSize > m_nSize)
{
// initialize the new elements

memset(&m_pData[m_nSize], 0, (nNewSize-m_nSize) * sizeof(CObject*));

}

m_nSize = nNewSize;
}
else
{
// otherwise, grow array
int nGrowBy = m_nGrowBy;
if (nGrowBy == 0)
{
// heuristically determine growth when nGrowBy == 0
// (this avoids heap fragmentation in many situations)
nGrowBy = min(1024, max(4, m_nSize / 8));
}
int nNewMax;
if (nNewSize < m_nMaxSize + nGrowBy)
nNewMax = m_nMaxSize + nGrowBy; // granularity
else
nNewMax = nNewSize; // no slush

ASSERT(nNewMax >= m_nMaxSize); // no wrap around
#ifdef SIZE_T_MAX
ASSERT(nNewMax <= SIZE_T_MAX/sizeof(CObject*)); // no overflow
#endif
CObject** pNewData = (CObject**) new BYTE[nNewMax * sizeof(CObject*)];

// copy new data from old
memcpy(pNewData, m_pData, m_nSize * sizeof(CObject*));

// construct remaining elements
ASSERT(nNewSize > m_nSize);

memset(&pNewData[m_nSize], 0, (nNewSize-m_nSize) * sizeof(CObject*));


// get rid of old stuff (note: no destructors called)
delete[] (BYTE*)m_pData;
m_pData = pNewData;
m_nSize = nNewSize;
m_nMaxSize = nNewMax;
}
}

[mz02005]

不可能达到4G，顶多2G

[KcSoft]

肯定有，多少我没测过，因为CStringArray 类用的也是内存。

[mz02005]

用户用不了那么多，高地值要映射动态连接库等

[demetry]

如果你真的要用100M以上的话，我建议你还是另想办法，比如内存映射等。