2 unstable releases

new 0.2.1 Jan 20, 2025
0.1.0 Mar 11, 2018

#1 in #mut

Download history 562/week @ 2024-09-30 2210/week @ 2024-10-07 726/week @ 2024-10-14 487/week @ 2024-10-21 391/week @ 2024-10-28 238/week @ 2024-11-04 149/week @ 2024-11-11 118/week @ 2024-11-18 423/week @ 2024-11-25 354/week @ 2024-12-02 118/week @ 2024-12-09 202/week @ 2024-12-16 92/week @ 2024-12-23 40/week @ 2024-12-30 260/week @ 2025-01-06 374/week @ 2025-01-13

771 downloads per month
Used in librstb

MIT/Apache

19KB
329 lines

lazy-mut

Overview

The LazyMut library provides a synchronization primitive for deferred initialization with a single synchronization step. It is especially useful for scenarios where initialization logic is expensive or should be deferred until first use. The library supports multiple locking backends, including std, parking_lot, and spin (depending on feature flags). This library is #![no_std] compatible, making it suitable for embedded systems and environments where the standard library is unavailable.

Features

  • thread-safe lazy-initialization structure that wraps an initialization function and synchronizes access to the inner data.
  • RAII Guards: Provides scoped locks via LazyMutGuard for safe and automatic unlocking.
  • Poisoning Support: Detects panics during initialization and ensures subsequent accesses are safe, marking the instance as poisoned.
  • Configurable Locking: Uses RawMutex from different synchronization backends (e.g., std, parking_lot, or spin) depending on enabled features.
use lazy_mut::LazyMut;

static VICTOR: LazyMut<Vec<u8>> = LazyMut::new(|| vec![1, 2, 3]);

fn main() {
    VICTOR.get_mut().push(10);
    VICTOR.try_get_mut().unwrap().push(10);
    
    assert_eq!(*VICTOR.get_mut(), [1, 2, 3, 10 ,10])
}

Dependencies

~0.4–5.5MB
~11K SLoC