105 STL Algorithms in Less Than an Hour - Jonathan Boccara [ACCU 2018]

Поділитися
Вставка
  • Опубліковано 9 лип 2024
  • We are all aware that we should know the STL algorithms. Including them in our designs allows us to make our code more expressive and more robust. And sometimes, in a spectacular way.
    But do you know your STL algorithms?
    In this presentation, you’ll see the 105 algorithms that the STL currently has, including those added in C++11 and C++17. But more than just a listing, the point of this presentation is to highlight the different groups of algorithms, the patterns they form in the STL, and how the algorithms relate together.
    This kind of big picture is the best way I know to actually remember them all, and constitute a toolbox chock-full of ways to make our code more expressive and more robust.

КОМЕНТАРІ • 41

  • @MatthewChaplain
    @MatthewChaplain 6 років тому +18

    This is possibly the most accessible method of explaining the standard library algorithms I've seen. Good work!

    • @maxabramson4781
      @maxabramson4781 5 років тому

      I would love this talk, except that his accent(s) is so thick that I miss some of the key words. That then makes some of his statements difficult to understand, making his whole description impossible to understand.

  • @code_report
    @code_report 6 років тому +48

    i can't believe ppl didn't clap after the The World of C++ STL Aglorithms animation! it was so good.

    • @GargAnkit
      @GargAnkit 6 років тому

      are you referring to the UB animation?

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

      the animation at 9:33

    • @Buqui
      @Buqui 6 років тому +1

      I know right? Kinda reminded me of Game of Thrones, but I think in general the audience was very bland.

    • @-taz-
      @-taz- 6 років тому

      Or laugh, at least.

    • @TimmmmCam
      @TimmmmCam 5 років тому +4

      I was there, it was a bit awkward in person tbh, but this was easily the best talk of the conference.

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

    Great talk Jonathan! we need more people like you, passionate, brilliant and C++ popularizer...

  • @tobiasfuchs7016
    @tobiasfuchs7016 6 років тому +9

    Watching this talk is a homework assignment in my course now. I just keep nodding from beginning to end, and the presentation is amazing. Why didn't the audience give some hand for the animation?!

    • @nukeman0199
      @nukeman0199 6 років тому +3

      Tobias Fuchs std::nod(video.begin(), video.end() )
      (Sorry, i couldn’t help muself)

  • @CedricMialaret
    @CedricMialaret 6 років тому +19

    Great talk! One grave omission however: in my opinion, you should name the father of STL, Alexander Stepanov, and spend a few minutes on how STL was a breakthrough and a turning point from c++ and what distinguished it from other collection of algorithms.

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

    Nice presentation! This video will probably be used for all my future needs of STL algorithms :)

  • @reemuskumar1
    @reemuskumar1 5 років тому

    It is one of the best Video on STL Algorithms. And with a Mind Map(like fantasy world map) !!!

  • @RobertFuszenecker
    @RobertFuszenecker 5 років тому

    Brilliant video. Thanks for it.

  • @Buqui
    @Buqui 6 років тому

    Thank you for this presentation, I've learned a lot from it and I have in mind a couple of places where I could use this, turning a 50 liner to a 1 liner, that's very useful!

  • @-AdityaKulkarni-
    @-AdityaKulkarni- 5 років тому

    Just love it!

  • @figurehe4d
    @figurehe4d 6 років тому +1

    excellent overview!

  • @OnWhenReady
    @OnWhenReady 6 років тому +3

    Really nice talk!

  • @chunshengpei6488
    @chunshengpei6488 6 років тому +1

    I think I saw the map of STL on reddit months ago. and it would be nice to mention the father and mother of STL, Alexander Stepanov and Meng Lee.

  • @svenbtb
    @svenbtb 10 місяців тому

    This is very helpful, thank you for this

    • @ACCUConf
      @ACCUConf  10 місяців тому

      Thank you for your comment and pleased to hear this presentation was of use.

  • @evandrix
    @evandrix 6 років тому

    public link to slide deck?

  • @bhairaramjakhar7326
    @bhairaramjakhar7326 5 років тому

    where to get these slides from?
    please make a git repository..

  • @adamurban6904
    @adamurban6904 6 років тому +1

    How did you do that nice map animation?

    • @nukeman0199
      @nukeman0199 6 років тому

      Ádám Urbán to me, it almost looks like he viewed it with VR goggles and screencapped it

  • @paulfloyd9258
    @paulfloyd9258 6 років тому

    Here is the link for the map : www.fluentcpp.com/getthemap/

  • @petermuller9518
    @petermuller9518 5 років тому

    Great talk! Where to get the Mal?

  • @homomorphic
    @homomorphic 5 років тому

    good talk, that's all.

  • @svenbekgb1619
    @svenbekgb1619 6 років тому +4

    Good talk! Where can i download the map?

    • @GargAnkit
      @GargAnkit 6 років тому +5

      Here: www.fluentcpp.com/getthemap/

    • @JMPDev
      @JMPDev 6 років тому

      0:52:34

  • @kevalan1042
    @kevalan1042 6 років тому +4

    Great talk! What is that accent?

    • @treyquattro
      @treyquattro 5 років тому

      I believe Spanish, by way of UK & France

    • @michaelchadwick1820
      @michaelchadwick1820 5 років тому

      Jonathan is French. He lives in France, but spent some time in the UK where he became fluent in English; thus his accent is primarily a UK accent.

  • @muhammetaliasan4
    @muhammetaliasan4 5 років тому

    By the way his comments about std::copy at ua-cam.com/video/bXkWuUe9V2I/v-deo.htmlm12s is not completely correct. In cppreference it is stated to be undefined behaviour if the destination range is overlapping with source range. Not always overwrites. for instance std::copy yields 1 2 3 1 2 3 4 5 9 10 as expected in my system with gcc 5.5.0

  • @xiaoruizhou694
    @xiaoruizhou694 5 років тому +1

    This is possibly the most accessible method of explaining the standard library algorithms I've seen. Good work!