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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
|
# mode: run
# tag: cpp, cpp11
# cython: language_level=3
from libcpp.map cimport multimap
from libcpp.unordered_map cimport unordered_multimap
from libcpp.utility cimport pair
def test_multimap_insert(vals):
"""
>>> test_multimap_insert([(1,1),(2,2),(2,2),(3,3),(-1,-1)])
[(-1, -1), (1, 1), (2, 2), (2, 2), (3, 3)]
"""
cdef multimap[int,int] mm = multimap[int, int]()
cdef multimap[int, int].iterator it
for v in vals:
it = mm.insert(v)
return [ (item.first, item.second) for item in mm ]
def test_multimap_insert_it(vals):
"""
>>> test_multimap_insert_it([(1,1),(2,2),(2,2),(3,3),(-1,-1)])
[(-1, -1), (1, 1), (2, 2), (2, 2), (3, 3)]
"""
cdef unordered_multimap[int,int] umm = unordered_multimap[int,int]()
cdef multimap[int,int] mm = multimap[int,int]()
for k, v in vals:
umm.insert(pair[int,int](k, v))
mm.insert(umm.begin(), umm.end())
return [ (item.first, item.second) for item in mm ]
def test_const_multimap_insert_it(vals):
"""
>>> test_const_multimap_insert_it([(1,1),(2,2),(2,2),(3,3),(-1,-1)])
[(-1, -1), (1, 1), (2, 2), (2, 2), (3, 3)]
"""
cdef unordered_multimap[int,int] umm = unordered_multimap[int,int]()
cdef multimap[int,int] mm = multimap[int,int]()
for k, v in vals:
umm.insert(pair[int,int](k, v))
mm.insert(umm.cbegin(), umm.cend())
return [ (item.first, item.second) for item in mm ]
def test_multimap_count(vals, to_find):
"""
>>> test_multimap_count([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 1)
1
>>> test_multimap_count([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 2)
2
"""
cdef multimap[int,int] mm = multimap[int,int]()
for v in vals:
mm.insert(v)
return mm.count(to_find)
def test_multimap_erase(vals, int to_remove):
"""
>>> test_multimap_erase([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 1)
[(-1, -1), (2, 2), (2, 2), (3, 3)]
>>> test_multimap_erase([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 2)
[(-1, -1), (1, 1), (3, 3)]
"""
cdef multimap[int,int] mm = multimap[int,int]()
for v in vals:
mm.insert(v)
cdef size_t ret = mm.erase(to_remove)
return [ (item.first, item.second) for item in mm ]
def test_multimap_find_erase(vals, to_remove):
"""
>>> test_multimap_find_erase([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 1)
[(-1, -1), (2, 2), (2, 2), (3, 3)]
>>> test_multimap_find_erase([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 2)
[(-1, -1), (1, 1), (2, 2), (3, 3)]
"""
cdef multimap[int,int] mm = multimap[int,int]()
cdef multimap[int,int].iterator it
for v in vals:
mm.insert(v)
it = mm.find(to_remove)
it = mm.erase(it)
return [ (item.first, item.second) for item in mm ]
def test_unordered_multimap_insert(vals):
"""
>>> test_unordered_multimap_insert([(1,1),(2,2),(2,2),(3,3),(-1,-1)])
[(-1, -1), (1, 1), (2, 2), (2, 2), (3, 3)]
"""
cdef unordered_multimap[int,int] umm = unordered_multimap[int,int]()
cdef unordered_multimap[int,int].iterator it
for v in vals:
it = umm.insert(v)
return sorted([ (item.first, item.second) for item in umm ])
def test_unordered_multimap_insert_it(vals):
"""
>>> test_unordered_multimap_insert_it([(1,1),(2,2),(2,2),(3,3),(-1,-1)])
[(-1, -1), (1, 1), (2, 2), (2, 2), (3, 3)]
"""
cdef multimap[int,int] mm = multimap[int,int]()
cdef unordered_multimap[int,int] umm = unordered_multimap[int,int]()
for v in vals:
mm.insert(v)
umm.insert(mm.begin(), mm.end())
return sorted([ (item.first, item.second) for item in umm ])
def test_const_unordered_multimap_insert_it(vals):
"""
>>> test_const_unordered_multimap_insert_it([(1,1),(2,2),(2,2),(3,3),(-1,-1)])
[(-1, -1), (1, 1), (2, 2), (2, 2), (3, 3)]
"""
cdef multimap[int,int] mm = multimap[int,int]()
cdef unordered_multimap[int,int] umm = unordered_multimap[int,int]()
for v in vals:
mm.insert(v)
umm.insert(mm.cbegin(), mm.cend())
return sorted([ (item.first, item.second) for item in umm ])
def test_unordered_multimap_count(vals, to_find):
"""
>>> test_unordered_multimap_count([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 1)
1
>>> test_unordered_multimap_count([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 2)
2
"""
cdef unordered_multimap[int,int] umm = unordered_multimap[int,int]()
for v in vals:
umm.insert(v)
return umm.count(to_find)
def test_unordered_multimap_erase(vals, int to_remove):
"""
>>> test_unordered_multimap_erase([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 1)
[(-1, -1), (2, 2), (2, 2), (3, 3)]
>>> test_unordered_multimap_erase([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 2)
[(-1, -1), (1, 1), (3, 3)]
"""
cdef unordered_multimap[int,int] umm = unordered_multimap[int,int]()
for v in vals:
umm.insert(v)
cdef size_t ret = umm.erase(to_remove)
return sorted([ (item.first, item.second) for item in umm ])
def test_unordered_multimap_find_erase(vals, to_remove):
"""
>>> test_unordered_multimap_find_erase([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 1)
[(-1, -1), (2, 2), (2, 2), (3, 3)]
>>> test_unordered_multimap_find_erase([(1,1),(2,2),(2,2),(3,3),(-1,-1)], 2)
[(-1, -1), (1, 1), (2, 2), (3, 3)]
"""
cdef unordered_multimap[int,int] umm = unordered_multimap[int,int]()
cdef unordered_multimap[int,int].iterator it
for v in vals:
umm.insert(v)
it = umm.find(to_remove)
it = umm.erase(it)
return sorted([ item for item in umm ])
|
