3j"UdZddlmZddlmZmZddlmZmZm Z dZ dZ dZ dZ d Zd Zd Zd Zd ZdZdZdZdZe e e e eeeeeeeeef Zded<eedk(sJdeeefZded<ededediZded<e e efe e efe e efe eefeeefeeeeeefeeeefee efeeefeeefedededi Zded<d&dZd'd Zd(d!ZeGd"d#Z d)d$Z!y%)*uKanu_v3.track_loop_state — track-level loop state machine (task-2553+17, 9-R.3). 13-state transition table for a single track inside a parallel batch. Authority: task-2553+17.md §4(9) + §12 9-R.3. States (13) ----------- PLANNED, DISPATCHED, RUNNING, NORMAL_COLLECTOR_COMPLETED, CODEX_AUDIT_PENDING, ANU_ADJUDICATION_PENDING, AUTO_MICRO_FIX, RETRY_WITHIN_SCOPE, ACCEPTED, LANDING_PENDING, MERGE_READY, MERGED, HOLD_FOR_CHAIR. Terminal : ACCEPTED, MERGED, HOLD_FOR_CHAIR. Retry ceiling : RETRY_WITHIN_SCOPE may be entered at most ``retry_ceiling`` times (per profile/goal); over the ceiling the only legal successor is HOLD_FOR_CHAIR. Precedence : HOLD_FOR_CHAIR > RETRY_WITHIN_SCOPE > AUTO_MICRO_FIX. Callback prec. : if NORMAL_COLLECTOR_COMPLETED has already been reached, a later fallback callback is classified DUPLICATE_CALLBACK_IGNORED (the state machine never regresses out of / past it for a fallback event). This module is pure (stdlib only) and never mutates any existing tracked file. ) annotations) dataclassfield)DictListTuplePLANNED DISPATCHEDRUNNINGNORMAL_COLLECTOR_COMPLETEDCODEX_AUDIT_PENDINGANU_ADJUDICATION_PENDINGAUTO_MICRO_FIXRETRY_WITHIN_SCOPEACCEPTEDLANDING_PENDING MERGE_READYMERGEDHOLD_FOR_CHAIRTuple[str, ...] ALL_STATES z"13-state machine invariant (9-R.3)TERMINAL_STATESzDict[str, int] PRECEDENCEzDict[str, Tuple[str, ...]] TRANSITIONSc|tvS)N)rstates 9/home/jay/workspace/scripts/../anu_v3/track_loop_state.py is_terminalr$gs O ##c@|tvrtd|t|S)Nzunknown state: )rKeyErrorr!s r#legal_successorsr(ks' K 233 u r%c2|tj|dvS)Nr)rget)srcdsts r#is_legal_transitionr-qs +//#r* **r%ceZdZUdZded<eZded<dZded<dZded <d Z d ed <e e Z ded<e e Z ded<ddZddZddZddZddZddZy)TrackLoopStatea Mutable per-track loop position with audited history. ``retry_ceiling`` defaults to 2 and is normally supplied from the track goal / policy_profile (Track3). Over the ceiling the machine refuses any RETRY_WITHIN_SCOPE entry and forces HOLD_FOR_CHAIR. strtrack_idr"rint retry_ceilingr retry_countFboolnormal_collector_reached)default_factory List[str]historyzList[Tuple[str, str, str]]rejectedc|jtvrtd|j|js%|jj |j|jt k(rd|_yy)Nzinvalid initial state T)r"r ValueErrorr9appendr r6)selfs r# __post_init__zTrackLoopState.__post_init__s\ ::Z '5djj^DE E|| LL   + ::3 3,0D ) 4r%c\|j|\}}|sF|jj|j||ft d|jd|d|||_|t k(rd|_|tk(r|xjdz c_|jj|y)z=Apply a transition or raise ValueError if illegal (rejected).zillegal transition z->z: TrN) can_transitionr:r=r"r<r r6rr4r9)r>r,okreasons r# transitionzTrackLoopState.transitions((- F MM $**c6!: ;%djj^2cWBvhG  , ,,0D ) $ $    !  C r%cB|tvrdd|fSt|jrd|jdfSt|j|sd|d|jfS|tk(r8|j |j k\rdd|j d|j dfSy) NFzunknown target state u is terminal — no successorsz not in legal successors of zretry ceiling z reached (count=u) — only HOLD_FOR_CHAIR legal)TrB)rr$r"r-rr4r3)r>r,s r#rAzTrackLoopState.can_transitions j 1#99 9 tzz "TZZL(FGG G"4::s3SE!=djj\JJ J $ $)9)9T=O=O)O !3!3 45**++JL  r%c|Dcgc]}t|j|s|}}|std|d|jt|dd}|d}|tk(r|j |j k\rtS|Scc}w)aPick the highest-precedence legal successor among *candidates*. Implements 9-R.3 precedence HOLD_FOR_CHAIR > RETRY_WITHIN_SCOPE > AUTO_MICRO_FIX. Candidates outside PRECEDENCE keep insertion order and rank below the three precedence states. If a precedence pick is RETRY_WITHIN_SCOPE but the ceiling is exhausted it falls back to HOLD_FOR_CHAIR (still highest), guaranteeing forward progress. zno legal candidate among z from c.tj|dS)Nr)rr*)cs r#z-TrackLoopState.resolve_next..s*..A.r%T)keyreverser)r-r"r<sortedrr4r3r)r> candidatesrHlegalrankedpicks r# resolve_nextzTrackLoopState.resolve_nexts'Mq*=djj!*LMM+JP>P*P! ! Ns BBcZ|dk(r |jry|dk(ry|dk(rytd|)zClassify an incoming callback event for this track. ``kind`` is "normal" or "fallback". If the normal collector has already completed, any later fallback is DUPLICATE_CALLBACK_IGNORED. fallbackDUPLICATE_CALLBACK_IGNOREDnormalNORMAL_COLLECTOR_ACCEPTEDCALLBACK_PENDINGzunknown callback kind )r6r<)r>kinds r#classify_callbackz TrackLoopState.classify_callbacks@ : $"?"?/ 8 . : %1$:;;r%c|j|jt|j|j|j|j t |j|jDcgc] \}}}|||dc}}}dScc}}}w)N)fromtorC)r1r"terminalr3r4r6r9rejected_transitions) r1r"r$r3r4r6listr9r:)r>abrs r#to_dictzTrackLoopState.to_dicts{ ZZ#DJJ/!//++(,(E(EDLL)CG==%%6?q!Q!q1%  %s0BN)returnNone)r,r0rdre)r,r0rdzTuple[bool, str])rMr8rdr0)rXr0rdr0rdzDict[str, object])__name__ __module__ __qualname____doc____annotations__r r"r3r4r6rr_r9r:r?rDrArQrYrcrr%r#r/r/ustME3M3K%*d*t4GY4+0+FH(F1 !  2 <  r%r/c ttttttt j Dcic]\}}|t|c}}ddScc}}w)zDStatic, serialisable description of the table (regression evidence).zQNORMAL_COLLECTOR_COMPLETED reached => later fallback = DUPLICATE_CALLBACK_IGNORED)statesr] precedence transitionscallback_precedence)r_rrdictrritems)sts r#transition_table_specrusTz"):&/:/@/@/BCtq!47 C )  DsA N)r"r0rdr5)r"r0rdr)r+r0r,r0rdr5rf)"rj __future__r dataclassesrrtypingrrrr r r r r rrrrrrrrrrklenrrrr$r(r-r/rurr%r#rzs2#($$   9+5!) # !     O  :"BBB$,fn#EE AA N j. ).) (. 9!4n E2NC -/A>R^4k>2&.) b BB)+ '0$ + k k  k \ r%