o ڭhHZ @sUdZddlmZddlZddlZddlmZmZddlm Z m Z m Z dZ dZ ded d ZGdddZdfddZdgddZdfddZdhddZdhd d!Zdid%d&ZGd'd(d(eZhd)Zded*ejfd+ed,d-ed.fd/ed0fd1ed2fd3ed4ejfgZd5ed6<djd9d:Z dkdld?d@ZdkdmdAdBZ dndEdFZ!dodIdJZ"dpdLdMZ#dqdQdRZ$GdSdTdTZ%dUdVZ&dWdXZ'dYdZZ(Gd[d\d\Z)Gd]d^d^e)Z*Gd_d`d`e)Z+Gdadbdbe+Z,Gdcdddde)Z-dS)rz 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)zeroonetwofewmanyotherr sourcefloat | decimal.DecimalreturnMtuple[decimal.Decimal | int, int, int, int, int, int, Literal[0], Literal[0]]cCst|}t|}t|tr||kr|}ntt|}t|tjrY|}|j}|dkr3|j |dnd}d dd|D}| d}t |}t |} t|pPd} t|pVd} nd}} } } d} } |||| | | | | fS)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] rNcss|]}t|VqdSNstr).0drrQ/var/www/html/stock_analysis/be/venv/lib/python3.10/site-packages/babel/plural.py Dz#extract_operands..0) absint isinstancefloatdecimalDecimalras_tupleexponentdigitsjoinrstriplen)rni dec_tupleexpfraction_digitstrailing no_trailingvwftcerrrextract_operandss&    r6c@speZdZdZdZd ddZd!d d Zed"d dZe d#ddZ e d$ddZ d%ddZ d&ddZ d'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_funcrules-Mapping[str, str] | Iterable[tuple[str, str]]rNonecCst|tr |}t}g|_t|D]/\}}|tvr"td|||vr.td|d||t |j }|rB|j ||fqdS)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 z unknown tag ztag z defined twiceN) rritemssetr8sorted _plural_tags ValueErroradd_Parserastappend)selfr:foundkeyexprrDrrr__init__gs   zPluralRule.__init__rcs6|jdfddtD}dt|jd|dS)N, cs&g|]}|vr|d|qS)z: rrtagr:rr s&z'PluralRule.__repr__..< >)r:r&r@type__name__)rFargsrrNr__repr__}szPluralRule.__repr__:Mapping[str, str] | Iterable[tuple[str, str]] | PluralRulecCst|tr|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 )rr7)clsr:rrrparses zPluralRule.parseMapping[str, str]cstjfdd|jDS)zThe `PluralRule` as a dict of unicode plural rules. >>> rule = PluralRule({'one': 'n is 1'}) >>> rule.rules {'one': 'n is 1'} csi|] \}}||qSrr)rrMrD_compilerr sz$PluralRule.rules..)_UnicodeCompilercompiler8rFrr[rr:szPluralRule.rulesfrozenset[str]cCstdd|jDS)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. css|]}|dVqdS)rNr)rr*rrrrrz"PluralRule.tags..) frozensetr8r`rrrtagsszPluralRule.tagslist[tuple[str, Any]]cCs|jSrr8r`rrr __getstate__zPluralRule.__getstate__r8cCs ||_dSrre)rFr8rrr __setstate__ zPluralRule.__setstate__r)rcCst|ds t||_||S)Nr9)hasattr to_pythonr9)rFr)rrr__call__s   zPluralRule.__call__N)r:r;rr<)rr)r:rWrr7)rrZ)rra)rrd)r8rdrr<)r)rrr)rT __module__ __qualname____doc__ __slots__rJrV classmethodrYpropertyr:rcrfrhrlrrrrr7Ps       r7rulerWrcCsVtj}dg}t|jD]\}}|||d|dq |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%r; })r)_JavaScriptCompilerr_r7rYr8rE _fallback_tagr&)rsto_jsresultrMrDrrr to_javascripts  rz(Callable[[float | decimal.Decimal], str]cCsttttd}tj}ddg}t|jD]\}}| d||dt |q| 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 )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_r7rYr8rErrwr&eval)rs namespaceto_python_funcryrMrDcoderrrrks  rkcst|}|jthBtj}fddtDj}dtdg}|j D]\}}| ||d||dq%| |tdd |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|]}|vr|qSrrrL used_tagsrrrOzto_gettext..z nplurals=z ; plural=(rtruz);r) r7rYrcrw_GettextCompilerr_r@indexr(r8rEr&)rsr\ _get_indexryrMrDrrr to_gettexts   rnum range_list+Iterable[Iterable[float | decimal.Decimal]]boolcCs|t|ko t||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 )rrrrrrrrrcstfdd|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|knVqdSrr)rmin_max_rrrr(s*z$within_range_list..)anyrrrrrrrar bcCs@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)rrreverservrrrr+s rc@seZdZdZdS) RuleErrorzRaised if a rule is malformed.N)rTrmrnrorrrrrBsr>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]]]_RULESslist[tuple[str, str]]cCs|dd}g}d}t|}||krBtD]\}}|||}|dur4|}|r2|||fn qtd||||ks|dddS)N@rz3malformed CLDR pluralization rule. Got unexpected r)splitr(rmatchendrEgroupr)rryposrtokrsrrrr tokenize_ruleZs    rtokenstype_ str | Nonelist[tuple[str, str]] | boolcCs,|o|dd|ko|dup|dd|kS)Nrrrrrrrrrrtest_next_tokenlsrcCst|||r |SdSr)rpoprrrr skip_tokenus rr#tuple[Literal['value'], tuple[int]]cC d|ffS)Nrr)rrrr value_nodezrirnametuple[str, tuple[()]]cCs|dfS)Nrr)rrrr ident_node~srItuple[Literal['range_list'], Iterable[Iterable[float | decimal.Decimal]]]cCsd|fS)Nrr)rrrrrange_list_nodesrrtuple[Any, ...]-tuple[Literal['not'], tuple[tuple[Any, ...]]]cCr)Nnotr)rrrrnegaterirc@sbeZdZdZddZdddZddZd d Zd d Zd dZ ddZ ddZ ddZ ddZ dS)rCuInternal 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`. cCsFt||_|js d|_dS||_|jr!td|jdddS)NzExpected end of rule, got rr)rrrD conditionr)rFstringrrrrJs  z_Parser.__init__NcCsjt|j||}|dur |S|durt|dur|p|}|js&td|dtd|d|jdd)Nz expected z but end of rule reachedz but got rr)rrreprr)rFrrtermtokenrrrexpectsz_Parser.expectcC8|}t|jddrd||ff}t|jdds |S)Nror) and_conditionrrrFoprrrr z_Parser.conditioncCr)Nrand)relationrrrrrrrrz_Parser.and_conditioncCs|}t|jddrt|jddrdpd||ffSt|jdd}d}t|jddr/d}nt|jddsA|r.rrrrr_binary_compiler rcr)rcs||Srr)rFxrrrr sz!_unary_compiler..rrrrr_unary_compiler rrcCdS)Nrrrrrrrrc@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)Ncompile_)getattr)rFargrrUrrrr_sz_Compiler.compilecCr)Nr)rrrrrrrz_Compiler.cCr)Nr*rrrrrrrcCr)Nr0rrrrrrrcCr)Nr1rrrrrrrcCr)Nr2rrrrrr rcCr)Nr3rrrrrr!rcCr)Nr4rrrrrr"rcCr)Nr5rrrrrr#rcCst|Srr)rr0rrrr$sz (%s && %s)z (%s || %s)z(!%s)z (%s %% %s)z (%s == %s)z (%s != %s)cCstr)NotImplementedError)rFrrIrrrrcompile_relation,rgz_Compiler.compile_relationN)rTrmrnror_ 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_isnotrrrrrrs& rc@s8eZdZdZedZedZedZedZ ddZ dS) rz!Compiles an expression to Python.z (%s and %s)z (%s or %s)z(not %s)z MOD(%s, %s)cs<dfdd|dD}|d|d|dS)Nrcs.g|]\}}d|d|dqS)(rK)r)rrrr`rrrO9s.z4_PythonCompiler.compile_relation..rrz, [z]))r&upperr_)rFrrIrrangesrr`rr8s z _PythonCompiler.compile_relationN) rTrmrnrorrrrrrrrrrrr0s rc@s.eZdZdZejZeZeZ eZ eZ ddZ dS)rz)Compile into a gettext plural expression.c Csg}||}|dD]6}|d|dkr'|d|d||ddq t|j|\}}|d|d|d|d|d q dd |dS) Nrrrz == rz >=  && z <= z || )r_rEmapr&)rFrrIrritemminmaxrrrrFs  $&z!_GettextCompiler.compile_relationN) rTrmrnrorrr compile_zerorrrrrrrrrr=s rc@s0eZdZdZddZeZeZeZeZ ddZ dS)rvz/Compiles the expression to plain of JavaScript.cCr)NzparseInt(n, 10)rrrrrrWrz_JavaScriptCompiler.cCs>t||||}|dkr||}d|d|d|d}|S)Nrz (parseInt(z , 10) == rr)rrr_)rFrrIrrrrrr]s z$_JavaScriptCompiler.compile_relationN) rTrmrnrorr rrrrrrrrrrvRs rvc@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)NrrT)r)rFrrrrrssz_UnicodeCompiler.compile_notFc Csg}|dD])}|d|dkr|||dq|||dd||dq|||r9dndd|dd|S)Nrrz..z notrrQr)rEr_r&)rFrrIrrrr rrrrvs  *,z!_UnicodeCompiler.compile_relationN)F) rTrmrnrorrrrrrrrrrrrr^fsr^)rrrr)rsrWrr)rsrWrr{)rrrrrr)rr rr rr )rrrrr)rrrrrrrr)rrrrrr)rrrr)rrrr)rrrr)rrrr).ro __future__rr!recollections.abcrrtypingrrrr@rwr6r7rzrkrrrr Exceptionrrr_UNICODEr&r__annotations__rrrrrrrrCrrr rrrrvr^rrrrsR  ; ]  (           z