From 72ccd2a40b92c0a05c98cd0fbbeef3dcaaad94e7 Mon Sep 17 00:00:00 2001 From: jonay2000 Date: Fri, 9 Jun 2023 10:16:11 +0200 Subject: [PATCH] fix number in readme --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 9f9db0b..612851a 100644 --- a/README.md +++ b/README.md @@ -82,7 +82,7 @@ where ringbuffer is slightly faster as well (among 100 measurements). | `ConstGenericRingBuffer` | `[13.685 µs 13.712 µs 13.743 µs]` | Note that none of the alternatives to `RingBuffer` have the exact same behavior to `RingBuffer`. All `std` datastructures -compared here can grow unbounded (though in benchmarks they weren't filled over `10 000` elements). +compared here can grow unbounded (though in benchmarks they weren't filled over `65 536` elements). `heapless::Deque` doesn't drop old items like `ringbuffer` does when the deque is full. Instead, new items aren't let in on push operations.