The std::vector and Std::stringbuilder of C + + string processing

Source: Internet
Author: User
Tags data structures


Std::stringbuilder is based on Std::vector implementations. So although this article discusses std::vector, all the conclusions are equally valid for Std::stringbuilder.

Implementation overview

In simple terms, std::vector is a dynamic array that manages a linear, dynamically growing memory.

How to speed up std::vector?

Using Vector::reserve

When you approximate the vector size, you should first call the reserve (size) for pre-allocation of memory (size is the number of vector elements estimated) before inserting data.

Avoid inserting/deleting data at vector start (begin)

That is, you should try to add/Remove data using Vector::insert (end (), ...) or vector::p ush_back/pop_back. Instead of using Vector::insert (Begin (), ...) operation. Vector does not provide push_front operations for one reason: inserting/deleting data from the beginning of a vector is inefficient.

If you need a lot of insert data at the beginning of the container, you can choose std::d eque (The advantages of vector random access, the advantages of a list efficient insertion) or std::list.

Std::vector's flaws

When can you not use std::vector?

When the container needs to accommodate a large amount of data, and the number of elements unpredictable, we can not use std::vector. All data structures based on linear memory, such as std::vector,std::string, encounter performance bottlenecks when they are massive.

Memory fragmentation

Data structures based on linear memory (such as std::vector,std::string) also have a typical problem, which is that memory fragmentation is easy to produce. After a large number of operations std::vector or std::string, memory fragmentation is more serious.

Std::vector and Allocator

We know that the prototype of Std::vector is:

template <class DataT, class AllocT = std::allocator<DataT> >
class vector;

Is it necessary to use hashset/hashmultiset as we do for Map/multimap, Set/multiset, List/slist, Hashmap/hashmultimap, Deque, alloct What about GC allocator?

The answer is: no need. GC allocator is useful for improving small memory allocations. However, the dynamic linear memory data structure is invalid. This kind of data structure in addition to std::vector, typically there are std::string (std::basic_string).

Recommended Readings

std::d eque (Http:// data structure between std::vector and std::list that can be randomly positioned, and massive data is still very robust (in fact its The performance of Push_back/push_front is almost constant: O (1), rather than std::vector, the insertion rate drops dramatically as the element increases.

Std::list ( linked list.

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.