{"id":5199,"date":"2025-06-11T12:36:31","date_gmt":"2025-06-11T04:36:31","guid":{"rendered":"https:\/\/www.diggoodbox.com\/blog\/?p=5199"},"modified":"2025-06-11T12:36:31","modified_gmt":"2025-06-11T04:36:31","slug":"c-stl%e6%a6%82%e8%bf%b0","status":"publish","type":"post","link":"https:\/\/www.diggoodbox.com\/blog\/?p=5199","title":{"rendered":"C++ STL\u6982\u8ff0"},"content":{"rendered":"\n

\u4e00\u3001STL\u603b\u4f53\u6982\u8ff0<\/strong><\/h3>\n\n\n\n
\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
STL\uff08\u6807\u51c6\u6a21\u677f\u5e93\uff09\u662fC++\u6807\u51c6\u5e93\u7684\u91cd\u8981\u7ec4\u6210\u90e8\u5206\uff0c\u63d0\u4f9b\u901a\u7528\u3001\u9ad8\u6548\u7684\u6570\u636e\u7ed3\u6784\u548c\u7b97\u6cd5\u5b9e\u73b0\uff0c\u652f\u6301\u6cdb\u578b\u7f16\u7a0b\u3002<\/td>STL (Standard Template Library) is a key part of the C++ standard library, providing generic, efficient data structures and algorithms supporting generic programming.<\/td><\/tr>
\u8bbe\u8ba1\u76ee\u6807\uff1a<\/td>Design goals:<\/td><\/tr>
– \u63d0\u9ad8\u5f00\u53d1\u6548\u7387\uff0c\u907f\u514d\u91cd\u590d\u9020\u8f6e\u5b50<\/td>– Improve development efficiency and avoid reinventing the wheel<\/td><\/tr>
– \u5b9e\u73b0\u4ee3\u7801\u590d\u7528\uff0c\u652f\u6301\u7c7b\u578b\u65e0\u5173\u7f16\u7a0b<\/td>– Enable code reuse and type-independent programming<\/td><\/tr>
– \u4fdd\u8bc1\u826f\u597d\u7684\u6027\u80fd\u548c\u8de8\u5e73\u53f0\u4e00\u81f4\u6027<\/td>– Ensure good performance and cross-platform consistency<\/td><\/tr>
STL\u5305\u542b\u4e94\u5927\u6a21\u5757\uff1a<\/td>STL consists of five main components:<\/td><\/tr>
1. \u5bb9\u5668\uff08Containers\uff09<\/td>1. Containers<\/td><\/tr>
2. \u8fed\u4ee3\u5668\uff08Iterators\uff09<\/td>2. Iterators<\/td><\/tr>
3. \u7b97\u6cd5\uff08Algorithms\uff09<\/td>3. Algorithms<\/td><\/tr>
4. \u51fd\u6570\u5bf9\u8c61\uff08Functors\uff09<\/td>4. Functors<\/td><\/tr>
5. \u9002\u914d\u5668\uff08Adapters\uff09<\/td>5. Adapters<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
\n\n\n\n

\u4e8c\u3001\u5bb9\u5668\uff08Containers\uff09<\/strong><\/h3>\n\n\n\n
\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
\u5bb9\u5668\u7528\u4e8e\u5b58\u50a8\u548c\u7ba1\u7406\u5bf9\u8c61\u3002STL\u5bb9\u5668\u5206\u4e3a\u4e24\u7c7b\uff1a<\/td>Containers store and manage objects. STL containers are divided into two categories:<\/td><\/tr>
1. \u5e8f\u5217\u5f0f\u5bb9\u5668\uff08Sequence Containers\uff09<\/td>1. Sequence Containers<\/td><\/tr>
2. \u5173\u8054\u5f0f\u5bb9\u5668\uff08Associative Containers\uff09<\/td>2. Associative Containers<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
\n\n\n\n

1. \u5e8f\u5217\u5f0f\u5bb9\u5668\uff08Sequence Containers\uff09<\/strong><\/h4>\n\n\n\n
\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
vector<\/strong> \u2014 \u52a8\u6001\u6570\u7ec4\uff0c\u652f\u6301\u5feb\u901f\u968f\u673a\u8bbf\u95ee\uff0c\u5c3e\u90e8\u63d2\u5165\u6548\u7387\u9ad8\u3002<\/td>vector<\/strong> \u2014 Dynamic array supporting fast random access and efficient insertion at the end.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

std::vector<int> v = {1, 2, 3};<\/p>\n\n\n\n

v.push_back(4);<\/p>\n\n\n\n

for (auto n : v)<\/p>\n\n\n\n

    std::cout << n << ” “;  \/\/ \u8f93\u51fa\uff1a1 2 3 4<\/p>\n\n\n\n

\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
list<\/strong> \u2014 \u53cc\u5411\u94fe\u8868\uff0c\u652f\u6301\u9ad8\u6548\u63d2\u5165\u548c\u5220\u9664\uff0c\u968f\u673a\u8bbf\u95ee\u6548\u7387\u4f4e\u3002<\/td>list<\/strong> \u2014 Doubly linked list, efficient insertion and deletion, but slow random access.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

std::list<int> l = {1, 2, 3};<\/p>\n\n\n\n

l.push_front(0);<\/p>\n\n\n\n

for (auto n : l)<\/p>\n\n\n\n

    std::cout << n << ” “;  \/\/ \u8f93\u51fa\uff1a0 1 2 3<\/p>\n\n\n\n

\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
deque<\/strong> \u2014 \u53cc\u7aef\u961f\u5217\uff0c\u652f\u6301\u4e24\u7aef\u9ad8\u6548\u63d2\u5165\u548c\u5220\u9664\uff0c\u968f\u673a\u8bbf\u95ee\u6548\u7387\u63a5\u8fd1vector\u3002<\/td>deque<\/strong> \u2014 Double-ended queue, supports efficient insertion and deletion at both ends, near vector random access speed.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

std::deque<int> d = {1, 2, 3};<\/p>\n\n\n\n

d.push_back(4);<\/p>\n\n\n\n

d.push_front(0);<\/p>\n\n\n\n

for (auto n : d)<\/p>\n\n\n\n

    std::cout << n << ” “;  \/\/ \u8f93\u51fa\uff1a0 1 2 3 4<\/p>\n\n\n\n

\n\n\n\n

2. \u5173\u8054\u5f0f\u5bb9\u5668\uff08Associative Containers\uff09<\/strong><\/h4>\n\n\n\n
\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
set<\/strong> \u2014 \u6709\u5e8f\u96c6\u5408\uff0c\u5143\u7d20\u552f\u4e00\uff0c\u57fa\u4e8e\u7ea2\u9ed1\u6811\u5b9e\u73b0\u3002<\/td>set<\/strong> \u2014 Ordered collection of unique elements, implemented as a red-black tree.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

std::set<int> s = {3, 1, 4};<\/p>\n\n\n\n

s.insert(2);<\/p>\n\n\n\n

for (auto n : s)<\/p>\n\n\n\n

    std::cout << n << ” “;  \/\/ \u8f93\u51fa\uff1a1 2 3 4<\/p>\n\n\n\n

\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
map<\/strong> \u2014 \u6709\u5e8f\u952e\u503c\u5bf9\u96c6\u5408\uff0c\u952e\u552f\u4e00\u3002<\/td>map<\/strong> \u2014 Ordered collection of key-value pairs with unique keys.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

std::map<std::string, int> ages;<\/p>\n\n\n\n

ages[“Alice”] = 30;<\/p>\n\n\n\n

ages[“Bob”] = 25;<\/p>\n\n\n\n

std::cout << ages[“Alice”] << std::endl;  \/\/ \u8f93\u51fa\uff1a30<\/p>\n\n\n\n

\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
unordered_set \/ unordered_map<\/strong> \u2014 \u65e0\u5e8f\u7248\u672c\uff0c\u57fa\u4e8e\u54c8\u5e0c\u8868\u5b9e\u73b0\uff0c\u5e73\u5747\u8bbf\u95ee\u6548\u7387\u66f4\u9ad8\u3002<\/td>unordered_set \/ unordered_map<\/strong> \u2014 Unordered versions based on hash tables, providing faster average access.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
\n\n\n\n

\u4e09\u3001\u8fed\u4ee3\u5668\uff08Iterators\uff09<\/strong><\/h3>\n\n\n\n
\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
\u8fed\u4ee3\u5668\u7c7b\u4f3c\u6307\u9488\uff0c\u662f\u904d\u5386\u5bb9\u5668\u5143\u7d20\u7684\u901a\u7528\u63a5\u53e3\u3002<\/td>Iterators act like pointers and provide a generic way to traverse container elements.<\/td><\/tr>
\u8fed\u4ee3\u5668\u7c7b\u522b\u5305\u62ec\u8f93\u5165\u8fed\u4ee3\u5668\u3001\u8f93\u51fa\u8fed\u4ee3\u5668\u3001\u524d\u5411\u8fed\u4ee3\u5668\u3001\u53cc\u5411\u8fed\u4ee3\u5668\u3001\u968f\u673a\u8bbf\u95ee\u8fed\u4ee3\u5668\u3002<\/td>Categories include input, output, forward, bidirectional, and random-access iterators.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

std::vector<int> v = {10, 20, 30};<\/p>\n\n\n\n

for (auto it = v.begin(); it != v.end(); ++it) {<\/p>\n\n\n\n

    std::cout << *it << ” “;  \/\/ \u8f93\u51fa\uff1a10 20 30<\/p>\n\n\n\n

}<\/p>\n\n\n\n

\n\n\n\n

\u56db\u3001\u7b97\u6cd5\uff08Algorithms\uff09<\/strong><\/h3>\n\n\n\n
\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
STL\u7b97\u6cd5\u5e93\u63d0\u4f9b\u4e30\u5bcc\u7684\u901a\u7528\u7b97\u6cd5\uff0c\u901a\u5e38\u901a\u8fc7\u8fed\u4ee3\u5668\u64cd\u4f5c\u5bb9\u5668\u3002<\/td>STL provides a rich set of generic algorithms, usually operating via iterators.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
\u6392\u5e8f<\/strong><\/td>Sorting<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

std::vector<int> v = {3, 1, 4};<\/p>\n\n\n\n

std::sort(v.begin(), v.end());  \/\/ \u6392\u5e8f<\/p>\n\n\n\n

\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
\u67e5\u627e<\/strong><\/td>Searching<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

if (std::binary_search(v.begin(), v.end(), 4)) {<\/p>\n\n\n\n

    std::cout << “Found 4\\n”;<\/p>\n\n\n\n

}<\/p>\n\n\n\n

\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
\u590d\u5236<\/strong><\/td>Copying<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

std::vector<int> v2(3);<\/p>\n\n\n\n

std::copy(v.begin(), v.end(), v2.begin());<\/p>\n\n\n\n

\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
\u53d8\u6362<\/strong><\/td>Transforming<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

std::transform(v.begin(), v.end(), v.begin(), [](int n) { return n * 2; });<\/p>\n\n\n\n

\n\n\n\n

\u4e94\u3001\u51fd\u6570\u5bf9\u8c61\uff08Functors\uff09<\/strong><\/h3>\n\n\n\n
\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
\u51fd\u6570\u5bf9\u8c61\u662f\u5b9a\u4e49\u4e86 operator() \u7684\u5bf9\u8c61\uff0c\u53ef\u4ee5\u50cf\u51fd\u6570\u4e00\u6837\u8c03\u7528\u3002\u5e38\u7528\u4e8e\u81ea\u5b9a\u4e49\u7b97\u6cd5\u884c\u4e3a\u3002<\/td>Functors are objects that define operator(), allowing them to be called like functions. Often used to customize algorithm behavior.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

struct Descending {<\/p>\n\n\n\n

    bool operator()(int a, int b) const {<\/p>\n\n\n\n

        return a > b;<\/p>\n\n\n\n

    }<\/p>\n\n\n\n

};<\/p>\n\n\n\n

std::sort(v.begin(), v.end(), Descending());<\/p>\n\n\n\n

\n\n\n\n

\u516d\u3001\u9002\u914d\u5668\uff08Adapters\uff09<\/strong><\/h3>\n\n\n\n
\u4e2d\u6587<\/strong><\/td>English<\/strong><\/td><\/tr>
\u9002\u914d\u5668\u5c01\u88c5\u73b0\u6709\u5bb9\u5668\u6216\u8fed\u4ee3\u5668\uff0c\u63d0\u4f9b\u4e0d\u540c\u63a5\u53e3\u3002<\/td>Adapters wrap existing containers or iterators to provide different interfaces.<\/td><\/tr>
\u5bb9\u5668\u9002\u914d\u5668\u5305\u62ec\uff1a<\/td>Container adapters include:<\/td><\/tr>
– stack \u2014 \u540e\u8fdb\u5148\u51fa\uff08LIFO\uff09<\/td>– stack \u2014 Last-In-First-Out (LIFO)<\/td><\/tr>
– queue \u2014 \u5148\u8fdb\u5148\u51fa\uff08FIFO\uff09<\/td>– queue \u2014 First-In-First-Out (FIFO)<\/td><\/tr>
– priority_queue \u2014 \u4f18\u5148\u961f\u5217<\/td>– priority_queue \u2014 Priority queue<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

std::stack<int> s;<\/p>\n\n\n\n

s.push(10);<\/p>\n\n\n\n

s.push(20);<\/p>\n\n\n\n

std::cout << s.top() << std::endl;  \/\/ \u8f93\u51fa\uff1a20<\/p>\n\n\n\n

s.pop();<\/p>\n\n\n\n

std::cout << s.top() << std::endl;  \/\/ \u8f93\u51fa\uff1a10<\/p>\n\n\n\n

\n","protected":false},"excerpt":{"rendered":"

\u672c\u6587\u5bf9C++ STL(Standard Template Library)\u8fdb\u884c\u6982\u8ff0\uff0c\u5e76\u5bf9\u4e94\u5927\u6a21\u5757\u8fdb\u884c\u4e3e\u4f8b\u8bf4\u660e\u3002\u5927\u5bb6\u53ef\u53c2\u7167\u8be5\u6982\u8ff0\u5185\u5bb9\u5f00\u5c55\u5b66\u4e60\u548c\u5b9e\u8df5\u3002<\/p>\n","protected":false},"author":1,"featured_media":5194,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"colormag_page_container_layout":"default_layout","colormag_page_sidebar_layout":"default_layout","footnotes":""},"categories":[17],"tags":[20,24,21,22],"class_list":["post-5199","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-technology","tag-c","tag-stl","tag-21","tag-22"],"_links":{"self":[{"href":"https:\/\/www.diggoodbox.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/5199","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.diggoodbox.com\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.diggoodbox.com\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.diggoodbox.com\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.diggoodbox.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=5199"}],"version-history":[{"count":1,"href":"https:\/\/www.diggoodbox.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/5199\/revisions"}],"predecessor-version":[{"id":5200,"href":"https:\/\/www.diggoodbox.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/5199\/revisions\/5200"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.diggoodbox.com\/blog\/index.php?rest_route=\/wp\/v2\/media\/5194"}],"wp:attachment":[{"href":"https:\/\/www.diggoodbox.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=5199"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.diggoodbox.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=5199"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.diggoodbox.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=5199"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}