#channel #message #synchronous #value #recent #retains #maintained

watch

A synchronous message passing channel that only retains the most recent value

4 releases

0.2.3 May 27, 2023
0.2.2 May 8, 2022
0.2.1 Feb 20, 2022
0.2.0 Mar 29, 2021
0.1.0 May 8, 2019

#418 in Concurrency

Download history 385/week @ 2024-06-17 441/week @ 2024-06-24 165/week @ 2024-07-01 328/week @ 2024-07-08 326/week @ 2024-07-15 265/week @ 2024-07-22 328/week @ 2024-07-29 250/week @ 2024-08-05 265/week @ 2024-08-12 266/week @ 2024-08-19 233/week @ 2024-08-26 186/week @ 2024-09-02 213/week @ 2024-09-09 197/week @ 2024-09-16 300/week @ 2024-09-23 399/week @ 2024-09-30

1,122 downloads per month
Used in 2 crates

MIT license

10KB
221 lines

watch

This crate provides a synchronous message passing channel that only retains the most recent value.

The crate is passively maintained. This means that I consider it feature complete, and that I am therefore not actively adding new features. However, if you have suggestions for new features or have found a bug, please open an issue.


lib.rs:

This crate provides a synchronous message passing channel that only retains the most recent value.

This crate provides a parking_lot feature. When enabled, the crate will use the mutex from the parking_lot crate rather than the one from std.

Dependencies

~0–5MB