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
|
# mode: run
# tag: cpp, cpp11
# cython: language_level=3
from libcpp.set cimport set
from libcpp.unordered_set cimport unordered_set
from libcpp.utility cimport pair
def test_set_insert(vals):
"""
>>> test_set_insert([1,2,2,3, -1])
[-1, 1, 2, 3]
"""
cdef set[int] s = set[int]()
cdef pair[set[int].iterator, bint] ret
for v in vals:
ret = s.insert(v)
return [item for item in s]
def test_set_insert_it(vals):
"""
>>> test_set_insert_it([1,2,2,3, -1])
[-1, 1, 2, 3]
"""
cdef unordered_set[int] us = unordered_set[int]()
cdef set[int] s = set[int]()
for v in vals:
us.insert(v)
s.insert(us.begin(), us.end())
return [item for item in s]
def test_set_count(vals, to_find):
"""
>>> test_set_count([1,2,2,3, -1], 1)
1
>>> test_set_count([1,2,2,3, -1], 2)
1
"""
cdef set[int] s = set[int]()
for v in vals:
s.insert(v)
return s.count(to_find)
def test_set_erase(vals, int to_remove):
"""
>>> test_set_erase([1,2,2,3, -1], 1)
[-1, 2, 3]
>>> test_set_erase([1,2,2,3, -1], 2)
[-1, 1, 3]
"""
cdef set[int] s = set[int]()
cdef size_t ret
for v in vals:
s.insert(v)
ret = s.erase(to_remove)
return [item for item in s]
def test_set_find_erase(vals, to_remove):
"""
>>> test_set_find_erase([1,2,2,3, -1], 1)
[-1, 2, 3]
>>> test_set_find_erase([1,2,2,3, -1], 2)
[-1, 1, 3]
"""
cdef set[int] s = set[int]()
cdef set[int].iterator it
for v in vals:
s.insert(v)
it = s.find(to_remove)
it = s.erase(it)
return [item for item in s]
def test_unordered_set_insert(vals):
"""
>>> test_unordered_set_insert([1,2,2,3, -1])
[-1, 1, 2, 3]
"""
cdef unordered_set[int] us = unordered_set[int]()
cdef pair[unordered_set[int].iterator, bint] ret
for v in vals:
ret = us.insert(v)
return sorted([item for item in us])
def test_unordered_set_insert_it(vals):
"""
>>> test_unordered_set_insert_it([1,2,2,3, -1])
[-1, 1, 2, 3]
"""
cdef set[int] s = set[int]()
cdef unordered_set[int] us = unordered_set[int]()
for v in vals:
s.insert(v)
us.insert(s.begin(), s.end())
return sorted([item for item in us])
def test_unordered_set_count(vals, to_find):
"""
>>> test_unordered_set_count([1,2,2,3, -1], 1)
1
>>> test_unordered_set_count([1,2,2,3, -1], 2)
1
"""
cdef unordered_set[int] us = unordered_set[int]()
for v in vals:
us.insert(v)
return us.count(to_find)
def test_unordered_set_erase(vals, int to_remove):
"""
>>> test_unordered_set_erase([1,2,2,3, -1], 1)
[-1, 2, 3]
>>> test_unordered_set_erase([1,2,2,3, -1], 2)
[-1, 1, 3]
"""
cdef unordered_set[int] us = unordered_set[int]()
cdef size_t ret
for v in vals:
us.insert(v)
ret = us.erase(to_remove)
return sorted([item for item in us])
def test_unordered_set_find_erase(vals, to_remove):
"""
>>> test_unordered_set_find_erase([1,2,2,3, -1], 1)
[-1, 2, 3]
>>> test_unordered_set_find_erase([1,2,2,3, -1], 2)
[-1, 1, 3]
"""
cdef unordered_set[int] us = unordered_set[int]()
cdef unordered_set[int].iterator it
for v in vals:
us.insert(v)
it = us.find(to_remove)
it = us.erase(it)
return sorted([item for item in us])
|
