+ jhRt^RIt^RIt^RIHt^RIHtRRltRRltRt R t R t R t R t R#) ayRegression test for RecursionError on deeply-nested jCal. The iCal parser/serializer was made iterative to survive deep nesting (see https://github.com/collective/icalendar/issues/1370), but the jCal counterparts :meth:`Component.from_jcal` and :meth:`Component.to_jcal` remained recursive: a small jCal payload nesting components a few hundred levels deep raised an uncaught ``RecursionError`` at the default recursion limit (1000). These tests mirror ``test_walk_handles_deeply_nested_components`` and use a depth comfortably above the recursion limit so the recursive implementation would fail while the iterative one succeeds. N) Component)JCalParsingErrorc0V^8dQhR\R\/#)depthreturn)intlist)formats"b/home/ralf/ical-fahrzeuge/venv/lib/python3.14/site-packages/icalendar/tests/test_jcal_recursion.py __annotate__r s    cRR/RR.R/RR....pTp\V4F'pRR/RR ....pV^,PV4TpK) V#) z?Return a jCal VCALENDAR with ``depth`` levels of nested VEVENT. vcalendarversiontext2.0prodidz-//test//test//ENveventuidznested@example.com)rangeappend)rrootinner_childs& r _nested_jcalrsv  R '(B@S)TU  D E 5\UB0DEFK a Kr c0V^8dQhR\R\/#)r componentr)rr)r s"r r r &siCr cj^pVP'dV^, pVP^,pK0V#)z@Count how many levels of single-child nesting ``component`` has.) subcomponents)rrs& r _nesting_depthr!&s1 E  ! ! !  ++A. Lr c\P!4^2,p\P!\ V44pVP R8XgQh\ V4V8XgQhR#)zDDeeply nested jCal must parse without exceeding the recursion limit. VCALENDARN)sysgetrecursionlimitr from_jcalrnamer!)rcalendars r /test_from_jcal_handles_deeply_nested_componentsr)/sO  ! ! #b (E""<#67H ==K '' ' ( #u ,, ,r c\P!4^2,p\P!\ V44pVP 4pT^rCV^,'dV^, pV^,^,pK*W@8XgQhR#)z7Serializing a deeply nested component must not recurse.N)r$r%rr&rto_jcal)rr(jcalnodelevelss r -test_to_jcal_handles_deeply_nested_componentsr/7sh  ! ! #b (E""<#67H    D& q''! Awqz ??r c\P!4^2,p\V4p\P!V4P 4p\P!V4P 4pY#rT^p\ V4^8XgQh\ V4^8XgQhV^,V^,8XgQhV^,V^,8XgQhV^,'gV^,'dQhM^\ V^,4\ V^,4u;8Xd ^8XgQhQhV^,^,V^,^,rTV^, pKW`8XgQhR#)z;from_jcal -> to_jcal -> from_jcal is stable at large depth.N)r$r%rrr&r+len)rr,oncetwiceabr.s r #test_deeply_nested_jcal_round_tripsr6Ds  ! ! #b (E  D   t $ , , .D    % - - /E q F 1v{{1v{{tqt||tqt||ttttO8 1Q4yC!I******tAw!Q1!  ??r c RR/RR.R/RR..RR/RR ..R R /RR .R /RR.R/RR....R R /RR.R/RR......RR/RR......p\P!V4P4pV^,^,^,^,^,R 8XgQhV^,^,^,^,^,R8XgQh\V^,^,^,4^8XgQhV^,^,^,^,^,^,^,R 8XgQhV^,^,^,^,^,^,^,R8XgQhR#)aHto_jcal preserves sibling order in branching (non-linear) trees. The round-trip test above only exercises a single child per node. The iterative stack walk appends each child to its parent before pushing it, so sibling order must be independent of the LIFO pop order -- this locks that in with multiple siblings at two levels. rrrrrz -//test//ENrrz first@testvalarmactionDISPLAY descriptionAtriggerdurationz-PT15MAUDIOz-PT5Mz second@testN)rr&r+r1)r,results r test_branching_jcal_round_tripsrA_s  R '(B )NOV\23!%r69=*B<&JA !%r67;&J@  .FM:;R @1  D<  & . . 0F !9Q<?1 a L 00 0 !9Q<?1 a M 11 1 vay|A 1 $$ $ !9Q<?1 a  #A &) 33 3 !9Q<?1 a  #A &' 11 1r cR.R.R.^*......p\P!\RR7;_uu_4\P!V4RRR4R# +'giR#;i)z?Errors deep in the tree still report the accumulated jCal path.rrr8zR\[2\]\[0\]\[2\]\[0\]\[2\]\[0\] in Alarm: A component must be a list with 3 items\.)matchN)pytestraisesrrr&)bads r ,test_error_path_is_preserved_for_nested_jcalrGsj  B(B-. /0 C 5   C     s A A% )__doc__r$rD icalendarricalendar.errorrrr!r)r/r6rArGr r rLs<  , - 6-2` !r