B fcQV @sdZddlZddlZdZdZddZGdddZd d Zd d Zd dZ ddZ ddZ ddZ Gddde ZddddddddhZdedejfd ed!d"ed#fd$ed%fd&ed'fd(ed)ejfgZd*d+ZdJd,d-ZdKd.d/Zd0d1Zd2d3Zd4d5Zd6d7ZGd8d9d9Zd:d;Zdd?ZGd@dAdAZGdBdCdCeZ GdDdEdEeZ!GdFdGdGe!Z"GdHdIdIeZ#dS)Lz babel.numbers ~~~~~~~~~~~~~ CLDR Plural support. See UTS #35. :copyright: (c) 2013-2022 by the Babel Team. :license: BSD, see LICENSE for more details. N)ZzeroZoneZtwoZfewZmanyotherrcCst|}t|}t|tr6||kr(|}ntt|}t|tjr|}|j}|dkrf|j |dnd}d dd|D}| d}t |}t |} t|pd} t|pd} nd}} } } d} } |||| | | | | 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] rNcss|]}t|VqdS)N)str).0drr+lib/python3.7/site-packages/babel/plural.py Asz#extract_operands..0) absint isinstancefloatdecimalZDecimalrZas_tupleZexponentdigitsjoinrstriplen)sourceniZ dec_tupleZexpZfraction_digitsZtrailingZ no_trailingvwftcerrrextract_operandss&     rc@sdeZdZdZdZddZddZeddZe d d Z e d d d dZ ddZ ddZ ddZdS) 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_funccCst|tr|}t}g|_xjtt|D]Z\}}|tkrJtd|n||kr^td|| |t |j }|r,|j ||fq,WdS)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) r dictitemssetrsortedlist _plural_tags ValueErroradd_Parserastappend)selfrulesfoundkeyexprr*rrr__init__ds    zPluralRule.__init__cs,|jdt|jdfddtDfS)Nz<%s %r>z, cs$g|]}|krd||fqS)z%s: %sr)rtag)r-rr ~sz'PluralRule.__repr__..)r-type__name__rr&)r,r)r-r__repr__zszPluralRule.__repr__cCst||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 )clsr-rrrparses zPluralRule.parsecstjfdd|jDS)zThe `PluralRule` as a dict of unicode plural rules. >>> rule = PluralRule({'one': 'n is 1'}) >>> rule.rules {'one': 'n is 1'} csi|]\}}||qSrr)rr2r*)_compilerr sz$PluralRule.rules..)_UnicodeCompilercompiler)r,r)r9rr-szPluralRule.rulescCstdd|jDS)Ncss|]}|dVqdS)rNr)rrrrrr sz&PluralRule...) frozensetr)xrrrzPluralRule.z 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.)doccCs|jS)N)r)r,rrr __getstate__szPluralRule.__getstate__cCs ||_dS)N)r)r,rrrr __setstate__szPluralRule.__setstate__cCst|dst||_||S)Nr )hasattr to_pythonr )r,rrrr__call__s  zPluralRule.__call__N)r5 __module__ __qualname____doc__ __slots__r1r6 classmethodr8propertyr-tagsrBrCrFrrrrrMs rcCsVtj}dg}x.t|jD]\}}|d|||fqW|dtd|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 %s ? %r : z%r; })r)_JavaScriptCompilerr<rr8rr+ _fallback_tagr)ruleZto_jsresultr2r*rrr to_javascripts rRcCsttttd}tj}ddg}x2t|jD]"\}}| d||t |fq,W| dt td |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 )INZWITHINZMODrzdef evaluate(n):z- n, i, v, w, f, t, c, e = extract_operands(n)z if (%s): return %rz return %r zexecZevaluate) in_range_listwithin_range_list cldr_modulor_PythonCompilerr<rr8rr+rrOreval)rP namespaceZto_python_funcrQr2r*coderrrrEs rEcst|}|jthBtj}fddtDj}dtg}x,|j D]"\}}| d||||fqHW| d|td |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 csg|]}|kr|qSrr)rr2) used_tagsrrr3szto_gettext..znplurals=%d; plural=(z %s ? %d : z%d);r) rr8rMrO_GettextCompilerr<r&indexrrr+r)rPr9Z _get_indexrQr2r*r)r]r to_gettexts  r`cCs|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 )r rW)num range_listrrrrVsrVcstfdd|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 c3s"|]\}}|ko|kVqdS)Nr)rZmin_Zmax_)rarrr %sz$within_range_list..)any)rarbr)rarrWsrWcCs@d}|dkr|d9}d}|dkr(|d9}||}|r<|d9}|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)abreverservrrrrX(s rXc@seZdZdZdS) RuleErrorzRaised if a rule is malformed.N)r5rGrHrIrrrrrj?srjrrrrrrrrz\s+wordz"\b(and|or|is|(?:with)?in|not|mod|[rz])\bvaluez\d+symbolz%|,|!=|=ellipsisz\.{2,3}|\u2026cCs|dd}g}d}t|}xb||krxTtD]<\}}|||}|dk r.|}|rh|||fPq.Wtd||q W|dddS)N@rz5malformed CLDR pluralization rule. Got unexpected %rrd)splitr_RULESmatchendr+grouprj)srQposrstokrPrrrrr tokenize_ruleVs  rxcCs,|o*|dd|ko*|dkp*|dd|kS)Nrdrrer)tokenstype_rlrrrtest_next_tokenisr{cCst|||r|SdS)N)r{pop)ryrzrlrrr skip_tokenns r}cCs d|ffS)Nrlr)rlrrr value_nodessr~cCs|dfS)Nrr)namerrr ident_nodewsrcCsd|fS)Nrbr)rbrrrrange_list_node{srcCs d|ffS)Nnotr)rirrrnegatesrc@sbeZdZdZddZdddZddZd d Zd d Zd dZ ddZ ddZ ddZ ddZ 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`. cCsDt||_|jsd|_dS||_|jr@td|jdddS)NzExpected end of rule, got %rrdre)rxryr* conditionrj)r,stringrrrr1s  z_Parser.__init__NcCsft|j||}|dk r|S|dkr6t|dkr0|p2|}|jsHtd|td||jddfdS)Nz#expected %s but end of rule reachedzexpected %s but got %rrdre)r}ryreprrj)r,rzrlZtermtokenrrrexpects z_Parser.expectcCs0|}x"t|jddr*d||ff}q W|S)Nrkor) and_conditionr}ry)r,oprrrrsz_Parser.conditioncCs0|}x"t|jddr*d||ff}q W|S)Nrkand)relationr}ry)r,rrrrrsz_Parser.and_conditioncCs|}t|jddr8t|jddr(dp*d||ffSt|jdd}d}t|jddr^d}n$t|jdds|rxtd||Sd|||ff}|rt|S|S) NrkisrZisnotinZwithinz#Cannot negate operator based rules.r)r0r}ryrlrjnewfangled_relationrbr)r,leftnegatedmethodrirrrrs z_Parser.relationcCsRt|jddrd}nt|jddr(d}ntddd||ff}|rNt|S|S) Nrm=Fz!=Tz'Expected "=" or "!=" or legacy relationrr)r}ryrjrbr)r,rrrirrrrsz_Parser.newfangled_relationcCs,|}t|jdr ||fS||fSdS)Nrn)rlr}ry)r,rrrrrange_or_values  z_Parser.range_or_valuecCs4|g}x t|jddr*||q Wt|S)Nrm,)rr}ryr+r)r,rbrrrrbs z_Parser.range_listcCs|t|jd}|dks |dtkr(td|d}t|jddrRd|df|ffSt|jddrtd|df|ffSt|S)NrkrezExpected identifier variablemodrrm%)r}ry_VARSrjrlr)r,rkrrrrr0s z _Parser.exprcCstt|ddS)Nrlre)r~r r)r,rrrrlsz _Parser.value)NN)r5rGrHrIr1rrrrrrrbr0rlrrrrr)s    r)cs fddS)z%Compiler factory for the `_Compiler`.cs||||fS)N)r<)r,lr)tmplrrr?r@z"_binary_compiler..r)rr)rr_binary_compilersrcs fddS)z%Compiler factory for the `_Compiler`.cs||S)N)r<)r,r>)rrrr?r@z!_unary_compiler..r)rr)rr_unary_compilersrcCsdS)Nr r)r>rrrr?r@r?c@seZdZdZddZddZddZddZddZd dZ d dZ d dZ d dZ d dZ edZedZedZedZedZedZddZdS) _CompilerzZThe compilers are able to transform the expressions into multiple output formats. cCs|\}}t|d||S)NZcompile_)getattr)r,argrargsrrrr<sz_Compiler.compilecCsdS)Nrr)r>rrrr?r@z_Compiler.cCsdS)Nrr)r>rrrr?r@cCsdS)Nrr)r>rrrr?r@cCsdS)Nrr)r>rrrr?r@cCsdS)Nrr)r>rrrr?r@cCsdS)Nrr)r>rrrr?r@cCsdS)Nrr)r>rrrr?r@cCsdS)Nrr)r>rrrr?r@cCst|S)N)r)r>rrrrr?r@z (%s && %s)z (%s || %s)z(!%s)z (%s %% %s)z (%s == %s)z (%s != %s)cCs tdS)N)NotImplementedError)r,rr0rbrrrcompile_relation$sz_Compiler.compile_relationN)r5rGrHrIr< compile_n compile_i compile_v compile_w compile_f compile_tZ compile_cZ compile_eZ compile_valuer compile_and compile_orr compile_not compile_mod compile_is compile_isnotrrrrrr s$rc@s8eZdZdZedZedZedZedZ ddZ dS) rYz!Compiles an expression to Python.z (%s and %s)z (%s or %s)z(not %s)z MOD(%s, %s)cs8ddfdd|dD}d|||fS)Nz[%s]rcs g|]}dttj|qS)z(%s, %s))tuplemapr<)rZrange_)r,rrr32sz4_PythonCompiler.compile_relation..rez %s(%s, %s))rupperr<)r,rr0rbZcompile_range_listr)r,rr0s  z _PythonCompiler.compile_relationN) r5rGrHrIrrrrrrrrrrrrY(s rYc@s.eZdZdZejZeZeZ eZ eZ ddZ dS)r^z)Compile into a gettext plural expression.c Csg}||}xd|dD]X}|d|dkrJ|d|||dfqt|j|\}}|d||||fqWdd|S)Nrerz (%s == %s)z(%s >= %s && %s <= %s)z(%s)z || )r<r+rr)r,rr0rbriitemminmaxrrrrAs z!_GettextCompiler.compile_relationN) r5rGrHrIrrr compile_zerorrrrrrrrrr^8sr^c@s0eZdZdZddZeZeZeZeZ ddZ dS)rNz/Compiles the expression to plain of JavaScript.cCsdS)NzparseInt(n, 10)r)r>rrrr?Zr@z_JavaScriptCompiler.cCs4t||||}|dkr0||}d|||f}|S)Nrz(parseInt(%s, 10) == %s && %s))r^rr<)r,rr0rbr\rrrr`s   z$_JavaScriptCompiler.compile_relationN) r5rGrHrIrrrrrrrrrrrrNUsrNc@sJeZdZdZedZedZedZedZedZ ddZ d d d Z d S)r;z+Returns a unicode pluralization rule again.z%s is %sz %s is not %sz %s and %sz%s or %sz %s mod %scCs|j|dddiS)NrerT)r)r,rrrrrvsz_UnicodeCompiler.compile_notFcCszg}xP|dD]D}|d|dkr8|||dq|dtt|j|qWd|||rhdpjd|d|fS)Nrerz%s..%sz %s%s %s %sz notrr)r+r<rrr)r,rr0rbrZrangesrrrrrysz!_UnicodeCompiler.compile_relationN)F) r5rGrHrIrrrrrrrrrrrrr;isr;)N)N)$rIrrer&rOrrrRrEr`rVrWrX Exceptionrjrr<UNICODErrqrxr{r}r~rrrr)rrrrrYr^rNr;rrrr sT;](    {