Lines Matching full:besti
407 besti, bestj, bestsize = alo, blo, 0
426 besti, bestj, bestsize = i-k+1, j-k+1, k
433 while besti > alo and bestj > blo and \
435 a[besti-1] == b[bestj-1]:
436 besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
437 while besti+bestsize < ahi and bestj+bestsize < bhi and \
439 a[besti+bestsize] == b[bestj+bestsize]:
449 while besti > alo and bestj > blo and \
451 a[besti-1] == b[bestj-1]:
452 besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
453 while besti+bestsize < ahi and bestj+bestsize < bhi and \
455 a[besti+bestsize] == b[bestj+bestsize]:
458 return Match(besti, bestj, bestsize)
