#ZjdZddlmZddlZddlmZejddeded eed eefd Z ejd ded eefd Z ejddddededed eefdZ ejddddedededed eef dZ dededed efdZ ejdddddd d!ed"ed#ed$ededed eefd%Zejd&d'ed(ed)ed eefd*Zejd+d,ed-ed.ed eefd/Zgd0ZdS)1zEGenerators that provide different rates, schedules, decays or series.)IterableN)registryzconstant_then.v1ratestepsschedulereturnc#HKt|D]}|V|D]}|VdS)z>Yield a constant rate for N steps, before starting a schedule.N)range)rrrivalues [/Users/jameslopez/projects/MentorCore/.venv/lib/python3.11/site-packages/thinc/schedules.py constant_thenr sL 5\\  z constant.v1c#K |V)zYield a constant rate.)rs rconstantrs rz decaying.v1)t base_ratedecayrc#4K |dd||zzz zV|dz })aYield an infinite series of linearly decaying values, following the schedule: base_rate * 1 / (1 + decay * t) EXAMPLE: >>> learn_rates = decaying(0.001, 1e-4) >>> next(learn_rates) 0.001 >>> next(learn_rates) 0.00999 T?rr)rrrs rdecayingrs73# /23333 Qrzcompounding.v1startstopcompoundc#XKt|} t|||V||z})adYield an infinite series of compounding values. Each time the generator is called, a value is produced by multiplying the previous value by the compound rate. EXAMPLE: >>> sizes = compounding(1.0, 10.0, 1.5) >>> assert next(sizes) == 1. >>> assert next(sizes) == 1 * 1.5 >>> assert next(sizes) == 1.5 * 1.5 )float_clip)rrrrcurrs r compoundingr"-s? <)zxYield an infinite series of values according to Howard and Ruder's "slanted triangular learning rate" schedule. Tr)int) r)r*r'r(rrcutp learn_rates rslanted_triangularr0Es i(" # #C Q s77CAAa#g#X)9":;rJsKK &'' '/ e_('M""5Xe_#" M""9:    e 3 x   #"  $%%>A ).6; e_&%&DDuDEDeDDDD+,,       e_-,.&'''*9< e_('$*++eUCHUO,+   r