Release Note v0.1.0 — 2026-08-15

The first published version: five containers and the shared wire records.

• Containers — hive (stable addresses, skipfield iteration), map (flat open-addressing), single_queue (lock-free SPSC ring), pool (handle-based object pool), memory_pool (fixed-size-block allocator). Each has a GoogleTest binary; map also has a benchmark against std::unordered_map.
• common.h — order, trade, and ten-level book records with the side / order_type / order_action enums, fixed-point prices, and nanosecond timestamps. order carries intrusive prev / next hooks so a book can rest it without a node allocation.
• Namespace nq renamed to nlib, matching the library and target names. Consumers must update qualified names; there is no compatibility alias.
• Insertion is move-only across every container: the insert(const T&) overloads are gone, so no insertion path copies an element silently.
• vector was removed — std::vector covers it, and a weaker duplicate of a standard container is not worth maintaining.