CppCon 2016: Marshall Clow “STL Algorithms - why you should use them, and how to write your own"

Поділитися
Вставка
  • Опубліковано 5 жов 2016
  • CppCon.org
    -
    Presentation Slides, PDFs, Source Code and other presenter materials are available at: github.com/cppcon/cppcon2016
    -
    One of the most powerful features of the C++ standard library is the collection of basic algorithms. Everyone knows about sort and copy, but there are is a lot of powerful capabilities in the other algorithms as well. In this talk, I will explore some of the algorithms in the library, and give a rationale for writing your own, along with examples.
    The motivation for writing your own algorithms is that you can create generic building blocks that can be used over and over again in your library or application, and which will allow your to program at a higher level of abstraction. Instead of thinking, "how do I sort this vector", you just call std::sort. The same should apply to the algorithms that are specific to your domain - once you write them.
    -
    Marshall Clow
    Principal Engineer, Qualcomm, Inc.
    Marshall is a long-time LLVM and Boost participant. He is a principal engineer at Qualcomm, Inc. in San Diego, and the code owner for libc++, the LLVM standard library implementation. He is the author of the Boost.Algorithm library and maintains several other Boost libraries.
    -
    Videos Filmed & Edited by Bash Films: www.BashFilms.com
    *-----*
    Register Now For CppCon 2022: cppcon.org/registration/
    *-----*

КОМЕНТАРІ • 33

  • @emanuellandeholm5657
    @emanuellandeholm5657 Рік тому +3

    I just found all these CppCon videos. Not a C++ dev by any means, but these lectures are so good. Thanks!

  • @videofountain
    @videofountain 7 років тому +6

    Practical Gentle Introduction.

  • @YourCRTube
    @YourCRTube 7 років тому +33

    Nice talk, but a bit too 'entry level'. May be follow-up next year?

  • @benyuan620
    @benyuan620 7 років тому +13

    but compile error is really not so friendly

  • @mrlithium69
    @mrlithium69 7 років тому +9

    I wish he explained

  • @__hannibaalbarca__
    @__hannibaalbarca__ Рік тому +3

    I see video two times

  • @So1dier
    @So1dier 4 роки тому +4

    Would be better if he shown how to use it in the code with an example

  • @gast128
    @gast128 6 років тому +2

    adjacent_pair is quite an useful algorithm; please propose or add to Boost. Also I support the suggestion to use good names, but it seems that the STL is a major offender here (e.g. std::remove_copy which has nothing to with std::remove but more like copy_if_not or copy_omit).

  • @childhood1888
    @childhood1888 2 роки тому +1

    36:00

  • @broken_abi6973
    @broken_abi6973 7 років тому +12

    I find std::algorithms very hard/non-intuitive to use. I have to always go online to refresh my memory on what each algorithm does and the order of its arguments and outputs. I would prefer a more functional programming or range syntax.

  • @X_Baron
    @X_Baron 6 років тому +2

    I find this clow funn.

  • @Fetrovsky
    @Fetrovsky 7 років тому +6

    "A templated function" ... I hate that expression.

  • @indrajitbanerjee4350
    @indrajitbanerjee4350 4 роки тому +1

    There is no such thing as a 'templated function'. It's a 'function template' :)

  • @keyhanjannatkhah6729
    @keyhanjannatkhah6729 2 роки тому +1

    C++ has nice features but going to be so complex and unreadable. for system programming the system should be visible and understandable with simple concepts, C is much better in this way. with all respect to all efforts behind C++, unfortunately, it try abstract itself and the whole system in the wrong way. complexity over complexity.

  • @moderncpp
    @moderncpp Рік тому

    adjacent_pair is very useful 👌