<?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>Implementing a Fixed Capacity Vector in C++ on Fabian Koehler</title><link>https://fkoehler.me/series/implementing-a-fixed-capacity-vector-in-c++/</link><description>Recent content in Implementing a Fixed Capacity Vector in C++ on Fabian Koehler</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 23 Jun 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://fkoehler.me/series/implementing-a-fixed-capacity-vector-in-c++/index.xml" rel="self" type="application/rss+xml"/><item><title>A Fixed Capacity Vector in C++: Memory Layout</title><link>https://fkoehler.me/posts/2026/06/fixed-capacity-vector-memory-layout/</link><pubDate>Tue, 23 Jun 2026 00:00:00 +0000</pubDate><guid>https://fkoehler.me/posts/2026/06/fixed-capacity-vector-memory-layout/</guid><description>The first post in a series on implementing a FixedCapacityVector &amp;ndash; a container that fills the gap between std::array and std::vector. We start with the raw storage: a byte buffer, alignment, and accessing it as typed memory.</description></item></channel></rss>