File tree 4 files changed +5
-5
lines changed
4 files changed +5
-5
lines changed Original file line number Diff line number Diff line change @@ -17,7 +17,7 @@ import "os/exec"
17
17
func main () {
18
18
19
19
// For our example we'll exec `ls`. Go requires an
20
- // abolute path to the binary we want to execute, so
20
+ // absolute path to the binary we want to execute, so
21
21
// we'll use `exec.LookPath` to find it (probably
22
22
// `/bin/ls`).
23
23
binary , lookErr := exec .LookPath ("ls" )
@@ -36,7 +36,7 @@ func main() {
36
36
env := os .Environ ()
37
37
38
38
// Here's the actual `os.Exec` call. If this call is
39
- // succesful , the execution of our process will end
39
+ // successful , the execution of our process will end
40
40
// here and be replaced by the `/bin/ls -a -l -h`
41
41
// process. If there is an error we'll get a return
42
42
// value.
Original file line number Diff line number Diff line change @@ -29,7 +29,7 @@ func main() {
29
29
}
30
30
31
31
// `range` on map iterates over key/value pairs.
32
- kvs := map [string ]string {"a" : "apple" , "b" : "bannana " }
32
+ kvs := map [string ]string {"a" : "apple" , "b" : "banana " }
33
33
for k , v := range kvs {
34
34
fmt .Printf ("%s -> %s\n " , k , v )
35
35
}
Original file line number Diff line number Diff line change @@ -67,7 +67,7 @@ func main() {
67
67
check (err )
68
68
69
69
// The `bufio` package implements a buffered
70
- // reader that may be useful both for it's efficiency
70
+ // reader that may be useful both for its efficiency
71
71
// with many small reads and because of the additional
72
72
// reading methods it provides.
73
73
r4 := bufio .NewReader (f )
Original file line number Diff line number Diff line change @@ -18,7 +18,7 @@ type ByLength []string
18
18
// We implement `sort.Interface` - `Len`, `Less`, and
19
19
// `Swap` - on our type so we can use the `sort` package's
20
20
// generic `Sort` function. `Len` and `Swap`
21
- // will usually be similar accross types and `Less` will
21
+ // will usually be similar across types and `Less` will
22
22
// hold the actual custom sorting logic. In our case we
23
23
// want to sort in order of increasing string length, so
24
24
// we use `len(s[i])` and `len(s[j])` here.
You can’t perform that action at this time.
0 commit comments