#channel #watch

watch

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

3 releases

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

#139 in Concurrency

Download history 46/week @ 2022-03-10 70/week @ 2022-03-17 40/week @ 2022-03-24 37/week @ 2022-03-31 37/week @ 2022-04-07 51/week @ 2022-04-14 148/week @ 2022-04-21 58/week @ 2022-04-28 187/week @ 2022-05-05 126/week @ 2022-05-12 74/week @ 2022-05-19 80/week @ 2022-05-26 96/week @ 2022-06-02 67/week @ 2022-06-09 127/week @ 2022-06-16 64/week @ 2022-06-23

371 downloads per month

MIT license

8KB
186 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
~80K SLoC