9 releases

Uses old Rust 2015

0.5.3 Mar 11, 2015
0.5.2 Feb 9, 2015
0.5.0 Dec 16, 2014
0.4.1 Dec 2, 2014
0.3.2 Nov 19, 2014

#2856 in Rust patterns

Download history 10/week @ 2024-03-11 13/week @ 2024-03-18 39/week @ 2024-04-01 17/week @ 2024-04-08 15/week @ 2024-04-15 19/week @ 2024-04-22 13/week @ 2024-04-29 4/week @ 2024-05-06 8/week @ 2024-05-13 9/week @ 2024-05-20 22/week @ 2024-05-27 38/week @ 2024-06-03 15/week @ 2024-06-10 16/week @ 2024-06-17 24/week @ 2024-06-24

95 downloads per month
Used in stream

MIT license

10KB
179 lines

Lazy

Lazy evaluation in Rust.

Example

fn expensive() -> i32 {
    println!("I am only evaluated once!"); 7
}

fn main() {
    let a = lazy!(expensive());

    // Thunks are just smart pointers!
    assert_eq!(*a, 7); // "I am only evaluated once." is printed here

    let b = [*a, *a]; // Nothing is printed.
    assert_eq!(b, [7, 7]);
}

API

lazy!($expr)

Expands to Thunk::new(|| { $expr })

Thunk::new(|| -> T)

Takes an FnOnce closure, creates a delayed computation.

Thunk::force()

Forces the evaluation of the thunk so subsequent accesses are cheap. Values are stored unboxed.

Thunk::unwrap()

Consumes and forces the evaluation of the thunk and returns the contained value.

Thunk::deref() / Thunk::deref_mut()

Gets the value out of the thunk by evaluating the closure or grabbing it from the cache. Allows you to call methods on the thunk as if it was an instance of the contained valued through auto-deref.

There is also an equivalent API for SyncThunk, which is Send + Sync and usable for safe, concurrent laziness, except that they are created using sync_lazy! or by doing use lazy::SyncThunk as Thunk and using lazy!.

Dependencies

~19KB