fix: resolve all host example compilation errors (49/49 passing)

- Add missing includes (<cstdint>, <cstring>, <chrono>, <atomic>,
  <thread>, <utility>, <functional>, <iomanip>, <array>, <new>,
  <stdexcept>, <cstdarg>, <cmath>)
- Fix type errors (sizes_t→size_t, int16_t for sine_table,
  uint8_t/uint16_t/uint32_t declarations)
- Fix template issues (move templates out of function bodies,
  static→non-static member functions)
- Fix lambda issues (duplicate captures, unused variables with
  -Werror, vexing parse, init capture syntax)
- Fix std::expected API usage (std::unexpected for error returns)
- Fix range/view issues (take_while, RingBuffer pipeline, pipe
  operator compatibility)
- Upgrade C++ standards where needed (C++23 for <expected>, <chunk>)
- Fix STM32 CI: use submodules: recursive for nested STM32CubeF1
- Improve build_examples.py: show error lines in failure output

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

Author: Charliechen114514

.github/workflows/build-examples.yml

@@ -40,7 +40,7 @@ jobs:
       - name: Checkout repository
         uses: actions/checkout@v4
         with:
-          submodules: true
+          submodules: recursive
 
       - name: Install build tools
         run: |

code/examples/chapter05/01_dynamic_memory_problems/fragmentation_demo.cpp

@@ -53,7 +53,7 @@ void fragmentation_scenario_1() {
     std::vector<void*> allocations;
 
     // 分配不同大小的块
-    sizes_t sizes[] = {16, 32, 64, 128, 256, 512, 1024};
+    size_t sizes[] = {16, 32, 64, 128, 256, 512, 1024};
 
     for (int round = 0; round < 3; ++round) {
         for (size_t size : sizes) {

code/examples/chapter05/02_static_vs_stack_allocation/static_allocation_demo.cpp

@@ -11,7 +11,7 @@ int global_initialized = 100;
 int global_uninitialized;
 
 // 3. 只读常量 (.rodata段 - 通常在Flash中)
-static const uint16_t sine_table[16] = {
+static const int16_t sine_table[16] = {
     0,  6424,  11773,  15836,
     18479,  19595,  19151,  17205,
     13938,  9605,   4479,    0,
@@ -59,7 +59,7 @@ void constexpr_static_demo() {
 }
 
 // 演示静态存储用于查表
-uint16_t fast_sin(uint8_t angle) {
+int16_t fast_sin(uint8_t angle) {
     // 简化版：只演示查表访问
     return sine_table[angle % 16];
 }

code/examples/chapter05/03_object_pool_pattern/object_pool.cpp

@@ -1,6 +1,7 @@
 #include <iostream>
 #include <cstddef>
 #include <cstdint>
+#include <cstring>
 #include <new>
 #include <type_traits>
 #include <cassert>
@@ -117,7 +118,7 @@ class ObjectPool {
     size_t free_head_ = kInvalidIndex;
     size_t used_count_ = 0;
 
-    static size_t ptr_to_index(T* ptr) {
+    size_t ptr_to_index(T* ptr) {
         uintptr_t base = reinterpret_cast<uintptr_t>(&storage_[0]);
         uintptr_t p = reinterpret_cast<uintptr_t>(ptr);
         EP_ASSERT(p >= base);

code/examples/chapter05/04_placement_new/basic_placement_new.cpp

@@ -3,6 +3,7 @@
 #include <cstddef>
 #include <cstdint>
 #include <type_traits>
+#include <stdexcept>
 
 // 演示placement new的基础用法
 
@@ -157,40 +158,40 @@ void alignment_check_demo() {
         if (aligned) {
             int* p = new (ptr) int(42);
             std::cout << "    Successfully constructed int at " << p << "\n";
-            p->~int();
+            // No explicit destructor needed for trivial types
         }
     }
 }
 
 // 在栈上构造"动态"大小的对象
-void stack_vector_demo() {
-    std::cout << "\n=== Stack-Allocated \"Dynamic\" Container ===\n\n";
-
-    template<size_t N>
-    class StackVector {
-        alignas(double) unsigned char buffer_[N * sizeof(double)];
-        size_t size_ = 0;
-
-    public:
-        void push(double v) {
-            if (size_ < N) {
-                new (buffer_ + size_ * sizeof(double)) double(v);
-                ++size_;
-            }
+template<size_t N>
+class StackVector {
+    alignas(double) unsigned char buffer_[N * sizeof(double)];
+    size_t size_ = 0;
+
+public:
+    void push(double v) {
+        if (size_ < N) {
+            new (buffer_ + size_ * sizeof(double)) double(v);
+            ++size_;
         }
+    }
 
-        double& operator[](size_t i) {
-            return *reinterpret_cast<double*>(buffer_ + i * sizeof(double));
-        }
+    double& operator[](size_t i) {
+        return *reinterpret_cast<double*>(buffer_ + i * sizeof(double));
+    }
 
-        size_t size() const { return size_; }
+    size_t size() const { return size_; }
 
-        ~StackVector() {
-            for (size_t i = 0; i < size_; ++i) {
-                reinterpret_cast<double*>(buffer_ + i * sizeof(double))->~double();
-            }
+    ~StackVector() {
+        for (size_t i = 0; i < size_; ++i) {
+            reinterpret_cast<double*>(buffer_ + i * sizeof(double)); // trivial destructor, no-op
         }
-    };
+    }
+};
+
+void stack_vector_demo() {
+    std::cout << "\n=== Stack-Allocated \"Dynamic\" Container ===\n\n";
 
     StackVector<10> vec;
     for (int i = 0; i < 5; ++i) {

code/examples/chapter05/04_placement_new/bump_allocator.cpp

@@ -150,10 +150,6 @@ class ScopedArena {
         // 析构时回退到初始位置
         // 注意：这不会调用析构函数！
         arena_.reset();
-        arena_ = BumpAllocator(
-            reinterpret_cast<void*>(reinterpret_cast<uintptr_t>(&arena_) - initial_offset_),
-            arena_.capacity()
-        );
     }
 
     // 禁止拷贝和移动

code/examples/chapter05/04_placement_new/inplace_wrapper.cpp

@@ -1,4 +1,6 @@
 #include <iostream>
+#include <cstdio>
+#include <string>
 #include <new>
 #include <type_traits>
 #include <utility>
@@ -132,7 +134,7 @@ void basic_inplace_demo() {
     w->print();
 
     w->update(10);
-    w.print();
+    w->print();
 
     std::cout << "\nLeaving scope (auto destruct)...\n";
 }

code/examples/chapter05/06_array_vs_stdarray/basic_comparison.cpp

@@ -244,6 +244,11 @@ void data_access_demo() {
     std::cout << "\n";
 }
 
+template<size_t N>
+void print_array_size(const std::array<int, N>&) {
+    std::cout << "Array size (template param): " << N << "\n";
+}
+
 void constexpr_demo() {
     std::cout << "\n=== Compile-Time Features ===\n\n";
 
@@ -268,11 +273,6 @@ void constexpr_demo() {
     static_assert(fib.size() == 5, "Size must be 5");
 
     // 作为模板参数
-    template<size_t N>
-    void print_array_size(const std::array<int, N>&) {
-        std::cout << "Array size (template param): " << N << "\n";
-    }
-
     std::array<int, 10> arr;
     print_array_size(arr);
 }

code/examples/chapter05/06_array_vs_stdarray/practical_examples.cpp

@@ -2,7 +2,9 @@
 #include <array>
 #include <algorithm>
 #include <cstring>
+#include <cmath>
 #include <cstdint>
+#include <cstdarg>
 
 // std::array 在实际嵌入式场景中的应用
 
@@ -237,7 +239,7 @@ void lookup_table_demo() {
     std::cout << "\n=== Lookup Table with std::array ===\n\n";
 
     // 正弦表（简化版）
-    constexpr std::array<float, 16> sin_table = [] {
+    std::array<float, 16> sin_table = [] {
         std::array<float, 16> table{};
         for (size_t i = 0; i < 16; ++i) {
             float angle = i * 3.14159f / 8.0f;  // 0 to 2pi

code/examples/chapter06/02_unique_ptr_zero_overhead/polymorphism.cpp

@@ -3,6 +3,7 @@
 
 #include <memory>
 #include <cstdio>
+#include <cstring>
 
 // 基类必须有虚析构函数
 struct Base {