<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Realloc on Void *Pablogs</title><link>https://pablogs.dev/tags/realloc/</link><description>Recent content in Realloc on Void *Pablogs</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 01 Jun 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://pablogs.dev/tags/realloc/index.xml" rel="self" type="application/rss+xml"/><item><title>The Growth Factor Debate: 1.5x, 2x, or Something Else?</title><link>https://pablogs.dev/posts/growth-factor-dynamic-array-1.5-vs-2/</link><pubDate>Mon, 01 Jun 2026 00:00:00 +0000</pubDate><guid>https://pablogs.dev/posts/growth-factor-dynamic-array-1.5-vs-2/</guid><description>Why Firefox and MSVC use 1.5x growth instead of 2x. The math, the memory reuse proof, and benchmarks comparing growth strategies for dynamic arrays.</description></item><item><title>Growing Pains: realloc and Automatic Capacity Management</title><link>https://pablogs.dev/posts/realloc-auto-growing-array-c/</link><pubDate>Thu, 28 May 2026 00:00:00 +0000</pubDate><guid>https://pablogs.dev/posts/realloc-auto-growing-array-c/</guid><description>Master realloc() properly: the temporary pointer pattern, pointer invalidation, and why direct assignment is a bug. Build an auto-growing array in C.</description></item></channel></rss>