Skip to content
Browse files

build

  • Loading branch information...
1 parent c2754ec commit 5ac5ca31c3b789d3a9673f746eba1e2c2ade9d44 @mmcgrana committed Nov 24, 2012
Showing with 6 additions and 6 deletions.
  1. +1 −1 .gitignore
  2. +2 −2 public/execing-processes
  3. +1 −1 public/range
  4. +1 −1 public/reading-files
  5. +1 −1 public/sorting-by-functions
View
2 .gitignore
@@ -1,2 +1,2 @@
.anvil
-**/**.pyc
+*.pyc
View
4 public/execing-processes
@@ -79,7 +79,7 @@ function.</p>
<tr>
<td class="docs">
<p>For our example we&rsquo;ll exec <code>ls</code>. Go requires an
-abolute path to the binary we want to execute, so
+absolute path to the binary we want to execute, so
we&rsquo;ll use <code>exec.LookPath</code> to find it (probably
<code>/bin/ls</code>).</p>
@@ -125,7 +125,7 @@ environment.</p>
<tr>
<td class="docs">
<p>Here&rsquo;s the actual <code>os.Exec</code> 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 <code>/bin/ls -a -l -h</code>
process. If there is an error we&rsquo;ll get a return
value.</p>
View
2 public/range
@@ -112,7 +112,7 @@ the indexes though.</p>
</td>
<td class="code leading">
- <div class="highlight"><pre> <span class="nx">kvs</span> <span class="o">:=</span> <span class="kd">map</span><span class="p">[</span><span class="kt">string</span><span class="p">]</span><span class="kt">string</span><span class="p">{</span><span class="s">&quot;a&quot;</span><span class="p">:</span> <span class="s">&quot;apple&quot;</span><span class="p">,</span> <span class="s">&quot;b&quot;</span><span class="p">:</span> <span class="s">&quot;bannana&quot;</span><span class="p">}</span>
+ <div class="highlight"><pre> <span class="nx">kvs</span> <span class="o">:=</span> <span class="kd">map</span><span class="p">[</span><span class="kt">string</span><span class="p">]</span><span class="kt">string</span><span class="p">{</span><span class="s">&quot;a&quot;</span><span class="p">:</span> <span class="s">&quot;apple&quot;</span><span class="p">,</span> <span class="s">&quot;b&quot;</span><span class="p">:</span> <span class="s">&quot;banana&quot;</span><span class="p">}</span>
<span class="k">for</span> <span class="nx">k</span><span class="p">,</span> <span class="nx">v</span> <span class="o">:=</span> <span class="k">range</span> <span class="nx">kvs</span> <span class="p">{</span>
<span class="nx">fmt</span><span class="p">.</span><span class="nx">Printf</span><span class="p">(</span><span class="s">&quot;%s -&gt; %s\n&quot;</span><span class="p">,</span> <span class="nx">k</span><span class="p">,</span> <span class="nx">v</span><span class="p">)</span>
<span class="p">}</span>
View
2 public/reading-files
@@ -192,7 +192,7 @@ accomplishes this.</p>
<tr>
<td class="docs">
<p>The <code>bufio</code> package implements a buffered
-reader that may be useful both for it&rsquo;s efficiency
+reader that may be useful both for its efficiency
with many small reads and because of the additional
reading methods it provides.</p>
View
2 public/sorting-by-functions
@@ -80,7 +80,7 @@ type.</p>
<p>We implement <code>sort.Interface</code> - <code>Len</code>, <code>Less</code>, and
<code>Swap</code> - on our type so we can use the <code>sort</code> package&rsquo;s
generic <code>Sort</code> function. <code>Len</code> and <code>Swap</code>
-will usually be similar accross types and <code>Less</code> will
+will usually be similar across types and <code>Less</code> will
hold the actual custom sorting logic. In our case we
want to sort in order of increasing string length, so
we use <code>len(s[i])</code> and <code>len(s[j])</code> here.</p>

0 comments on commit 5ac5ca3

Please sign in to comment.
Something went wrong with that request. Please try again.