Lines Matching refs:vector
109 ssize_t VectorImpl::insertVectorAt(const VectorImpl& vector, size_t index)
111 return insertArrayAt(vector.arrayImpl(), index, vector.size());
114 ssize_t VectorImpl::appendVector(const VectorImpl& vector)
116 return insertVectorAt(vector, size());
359 // LOGV("grow vector %p, new_capacity=%d", this, (int)new_capacity);
412 // LOGV("shrink vector %p, new_capacity=%d", this, (int)new_capacity);
567 ssize_t SortedVectorImpl::merge(const VectorImpl& vector)
570 if (!vector.isEmpty()) {
571 const void* buffer = vector.arrayImpl();
573 size_t s = vector.size();
584 ssize_t SortedVectorImpl::merge(const SortedVectorImpl& vector)
586 // we've merging a sorted vector... nice!
588 if (!vector.isEmpty()) {
590 if (do_compare(vector.itemLocation(vector.size()-1), arrayImpl()) <= 0) {
591 err = VectorImpl::insertVectorAt(static_cast<const VectorImpl&>(vector), 0);
592 } else if (do_compare(vector.arrayImpl(), itemLocation(size()-1)) >= 0) {
593 err = VectorImpl::appendVector(static_cast<const VectorImpl&>(vector));
596 err = merge(static_cast<const VectorImpl&>(vector));