pikers
/
piker
3
0
Fork 0
Code Issues 2 Pull Requests 5 Packages Projects Releases Wiki Activity

Min debounce period for faster cached completions

status_bar
Tyler Goodlet 2021-06-04 11:29:44 -04:00
parent 62c456f8eb
commit e924cbeb43
1 changed files with 19 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
piker/ui/_search.py
View File

@ -163,7 +163,6 @@ class CompleterView(QTreeView):
search.focus() search.focus()
def set_font_size(self, size: int = 18): def set_font_size(self, size: int = 18):
# dpi_px_size = _font.px_size
# print(size) # print(size)
if size < 0: if size < 0:
size = 16 size = 16
@ -702,8 +701,8 @@ async def fill_results(
recv_chan: trio.abc.ReceiveChannel, recv_chan: trio.abc.ReceiveChannel,
# kb debouncing pauses (bracket defaults) # kb debouncing pauses (bracket defaults)
min_pause_time: float = 0.1, min_pause_time: float = 0.01, # absolute min typing throttle
max_pause_time: float = 6/16, max_pause_time: float = 6/16, # max pause required before slow relay
) -> None: ) -> None:
"""Task to search through providers and fill in possible """Task to search through providers and fill in possible
@ -752,7 +751,7 @@ async def fill_results(
_search_active = trio.Event() _search_active = trio.Event()
break break
if repeats > 2 and period >= max_pause_time: if repeats > 2 and period > max_pause_time:
_search_active = trio.Event() _search_active = trio.Event()
repeats = 0 repeats = 0
break break
@ -775,13 +774,17 @@ async def fill_results(
for provider, (search, pause) in ( for provider, (search, pause) in (
_searcher_cache.copy().items() _searcher_cache.copy().items()
): ):
# TODO: it may make more sense TO NOT search the cache in a bg
# task since we know it's fully cpu-bound.
if provider != 'cache': if provider != 'cache':
view.clear_section( view.clear_section(
provider, status_field='-> searchin..') provider, status_field='-> searchin..')
# only conduct search on this backend if it's # XXX: only conduct search on this backend if it's
# registered for the corresponding pause period. # registered for the corresponding pause period
# AND it hasn't already been searched with the
# current input pattern (in which case just look up
# the old results).
if (period >= pause) and ( if (period >= pause) and (
provider not in already_has_results provider not in already_has_results
): ):
@ -796,6 +799,14 @@ async def fill_results(
) )
else: # already has results for this input text else: # already has results for this input text
results = matches[(provider, text)] results = matches[(provider, text)]
# TODO really for the cache we need an
# invalidation signal so that we only re-search
# the cache once it's been mutated by the chart
# switcher.. right now we're just always
# re-searching it's ``dict`` since it's easier
# but it also causes it to be slower then cached
# results from other providers on occasion.
if results and provider != 'cache': if results and provider != 'cache':
view.set_section_entries( view.set_section_entries(
section=provider, section=provider,
@ -962,7 +973,7 @@ async def register_symbol_search(
global _searcher_cache global _searcher_cache
pause_period = pause_period or 0.125 pause_period = pause_period or 0.1
# deliver search func to consumer # deliver search func to consumer
try: try: