For our example we’ll exec ls. Go requires an
-abolute path to the binary we want to execute, so
+absolute path to the binary we want to execute, so
we’ll use exec.LookPath to find it (probably
/bin/ls).
Here’s the actual os.Exec call. If this call is
-succesful, the execution of our process will end
+successful, the execution of our process will end
here and be replaced by the /bin/ls -a -l -h
process. If there is an error we’ll get a return
value.
kvs := map[string]string{"a": "apple", "b": "bannana"}
+ kvs := map[string]string{"a": "apple", "b": "banana"}
for k, v := range kvs {
fmt.Printf("%s -> %s\n", k, v)
}
diff --git a/public/reading-files b/public/reading-files
index f3f5562..20e0f24 100644
--- a/public/reading-files
+++ b/public/reading-files
@@ -192,7 +192,7 @@ accomplishes this.
The bufio package implements a buffered
-reader that may be useful both for it’s efficiency
+reader that may be useful both for its efficiency
with many small reads and because of the additional
reading methods it provides.
diff --git a/public/sorting-by-functions b/public/sorting-by-functions
index 7d5401b..901cbce 100644
--- a/public/sorting-by-functions
+++ b/public/sorting-by-functions
@@ -80,7 +80,7 @@ type.
We implement sort.Interface - Len, Less, and
Swap - on our type so we can use the sort package’s
generic Sort function. Len and Swap
-will usually be similar accross types and Less will
+will usually be similar across types and Less will
hold the actual custom sorting logic. In our case we
want to sort in order of increasing string length, so
we use len(s[i]) and len(s[j]) here.