Lines Matching full:where
113 void* where = _grow(index, vector.size());
114 if (where) {
115 _do_copy(where, vector.arrayImpl(), vector.size());
117 return where ? index : (ssize_t)NO_MEMORY;
134 void* where = _grow(index, numItems);
135 if (where) {
137 _do_splat(where, item, numItems);
139 _do_construct(where, numItems);
142 return where ? index : (ssize_t)NO_MEMORY;
335 void* VectorImpl::_grow(size_t where, size_t amount)
337 // LOGV("_grow(this=%p, where=%d, amount=%d) count=%d, capacity=%d",
338 // this, (int)where, (int)amount, (int)mCount, (int)capacity());
340 if (where > mCount)
341 where = mCount;
348 (mCount==where) &&
359 if (where>0) {
360 _do_copy(array, mStorage, where);
362 if (mCount>where) {
363 const void* from = reinterpret_cast<const uint8_t *>(mStorage) + where*mItemSize;
364 void* dest = reinterpret_cast<uint8_t *>(array) + (where+amount)*mItemSize;
365 _do_copy(dest, from, mCount-where);
372 ssize_t s = mCount-where;
375 void* to = reinterpret_cast<uint8_t *>(array) + (where+amount)*mItemSize;
376 const void* from = reinterpret_cast<const uint8_t *>(array) + where*mItemSize;
381 void* free_space = const_cast<void*>(itemLocation(where));
385 void VectorImpl::_shrink(size_t where, size_t amount)
390 // LOGV("_shrink(this=%p, where=%d, amount=%d) count=%d, capacity=%d",
391 // this, (int)where, (int)amount, (int)mCount, (int)capacity());
393 if (where >= mCount)
394 where = mCount - amount;
400 if ((where == mCount-amount) &&
411 if (where>0) {
412 _do_copy(array, mStorage, where);
414 if (mCount > where+amount) {
415 const void* from = reinterpret_cast<const uint8_t *>(mStorage) + (where+amount)*mItemSize;
416 void* dest = reinterpret_cast<uint8_t *>(array) + where*mItemSize;
417 _do_copy(dest, from, mCount-(where+amount));
425 void* to = reinterpret_cast<uint8_t *>(array) + where*mItemSize;
427 ssize_t s = mCount-(where+amount);
429 const void* from = reinterpret_cast<uint8_t *>(array) + (where+amount)*mItemSize;
579 where the vectors are sorted together
