#channel #message #synchronous #value #recent #most #retains

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

#222 in Concurrency

Download history 472/week @ 2023-12-16 246/week @ 2023-12-23 461/week @ 2023-12-30 410/week @ 2024-01-06 398/week @ 2024-01-13 463/week @ 2024-01-20 375/week @ 2024-01-27 396/week @ 2024-02-03 519/week @ 2024-02-10 555/week @ 2024-02-17 358/week @ 2024-02-24 713/week @ 2024-03-02 467/week @ 2024-03-09 266/week @ 2024-03-16 367/week @ 2024-03-23 328/week @ 2024-03-30

1,530 downloads per month
Used in tender

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–6.5MB