147 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems)  in insertAt()  argument
153         if (item) {  in insertAt()
154             _do_splat(where, item, numItems);  in insertAt()
183             void* item = reinterpret_cast<char*>(array) + mItemSize*(i);  in sort()  local
185             if (cmp(curr, item, state) > 0) {  in sort()
193                     item = reinterpret_cast<char*>(array) + mItemSize*(i);  in sort()
199                 _do_copy(temp, item, 1);  in sort()
239 void VectorImpl::push(const void* item)  in push()  argument
241     insertAt(item, size());  in push()
249 ssize_t VectorImpl::add(const void* item)  in add()  argument
251     return insertAt(item, size());  in add()
268     void* item = editItemLocation(index);  in replaceAt()  local
269     if (item != prototype) {  in replaceAt()
270         if (item == 0)  in replaceAt()
272         _do_destroy(item, 1);  in replaceAt()
274             _do_construct(item, 1);  in replaceAt()
276             _do_copy(item, prototype, 1);  in replaceAt()
547 void VectorImpl::_do_splat(void* dest, const void* item, size_t num) const {  in _do_splat()  argument
548     do_splat(dest, item, num);  in _do_splat()
580 ssize_t SortedVectorImpl::indexOf(const void* item) const  in indexOf()
582     return _indexOrderOf(item);  in indexOf()
585 size_t SortedVectorImpl::orderOf(const void* item) const  in orderOf()
588     _indexOrderOf(item, &o);  in orderOf()
592 ssize_t SortedVectorImpl::_indexOrderOf(const void* item, size_t* order) const  in _indexOrderOf()  argument
608         const int c = do_compare(curr, item);  in _indexOrderOf()
622 ssize_t SortedVectorImpl::add(const void* item)  in add()  argument
625     ssize_t index = _indexOrderOf(item, &order);  in add()
627         index = VectorImpl::insertAt(item, order, 1);  in add()
629         index = VectorImpl::replaceAt(item, index);  in add()
669 ssize_t SortedVectorImpl::remove(const void* item)  in remove()  argument
671     ssize_t i = indexOf(item);  in remove()