From c730395695d93a5def553043bfed7d32faeaeb41 Mon Sep 17 00:00:00 2001 From: "R. Aidan Campbell" Date: Thu, 16 Sep 2021 15:16:44 -0700 Subject: [PATCH] minor spelling corrections --- guide/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/guide/README.md b/guide/README.md index 9e13b37..2599070 100644 --- a/guide/README.md +++ b/guide/README.md @@ -123,7 +123,7 @@ Performing GC involves a lot of expensive graph traversal and cache thrashing. I Generally speaking the cost of GC is proportional to the amount of heap allocations your program performs. So when it comes to optimizing the memory related overhead of your program, the mantra is: -- **Reduce**: Try to to turn heap allocations into stack allocations or avoid them alltogether. Minimizing the number of pointers on the heap also helps. +- **Reduce**: Try to turn heap allocations into stack allocations or avoid them altogether. Minimizing the number of pointers on the heap also helps. - **Reuse:** Reuse heap allocations rather than replacing them with new ones. - **Recycle:** Some heap allocations can't be avoided. Let the GC recycle them and focus on other issues.