diff options
Diffstat (limited to 'test/std/containers/unord/unord.map/unorder.map.modifiers/erase_iter_db2.pass.cpp')
-rw-r--r-- | test/std/containers/unord/unord.map/unorder.map.modifiers/erase_iter_db2.pass.cpp | 42 |
1 files changed, 42 insertions, 0 deletions
diff --git a/test/std/containers/unord/unord.map/unorder.map.modifiers/erase_iter_db2.pass.cpp b/test/std/containers/unord/unord.map/unorder.map.modifiers/erase_iter_db2.pass.cpp new file mode 100644 index 000000000000..05046f5dedc1 --- /dev/null +++ b/test/std/containers/unord/unord.map/unorder.map.modifiers/erase_iter_db2.pass.cpp @@ -0,0 +1,42 @@ +//===----------------------------------------------------------------------===// +// +// The LLVM Compiler Infrastructure +// +// This file is dual licensed under the MIT and the University of Illinois Open +// Source Licenses. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// + +// <unordered_map> + +// Call erase(const_iterator position) with iterator from another container + +#if _LIBCPP_DEBUG >= 1 + +#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) + +#include <unordered_map> +#include <cassert> +#include <cstdlib> +#include <exception> + +int main() +{ + { + typedef std::pair<int, int> P; + P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; + std::unordered_map<int, int> l1(a1, a1+3); + std::unordered_map<int, int> l2(a1, a1+3); + std::unordered_map<int, int>::const_iterator i = l2.begin(); + l1.erase(i); + assert(false); + } +} + +#else + +int main() +{ +} + +#endif |