Lines Matching refs:nInsert
152 size_t nInsert; // insert position (nMaxAccess+1 := no insert) in SetValue() local
160 nInsert = nMaxAccess+1; in SetValue()
169 nInsert = ni; in SetValue()
172 nInsert = ni; in SetValue()
177 nInsert = nMaxAccess+1; in SetValue()
183 nInsert = 0; in SetValue()
201 else if (ni == nInsert) in SetValue()
204 nInsert = nMaxAccess+1; in SetValue()
207 else if (ni > 0 && ni == nInsert) in SetValue()
217 nInsert = nMaxAccess+1; in SetValue()
227 if (nInsert < static_cast<size_t>(nMaxAccess+1)) in SetValue()
229 if (nInsert <= nCount) in SetValue()
232 memmove( pData + nInsert + 1, pData + nInsert, in SetValue()
233 (nCount - nInsert) * sizeof(DataEntry)); in SetValue()
236 memmove( pData + nInsert + 2, pData + nInsert, in SetValue()
237 (nCount - nInsert) * sizeof(DataEntry)); in SetValue()
238 pData[nInsert+1] = pData[nInsert-1]; in SetValue()
242 if (nInsert) in SetValue()
243 pData[nInsert-1].nEnd = nStart - 1; in SetValue()
244 pData[nInsert].nEnd = nEnd; in SetValue()
245 pData[nInsert].aValue = aNewVal; in SetValue()