#channel #message #synchronous #value #most #recent #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

#258 in Concurrency

Download history 526/week @ 2024-01-02 423/week @ 2024-01-09 373/week @ 2024-01-16 465/week @ 2024-01-23 324/week @ 2024-01-30 563/week @ 2024-02-06 465/week @ 2024-02-13 461/week @ 2024-02-20 441/week @ 2024-02-27 682/week @ 2024-03-05 394/week @ 2024-03-12 295/week @ 2024-03-19 325/week @ 2024-03-26 338/week @ 2024-04-02 209/week @ 2024-04-09 245/week @ 2024-04-16

1,178 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–6MB