̆hHZ %SrSSKJr SSKrSSKrSSKJrJr SSKJ r J r J r Sr Sr S7Sjr"S S 5rS8S jrS9S jrS8S jrS:SjrS:SjrS;Sjr"SS\5r1SkrS\R2"S\R454S\R2"SSR7\5S354S\R2"S54S\R2"S54S\R2"S\R454/rS\S 'SS"jjrS=S?S#jjr S@S$jr!SAS%jr"SBS&jr#SCS'jr$"S(S)5r%S*r&S+r'S,r("S-S.5r)"S/S0\)5r*"S1S2\)5r+"S3S4\+5r,"S5S6\)5r-g)Dz babel.numbers ~~~~~~~~~~~~~ CLDR Plural support. See UTS #35. :copyright: (c) 2013-2025 by the Babel Team. :license: BSD, see LICENSE for more details. ) annotationsN)IterableMapping)AnyCallableLiteral)zeroonetwofewmanyotherrc:[U5n[U5n[U[5(a'X!:XaUnO[R "[ U55n[U[R 5(aUR5nURnUS:aURUSOSnSRSU55nURS5n[U5n[U5n [U=(d S5n [U=(d S5n OS=n=n =pS=pXXXX4$)uExtract operands from a decimal, a float or an int, according to `CLDR rules`_. The result is an 8-tuple (n, i, v, w, f, t, c, e), where those symbols are as follows: ====== =============================================================== Symbol Value ------ --------------------------------------------------------------- n absolute value of the source number (integer and decimals). i integer digits of n. v number of visible fraction digits in n, with trailing zeros. w number of visible fraction digits in n, without trailing zeros. f visible fractional digits in n, with trailing zeros. t visible fractional digits in n, without trailing zeros. c compact decimal exponent value: exponent of the power of 10 used in compact decimal formatting. e currently, synonym for ‘c’. however, may be redefined in the future. ====== =============================================================== .. _`CLDR rules`: https://www.unicode.org/reports/tr35/tr35-61/tr35-numbers.html#Operands :param source: A real number :type source: int|float|decimal.Decimal :return: A n-i-v-w-f-t-c-e tuple :rtype: tuple[decimal.Decimal, int, int, int, int, int, int, int] rNc38# UHn[U5v M g7fNstr).0ds D/opt/services/DDDS/venv/lib/python3.13/site-packages/babel/plural.py #extract_operands..Ds;?a3q66?s0) absint isinstancefloatdecimalDecimalras_tupleexponentdigitsjoinrstriplen)sourceni dec_tupleexpfraction_digitstrailing no_trailingvwftces rextract_operandsr6s2 F A AA!U 6AA'A!W__%%JJL   47!G)**34077;?;;ooc* M    A    q !A IA qQ !!c\rSrSrSrSrSSjrSSjr\SSj5r \ SSj5r \ SSj5r SS jr SS jrSS jrS rg ) PluralRulePa*Represents a set of language pluralization rules. The constructor accepts a list of (tag, expr) tuples or a dict of `CLDR rules`_. The resulting object is callable and accepts one parameter with a positive or negative number (both integer and float) for the number that indicates the plural form for a string and returns the tag for the format: >>> rule = PluralRule({'one': 'n is 1'}) >>> rule(1) 'one' >>> rule(2) 'other' Currently the CLDR defines these tags: zero, one, two, few, many and other where other is an implicit default. Rules should be mutually exclusive; for a given numeric value, only one rule should apply (i.e. the condition should only be true for one of the plural rule elements. .. _`CLDR rules`: https://www.unicode.org/reports/tr35/tr35-33/tr35-numbers.html#Language_Plural_Rules )abstract_funcc[U[5(aUR5n[5n/Ul[ U5H~up4U[ ;a[SU<35eX2;a[SU<S35eURU5 [U5RnU(dMbURRX545 M g)zInitialize the rule instance. :param rules: a list of ``(tag, expr)``) tuples with the rules conforming to UTS #35 or a dict with the tags as keys and expressions as values. :raise RuleError: if the expression is malformed z unknown tag ztag z defined twiceN) rritemssetr;sorted _plural_tags ValueErroradd_Parserastappend)selfrulesfoundkeyexprrEs r__init__PluralRule.__init__gs eW % %KKME/1 IC,& <w!788 4wn!=>> IIcN$-##Cs $$cZ0'r7c URnSR[Vs/sHo"U;dM USX3PM sn5nS[U5RSU<S3$s snf)N, z: < >)rHr%rAtype__name__)rGrHtagargss r__repr__PluralRule.__repr__}sc yyLYLSSXL0SEEJ<0LYZ4:&&'q22Zs A Ac@[U[5(aU$U"U5$)zCreate a `PluralRule` instance for the given rules. If the rules are a `PluralRule` object, that object is returned. :param rules: the rules as list or dict, or a `PluralRule` object :raise RuleError: if the expression is malformed )rr9)clsrHs rparsePluralRule.parses  eZ ( (L5zr7c[5RnURVVs0sH up#X!"U5_M snn$s snnf)zThe `PluralRule` as a dict of unicode plural rules. >>> rule = PluralRule({'one': 'n is 1'}) >>> rule.rules {'one': 'n is 1'} )_UnicodeCompilercompiler;)rG_compilerUrEs rrHPluralRule.ruless9$%--37==A=xsXc]"=AAAs<c:[SUR55$)zA set of explicitly defined tags in this rule. The implicit default ``'other'`` rules is not part of this set unless there is an explicit rule for it. c3*# UH oSv M g7f)rNr)rr*s rr"PluralRule.tags..s5}!1}s) frozensetr;rGs rtagsPluralRule.tagss 5t}}555r7cUR$rr;rfs r __getstate__PluralRule.__getstate__s }}r7cXlgrrj)rGr;s r __setstate__PluralRule.__setstate__s r7cf[US5(d[U5UlURU5$)Nr<)hasattr to_pythonr<)rGr)s r__call__PluralRule.__call__s(tW%%"4DJzz!}r7)r<r;N)rHz-Mapping[str, str] | Iterable[tuple[str, str]]returnNone)rur)rH:Mapping[str, str] | Iterable[tuple[str, str]] | PluralRulerur9)ruzMapping[str, str])ruzfrozenset[str])rulist[tuple[str, Any]])r;rxrurv)r)float | decimal.Decimalrur)rT __module__ __qualname____firstlineno____doc__ __slots__rLrW classmethodr[propertyrHrgrkrnrs__static_attributes__rr7rr9r9Pse(&I1,3   BB66!r7r9c[5RnS/n[RU5RH#up4UR U"U5SU<S35 M% UR S[ -5 SRU5$)aZConvert a list/dict of rules or a `PluralRule` object into a JavaScript function. This function depends on no external library: >>> to_javascript({'one': 'n is 1'}) "(function(n) { return (n == 1) ? 'one' : 'other'; })" Implementation detail: The function generated will probably evaluate expressions involved into range operations multiple times. This has the advantage that external helper functions are not required and is not a big performance hit for these simple calculations. :param rule: the rules as list or dict, or a `PluralRule` object :raise RuleError: if the expression is malformed z(function(n) { return  ?  : z%r; })r)_JavaScriptCompilerr_r9r[r;rF _fallback_tagr%)ruleto_jsresultrUrEs r to_javascriptrss ! ) )E& 'F$$T*33 s Cwc234 MM(]*+ 776?r7c [[[[S.n[ 5R nSS/n[ RU5RH,upEURSU"U5S[U5<35 M. URS[<35 [ SRU5SS 5n[Xa5 US $) aConvert a list/dict of rules or a `PluralRule` object into a regular Python function. This is useful in situations where you need a real function and don't are about the actual rule object: >>> func = to_python({'one': 'n is 1', 'few': 'n in 2..4'}) >>> func(1) 'one' >>> func(3) 'few' >>> func = to_python({'one': 'n in 1,11', 'few': 'n in 3..10,13..19'}) >>> func(11) 'one' >>> func(15) 'few' :param rule: the rules as list or dict, or a `PluralRule` object :raise RuleError: if the expression is malformed )INWITHINMODr6zdef evaluate(n):z- n, i, v, w, f, t, c, e = extract_operands(n)z if (z ): return z return  zexecevaluate) in_range_listwithin_range_list cldr_modulor6_PythonCompilerr_r9r[r;rFrrr%eval)r namespaceto_python_funcrrUrEcodes rrrrrs(#, I %&..N7F$$T*33  nS12*SXLIJ4 MMH]-./ 499V$h 7D Z  r7c[RU5nUR[1-n[ 5R n[ Vs/sH o3U;dM UPM snRnS[U5S3/nURH(up6URU"U5SU"U5S35 M* URU"[5S35 SRU5$s snf)agThe plural rule as gettext expression. The gettext expression is technically limited to integers and returns indices rather than tags. >>> to_gettext({'one': 'n is 1', 'two': 'n is 2'}) 'nplurals=3; plural=((n == 1) ? 0 : (n == 2) ? 1 : 2);' :param rule: the rules as list or dict, or a `PluralRule` object :raise RuleError: if the expression is malformed z nplurals=z ; plural=(rrz);r) r9r[rgr_GettextCompilerr_rAindexr'r;rFr%)r used_tagsr`rU _get_indexrrEs r to_gettextrs   D !D ]O+I!))H!-B# 1A#BHHJ#i.)4 5FMM #s:c?*;3?@" MMZ ./r23 776? Cs  CCcBU[U5:H=(a [X5$)aaInteger range list test. This is the callback for the "in" operator of the UTS #35 pluralization rule language: >>> in_range_list(1, [(1, 3)]) True >>> in_range_list(3, [(1, 3)]) True >>> in_range_list(3, [(1, 3), (5, 8)]) True >>> in_range_list(1.2, [(1, 4)]) False >>> in_range_list(10, [(1, 4)]) False >>> in_range_list(10, [(1, 4), (6, 8)]) False )rrnum range_lists rrrs" #c(? A0AAr7c.^[U4SjU55$)a~Float range test. This is the callback for the "within" operator of the UTS #35 pluralization rule language: >>> within_range_list(1, [(1, 3)]) True >>> within_range_list(1.0, [(1, 3)]) True >>> within_range_list(1.2, [(1, 4)]) True >>> within_range_list(8.8, [(1, 4), (7, 15)]) True >>> within_range_list(10, [(1, 4)]) False >>> within_range_list(10.5, [(1, 4), (20, 30)]) False c3R># UHupUTs=:*=(a U:*Os v M g7frr)rmin_max_rs rr$within_range_list..(s#@Zztts""d""Zs$')anyrs` rrrs" @Z@ @@r7cZSnUS:aUS-nSnUS:aUS-nX-nU(aUS-nU$)zJavaish modulo. This modulo operator returns the value with the sign of the dividend rather than the divisor like Python does: >>> cldr_modulo(-3, 5) -3 >>> cldr_modulo(-3, -5) -3 >>> cldr_modulo(3, 5) 3 rr)abreverservs rrr+sFG1u R1u R B b Ir7c\rSrSrSrSrg) RuleErroriBzRaised if a rule is malformed.rN)rTrzr{r|r}rrr7rrrBs(r7r>r4r5r2r*r)r3r0r1z\s+wordz"\b(and|or|is|(?:with)?in|not|mod|[rz])\bvaluez\d+symbolz%|,|!=|=ellipsisz\.{2,3}|\u2026z(list[tuple[str | None, re.Pattern[str]]]_RULEScJURS5Sn/nSn[U5nX#:at[HRupEURX5nUcMUR 5nU(a UR XFR 545 O [SX<35eX#:aMtUSSS2$)N@rz3malformed CLDR pluralization rule. Got unexpected r)splitr'rmatchendrFgroupr)srposrtokrrs r tokenize_rulerZs  QA$&F C a&C )ICJJq&E iikMM3 "67  QRSRXQ[\] ] ) $B$<r7cdU=(a( USSU:H=(a USL=(d USSU:H$)Nrrrrtokenstype_rs rtest_next_tokenrls>  2fRjmu, 2 $ 0&*Q-502r7cF[XU5(aUR5$gr)rpoprs r skip_tokenrus ve,,zz|-r7c SU44$)Nrr)rs r value_noderzs UI r7c US4$)Nrr)names r ident_noder~s 8Or7c SU4$)Nrr)rs rrange_list_noders  ##r7c SU44$)Nnotr)rs rnegaters 2%<r7cX\rSrSrSrSrSSjrSrSrSr S r S r S r S r S rSrg)rDiuInternal parser. This class can translate a single rule into an abstract tree of tuples. It implements the following grammar:: condition = and_condition ('or' and_condition)* ('@integer' samples)? ('@decimal' samples)? and_condition = relation ('and' relation)* relation = is_relation | in_relation | within_relation is_relation = expr 'is' ('not')? value in_relation = expr (('not')? 'in' | '=' | '!=') range_list within_relation = expr ('not')? 'within' range_list expr = operand (('mod' | '%') value)? operand = 'n' | 'i' | 'f' | 't' | 'v' | 'w' range_list = (range | value) (',' range_list)* value = digit+ digit = 0|1|2|3|4|5|6|7|8|9 range = value'..'value samples = sampleRange (',' sampleRange)* (',' ('…'|'...'))? sampleRange = decimalValue '~' decimalValue decimalValue = value ('.' value)? - Whitespace can occur between or around any of the above tokens. - Rules should be mutually exclusive; for a given numeric value, only one rule should apply (i.e. the condition should only be true for one of the plural rule elements). - The in and within relations can take comma-separated lists, such as: 'n in 3,5,7..15'. - Samples are ignored. The translator parses the expression on instantiation into an attribute called `ast`. c[U5UlUR(dSUlgUR5UlUR(a[ SURSS<35eg)NzExpected end of rule, got rr)rrrE conditionr)rGstrings rrL_Parser.__init__s\#F+ {{DH >># ;;8R9K8NOP P r7Nc[URX5nUbU$Uc[USL=(a U=(d U5nUR(d[SUS35e[SUSURSS<35e)Nz expected z but end of rule reachedz but got rr)rrreprr)rGrrtermtokens rexpect_Parser.expects|4;;5  L < /%859D{{iv-EFG G)D64;;r?13E2HIJJr7cUR5n[URSS5(a1SXR544n[URSS5(aM1U$)Nror) and_conditionrrrGops rr_Parser.conditionsS    !fd33..011Bfd33 r7cUR5n[URSS5(a1SXR544n[URSS5(aM1U$)Nrand)relationrrrs rr_Parser.and_conditionsM ]]_fe44]]_--Bfe44 r7c UR5n[URSS5(a:[URSS5=(a S=(d SXR544$[URSS5nSn[URSS5(aSnO?[URSS5(d#U(a [ S5eUR U5$SX1UR 544nU(a [U5$U$) Nrisrisnotinwithinz#Cannot negate operator based rules.r)rKrrrrnewfangled_relationrr)rGleftnegatedmethodrs rr_Parser.relationsyy{ dkk64 0 0dkk659EgMzz|$% %T[[&%8 dkk68 4 4Fdkk6488#$IJJ//55 &(9: :$vbz,",r7c[URSS5(aSnO*[URSS5(aSnO [S5eSSXR544nU(a [ U5$U$) Nr=Fz!=Tz'Expected "=" or "!=" or legacy relationrr)rrrrr)rGrrrs rr_Parser.newfangled_relationse dkk8S 1 1G  Xt 4 4GEF F $oo&78 8$vbz,",r7cUR5n[URS5(aXR54$X4$)Nr)rrr)rGrs rrange_or_value_Parser.range_or_values5zz| dkk: . .% %: r7cUR5/n[URSS5(a=URUR55 [URSS5(aM=[ U5$)Nr,)rrrrFr)rGrs rr_Parser.range_lists]))+, h44   d113 4h44z**r7cL[URS5nUb US[;a [S5eUSn[URSS5(aSUS4UR 544$[URSS5(aSUS4UR 544$[ U5$)NrrzExpected identifier variablemodrr%)rr_VARSrrr)rGrrs rrK _Parser.exprs$++v. <47%/:; ;Aw dkk65 1 1D":tzz|44 4  Xs 3 3D":tzz|44 4$r7cN[[URS5S55$)Nrr)rrrrfs rr _Parser.values #dkk'215677r7)rEr)NN)rTrzr{r|r}rLrrrrrrrrKrrrr7rrDrDs<B QK  -"-+  8r7rDc^U4Sj$)%Compiler factory for the `_Compiler`.cN>TURU5URU54-$rr_)rGrrighttmpls r"_binary_compiler..s!TT\\$-?eAT,U%Ur7rrs`r_binary_compilerr s UUr7c^U4Sj$)rc,>TURU5-$rr)rGxrs rr !_unary_compiler.. s4$,,q/1r7rr s`r_unary_compilerr s 11r7cg)Nrrrs rr r sr7c\rSrSrSrSrSrSrSrSr Sr S r S r S r S r\"S 5r\"S5r\"S5r\"S5r\"S5r\"S5rSrSrg) _CompilerizRThe compilers are able to transform the expressions into multiple output formats. c.Uup#[USU35"U6$)Ncompile_)getattr)rGargrrVs rr__Compiler.compiles!txt_-t44r7cg)Nr)rrs rr _Compiler.#r7cg)Nr*rrs rr rrr7cg)Nr0rrs rr rrr7cg)Nr1rrs rr rrr7cg)Nr2rrs rr r rr7cg)Nr3rrs rr r!rr7cg)Nr4rrs rr r"rr7cg)Nr5rrs rr r#rr7c[U5$rr)rr0s rr r$sQr7z (%s && %s)z (%s || %s)z(!%s)z (%s %% %s)z (%s == %s)z (%s != %s)c[5er)NotImplementedError)rGrrKrs rcompile_relation_Compiler.compile_relation,s !##r7rN)rTrzr{r|r}r_ compile_n compile_i compile_v compile_w compile_f compile_t compile_c compile_e compile_valuer  compile_and compile_orr compile_not compile_mod compile_is compile_isnotr(rrr7rrrs|5IIIIIIII'M"<0K!,/J!'*K"<0K!,/J$\2M$r7rc^\rSrSrSr\"S5r\"S5r\"S5r \"S5r Sr Sr g ) ri0z!Compiles an expression to Python.z (%s and %s)z (%s or %s)z(not %s)z MOD(%s, %s)c SRUSVVs/sH,upESURU5SURU5S3PM. snn5nUR5SURU5SUS3$s snnf)Nrr(rO)z, [z]))r%r_upper)rGrrKrrrrangess rr( _PythonCompiler.compile_relation8s{S]^_S`aS`!Qt||A/r$,,q/1B!DS`ab,,.!4<<#5"6c&DDbs3A7 rN) rTrzr{r|r}r r3r4rr5r6r(rrr7rrr0s3+"=1K!,/J!*-K"=1KEr7rcF\rSrSrSr\R r\r \r \r \r Sr Srg)ri=z)Compile into a gettext plural expression.c F/nURU5nUSHqnUSUS:Xa,URSUSURUS5S35 M;[URU5upgURSUSUSUSUS3 5 Ms SS RU5S3$) Nrrr;z == r<z >=  && z <= z || )r_rFmapr%)rGrrKrritemminmaxs rr(!_GettextCompiler.compile_relationFs ||D!qMDAw$q'! AdV4 T!W(='>a@At||T2 AdV4uDd3%qAB " 6;;r?#1%%r7rN)rTrzr{r|r}rr*r+ compile_zeror,r-r.r/r(rrr7rrr=s)3##IIIII &r7rc4\rSrSrSrSr\r\r\r \r Sr Sr g)riRz/Compiles the expression to plain of JavaScript.cg)NzparseInt(n, 10)rrs rr _JavaScriptCompiler.Ws+r7cx[RXX#5nUS:XaURU5nSUSUSUS3nU$)Nrz (parseInt(z , 10) == rBr<)rr(r_)rGrrKrrs rr($_JavaScriptCompiler.compile_relation]sK00 $, T><<%DvYtfDa@D r7rN) rTrzr{r|r}r+rHr,r-r.r/r(rrr7rrrRs%9,IIIIIr7rcx\rSrSrSr\"S5r\"S5r\"S5r\"S5r \"S5r Sr S S jr S r g ) r^ifz+Returns a unicode pluralization rule again.z%s is %sz %s is not %sz %s and %sz%s or %sz %s mod %sc,UR"USSS06$)NrrT)r()rGrs rr5_UnicodeCompiler.compile_notss$$hqk@4@@r7c Z/nUSHnnUSUS:Xa%URURUS55 M4URURUS5SURUS535 Mp URU5U(aSOSSUSSRU53$)Nrrz..z notrrQr)rFr_r%)rGrrKrrr>rDs rr(!_UnicodeCompiler.compile_relationvsqMDAw$q'! dll4734 d1g!6 7r$,,tAw:O9PQR " ,,t$%fR%@&388TZK[J\]]r7rN)F)rTrzr{r|r}r r7r8r3r4r6r5r(rrr7rr^r^fsE5 "*-J$^4M";/K!*-J";/KA^r7r^)r(ryruzMtuple[decimal.Decimal | int, int, int, int, int, int, Literal[0], Literal[0]])rrwrur)rrwruz(Callable[[float | decimal.Decimal], str])rryr+Iterable[Iterable[float | decimal.Decimal]]rubool)rrrrrur)rrrulist[tuple[str, str]]r)rrUrrr str | Noneruzlist[tuple[str, str]] | bool)rrUrrrrV)rrruz#tuple[Literal['value'], tuple[int]])rrruztuple[str, tuple[()]])rrSruzItuple[Literal['range_list'], Iterable[Iterable[float | decimal.Decimal]]])rztuple[Any, ...]ruz-tuple[Literal['not'], tuple[tuple[Any, ...]]]).r} __future__rr recollections.abcrrtypingrrrrArr6r9rrrrrrr Exceptionrrr_UNICODEr%r__annotations__rrrrrrrrDr rrHrrrrr^rr7rr^s# -))=  8"vZZz.%!P.B(A(.) )  2::fbjj )* RZZ=bggen=MTR ST bjj ! rzz+&'-rzz:; 40*2 !2 2 2" 2 $;$N$ w8w8tV 2  $$: Ei E&y&**(^y^r7