/external/zopfli/src/zopfli/ |
blocksplitter.c | 63 size_t besti; local 75 besti = 0; 80 besti = i; 85 start = besti == 0 ? start : p[besti - 1]; 86 end = besti == NUM - 1 ? end : p[besti + 1]; 88 pos = p[besti];
|
/external/llvm/lib/CodeGen/ |
ScheduleDAG.cpp | 302 SUnit::pred_iterator BestI = Preds.begin(); 303 unsigned MaxDepth = BestI->getSUnit()->getDepth(); 304 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E; 307 BestI = I; 309 if (BestI != Preds.begin()) 310 std::swap(*Preds.begin(), *BestI);
|
/prebuilts/gdb/darwin-x86/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/gdb/linux-x86/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/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;
|
/external/ImageMagick/coders/ |
dds.c | 1015 besti = 0, local [all...] |
/prebuilts/eclipse/mavenplugins/tycho/tycho-dependencies-m2repo/org/eclipse/tycho/tycho-bundles-external/0.20.0/eclipse/plugins/ |
org.sat4j.core_2.3.5.v201308161310.jar | |