Struct HotReloadRegistry 

pub struct HotReloadRegistry { /* private fields */ }

Hot-reloadable provider registry.

Construct with HotReloadRegistry::start; access the current registry via HotReloadRegistry::current. The atomic load is constant-time and lock-free; the rebuild path takes a write lock briefly (only for the swap, not for the disk read), so concurrent reads are never blocked.

Implementations

impl HotReloadRegistry

pub fn start( rules_dir: impl Into<PathBuf>, poll_interval: Duration, ) -> Result<Arc<Self>>

Start watching rules_dir for changes. Constructs the initial registry from the bundled built-ins + every *.toml file in rules_dir. Spawns a background task that polls every poll_interval (default 2s); the task lives for the lifetime of the program (tied to the returned Arc).

pub fn current(&self) -> Arc<ProviderRegistry>

Borrow the current registry. Constant-time + lock-free for the reader side except for the very brief read-lock acquisition (microseconds).

pub fn reload_count(&self) -> u64

How many times we’ve successfully reloaded the registry. Reads use Ordering::Relaxed, operators sample this from a metrics endpoint, exact ordering doesn’t matter.

pub fn poll_once(&self) -> bool

Force one poll cycle synchronously. Useful in tests + when an operator wants “reload now” without waiting for the next poll tick. Returns true when a reload actually happened (mtime changed AND build succeeded).