Lines Matching defs:where
116 void* where = _grow(index, vector.size());
117 if (where) {
118 _do_copy(where, vector.arrayImpl(), vector.size());
120 return where ? index : (ssize_t)NO_MEMORY;
137 void* where = _grow(index, numItems);
138 if (where) {
140 _do_splat(where, item, numItems);
142 _do_construct(where, numItems);
145 return where ? index : (ssize_t)NO_MEMORY;
275 void* VectorImpl::_grow(size_t where, size_t amount)
277 // ALOGV("_grow(this=%p, where=%d, amount=%d) count=%d, capacity=%d",
278 // this, (int)where, (int)amount, (int)mCount, (int)capacity());
280 if (where > mCount)
281 where = mCount;
288 (mCount==where) &&
299 if (where>0) {
300 _do_copy(array, mStorage, where);
302 if (mCount>where) {
303 const void* from = reinterpret_cast<const uint8_t *>(mStorage) + where*mItemSize;
304 void* dest = reinterpret_cast<uint8_t *>(array) + (where+amount)*mItemSize;
305 _do_copy(dest, from, mCount-where);
312 ssize_t s = mCount-where;
315 void* to = reinterpret_cast<uint8_t *>(array) + (where+amount)*mItemSize;
316 const void* from = reinterpret_cast<const uint8_t *>(array) + where*mItemSize;
321 void* free_space = const_cast<void*>(itemLocation(where));
325 void VectorImpl::_shrink(size_t where, size_t amount)
330 // ALOGV("_shrink(this=%p, where=%d, amount=%d) count=%d, capacity=%d",
331 // this, (int)where, (int)amount, (int)mCount, (int)capacity());
333 if (where >= mCount)
334 where = mCount - amount;
340 if ((where == mCount-amount) &&
351 if (where>0) {
352 _do_copy(array, mStorage, where);
354 if (mCount > where+amount) {
355 const void* from = reinterpret_cast<const uint8_t *>(mStorage) + (where+amount)*mItemSize;
356 void* dest = reinterpret_cast<uint8_t *>(array) + where*mItemSize;
357 _do_copy(dest, from, mCount-(where+amount));
365 void* to = reinterpret_cast<uint8_t *>(array) + where*mItemSize;
367 ssize_t s = mCount-(where+amount);
369 const void* from = reinterpret_cast<uint8_t *>(array) + (where+amount)*mItemSize;
519 // first take care of the case where the vectors are sorted together