\h.SSKJr SrSrg)wrapsc^UmU4SjnU$)a Memo decorator for sequences defined by recurrence Examples ======== >>> from sympy.utilities.memoization import recurrence_memo >>> @recurrence_memo([1]) # 0! = 1 ... def factorial(n, prev): ... return n * prev[-1] >>> factorial(4) 24 >>> factorial(3) # use cache values 6 >>> factorial.cache_length() # cache length can be obtained 5 >>> factorial.fetch_item(slice(2, 4)) [2, 6] c`>^[T5UU4Sj5nU4SjUlU4SjUlU$)Nc>[T5nX:aTU$[XS-5HnTRT"UT55 M TS$)Nlenrangeappend)nLicachefs S/var/www/auris/envauris/lib/python3.13/site-packages/sympy/utilities/memoization.pyg-recurrence_memo..decorator..gsHE AuQx1!e_ Qq%[)%9 c>[T5$N)r )rsr4recurrence_memo..decorator..$s Urc>TU$r)xrs rrr%s qr)r cache_length fetch_item)rrrs` r decorator"recurrence_memo..decorators. q   ,) rr)initialr rs @rrecurrence_memor#s* E  rc^^/mUU4SjnU$)z Memo decorator for associated sequences defined by recurrence starting from base base_seq(n) -- callable to get base sequence elements XXX works only for Pn0 = base_seq(0) cases XXX works only for m <= n cases c6>^[T5UUU4Sj5nU$)Nc>[T 5nX:aT UU$[X S-5HOnT"U5nU/nT RU5 [SUS-5HnT "X6T 5nURU5 M MQ T UU$)Nrr ) rmrrF_i0 F_i_cachejF_ijbase_seqrrs rr3assoc_recurrence_memo..decorator..g7sE AuQx{"1!e_{!F  Y'q!a%AQ5>D$$T*)%8A; rr)rrr,rs` rr (assoc_recurrence_memo..decorator6s q   &rr)r,r rs` @rassoc_recurrence_memor/*s E, rN) functoolsrr#r/rrrr1s#L"r