1 files changed, 169 insertions, 0 deletions
diff --git a/tests/run/cpp_stl_multiset.pyx b/tests/run/cpp_stl_multiset.pyx
new file mode 100644
index 000000000..655526cfa
--- /dev/null
+++ b/tests/run/cpp_stl_multiset.pyx
@@ -0,0 +1,169 @@
+# mode: run
+# tag: cpp, cpp11
+
+# cython: language_level=3
+
+from libcpp.set cimport multiset
+from libcpp.unordered_set cimport unordered_multiset
+
+def test_multiset_insert(vals):
+    """
+    >>> test_multiset_insert([1,2,2,3, -1])
+    [-1, 1, 2, 2, 3]
+    """
+    cdef multiset[int] ms = multiset[int]()
+    cdef multiset[int].iterator it
+    for v in vals:
+        it = ms.insert(v)
+    return [ item for item in ms ]
+
+def test_multiset_insert_it(vals):
+    """
+    >>> test_multiset_insert_it([1,2,2,3, -1])
+    [-1, 1, 2, 2, 3]
+    """
+    cdef unordered_multiset[int] ums = unordered_multiset[int]()
+    cdef multiset[int] ms = multiset[int]()
+    for v in vals:
+        ums.insert(v)
+    ms.insert(ums.begin(), ums.end())
+    return [ item for item in ms ]
+
+def test_const_multiset_insert_it(vals):
+    """
+    >>> test_const_multiset_insert_it([1,2,2,3, -1])
+    [-1, 1, 2, 2, 3]
+    """
+    cdef unordered_multiset[int] ums = unordered_multiset[int]()
+    cdef multiset[int] ms = multiset[int]()
+    for v in vals:
+        ums.insert(v)
+    ms.insert(ums.cbegin(), ums.cend())
+    return [ item for item in ms ]
+
+def test_multiset_count(vals, to_find):
+    """
+    >>> test_multiset_count([1,2,2,3, -1], 1)
+    1
+    >>> test_multiset_count([1,2,2,3, -1], 2)
+    2
+    """
+    cdef multiset[int] ms = multiset[int]()
+    for v in vals:
+        ms.insert(v)
+    return ms.count(to_find)
+
+def test_multiset_erase(vals, int to_remove):
+    """
+    >>> test_multiset_erase([1,2,2,3, -1], 1)
+    [-1, 2, 2, 3]
+    >>> test_multiset_erase([1,2,2,3, -1], 2)  # removes both copies of 2
+    [-1, 1, 3]
+    """
+    cdef multiset[int] ms = multiset[int]()
+    cdef size_t ret
+    for v in vals:
+        ms.insert(v)
+    ret = ms.erase(to_remove)
+    return [ item for item in ms ]
+
+def test_multiset_find_erase(vals, to_remove):
+    """
+    >>> test_multiset_find_erase([1,2,2,3, -1], 1)
+    [-1, 2, 2, 3]
+    >>> test_multiset_find_erase([1,2,2,3, -1], 2)  # removes a single copy of 2
+    [-1, 1, 2, 3]
+    """
+    cdef multiset[int] ms = multiset[int]()
+    cdef multiset[int].iterator it
+    for v in vals:
+        ms.insert(v)
+    it = ms.find(to_remove)
+    it = ms.erase(it)
+    return [ item for item in ms ]
+
+
+def test_unordered_multiset_insert(vals):
+    """
+    >>> test_unordered_multiset_insert([1,2,2,3, -1])
+    [-1, 1, 2, 2, 3]
+    """
+    cdef unordered_multiset[int] ums = unordered_multiset[int]()
+    cdef unordered_multiset[int].iterator it
+    for v in vals:
+        it = ums.insert(v)
+    return sorted([ item for item in ums ])
+
+def test_unordered_multiset_insert_it(vals):
+    """
+    >>> test_unordered_multiset_insert_it([1,2,2,3, -1])
+    [-1, 1, 2, 2, 3]
+    """
+    cdef multiset[int] ms = multiset[int]()
+    cdef unordered_multiset[int] ums = unordered_multiset[int]()
+    for v in vals:
+        ms.insert(v)
+    ums.insert(ms.begin(), ms.end())
+    return sorted([ item for item in ums ])
+
+def test_const_unordered_multiset_insert_it(vals):
+    """
+    >>> test_const_unordered_multiset_insert_it([1,2,2,3, -1])
+    [-1, 1, 2, 2, 3]
+    """
+    cdef multiset[int] ms = multiset[int]()
+    cdef unordered_multiset[int] ums = unordered_multiset[int]()
+    for v in vals:
+        ms.insert(v)
+    ums.insert(ms.cbegin(), ms.cend())
+    return sorted([ item for item in ums ])
+
+def test_unordered_multiset_count(vals, to_find):
+    """
+    >>> test_unordered_multiset_count([1,2,2,3, -1], 1)
+    1
+    >>> test_unordered_multiset_count([1,2,2,3, -1], 2)
+    2
+    """
+    cdef unordered_multiset[int] ums = unordered_multiset[int]()
+    for v in vals:
+        ums.insert(v)
+    return ums.count(to_find)
+
+def test_unordered_multiset_erase(vals, int to_remove):
+    """
+    >>> test_unordered_multiset_erase([1,2,2,3, -1], 1)
+    [-1, 2, 2, 3]
+    >>> test_unordered_multiset_erase([1,2,2,3, -1], 2)  # removes both copies of 2
+    [-1, 1, 3]
+    """
+    cdef unordered_multiset[int] ums = unordered_multiset[int]()
+    cdef size_t ret
+    for v in vals:
+        ums.insert(v)
+    ret = ums.erase(to_remove)
+    return sorted([ item for item in ums ])
+
+def test_unordered_multiset_find_erase(vals, to_remove):
+    """
+    >>> test_unordered_multiset_find_erase([1,2,2,3, -1], 1)
+    [-1, 2, 2, 3]
+    >>> test_unordered_multiset_find_erase([1,2,2,3, -1], 2)  # removes a single copy of 2
+    [-1, 1, 2, 3]
+    """
+    cdef unordered_multiset[int] ums = unordered_multiset[int]()
+    cdef unordered_multiset[int].iterator it
+    for v in vals:
+        ums.insert(v)
+    it = ums.find(to_remove)
+    it = ums.erase(it)
+    return sorted([ item for item in ums ])
+
+
+def test_unordered_multiset_misc():
+    """
+    >>> test_unordered_multiset_misc()
+    """
+    cdef unordered_multiset[int] ms = unordered_multiset[int]()
+    ms.insert(1)
+    assert ms.load_factor() > 0