<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>JDK 24 on miti99</title><link>https://miti99.com/en/tags/jdk-24/</link><description>Recent content in JDK 24 on miti99</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 16 Nov 2026 17:39:19 +0700</lastBuildDate><atom:link href="https://miti99.com/en/tags/jdk-24/index.xml" rel="self" type="application/rss+xml"/><item><title>Newsletter #28</title><link>https://miti99.com/en/post/2025/05/15/</link><pubDate>Thu, 15 May 2025 00:00:00 +0700</pubDate><guid>https://miti99.com/en/post/2025/05/15/</guid><description>&lt;p&gt;&lt;em&gt;Enjoy Newsletter #28.&lt;/em&gt;&lt;/p&gt;
&lt;h2 id="how-airbnb-measures-listing-lifetime-value"&gt;&lt;a href="https://medium.com/airbnb-engineering/how-airbnb-measures-listing-lifetime-value-a603bf05142c" rel="noopener noreferrer"&gt;How Airbnb Measures Listing Lifetime Value&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Airbnb&amp;rsquo;s Data Science team introduces their framework for measuring Listing Lifetime Value (LTV) on a two-sided marketplace where many hosts and guests interact simultaneously. The framework builds on three metrics. &lt;em&gt;Baseline LTV&lt;/em&gt; is the total booking value a listing is expected to generate over the next 365 days, predicted via machine learning from features like calendar availability, nightly price, location, and host tenure, then discounted to present value. &lt;em&gt;Incremental LTV&lt;/em&gt; subtracts marketplace cannibalization from Baseline LTV—accounting for bookings that would have gone to another Airbnb listing if the new listing didn&amp;rsquo;t exist. Finally, &lt;em&gt;Marketing Incremental LTV&lt;/em&gt; isolates the additional value genuinely driven by Airbnb&amp;rsquo;s own host-acquisition campaigns.&lt;/p&gt;
&lt;p&gt;Putting this into production required solving three tough challenges. First, ground-truth labels take a full 365 days to mature, making models vulnerable to sudden market shifts like COVID-19; the team shortened training windows, added fine-grained geospatial features, and migrated to LightGBM. Second, true marketplace incrementality is never directly observable, so they estimate an economic production function modeling how total supply and demand in each local market segment combine to produce bookings—in high-demand, supply-constrained markets, adding a new listing generates far more incremental value. Third, to reduce early prediction uncertainty, the model dynamically updates LTV estimates daily as real booking signals roll in.&lt;/p&gt;
&lt;h2 id="six-jdk-24-features-you-should-know-about"&gt;&lt;a href="https://foojay.io/today/six-jdk-24-features-you-should-know-about/" rel="noopener noreferrer"&gt;Six JDK 24 Features You Should Know About&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Simon Ritter (Azul) highlights six standout features in JDK 24, released on March 18, 2025 with 24 JEPs—the largest feature count of any release since Java switched to its six-month release cadence. JEP 483, from Project Leyden, pre-loads and links application classes at build time on top of Application Class Data Sharing so they are ready immediately on JVM startup, cutting warmup time. JEP 485 (Stream Gatherers) finalizes the &lt;code&gt;Gatherer&lt;/code&gt; interface so developers can build custom intermediate &lt;code&gt;Stream&lt;/code&gt; operations, much like &lt;code&gt;Collector&lt;/code&gt; enables custom terminal operations. JEP 491 removes a major virtual-thread footgun: previously, blocking inside a &lt;code&gt;synchronized&lt;/code&gt; block &amp;ldquo;pinned&amp;rdquo; the underlying platform carrier thread because monitors were owned by carrier threads; now, monitors are associated directly with virtual threads.&lt;/p&gt;
&lt;p&gt;The other three JEPs focus on platform cleanup and security modernization. JEP 486 permanently disables the &lt;code&gt;SecurityManager&lt;/code&gt;, which was deprecated in JDK 17 and is rarely used to protect modern server-side code; any legacy applications still relying on it will need architectural changes before upgrading. JEP 498 causes the JVM to emit a runtime warning the first time any memory-access method in &lt;code&gt;sun.misc.Unsafe&lt;/code&gt; is called, nudging libraries toward &lt;code&gt;VarHandle&lt;/code&gt; and the Foreign Function &amp;amp; Memory API. Finally, JEP 501 deprecates the 32-bit x86 port for removal (Linux was the last remaining 32-bit x86 port after Windows 32-bit was removed in JDK 21). It&amp;rsquo;s a handy checklist as teams prepare for JDK 25, the next LTS release.&lt;/p&gt;
&lt;h2 id="javaone-2025-function-and-memory-access-in-pure-java"&gt;&lt;a href="https://www.infoq.com/news/2025/04/foreign-function-minborg/" rel="noopener noreferrer"&gt;JavaOne 2025: Function and Memory Access in Pure Java&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;This InfoQ report covers Per-Åke Minborg&amp;rsquo;s (Oracle) JavaOne 2025 presentation on the Foreign Function &amp;amp; Memory API (FFM, JEP 454), finalized in JDK 22 under Project Panama as a modern replacement for JNI. As Minborg explained, JNI forces developers to stitch Java and C together in a brittle, high-maintenance workflow with clunky data marshaling, support limited to primitives and Java objects, no deterministic off-heap memory deallocation, and a ~2 GB addressing limit on &lt;code&gt;ByteBuffer&lt;/code&gt;. Community alternatives like JNA, JNR, and JavaCPP tried to bridge the gap over the years, but none became a universal standard.&lt;/p&gt;
&lt;p&gt;On the memory side, &lt;code&gt;MemorySegment&lt;/code&gt; models a contiguous region of 64-bit addressable memory with spatial bounds checks, temporal checks against use-after-free, and thread-confinement enforcement. Memory lifecycles are managed deterministically via &lt;code&gt;Arena&lt;/code&gt; across four flavors: Global, Auto, Confined, and Shared. &lt;code&gt;ValueLayout&lt;/code&gt; and &lt;code&gt;MemoryLayout&lt;/code&gt; describe structured off-heap data so you can derive strongly typed &lt;code&gt;VarHandle&lt;/code&gt; accessors instead of calculating raw byte offsets by hand—and declaring those &lt;code&gt;VarHandle&lt;/code&gt; instances &lt;code&gt;static final&lt;/code&gt; is critical for JIT inlining and peak performance. On the function side, the &lt;code&gt;jextract&lt;/code&gt; tool automatically generates Java bindings directly from native C header files, letting Java code call C functions like &lt;code&gt;qsort&lt;/code&gt; directly. In short, FFM delivers safe, high-performance off-heap memory access and native function calls in pure Java without writing or maintaining a single line of C glue code.&lt;/p&gt;
&lt;h2 id="ultimate-guide-to-project-reactor-thread-locals-and-context-propagation"&gt;&lt;a href="https://4comprehension.com/ultimate-guide-to-project-reactor-thread-locals-and-context-propagation/" rel="noopener noreferrer"&gt;Ultimate Guide to Project Reactor, Thread-Locals and Context Propagation&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Grzegorz Piwowarek explains why context propagation is notoriously tricky in Project Reactor. A &lt;code&gt;ThreadLocal&amp;lt;X&amp;gt;&lt;/code&gt; is conceptually a &lt;code&gt;Map&amp;lt;Thread, X&amp;gt;&lt;/code&gt;, whereas a reactive pipeline can hop across threads at any &lt;code&gt;publishOn()&lt;/code&gt; or &lt;code&gt;subscribeOn()&lt;/code&gt; boundary, leaving thread-local values behind. Reactor&amp;rsquo;s native solution is its immutable &lt;code&gt;Context&lt;/code&gt;: you write values downstream-to-upstream via &lt;code&gt;contextWrite()&lt;/code&gt; and read them inside the pipeline by replacing &lt;code&gt;map()&lt;/code&gt; with &lt;code&gt;flatMap()&lt;/code&gt; + &lt;code&gt;Mono.deferContextual()&lt;/code&gt;. Piwowarek also points out a simple rule of thumb: if you already have the value before assembling the reactive pipeline, just capture it in a normal lexical variable instead of overcomplicating things with &lt;code&gt;Context&lt;/code&gt;.&lt;/p&gt;
&lt;p&gt;The harder challenge is integrating with third-party libraries that expect classic &lt;code&gt;ThreadLocal&lt;/code&gt; state, such as SLF4J&amp;rsquo;s &lt;code&gt;MDC&lt;/code&gt; for structured logging: you have to restore the value into &lt;code&gt;MDC&lt;/code&gt; right before each operator lambda executes and clear it afterward, which can be wrapped cleanly using the execute-around pattern in a helper like &lt;code&gt;withMDC()&lt;/code&gt;. For side-effect operators like &lt;code&gt;doOnNext()&lt;/code&gt; that don&amp;rsquo;t expose &lt;code&gt;Context&lt;/code&gt; directly, you can switch to &lt;code&gt;doOnEach()&lt;/code&gt;, filter for &lt;code&gt;onNext&lt;/code&gt; signals, and read the context from the &lt;code&gt;Signal&lt;/code&gt; object. Finally, Reactor supports automatic context propagation: by adding &lt;code&gt;io.micrometer:context-propagation&lt;/code&gt;, calling &lt;code&gt;Hooks.enableAutomaticContextPropagation()&lt;/code&gt;, and registering a &lt;code&gt;ThreadLocalAccessor&lt;/code&gt;, Reactor automatically snapshots and restores thread-local values across operator boundaries. While convenient, this global JVM hook adds runtime overhead to every reactive pipeline in the process, so weigh the trade-off carefully.&lt;/p&gt;
&lt;h2 id="jdk-24-g1parallelserial-gc-changes"&gt;&lt;a href="https://tschatzl.github.io/2025/04/01/jdk24-g1-serial-parallel-gc-changes.html" rel="noopener noreferrer"&gt;JDK 24 G1/Parallel/Serial GC Changes&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Thomas Schatzl (Oracle) rounds up the improvements to HotSpot&amp;rsquo;s stop-the-world garbage collectors—G1, Parallel, and Serial—in JDK 24. In Parallel GC, redundant synchronization operations inside the object evacuation loop were removed (JDK-8269870), while Serial GC received ongoing code cleanup and refactoring. The most impactful changes landed in G1: to meet pause-time targets, G1 predicts internal operation costs like object copying and reference updating, but its initial default estimates had been calibrated years ago on an old SPARC machine and were overly conservative, causing G1 to take around 30 GC cycles to adapt to modern hardware. With JDK-8343189, the very first real runtime measurement immediately overrides the static default, allowing G1 to adapt dramatically faster at the slight risk of exceeding pause targets during the first couple of collections. Additionally, G1 now manages the remembered set for the entire young generation as a single unified structure (JDK-8336086), reducing duplication and saving native memory.&lt;/p&gt;
&lt;p&gt;Schatzl also previews the JDK 25 roadmap: merging remembered sets across old-generation regions (JDK-8343782) is already integrated, and G1&amp;rsquo;s write barrier has been redesigned from the ground up, promising up to 10% higher throughput, shorter pauses, and cleaner JIT-compiled code in exchange for a static memory overhead of roughly 0.2% of the heap size. Ongoing discussions also include bringing ZGC-style Automatic Heap Sizing to G1/Parallel/Serial with contributions from Microsoft and Google, as well as making G1 the true default collector even on small-memory containers where HotSpot currently falls back to Serial GC.&lt;/p&gt;
&lt;h2 id="making-makefiles-for-fun-and-profit"&gt;&lt;a href="https://dev.to/aws/making-makefiles-for-fun-and-profit-kl6" rel="noopener noreferrer"&gt;Making Makefiles for fun and profit&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Darko Mesaroš (AWS) revisits &lt;code&gt;make&lt;/code&gt;, the 48-year-old build automation tool created by Stuart Feldman so programmers wouldn&amp;rsquo;t keep debugging stale binaries after forgetting to recompile a modified file. Unlike a naive &lt;code&gt;build.sh&lt;/code&gt; script that recompiles everything from scratch, &lt;code&gt;make&lt;/code&gt; tracks file modification timestamps and rebuilds only what changed. Mesaroš dissects a classic C &lt;code&gt;Makefile&lt;/code&gt;: variables (which &lt;code&gt;make&lt;/code&gt; calls macros), the default &lt;code&gt;all&lt;/code&gt; target, link rules using automatic variables like &lt;code&gt;$@&lt;/code&gt; and &lt;code&gt;$^&lt;/code&gt;, pattern rules like &lt;code&gt;%.o: %.c&lt;/code&gt; for compiling individual source files, a &lt;code&gt;clean&lt;/code&gt; target, and &lt;code&gt;.PHONY&lt;/code&gt; declarations so targets still run even if a file of the same name exists in the directory.&lt;/p&gt;
&lt;p&gt;The second half shows how &lt;code&gt;make&lt;/code&gt; shines far beyond C projects: wrapping Terraform workflows with OS detection and interactive confirmation prompts before running &lt;code&gt;terraform destroy&lt;/code&gt;, spinning up local Docker development environments with Postgres and Redis for a Rust service, orchestrating a polyglot TypeScript + Rust AWS CDK project with targets for installing, building, deploying individual stacks, and testing locally against DynamoDB Local, and deploying a Hugo static site to S3 and AWS Amplify. To get past &lt;code&gt;make&lt;/code&gt;&amp;rsquo;s famously arcane syntax, Mesaroš uses the Amazon Q Developer CLI to generate &lt;code&gt;Makefile&lt;/code&gt; rules—even dynamically querying the Amplify App ID via the AWS CLI. It&amp;rsquo;s a fun reminder that battle-tested Unix tools are still worth learning, especially when AI assistants remove the initial syntax friction.&lt;/p&gt;
&lt;h2 id="improving-pinterest-search-relevance-using-large-language-models"&gt;&lt;a href="https://medium.com/pinterest-engineering/improving-pinterest-search-relevance-using-large-language-models-4cd938d4e892" rel="noopener noreferrer"&gt;Improving Pinterest Search Relevance Using Large Language Models&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Pinterest&amp;rsquo;s engineering team shares how they used large language models (LLMs) to improve search relevance—measuring how well a Pin actually satisfies a user&amp;rsquo;s search query rather than relying purely on historical click engagement. Their &amp;ldquo;teacher&amp;rdquo; model is a cross-encoder that takes the search query alongside a rich text representation of a Pin, fine-tuned on human-labeled relevance ratings as a multi-class classification task. Because Pins are primarily visual, the team enriches each Pin&amp;rsquo;s text from multiple sources: title and description, synthetic image captions generated by a BLIP vision-language model, top historically engaged search queries, user board titles where the Pin was saved, and linked web page titles. Offline evaluations showed that a fine-tuned Llama-3-8B model (using QLoRA) outperformed multilingual BERT by 12.5% and the production baseline by 19.7% in accuracy.&lt;/p&gt;
&lt;p&gt;Because serving an 8B-parameter LLM directly on every search request is too slow and expensive, Pinterest uses knowledge distillation: the teacher LLM labels billions of query-Pin pairs offline each day to train a lightweight &amp;ldquo;student&amp;rdquo; model that combines precomputed embeddings (SearchSAGE, PinSAGE, visual embeddings) with lexical match features like BM25. Thanks to the multilingual teacher model, the student generalizes well even to languages and countries with zero human-labeled training data. In online A/B tests, the distilled model improved relevance by 2.18% in nDCG@20 and boosted overall search fulfillment rate by over 1.5%. Future work includes direct real-time LLM serving, native vision-language models, and active learning.&lt;/p&gt;
&lt;hr&gt;
&lt;p&gt;&lt;em&gt;This post was rewritten by Claude Code with Opus 5.5 on 27/09/2026; reviewed and edited by Codex with GPT 6.1 Sol on 09/11/2026, and re-verified by Claude Code with Sonnet 5.5 on 16/11/2026.&lt;/em&gt;&lt;/p&gt;</description></item><item><title>Newsletter #20</title><link>https://miti99.com/en/post/2025/05/07/</link><pubDate>Wed, 07 May 2025 00:00:00 +0700</pubDate><guid>https://miti99.com/en/post/2025/05/07/</guid><description>&lt;p&gt;&lt;em&gt;Enjoy Newsletter #20.&lt;/em&gt;&lt;/p&gt;
&lt;h2 id="performance-improvements-in-jdk-24"&gt;&lt;a href="https://inside.java/2025/03/19/performance-improvements-in-jdk24/" rel="noopener noreferrer"&gt;Performance Improvements in JDK 24&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;This Inside.java article rounds up the most notable performance improvements in JDK 24 over JDK 23, organized by JDK bug tracker issue. In the core libraries, bulk operations in the Foreign Function &amp;amp; Memory API such as &lt;code&gt;MemorySegment::fill&lt;/code&gt;, &lt;code&gt;copy&lt;/code&gt;, and &lt;code&gt;mismatch&lt;/code&gt; are now handled in pure Java when memory segments are small enough, avoiding the overhead of transitioning to native code via &lt;code&gt;Unsafe&lt;/code&gt;. String concatenation now uses cacheable, reusable hidden classes instead of constructing chains of intermediate &lt;code&gt;MethodHandle&lt;/code&gt; combinators; SHA3 digests are up to 27% faster by reducing conversions between &lt;code&gt;byte&lt;/code&gt; and &lt;code&gt;long&lt;/code&gt; arrays; and internal migrations to the new Class-File API have been tuned to minimize startup overhead.&lt;/p&gt;
&lt;p&gt;At the runtime layer, JEP 491 allows virtual threads blocked inside a &lt;code&gt;synchronized&lt;/code&gt; block to unmount from their carrier thread rather than pinning it, significantly improving scalability for code that uses &lt;code&gt;synchronized&lt;/code&gt;. &lt;code&gt;String::indexOf&lt;/code&gt; is roughly 1.3x faster on x64 platforms with AVX2. JEP 483 (Ahead-of-Time Class Loading &amp;amp; Linking), the first deliverable from Project Leyden, uses an AOT cache to cut startup time by around 42% in the article&amp;rsquo;s benchmark. JEP 450 introduces experimental 8-byte compact object headers, reducing memory footprint by 10–20% on typical workloads. Finally, the RISC-V port gained several new intrinsics including CRC32, Adler32, string comparison optimizations, and byte-reversal operations.&lt;/p&gt;
&lt;h2 id="clean-your-memory-from-finalize-to-cleaner"&gt;&lt;a href="https://blog.frankel.ch/java-cleaner/" rel="noopener noreferrer"&gt;Clean your Memory: From Finalize to Cleaner&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Stefano Fago explains that Java&amp;rsquo;s garbage collector (GC) only manages heap memory and does not automatically release external resources like sockets or file handles; mismanaging them can lead to resource leaks, gradual slowdowns, or crashes. The old approach was overriding &lt;code&gt;finalize()&lt;/code&gt;, which has been deprecated because its execution timing is unpredictable, objects require at least one extra GC cycle to be reclaimed, accidental object resurrection can cause leaks, and the dedicated Finalizer thread is prone to contention. Its replacement is the &lt;code&gt;Cleaner&lt;/code&gt; API, introduced in Java 9: under the hood, it uses &lt;code&gt;PhantomReference&lt;/code&gt; and a background daemon thread while hiding the complexity of raw reference queues. You register an object alongside a cleanup action, and once the object becomes phantom-reachable, that action is enqueued to run on the background thread.&lt;/p&gt;
&lt;p&gt;&lt;code&gt;Cleaner&lt;/code&gt; pairs well with &lt;code&gt;AutoCloseable&lt;/code&gt;: the &lt;code&gt;close()&lt;/code&gt; method invokes &lt;code&gt;clean()&lt;/code&gt; for immediate deterministic cleanup, while the &lt;code&gt;Cleaner&lt;/code&gt; acts as a safety net. Even so, Fago stresses that &lt;code&gt;Cleaner&lt;/code&gt; should only be a fallback when resources cannot be released via &lt;code&gt;try-with-resources&lt;/code&gt; or an explicit &lt;code&gt;close()&lt;/code&gt; call, since cleanup is asynchronous and carries background-thread overhead. When writing a cleanup action, avoid lambdas that capture fields through &lt;code&gt;this&lt;/code&gt;, as doing so accidentally keeps a strong reference to the very object you want collected; cleanup logic should also be short and non-blocking, since multiple actions may share the same &lt;code&gt;Cleaner&lt;/code&gt; thread pool.&lt;/p&gt;
&lt;h2 id="5-hidden-git-tips-for-java-developers"&gt;&lt;a href="https://www.azul.com/blog/5-hidden-git-tips-for-java-developers/" rel="noopener noreferrer"&gt;5 Hidden Git Tips for Java Developers&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;On the Azul blog, Luqman Saeed walks through five underappreciated Git features beyond the everyday &lt;code&gt;commit&lt;/code&gt;, &lt;code&gt;push&lt;/code&gt;, and &lt;code&gt;pull&lt;/code&gt; trio, with examples tailored to Java projects. First is &lt;code&gt;git bisect&lt;/code&gt;: when you don&amp;rsquo;t know which commit introduced a bug, you mark the current commit as bad (&lt;code&gt;git bisect bad&lt;/code&gt;) and an older working commit as good (&lt;code&gt;git bisect good &amp;lt;commit-hash&amp;gt;&lt;/code&gt;), and Git performs a binary search by checking out midpoint commits for you to test until the culprit is found, finishing with &lt;code&gt;git bisect reset&lt;/code&gt;. Next, &lt;code&gt;git blame &amp;lt;file&amp;gt;&lt;/code&gt; shows who last modified each line and when (pass &lt;code&gt;-L 50,60&lt;/code&gt; to inspect a specific line range), giving you helpful context before debugging or refactoring. When you need to switch tasks mid-flight, &lt;code&gt;git stash&lt;/code&gt; shelves uncommitted changes and &lt;code&gt;git stash pop&lt;/code&gt; restores them; &lt;code&gt;git stash list&lt;/code&gt; and &lt;code&gt;git stash apply &amp;lt;stash-id&amp;gt;&lt;/code&gt; let you manage multiple stashes.&lt;/p&gt;
&lt;p&gt;For temporary build artifacts generated by Maven or Gradle like &lt;code&gt;.class&lt;/code&gt; files or the &lt;code&gt;target/&lt;/code&gt; directory, &lt;code&gt;git clean -n&lt;/code&gt; previews what would be deleted, &lt;code&gt;-f&lt;/code&gt; removes untracked files, &lt;code&gt;-fd&lt;/code&gt; removes untracked directories as well, and &lt;code&gt;-x&lt;/code&gt; also deletes ignored files such as &lt;code&gt;.idea/&lt;/code&gt;. Finally, Git hooks are scripts that run automatically before or after events like commits, pushes, or merges—for example, a &lt;code&gt;pre-commit&lt;/code&gt; hook in &lt;code&gt;.git/hooks&lt;/code&gt; can run &lt;code&gt;mvn test&lt;/code&gt; and abort the commit if tests fail. As a bonus tip, &lt;code&gt;git checkout -&lt;/code&gt; jumps straight back to the previous branch you were working on without retyping its name, saving time and avoiding typos.&lt;/p&gt;
&lt;h2 id="simplify-your-system-by-challenging-the-status-quo-and-learning-from-other-ecosystems"&gt;&lt;a href="https://www.infoq.com/podcasts/simplify-system-learning-ecosystems/" rel="noopener noreferrer"&gt;Simplify Your System by Challenging the Status-Quo and Learning from Other Ecosystems&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In this InfoQ podcast, Max Rydahl Andersen—Distinguished Engineer at Red Hat and creator of JBang—recounts how taking a year away from Java helped him see upon returning that the ecosystem had accumulated too much accidental complexity, like &amp;ldquo;a thousand paper cuts&amp;rdquo;: each small feature is useful on its own, but together they become a burden. Quarkus, which he works on, flips traditional Java conventions by shifting most framework processing from runtime to build time, enabling near-instant startup. That speed unlocks a much better developer experience: live reload, continuous testing, Dev Services that automatically spin up containers like PostgreSQL or Kafka, and an interactive chat UI for testing AI services via LangChain4j right inside the Dev UI.&lt;/p&gt;
&lt;p&gt;With JBang, he drew inspiration from Python and Node.js to let developers run Java from a single source file—even downloading a JDK automatically if none is installed; he jokes that if you find any development environment easier to set up, that&amp;rsquo;s a bug in JBang. Andersen also argues that AI cannot replace core software engineering fundamentals and systems thinking, and warns that AI will accelerate CVE exploitation, meaning legacy systems will need much more frequent patching. The overarching takeaway: challenge the status quo and borrow good ideas from other ecosystems to keep systems simple.&lt;/p&gt;
&lt;h2 id="about"&gt;&lt;a href="https://tryingthings.wordpress.com/2025/03/24/about-vibe-coding/" rel="noopener noreferrer"&gt;About &amp;ldquo;vibe coding&amp;rdquo;&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Sorin Costea writes a brief reflection on &amp;ldquo;vibe coding&amp;rdquo;—the trend of letting AI write code in place of the developer. After reading &amp;ldquo;Vibe Coding vs Reality,&amp;rdquo; he was relieved to see he wasn&amp;rsquo;t the only skeptic, recounting his own attempt to use Cursor on a Java Maven project where the tool couldn&amp;rsquo;t even rename a class properly: first it renamed the class declaration without renaming the file, and when asked to fix it, it created an empty file with the new name—twice in a row.&lt;/p&gt;
&lt;p&gt;When he shared the experience on Hacker News, the replies were mostly along the lines of &amp;ldquo;haha Java,&amp;rdquo; leaving him wondering whether Cursor was only trained on trendy frontend frameworks or whether its vocal fans simply don&amp;rsquo;t care about real-world enterprise codebases. He ended up uninstalling Cursor and feeling even more skeptical of &amp;ldquo;magical&amp;rdquo; AI coding tools, though he leaves the door open: &amp;ldquo;Next year though? Next year we&amp;rsquo;ll see.&amp;rdquo;&lt;/p&gt;
&lt;h2 id="visual-focused-algorithms-cheat-sheet"&gt;&lt;a href="https://photonlines.substack.com/p/visual-focused-algorithms-cheat-sheet" rel="noopener noreferrer"&gt;Visual-Focused Algorithms Cheat Sheet&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Nick M compiles a visual-first cheat sheet of essential algorithms used in practice, following up on his earlier data structures cheat sheet; each algorithm is explained through everyday analogies and diagrams. The sorting section progresses from Selection Sort and Insertion Sort—simple but O(n²)—to Heap Sort and Merge Sort at O(n log n), Quick Sort with an O(n log n) average case and O(n²) worst case, and Tim Sort, the hybrid of Insertion Sort and Merge Sort used in Python and Java. Searching covers Binary Search at O(log n) alongside DFS and BFS for depth-first and breadth-first graph traversal. The graph section walks through Prim&amp;rsquo;s and Kruskal&amp;rsquo;s algorithms for minimum spanning trees, Dijkstra&amp;rsquo;s and Bellman-Ford for shortest paths (with Bellman-Ford handling negative edge weights), A* using heuristics, plus Union-Find and Ford-Fulkerson.&lt;/p&gt;
&lt;p&gt;Later sections cover string search, data compression and encoding (Huffman coding, LZ compression, Fourier transforms, JPEG compression), optimization (Simplex, Simulated Annealing), machine learning and data science, and security and cryptography algorithms. The post wraps up with coding interview resources like &amp;ldquo;14 Patterns to Ace Any Coding Interview&amp;rdquo; and &amp;ldquo;5 Simple Steps for Solving Dynamic Programming Problems,&amp;rdquo; making it a handy reference for junior developers preparing for interviews.&lt;/p&gt;
&lt;h2 id="bonus-interesting-images-from-bytebytego"&gt;Bonus: Interesting images from &lt;a href="https://bytebytego.com/" rel="noopener noreferrer"&gt;ByteByteGo&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;img src="https://substack-post-media.s3.amazonaws.com/public/images/81074d22-5821-4aec-bb2d-0a099d06b6ac_1600x840.png" alt="3 Steps to Master Your Software"&gt;
&lt;img src="https://substack-post-media.s3.amazonaws.com/public/images/67c39b9a-9a91-4e57-9e24-7714b4f806dd_1280x1349.gif" alt="The Ultimate Software Architect Roadmap"&gt;
&lt;img src="https://substack-post-media.s3.amazonaws.com/public/images/fb1b1cd1-eac3-4b66-a391-9ec73f6c37f3_1280x1502.gif" alt="How Two-factor Authentication (2FA) Works?"&gt;
&lt;img src="https://substack-post-media.s3.amazonaws.com/public/images/3efae3ad-8c45-4fb2-a79f-6b3387b0751e_1280x1601.gif" alt="How Amazon S3 Works?"&gt;&lt;/p&gt;
&lt;hr&gt;
&lt;p&gt;&lt;em&gt;This post was rewritten by Claude Code with Opus 5.5 on 27/09/2026; reviewed and edited by Codex with GPT 6.1 Sol on 09/11/2026, and re-verified by Claude Code with Sonnet 5.5 on 16/11/2026.&lt;/em&gt;&lt;/p&gt;</description></item></channel></rss>