Lines Matching defs:_starts
239 _starts = array.array('l', [0, 0x110000]) # array of int32_t
244 Returns the smallest i where x < _starts[i]"""
245 return bisect.bisect(_starts, x) - 1
256 # Find the index i of the range in _starts that contains start.
259 # Intersect [start, limit[ with ranges in _starts.
260 c_start = _starts[i]
261 c_limit = _starts[i + 1]
270 _starts.insert(i, start)
281 c_limit = _starts[i + 1]
285 _starts.insert(i + 1, limit)
315 if _starts[i] == x: return
317 c_start = _starts[i]
318 c_limit = _starts[i + 1]
322 _starts.insert(i, x)
990 assert b[0] == _starts[i]
1005 start = _starts[i]
1082 start = _starts[i]
1100 # Return the _starts index of the first range after this block.
1108 start = _starts[i]
1123 # Return the _starts index of the first range after this block.
1131 # Ensure that there is a boundary in _starts for each block
1141 if _starts[i] < b_start:
1216 # Ensure that there is a boundary in _starts for each
1231 for i in range(len(_starts) - 1):
1232 start = _starts[i]
1233 end = _starts[i + 1] - 1
1282 for i in range(len(_starts)):
1283 start = _starts[i]
1352 for i in range(len(_starts) - 1):
1353 start = _starts[i]
1354 end = _starts[i + 1] - 1
1382 for i in range(len(_starts) - 1):
1383 start = _starts[i]
1384 end = _starts[i + 1] - 1
1416 for i in range(len(_starts) - 1):
1417 start = _starts[i]
1418 end = _starts[i + 1] - 1
1802 for i in range(len(_starts) - 1):
1803 start = _starts[i]
1804 # end = _starts[i + 1] - 1