QcQV bdZddlZddlZdZdZdZGddZdZd Zd Z d Z d Z d Z Gdde ZhdZdejdejfdejddedfdejdfdejdfdejdejfgZdZd2dZd2dZdZd Zd!Zd"ZGd#d$Zd%Zd&Zd'ZGd(d)ZGd*d+eZ Gd,d-eZ!Gd.d/e!Z"Gd0d1eZ#dS)3z babel.numbers ~~~~~~~~~~~~~ CLDR Plural support. See UTS #35. :copyright: (c) 2013-2022 by the Babel Team. :license: BSD, see LICENSE for more details. N)zeroonetwofewmanyotherrcjt|}t|}t|tr*||kr|}n!t jt |}t|tjr|}|j}|dkr|j |dnd}d d|D}| d}t|}t|} t|pd} t|pd} ndx}x} x} } dx} } |||| | | | | fS)uExtract operands from a decimal, a float or an int, according to `CLDR rules`_. The result is a 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] rNc34K|]}t|VdSNstr).0ds ,lib/python3.11/site-packages/babel/plural.py z#extract_operands..As(;;a3q66;;;;;;0) absint isinstancefloatdecimalDecimalras_tupleexponentdigitsjoinrstriplen)sourceni dec_tupleexpfraction_digitstrailing no_trailingvwftces rextract_operandsr0s@2 F A AA!U( 6 (AAA''A!W_%% JJLL  47!GC)*3440077;;?;;;;;ooc** MM     A     q ! !AA IA aAq!Q !!rc|eZdZdZdZdZdZedZe dZ e dd Z d Z d Z d Zd S) PluralRuleafRepresents 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_funcct|tr|}t}g|_t t |D]}\}}|tvrtd|z||vrtd|z| |t|j }|r|j ||f~dS)a$Initialize 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 zunknown tag %rztag %r defined twiceN) rdictitemssetr3sortedlist _plural_tags ValueErroradd_Parserastappend)selfrulesfoundkeyexprr?s r__init__zPluralRule.__init__ds eT " " "KKMME U ,, 1 1IC,& ? !1C!7888 ? !7#!=>>> IIcNNN$--#C 1 $$c3Z000 1 1rc|jdt|jddfdtDdS)N< , c2g|]}|v|d|S)z: r )rtagrBs r z'PluralRule.__repr__..~s@(((,(333c 3(((r>)rBtype__name__rr;)rArBs @r__repr__zPluralRule.__repr__zsh  JJ    II((((|((( ) ) ) )  rc<t||r|S||S)a Create 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 )r)clsrBs rparsezPluralRule.parses) eS ! ! Ls5zzrcPtjfd|jDS)zThe `PluralRule` as a dict of unicode plural rules. >>> rule = PluralRule({'one': 'n is 1'}) >>> rule.rules {'one': 'n is 1'} c.i|]\}}||Sr r )rrLr?_compiles r z$PluralRule.rules..s'AAAxsCXXc]]AAAr)_UnicodeCompilercompiler3)rArWs @rrBzPluralRule.ruless/$%%-AAAA4=AAAArc>td|jDS)Nc3&K|] }|dV dS)rNr )rr$s rrz&PluralRule...s&'A'A!'A'A'A'A'A'Ar) frozensetr3xs rzPluralRule.si'A'Aaj'A'A'AAArz A 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.)docc|jSr r3rAs r __getstate__zPluralRule.__getstate__s }rc||_dSr rc)rAr3s r __setstate__zPluralRule.__setstate__s   rctt|dst||_||S)Nr4)hasattr to_pythonr4)rAr#s r__call__zPluralRule.__call__s1tW%% )"4DJzz!}}rN)rP __module__ __qualname____doc__ __slots__rFrQ classmethodrTpropertyrBtagsrergrkr rrr2r2Ms(&I111,     [ BBXB 8AAH   D !!!rr2c$tj}dg}t|jD])\}}|||d|d*|dt zd|S)aConvert 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 ? z : z%r; })r )_JavaScriptCompilerrZr2rTr3r@ _fallback_tagr)ruleto_jsresultrLr?s r to_javascriptrys ! ! )E& 'F$$T**388S eeCjjjj###67777 MM(]*+++ 776??rc ttttd}t j}ddg}t |jD]6\}}| d||dt|7| dtzt d |dd }t|||d S) a<Convert 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 )INWITHINMODr0zdef evaluate(n):z- n, i, v, w, f, t, c, e = extract_operands(n)z if (z ): return z return %r zexecevaluate) in_range_listwithin_range_list cldr_modulor0_PythonCompilerrZr2rTr3r@rrureval)rv namespaceto_python_funcrxrLr?codes rrjrjs(#, I %&&.N7F$$T**3OOS  ~~c/B/B/B/BCHHHMNNNN MM,./// 499V$$h 7 7Dy Z  rct|}|jthzt j}fdt Dj}dtzg}|j D]1\}}| d||||fz2| d|tzd |S)aThe 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 cg|]}|v| Sr r )rrL used_tagss rrMzto_gettext..s#BBB# 1AB#BBBrznplurals=%d; plural=(z %s ? %d : z%d);r ) r2rTrrru_GettextCompilerrZr;indexr!r3r@r)rvrW _get_indexrxrLr?rs @r to_gettextrs   D ! !D ]O+I!!)HBBBBBBBHJ%I6 7FMGGS lhhsmmZZ__%EEFFFF MM&::m444555 776??rcH|t|kot||S)aInteger 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((? A0jAAArc:tfd|DS)aFloat 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 c36K|]\}}|ko|kVdSr r )rmin_max_rs rrz$within_range_list..%s4HHztTsd{*sd{HHHHHHr)anyrs` rrrs(" HHHHZHHH H HHrcRd}|dkr|dz}d}|dkr|dz}||z}|r|dz}|S)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(sWG1u R1u R QB b IrceZdZdZdS) RuleErrorzRaised if a rule is malformed.N)rPrlrmrnr rrrr?s((((rr>r.r/r,r$r#r-r*r+z\s+wordz"\b(and|or|is|(?:with)?in|not|mod|[r z])\bvaluez\d+symbolz%|,|!=|=ellipsisz\.{2,3}|\u2026c|dd}g}d}t|}||krtD]^\}}|||}|A|}|r)|||fn_td||z||k|dddS)N@rz5malformed CLDR pluralization rule. Got unexpected %rr)splitr!_RULESmatchendr@groupr)srxposrtokrvrs r tokenize_rulerVs  QA F C a&&C ) : : :ICJJq#&&E iikk8MM3 "6777   023C&9:: : ) : $$B$<rcV|o'|dd|ko|dup|dd|kS)Nrrrr tokenstype_rs rtest_next_tokenris<  2fRjmu, 2 $ 0&*Q-502rcPt|||r|SdSr )rpoprs r skip_tokenrns.vue,,zz||rc d|ffS)Nrr )rs r value_noderss UI rc |dfS)Nr r )names r ident_noderws 8Orc d|fS)Nrr )rs rrange_list_noder{s  ##rc d|ffS)Nnotr )rs rnegaters 2%<rcPeZdZdZdZd dZdZdZdZdZ d Z d Z d Z d Z dS)r>uInternal 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 instanciation into an attribute called `ast`. ct||_|js d|_dS||_|jr#t d|jddzdS)NzExpected end of rule, got %rrr)rrr? conditionr)rAstrings rrFz_Parser.__init__sv#F++ { DH F>>## ; 0: KOA./00 0 0 0rNct|j||}||S|t|dur|p|}|jstd|ztd|d|jdd)Nz#expected %s but end of rule reachedz expected z but got rr)rrreprr)rArrtermtokens rexpectz_Parser.expects4;u55  L  : /%8599D{ JADHII IiDDD$+b/!:L:LMNNNrc|}t|jddr.d||ff}t|jdd.|S)Nror) and_conditionrrrAops rrz_Parser.conditionsa    ! !fd33 2D..0011Bfd33 2 rc|}t|jddr.d||ff}t|jdd.|S)Nrand)relationrrrs rrz_Parser.and_conditionsY ]]__fe44 .T]]__--Bfe44 . rc|}t|jddr0t|jddrdpd||ffSt|jdd}d}t|jddrd}nr>sB 0 0 0OOOO  ---"---+++    88888rr>cfdS)%Compiler factory for the `_Compiler`.c^||||fzSr rZ)rAlrtmpls rr`z"_binary_compiler..s%ddll1oot||A%GGrr rs`r_binary_compilerrs G G G GGrcfdS)rc4||zSr r)rAr_rs rr`z!_unary_compiler..s4$,,q//1rr rs`r_unary_compilerrs 1 1 1 11rcdS)Nrr r^s rr`r`srceZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z ed Zed ZedZedZedZedZdZdS) _CompilerzZThe compilers are able to transform the expressions into multiple output formats. c8|\}}t|d|z|S)Ncompile_)getattr)rAargrargss rrZz_Compiler.compiles&D-wtZ"_--t44rcdS)Nr#r r^s rr`z_Compiler.#rcdS)Nr$r r^s rr`z_Compiler.rrcdS)Nr*r r^s rr`z_Compiler.rrcdS)Nr+r r^s rr`z_Compiler.rrcdS)Nr,r r^s rr`z_Compiler.rrcdS)Nr-r r^s rr`z_Compiler.rrcdS)Nr.r r^s rr`z_Compiler.rrcdS)Nr/r r^s rr`z_Compiler.rrc t|Sr r)r_r*s rr`z_Compiler.s Qrz (%s && %s)z (%s || %s)z(!%s)z (%s %% %s)z (%s == %s)z (%s != %s)ctr )NotImplementedError)rArrErs rcompile_relationz_Compiler.compile_relation$s!###rN)rPrlrmrnrZ 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_isnotrr rrrr s555 I I I I I I I I''M""<00K!!,//J!/'**K""<00K!!,//J$$\22M$$$$$rrcpeZdZdZedZedZedZedZ dZ dS)rz!Compiles an expression to Python.z (%s and %s)z (%s or %s)z(not %s)z MOD(%s, %s)cddfd|dDz}|d|d|dS)Nz[%s]rc Zg|]'}dttj|z(S)z(%s, %s))tuplemaprZ)rrange_rAs rrMz4_PythonCompiler.compile_relation..2sB * * *%DL& 9 9:: : * * *rr(rJ))rupperrZ)rArrErcompile_range_lists` rrz _PythonCompiler.compile_relation0s#chh * * * *%a= * * *'+'++ &||~~~~t||D/A/A/A/A1113 3rN) rPrlrmrnrrrrrrrr rrrr(sh++""=11K!!,//J!/*--K""=11K33333rrc6eZdZdZejZeZeZ eZ eZ dZ dS)rz)Compile into a gettext plural expression.c zg}||}|dD]}|d|dkr6|d|d||ddJt|j|\}}|d|d|d|d|d d d |zS) Nrrrz == rz >=  && z <= z(%s)z || )rZr@rr)rArrErritemminmaxs rrz!_GettextCompiler.compile_relationAs ||D!!qM  DAw$q'!  DDLLa)))) t|T22S DDCCDDCC   B''rN) rPrlrmrnrr r  compile_zeror r r rrr rrrr8sE33#IIIII(((((rrc.eZdZdZdZeZeZeZeZ dZ dS)rtz/Compiles the expression to plain of JavaScript.cdS)NzparseInt(n, 10)r r^s rr`z_JavaScriptCompiler.Zs+rct||||}|dkr!||}d|d|d|d}|S)Nrz (parseInt(z , 10) == r$r)rrrZ)rArrErrs rrz$_JavaScriptCompiler.compile_relation`s]00 &$ ,, T> I<<%%DD7;ttTTT444HD rN) rPrlrmrnr r(r r r rrr rrrtrtUsG99,+IIIIIrrtceZdZdZedZedZedZedZedZ dZ d d Z d S) rYz+Returns a unicode pluralization rule again.z%s is %sz %s is not %sz %s and %sz%s or %sz %s mod %sc(|j|dddiS)NrrT)r)rArs rrz_UnicodeCompiler.compile_notvs$t$HQK@T@@@rFc zg}|dD]{}|d|dkr/|||dC|dtt|j|z||||rdpdd|dd|S)Nrrz%s..%sz notr rIr)r@rZrrr)rArrErrrangesr%s rrz!_UnicodeCompiler.compile_relationysqM I IDAw$q'! I dll47334444 hs4</F/F)G)GGHHHH LL    2F 8b 8 8 FFCHHV$$$  rN)F) rPrlrmrnrrrrrrrrr rrrYrYis55 "!*--J$$^44M"";//K!!*--J"";//KAAA       rrYr )$rnrrer;rur0r2ryrjrrrr ExceptionrrrZUNICODErrrrrrrrrr>rrr(rrrrtrYr rrr3sA >  8"8"8"vZZZZZZZZz.%!%!%!P.BBB(III(.))))) )))    :2:fbj ) )* ZRZRbggennRRR S ST jbj  ! zrz+&&'-rz::;  &2222  $$$x8x8x8x8x8x8x8x8vHHH 222 } $$$$$$$$: 3 3 3 3 3i 3 3 3 (((((y(((:*(     y     r