• <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++研究

            C++細節(jié)深度探索及軟件工程

              C++博客 :: 首頁 :: 新隨筆 :: 聯(lián)系 :: 聚合  :: 管理 ::
              37 隨筆 :: 0 文章 :: 74 評論 :: 0 Trackbacks
            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.

            Quoted from STL_tutorial_reference
            posted on 2007-04-21 14:39 常興龍 閱讀(289) 評論(0)  編輯 收藏 引用

            只有注冊用戶登錄后才能發(fā)表評論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問   Chat2DB   管理


            > hi的博客
            亚洲中文字幕无码一久久区| 亚洲AV无一区二区三区久久 | 久久无码AV中文出轨人妻| 国产午夜精品理论片久久| 青青热久久国产久精品| 久久久久久精品无码人妻| 99久久人妻无码精品系列| 久久国产精品偷99| 三上悠亚久久精品| 久久综合视频网站| 亚洲成人精品久久| 要久久爱在线免费观看| 亚洲国产二区三区久久| 久久久久久伊人高潮影院| 国产精品狼人久久久久影院| 久久亚洲AV无码精品色午夜麻豆| 久久精品国产一区二区三区日韩| 午夜精品久久久久| 久久久久久无码国产精品中文字幕| 亚洲va久久久噜噜噜久久男同| 日本国产精品久久| 久久AAAA片一区二区| 人人狠狠综合久久亚洲婷婷| 麻豆AV一区二区三区久久| 国产成人无码精品久久久性色| 亚洲色欲久久久久综合网| 久久av无码专区亚洲av桃花岛| 亚洲中文久久精品无码| 一本色道久久88综合日韩精品 | 国产精品美女久久久久AV福利| 国产精品禁18久久久夂久| 久久青青草原精品国产| 久久WWW免费人成一看片| 日韩乱码人妻无码中文字幕久久| 97视频久久久| 亚洲色欲久久久综合网| 99精品久久久久久久婷婷| 久久精品国产精品亚洲精品| 国产成人精品综合久久久久 | 九九99精品久久久久久| 久久91综合国产91久久精品|