38 releases (9 stable)

Uses old Rust 2015

1.5.0 Jun 21, 2024
1.4.0 Aug 26, 2019
1.3.0 Feb 27, 2019
1.2.0 Nov 4, 2018
0.1.1 Nov 23, 2014

#11 in Rust patterns

Download history 2952446/week @ 2024-08-13 2910192/week @ 2024-08-20 3029901/week @ 2024-08-27 3189012/week @ 2024-09-03 3004821/week @ 2024-09-10 2876664/week @ 2024-09-17 3173659/week @ 2024-09-24 3710852/week @ 2024-10-01 3946159/week @ 2024-10-08 3715990/week @ 2024-10-15 2965156/week @ 2024-10-22 2857299/week @ 2024-10-29 2880903/week @ 2024-11-05 3045217/week @ 2024-11-12 3164464/week @ 2024-11-19 2126159/week @ 2024-11-26

11,741,558 downloads per month
Used in 46,971 crates (9,768 directly)

MIT/Apache

15KB
125 lines

lazy-static.rs

A macro for declaring lazily evaluated statics in Rust.

Using this macro, it is possible to have statics that require code to be executed at runtime in order to be initialized. This includes anything requiring heap allocations, like vectors or hash maps, as well as anything that requires non-const function calls to be computed.

Rust Latest version Documentation License

Minimum supported rustc

1.40.0+

This version is explicitly tested in CI and may only be bumped in new minor versions. Any changes to the supported minimum version will be called out in the release notes.

Getting Started

lazy-static.rs is available on crates.io. It is recommended to look there for the newest released version, as well as links to the newest builds of the docs.

At the point of the last update of this README, the latest published version could be used like this:

Add the following dependency to your Cargo manifest...

[dependencies]
lazy_static = "1.5.0"

...and see the docs for how to use it.

Example

use lazy_static::lazy_static;
use std::collections::HashMap;

lazy_static! {
    static ref HASHMAP: HashMap<u32, &'static str> = {
        let mut m = HashMap::new();
        m.insert(0, "foo");
        m.insert(1, "bar");
        m.insert(2, "baz");
        m
    };
}

fn main() {
    // First access to `HASHMAP` initializes it
    println!("The entry for `0` is \"{}\".", HASHMAP.get(&0).unwrap());

    // Any further access to `HASHMAP` just returns the computed value
    println!("The entry for `1` is \"{}\".", HASHMAP.get(&1).unwrap());
}

Standard library

It is now possible to easily replicate this crate's functionality in Rust's standard library with std::sync::OnceLock. The example above could be also be written as:

use std::collections::HashMap;
use std::sync::OnceLock;

fn hashmap() -> &'static HashMap<u32, &'static str> {
    static HASHMAP: OnceLock<HashMap<u32, &str>> = OnceLock::new();
    HASHMAP.get_or_init(|| {
        let mut m = HashMap::new();
        m.insert(0, "foo");
        m.insert(1, "bar");
        m.insert(2, "baz");
        m
    })
}

fn main() {
    // First access to `HASHMAP` initializes it
    println!("The entry for `0` is \"{}\".", hashmap().get(&0).unwrap());

    // Any further access to `HASHMAP` just returns the computed value
    println!("The entry for `1` is \"{}\".", hashmap().get(&1).unwrap());
}

License

Licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

Dependencies

~37KB