Detecting if an element is found inside a containercontains() algorithm for std::vectorSimple container class...

How can a function with a hole (removable discontinuity) equal a function with no hole?

Why not increase contact surface when reentering the atmosphere?

Did Dumbledore lie to Harry about how long he had James Potter's invisibility cloak when he was examining it? If so, why?

How easy is it to start Magic from scratch?

How does Loki do this?

How does it work when somebody invests in my business?

Where does the Z80 processor start executing from?

Two monoidal structures and copowering

I'm in charge of equipment buying but no one's ever happy with what I choose. How to fix this?

How to Reset Passwords on Multiple Websites Easily?

How many times can American Tourist re-enter UK in same 6 month period?

How do I go from 300 unfinished/half written blog posts, to published posts?

Increase performance creating Mandelbrot set in python

Lay out the Carpet

Is exact Kanji stroke length important?

Is there a good way to store credentials outside of a password manager?

Is it okay for two “sein” to be next to each other?

India just shot down a satellite from the ground. At what altitude range is the resulting debris field?

Type int? vs type int

Integer addition + constant, is it a group?

Nautlius: add mouse right-click action to compute MD5 sum

How did Doctor Strange see the winning outcome in Avengers: Infinity War?

Is this apparent Class Action settlement a spam message?

How to check is there any negative term in a large list?



Detecting if an element is found inside a container


contains() algorithm for std::vectorSimple container class with templatesPolymorphic STL foreach without passing the container typeGeneric container assignmentC++11 Quicksort any containerTriple-type template containerCreating a custom template container class (vector alike)Shift an element in a circular containerNon-sequential template class container C++Internal Zip-like IteratorBasic binary number container













3












$begingroup$


I just wrote this template to detect if a given element is found inside a container:



template <typename Iterator> bool is_contained(Iterator begin, Iterator end, decltype(*begin) object)
{
for (; begin != end; ++begin)
{
if (*begin == object)
{
return true;
}
}
return false;
}


Which then would be called for examples as:



bool test = is_contained<decltype(container.begin())>(container.begin(), container.end(), anything);


This works fine, but I believe it is not so readable. I am also new to using decltype which makes me wonder if this would crash, and somehow I wont be calling the template correctly. Any feedback is highly appreciated.










share|improve this question







New contributor




Daniel Duque is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$

















    3












    $begingroup$


    I just wrote this template to detect if a given element is found inside a container:



    template <typename Iterator> bool is_contained(Iterator begin, Iterator end, decltype(*begin) object)
    {
    for (; begin != end; ++begin)
    {
    if (*begin == object)
    {
    return true;
    }
    }
    return false;
    }


    Which then would be called for examples as:



    bool test = is_contained<decltype(container.begin())>(container.begin(), container.end(), anything);


    This works fine, but I believe it is not so readable. I am also new to using decltype which makes me wonder if this would crash, and somehow I wont be calling the template correctly. Any feedback is highly appreciated.










    share|improve this question







    New contributor




    Daniel Duque is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$















      3












      3








      3





      $begingroup$


      I just wrote this template to detect if a given element is found inside a container:



      template <typename Iterator> bool is_contained(Iterator begin, Iterator end, decltype(*begin) object)
      {
      for (; begin != end; ++begin)
      {
      if (*begin == object)
      {
      return true;
      }
      }
      return false;
      }


      Which then would be called for examples as:



      bool test = is_contained<decltype(container.begin())>(container.begin(), container.end(), anything);


      This works fine, but I believe it is not so readable. I am also new to using decltype which makes me wonder if this would crash, and somehow I wont be calling the template correctly. Any feedback is highly appreciated.










      share|improve this question







      New contributor




      Daniel Duque is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      I just wrote this template to detect if a given element is found inside a container:



      template <typename Iterator> bool is_contained(Iterator begin, Iterator end, decltype(*begin) object)
      {
      for (; begin != end; ++begin)
      {
      if (*begin == object)
      {
      return true;
      }
      }
      return false;
      }


      Which then would be called for examples as:



      bool test = is_contained<decltype(container.begin())>(container.begin(), container.end(), anything);


      This works fine, but I believe it is not so readable. I am also new to using decltype which makes me wonder if this would crash, and somehow I wont be calling the template correctly. Any feedback is highly appreciated.







      c++ beginner template






      share|improve this question







      New contributor




      Daniel Duque is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|improve this question







      New contributor




      Daniel Duque is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|improve this question




      share|improve this question






      New contributor




      Daniel Duque is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 3 hours ago









      Daniel DuqueDaniel Duque

      484




      484




      New contributor




      Daniel Duque is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      Daniel Duque is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      Daniel Duque is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






















          2 Answers
          2






          active

          oldest

          votes


















          4












          $begingroup$

          Note that for functions the compiler will detect the template types based on the parameters.

          So you can simply write:



          bool test = is_contained(container.begin(), container.end(), anything);


          I don't particularly like the use of decltype in your function. I would simply make it another template parameter.



          template <typename Iterator, typename Value>
          bool is_contained(Iterator begin, Iterator end, Value const& object);


          Because of the compiler deducing the names you can use any type. Also this is more flexable as it allows you to use any type that is comparable to the type inside the container (rather than only allowing values that are the same type (or trivial convertible)).






          share|improve this answer









          $endgroup$





















            2












            $begingroup$



            1. Do you want to test whether an element is in a container, or an iterator-range?




              • The first allows for optimisation (taking advantage of the container's peculiarities). See "contains() algorithm for std::vector" for an example.

              • The second is more general in the absence of any range-library, like the one expected for the C++20 standard, and available for earlier versions.




            2. Constraining the needle to the type decltype(*begin) is very problematic:




              • It forces pass-by-value, which while it should be possible, at least with moveing, might be inefficient.

              • You cannot take advantage of transparent comparators (a C++14 feature), forcing the creation of a useless temporary. On the flip-side, if transparent comparators are not used, only a single temporary is constructed.

              • If the type is a proxy like with the dreaded std::vector <bool>, hilarity ensues.



            3. Consider taking advantage of the standard library, specifically std::find ().


            4. C++ will deduce the function's template-arguments perfectly fine, no need for error-prone verbosity.







            share|improve this answer









            $endgroup$













              Your Answer





              StackExchange.ifUsing("editor", function () {
              return StackExchange.using("mathjaxEditing", function () {
              StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
              StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
              });
              });
              }, "mathjax-editing");

              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: "196"
              };
              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: false,
              noModals: true,
              showLowRepImageUploadWarning: true,
              reputationToPostImages: null,
              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
              });


              }
              });






              Daniel Duque is a new contributor. Be nice, and check out our Code of Conduct.










              draft saved

              draft discarded


















              StackExchange.ready(
              function () {
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216361%2fdetecting-if-an-element-is-found-inside-a-container%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









              4












              $begingroup$

              Note that for functions the compiler will detect the template types based on the parameters.

              So you can simply write:



              bool test = is_contained(container.begin(), container.end(), anything);


              I don't particularly like the use of decltype in your function. I would simply make it another template parameter.



              template <typename Iterator, typename Value>
              bool is_contained(Iterator begin, Iterator end, Value const& object);


              Because of the compiler deducing the names you can use any type. Also this is more flexable as it allows you to use any type that is comparable to the type inside the container (rather than only allowing values that are the same type (or trivial convertible)).






              share|improve this answer









              $endgroup$


















                4












                $begingroup$

                Note that for functions the compiler will detect the template types based on the parameters.

                So you can simply write:



                bool test = is_contained(container.begin(), container.end(), anything);


                I don't particularly like the use of decltype in your function. I would simply make it another template parameter.



                template <typename Iterator, typename Value>
                bool is_contained(Iterator begin, Iterator end, Value const& object);


                Because of the compiler deducing the names you can use any type. Also this is more flexable as it allows you to use any type that is comparable to the type inside the container (rather than only allowing values that are the same type (or trivial convertible)).






                share|improve this answer









                $endgroup$
















                  4












                  4








                  4





                  $begingroup$

                  Note that for functions the compiler will detect the template types based on the parameters.

                  So you can simply write:



                  bool test = is_contained(container.begin(), container.end(), anything);


                  I don't particularly like the use of decltype in your function. I would simply make it another template parameter.



                  template <typename Iterator, typename Value>
                  bool is_contained(Iterator begin, Iterator end, Value const& object);


                  Because of the compiler deducing the names you can use any type. Also this is more flexable as it allows you to use any type that is comparable to the type inside the container (rather than only allowing values that are the same type (or trivial convertible)).






                  share|improve this answer









                  $endgroup$



                  Note that for functions the compiler will detect the template types based on the parameters.

                  So you can simply write:



                  bool test = is_contained(container.begin(), container.end(), anything);


                  I don't particularly like the use of decltype in your function. I would simply make it another template parameter.



                  template <typename Iterator, typename Value>
                  bool is_contained(Iterator begin, Iterator end, Value const& object);


                  Because of the compiler deducing the names you can use any type. Also this is more flexable as it allows you to use any type that is comparable to the type inside the container (rather than only allowing values that are the same type (or trivial convertible)).







                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered 3 hours ago









                  Martin YorkMartin York

                  73.9k488271




                  73.9k488271

























                      2












                      $begingroup$



                      1. Do you want to test whether an element is in a container, or an iterator-range?




                        • The first allows for optimisation (taking advantage of the container's peculiarities). See "contains() algorithm for std::vector" for an example.

                        • The second is more general in the absence of any range-library, like the one expected for the C++20 standard, and available for earlier versions.




                      2. Constraining the needle to the type decltype(*begin) is very problematic:




                        • It forces pass-by-value, which while it should be possible, at least with moveing, might be inefficient.

                        • You cannot take advantage of transparent comparators (a C++14 feature), forcing the creation of a useless temporary. On the flip-side, if transparent comparators are not used, only a single temporary is constructed.

                        • If the type is a proxy like with the dreaded std::vector <bool>, hilarity ensues.



                      3. Consider taking advantage of the standard library, specifically std::find ().


                      4. C++ will deduce the function's template-arguments perfectly fine, no need for error-prone verbosity.







                      share|improve this answer









                      $endgroup$


















                        2












                        $begingroup$



                        1. Do you want to test whether an element is in a container, or an iterator-range?




                          • The first allows for optimisation (taking advantage of the container's peculiarities). See "contains() algorithm for std::vector" for an example.

                          • The second is more general in the absence of any range-library, like the one expected for the C++20 standard, and available for earlier versions.




                        2. Constraining the needle to the type decltype(*begin) is very problematic:




                          • It forces pass-by-value, which while it should be possible, at least with moveing, might be inefficient.

                          • You cannot take advantage of transparent comparators (a C++14 feature), forcing the creation of a useless temporary. On the flip-side, if transparent comparators are not used, only a single temporary is constructed.

                          • If the type is a proxy like with the dreaded std::vector <bool>, hilarity ensues.



                        3. Consider taking advantage of the standard library, specifically std::find ().


                        4. C++ will deduce the function's template-arguments perfectly fine, no need for error-prone verbosity.







                        share|improve this answer









                        $endgroup$
















                          2












                          2








                          2





                          $begingroup$



                          1. Do you want to test whether an element is in a container, or an iterator-range?




                            • The first allows for optimisation (taking advantage of the container's peculiarities). See "contains() algorithm for std::vector" for an example.

                            • The second is more general in the absence of any range-library, like the one expected for the C++20 standard, and available for earlier versions.




                          2. Constraining the needle to the type decltype(*begin) is very problematic:




                            • It forces pass-by-value, which while it should be possible, at least with moveing, might be inefficient.

                            • You cannot take advantage of transparent comparators (a C++14 feature), forcing the creation of a useless temporary. On the flip-side, if transparent comparators are not used, only a single temporary is constructed.

                            • If the type is a proxy like with the dreaded std::vector <bool>, hilarity ensues.



                          3. Consider taking advantage of the standard library, specifically std::find ().


                          4. C++ will deduce the function's template-arguments perfectly fine, no need for error-prone verbosity.







                          share|improve this answer









                          $endgroup$





                          1. Do you want to test whether an element is in a container, or an iterator-range?




                            • The first allows for optimisation (taking advantage of the container's peculiarities). See "contains() algorithm for std::vector" for an example.

                            • The second is more general in the absence of any range-library, like the one expected for the C++20 standard, and available for earlier versions.




                          2. Constraining the needle to the type decltype(*begin) is very problematic:




                            • It forces pass-by-value, which while it should be possible, at least with moveing, might be inefficient.

                            • You cannot take advantage of transparent comparators (a C++14 feature), forcing the creation of a useless temporary. On the flip-side, if transparent comparators are not used, only a single temporary is constructed.

                            • If the type is a proxy like with the dreaded std::vector <bool>, hilarity ensues.



                          3. Consider taking advantage of the standard library, specifically std::find ().


                          4. C++ will deduce the function's template-arguments perfectly fine, no need for error-prone verbosity.








                          share|improve this answer












                          share|improve this answer



                          share|improve this answer










                          answered 2 hours ago









                          DeduplicatorDeduplicator

                          11.7k1950




                          11.7k1950






















                              Daniel Duque is a new contributor. Be nice, and check out our Code of Conduct.










                              draft saved

                              draft discarded


















                              Daniel Duque is a new contributor. Be nice, and check out our Code of Conduct.













                              Daniel Duque is a new contributor. Be nice, and check out our Code of Conduct.












                              Daniel Duque is a new contributor. Be nice, and check out our Code of Conduct.
















                              Thanks for contributing an answer to Code Review Stack Exchange!


                              • 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.


                              Use MathJax to format equations. MathJax reference.


                              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%2fcodereview.stackexchange.com%2fquestions%2f216361%2fdetecting-if-an-element-is-found-inside-a-container%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

                              Gersau Kjelder | Navigasjonsmeny46°59′0″N 8°31′0″E46°59′0″N...

                              Nässjö kommun Tettstader | Kjelder | NavigasjonsmenyeVIAFISNIGeoNamesMusicBrainz (area)

                              Kvitkval Innhaldsliste Taksonomi og utvikling | Utsjånad og levevis | Utbreiing | Åtferd |...