AHjFUdZddlmZddlmZddlmZmZmZddl m Z ddl m Z GddeZ ed Zd ed < dd Z dd ZddZ ddZ d ddZy)a Utilities to move index-based selections backward/forward. These utilities concern themselves with selections where not all options are available, otherwise it would be enough to increment/decrement the index and use the operator `%` to implement wrapping. ) annotations)count)LiteralProtocolSequence) TypeAlias)loop_from_indexceZdZUdZded<y) Disableablez1Non-widgets that have an enabled/disabled status.booldisabledN)__name__ __module__ __qualname____doc____annotations__R/root/tools/cai/cai_env/lib/python3.12/site-packages/textual/_widget_navigation.pyr r s ;Nrr )r Directionc|||z z|zS)uComputes the distance going from `start` to `index` in the given direction. Starting at `start`, this is the number of steps you need to take in the given `direction` to reach `index`, assuming there is wrapping at 0 and `wrap_at`. This is also the smallest non-negative integer solution `d` to `(start + d * direction) % wrap_at == index`. The diagram below illustrates the computation of `d1 = distance(2, 8, 1, 10)` and `d2 = distance(2, 8, -1, 10)`: ``` start ────────────────────┐ index ────────┐ │ indices 0 1 2 3 4 5 6 7 8 9 d1 2 3 4 0 1 > > > > > (direction == 1) d2 6 5 4 3 2 1 0 < < < < < < < (direction == -1) ``` Args: index: The index that we want to reach. start: The starting point to consider when computing the distance. direction: The direction in which we want to compute the distance. wrap_at: Controls at what point wrapping around takes place. Returns: The computed distance. r)indexstart directionwrap_ats rget_directed_distancer!s@  & 00rc:tdt|DdS)zFind the first enabled candidate in a sequence of possibly-disabled objects. Args: candidates: The sequence of candidates to consider. Returns: The first enabled candidate or `None` if none were available. c3@K|]\}}|jr|ywNr ).0r candidates r z%find_first_enabled..PsW#5)IDVDVWsN)next enumerate) candidatess rfind_first_enabledr)Ds! Wy'<W  rclt|tfdtt|dDdS)zFind the last enabled candidate in a sequence of possibly-disabled objects. Args: candidates: The sequence of candidates to consider. Returns: The last enabled candidate or `None` if none were available. c3FK|]\}}|js|z ywr!r")r#offset_from_endr$total_candidatess rr%z$find_last_enabled..`s+ *%%  . s!r)rN)lenr&r'reversed)r(r-s @rfind_last_enabledr0Us;:  .78LTU.V  rc||r|dk(r t|St|Syt|||dD]\}}|jr|cS|S)asFind the next enabled object if we're currently at the given anchor. The definition of "next" depends on the given direction and this function will wrap around the ends of the sequence of object candidates. Args: candidates: The sequence of object candidates to consider. anchor: The point of the sequence from which we'll start looking for the next enabled object. direction: The direction in which to traverse the candidates when looking for the next enabled candidate. Returns: The next enabled object. If none are available, return the anchor. NrT)wrap)r)r0r r )r(anchorrrr$s rfind_next_enabledr4ism*~ >#:. 'z2  +J PTUy!!L Mrc||r|dk(r t|St|Sy|r|n||z}t||}|dk(r||dnt|d|dz}t ||D]\}}|j r|cSy)ajFind the next enabled object starting from the given anchor (without wrapping). The meaning of "next" and "past" depend on the direction specified. Args: candidates: The sequence of object candidates to consider. anchor: The point of the sequence from which we'll start looking for the next enabled object. direction: The direction in which to traverse the candidates when looking for the next enabled candidate. with_anchor: Whether to consider the anchor or not. Returns: The next enabled object. If none are available, return None. Nr)r)r0rr/zipr ) r(r3r with_anchorrcountervalid_candidatesidxr$s rfind_next_enabled_no_wrapr;s,~ >#:. 'z2  !Fv '9EE9%G'1n 56(:kPQ ;R2Sg'78Y      rN) rintrr<rrrr<returnr<)r(Sequence[Disableable]r= int | None)r(r>r3r?rrr=r?)F) r(r>r3r?rrr7r r=r?)r __future__r itertoolsrtypingrrrtyping_extensionsr textual._loopr r rrrr)r0r4r;rrrrEs#..')( u~ 9% 1  1 1'0 1;> 1 1F%"(!%! !! !P )%) )) )  )r