<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: tlahtinen</title><link>https://news.ycombinator.com/user?id=tlahtinen</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 18 Jun 2026 07:52:43 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=tlahtinen" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by tlahtinen in "Lore – Open source version control system designed for scalability"]]></title><description><![CDATA[
<p>This is a very promising announcement for Unreal game development specifically. For any other purpose I wouldn't care as much.<p>Perforce definitely needs a challenger. It is not the incumbent because it is particularily simple to use or administer. Git is actually way simpler when it comes to branching operations for example.<p>The reasons why p4 is often preferred in gamedev have already been mentioned in other comments: large project support, permissions, file locking and so on.
Another key reason p4 is the king for Unreal dev is just how well it's supported inside the engine. Not perfect, but it's the best supported VCS because it's what Epic uses. Even the Git plugin is painfully unfinished, because Epic does not internally use it. So with Lore I expect them to give it first class support. I'd recommend Git a lot more if the support in Unreal was better.<p>(background; I've been in gamedev for almost two decades now, 2-200 person companies, every kind of engine and version control system. I prefer git where I can use it: for Unreal that means small projects and/or tech savvy team members. Pick the tool that is right for the job and the team.)</p>
]]></description><pubDate>Wed, 17 Jun 2026 16:10:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=48572497</link><dc:creator>tlahtinen</dc:creator><comments>https://news.ycombinator.com/item?id=48572497</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48572497</guid></item><item><title><![CDATA[New comment by tlahtinen in "The pivot"]]></title><description><![CDATA[
<p>It's not out of the question.<p><a href="https://onlinelibrary.wiley.com/doi/full/10.1111/pce.14060" rel="nofollow">https://onlinelibrary.wiley.com/doi/full/10.1111/pce.14060</a>
<a href="https://www.livescience.com/planet-earth/plants/tropical-rainforests-could-get-too-hot-for-photosynthesis-and-die-if-climate-crisis-continues-scientists-warn" rel="nofollow">https://www.livescience.com/planet-earth/plants/tropical-rai...</a><p>And the planet may well have been warmer in the past, but the ecosystems had millions of years to adapt to it.</p>
]]></description><pubDate>Sat, 18 Oct 2025 00:48:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=45623834</link><dc:creator>tlahtinen</dc:creator><comments>https://news.ycombinator.com/item?id=45623834</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45623834</guid></item><item><title><![CDATA[New comment by tlahtinen in "Quicksort explained IKEA-style"]]></title><description><![CDATA[
<p>I'm a programmer (after a fashion) but I don't know how quicksort works.<p>This is how I understand it after reading these instructiöns, without looking up any further explanation:<p>1. Choose a random element as the 'center' point of the sort<p>2. That element defines the maximum 'height' (value)<p>3. Anything that is larger than that value, is moved to the right side of the 'center'<p>4. Anything that is smaller than that value, is moved to the left side of the center. After this, the array is partially sorted.<p>5. The sorting process is repeated on both 'sides' independently, picking a new random center element and so on<p>What isn't clear, is how often the process needs to be repeated, or when the algorithm 'knows' that the sorting has been finished - surely it can't be just three iterations?<p>By now I've already looked up how the algorithm actually works, but the above is what I got out of the illustration :)</p>
]]></description><pubDate>Wed, 24 Sep 2025 17:46:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=45363664</link><dc:creator>tlahtinen</dc:creator><comments>https://news.ycombinator.com/item?id=45363664</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45363664</guid></item></channel></rss>