<?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>Pointers on Void *Pablogs</title><link>https://pablogs.dev/tags/pointers/</link><description>Recent content in Pointers on Void *Pablogs</description><generator>Hugo</generator><language>en</language><lastBuildDate>Thu, 28 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://pablogs.dev/tags/pointers/index.xml" rel="self" type="application/rss+xml"/><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><item><title>Hello, Array: malloc, free and Manual Bookkeeping</title><link>https://pablogs.dev/posts/dynamic-array-c-malloc-free/</link><pubDate>Sun, 24 May 2026 00:00:00 +0000</pubDate><guid>https://pablogs.dev/posts/dynamic-array-c-malloc-free/</guid><description>Implement a dynamic array in C with malloc, free, and manual bookkeeping. The foundation for understanding how every vector works under the hood.</description></item></channel></rss>