Mpj*,BSSKJr SSKJr SSKJr SSKJr SSKJ r J r J r SSK J r SSKJrJr 0r0r"SS 5rSS KJrJrJrJr SS KJr "S S \5r"SS5r"SS\\5r"SS\\5r"SS\5r "SS5r!g!\a Nf=f))Integral)Queue)Thread)get_context_path)close_listener open_listenersend)check_rich_support)Intervalvalidate_paramsc d\rSrSrSr\"S\"\SSSS9S/0SS 9SS j5rS r S r S r Sr Sr g) ProgressBaraYCallback that displays progress bars for each iterative step of an estimator. Parameters ---------- max_propagation_depth : int, default=1 The maximum depth of nested levels of estimators to display progress bars for. 0 means that the progress of only the outermost estimator is displayed. If set to None, all levels are displayed. max_propagation_depthrNleft)closedT)prefer_skip_nested_validationc4[S5 Xl0Ulg)N Progressbar)r r_listener_handles)selfrs Y/var/www/html/pdf-tiff/venv/lib/python3.13/site-packages/sklearn/callback/_progressbar.py__init__ProgressBar.__init__s =)%:""$c[5n[UR5URUR'[ US9nUR 5 U[UR'U[UR'g)N)queue) rrputr root_uuidRichProgressMonitorstart _run_queues _run_monitors)r estimatorcontextrprogress_monitors rsetupProgressBar.setup+sd5B%))4Lw001.U; ). G%%&+; g''(rc |URS:wdURb URb[U5Vs/sHo3RPM nn[ UR URSUURURURURURURS.5 ggs snf)Nrbegin)eventpath task_nametask_id max_subtasksestimator_namesource_estimator_namesource_task_name) r/parentr1rr.r rrr-r0r2)rr$r%ctxr,s ron_fit_task_beginProgressBar.on_fit_task_begin>s  A %~~%,,8,[TU]U5nUR(a SUlU$SUlU$)N#29ABE2#F7931E)superrenderfinishedstyle)rtasktext __class__s rr__StyledColumnMixin.renderws27>$'D&*mmDJK:CDJKrrH)rBrCrDrErFr_rG __classcell__rds@rrYrYtsF  rrYc\rSrSrSrSrg)_StyledTimeRemainingColumn|zTime column with color styling.rHNrBrCrDrErFrGrHrrriri|s-rric\rSrSrSrSrg)_StyledPercentageColumnz%Percentage column with color styling.rHNrkrHrrrmrms3rrmc>^\rSrSrSrU4SjrSrSrSrSr U=r $)r a;Thread monitoring the progress of an estimator with rich based display. The display is a list of nested rich tasks using `rich.Progress`. There is one for each non-leaf node in the task tree of the estimator. Parameters ---------- queue : `queue.Queue` instance This thread will run until the queue is empty. c.>[TU]5 Xlgr<)r^rr)rrrds rrRichProgressMonitor.__init__s  rc [[S5[[SS9[SS9[SS9S9[ S5[ SS95UlSUlUR  URR5=n(a[URS 5S :XaURU5 OURU5 URR5=n(aM[UR R5 SSS5 g!,(df  g=f) Nz([progress.description]{task.description}r])colorr\)complete_stylefinished_style pulse_stylez{task.percentage:>3.0f}%T)elapsed_when_finishedr+r*)rOrKrIrMrmri progress_ctxroot_rich_taskrgetr=_on_task_begin _on_task_endrefresh)r task_infos rrunRichProgressMonitor.runs% A B $95$95! 2  $$> ? &T B  #   #zz~~//)/==)W4'' 2%%i0 $zz~~//)/    % % '  sA;C>C>> D cURS5n[URU[U5S- S9nURS:XaX0lO/UR R U5SnX4RUS'UR Vs/sH%oPRRURPM' snURl gs snf)zHCreate a progress bar for the task and update the list of ordered tasks.r,rA)ryrdepthrN) r=RichTaskrylenrrzget_descendantschildrentasksidrR)rrr, rich_taskr3rbs rr|"RichProgressMonitor._on_task_begins}}V$**is4yST}  ??a "+ ((88>rBF(1OODH %:>9L9L, 9L   # #DGG ,9L, (, s,CcURS5nURRU5Gtp4Uc3[URU[ U5S9nXCSR US'O6URUlURRURSSS9 [U5HOnURcMURUR-nURRURUS9 MQ g)z>Update the progress of the task and its ancestors recursively.r,NrrrA) completedtotal)r) r=rzrrryrrrrupdaterreversedprogress)rrr, ancestorsrbancestorrs rr} RichProgressMonitor._on_task_ends}}V$..>>tD <D--yIOD/3bM " "48 ,"ZZDN    $ $TWW $ C +H~~% ))HNN:I    $ $X[[I $ F ,r)ryrrz) rBrCrDrErFrrr|r}rGrfrgs@rr r s# (2 "GGrr c@\rSrSrSrSr\S5rSrSr Sr Sr g ) raaA task, i.e. progressbar, in the tree of rich tasks. There is a rich task for each non-leaf task in the context tree of the estimator. Parameters ---------- progress_ctx : `rich.Progress` instance The progress context to which this task belongs. task_info : dict Information about the task for which this rich task is created. depth : int The depth of the task in the tree of rich tasks. Attributes ---------- completed : int The number of completed subtasks. total : int or None The total number of subtasks. None if the total number of subtasks is not known. progress : float The fraction, between 0 and 1, of the task that is completed. id : int The ID of the task in the Progress context. children : dict A mapping from the index of a child to the child node `{idx: RichTask}`. For a leaf, it's an empty dictionary. c0UlX0lSUlURSS5UlU(a0UR U5nUR X@RS9Ulgg)Nrr/)r)rrrr=r_format_task_descriptionadd_taskr)rryrr descriptions rrRichTask.__init__sX  ]]>15 77 BK"++Kzz+JDG rcURUR:XagURcg[SURR 555UR- $)z2Return the fraction of the task that is completed.g?gc38# UHoRv M g7fr<)r).0childs r $RichTask.progress.. sF/Ee>>/Es)rrsumrvaluesrUs rrRichTask.progresssK >>TZZ ' :: Ft}}/C/C/EFFSSrcSUR-nUSSUS3nURS:aSUS3OSnUS bUS SUS S 3OSnUUUU3$) z,Return a formatted description for the task.z r0z - r-rz #r.r1r2z | r)rrindent task_descid_marksource_task_descs rr!RichTask._format_task_description s4::%& !1233y7M6NO 15aBy+,-R01=012#i@R6S5TTW X  *+I;wi@@rc[U5S:XaU/$USUR;aUS/$U/URUSRUSS5-$)z;Return the descendants from this task along the given path.rAN)rrr)rr,s rrRichTask.get_descendantssY t9>6M 7$-- '$< v d1g.>>tABxHHHrc## [US5(a0Uv URR5H nUShvN M ggN 7f)zJPre-order depth-first traversal, only including tasks with a progress bar.rN)hasattrrr)rrs r__iter__RichTask.__iter__!sA 4  J--/   0 !s8AA A)rrrrrN) rBrCrDrErFrpropertyrrrrrGrHrrrrs5 DKTT AI!rrN)"numbersrrr threadingr"sklearn.callback._callback_contextrsklearn.callback._transportrrr $sklearn.utils._optional_dependenciesr sklearn.utils._param_validationr r r"r#r rich.progressrIrJrKrL rich.stylerMrOrYrirm ImportErrorr rrHrrrs?KKCE   RFRFj RR MHM.%79L.4"4j4NG&NGbO!O!k  s?BBB