Since lower-addressed data come earlier in C, using the opposite convention in diagrams isn't very ergonomic.

Please i want to become a listener in Hearme

C++: I have zero costs 6502: C++: I have one cost

Here's why f(S&) is called nonetheless: In C++, when a temporary object is passed to a function, the compiler tries to find the best match among overloaded functions. It prioritizes functions taking rvalue references (f(S&&)) for efficiency reasons. However, in this specific case, there's a catch. The function f(S&) is also a viable candidate because a reference can bind to both values (variables) and rvalues (temporary objects). Since there's no explicit conversion happening within the wrap function (e.g., casting the temporary object to an lvalue), the compiler might choose the seemingly simpler option - f(S&).

'PromoSM' 😂

Who thought it was a good idea to film it from the side, so you can't read the slides easily?

best tutorial for the freshmen to learn the basic idea of memory model and memory barrier!!!

C++ will live longer than rust. It's more safe than RUST. Someday, when stupid managers, cheaters and government authorities will understand what safety means they will agree with that point. Toooooo many words out of core theme.

😅There is a comeneratative monument at Bletchey Park which acknolowdges the contribution of the Poles.

Very interesting - thank you. Thanks also for providing code,

how is this different from std::function_ref?

This is a great talk, will show to others

I cant understand why boost asio post is used!

This has contributed to training of my I.

Nice talk. For bug 3, clang-format helps. When the format is unexpeced and you wonder why, you will stumble over the semicolon.

Nice talk. All examples are very useful. One doubt: in Bug2 slide "maxSteps" not defined. is it global?.

Another event I missed 😞

Very nicely coded and presented.

Wow I haven't written Asio code in a minute, and it has become so much better! This talk inspired me to check this library out again!

PDP-11 is 16-bit. int would be 16 bits there.

The hospital had better people than the manufacturer.

The CRTP case is not equivalent - the explicit object parameter-code may do Unexpected Things if called through a reference to base: struct Base { template<typename Self) auto&& work(this Self&& self) { return std::forward<Self>(self).do_work(); } void do_work() { puts("do_work default impl "); } }; struct Derived: Base { void do_work() { puts("do_work overridde "); } }; int main() { Derived d; d.work(); // do_work overridde Base& b = d; b.work(); // do_work default impl // no compiler diagnostic required } In case of the classical CRTP, this scenario is much less likely, since the actual base class for each Derived is a unique template instance, so even if you still wanted to get a reference-to-base, you'd still have to make it explicitly templated, or it won't compile. Or in other words - the legacy CRTP actually provides better type safety than the templated EOP, which might be quite a compelling reason to actually avoid the latter in new code, even in a codebase with C++23 enabled.

main issues of SOUP and also other requirements from IEC62304: 1) SOUP validation procedures, especially if the SOUP is required to be validated for class C, are not strictly prescribed. In other words, if memory serves me correctly, the IEC standard says nothing about how you are supposed to perform validation activities on the SOUP. Do you test only the functions you use, or the whole package, and if the latter, how? Imagine you use numpy to perform matrix multiplications. What do you do to ensure that numpy is fit for purpose in your class C application? 2) I personally found myself unable to verify if currently open bugs on third party software were affecting us, because the vendor (Note: not an opensource vendor. A microcontroller, closed source vendor) refused to release information about currently open defects of their software and hardware. The consequence is that you are asked, as for IEC62304, unable to verify which standing issues in your third party products may affect your product. Eventually I managed to get them to release this information only to us, but it took *a lot* of effort.

Storing the offset and not the pointer is my know-how of the talk. Thank you.

Where can I see the source code for the emulator?

Thanks for uploading this. I've watched a bunch of videos around this and this is the one where it started to click for me :D

Very interesting talk, thanks. I have been trying to convert my Pi1541 code to run on a Pi Pico, a Cortex-M0 and need the fastest code possible. I have been viewing the disassembly of every instruction to see what the compiler generated and altering the C code to get the most efficient output. I am finding that macros still beat static inline functions. It will be interesting to test out the presenter's code/ideas and see how it compares to the generated assembly.

Amazing talk

Thanks!

About that switch/jump table and one predictable and one unpredictable jumps vs one unpredictable jump: I know about this technique thanks to Eli Bendersky blog. Search for article "Computed goto for efficient dispatch tables" from 2012. He has more articles about this. He claims 15-20% improvement for CPython interpreter.

7:40 On a Swedish keyboard, you need to hit alt-gr + the tilde key then n to get ñ, skipping the alt-gr gives "¨n" so this is more of a user/input error than a bug in Power Point

You could just use unsigned int as template parameter, solving problem with things like -1, and use static_assert to set range of number of bits

Hi

Midly usefil content starts at about 10:00. Before that, he's just trying to convince us that the speed is important.

This is such a good talk, the explanations are incredibly helpful and considerate as well! Explaining the ? operator as either use the value or return early with an error made a lot of sense to me. Thanks Mats.

I am confused as to why it is considered advisable to let people pass a writable reference to an unnamed variable -- that is what is happening when you forward a reference of any non-const reference of any kind (forwarding or simple reference, I mean) to a function that might write on it. The changes made to it would be unavailable to the calling function since the object has no name in its context with which to refer to the data so changed. While I thought this was a good tutorial, i would have appreciated an actual use in the context of a real program that benefits from this feature.

1:01:41 Michele Caini’s talk: kzbin.info/www/bejne/jXOYk4WBgKyFi80

17:27 (slide 45) this SoA approach could have been taken to an extreme, to have a separate array for each of {x, y, z, dx, dy, dz, hp}. That approach will also allow better chances of SIMD vectorization of calculations

On cppcon 2021 Eduardo Madrid gave a talk about capabilities of his ‘zoo’ library for writing nice-looking data oriented code: kzbin.info/www/bejne/h5PJl3qJnNh2mbM

On cppnow 2023 Floris Bob van Enzelingen gave a good talk about data oriented programming and writing libraries for them: kzbin.info/www/bejne/faCsgKGHetKLmNU

In cppnow 2023 Chandler Carruth gave a good talk about using the same approach for the Carbon lexer/parser: kzbin.info/www/bejne/kHqUamube8ybgM0

30:21 Mike Acton’s talk: kzbin.info/www/bejne/qImTeqeMerudfsU

I made a presentation multithreaded perf optimization where I discussed using Tracy, really great tool, and can be handy even for simple cpu bound examples. kzbin.info/www/bejne/gWSWdIN5hsh5Z5Ysi=3ivMrtLsyZCUkQZQ

This video clarified many things, thanks 😇😇

I appreciate the intuitive model for atomics, though I was a bit disappointed by the speaker showing shaky understanding of the atomics, which was leaking into the presentation and some takeaways. "memory_order_relaxed is most likely a bug" is simply not true. When two threads talk to each other by means of a single atomic variable (and nothing else) it is acceptable to use memory_order_relaxed. The phrase "last resort" also didn't make sense to me. I'm assuming they meant that we should use the safest things first, optimizing as we see fit, but that wasn't clear to me at first.

27:23 Can't agree more. I say "I hate code!" when I delete it, then feel happy for a couple of hours. This lecture is very useful for a vast majority of C++ users and should definitely have more than 3.3K views.

what does S( ) mean in f(S()), I don't remember a syntax like this for a C++ struct , what does it return? Thanks

So every time ZoneScoped appear in the code a new timer starts and every time it goes out of scope it's destructor stops the timer? And the results sends through a websocket?

Okej! Var på reservplats 29 och trodde att jag inte skulle finnas en chans att det skulle bli en ledig stol. 😞

its really good and very promising, tho I'd like to see dotnet support at least for c# project as premake and cmake does. that's crucial for game development ppl.