1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
# 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]()
for v in vals:
ms.insert(v)
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]()
for v in vals:
ms.insert(v)
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]()
for v in vals:
ms.insert(v)
it = ms.find(to_remove)
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] ms = unordered_multiset[int]()
for v in vals:
ms.insert(v)
return sorted([ item for item in ms ])
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] ms = unordered_multiset[int]()
for v in vals:
ms.insert(v)
return ms.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] ms = unordered_multiset[int]()
for v in vals:
ms.insert(v)
ms.erase(to_remove)
return sorted([ item for item in ms ])
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] ms = unordered_multiset[int]()
for v in vals:
ms.insert(v)
it = ms.find(to_remove)
ms.erase(it)
return sorted([ item for item in ms ])
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
|
