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

Merged revisions 42942-43116 via svnmerge from

Browse Source 
https://svn.boost.org/svn/boost/branches/unordered/trunk

........
  r42975 | danieljames | 2008-01-26 00:29:32 +0000 (Sat, 26 Jan 2008) | 1 line
  
  Typedef some types before using them, to make life easier for Borland.
........
  r43116 | danieljames | 2008-02-05 20:47:44 +0000 (Tue, 05 Feb 2008) | 1 line
  
  Some compilers and libraries combinations have problems with deques of non-assingable types. Using a list instead.
........


[SVN r43118]
This commit is contained in:
Daniel James
2008-02-05 20:57:02 +00:00
parent b72206e5a0
commit 61004d385e
3 changed files with 16 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
test/unordered/equivalent_keys_tests.cpp
View File

@@ -8,7 +8,7 @@
#include <boost/detail/lightweight_test.hpp>
#include <algorithm>
#include <map>
#include <deque>
#include <list>
#include "../helpers/tracker.hpp"
#include "../helpers/invariants.hpp"
@@ -57,7 +57,7 @@ void set_tests()
void map_tests()
{
typedef std::deque<std::pair<int const, int> > values_type;
typedef std::list<std::pair<int const, int> > values_type;
values_type v[5];
v[0].push_back(std::pair<int const, int>(1,1));
v[1].push_back(std::pair<int const, int>(28,34));