#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

#442 in Concurrency

Download history 275/week @ 2024-07-19 315/week @ 2024-07-26 275/week @ 2024-08-02 251/week @ 2024-08-09 290/week @ 2024-08-16 213/week @ 2024-08-23 213/week @ 2024-08-30 205/week @ 2024-09-06 186/week @ 2024-09-13 289/week @ 2024-09-20 388/week @ 2024-09-27 199/week @ 2024-10-04 218/week @ 2024-10-11 243/week @ 2024-10-18 200/week @ 2024-10-25 245/week @ 2024-11-01

934 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–4.5MB