Home
last modified time | relevance | path

Searched refs:bisect (Results 1 – 25 of 50) sorted by relevance

12

/third_party/ffmpeg/tools/
Dbisect-create7 git show master:tools/bisect-create > tools/ffbisect
12 if ! git show master:tools/bisect-create | diff - tools/ffbisect > /dev/null ; then
14 git show master:tools/bisect-create > tools/ffbisect
24 echo $2.c >> tools/bisect.need
29 echo . > tools/bisect.need
30 git bisect $*
33 git bisect $*
36 git bisect $*
38 until ls `cat tools/bisect.need` > /dev/null 2> /dev/null; do
39 git bisect skip || break
[all …]
D.gitignore3 /bisect.need
/third_party/libsnd/src/
Dogg.c468 sf_count_t bisect ; in ogg_stream_seek_page_search() local
492 bisect = begin ; in ogg_stream_seek_page_search()
499 bisect = begin + ((end - begin) >> 1) ; in ogg_stream_seek_page_search()
502bisect = begin + ogg_page_search_do_rescale (target_gp - pcm_start, pcm_end - pcm_start, end - beg… in ogg_stream_seek_page_search()
504 if (bisect - OGG_CHUNK_SIZE < begin) in ogg_stream_seek_page_search()
505 bisect = begin ; in ogg_stream_seek_page_search()
507 bisect -= OGG_CHUNK_SIZE ; in ogg_stream_seek_page_search()
514 if (seek_pos != bisect) in ogg_stream_seek_page_search()
519 seek_pos = ogg_sync_fseek (psf, bisect, SEEK_SET) ; in ogg_stream_seek_page_search()
544 if (bisect <= begin + 1) in ogg_stream_seek_page_search()
[all …]
/third_party/python/Doc/library/
Dbisect.rst1 :mod:`bisect` --- Array bisection algorithm
4 .. module:: bisect
10 **Source code:** :source:`Lib/bisect.py`
17 approach. The module is called :mod:`bisect` because it uses a basic bisection
46 bisect(a, x, lo=0, hi=len(a))
106 When writing time sensitive code using *bisect()* and *insort()*, keep these
127 module that uses *bisect* to managed sorted collections of data.
131 bisect to build a full-featured collection class with straight-forward search
139 The above :func:`bisect` functions are useful for finding insertion points but
185 The :func:`bisect` function can be useful for numeric table lookups. This
[all …]
Ddatatypes.rst28 bisect.rst
/third_party/skia/tools/viewer/
DBisectSlide.cpp23 sk_sp<BisectSlide> bisect(new BisectSlide(filepath)); in Create() local
31 bisect->fDrawBounds.join(ibounds); in Create()
32 bisect->fFoundPaths.push_back() = {path, paint, matrix}; in Create()
34 return bisect; in Create()
DViewer.cpp145 static DEFINE_string(bisect, "", "Path to a .skp or .svg file to bisect.");
820 sk_sp<BisectSlide> bisect = BisectSlide::Create(FLAGS_bisect[0]); in initSlides() local
821 if (bisect && !CommandLineFlags::ShouldSkip(FLAGS_match, bisect->getName().c_str())) { in initSlides()
824 bisect->onChar(*ch); in initSlides()
827 fSlides.push_back(std::move(bisect)); in initSlides()
/third_party/jerryscript/tools/
Dgen-unicode.py20 import bisect
134 bisect.insort(separators, int(mongolian_vowel_separator))
136 bisect.insort(separators, int(medium_mathematical_space))
138 bisect.insort(separators, int(zero_width_space))
145 bisect.insort(non_letters, int(zero_width_non_joiner))
146 bisect.insort(non_letters, int(zero_width_joiner))
/third_party/python/Lib/
Drandom.py56 from bisect import bisect as _bisect
478 bisect = _bisect
479 return [population[bisect(cum_counts, s)] for s in selections]
538 bisect = _bisect
540 return [population[bisect(cum_weights, random() * total, 0, hi)]
Dbisect.py109 bisect = bisect_right variable
/third_party/python/Lib/multiprocessing/
Dheap.py10 import bisect
190 i = bisect.bisect_left(self._lengths, size)
230 bisect.insort(self._lengths, length)
/third_party/littlefs/scripts/
Dperfbd.py14 import bisect
449 i = bisect.bisect(lines, (last_file, last_line),
470 i = bisect.bisect(sym_at, addr, key=lambda x: x[0])
487 i = bisect.bisect(line_at, addr, key=lambda x: x[0])
Dcoverage.py10 import bisect as b
39 i = b.bisect(funcs, (file, lineno))
Dperf.py13 import bisect
524 i = bisect.bisect(line_at, addr, key=lambda x: x[0])
/third_party/python/Lib/test/
Dtest_bisect.py191 self.assertEqual(self.module.bisect, self.module.bisect_right)
197 self.assertEqual(self.module.bisect(a=data, x=25, lo=1, hi=3), 2)
361 i = self.module.bisect(breakpoints, score)
Dtest_statistics.py6 import bisect
2379 [bisect.bisect(data, q) for q in quantiles(data, n=n)],
2386 pos = [bisect.bisect(data, q) for q in quantiles(data, n=n)]
/third_party/libjpeg-turbo/.github/ISSUE_TEMPLATE/
Dbug-report.md37 **If the bug is a regression, the specific commit that introduced the regression (use `git bisect` …
/third_party/python/Lib/zoneinfo/
D_zoneinfo.py1 import bisect
138 idx = bisect.bisect_right(self._trans_utc, timestamp)
181 idx = bisect.bisect_right(lt, ts) - 1
/third_party/python/Doc/tutorial/
Dstdlib2.rst330 tools such as the :mod:`bisect` module with functions for manipulating sorted
333 >>> import bisect
335 >>> bisect.insort(scores, (300, 'ruby'))
/third_party/mesa3d/docs/relnotes/
D17.0.3.rst33 [d3dadapter+radeonsi & bisect] EVE-Online : hang on wormhole sight
D17.2.3.rst31 - [PATCH][regression][bisect] Xorg fails to start after
/third_party/libjpeg-turbo/.github/
DCONTRIBUTING.md20 (use `git bisect` to determine this)
/third_party/node/deps/v8/tools/
Dll_prof.py34 import bisect
173 j = bisect.bisect_left(ticks_offsets, end_offset)
/third_party/icu/tools/unicode/py/
Dpreparseucd.py30 import bisect
245 return bisect.bisect(_starts, x) - 1
/third_party/spirv-tools/
DCONTRIBUTING.md110 always-working history is easier to understand and to bisect in case we want to

12