From ff3db8d12d8e2eacde7eccd47ea4f3e3dd5a6807 Mon Sep 17 00:00:00 2001
From: Dominik Honnef
Date: Fri, 10 Jun 2022 23:13:41 +0200
Subject: [PATCH] doc: fix typos in Go memory model
Change-Id: I8e94215d9bee0ea3ad378870fe565e961a9d80c9
Reviewed-on: https://go-review.googlesource.com/c/go/+/411595
Reviewed-by: Ian Lance Taylor
Auto-Submit: Ian Lance Taylor
Run-TryBot: Ian Lance Taylor
TryBot-Result: Gopher Robot
Reviewed-by: Dmitri Shuralyov
---
doc/go_mem.html | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/doc/go_mem.html b/doc/go_mem.html
index 59f9ab880d..661e1e781c 100644
--- a/doc/go_mem.html
+++ b/doc/go_mem.html
@@ -85,7 +85,7 @@ the approach presented by Hans-J. Boehm and Sarita V. Adve in
“Foundations of the C++ Concurrency Memory Model”,
published in PLDI 2008.
The definition of data-race-free programs and the guarantee of sequential consistency
-for race-free progams are equivalent to the ones in that work.
+for race-free programs are equivalent to the ones in that work.
@@ -205,7 +205,7 @@ by other languages, including C, C++, Java, JavaScript, Rust, and Swift.
Certain Go language operations such as goroutine creation and memory allocation
-act as synchronization opeartions.
+act as synchronization operations.
The effect of these operations on the synchronized-before partial order
is documented in the “Synchronization” section below.
Individual packages are responsible for providing similar documentation