From 618d505de6d561680f426a89896fc6d90c585aa7 Mon Sep 17 00:00:00 2001 From: Shaun Beautement Date: Sat, 2 Mar 2024 16:56:52 +0200 Subject: [PATCH] small readme changes --- README.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index d932db7..0c6017d 100644 --- a/README.md +++ b/README.md @@ -20,7 +20,7 @@ #### Why not Talc? - Doesn't integrate with operating systems' dynamic memory facilities out-of-the-box yet - Doesn't scale well to allocation/deallocation-heavy concurrent processing - - However, it's especially good at concurrent reallocation + - Though it's particularly good at concurrent reallocation. ## Table of Contents @@ -90,7 +90,7 @@ The average occupied capacity upon first allocation failure when randomly alloca | Rlsf | 99.06% | | Talc | 98.97% | | Linked List | 98.36% | -| Buddy Alloc | **63.14%** | +| Buddy Alloc | 63.14% | ### Random Actions Benchmark @@ -126,6 +126,7 @@ Here is the list of important `Talc` methods: * `malloc` * `free` * `grow` + * `grow_in_place` * `shrink` Read their [documentation](https://docs.rs/talc/latest/talc/struct.Talc.html) for more info.