From 54d64ac3a5a5a654fc35afe9f53b812f42d80114 Mon Sep 17 00:00:00 2001 From: Brian Carroll Date: Mon, 20 Nov 2023 20:09:48 +0000 Subject: [PATCH 1/2] Fix typo in fast.md Signed-off-by: Brian Carroll --- www/content/fast.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/www/content/fast.md b/www/content/fast.md index f7244f5cdd5..b92ba3ad3db 100644 --- a/www/content/fast.md +++ b/www/content/fast.md @@ -1,6 +1,6 @@ # Fast -Roc code is designed to build fast and run fast...but what does "fast" mean here? And how close is Roc's curent implementation to realizing that goal? +Roc code is designed to build fast and run fast...but what does "fast" mean here? And how close is Roc's current implementation to realizing that goal? ## [Fast programs](#fast-programs) {#fast-programs} From d97b67aaf3e2d22a56efc7bfe3f651692b3da852 Mon Sep 17 00:00:00 2001 From: Brian Carroll Date: Mon, 20 Nov 2023 20:11:50 +0000 Subject: [PATCH 2/2] Fix typo in functional.md Signed-off-by: Brian Carroll --- www/content/functional.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/www/content/functional.md b/www/content/functional.md index 86d62a5c9d2..28b2581865d 100644 --- a/www/content/functional.md +++ b/www/content/functional.md @@ -44,7 +44,7 @@ colors To be fair, direct mutation primitives have benefits too. Some algorithms are more concise or otherwise easier to read when written with direct mutation, and direct mutation can make the performance characteristics of some operations clearer. -As such, Roc's opportunistic mutation design means that data races and reference cycles can be ruled out, and that functions will tend to be more ameanable for chaining, but also that some algorithms will be harder to express, and that performance optimization will likely tend to involve more profiling. These tradeoffs fit well with the language's overall design goals. +As such, Roc's opportunistic mutation design means that data races and reference cycles can be ruled out, and that functions will tend to be more amenable for chaining, but also that some algorithms will be harder to express, and that performance optimization will likely tend to involve more profiling. These tradeoffs fit well with the language's overall design goals. ## [No reassignment or shadowing](#no-reassignment) {#no-reassignment}