<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: borodi</title><link>https://news.ycombinator.com/user?id=borodi</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 25 Sep 2026 01:12:59 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=borodi" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by borodi in "Fearless SIMD v1.0"]]></title><description><![CDATA[
<p>LLVM has range flags and things like nnan that could in theory be used to replace a minimum intrinsic into a minimumnum (iirc x86 has a instruction for the latter but not the former) <a href="https://llvm.org/docs/LangRef.html#floating-point-min-max-intrinsics-comparison" rel="nofollow">https://llvm.org/docs/LangRef.html#floating-point-min-max-in...</a> I'm not sure if the optimizations use this but in theory they could</p>
]]></description><pubDate>Thu, 24 Sep 2026 20:05:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=49836117</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=49836117</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49836117</guid></item><item><title><![CDATA[New comment by borodi in "femtolisp: A lightweight, robust, scheme-like Lisp implementation"]]></title><description><![CDATA[
<p>Fun fact, Julia's parser and part of its compiler are implemented in femtolisp, and you can access it using a not so secret option in the Julia CLI.</p>
]]></description><pubDate>Mon, 23 Feb 2026 14:27:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=47122783</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=47122783</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47122783</guid></item><item><title><![CDATA[New comment by borodi in "rr – record and replay debugger for C/C++"]]></title><description><![CDATA[
<p>I havent tried Tsan with rr but msan and asan work quite well with it (it’s quite slow when doing this) but seeing the sanitizer trigger then following back what caused it to trigger is very useful.</p>
]]></description><pubDate>Sun, 21 Jul 2024 12:11:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=41024521</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=41024521</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41024521</guid></item><item><title><![CDATA[New comment by borodi in "rr – record and replay debugger for C/C++"]]></title><description><![CDATA[
<p>Chaos mode is an option when invoking rr that can expose some concurrency issues. Basically it switches which thread is executing a bunch to try and simulate multiple cores executing. It has found some race conditions for me but it’s of course limited</p>
]]></description><pubDate>Sun, 21 Jul 2024 11:45:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=41024391</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=41024391</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41024391</guid></item><item><title><![CDATA[New comment by borodi in "Exact binary vector search for RAG in 100 lines of Julia"]]></title><description><![CDATA[
<p>There is, it's called count_ones. Though I wouldn't be surprised if LLVM could maybe optimize some of these loops into a popcnt, but I'm sure it would be brittle</p>
]]></description><pubDate>Fri, 17 May 2024 22:49:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=40394882</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=40394882</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40394882</guid></item><item><title><![CDATA[New comment by borodi in "Std: Clamp generates less efficient assembly than std:min(max,std:max(min,v))"]]></title><description><![CDATA[
<p>So it was a bit more pervasive than this, the issue was that flushing subnormals (values very close to 0) to 0 is a register that gets set, so if a library is built with the fastmath flags and it gets loaded, it sets the register, causing the whole process to flush it's subnormals. i.e <a href="https://github.com/llvm/llvm-project/issues/57589">https://github.com/llvm/llvm-project/issues/57589</a></p>
]]></description><pubDate>Tue, 16 Jan 2024 15:41:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=39014527</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=39014527</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39014527</guid></item><item><title><![CDATA[New comment by borodi in "Julia 1.10"]]></title><description><![CDATA[
<p>btw, there has been a pretty nice effort of reimplementing the tidyverse in julia with <a href="https://github.com/TidierOrg/Tidier.jl">https://github.com/TidierOrg/Tidier.jl</a> and it seems to be quite nice to work with, if you were missing that from R at least</p>
]]></description><pubDate>Wed, 27 Dec 2023 18:50:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=38785153</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=38785153</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38785153</guid></item><item><title><![CDATA[New comment by borodi in "Julia as a unifying end-to-end workflow language on the Frontier exascale system"]]></title><description><![CDATA[
<p>LLVMs API is the c++ one. The C one while more stable also doesn't support everything. Keeping up with LLVM is annoying but it's not the source of bugs or anything of the sort. PS(it's not actually stable. Because if the c++ code it calls is removed it just gets removed from the C one)<p>I say this as one of the devs that usually do the work of keeping up the latest LLVM.</p>
]]></description><pubDate>Sun, 19 Nov 2023 14:47:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=38333090</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=38333090</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38333090</guid></item><item><title><![CDATA[New comment by borodi in "Data Processing benchmark featuring Rust, Go, Swift, Zig, Julia etc."]]></title><description><![CDATA[
<p>Julia follows semver, so code written in 1.0 should work on the latest release (packages notwithstanding)</p>
]]></description><pubDate>Wed, 11 Oct 2023 20:29:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=37849861</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=37849861</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37849861</guid></item><item><title><![CDATA[New comment by borodi in "Cthulhu.jl – show type-inferred Julia code"]]></title><description><![CDATA[
<p>It tries to show you the type information on the source itself, instead of on the IR.</p>
]]></description><pubDate>Thu, 07 Sep 2023 21:45:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=37426040</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=37426040</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37426040</guid></item><item><title><![CDATA[New comment by borodi in "PackagingCon – A conference only for software package management"]]></title><description><![CDATA[
<p>I do believe this is an issue of not having explicit dependencies. Julia takes the approach of, we build and ship everything for every OS, which means Pkg (the package manager) knows about binary dependencies as well. Making things more reproducible in language</p>
]]></description><pubDate>Wed, 09 Aug 2023 01:31:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=37057712</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=37057712</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37057712</guid></item><item><title><![CDATA[New comment by borodi in "Rust vs. Julia in scientific computing"]]></title><description><![CDATA[
<p>Julia does have really nice GPU support, being able to directly compile julia code  into CUDA, ROCm, Metal or other accelerators. (Being GPU code it's limited to a subset of the main language)</p>
]]></description><pubDate>Mon, 24 Jul 2023 15:37:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=36849710</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=36849710</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36849710</guid></item><item><title><![CDATA[New comment by borodi in "Building a Lox Interpreter in Julia"]]></title><description><![CDATA[
<p>You can try and build your own toy language for fun, or try to compile lox to some assembly/llvm ir.<p>Another option is to try and contribute to an existing language (Julia ;) ).</p>
]]></description><pubDate>Sat, 03 Jun 2023 19:00:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=36179523</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=36179523</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36179523</guid></item><item><title><![CDATA[New comment by borodi in "Julia 1.9"]]></title><description><![CDATA[
<p>We used the chromium snapshot file format (<a href="https://learn.microsoft.com/en-us/microsoft-edge/devtools-guide-chromium/memory-problems/heap-snapshot-schema" rel="nofollow">https://learn.microsoft.com/en-us/microsoft-edge/devtools-gu...</a>).
If firefox uses the same format then it should work, but I haven't tested.</p>
]]></description><pubDate>Wed, 10 May 2023 13:06:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=35886779</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=35886779</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=35886779</guid></item><item><title><![CDATA[New comment by borodi in "Mojo – a new programming language for AI developers"]]></title><description><![CDATA[
<p>I'm sure there are reasons for it, but Chris Lattner has been jumping around a bit. Remember swift4TF. 
But hopefully this one is seen through with lots of open source too.</p>
]]></description><pubDate>Tue, 02 May 2023 17:17:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=35790962</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=35790962</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=35790962</guid></item><item><title><![CDATA[New comment by borodi in "My Journey from R to Julia"]]></title><description><![CDATA[
<p>One interesting thing is that if julia can prove what types a function will be called with at compile time, it doesn't have to do dynamic dispatch, so it has no overhead. It's what the julia folks call type-stable code</p>
]]></description><pubDate>Sun, 29 Jan 2023 12:08:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=34567349</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=34567349</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=34567349</guid></item><item><title><![CDATA[New comment by borodi in "What's Great about Julia?"]]></title><description><![CDATA[
<p>That's one of the cool things about Julia. If it can prove the types of the arguments to a function, or at least reduce them to a small set. It can do the dispatch at compile time.<p>Well, Julia has better than semi decent support for generics, since every function is by definition a generic.</p>
]]></description><pubDate>Thu, 08 Dec 2022 10:56:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=33906563</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=33906563</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=33906563</guid></item><item><title><![CDATA[New comment by borodi in "I over-engineered a Fast Fourier Transform for Arduino"]]></title><description><![CDATA[
<p>Veritasium has a recent video that goes into the algorithm a little bit. So does 3blue1brown. But basically anything that processes signals digitally will probably use the FFT somewhere. But even outside of that, you can use it for some kinds of matrixes in linear algebra and probably many other places :)</p>
]]></description><pubDate>Fri, 25 Nov 2022 14:56:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=33742921</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=33742921</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=33742921</guid></item><item><title><![CDATA[New comment by borodi in "The German School of Lisp (2011)"]]></title><description><![CDATA[
<p>Julia has many of the features one expects of a lisp. But it has a more "normal" syntax</p>
]]></description><pubDate>Sat, 12 Nov 2022 18:09:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=33575461</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=33575461</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=33575461</guid></item><item><title><![CDATA[New comment by borodi in "Ask HN: Why do you hate (or love!?) your language's package manager?"]]></title><description><![CDATA[
<p>SemVer is very important for me. 
If the language has binary dependencies the package manager should also handle them. Depending on the system for them leads to hard to debug issues. 
An easy way to reproduce environments is also important via a toml file or something similar.</p>
]]></description><pubDate>Sat, 29 Oct 2022 15:16:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=33384760</link><dc:creator>borodi</dc:creator><comments>https://news.ycombinator.com/item?id=33384760</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=33384760</guid></item></channel></rss>