• <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 常興龍 閱讀(287) 評論(0)  編輯 收藏 引用

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


            > hi的博客
            国产精品va久久久久久久| 伊色综合久久之综合久久| 日韩精品久久久久久免费| 国产精品九九九久久九九| 久久精品国产2020| 日本强好片久久久久久AAA| 久久综合伊人77777麻豆| 久久伊人亚洲AV无码网站| 中文字幕日本人妻久久久免费| 97久久国产亚洲精品超碰热| 欧美麻豆久久久久久中文| 亚洲AV无码久久精品色欲| 久久国产一片免费观看| 久久国产精品成人片免费| 久久男人AV资源网站| 久久天天躁狠狠躁夜夜96流白浆| 国产精品成人精品久久久| 99久久精品国产麻豆| 一本色综合网久久| 久久人人爽人人爽人人片AV麻豆| 久久久精品人妻一区二区三区四 | 亚洲欧美另类日本久久国产真实乱对白| 亚洲精品国精品久久99热一| 久久精品无码免费不卡| 久久99免费视频| WWW婷婷AV久久久影片| 亚洲&#228;v永久无码精品天堂久久| 日本精品久久久久影院日本| 久久久精品免费国产四虎| 久久精品aⅴ无码中文字字幕不卡| 一本综合久久国产二区| 精品久久久久久无码免费| 久久不射电影网| 久久精品国产精品青草app| 久久精品国产亚洲AV高清热| 亚洲国产精品无码久久一线 | 99久久精品国内| 久久青草国产精品一区| 99久久国产综合精品麻豆| 91久久九九无码成人网站| 狠狠精品久久久无码中文字幕|