#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

#568 in Concurrency

Download history 253/week @ 2024-11-16 279/week @ 2024-11-23 346/week @ 2024-11-30 334/week @ 2024-12-07 333/week @ 2024-12-14 166/week @ 2024-12-21 148/week @ 2024-12-28 283/week @ 2025-01-04 360/week @ 2025-01-11 251/week @ 2025-01-18 257/week @ 2025-01-25 350/week @ 2025-02-01 531/week @ 2025-02-08 307/week @ 2025-02-15 432/week @ 2025-02-22 291/week @ 2025-03-01

1,625 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