Repository navigation
Expand file tree
/
Copy path_bisect.cs
More file actions
240 lines (193 loc) · 9.1 KB
/
Copy path_bisect.cs
File metadata and controls
240 lines (193 loc) · 9.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
using System;
using System.Collections;
using System.Collections.Generic;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using IronPython.Runtime;
using IronPython.Runtime.Binding;
using IronPython.Runtime.Exceptions;
using IronPython.Runtime.Operations;
using IronPython.Runtime.Types;
using Microsoft.Scripting;
using Microsoft.Scripting.Generation;
using Microsoft.Scripting.Runtime;
using Microsoft.Scripting.Utils;
[assembly: PythonModule("_bisect", typeof(IronPython.Modules.PythonBisectModule))]
namespace IronPython.Modules {
public class PythonBisectModule {
public const string __doc__ = @"Bisection algorithms.
This module provides support for maintaining a list in sorted order without
having to sort the list after each insertion. For long lists of items with
expensive comparison operations, this can be an improvement over the more
common approach.
";
#region Private Implementation Details
private static int InternalBisectLeft(CodeContext/*!*/ context, List list, object item, int lo, int hi) {
int mid;
object litem;
if (lo < 0) {
throw PythonOps.ValueError("lo must be non-negative");
}
if (hi == -1) {
hi = list.Count;
}
IComparer comparer = PythonContext.GetContext(context).GetComparer(null, GetComparisonType(list));
while (lo < hi) {
mid = (lo + hi) / 2;
litem = list[mid];
if (comparer.Compare(litem, item) < 0)
lo = mid + 1;
else
hi = mid;
}
return lo;
}
private static int InternalBisectLeft(CodeContext/*!*/ context, object list, object item, int lo, int hi) {
int mid;
object litem;
if (lo < 0) {
throw PythonOps.ValueError("lo must be non-negative");
}
if (hi == -1) {
hi = PythonOps.Length(list);
}
IComparer comparer = PythonContext.GetContext(context).GetComparer(null, GetComparisonType(context, list));
while (lo < hi) {
mid = (lo + hi) / 2;
litem = PythonOps.GetIndex(context, list, mid);
if (comparer.Compare(litem, item) < 0)
lo = mid + 1;
else
hi = mid;
}
return lo;
}
private static int InternalBisectRight(CodeContext/*!*/ context, List list, object item, int lo, int hi) {
object litem;
int mid;
if (lo < 0) {
throw PythonOps.ValueError("lo must be non-negative");
}
if (hi == -1) {
hi = list.Count;
}
IComparer comparer = PythonContext.GetContext(context).GetComparer(null, GetComparisonType(list));
while (lo < hi) {
mid = (lo + hi) / 2;
litem = list[mid];
if (comparer.Compare(item, litem) < 0)
hi = mid;
else
lo = mid + 1;
}
return lo;
}
private static int InternalBisectRight(CodeContext/*!*/ context, object list, object item, int lo, int hi) {
object litem;
int mid;
if (lo < 0) {
throw PythonOps.ValueError("lo must be non-negative");
}
if (hi == -1) {
hi = PythonOps.Length(list);
}
IComparer comparer = PythonContext.GetContext(context).GetComparer(null, GetComparisonType(context, list));
while (lo < hi) {
mid = (lo + hi) / 2;
litem = PythonOps.GetIndex(context, list, mid);
if (comparer.Compare(item, litem) < 0)
hi = mid;
else
lo = mid + 1;
}
return lo;
}
private static Type GetComparisonType(CodeContext/*!*/ context, object a) {
if (PythonOps.Length(a) > 0) {
// use the 1st index to determine the type - we're assuming lists are
// homogeneous
return CompilerHelpers.GetType(PythonOps.GetIndex(context, a, 0));
}
return typeof(object);
}
private static Type GetComparisonType(List a) {
if (a.Count > 0) {
// use the 1st index to determine the type - we're assuming lists are
// homogeneous
return CompilerHelpers.GetType(a[0]);
}
return typeof(object);
}
#endregion Private Implementation Details
#region Public API Surface
[Documentation(@"bisect_right(a, x[, lo[, hi]]) -> index
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, i points just
beyond the rightmost x already there
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
")]
public static object bisect_right(CodeContext/*!*/ context, List a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
return InternalBisectRight(context, a, x, lo, hi);
}
public static object bisect_right(CodeContext/*!*/ context, object a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
return InternalBisectRight(context, a, x, lo, hi);
}
[Documentation(@"insort_right(a, x[, lo[, hi]])
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.
")]
public static void insort_right(CodeContext/*!*/ context, List a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
a.Insert(InternalBisectRight(context, a, x, lo, hi), x);
}
public static void insort_right(CodeContext/*!*/ context, object a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
PythonOps.Invoke(context, a, "insert", InternalBisectRight(context, a, x, lo, hi), x);
}
[Documentation(@"bisect_left(a, x[, lo[, hi]]) -> index
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, i points 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.
")]
public static object bisect_left(CodeContext/*!*/ context, List a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
return InternalBisectLeft(context, a, x, lo, hi);
}
public static object bisect_left(CodeContext/*!*/ context, object a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
return InternalBisectLeft(context, a, x, lo, hi);
}
[Documentation(@"insort_left(a, x[, lo[, hi]])
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.
")]
public static void insort_left(CodeContext/*!*/ context, List a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
a.Insert(InternalBisectLeft(context, a, x, lo, hi), x);
}
public static void insort_left(CodeContext/*!*/ context, object a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
PythonOps.Invoke(context, a, "insert", InternalBisectLeft(context, a, x, lo, hi), x);
}
[Documentation("Alias for bisect_right().")]
public static object bisect(CodeContext/*!*/ context, List a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
return bisect_right(context, a, x, lo, hi);
}
[Documentation("Alias for bisect_right().")]
public static object bisect(CodeContext/*!*/ context, object a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
return bisect_right(context, a, x, lo, hi);
}
[Documentation("Alias for insort_right().")]
public static void insort(CodeContext/*!*/ context, List a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
insort_right(context, a, x, lo, hi);
}
[Documentation("Alias for insort_right().")]
public static void insort(CodeContext/*!*/ context, object a, object x, [DefaultParameterValue(0)] int lo, [DefaultParameterValue(-1)] int hi) {
insort_right(context, a, x, lo, hi);
}
#endregion Public API Surface
}
}