Home
last modified time | relevance | path

Searched refs:besti (Results 1 – 5 of 5) sorted by relevance

/external/zopfli/src/zopfli/
Dblocksplitter.c63 size_t besti; in FindMinimum() local
75 besti = 0; in FindMinimum()
80 besti = i; in FindMinimum()
85 start = besti == 0 ? start : p[besti - 1]; in FindMinimum()
86 end = besti == NUM - 1 ? end : p[besti + 1]; in FindMinimum()
88 pos = p[besti]; in FindMinimum()
/external/python/cpython2/Lib/
Ddifflib.py405 besti, bestj, bestsize = alo, blo, 0
424 besti, bestj, bestsize = i-k+1, j-k+1, k
431 while besti > alo and bestj > blo and \
433 a[besti-1] == b[bestj-1]:
434 besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
435 while besti+bestsize < ahi and bestj+bestsize < bhi and \
437 a[besti+bestsize] == b[bestj+bestsize]:
447 while besti > alo and bestj > blo and \
449 a[besti-1] == b[bestj-1]:
450 besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
[all …]
/external/python/cpython3/Lib/
Ddifflib.py393 besti, bestj, bestsize = alo, blo, 0
412 besti, bestj, bestsize = i-k+1, j-k+1, k
419 while besti > alo and bestj > blo and \
421 a[besti-1] == b[bestj-1]:
422 besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
423 while besti+bestsize < ahi and bestj+bestsize < bhi and \
425 a[besti+bestsize] == b[bestj+bestsize]:
435 while besti > alo and bestj > blo and \
437 a[besti-1] == b[bestj-1]:
438 besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
[all …]
/external/speex/libspeexdsp/
Djitter.c553 int besti=0; in jitter_buffer_get() local
563 besti = i; in jitter_buffer_get()
570 i=besti; in jitter_buffer_get()
/external/ImageMagick/coders/
Ddds.c1025 besti = 0, in CompressClusterFit() local
1183 besti = i; in CompressClusterFit()
1221 for (i=0; i < (ssize_t) besti; i++) in CompressClusterFit()
1223 for (i=besti; i < (ssize_t) bestj; i++) in CompressClusterFit()