Video

Graphs are driven by graph theory in mathematics. These math formulas that are specific to graph types (Bipartate graph, DAGs, etc) can be recreated in any programming language.

A really fun talk - I want to try a small personal project in asm at some point, although it's relatively overwhelming to look at

9:30 Class invariants are something that the implementer of the class guarantees and the user of the class assumes to be true. So if there is a "violation" of class invariant then it's a bug in class implementation. The user need not "worry" about messing the class invariant. They only need to ensure that the pre-conditions of the class method they are calling are satisfied. 9:17 If you are "messing up the class invariant through reinterpret_cast", you're most likely invoking undefined behaviour by violating pre-conditions of some core-language feature.

Poor sound quality.

Thanks for the great summary of where the feature is. I am wondering if we should split pre/postconditions that are thread safe vs non-thread safe. For example, if pre/post conditions reference a private variables and implementation of that class takes care of locking inside method definition then evaluating pre/postconditions during runtime will result in UB since it will be happening outside of the scoped lock declared in the function's definition. That would mean we can never enable run time checks on multithreaded programs. If we can split preconditions that are thread safe, then we can enable a subset of pre/postconditions.

Hmm, virtual functions are just function pointers under the hood. if you solve it for function pointers, you should get it for virtual functions for free, so maybe you should try to extend the facility that you are working on for virtual functions, so you can have it on function pointers as well.

underwater audio

1:34 Thanks for clarifying vocabulary types! Every discussion of vocabulary types I’ve seen somehow only mentions optional and variant

Good talk. I have searched for the slides, anyone know where they are?

I googled for >>john lakos std::vector::at()<< but found nothing that contained a reference to at(). I did find a very recent 74-page document. Is that what was is being referenced at 29:19

Is this the talk he refers to in the beginning? czcams.com/video/QbffGSgsCcQ/video.html

i like it !!! moving to rust from js myself

✨ 'promosm'

22:06 Dave Watson’s talk: czcams.com/video/_Ivd3qzgT7U/video.html

Hi! If you find the sound quality difficult on the ear - here is the previous iteration of this talk: czcams.com/video/d6NcnyXjc3I/video.html I don't think I can post a link to the slides without CZcams blocking me but you can find them on my github in presenations repo

rambling and disorganized

I think so called Niebloids and CPOs are different entities to solve different types of problems. Niebloids (called entities in the std::ranges in the standard?) is to inhibit ADL when using in unqualified and CPOs internally rely on ADL. Right now the only way to implement Niebloids without a new language feature is to use function objects. Due to using function objects and dealing with ADL, these two are seemingly same/equivalent but not. So in the future, people can come up with new ideas(e.g., new language feature) to implement Niebloids not using function objects.

11:21 I know this is a simplification in the presentation, but this needs to be `return { coroutine_handle<Promise<T>>::from_promise(*this); }`. That effectively does the same thing, but it returns the coro handle (which the Task needs to hang on to as a member variable to preserve the coro).

10:12 shouldn't this custom deleter also call `delete on the Promise pointer too?

The version with 8 partial accumulators will produce a faster AND more accurate sum, but the compiler has not been told to produce an accurate sum, just THIS sum. Careful what you ask for!

Did you use any optimizer while running the experiments ?

12:50 - can we just write `U&&` instead of that complex `decltype(...)` expression?

The combination of accent and audio compression makes the talk unintelligible for me without reading the slides at the same time. CZcams's system tried to capture captions in Russian... which of course failed.

Thank you for the lecture.

I very much enjoyed your Robert C. Weide joke at the beginning! :-D

wtf are you YELLING in this talk? just talk gently, stop being hysterical ffs, calm down

anyonoe else find rust programmers so smug and condescending? i cant stand them

Link to the slides: docs.google.com/presentation/d/1TWugFU1AQVT_tGcjOyWICtu1CHLLem6_Z9fDpK-GnYo/preview?rm=minimal

Was very confused. Assumed this was a talk on arena allocators.

A great presentation. Thanks. With regard the performance of Rust, in my first year of Rust have been able to match the speed of C/C++ in all the little programs of mine that I reimplemented in Rust for exactly this comparison. Most of those C/C++ programs were performance leaders in various coding challenges I have been involved in. BUT: The performance of Rust can be very sensitive to the way you write your Rust, even for the same algorithm. For example using good old fashioned C style array indexing vs Rust style iterators. It's not always clear which will be better at the outset. As usual, measure everything.

Nobody told me graphs were hard in Rust. Over a recent rainy weekend afternoon I just implemented one. It generates graphs of 20 vertices of valance 3 and 30 edges, randomly connected. And then does some traversal around the graph. It could easily be much bigger. These graphs are as per the famous old "Hunt the Wumpus" game from the early days of Unix. Being an old school C programmer who avoids malloc as much as possible my Rust graph was created as elements of Vectors. The links simply being indices to other elements. No worries with the borrow checker there :) Great talk by the way. Thanks.

The technique is super neat. 54:43 "let's have **one** Niebloid". Why not zero? stackoverflow.com/questions/63818871/why-does-tag-invoke-pattern-need-the-niebloid-stdtag-invoke-at-all

Thanks for this hard to find information. This video is a "milestone" test in understanding, I believe. I.e., the ideas referenced in the video are in themselves quite difficult and educational. You will (unless you're in the standards club or whatever) need to pause and take multiple days to study the various aspects. My rule is that I'm not allowed to not know a piece of vocabulary in English, so I always stop to look up words and phrases until I know them. You can do the same for C++. Eventually, if you can get through the entire video in one setting without pausing or rewinding, in real time, and fully understand all of it, it will serve as a sort of mega test in modern C++ understanding. It's one of *those* kinds of courses. It sort of demands you go back and learn all this other older (and also cutting edge) stuff you didn't know you didn't know. One small suggestion, consider renaming Problem #5 "Extension problem" instead of "Adaptation problem." This whole thing is adaptation, and it's a bit confusing with #3. Realizing you're talking about EXTENDING something helps.

For those who want to jump over the premises, the actual talk about tag_invoke starts at 52:45

Maybe change `shout("Come in, it's open!");` to `shout("Come in, it's unlocked.");` Right now, it's confusing haha. The state is CLOSED, not open. The door isn't open. It's unlocked.

Brilliant

why did he rate SRP 2 at 31:27 .How does changing the implementation(not signature) of circle's draw() affect triangle's draw()?

thanka for your kind effort for putting this video on CZcams

hi c++ london please add more videos