FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
cpython/Modules/_bisectmodule.c at 2.7 · python-emscripten/cpython · GitHub
python-emscripten
cpython
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
cpython
/
Modules
/
_bisectmodule.c
Copy path
More file actions
More file actions
Latest commit
History
History
History
246 lines (223 loc) · 7.2 KB
Breadcrumbs
cpython
/
Modules
/
_bisectmodule.c
Copy path
File metadata and controls
246 lines (223 loc) · 7.2 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/* Bisection algorithms. Drop in replacement for bisect.py
Converted to C by Dmitry Vasiliev (dima at hlabs.spb.ru).
*/
#include
"Python.h"
static
Py_ssize_t
internal_bisect_right
(
PyObject
*
list
,
PyObject
*
item
,
Py_ssize_t
lo
,
Py_ssize_t
hi
)
{
PyObject
*
litem
;
Py_ssize_t
mid
,
res
;
if
(
lo
<
0
) {
PyErr_SetString
(
PyExc_ValueError
,
"lo must be non-negative"
);
return
-1
;
}
if
(
hi
==
-1
) {
hi
=
PySequence_Size
(
list
);
if
(
hi
<
0
)
return
-1
;
}
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
;
litem
=
PySequence_GetItem
(
list
,
mid
);
if
(
litem
==
NULL
)
return
-1
;
res
=
PyObject_RichCompareBool
(
item
,
litem
,
Py_LT
);
Py_DECREF
(
litem
);
if
(
res
<
0
)
return
-1
;
if
(
res
)
hi
=
mid
;
else
lo
=
mid
+
1
;
}
return
lo
;
}
static
PyObject
*
bisect_right
(
PyObject
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
PyObject
*
list
,
*
item
;
Py_ssize_t
lo
=
0
;
Py_ssize_t
hi
=
-1
;
Py_ssize_t
index
;
static
char
*
keywords
[]
=
{
"a"
,
"x"
,
"lo"
,
"hi"
,
NULL
};
if
(!
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"OO|nn:bisect_right"
,
keywords
,
&
list
,
&
item
,
&
lo
,
&
hi
))
return
NULL
;
index
=
internal_bisect_right
(
list
,
item
,
lo
,
hi
);
if
(
index
<
0
)
return
NULL
;
return
PyInt_FromSsize_t
(
index
);
}
PyDoc_STRVAR
(
bisect_right_doc
,
"bisect(a, x[, lo[, hi]]) -> index\n\
bisect_right(a, x[, lo[, hi]]) -> index\n\
\n\
Return the index where to insert item x in list a, assuming a is sorted.\n\
\n\
The return value i is such that all e in a[:i] have e <= x, and all e in\n\
a[i:] have e > x. So if x already appears in the list, i points just\n\
beyond the rightmost x already there\n\
\n\
Optional args lo (default 0) and hi (default len(a)) bound the\n\
slice of a to be searched.\n"
);
static
PyObject
*
insort_right
(
PyObject
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
PyObject
*
list
,
*
item
,
*
result
;
Py_ssize_t
lo
=
0
;
Py_ssize_t
hi
=
-1
;
Py_ssize_t
index
;
static
char
*
keywords
[]
=
{
"a"
,
"x"
,
"lo"
,
"hi"
,
NULL
};
if
(!
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"OO|nn:insort_right"
,
keywords
,
&
list
,
&
item
,
&
lo
,
&
hi
))
return
NULL
;
index
=
internal_bisect_right
(
list
,
item
,
lo
,
hi
);
if
(
index
<
0
)
return
NULL
;
if
(
PyList_CheckExact
(
list
)) {
if
(
PyList_Insert
(
list
,
index
,
item
)
<
0
)
return
NULL
;
}
else
{
result
=
PyObject_CallMethod
(
list
,
"insert"
,
"nO"
,
index
,
item
);
if
(
result
==
NULL
)
return
NULL
;
Py_DECREF
(
result
);
}
Py_RETURN_NONE
;
}
PyDoc_STRVAR
(
insort_right_doc
,
"insort(a, x[, lo[, hi]])\n\
insort_right(a, x[, lo[, hi]])\n\
\n\
Insert item x in list a, and keep it sorted assuming a is sorted.\n\
\n\
If x is already in a, insert it to the right of the rightmost x.\n\
\n\
Optional args lo (default 0) and hi (default len(a)) bound the\n\
slice of a to be searched.\n"
);
static
Py_ssize_t
internal_bisect_left
(
PyObject
*
list
,
PyObject
*
item
,
Py_ssize_t
lo
,
Py_ssize_t
hi
)
{
PyObject
*
litem
;
Py_ssize_t
mid
,
res
;
if
(
lo
<
0
) {
PyErr_SetString
(
PyExc_ValueError
,
"lo must be non-negative"
);
return
-1
;
}
if
(
hi
==
-1
) {
hi
=
PySequence_Size
(
list
);
if
(
hi
<
0
)
return
-1
;
}
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
;
litem
=
PySequence_GetItem
(
list
,
mid
);
if
(
litem
==
NULL
)
return
-1
;
res
=
PyObject_RichCompareBool
(
litem
,
item
,
Py_LT
);
Py_DECREF
(
litem
);
if
(
res
<
0
)
return
-1
;
if
(
res
)
lo
=
mid
+
1
;
else
hi
=
mid
;
}
return
lo
;
}
static
PyObject
*
bisect_left
(
PyObject
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
PyObject
*
list
,
*
item
;
Py_ssize_t
lo
=
0
;
Py_ssize_t
hi
=
-1
;
Py_ssize_t
index
;
static
char
*
keywords
[]
=
{
"a"
,
"x"
,
"lo"
,
"hi"
,
NULL
};
if
(!
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"OO|nn:bisect_left"
,
keywords
,
&
list
,
&
item
,
&
lo
,
&
hi
))
return
NULL
;
index
=
internal_bisect_left
(
list
,
item
,
lo
,
hi
);
if
(
index
<
0
)
return
NULL
;
return
PyInt_FromSsize_t
(
index
);
}
PyDoc_STRVAR
(
bisect_left_doc
,
"bisect_left(a, x[, lo[, hi]]) -> index\n\
\n\
Return the index where to insert item x in list a, assuming a is sorted.\n\
\n\
The return value i is such that all e in a[:i] have e < x, and all e in\n\
a[i:] have e >= x. So if x already appears in the list, i points just\n\
before the leftmost x already there.\n\
\n\
Optional args lo (default 0) and hi (default len(a)) bound the\n\
slice of a to be searched.\n"
);
static
PyObject
*
insort_left
(
PyObject
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
PyObject
*
list
,
*
item
,
*
result
;
Py_ssize_t
lo
=
0
;
Py_ssize_t
hi
=
-1
;
Py_ssize_t
index
;
static
char
*
keywords
[]
=
{
"a"
,
"x"
,
"lo"
,
"hi"
,
NULL
};
if
(!
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"OO|nn:insort_left"
,
keywords
,
&
list
,
&
item
,
&
lo
,
&
hi
))
return
NULL
;
index
=
internal_bisect_left
(
list
,
item
,
lo
,
hi
);
if
(
index
<
0
)
return
NULL
;
if
(
PyList_CheckExact
(
list
)) {
if
(
PyList_Insert
(
list
,
index
,
item
)
<
0
)
return
NULL
;
}
else
{
result
=
PyObject_CallMethod
(
list
,
"insert"
,
"nO"
,
index
,
item
);
if
(
result
==
NULL
)
return
NULL
;
Py_DECREF
(
result
);
}
Py_RETURN_NONE
;
}
PyDoc_STRVAR
(
insort_left_doc
,
"insort_left(a, x[, lo[, hi]])\n\
\n\
Insert item x in list a, and keep it sorted assuming a is sorted.\n\
\n\
If x is already in a, insert it to the left of the leftmost x.\n\
\n\
Optional args lo (default 0) and hi (default len(a)) bound the\n\
slice of a to be searched.\n"
);
static
PyMethodDef
bisect_methods
[]
=
{
{
"bisect_right"
, (
PyCFunction
)
bisect_right
,
METH_VARARGS
|
METH_KEYWORDS
,
bisect_right_doc
},
{
"bisect"
, (
PyCFunction
)
bisect_right
,
METH_VARARGS
|
METH_KEYWORDS
,
bisect_right_doc
},
{
"insort_right"
, (
PyCFunction
)
insort_right
,
METH_VARARGS
|
METH_KEYWORDS
,
insort_right_doc
},
{
"insort"
, (
PyCFunction
)
insort_right
,
METH_VARARGS
|
METH_KEYWORDS
,
insort_right_doc
},
{
"bisect_left"
, (
PyCFunction
)
bisect_left
,
METH_VARARGS
|
METH_KEYWORDS
,
bisect_left_doc
},
{
"insort_left"
, (
PyCFunction
)
insort_left
,
METH_VARARGS
|
METH_KEYWORDS
,
insort_left_doc
},
{
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"
);
PyMODINIT_FUNC
init_bisect
(
void
)
{
Py_InitModule3
(
"_bisect"
,
bisect_methods
,
module_doc
);
}
Back
|
FazBrowse Home
|
New Git URL