Merge pull request #68 from 1ace/master

Fix spelling mistakes

doc/userguide.html

@@ -2016,7 +2016,7 @@ always used with the <tt>users_by_name</tt> hash table).</p></div>
 </div>
 <div class="sect2">
 <h3 id="_several_sort_orders">Several sort orders</h3>
-<div class="paragraph"><p>It comes as no suprise that two hash tables can have different sort orders, but
+<div class="paragraph"><p>It comes as no surprise that two hash tables can have different sort orders, but
 this fact can also be used advantageously to sort the <em>same items</em> in several
 ways. This is based on the ability to store a structure in several hash tables.</p></div>
 <div class="paragraph"><p>Extending the previous example, suppose we have many users. We have added each

doc/userguide.txt

@@ -1143,7 +1143,7 @@ always used with the `users_by_name` hash table).
 
 Several sort orders
 ~~~~~~~~~~~~~~~~~~~
-It comes as no suprise that two hash tables can have different sort orders, but
+It comes as no surprise that two hash tables can have different sort orders, but
 this fact can also be used advantageously to sort the 'same items' in several
 ways. This is based on the ability to store a structure in several hash tables.
 

doc/utarray.html

@@ -802,7 +802,7 @@ array elements. These array elements can be any simple datatype or structure.
 The array <a href="#operations">operations</a> are based loosely on the C++ STL vector methods.</p></div>
 <div class="paragraph"><p>Internally the dynamic array contains a contiguous memory region into which
 the elements are copied. This buffer is grown as needed using <tt>realloc</tt> to
-accomodate all the data that is pushed into it.</p></div>
+accommodate all the data that is pushed into it.</p></div>
 <div class="sect2">
 <h3 id="_download">Download</h3>
 <div class="paragraph"><p>To download the <tt>utarray.h</tt> header file,

doc/utarray.txt

@@ -19,7 +19,7 @@ The array <<operations,operations>> are based loosely on the C++ STL vector meth
 
 Internally the dynamic array contains a contiguous memory region into which
 the elements are copied. This buffer is grown as needed using `realloc` to
-accomodate all the data that is pushed into it.
+accommodate all the data that is pushed into it.
 
 Download
 ~~~~~~~~

doc/utlist.html

@@ -1029,7 +1029,7 @@ To prepend before an arbitrary element instead of the list head, use the
 <code>_PREPEND_ELEM</code> macro family.
 To append after an arbitrary element element instead of the list head, use the
 <code>_APPEND_ELEM</code> macro family.
-To <em>replace</em> an arbitary list element with another element use the <code>_REPLACE_ELEM</code>
+To <em>replace</em> an arbitrary list element with another element use the <code>_REPLACE_ELEM</code>
 family of macros.</p></div>
 <div class="paragraph"><p>The <em>sort</em> operation never moves the elements in memory; rather it only adjusts
 the list order by altering the <code>prev</code> and <code>next</code> pointers in each element. Also

doc/utlist.txt

@@ -122,7 +122,7 @@ To prepend before an arbitrary element instead of the list head, use the
 `_PREPEND_ELEM` macro family.
 To append after an arbitrary element element instead of the list head, use the
 `_APPEND_ELEM` macro family.
-To 'replace' an arbitary list element with another element use the `_REPLACE_ELEM`
+To 'replace' an arbitrary list element with another element use the `_REPLACE_ELEM`
 family of macros.
 
 The 'sort' operation never moves the elements in memory; rather it only adjusts