feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

Remove some superfluous semi-colons from the unordered container

Browse Source 
implementation.


[SVN r3619]
This commit is contained in:
Daniel James
2007-01-10 00:04:00 +00:00
parent 9e51e23cea
commit add94f8385
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
include/boost/unordered/detail/hash_table_impl.hpp
View File

@@ -1104,14 +1104,14 @@ namespace boost {
{ {
// max load factor isn't set yet, but when it is, it'll be 1.0. // 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); return (std::max)(static_cast<size_type>(std::distance(i, j)) + 1, n);
}; }
template <class I> template <class I>
size_type initial_size(I, I, size_type n, size_type initial_size(I, I, size_type n,
boost::incrementable_traversal_tag) boost::incrementable_traversal_tag)
{ {
return n; return n;
}; }
template <class I> template <class I>
size_type initial_size(I i, I j, size_type n) 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 BOOST_DEDUCED_TYPENAME boost::iterator_traversal<I>::type
iterator_traversal_tag; iterator_traversal_tag;
return initial_size(i, j, n, iterator_traversal_tag); return initial_size(i, j, n, iterator_traversal_tag);
}; }
template <class I> template <class I>
HASH_TABLE(I i, I j, size_type n, HASH_TABLE(I i, I j, size_type n,
@@ -1784,7 +1784,7 @@ namespace boost {
BOOST_DEDUCED_TYPENAME boost::iterator_traversal<I>::type BOOST_DEDUCED_TYPENAME boost::iterator_traversal<I>::type
iterator_traversal_tag; iterator_traversal_tag;
return insert_size(i, j, iterator_traversal_tag); return insert_size(i, j, iterator_traversal_tag);
}; }
// if hash function throws, or inserting > 1 element, basic exception safety // if hash function throws, or inserting > 1 element, basic exception safety
// strong otherwise // strong otherwise