Lines Matching defs:m_nCount
118 Averager(const wxChar *sz) { m_sz = sz; m_nTotal = m_nCount = 0; }
120 { wxPrintf("wxString: average %s = %f\n", m_sz, ((float)m_nTotal)/m_nCount); }
122 void Add(size_t n) { m_nTotal += n; m_nCount++; }
125 size_t m_nCount, m_nTotal;
2192 m_nCount = 0;
2220 if ( src.m_nCount > ARRAY_DEFAULT_INITIAL_SIZE )
2221 Alloc(src.m_nCount);
2223 for ( size_t n = 0; n < src.m_nCount; n++ )
2231 if ( (m_nSize - m_nCount) < nIncrement ) {
2259 memcpy(pNew, m_pItems, m_nCount*sizeof(wxChar *));
2271 for ( size_t n = 0; n < m_nCount; n++ ) {
2281 m_nCount = 0;
2290 m_nCount = 0;
2317 memcpy(pNew, m_pItems, m_nCount*sizeof(wxChar *));
2329 if( m_nCount < m_nSize ) {
2331 wxChar **pNew = new wxChar *[m_nCount];
2334 memcpy(pNew, m_pItems, m_nCount*sizeof(wxChar *));
2337 m_nSize = m_nCount;
2348 if( m_nCount > 0 )
2350 array = new wxString[m_nCount];
2351 for( size_t i = 0; i < m_nCount; i++ )
2375 hi = m_nCount;
2394 if ( m_nCount > 0 ) {
2395 size_t ui = m_nCount;
2404 for( size_t ui = 0; ui < m_nCount; ui++ ) {
2421 hi = m_nCount;
2454 m_pItems[m_nCount + i] = (wxChar *)str.c_str(); // const_cast
2456 size_t ret = m_nCount;
2457 m_nCount += nInsert;
2467 wxCHECK_RET( nIndex <= m_nCount, wxT("bad index in wxArrayString::Insert") );
2468 wxCHECK_RET( m_nCount <= m_nCount + nInsert,
2474 (m_nCount - nIndex)*sizeof(wxChar *));
2481 m_nCount += nInsert;
2514 while ( m_nCount < count )
2515 m_pItems[m_nCount++] = (wxChar *)s.c_str();
2521 wxCHECK_RET( nIndex < m_nCount, wxT("bad index in wxArrayString::Remove") );
2522 wxCHECK_RET( nIndex + nRemove <= m_nCount,
2530 (m_nCount - nIndex - nRemove)*sizeof(wxChar *));
2531 m_nCount -= nRemove;
2611 qsort(m_pItems, m_nCount, sizeof(wxChar *), (wxStringCompareFn)compareFunction);
2625 qsort(m_pItems, m_nCount, sizeof(wxChar *), wxStringCompareFunction);
2630 if ( m_nCount != a.m_nCount )
2633 for ( size_t n = 0; n < m_nCount; n++ )