diff options
| author | Dario Nieuwenhuis <[email protected]> | 2023-10-15 00:34:59 +0000 |
|---|---|---|
| committer | GitHub <[email protected]> | 2023-10-15 00:34:59 +0000 |
| commit | 7045c5317091c8e81b0dbe64c9788bb2667472b1 (patch) | |
| tree | 7d2e7610753a24c71036cade2c3f5215c542afca /embassy-executor | |
| parent | a818f336582fcaef3795cb99a7e38d3c4b9c1237 (diff) | |
| parent | 0621e957a0ddc7010d46b3ea3ddc8b9852bc8333 (diff) | |
Merge pull request #2061 from adamgreig/timer-helpers
Add convenience methods for Timer::after_secs/millis/micros/ticks
Diffstat (limited to 'embassy-executor')
| -rw-r--r-- | embassy-executor/README.md | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/embassy-executor/README.md b/embassy-executor/README.md index 47d0cb8a2..3c1448a18 100644 --- a/embassy-executor/README.md +++ b/embassy-executor/README.md | |||
| @@ -4,7 +4,7 @@ An async/await executor designed for embedded usage. | |||
| 4 | 4 | ||
| 5 | - No `alloc`, no heap needed. Task futures are statically allocated. | 5 | - No `alloc`, no heap needed. Task futures are statically allocated. |
| 6 | - No "fixed capacity" data structures, executor works with 1 or 1000 tasks without needing config/tuning. | 6 | - No "fixed capacity" data structures, executor works with 1 or 1000 tasks without needing config/tuning. |
| 7 | - Integrated timer queue: sleeping is easy, just do `Timer::after(Duration::from_secs(1)).await;`. | 7 | - Integrated timer queue: sleeping is easy, just do `Timer::after_secs(1).await;`. |
| 8 | - No busy-loop polling: CPU sleeps when there's no work to do, using interrupts or `WFE/SEV`. | 8 | - No busy-loop polling: CPU sleeps when there's no work to do, using interrupts or `WFE/SEV`. |
| 9 | - Efficient polling: a wake will only poll the woken task, not all of them. | 9 | - Efficient polling: a wake will only poll the woken task, not all of them. |
| 10 | - Fair: a task can't monopolize CPU time even if it's constantly being woken. All other tasks get a chance to run before a given task gets polled for the second time. | 10 | - Fair: a task can't monopolize CPU time even if it's constantly being woken. All other tasks get a chance to run before a given task gets polled for the second time. |