Provides a strongly-typed unit system built on Boost.Units with a custom Lexer for parsing dimension strings like '1.5 mm'. Includes a CommaSeparated container template and enums for board side, CNC software, and mill feed direction. This module is isolated (only depends on Boost and standard library) and could be extracted as a reusable library for any engineering application requiring type-safe dimension handling with human-readable input parsing.

Implements Hierholzer's algorithm to decompose a graph of toolpath edges into Eulerian paths, minimizing the number of tool lifts. The algorithm is templated on point type and uses a path_manager interface for connection scoring and state. This is a clean, generic implementation of a classic graph algorithm applied to CNC path optimization; it could be reused in any domain requiring Eulerian trail decomposition (e.g., laser cutting, plotter paths) with minimal modification.

Implements a backtracking algorithm to reduce non-productive travel moves in toolpath sequences. It operates on a generic container of paths and uses a distance metric to reorder or reverse paths for shorter travel. The algorithm is independent of geometry types and can be reused for any problem requiring minimal travel between segments (e.g., drilling, pick-and-place).

A value_ptr template that behaves like std::unique_ptr but with deep copy semantics, similar to boost::value_ptr. It stores a pointer and clones on copy. This is a self-contained utility useful for implementing PIMPL or owning polymorphic objects with value semantics. It has no internal dependencies and can be dropped into any C++11+ project.

A generic implementation of the union-find (disjoint-set) data structure with path compression and union by rank. It is header-only, depends only on standard library containers, and is used internally for grouping connected geometry. This is a classic, well-crafted utility that can be reused in any project requiring efficient equivalence class management.