Is std::next for vector O(n) or O(1)?





.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box;
}







11















In C++11 I use std::next because If I want to change vector to list, I dont have to change the rest of code.



For list, std::next is O(n), because I need to iterate all elements. But how is it for a vector? I have found this note on cppreference:




However, if InputIt or ForwardIt additionally meets the requirements of LegacyRandomAccessIterator, complexity is constant.




Does vector meet these requirements? And why "Legacy"?






c++







share|improve this question




















  • 12





    "Constant" means O(1).

    – Some programmer dude
    9 hours ago






  • 1





    I know that, but I dont know If it aplies to vector, since I dont understand LegacyRandomAccessIterator. Why Legacy?

    – Martin Perry
    9 hours ago








  • 4





    @MartinPerry Follow the link? In the page you pull the quote from, the word "LegacyRandomAccessIterator" is a link to an explanation about it. And for vectors, iterators are (legacy) random-access iterators (as you should be able to find out in the std::vector reference).

    – Some programmer dude
    9 hours ago




















11















In C++11 I use std::next because If I want to change vector to list, I dont have to change the rest of code.



For list, std::next is O(n), because I need to iterate all elements. But how is it for a vector? I have found this note on cppreference:




However, if InputIt or ForwardIt additionally meets the requirements of LegacyRandomAccessIterator, complexity is constant.




Does vector meet these requirements? And why "Legacy"?






c++







share|improve this question




















  • 12





    "Constant" means O(1).

    – Some programmer dude
    9 hours ago






  • 1





    I know that, but I dont know If it aplies to vector, since I dont understand LegacyRandomAccessIterator. Why Legacy?

    – Martin Perry
    9 hours ago








  • 4





    @MartinPerry Follow the link? In the page you pull the quote from, the word "LegacyRandomAccessIterator" is a link to an explanation about it. And for vectors, iterators are (legacy) random-access iterators (as you should be able to find out in the std::vector reference).

    – Some programmer dude
    9 hours ago
















11












11








11


2






In C++11 I use std::next because If I want to change vector to list, I dont have to change the rest of code.



For list, std::next is O(n), because I need to iterate all elements. But how is it for a vector? I have found this note on cppreference:




However, if InputIt or ForwardIt additionally meets the requirements of LegacyRandomAccessIterator, complexity is constant.




Does vector meet these requirements? And why "Legacy"?






c++







share|improve this question
















In C++11 I use std::next because If I want to change vector to list, I dont have to change the rest of code.



For list, std::next is O(n), because I need to iterate all elements. But how is it for a vector? I have found this note on cppreference:




However, if InputIt or ForwardIt additionally meets the requirements of LegacyRandomAccessIterator, complexity is constant.




Does vector meet these requirements? And why "Legacy"?






c++




c++






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 9 hours ago









Angew

135k11261354




135k11261354










asked 9 hours ago









Martin PerryMartin Perry

5,21833267




5,21833267








  • 12





    "Constant" means O(1).

    – Some programmer dude
    9 hours ago






  • 1





    I know that, but I dont know If it aplies to vector, since I dont understand LegacyRandomAccessIterator. Why Legacy?

    – Martin Perry
    9 hours ago








  • 4





    @MartinPerry Follow the link? In the page you pull the quote from, the word "LegacyRandomAccessIterator" is a link to an explanation about it. And for vectors, iterators are (legacy) random-access iterators (as you should be able to find out in the std::vector reference).

    – Some programmer dude
    9 hours ago
















  • 12





    "Constant" means O(1).

    – Some programmer dude
    9 hours ago






  • 1





    I know that, but I dont know If it aplies to vector, since I dont understand LegacyRandomAccessIterator. Why Legacy?

    – Martin Perry
    9 hours ago








  • 4





    @MartinPerry Follow the link? In the page you pull the quote from, the word "LegacyRandomAccessIterator" is a link to an explanation about it. And for vectors, iterators are (legacy) random-access iterators (as you should be able to find out in the std::vector reference).

    – Some programmer dude
    9 hours ago










12




12





"Constant" means O(1).

– Some programmer dude
9 hours ago





"Constant" means O(1).

– Some programmer dude
9 hours ago




1




1





I know that, but I dont know If it aplies to vector, since I dont understand LegacyRandomAccessIterator. Why Legacy?

– Martin Perry
9 hours ago







I know that, but I dont know If it aplies to vector, since I dont understand LegacyRandomAccessIterator. Why Legacy?

– Martin Perry
9 hours ago






4




4





@MartinPerry Follow the link? In the page you pull the quote from, the word "LegacyRandomAccessIterator" is a link to an explanation about it. And for vectors, iterators are (legacy) random-access iterators (as you should be able to find out in the std::vector reference).

– Some programmer dude
9 hours ago







@MartinPerry Follow the link? In the page you pull the quote from, the word "LegacyRandomAccessIterator" is a link to an explanation about it. And for vectors, iterators are (legacy) random-access iterators (as you should be able to find out in the std::vector reference).

– Some programmer dude
9 hours ago














2 Answers
2






active

oldest

votes


















14














There is a plan of adding concepts (compile time type constraints) in C++20. The new standard is supposed to contain concepts like InputIterator or RandomAccessIterator. To distinguish between the concepts and the old trait-like requirements cppreference uses LegacyRandomAccessIterator and so on for pre-concept requirements and RandomAccessIterator and so for concept requirements.



And so yes, std::vector::iterator meets requirements of LegacyRandomAccessIterator and actually will be fulfilling RandomAccessIterator concept as well. This leads straight to conclusion that std::next called on vector::iterator has complexity O(1).






share|improve this answer

































    8















    Does vector meet these requirements?




    Yes, it does:



    https://en.cppreference.com/w/cpp/container/vector



    Quote: "iterator LegacyRandomAccessIterator"




    And why "Legacy"?




    The existing iterators have been renamed "legacy" because of the upcoming C++ library feature called ranges, which is a replacement for the current approach. Ranges will have new iterators. The existing ones will still be there, thus they're called "legacy."






    share|improve this answer
























      Your Answer






      StackExchange.ifUsing("editor", function () {
      StackExchange.using("externalEditor", function () {
      StackExchange.using("snippets", function () {
      StackExchange.snippets.init();
      });
      });
      }, "code-snippets");

      StackExchange.ready(function() {
      var channelOptions = {
      tags: "".split(" "),
      id: "1"
      };
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function() {
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled) {
      StackExchange.using("snippets", function() {
      createEditor();
      });
      }
      else {
      createEditor();
      }
      });

      function createEditor() {
      StackExchange.prepareEditor({
      heartbeatType: 'answer',
      autoActivateHeartbeat: false,
      convertImagesToLinks: true,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      imageUploader: {
      brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
      contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
      allowUrls: true
      },
      onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      });


      }
      });














      draft saved

      draft discarded


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f55586847%2fis-stdnext-for-vector-on-or-o1%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      14














      There is a plan of adding concepts (compile time type constraints) in C++20. The new standard is supposed to contain concepts like InputIterator or RandomAccessIterator. To distinguish between the concepts and the old trait-like requirements cppreference uses LegacyRandomAccessIterator and so on for pre-concept requirements and RandomAccessIterator and so for concept requirements.



      And so yes, std::vector::iterator meets requirements of LegacyRandomAccessIterator and actually will be fulfilling RandomAccessIterator concept as well. This leads straight to conclusion that std::next called on vector::iterator has complexity O(1).






      share|improve this answer






























        14














        There is a plan of adding concepts (compile time type constraints) in C++20. The new standard is supposed to contain concepts like InputIterator or RandomAccessIterator. To distinguish between the concepts and the old trait-like requirements cppreference uses LegacyRandomAccessIterator and so on for pre-concept requirements and RandomAccessIterator and so for concept requirements.



        And so yes, std::vector::iterator meets requirements of LegacyRandomAccessIterator and actually will be fulfilling RandomAccessIterator concept as well. This leads straight to conclusion that std::next called on vector::iterator has complexity O(1).






        share|improve this answer




























          14












          14








          14







          There is a plan of adding concepts (compile time type constraints) in C++20. The new standard is supposed to contain concepts like InputIterator or RandomAccessIterator. To distinguish between the concepts and the old trait-like requirements cppreference uses LegacyRandomAccessIterator and so on for pre-concept requirements and RandomAccessIterator and so for concept requirements.



          And so yes, std::vector::iterator meets requirements of LegacyRandomAccessIterator and actually will be fulfilling RandomAccessIterator concept as well. This leads straight to conclusion that std::next called on vector::iterator has complexity O(1).






          share|improve this answer















          There is a plan of adding concepts (compile time type constraints) in C++20. The new standard is supposed to contain concepts like InputIterator or RandomAccessIterator. To distinguish between the concepts and the old trait-like requirements cppreference uses LegacyRandomAccessIterator and so on for pre-concept requirements and RandomAccessIterator and so for concept requirements.



          And so yes, std::vector::iterator meets requirements of LegacyRandomAccessIterator and actually will be fulfilling RandomAccessIterator concept as well. This leads straight to conclusion that std::next called on vector::iterator has complexity O(1).







          share|improve this answer














          share|improve this answer



          share|improve this answer








          edited 9 hours ago

























          answered 9 hours ago









          bartopbartop

          3,4151132




          3,4151132

























              8















              Does vector meet these requirements?




              Yes, it does:



              https://en.cppreference.com/w/cpp/container/vector



              Quote: "iterator LegacyRandomAccessIterator"




              And why "Legacy"?




              The existing iterators have been renamed "legacy" because of the upcoming C++ library feature called ranges, which is a replacement for the current approach. Ranges will have new iterators. The existing ones will still be there, thus they're called "legacy."






              share|improve this answer




























                8















                Does vector meet these requirements?




                Yes, it does:



                https://en.cppreference.com/w/cpp/container/vector



                Quote: "iterator LegacyRandomAccessIterator"




                And why "Legacy"?




                The existing iterators have been renamed "legacy" because of the upcoming C++ library feature called ranges, which is a replacement for the current approach. Ranges will have new iterators. The existing ones will still be there, thus they're called "legacy."






                share|improve this answer


























                  8












                  8








                  8








                  Does vector meet these requirements?




                  Yes, it does:



                  https://en.cppreference.com/w/cpp/container/vector



                  Quote: "iterator LegacyRandomAccessIterator"




                  And why "Legacy"?




                  The existing iterators have been renamed "legacy" because of the upcoming C++ library feature called ranges, which is a replacement for the current approach. Ranges will have new iterators. The existing ones will still be there, thus they're called "legacy."






                  share|improve this answer














                  Does vector meet these requirements?




                  Yes, it does:



                  https://en.cppreference.com/w/cpp/container/vector



                  Quote: "iterator LegacyRandomAccessIterator"




                  And why "Legacy"?




                  The existing iterators have been renamed "legacy" because of the upcoming C++ library feature called ranges, which is a replacement for the current approach. Ranges will have new iterators. The existing ones will still be there, thus they're called "legacy."







                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered 9 hours ago









                  Nikos C.Nikos C.

                  34.2k53967




                  34.2k53967






























                      draft saved

                      draft discarded




















































                      Thanks for contributing an answer to Stack Overflow!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid …



                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f55586847%2fis-stdnext-for-vector-on-or-o1%23new-answer', 'question_page');
                      }
                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      -

                      Popular posts from this blog

                      A CLEAN and SIMPLE way to add appendices to Table of Contents and bookmarks

                      Image
                      0 I found a lot of questions abount appendices and ToC. Many users want appendices to be grouped in an Appendix part, however some problems arise with ToC, hyperref, PDF viewer bookmarks, and so on. There are different solutions which require extra packages, command patching and other extra code, however none of them satisfies me. I almost found an easy way to accomplish a good result, where appendices are added to bookmarks in the right way and hyperref links point to the right page. However, the number of the "Appendix" part page is wrong (it's the number of appendix A). Is there any EASY way to fix that? This is a MWE: documentclass{book} usepackage[nottoc,notlot,notlof]{tocbibind} usepackage{hyperref} begin{document} frontmatter tableofcontents mainmatter part{First} chapter{...
                      Read more

                      Calculate evaluation metrics using cross_val_predict sklearn

                      Image
                      1 In the sklearn.model_selection.cross_val_predict page it is stated: Generate cross-validated estimates for each input data point. It is not appropriate to pass these predictions into an evaluation metric. Can someone explain what does it mean? If this gives estimate of Y (y prediction) for every Y (true Y), why can't I calculate metrics such as RMSE or coefficient of determination using these results? python scikit-learn cross-validation share | improve this question edited Nov 28 '18 at 17:52 desertnaut 20.3k 7 43 79 ...
                      Read more

                      Insert data from modal to MySQL (multiple modal on website)

                      Image
                      0 I have problem with inserting data to MySQL from modal. My modal: <a href="#" class="badge badge-pill badge-success">6 komentarzy</a> <a href="#" class="badge badge-pill badge-danger">brak komentarzy</a> <a data-toggle="modal" href="#add_desk_comm_{$desk_['desk_id']}" data-target="#add_desk_comm_{$desk_['desk_id']}" class="ediiit">(dodaj)</a> <div class="modal fade" id="add_desk_comm_{$desk_['desk_id']}" tabindex="-1" role="dialog" aria-labelledby="edit_printer" aria-hidden="true"> <div class="modal-dialog" role="document"> ...
                      Read more