<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: SuperV1234</title><link>https://news.ycombinator.com/user?id=SuperV1234</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 11 Jul 2026 21:58:19 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=SuperV1234" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by SuperV1234 in "My thoughts on the Bun Rust rewrite"]]></title><description><![CDATA[
<p>> The main problem, however, was code quality.<p>> The sleight of hand misdirects the reader away from the main way bugs are eliminated: by dedicating engineering resources to it.<p>Perhaps the amount of bugs comes from using a C-like language that requires meticulous manual care to avoid writing runtime bugs.<p>Even C++ would be a safer choice because of RAII.<p>When you have to dedicate significant resources to avoid/fix runtime issues that are made impossible at compile time by other languages, the programmer isn't entirely at fault.</p>
]]></description><pubDate>Thu, 09 Jul 2026 11:04:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=48843928</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48843928</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48843928</guid></item><item><title><![CDATA[New comment by SuperV1234 in "LLMs are eroding my software engineering career and I don't know what to do"]]></title><description><![CDATA[
<p>Is that all that Mythos did?<p>Did it find any real potential issue, optimization/simplification opportunities, or sparked any thought-provoking discussion within your organization?<p>Or was it purely a net negative experience?</p>
]]></description><pubDate>Sun, 07 Jun 2026 14:08:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=48435029</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48435029</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48435029</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Gemma 4 12B: A unified, encoder-free multimodal model"]]></title><description><![CDATA[
<p>How does this compare to frontier models?</p>
]]></description><pubDate>Wed, 03 Jun 2026 19:02:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=48388320</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48388320</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48388320</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Every Byte Matters"]]></title><description><![CDATA[
<p>Data Oriented Design rocks. It was the subject for my CppCon 2025 keynote: <a href="https://youtube.com/watch?v=SzjJfKHygaQ" rel="nofollow">https://youtube.com/watch?v=SzjJfKHygaQ</a></p>
]]></description><pubDate>Wed, 03 Jun 2026 14:47:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=48384860</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48384860</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48384860</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Please Use AI"]]></title><description><![CDATA[
<p>It's not that simple.<p>The grandma that would have phoned her nephew to fix the phone will still do the same thing now. She will not have magically switched to querying LLMs after a lifetime of technological illiteracy.<p>The tech-savvy person that uses AI today would have been more than capable than figuring out how to fix their router by using Google even without prior networking skills/experience 5-10 years ago.<p>Using AI to solve these problems is a novelty for a specific subset of the population. And the topic <i>does</i> matter.<p>Even the somewhat tech-illiterate mom would have been able to Google a recipe 10 years ago, or watch an Instagram reel 5 years ago. They were surely not going to call their friends to ask instructions on how to make an apple pie.<p>Pretending this is an AI novelty is indeed disingeneous.</p>
]]></description><pubDate>Fri, 29 May 2026 15:50:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=48324780</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48324780</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48324780</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Please Use AI"]]></title><description><![CDATA[
<p>How'd you infer that I don't find AI useful from my statement? Of course I do.
I am merely saying that the argumentation in the "poem" is not specific to AI.</p>
]]></description><pubDate>Fri, 29 May 2026 15:40:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=48324620</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48324620</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48324620</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Please Use AI"]]></title><description><![CDATA[
<p>And if my router wasn't working 5 years ago, I would have first used a search engine and tried to figure it out on my own.<p>Pretending it's an AI novelty is... disingenuous.</p>
]]></description><pubDate>Fri, 29 May 2026 15:27:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=48324386</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48324386</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48324386</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Please Use AI"]]></title><description><![CDATA[
<p>I found this quite cringy and an attempt at pulling at one's heartstrings due to the lack of a strong argumentation.<p>I wouldn't have called a friend for a meal plan or to figure out a hiking path 10 years ago, I would have used a search engine.<p>If I want to talk to a friend, I don't need an excuse to do so. And I'm not going to waste their time by asking something I can easily figure out on my own, today with AI, years ago with Google, and prior to that with printed material.<p>The anti-AI craze is just as bad as the "AI will solve everything" crowd.</p>
]]></description><pubDate>Fri, 29 May 2026 15:06:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=48324036</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48324036</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48324036</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Ripgrep AI Policy"]]></title><description><![CDATA[
<p>Finally, a sane policy.</p>
]]></description><pubDate>Thu, 28 May 2026 13:52:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=48308981</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48308981</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48308981</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Neoclassical C++: segmented iterators revisited"]]></title><description><![CDATA[
<p>Very interesting, this is the first time I hear about segmented iterators and hierarchical algorithms.<p>I faced a similar issue myself when implementing a chunked vector a la `std::deque`, but opted for callback-based internal iteration, i.e.<p><pre><code>    void ChunkedVector::forEach(auto&& f)
    {
        for (auto& chunk : chunks)
            for (auto& item : chunk) 
                if (f(item) == ControlFlow::Break)
                    return;
    }
</code></pre>
Where `ControlFlow` is just:<p><pre><code>    enum class [[nodiscard]] ControlFlow : bool
    {
        Continue,
        Break
    };
</code></pre>
This is massively simpler to implement, and can model simpler algorithms such as `for_each`, `fill`, `transform`, `count`, `accumulate`.<p>It's sometimes inferior in terms of ergonomics, and cannot express more complicated algorithms or iteration patterns (e.g. partial range, going backwards), but so far it has served me well.<p>Just something to consider if implementation simplicity is the priority and there's no need for a very generic suite of algorithms.</p>
]]></description><pubDate>Sun, 24 May 2026 10:52:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=48256212</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48256212</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48256212</guid></item><item><title><![CDATA[New comment by SuperV1234 in ".NET (OK, C#) finally gets union types"]]></title><description><![CDATA[
<p>Boxed, and needs complex incantations to avoid the boxing. Meh.</p>
]]></description><pubDate>Sat, 23 May 2026 22:36:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=48252270</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48252270</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48252270</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Cost of enum-to-string: C++26 reflection vs. the old ways"]]></title><description><![CDATA[
<p>That's a strange dismissal. `Optional<T>` isn't "perceived" safety -- it eliminates a whole category of bugs (null dereferences, uninitialized reads) at the type-system level, with zero runtime overhead versus a raw pointer or sentinel value.<p>If you think that's uninteresting, that's an aesthetic preference, not a technical argument.<p>But let's set that aside, because it's also irrelevant to the compile-time claim.<p>The point of the example wasn't "look at this fascinating class," it was "here is a real template, used 911 times across the codebase, in a public header -- exactly the scenario you said would be slow -- and it costs under 1ms per instantiation."<p>You can swap `Optional` for any non-trivial template of similar complexity and the numbers will look similar.<p>On your 1 MLOC/sec benchmark: that's a fair reference point for C-like code, but it's not the right yardstick for template instantiation, which is doing semantic work (overload resolution, SFINAE, constraint checking) that a C compiler simply isn't.<p>Comparing them is comparing different jobs.<p>The honest question is whether template compilation is slow relative to what it's actually doing, and in well-structured code, it isn't.<p>And yes, `Optional.hpp` is a header -- that's the whole point of the demonstration. I'm not claiming you should hide every template in a .cpp file. I'm claiming that even templates in headers, instantiated hundreds of times, are cheap when written with compile times in mind.<p>The "put templates in .cpp where it makes sense" advice is for the specific cases, not a blanket rule.</p>
]]></description><pubDate>Thu, 14 May 2026 22:13:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=48141968</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48141968</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48141968</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Cost of enum-to-string: C++26 reflection vs. the old ways"]]></title><description><![CDATA[
<p>So? The original argument was about the "ugly" syntax that the user didn't want to interact with nor read. I proved that there's no need to do so to consume reflection utils.</p>
]]></description><pubDate>Thu, 14 May 2026 17:16:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=48138246</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48138246</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48138246</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Cost of enum-to-string: C++26 reflection vs. the old ways"]]></title><description><![CDATA[
<p>Alright, I'll bite.<p>This is my `sf::base::Optional<T>` template class, a lightweight replacement for `std::optional` with same semantics:
<a href="https://github.com/vittorioromeo/VRSFML/blob/master/include/SFML/Base/Optional.hpp" rel="nofollow">https://github.com/vittorioromeo/VRSFML/blob/master/include/...</a><p>This is what ClangBuildAnalyzer reports:<p><pre><code>  **** Template sets that took longest to instantiate:
     833 ms: sf::base::Optional<$> (911 times, avg 0 ms)
</code></pre>
Each individual instantiation of this class is sub 1ms.
Including the header itself takes 3ms.<p>I'm sure I can optimize it even further if I wanted to.<p>---<p>Now to refute your other incorrect claims:<p>> The point of templates is generic programming, reusable components.<p>That's ONE use case. A more general use case is just reducing code repetition in a type-safe manner, which is extremely useful even within the same translation unit. Another use case is metaprogramming. And I'm sure I can come up with more. Templates are a versatile tool.<p>> And if you have to "selectively pick TUs where they're instantiated", you're basically admitting that you have to invest effort to reduce compile times.<p>...well, yeah? Of course you have to put in effort to reduce compile times. That doesn't undermine my point at all.<p>C++ templates are not slow to compile.</p>
]]></description><pubDate>Thu, 14 May 2026 14:46:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=48136192</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48136192</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48136192</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Rewrite Bun in Rust has been merged"]]></title><description><![CDATA[
<p>I'm bullish on LLM-assisted development but this is just a very stupid way of performing such a critical migration.</p>
]]></description><pubDate>Thu, 14 May 2026 13:48:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=48135335</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48135335</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48135335</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Cost of enum-to-string: C++26 reflection vs. the old ways"]]></title><description><![CDATA[
<p>That's just false. Templates are not slow to compile at all, and you can selectively pick TUs where they're instantiated.<p>My entire VRSFML codebase compiles from scratch in ~4s and I liberally use C++ features, I just avoid the Standard Library most of the time.<p>Templates are not inherently slow, people just don't know how to use them and don't know how to control instantiation.<p>Most people still think that templates have to go in header files, which is also just plainly false.</p>
]]></description><pubDate>Thu, 14 May 2026 13:20:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=48135022</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48135022</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48135022</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Cost of enum-to-string: C++26 reflection vs. the old ways"]]></title><description><![CDATA[
<p>This is a myth, C++ is not inherently slow to compile. It's the standard library that is very bloated and the main culprit for slow compilation.</p>
]]></description><pubDate>Thu, 14 May 2026 09:44:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=48133136</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48133136</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48133136</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Cost of enum-to-string: C++26 reflection vs. the old ways"]]></title><description><![CDATA[
<p>Utter BS. Compilation times matter for productivity, developer motivation, iteration speed, CI turnaround time, and so on.<p>I'm sure you wouldn't say "it doesn't matter how long it takes to compile" it if took <i>days</i>. So where do you draw the line? Regardless, it matters.</p>
]]></description><pubDate>Thu, 14 May 2026 09:44:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=48133130</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48133130</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48133130</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Cost of enum-to-string: C++26 reflection vs. the old ways"]]></title><description><![CDATA[
<p>No, it objectively isn't objective.</p>
]]></description><pubDate>Thu, 14 May 2026 09:41:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=48133108</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48133108</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48133108</guid></item><item><title><![CDATA[New comment by SuperV1234 in "Cost of enum-to-string: C++26 reflection vs. the old ways"]]></title><description><![CDATA[
<p>Package? We're suggesting to copy paste 5 lines and stick them into a header.</p>
]]></description><pubDate>Thu, 14 May 2026 09:40:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=48133105</link><dc:creator>SuperV1234</dc:creator><comments>https://news.ycombinator.com/item?id=48133105</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48133105</guid></item></channel></rss>