SuperV1234

8 ms·

91.
by SuperV1234 7mo ago
Nah, many great features are extremely cheap. E.g. constexpr, templates, fold expressions, equality operator defaulting, concepts...
92.
by SuperV1234 7mo ago
I ran some more measurements using import std; with a properly built module that includes reflection. I first created the module via: g++ -std=c++26 -fmodules -freflection -fsearch-include-path -fmodule-only -c bits/std.cc And
93.
The hidden compile-time cost of C++26 reflection(vittorioromeo.com)
60 points by SuperV1234 7mo ago|42 comments
94.
by SuperV1234 11mo ago
This post completely misunderstands how to use exceptions and provides "solutions" that are error-prone to a problem that doesn't exist. And this is coming from someone that dislikes exceptions.
95.
by SuperV1234 1y ago
https://github.com/hanickadot/compile-time-regular-expressio...
96.
Building a lightweight ImGui profiler in ~500 lines of C++(vittorioromeo.com)
4 points by SuperV1234 1y ago|0 comments
97.
More Speed and Simplicity: Practical Data-Oriented Design in C++ – CppCon 2025 [video](youtube.com)
2 points by SuperV1234 1y ago|0 comments
98.
by SuperV1234 1y ago
Note that taking a 'const' by-value parameter is very sensible in some cases, so it is not something that could be detected as a typo by the C++ compiler in general.
99.
by SuperV1234 1y ago
This is not proof. What you said is not incorrect, but it doesn't prove that your software is fast because you applied small optimizations everywhere.
100.
by SuperV1234 1y ago
Level 4: switching to C++
101.
by SuperV1234 1y ago
But do you have actual proof for your first claim? Isn't it possible that the "constant vigilance" is optimizing that ~10% that doesn't really matter in the end?
102.
by SuperV1234 1y ago
> Is it because I made hundreds decisions like that? Yes. Proof needed. Perhaps your overall program is designed to be fast and avoid silly bottlenecks, and these "hundred decisions" didn't really matter at all.
103.
by SuperV1234 1y ago
This is just not true. There's nothing that makes C++ inherently slow to compile. PImpl doesn't need to have a performance hit as you can implement it with a local fixed-sized buffer that's not heap-allocated. You can also de
104.
by SuperV1234 1y ago
Location: Messina, Italy Remote: Yes Willing to relocate: No Technologies: Modern C++ (C++11/14/17/20/23), and the usual hodgepodge of languages/tools every senior engineer has encountered in ~15 years of real world
105.
by SuperV1234 1y ago
This is pretty cool! Could you compare your approach to the one taken in Majsdown? https://github.com/vittorioromeo/majsdown
106.
by SuperV1234 1y ago
Great marketing strategy (that's all it is).
107.
by SuperV1234 1y ago
C++ is not slow to compile. The Standard Library is.
108.
by SuperV1234 1y ago
Most of these features have been used by countless C++ developers for the past decades -- I really don't see the point in adopting a language that's mostly C++ but without some of the warts. Either pick C++ or something like Rust.
109.
How to break or continue from a lambda loop?(vittorioromeo.com)
2 points by SuperV1234 1y ago|0 comments
110.
by SuperV1234 1y ago
What language are you using? For a small number of objects, it should be completely insignificant to performance to recompute the whole A* algorithm every frame without any form of caching. I'm surprised...
111.
by SuperV1234 1y ago
Why? It's already there and the API doesn't look complicated.
112.
by SuperV1234 1y ago
Location: Sicily Remote: Yes Willing to relocate: No Technologies: C++ Résumé/CV: https://romeo.training/ Email: mail (at) vittorioromeo (dot) com Hi, I'm Vittorio Romeo — a passionate
113.
by SuperV1234 1y ago
What you want is 'yield' and generator coroutines. We have them in C++20, but their codegen is very poor compared to a manual implementation.
114.
by SuperV1234 1y ago
I've recently added autobatching to my SFML fork ( https://github.com/vittorioromeo/VRSFML/tree/bubble_idle ). Drawing multiple objects that use the same RenderStates will now be automatically coalesced in
115.
by SuperV1234 1y ago
CMake also needs this, badly...
116.
by SuperV1234 1y ago
Sorry, but I stuggle to see the point or the fun in this. Having strangers pick a binary choice with zero explanation or chance to provide context doesn't sound useful nor fun for neither the questioner nor the "jury". You al
117.
by SuperV1234 2y ago
This is a great PEP. Very similar to what I wanted to achieve with my P1819 for C++, back in 2019: https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2019/p18...
118.
Free performance: autobatching in my SFML fork(vittorioromeo.com)
2 points by SuperV1234 2y ago|0 comments
119.
AoS vs. SoA in practice: particle simulation – Vittorio Romeo(vittorioromeo.com)
2 points by SuperV1234 2y ago|0 comments
120.
Show HN: BubbleByte, Open-Source SFML Incremental/Idle Bubble-Popping Cat Game(store.steampowered.com)
2 points by SuperV1234 2y ago|0 comments

More ›