• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            C++ Programmer's Cookbook

            {C++ 基礎} {C++ 高級} {C#界面,C++核心算法} {設計模式} {C#基礎}

            stl-什么時候用那種container?

            Overview of Container Abilities
              Vector Deque List Set Multiset Map Multimap
            Typical internal data structure Dynamic array Array of arrays Doubly linked list Binary tree Binary tree Binary tree Binary tree
            Elements Value Value Value Value Value Key/value pair Key/value pair
            Duplicates allowed Yes Yes Yes No Yes Not for the key Yes
            Random access available Yes Yes No No No With key No
            Iterator category Random access Random access Bidirectional Bidirectional (element constant) Bidirectional (element constant) Bidirectional (key constant) Bidirectional (key constant)
            Search/find elements Slow Slow Very slow Fast Fast Fast for key Fast for key
            Inserting/removing of elements is fast At the end At the beginning and the end Anywhere
            Inserting/removing invalidates iterators, references, pointers On reallocation Always Never Never Never Never Never
            Frees memory for removed elements Never Sometimes Always Always Always Always Always
            Allows memory reservation Yes No
            Transaction safe (success or no effect) Push/pop at the end Push/pop at the beginning and the end All except sort() and assignments All except multiple-element insertions All except multiple-element insertions All except multiple-element insertions All except multiple-element insertions


            As a supplement to the table, the following rules of thumb might help:

            • By default, you should use a vector. It has the simplest internal data structure and provides random access. Thus, data access is convenient and flexible, and data processing is often fast enough.

            • If you insert and/or remove elements often at the beginning and the end of a sequence, you should use a deque. You should also use a deque if it is important that the amount of internal memory used by the container shrinks when elements are removed. Also, because a vector usually uses one block of memory for its elements, a deque might be able to contain more elements because it uses several blocks.

            • If you insert, remove, and move elements often in the middle of a container, consider using a list. Lists provide special member functions to move elements from one container to another in constant time. Note, however, that because a list provides no random access, you might suffer significant performance penalties on access to elements inside the list if you only have the beginning of the list.

              Like all node-based containers, a list doesn't invalidate iterators that refer to elements, as long as those elements are part of the container. Vectors invalidate all of their iterators, pointers, and references whenever they exceed their capacity, and part of their iterators, pointers, and references on insertions and deletions. Deques invalidate iterators, pointers, and references when they change their size, respectively.

            • If you need a container that handles exceptions in a way that each operation either succeeds or has no effect, you should use either a list (without calling assignment operations and sort() and, if comparing the elements may throw, without calling merge (), remove(), remove_if(), and unique(); see page 172) or an associative container (without calling the multiple-element insert operations and, if copying/assigning the comparison criterion may throw, without calling swap()). See Section 5.11.2, for a general discussion of exception handling in the STL and Section 6.10.10, for a table of all container operations with special guarantees in face of exceptions.

            • If you often need to search for elements according to a certain criterion, use a set or a multiset that sorts elements according to this sorting criterion. Keep in mind that the logarithmic complexity involved in sorting 1,000 elements is in principle ten times better than that with linear complexity. In this case, the typical advantages of binary trees apply.

              A hash table commonly provides five to ten times faster lookup than a binary tree. So if a hash container is available, you might consider using it even though hash tables are not standardized. However, hash containers have no ordering, so if you need to rely on element order they're no good. Because they are not part of the C++ standard library, you should have the source code to stay portable.

            • To process key/value pairs, use a map or a multimap (or the hash version, if available).

            • If you need an associative array, use a map.

            • If you need a dictionary, use a multimap.

            posted on 2005-12-14 09:02 夢在天涯 閱讀(1635) 評論(1)  編輯 收藏 引用 所屬分類: STL/Boost

            評論

            # re: stl-什么時候用那種container? 2005-12-14 11:34 力為

            Effective STL Item One is also helpful.  回復  更多評論   

            公告

            EMail:itech001#126.com

            導航

            統計

            • 隨筆 - 461
            • 文章 - 4
            • 評論 - 746
            • 引用 - 0

            常用鏈接

            隨筆分類

            隨筆檔案

            收藏夾

            Blogs

            c#(csharp)

            C++(cpp)

            Enlish

            Forums(bbs)

            My self

            Often go

            Useful Webs

            Xml/Uml/html

            搜索

            •  

            積分與排名

            • 積分 - 1808095
            • 排名 - 5

            最新評論

            閱讀排行榜

            久久99国产精品尤物| 久久久久久国产精品美女| 久久亚洲精品成人av无码网站| 狠狠综合久久AV一区二区三区| 久久亚洲中文字幕精品有坂深雪| 久久综合丁香激情久久| 一本一本久久a久久精品综合麻豆| 久久婷婷五月综合色奶水99啪| 久久99精品免费一区二区| 亚洲精品tv久久久久久久久| 草草久久久无码国产专区| 久久精品毛片免费观看| 久久久青草青青国产亚洲免观| 国产成人久久精品一区二区三区| 久久男人中文字幕资源站| 国产精品久久国产精麻豆99网站| 欧美激情一区二区久久久| 国产日韩久久免费影院| 97久久久久人妻精品专区 | 青青草原精品99久久精品66| 99久久国产亚洲高清观看2024| 国内精品人妻无码久久久影院导航| 久久国产热这里只有精品| 国产精品福利一区二区久久| 久久久久亚洲av无码专区导航| 午夜精品久久影院蜜桃| 久久久久亚洲AV成人网人人网站| 中文字幕成人精品久久不卡| 99久久无码一区人妻a黑| 国产午夜免费高清久久影院| 久久se精品一区二区| 97久久精品人妻人人搡人人玩| 久久精品中文无码资源站| 久久久久亚洲AV无码专区体验| 久久国产精品一国产精品金尊| 国产综合久久久久| 99久久国产热无码精品免费久久久久| 色偷偷888欧美精品久久久| 久久99精品国产99久久6| 人妻中文久久久久| 久久综合精品国产二区无码|