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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
|
# mode: run
# tag: cpp, werror, cpp11, no-cpp-locals
from __future__ import print_function
from libcpp cimport bool
from libcpp.algorithm cimport is_sorted, is_sorted_until, sort, partial_sort, partial_sort_copy, stable_sort
from libcpp.algorithm cimport nth_element
from libcpp.functional cimport greater
from libcpp.iterator cimport distance
from libcpp.string cimport string
from libcpp.vector cimport vector
def is_sorted_ints(vector[int] values):
"""
Test is_sorted.
>>> is_sorted_ints([3, 1, 4, 1, 5])
False
>>> is_sorted_ints([1, 1, 3, 4, 5])
True
"""
return is_sorted(values.begin(), values.end())
def initial_sorted_elements(vector[int] values):
"""
Test is_sorted_until.
>>> initial_sorted_elements([4, 1, 9, 5, 1, 3])
1
>>> initial_sorted_elements([4, 5, 9, 3, 1, 1])
3
>>> initial_sorted_elements([9, 3, 1, 4, 5, 1])
1
>>> initial_sorted_elements([1, 3, 5, 4, 1, 9])
3
>>> initial_sorted_elements([5, 9, 1, 1, 3, 4])
2
>>> initial_sorted_elements([4, 9, 1, 5, 1, 3])
2
>>> initial_sorted_elements([1, 1, 4, 9, 5, 3])
4
"""
sorted_end = is_sorted_until(values.begin(), values.end())
return distance(values.begin(), sorted_end)
def sort_ints(vector[int] values):
"""Test sort using the default operator<.
>>> sort_ints([5, 7, 4, 2, 8, 6, 1, 9, 0, 3])
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
"""
sort(values.begin(), values.end())
return values
def sort_ints_reverse(vector[int] values):
"""Test sort using a standard library comparison function object.
>>> sort_ints_reverse([5, 7, 4, 2, 8, 6, 1, 9, 0, 3])
[9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
"""
sort(values.begin(), values.end(), greater[int]())
return values
def partial_sort_ints(vector[int] values, int k):
"""
Test partial_sort using the default operator<.
>>> partial_sort_ints([4, 2, 3, 1, 5], 2)[:2]
[1, 2]
"""
partial_sort(values.begin(), values.begin() + k, values.end())
return values
def partial_sort_ints_reverse(vector[int] values, int k):
"""
Test partial_sort using a standard library comparison function object.
>>> partial_sort_ints_reverse([4, 2, 3, 1, 5], 2)[:2]
[5, 4]
"""
partial_sort(values.begin(), values.begin() + k, values.end(), greater[int]())
return values
def partial_sort_ints2(vector[int] values, int k):
"""
Test partial_sort_copy using the default operator<.
>>> partial_sort_ints2([4, 2, 3, 1, 5], 2)
[1, 2]
"""
output = vector[int](2)
partial_sort_copy(values.begin(), values.end(), output.begin(), output.end())
return output
def partial_sort_ints_reverse2(vector[int] values, int k):
"""
Test partial_sort_copy using a standard library comparison function object.
>>> partial_sort_ints_reverse2([4, 2, 3, 1, 5], 2)
[5, 4]
"""
output = vector[int](2)
partial_sort_copy(values.begin(), values.end(), output.begin(), output.end(), greater[int]())
return output
cdef extern from *:
"""
struct Employee
{
Employee() = default;
Employee(int age, std::string name): age(age), name(name) {}
int age;
std::string name; // Does not participate in comparisons
};
bool operator<(const Employee& lhs, const Employee& rhs)
{
return lhs.age < rhs.age;
}
"""
cppclass Employee:
Employee()
Employee(int, string)
int age
string name
cdef bool Employee_greater(const Employee& lhs, const Employee& rhs):
return lhs.age > rhs.age
def test_stable_sort():
"""
Test stable_sort using cppreference example.
>>> test_stable_sort()
32, Arthur
108, Zaphod
108, Ford
108, Zaphod
108, Ford
32, Arthur
"""
cdef vector[Employee] employees
employees.push_back(Employee(108, <string>b"Zaphod"))
employees.push_back(Employee(32, <string>b"Arthur"))
employees.push_back(Employee(108, <string>b"Ford"))
stable_sort(employees.begin(), employees.end())
for e in employees:
print("%s, %s" % (e.age, <str>(e.name).decode("ascii")))
stable_sort(employees.begin(), employees.end(), &Employee_greater)
for e in employees:
print("%s, %s" % (e.age, <str>(e.name).decode("ascii")))
def second_smallest(vector[int] values):
"""
Test nth_element using the default operator<.
>>> second_smallest([5, 6, 4, 3, 2, 6, 7, 9, 3])
3
"""
nth_element(values.begin(), values.begin() + 1, values.end())
return values[1]
def second_largest(vector[int] values):
"""
Test nth_element using a standard library comparison function object.
>>> second_largest([5, 6, 4, 3, 2, 6, 7, 9, 3])
7
"""
nth_element(values.begin(), values.begin() + 1, values.end(), greater[int]())
return values[1]
|
