B }<[@S @sdZddlZddlmZdZdZddZGdd d eZd d Z d d Z ddZ ddZ ddZ ddZGdddeZdZdedejfdedefdedfdedfd ed!ejfgZd"d#ZdBd$d%ZdCd&d'Zd(d)Zd*d+Zd,d-Zd.d/ZGd0d1d1eZd2d3Zd4d5Zd6d7Z Gd8d9d9eZ!Gd:d;d;e!Z"Gdd?d?e#Z$Gd@dAdAe!Z%dS)Dz babel.numbers ~~~~~~~~~~~~~ CLDR Plural support. See UTS #35. :copyright: (c) 2013-2018 by the Babel Team. :license: BSD, see LICENSE for more details. N)decimal)ZzeroZoneZtwoZfewZmanyotherrc Cst|}t|}t|tr6||kr(|}ntt|}t|tjr|}|j}|dkrf|j |dnd}d dd|D}| d}t |}t |} t|pd} t|pd} nd}} } } |||| | | fS)a"Extract operands from a decimal, a float or an int, according to `CLDR rules`_. The result is a 6-tuple (n, i, v, w, f, t), 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. ====== =============================================================== .. _`CLDR rules`: http://www.unicode.org/reports/tr35/tr35-33/tr35-numbers.html#Operands :param source: A real number :type source: int|float|decimal.Decimal :return: A n-i-v-w-f-t tuple :rtype: tuple[decimal.Decimal, int, int, int, int, int] rNcss|]}t|VqdS)N)str).0drrAlib/python3.7/site-packages/Babel-2.6.0-py3.7.egg/babel/plural.py Asz#extract_operands..0) absint isinstancefloatrZDecimalrZas_tupleZexponentZdigitsjoinrstriplen) sourceniZ dec_tupleZexpZfraction_digitsZtrailingZ no_trailingvwftrrr extract_operandss$     rc@sdeZdZdZdZddZddZeddZe d d Z e d d d dZ ddZ ddZ ddZdS) PluralRuleaeRepresents 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`: http://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) rdictitemssetrsortedlist _plural_tags ValueErroradd_Parserastappend)selfrulesfoundkeyexprr'rrr __init__cs    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__yszPluralRule.__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*rrr parses zPluralRule.parsecs tjtfdd|jDS)zThe `PluralRule` as a dict of unicode plural rules. >>> rule = PluralRule({'one': 'n is 1'}) >>> rule.rules {'one': 'n is 1'} csg|]\}}||fqSrr)rr/r')_compilerr r0sz$PluralRule.rules..)_UnicodeCompilercompilerr)r)r)r6r r*szPluralRule.rulescCstdd|jDS)NcSsg|] }|dqS)rr)rrrrr r0sz'PluralRule...) frozensetr)xrrr szPluralRule.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)r2 __module__ __qualname____doc__ __slots__r.r3 classmethodr5propertyr*tagsr=r>rArrrr rLs 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)_JavaScriptCompilerr8rr5rr( _fallback_tagr)ruleZto_jsresultr/r'rrr to_javascripts rMcCsttttd}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 = extract_operands(n)z if (%s): return %rz return %r zexecZevaluate) in_range_listwithin_range_list cldr_modulor_PythonCompilerr8rr5rr(rrJreval)rK namespaceZto_python_funcrLr/r'coderrr r@s r@cst|}|jthBtj}fddtDj}dtg}x,|j D]"\}}| d||||fqHW| d|td |S)a~The 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)rr/) used_tagsrr r0szto_gettext..znplurals=%d; plural=(z %s ? %d : z%d)r) rr5rHrJ_GettextCompilerr8r#indexrrr(r)rKr6Z _get_indexrLr/r'r)rXr 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 rR)num range_listrrr rQsrQcstfdd|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_)r\rr r $sz$within_range_list..)any)r\r]r)r\r rRsrRcCs@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)abreverservrrr rS's rSc@seZdZdZdS) RuleErrorzRaised if a rule is malformed.N)r2rBrCrDrrrr re>sreZnivwftz\s+wordz)\b(and|or|is|(?:with)?in|not|mod|[{0}])\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 %rr_)splitr_RULESmatchendr(groupre)srLposrntokrKrmrrr tokenize_ruleMs  rscCs,|o*|dd|ko*|dkp*|dd|kS)Nr_rr`r)tokenstype_rgrrr test_next_token`srvcCst|||r|SdS)N)rvpop)rtrurgrrr skip_tokenes rxcCs d|ffS)Nrgr)rgrrr value_nodejsrycCs|dfS)Nrr)namerrr ident_nodensr{cCsd|fS)Nr]r)r]rrr range_list_nodersr|cCs d|ffS)Nnotr)rdrrr negatevsr~c@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 %rr_r`)rsrtr' conditionre)r)stringrrr r.s  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 %rr_r`)rxrtreprre)r)rurgZtermtokenrrr expects z_Parser.expectcCs0|}x"t|jddr*d||ff}q W|S)Nrfor) and_conditionrxrt)r)oprrr rsz_Parser.conditioncCs0|}x"t|jddr*d||ff}q W|S)Nrfand)relationrxrt)r)rrrr rsz_Parser.and_conditioncCs|}t|jddr8t|jddr(dp*d||ffSt|jdd}d}t|jddr^d}n$t|jdds|rxtd||Sd|||ff}|rt|S|S) Nrfisr}ZisnotinZwithinz#Cannot negate operator based rules.r)r-rxrtrgrenewfangled_relationr]r~)r)leftnegatedmethodrdrrr rs z_Parser.relationcCsRt|jddrd}nt|jddr(d}ntddd||ff}|rNt|S|S) Nrh=Fz!=Tz'Expected "=" or "!=" or legacy relationrr)rxrtrer]r~)r)rrrdrrr rsz_Parser.newfangled_relationcCs,|}t|jdr ||fS||fSdS)Nri)rgrxrt)r)rrrr range_or_values  z_Parser.range_or_valuecCs4|g}x t|jddr*||q Wt|S)Nrh,)rrxrtr(r|)r)r]rrr r]s z_Parser.range_listcCs|t|jd}|dks |dtkr(td|d}t|jddrRd|df|ffSt|jddrtd|df|ffSt|S)Nrfr`zExpected identifier variablemodrrh%)rxrt_VARSrergr{)r)rfrzrrr r-s z _Parser.exprcCstt|ddS)Nrgr`)ryr r)r)rrr rgsz _Parser.value)NN)r2rBrCrDr.rrrrrrr]r-rgrrrr r&zs    r&cs fddS)z%Compiler factory for the `_Compiler`.cs||||fS)N)r8)r)lr)tmplrr r;sz"_binary_compiler..r)rr)rr _binary_compilersrcs fddS)z%Compiler factory for the `_Compiler`.cs||S)N)r8)r)r:)rrr r;sz!_unary_compiler..r)rr)rr _unary_compilersrcCsdS)Nr r)r:rrr r;sr;c@seZdZdZddZddZddZddZddZd dZ d dZ d dZ e d Z e d ZedZe dZe dZe dZddZdS) _CompilerzZThe compilers are able to transform the expressions into multiple output formats. cCs|\}}t|d||S)NZcompile_)getattr)r)argrargsrrr r8sz_Compiler.compilecCsdS)Nrr)r:rrr r; sz_Compiler.cCsdS)Nrr)r:rrr r; scCsdS)Nrr)r:rrr r; scCsdS)Nrr)r:rrr r;scCsdS)Nrr)r:rrr r;scCsdS)Nrr)r:rrr r;scCst|S)N)r)r:rrrr r;sz (%s && %s)z (%s || %s)z(!%s)z (%s %% %s)z (%s == %s)z (%s != %s)cCs tdS)N)NotImplementedError)r)rr-r]rrr compile_relationsz_Compiler.compile_relationN)r2rBrCrDr8 compile_n compile_i compile_v compile_w compile_f compile_tZ compile_valuer compile_and compile_orr compile_not compile_mod compile_is compile_isnotrrrrr rs rc@s8eZdZdZedZedZedZedZ ddZ dS) rTz!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))tuplemapr8)rZrange_)r)rr r0'sz4_PythonCompiler.compile_relation..r`z %s(%s, %s))rupperr8)r)rr-r]Zcompile_range_listr)r)r r%s  z _PythonCompiler.compile_relationN) r2rBrCrDrrrrrrrrrrr rTs rTc@s.eZdZdZejZeZeZ eZ eZ ddZ dS)rYz)Compile into a gettext plural expression.c Csg}||}xd|dD]X}|d|dkrJ|d|||dfqt|j|\}}|d||||fqWdd|S)Nr`rz (%s == %s)z(%s >= %s && %s <= %s)z(%s)z || )r8r(rr)r)rr-r]rditemminmaxrrr r6s z!_GettextCompiler.compile_relationN) r2rBrCrDrrr compile_zerorrrrrrrrr rY-srYc@s0eZdZdZddZeZeZeZeZ ddZ dS)rIz/Compiles the expression to plain of JavaScript.cCsdS)NzparseInt(n, 10)r)r:rrr r;Osz_JavaScriptCompiler.cCs4t||||}|dkr0||}d|||f}|S)Nrz(parseInt(%s, 10) == %s && %s))rYrr8)r)rr-r]rWrrr rUs   z$_JavaScriptCompiler.compile_relationN) r2rBrCrDrrrrrrrrrrr rIJsrIc@sJeZdZdZedZedZedZedZedZ ddZ d d d Z d S)r7z+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)Nr`rT)r)r)rrrr rksz_UnicodeCompiler.compile_notFcCszg}xP|dD]D}|d|dkr8|||dq|dtt|j|qWd|||rhdpjd|d|fS)Nr`rz%s..%sz %s%s %s %sz notrr)r(r8rrr)r)rr-r]rZrangesrrrr rnsz!_UnicodeCompiler.compile_relationN)F) r2rBrCrDrrrrrrrrrrrr r7^sr7)N)N)&rDreZ babel._compatrr#rJrobjectrrMr@r[rQrRrS Exceptionrerr8UNICODEformatrlrsrvrxryr{r|r~r&rrrrrTrYrIr7rrrr  sH 8](     {