From add94f8385f67205c2895ee1c96d8149ec1fc616 Mon Sep 17 00:00:00 2001
From: Daniel James <daniel@calamity.org.uk>
Date: Wed, 10 Jan 2007 00:04:00 +0000
Subject: [PATCH] Remove some superfluous semi-colons from the unordered
 container implementation.

[SVN r3619]
---
 include/boost/unordered/detail/hash_table_impl.hpp | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/include/boost/unordered/detail/hash_table_impl.hpp b/include/boost/unordered/detail/hash_table_impl.hpp
index 55bd5db7..044584a4 100644
--- a/include/boost/unordered/detail/hash_table_impl.hpp
+++ b/include/boost/unordered/detail/hash_table_impl.hpp
@@ -1104,14 +1104,14 @@ namespace boost {
             {
                 // max load factor isn't set yet, but when it is, it'll be 1.0.
                 return (std::max)(static_cast<size_type>(std::distance(i, j)) + 1, n);
-            };
+            }
 
             template <class I>
             size_type initial_size(I, I, size_type n,
                     boost::incrementable_traversal_tag)
             {
                 return n;
-            };
+            }
 
             template <class I>
             size_type initial_size(I i, I j, size_type n)
@@ -1119,7 +1119,7 @@ namespace boost {
                 BOOST_DEDUCED_TYPENAME boost::iterator_traversal<I>::type
                     iterator_traversal_tag;
                 return initial_size(i, j, n, iterator_traversal_tag);
-            };
+            }
 
             template <class I>
             HASH_TABLE(I i, I j, size_type n,
@@ -1784,7 +1784,7 @@ namespace boost {
                 BOOST_DEDUCED_TYPENAME boost::iterator_traversal<I>::type
                     iterator_traversal_tag;
                 return insert_size(i, j, iterator_traversal_tag);
-            };
+            }
 
             // if hash function throws, or inserting > 1 element, basic exception safety
             // strong otherwise