#hash-map #hash-set #collection #delay-queue #delay

delay_map

HashMap collections whose entries expire after a given time

6 releases (3 breaking)

0.4.0 Jul 11, 2024
0.3.0 Mar 7, 2023
0.2.0 Feb 6, 2023
0.1.2 Oct 27, 2022
0.1.0 Jan 31, 2022

#214 in Data structures

Download history 6838/week @ 2024-07-02 8519/week @ 2024-07-09 13380/week @ 2024-07-16 7717/week @ 2024-07-23 7674/week @ 2024-07-30 7688/week @ 2024-08-06 6741/week @ 2024-08-13 7921/week @ 2024-08-20 7629/week @ 2024-08-27 9555/week @ 2024-09-03 9386/week @ 2024-09-10 12250/week @ 2024-09-17 10081/week @ 2024-09-24 8686/week @ 2024-10-01 11601/week @ 2024-10-08 14282/week @ 2024-10-15

47,259 downloads per month
Used in 5 crates (2 directly)

Apache-2.0

21KB
331 lines

delay_map

Build Status Doc Status Crates Status

Documentation at docs.rs

Overview

This crate contains two data structures, HashSetDelay and HashMapDelay. These behave like the standard library HashSet and HashMaps with the added feature that entries inserted into the mappings expire after a fixed period of time.

Usage

Creating a map

    use delay_map::HashMapDelay;
    use futures::prelude::*;

    // Set a default timeout for entries
    let mut delay_map = HashMapDelay::new(std::time::Duration::from_secs(1));


    tokio_test::block_on(async {

    delay_map.insert(1, "entry_1");
    delay_map.insert(2, "entry_2");
    
    if let Some(Ok((key, value))) = delay_map.next().await {
        println!("Entry 1: {}, {}", key, value);  
    }

    if let Some(Ok((key, value))) = delay_map.next().await {
        println!("Entry 2: {}, {}", key,value);  
    }
    });

Dependencies

~3–9MB
~70K SLoC