LfrLock: Lock-Free Read Lock
A high-performance Lock-Free Read Lock implementation where reads never block and writes are serialized using a Mutex.
Note: If you need a specialized Single-Writer Multiple-Reader (SWMR) version, please use smr-swap directly.
Features
- Lock-Free Reads: Read operations are wait-free and never block, ensuring low latency.
- Serialized Writes: Write operations are serialized using a
Mutexto prevent data races. - Unified Interface: Supports both read and write operations through a single
LfrLock<T>type, similar tostd::sync::Mutex. - Easy Usage: Provides a
WriteGuardfor familiar, mutable access that automatically commits changes on drop. - Safe Concurrency: Built on top of
smr-swapfor safe memory reclamation and concurrent access.
Quick Start
Installation
Add to your Cargo.toml:
[]
= "0.1"
Basic Usage
use LfrLock;
use thread;
API Overview
LfrLock<T>
The main type combining reader and writer capabilities.
new(initial: T): Creates a new lock with an initial value.read() -> ReaderGuard<T>: Gets a lock-free read guard. Never blocks.write() -> WriteGuard<T>: Acquires a write lock (blocks other writers) and returns a guard for mutable access. RequiresT: Clone.write_with(f: F): Updates data using a closureFnOnce(&T) -> T. Useful whenTis notCloneor for functional updates.update(new_t: T): Directly replaces the current value.try_write() -> Option<WriteGuard<T>>: Tries to acquire the write lock.
WriteGuard<T>
Provides mutable access to the data.
- Automatic Commit: When the guard is dropped, the modified data is atomically swapped in.
- Deref/DerefMut: Access the underlying data transparently.
Implementation Details
LfrLock uses smr-swap internally to manage state. It wraps the Swapper in a Mutex to serialize writes, while the SwapReader allows concurrent, lock-free reads. This design is ideal for read-heavy workloads where writes are infrequent but need to be safe and atomic.
License
Licensed under either of Apache License, Version 2.0 or MIT license at your option.