boostorg/container
1
0
Fork 1
mirror of https://github.com/boostorg/container.git synced 2025-08-03 22:44:26 +02:00
Code Issues Packages Projects Releases Wiki Activity

Remove usage of C++11 features.

Browse Source
This commit is contained in:
Jan Eisenhauer
2019-06-11 12:04:43 +02:00
parent 628289cb00
commit 3f09061d78
2 changed files with 12 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
test/flat_map_test.cpp
View File

@@ -581,13 +581,13 @@ struct with_lookup_by_first
bool test_heterogeneous_lookup_by_partial_key()
{
flat_map<std::pair<int, int>,int, with_lookup_by_first> const map1
{
{{0, 1}, 3},
{{0, 2}, 3},
};
typedef flat_map<std::pair<int, int>,int, with_lookup_by_first> map_t;
auto const first_0_range = map1.equal_range(0);
map_t map1;
map1[std::pair<int, int>(0, 1)] = 3;
map1[std::pair<int, int>(0, 2)] = 3;
std::pair<map_t::iterator, map_t::iterator> const first_0_range = map1.equal_range(0);
return 2 == first_0_range.second - first_0_range.first;
}

12
test/flat_set_test.cpp
View File

@@ -597,13 +597,13 @@ struct with_lookup_by_first
bool test_heterogeneous_lookup_by_partial_key()
{
flat_set<std::pair<int, int>, with_lookup_by_first> const set1
{
{0, 1},
{0, 2},
};
typedef flat_set<std::pair<int, int>, with_lookup_by_first> set_t;
auto const first_0_range = set1.equal_range(0);
set_t set1;
set1.insert(std::pair<int, int>(0, 1));
set1.insert(std::pair<int, int>(0, 2));
std::pair<set_t::iterator, set_t::iterator> const first_0_range = set1.equal_range(0);
return 2 == first_0_range.second - first_0_range.first;
}