diff --git a/include/boost/scoped_array.hpp b/include/boost/scoped_array.hpp
index c4fa3d0..6734c5e 100644
--- a/include/boost/scoped_array.hpp
+++ b/include/boost/scoped_array.hpp
@@ -27,7 +27,7 @@ template<typename T> class scoped_array // noncopyable
 {
 private:
 
-    T* ptr;
+    T * ptr;
 
     scoped_array(scoped_array const &);
     scoped_array & operator=(scoped_array const &);
@@ -57,14 +57,14 @@ public:
         }
     }
 
-    T& operator[](std::ptrdiff_t i) const // never throws
+    T & operator[](std::ptrdiff_t i) const // never throws
     {
         BOOST_ASSERT(ptr != 0);
         BOOST_ASSERT(i >= 0);
         return ptr[i];
     }
 
-    T* get() const // never throws
+    T * get() const // never throws
     {
         return ptr;
     }
diff --git a/shared_array.htm b/shared_array.htm
index 2b818e7..12c353e 100644
--- a/shared_array.htm
+++ b/shared_array.htm
@@ -197,10 +197,10 @@ See the smart pointer
 <a href="smart_ptr.htm#Common requirements">common requirements</a>.</p>
 <p>The <b>operator&lt;</b> overload is provided to define an ordering so that <b>shared_array</b>
 objects can be used in associative containers such as <b>std::map</b>.
-The implementation uses std::less&lt;T*&gt; to perform the
+The implementation uses <b>std::less&lt;T *&gt;</b> to perform the
 comparison. This ensures that the comparison is handled correctly, since the
 standard mandates that relational operations on pointers are unspecified (5.9 [expr.rel]
-paragraph 2) but std::less&lt;&gt; on pointers is well-defined (20.3.3 [lib.comparisons]
+paragraph 2) but <b>std::less&lt;&gt;</b> on pointers is well-defined (20.3.3 [lib.comparisons]
 paragraph 8).</p>
 
 <h3><a name="free-swap">swap</a></h3>
diff --git a/shared_ptr.htm b/shared_ptr.htm
index 7773c2b..42e23fe 100644
--- a/shared_ptr.htm
+++ b/shared_ptr.htm
@@ -230,10 +230,10 @@ See the smart pointer
 <a href="smart_ptr.htm#Common requirements">common requirements</a>.</p>
 <p>The <b>operator&lt;</b> overload is provided to define an ordering so that <b>shared_ptr</b>
 objects can be used in associative containers such as <b>std::map</b>.
-The implementation uses std::less&lt;T*&gt; to perform the
+The implementation uses <b>std::less&lt;T *&gt;</b> to perform the
 comparison. This ensures that the comparison is handled correctly, since the
 standard mandates that relational operations on pointers are unspecified (5.9 [expr.rel]
-paragraph 2) but std::less&lt;&gt; on pointers is well-defined (20.3.3 [lib.comparisons]
+paragraph 2) but <b>std::less&lt;&gt;</b> on pointers is well-defined (20.3.3 [lib.comparisons]
 paragraph 8).</p>
 
 <h3><a name="free-swap">swap</a></h3>
diff --git a/smart_ptr.htm b/smart_ptr.htm
index 682a675..c6782a4 100644
--- a/smart_ptr.htm
+++ b/smart_ptr.htm
@@ -196,7 +196,7 @@ implementation.</p>
 <hr>
 
 <p>Revised <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B %Y" startspan
--->04 February 2002<!--webbot bot="Timestamp" endspan i-checksum="40737"
+-->4 February 2002<!--webbot bot="Timestamp" endspan i-checksum="40737"
 --></p>
 
 <p>Copyright 1999 Greg Colvin and Beman Dawes. Copyright 2002 Darin Adler.
diff --git a/weak_ptr.htm b/weak_ptr.htm
index 10a0c2c..a28232b 100644
--- a/weak_ptr.htm
+++ b/weak_ptr.htm
@@ -178,10 +178,10 @@ See the smart pointer
 <a href="smart_ptr.htm#Common requirements">common requirements</a>.</p>
 <p>The <b>operator&lt;</b> overload is provided to define an ordering so that <b>weak_ptr</b>
 objects can be used in associative containers such as <b>std::map</b>.
-The implementation uses std::less&lt;T*&gt; to perform the
+The implementation uses <b>std::less&lt;T *&gt;</b> to perform the
 comparison. This ensures that the comparison is handled correctly, since the
 standard mandates that relational operations on pointers are unspecified (5.9 [expr.rel]
-paragraph 2) but std::less&lt;&gt; on pointers is well-defined (20.3.3 [lib.comparisons]
+paragraph 2) but <b>std::less&lt;&gt;</b> on pointers is well-defined (20.3.3 [lib.comparisons]
 paragraph 8).</p>
 
 <h3><a name="free-swap">swap</a></h3>