Author: marshall
Date: Tue Nov 14 21:25:36 2017
New Revision: 318268
URL: http://llvm.org/viewvc/llvm-project?rev=318268&view=rev
Log:
Still more missing tests - this time for the unordered containers
Added:
libcxx/trunk/test/std/containers/unord/unord.map/empty.pass.cpp
libcxx/trunk/test/std/containers/unord/unord.map/size.pass.cpp
libcxx/trunk/test/std/containers/unord/unord.multimap/empty.pass.cpp
libcxx/trunk/test/std/containers/unord/unord.multimap/size.pass.cpp
libcxx/trunk/test/std/containers/unord/unord.multiset/empty.pass.cpp
libcxx/trunk/test/std/containers/unord/unord.multiset/size.pass.cpp
libcxx/trunk/test/std/containers/unord/unord.set/empty.pass.cpp
libcxx/trunk/test/std/containers/unord/unord.set/size.pass.cpp
Added: libcxx/trunk/test/std/containers/unord/unord.map/empty.pass.cpp
URL:
http://llvm.org/viewvc/llvm-project/libcxx/trunk/test/std/containers/unord/unord.map/empty.pass.cpp?rev=318268&view=auto
==============================================================================
--- libcxx/trunk/test/std/containers/unord/unord.map/empty.pass.cpp (added)
+++ libcxx/trunk/test/std/containers/unord/unord.map/empty.pass.cpp Tue Nov 14
21:25:36 2017
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// 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>
+
+// class unordered_map
+
+// bool empty() const noexcept;
+
+#include <unordered_map>
+#include <cassert>
+
+#include "test_macros.h"
+#include "min_allocator.h"
+
+int main()
+{
+ {
+ typedef std::unordered_map<int, double> M;
+ M m;
+ ASSERT_NOEXCEPT(m.empty());
+ assert(m.empty());
+ m.insert(M::value_type(1, 1.5));
+ assert(!m.empty());
+ m.clear();
+ assert(m.empty());
+ }
+#if TEST_STD_VER >= 11
+ {
+ typedef std::unordered_map<int, double, std::hash<int>,
std::equal_to<int>, min_allocator<std::pair<const int, double>>> M;
+ M m;
+ ASSERT_NOEXCEPT(m.empty());
+ assert(m.empty());
+ m.insert(M::value_type(1, 1.5));
+ assert(!m.empty());
+ m.clear();
+ assert(m.empty());
+ }
+#endif
+}
Added: libcxx/trunk/test/std/containers/unord/unord.map/size.pass.cpp
URL:
http://llvm.org/viewvc/llvm-project/libcxx/trunk/test/std/containers/unord/unord.map/size.pass.cpp?rev=318268&view=auto
==============================================================================
--- libcxx/trunk/test/std/containers/unord/unord.map/size.pass.cpp (added)
+++ libcxx/trunk/test/std/containers/unord/unord.map/size.pass.cpp Tue Nov 14
21:25:36 2017
@@ -0,0 +1,62 @@
+//===----------------------------------------------------------------------===//
+//
+// 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>
+
+// class unordered_map
+
+// size_type size() const noexcept;
+
+#include <unordered_map>
+#include <cassert>
+
+#include "test_macros.h"
+#include "min_allocator.h"
+
+int main()
+{
+ {
+ typedef std::unordered_map<int, double> M;
+ M m;
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == 0);
+ m.insert(M::value_type(2, 1.5));
+ assert(m.size() == 1);
+ m.insert(M::value_type(1, 1.5));
+ assert(m.size() == 2);
+ m.insert(M::value_type(3, 1.5));
+ assert(m.size() == 3);
+ m.erase(m.begin());
+ assert(m.size() == 2);
+ m.erase(m.begin());
+ assert(m.size() == 1);
+ m.erase(m.begin());
+ assert(m.size() == 0);
+ }
+#if TEST_STD_VER >= 11
+ {
+ typedef std::unordered_map<int, double, std::hash<int>,
std::equal_to<int>, min_allocator<std::pair<const int, double>>> M;
+ M m;
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == 0);
+ m.insert(M::value_type(2, 1.5));
+ assert(m.size() == 1);
+ m.insert(M::value_type(1, 1.5));
+ assert(m.size() == 2);
+ m.insert(M::value_type(3, 1.5));
+ assert(m.size() == 3);
+ m.erase(m.begin());
+ assert(m.size() == 2);
+ m.erase(m.begin());
+ assert(m.size() == 1);
+ m.erase(m.begin());
+ assert(m.size() == 0);
+ }
+#endif
+}
Added: libcxx/trunk/test/std/containers/unord/unord.multimap/empty.pass.cpp
URL:
http://llvm.org/viewvc/llvm-project/libcxx/trunk/test/std/containers/unord/unord.multimap/empty.pass.cpp?rev=318268&view=auto
==============================================================================
--- libcxx/trunk/test/std/containers/unord/unord.multimap/empty.pass.cpp (added)
+++ libcxx/trunk/test/std/containers/unord/unord.multimap/empty.pass.cpp Tue
Nov 14 21:25:36 2017
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// 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>
+
+// class unordered_multimap
+
+// bool empty() const noexcept;
+
+#include <unordered_map>
+#include <cassert>
+
+#include "test_macros.h"
+#include "min_allocator.h"
+
+int main()
+{
+ {
+ typedef std::unordered_multimap<int, double> M;
+ M m;
+ ASSERT_NOEXCEPT(m.empty());
+ assert(m.empty());
+ m.insert(M::value_type(1, 1.5));
+ assert(!m.empty());
+ m.clear();
+ assert(m.empty());
+ }
+#if TEST_STD_VER >= 11
+ {
+ typedef std::unordered_multimap<int, double, std::hash<int>,
std::equal_to<int>, min_allocator<std::pair<const int, double>>> M;
+ M m;
+ ASSERT_NOEXCEPT(m.empty());
+ assert(m.empty());
+ m.insert(M::value_type(1, 1.5));
+ assert(!m.empty());
+ m.clear();
+ assert(m.empty());
+ }
+#endif
+}
Added: libcxx/trunk/test/std/containers/unord/unord.multimap/size.pass.cpp
URL:
http://llvm.org/viewvc/llvm-project/libcxx/trunk/test/std/containers/unord/unord.multimap/size.pass.cpp?rev=318268&view=auto
==============================================================================
--- libcxx/trunk/test/std/containers/unord/unord.multimap/size.pass.cpp (added)
+++ libcxx/trunk/test/std/containers/unord/unord.multimap/size.pass.cpp Tue Nov
14 21:25:36 2017
@@ -0,0 +1,62 @@
+//===----------------------------------------------------------------------===//
+//
+// 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>
+
+// class unordered_multimap
+
+// size_type size() const noexcept;
+
+#include <unordered_map>
+#include <cassert>
+
+#include "test_macros.h"
+#include "min_allocator.h"
+
+int main()
+{
+ {
+ typedef std::unordered_multimap<int, double> M;
+ M m;
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == 0);
+ m.insert(M::value_type(2, 1.5));
+ assert(m.size() == 1);
+ m.insert(M::value_type(1, 1.5));
+ assert(m.size() == 2);
+ m.insert(M::value_type(3, 1.5));
+ assert(m.size() == 3);
+ m.erase(m.begin());
+ assert(m.size() == 2);
+ m.erase(m.begin());
+ assert(m.size() == 1);
+ m.erase(m.begin());
+ assert(m.size() == 0);
+ }
+#if TEST_STD_VER >= 11
+ {
+ typedef std::unordered_multimap<int, double, std::hash<int>,
std::equal_to<int>, min_allocator<std::pair<const int, double>>> M;
+ M m;
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == 0);
+ m.insert(M::value_type(2, 1.5));
+ assert(m.size() == 1);
+ m.insert(M::value_type(1, 1.5));
+ assert(m.size() == 2);
+ m.insert(M::value_type(3, 1.5));
+ assert(m.size() == 3);
+ m.erase(m.begin());
+ assert(m.size() == 2);
+ m.erase(m.begin());
+ assert(m.size() == 1);
+ m.erase(m.begin());
+ assert(m.size() == 0);
+ }
+#endif
+}
Added: libcxx/trunk/test/std/containers/unord/unord.multiset/empty.pass.cpp
URL:
http://llvm.org/viewvc/llvm-project/libcxx/trunk/test/std/containers/unord/unord.multiset/empty.pass.cpp?rev=318268&view=auto
==============================================================================
--- libcxx/trunk/test/std/containers/unord/unord.multiset/empty.pass.cpp (added)
+++ libcxx/trunk/test/std/containers/unord/unord.multiset/empty.pass.cpp Tue
Nov 14 21:25:36 2017
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// 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_set>
+
+// class unordered_multiset
+
+// bool empty() const noexcept;
+
+#include <unordered_set>
+#include <cassert>
+
+#include "test_macros.h"
+#include "min_allocator.h"
+
+int main()
+{
+ {
+ typedef std::unordered_multiset<int> M;
+ M m;
+ ASSERT_NOEXCEPT(m.empty());
+ assert(m.empty());
+ m.insert(M::value_type(1));
+ assert(!m.empty());
+ m.clear();
+ assert(m.empty());
+ }
+#if TEST_STD_VER >= 11
+ {
+ typedef std::unordered_multiset<int, std::hash<int>, std::equal_to<int>,
min_allocator<int>> M;
+ M m;
+ ASSERT_NOEXCEPT(m.empty());
+ assert(m.empty());
+ m.insert(M::value_type(1));
+ assert(!m.empty());
+ m.clear();
+ assert(m.empty());
+ }
+#endif
+}
Added: libcxx/trunk/test/std/containers/unord/unord.multiset/size.pass.cpp
URL:
http://llvm.org/viewvc/llvm-project/libcxx/trunk/test/std/containers/unord/unord.multiset/size.pass.cpp?rev=318268&view=auto
==============================================================================
--- libcxx/trunk/test/std/containers/unord/unord.multiset/size.pass.cpp (added)
+++ libcxx/trunk/test/std/containers/unord/unord.multiset/size.pass.cpp Tue Nov
14 21:25:36 2017
@@ -0,0 +1,62 @@
+//===----------------------------------------------------------------------===//
+//
+// 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_set>
+
+// class unordered_multiset
+
+// size_type size() const noexcept;
+
+#include <unordered_set>
+#include <cassert>
+
+#include "test_macros.h"
+#include "min_allocator.h"
+
+int main()
+{
+ {
+ typedef std::unordered_multiset<int> M;
+ M m;
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == 0);
+ m.insert(M::value_type(2));
+ assert(m.size() == 1);
+ m.insert(M::value_type(1));
+ assert(m.size() == 2);
+ m.insert(M::value_type(3));
+ assert(m.size() == 3);
+ m.erase(m.begin());
+ assert(m.size() == 2);
+ m.erase(m.begin());
+ assert(m.size() == 1);
+ m.erase(m.begin());
+ assert(m.size() == 0);
+ }
+#if TEST_STD_VER >= 11
+ {
+ typedef std::unordered_multiset<int, std::hash<int>, std::equal_to<int>,
min_allocator<int>> M;
+ M m;
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == 0);
+ m.insert(M::value_type(2));
+ assert(m.size() == 1);
+ m.insert(M::value_type(1));
+ assert(m.size() == 2);
+ m.insert(M::value_type(3));
+ assert(m.size() == 3);
+ m.erase(m.begin());
+ assert(m.size() == 2);
+ m.erase(m.begin());
+ assert(m.size() == 1);
+ m.erase(m.begin());
+ assert(m.size() == 0);
+ }
+#endif
+}
Added: libcxx/trunk/test/std/containers/unord/unord.set/empty.pass.cpp
URL:
http://llvm.org/viewvc/llvm-project/libcxx/trunk/test/std/containers/unord/unord.set/empty.pass.cpp?rev=318268&view=auto
==============================================================================
--- libcxx/trunk/test/std/containers/unord/unord.set/empty.pass.cpp (added)
+++ libcxx/trunk/test/std/containers/unord/unord.set/empty.pass.cpp Tue Nov 14
21:25:36 2017
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// 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_set>
+
+// class unordered_set
+
+// bool empty() const noexcept;
+
+#include <unordered_set>
+#include <cassert>
+
+#include "test_macros.h"
+#include "min_allocator.h"
+
+int main()
+{
+ {
+ typedef std::unordered_set<int> M;
+ M m;
+ ASSERT_NOEXCEPT(m.empty());
+ assert(m.empty());
+ m.insert(M::value_type(1));
+ assert(!m.empty());
+ m.clear();
+ assert(m.empty());
+ }
+#if TEST_STD_VER >= 11
+ {
+ typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>,
min_allocator<int>> M;
+ M m;
+ ASSERT_NOEXCEPT(m.empty());
+ assert(m.empty());
+ m.insert(M::value_type(1));
+ assert(!m.empty());
+ m.clear();
+ assert(m.empty());
+ }
+#endif
+}
Added: libcxx/trunk/test/std/containers/unord/unord.set/size.pass.cpp
URL:
http://llvm.org/viewvc/llvm-project/libcxx/trunk/test/std/containers/unord/unord.set/size.pass.cpp?rev=318268&view=auto
==============================================================================
--- libcxx/trunk/test/std/containers/unord/unord.set/size.pass.cpp (added)
+++ libcxx/trunk/test/std/containers/unord/unord.set/size.pass.cpp Tue Nov 14
21:25:36 2017
@@ -0,0 +1,62 @@
+//===----------------------------------------------------------------------===//
+//
+// 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_set>
+
+// class unordered_set
+
+// size_type size() const noexcept;
+
+#include <unordered_set>
+#include <cassert>
+
+#include "test_macros.h"
+#include "min_allocator.h"
+
+int main()
+{
+ {
+ typedef std::unordered_set<int> M;
+ M m;
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == 0);
+ m.insert(M::value_type(2));
+ assert(m.size() == 1);
+ m.insert(M::value_type(1));
+ assert(m.size() == 2);
+ m.insert(M::value_type(3));
+ assert(m.size() == 3);
+ m.erase(m.begin());
+ assert(m.size() == 2);
+ m.erase(m.begin());
+ assert(m.size() == 1);
+ m.erase(m.begin());
+ assert(m.size() == 0);
+ }
+#if TEST_STD_VER >= 11
+ {
+ typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>,
min_allocator<int>> M;
+ M m;
+ ASSERT_NOEXCEPT(m.size());
+ assert(m.size() == 0);
+ m.insert(M::value_type(2));
+ assert(m.size() == 1);
+ m.insert(M::value_type(1));
+ assert(m.size() == 2);
+ m.insert(M::value_type(3));
+ assert(m.size() == 3);
+ m.erase(m.begin());
+ assert(m.size() == 2);
+ m.erase(m.begin());
+ assert(m.size() == 1);
+ m.erase(m.begin());
+ assert(m.size() == 0);
+ }
+#endif
+}
_______________________________________________
cfe-commits mailing list
cfe-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits
