HomeSort by relevance Sort by last modified time
    Searched full:besti (Results 1 - 5 of 5) sorted by null

  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/
jsdifflib.js 172 var besti = alo;
189 besti = i - k + 1;
198 while (besti > alo && bestj > blo && !isbjunk(b[bestj - 1]) && a[besti - 1] == b[bestj - 1]) {
199 besti--;
204 while (besti + bestsize < ahi && bestj + bestsize < bhi &&
206 a[besti + bestsize] == b[bestj + bestsize]) {
210 while (besti > alo && bestj > blo && isbjunk(b[bestj - 1]) && a[besti - 1] == b[bestj - 1]) {
211 besti--
    [all...]
  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 302 SUnit::pred_iterator BestI = Preds.begin();
303 unsigned MaxDepth = BestI->getSUnit()->getDepth();
305 I = llvm::next(BestI), E = Preds.end(); I != E; ++I) {
307 BestI = I;
309 if (BestI != Preds.begin())
310 std::swap(*Preds.begin(), *BestI);
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
difflib.py 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]
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
difflib.py 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]
    [all...]
  /external/speex/libspeex/
jitter.c 556 int besti=0; local
566 besti = i;
573 i=besti;

Completed in 356 milliseconds