Skip to content
Navigation Menu
{{ message }}
-
-
Notifications
You must be signed in to change notification settings - Fork 34.5k
Expand file tree
/
Copy path_bisectmodule.c
More file actions
477 lines (423 loc) · 13.1 KB
/
_bisectmodule.c
File metadata and controls
477 lines (423 loc) · 13.1 KB
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
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
/* Bisection algorithms. Drop in replacement for bisect.py
Converted to C by Dmitry Vasiliev (dima at hlabs.spb.ru).
*/
#ifndef Py_BUILD_CORE_BUILTIN
# define Py_BUILD_CORE_MODULE 1
#endif
#include "Python.h"
#include "pycore_call.h" // _PyObject_CallMethod()
/*[clinic input]
module _bisect
[clinic start generated code]*/
/*[clinic end generated code: output=da39a3ee5e6b4b0d input=4d56a2b2033b462b]*/
#include "clinic/_bisectmodule.c.h"
typedef struct {
PyObject *str_insert;
} bisect_state;
static inline bisect_state*
get_bisect_state(PyObject *module)
{
void *state = PyModule_GetState(module);
assert(state != NULL);
return (bisect_state *)state;
}
static ssizeargfunc
get_sq_item(PyObject *s)
{
// The parts of PySequence_GetItem that we only need to do once
PyTypeObject *tp = Py_TYPE(s);
PySequenceMethods *m = tp->tp_as_sequence;
if (m && m->sq_item) {
return m->sq_item;
}
const char *msg;
if (tp->tp_as_mapping && tp->tp_as_mapping->mp_subscript) {
msg = "%.200s is not a sequence";
}
else {
msg = "'%.200s' object does not support indexing";
}
PyErr_Format(PyExc_TypeError, msg, tp->tp_name);
return NULL;
}
static inline Py_ssize_t
internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi,
PyObject* key)
{
PyObject *litem;
Py_ssize_t mid;
int res;
if (hi == -1) {
hi = PySequence_Size(list);
if (hi < 0)
return -1;
}
ssizeargfunc sq_item = get_sq_item(list);
if (sq_item == NULL) {
return -1;
}
if (Py_EnterRecursiveCall(" in _bisect.bisect_right")) {
return -1;
}
PyTypeObject *tp = Py_TYPE(item);
richcmpfunc compare = tp->tp_richcompare;
while (lo < hi) {
/* The (size_t)cast ensures that the addition and subsequent division
are performed as unsigned operations, avoiding difficulties from
signed overflow. (See issue 13496.) */
mid = ((size_t)lo + hi) / 2;
assert(mid >= 0);
// PySequence_GetItem, but we already checked the types.
litem = sq_item(list, mid);
assert((PyErr_Occurred() == NULL) ^ (litem == NULL));
if (litem == NULL) {
goto error;
}
if (key != Py_None) {
PyObject *newitem = PyObject_CallOneArg(key, litem);
if (newitem == NULL) {
goto error;
}
Py_SETREF(litem, newitem);
}
/* if item < key(list[mid]):
* hi = mid
* else:
* lo = mid + 1
*/
if (compare != NULL && Py_IS_TYPE(litem, tp)) {
// A fast path for comparing objects of the same type
PyObject *res_obj = compare(item, litem, Py_LT);
if (res_obj == Py_True) {
Py_DECREF(res_obj);
Py_DECREF(litem);
hi = mid;
continue;
}
if (res_obj == Py_False) {
Py_DECREF(res_obj);
Py_DECREF(litem);
lo = mid + 1;
continue;
}
if (res_obj == NULL) {
goto error;
}
if (res_obj == Py_NotImplemented) {
Py_DECREF(res_obj);
compare = NULL;
res = PyObject_RichCompareBool(item, litem, Py_LT);
}
else {
res = PyObject_IsTrue(res_obj);
Py_DECREF(res_obj);
}
}
else {
// A default path for comparing arbitrary objects
res = PyObject_RichCompareBool(item, litem, Py_LT);
}
if (res < 0) {
goto error;
}
Py_DECREF(litem);
if (res)
hi = mid;
else
lo = mid + 1;
}
Py_LeaveRecursiveCall();
return lo;
error:
Py_LeaveRecursiveCall();
Py_XDECREF(litem);
return -1;
}
/*[clinic input]
_bisect.bisect_right -> Py_ssize_t
a: object
x: object
lo: Py_ssize_t(allow_negative=False) = 0
hi: Py_ssize_t(c_default='-1', accept={int, NoneType}) = None
*
key: object = None
Return the index where to insert item x in list a, assuming a is sorted.
The return value i is such that all e in a[:i] have e <= x, and all e in
a[i:] have e > x. So if x already appears in the list, a.insert(i, x) will
insert just after the rightmost x already there.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
A custom key function can be supplied to customize the sort order.
[clinic start generated code]*/
static Py_ssize_t
_bisect_bisect_right_impl(PyObject *module, PyObject *a, PyObject *x,
Py_ssize_t lo, Py_ssize_t hi, PyObject *key)
/*[clinic end generated code: output=3a4bc09cc7c8a73d input=b476bc45667273ac]*/
{
return internal_bisect_right(a, x, lo, hi, key);
}
/*[clinic input]
_bisect.insort_right
a: object
x: object
lo: Py_ssize_t(allow_negative=False) = 0
hi: Py_ssize_t(c_default='-1', accept={int, NoneType}) = None
*
key: object = None
Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the right of the rightmost x.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
A custom key function can be supplied to customize the sort order.
[clinic start generated code]*/
static PyObject *
_bisect_insort_right_impl(PyObject *module, PyObject *a, PyObject *x,
Py_ssize_t lo, Py_ssize_t hi, PyObject *key)
/*[clinic end generated code: output=ac3bf26d07aedda2 input=f2caa8abec0763e8]*/
{
PyObject *result, *key_x;
Py_ssize_t index;
if (key == Py_None) {
index = internal_bisect_right(a, x, lo, hi, key);
} else {
key_x = PyObject_CallOneArg(key, x);
if (key_x == NULL) {
return NULL;
}
index = internal_bisect_right(a, key_x, lo, hi, key);
Py_DECREF(key_x);
}
if (index < 0)
return NULL;
if (PyList_CheckExact(a)) {
if (PyList_Insert(a, index, x) < 0)
return NULL;
}
else {
bisect_state *state = get_bisect_state(module);
result = _PyObject_CallMethod(a, state->str_insert, "nO", index, x);
if (result == NULL)
return NULL;
Py_DECREF(result);
}
Py_RETURN_NONE;
}
static inline Py_ssize_t
internal_bisect_left(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi,
PyObject *key)
{
PyObject *litem;
Py_ssize_t mid;
int res;
if (hi == -1) {
hi = PySequence_Size(list);
if (hi < 0)
return -1;
}
ssizeargfunc sq_item = get_sq_item(list);
if (sq_item == NULL) {
return -1;
}
if (Py_EnterRecursiveCall(" in _bisect.bisect_left")) {
return -1;
}
PyTypeObject *tp = Py_TYPE(item);
richcmpfunc compare = tp->tp_richcompare;
while (lo < hi) {
/* The (size_t)cast ensures that the addition and subsequent division
are performed as unsigned operations, avoiding difficulties from
signed overflow. (See issue 13496.) */
mid = ((size_t)lo + hi) / 2;
assert(mid >= 0);
// PySequence_GetItem, but we already checked the types.
litem = sq_item(list, mid);
assert((PyErr_Occurred() == NULL) ^ (litem == NULL));
if (litem == NULL) {
goto error;
}
if (key != Py_None) {
PyObject *newitem = PyObject_CallOneArg(key, litem);
if (newitem == NULL) {
goto error;
}
Py_SETREF(litem, newitem);
}
/* if key(list[mid]) < item:
* lo = mid + 1
* else:
* hi = mid
*/
if (compare != NULL && Py_IS_TYPE(litem, tp)) {
// A fast path for comparing objects of the same type
PyObject *res_obj = compare(litem, item, Py_LT);
if (res_obj == Py_True) {
Py_DECREF(res_obj);
Py_DECREF(litem);
lo = mid + 1;
continue;
}
if (res_obj == Py_False) {
Py_DECREF(res_obj);
Py_DECREF(litem);
hi = mid;
continue;
}
if (res_obj == NULL) {
goto error;
}
if (res_obj == Py_NotImplemented) {
Py_DECREF(res_obj);
compare = NULL;
res = PyObject_RichCompareBool(litem, item, Py_LT);
}
else {
res = PyObject_IsTrue(res_obj);
Py_DECREF(res_obj);
}
}
else {
// A default path for comparing arbitrary objects
res = PyObject_RichCompareBool(litem, item, Py_LT);
}
if (res < 0) {
goto error;
}
Py_DECREF(litem);
if (res)
lo = mid + 1;
else
hi = mid;
}
Py_LeaveRecursiveCall();
return lo;
error:
Py_LeaveRecursiveCall();
Py_XDECREF(litem);
return -1;
}
/*[clinic input]
_bisect.bisect_left -> Py_ssize_t
a: object
x: object
lo: Py_ssize_t(allow_negative=False) = 0
hi: Py_ssize_t(c_default='-1', accept={int, NoneType}) = None
*
key: object = None
Return the index where to insert item x in list a, assuming a is sorted.
The return value i is such that all e in a[:i] have e < x, and all e in
a[i:] have e >= x. So if x already appears in the list, a.insert(i, x) will
insert just before the leftmost x already there.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
A custom key function can be supplied to customize the sort order.
[clinic start generated code]*/
static Py_ssize_t
_bisect_bisect_left_impl(PyObject *module, PyObject *a, PyObject *x,
Py_ssize_t lo, Py_ssize_t hi, PyObject *key)
/*[clinic end generated code: output=70749d6e5cae9284 input=9b4d49b5ddecfad7]*/
{
return internal_bisect_left(a, x, lo, hi, key);
}
/*[clinic input]
_bisect.insort_left
a: object
x: object
lo: Py_ssize_t(allow_negative=False) = 0
hi: Py_ssize_t(c_default='-1', accept={int, NoneType}) = None
*
key: object = None
Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the left of the leftmost x.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
A custom key function can be supplied to customize the sort order.
[clinic start generated code]*/
static PyObject *
_bisect_insort_left_impl(PyObject *module, PyObject *a, PyObject *x,
Py_ssize_t lo, Py_ssize_t hi, PyObject *key)
/*[clinic end generated code: output=b1d33e5e7ffff11e input=ff85a79826e22f31]*/
{
PyObject *result, *key_x;
Py_ssize_t index;
if (key == Py_None) {
index = internal_bisect_left(a, x, lo, hi, key);
} else {
key_x = PyObject_CallOneArg(key, x);
if (key_x == NULL) {
return NULL;
}
index = internal_bisect_left(a, key_x, lo, hi, key);
Py_DECREF(key_x);
}
if (index < 0)
return NULL;
if (PyList_CheckExact(a)) {
if (PyList_Insert(a, index, x) < 0)
return NULL;
} else {
bisect_state *state = get_bisect_state(module);
result = _PyObject_CallMethod(a, state->str_insert, "nO", index, x);
if (result == NULL)
return NULL;
Py_DECREF(result);
}
Py_RETURN_NONE;
}
static PyMethodDef bisect_methods[] = {
_BISECT_BISECT_RIGHT_METHODDEF
_BISECT_INSORT_RIGHT_METHODDEF
_BISECT_BISECT_LEFT_METHODDEF
_BISECT_INSORT_LEFT_METHODDEF
{NULL, NULL} /* sentinel */
};
PyDoc_STRVAR(module_doc,
"Bisection algorithms.\n\
\n\
This module provides support for maintaining a list in sorted order without\n\
having to sort the list after each insertion. For long lists of items with\n\
expensive comparison operations, this can be an improvement over the more\n\
common approach.\n");
static int
bisect_clear(PyObject *module)
{
bisect_state *state = get_bisect_state(module);
Py_CLEAR(state->str_insert);
return 0;
}
static void
bisect_free(void *module)
{
bisect_clear((PyObject *)module);
}
static int
bisect_modexec(PyObject *m)
{
bisect_state *state = get_bisect_state(m);
state->str_insert = PyUnicode_InternFromString("insert");
if (state->str_insert == NULL) {
return -1;
}
return 0;
}
static PyModuleDef_Slot bisect_slots[] = {
_Py_ABI_SLOT,
{Py_mod_exec, bisect_modexec},
{Py_mod_multiple_interpreters, Py_MOD_PER_INTERPRETER_GIL_SUPPORTED},
{Py_mod_gil, Py_MOD_GIL_NOT_USED},
{0, NULL}
};
static struct PyModuleDef _bisectmodule = {
PyModuleDef_HEAD_INIT,
.m_name = "_bisect",
.m_size = sizeof(bisect_state),
.m_doc = module_doc,
.m_methods = bisect_methods,
.m_slots = bisect_slots,
.m_clear = bisect_clear,
.m_free = bisect_free,
};
PyMODINIT_FUNC
PyInit__bisect(void)
{
return PyModuleDef_Init(&_bisectmodule);
}
You can’t perform that action at this time.