iZ UdZddlmZddlZddlZddlmZmZddlm Z m Z m Z dZ dZ d7dZGd d Zd8d Z d9d Zd8d Z d:dZ d:dZd;dZGddeZhdZdej2dej4fdej2ddj7edfdej2dfdej2dfdej2dej4fgZded <dd"Zd=d?d#Z d@d$Z!dAd%Z" dBd&Z#dCd'Z$Gd(d)Z%d*Z&d+Z'd,Z(Gd-d.Z)Gd/d0e)Z*Gd1d2e)Z+Gd3d4e+Z,Gd5d6e)Z-y)Dz babel.numbers ~~~~~~~~~~~~~ CLDR Plural support. See UTS #35. :copyright: (c) 2013-2026 by the Babel Team. :license: BSD, see LICENSE for more details. ) annotationsN)IterableMapping)AnyCallableLiteral)zeroonetwofewmanyotherrct|}t|}t|tr&||k(r|}nt j t |}t|tj r|j}|j}|dkr|j|dnd}djd|D}|jd}t|}t|} t|xsd} t|xsd} ndx}x} x} } dx} } |||| | | | | 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] rNc32K|]}t|ywNstr).0ds M/var/www/html/strategist-ai/venv/lib/python3.12/site-packages/babel/plural.py z#extract_operands..Gs;a3q6;s0) absint isinstancefloatdecimalDecimalras_tupleexponentdigitsjoinrstriplen)sourceni dec_tupleexpfraction_digitstrailing no_trailingvwftces rextract_operandsr5s6 F A AA!U 6AA'A!W__%JJL   47!G)**34077;?;;ooc* M    A    q !AA IA aAq!Q !!czeZdZdZdZd dZd dZe ddZe ddZ e ddZ ddZ dd Z dd Zy ) 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_funccjt|tr|j}t}g|_t |D]t\}}|t vrtd|||vrtd|d|j|t|j}|sX|jj||fvy)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) rritemssetr9sorted _plural_tags ValueErroradd_Parserastappend)selfrulesfoundkeyexprrCs r__init__zPluralRule.__init__js eW %KKME/1  1IC,& <w!788 4wn!=>> IIcN$-##C $$c3Z0 1r6c|jdjfdtD}dt|jd|dS)N, c3<K|]}|vs|d|yw)z: Nr)rtagrFs rrz&PluralRule.__repr__..s'XC3RW)rFr$r?type__name__)rEargsrFs @r__repr__zPluralRule.__repr__s@ yyX<XX4:&&'q22r6c6t|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 )rr8)clsrFs rparsezPluralRule.parses eZ (L5zr6ctj}|jDcic]\}}|||c}}Scc}}w)zThe `PluralRule` as a dict of unicode plural rules. >>> rule = PluralRule({'one': 'n is 1'}) >>> rule.rules {'one': 'n is 1'} )_UnicodeCompilercompiler9)rE_compilerNrCs rrFzPluralRule.ruless7$%--37==AxsCXc]"AAAs;c:td|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. c3&K|] }|d yw)rNr)rr)s rrz"PluralRule.tags..s5!15s) frozensetr9rEs rtagszPluralRule.tagss 5t}}555r6c|jSrr9r`s r __getstate__zPluralRule.__getstate__s }}r6c||_yrrc)rEr9s r __setstate__zPluralRule.__setstate__s   r6c\t|dst||_|j|S)Nr:)hasattr to_pythonr:)rEr(s r__call__zPluralRule.__call__s%tW%"4DJzz!}r6N)rFz-Mapping[str, str] | Iterable[tuple[str, str]]returnNone)rkr)rF:Mapping[str, str] | Iterable[tuple[str, str]] | PluralRulerkr8)rkzMapping[str, str])rkzfrozenset[str])rklist[tuple[str, Any]])r9rnrkrl)r(float | decimal.Decimalrkr)rS __module__ __qualname____doc__ __slots__rJrU classmethodrXpropertyrFrardrfrjrr6rr8r8Ssw(&I1,3  I    BB66!r6r8c tj}dg}tj|jD]"\}}|j ||d|d$|j dt zdj|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[r8rXr9rD _fallback_tagr$)ruleto_jsresultrNrCs r to_javascriptr~sz ! ) )E& 'F$$T*334S s Cwc234 MM(]*+ 776?r6c ttttd}t j }ddg}t j|jD]+\}}|jd||dt|-|jdtt dj|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 )INWITHINMODr5zdef 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_modulor5_PythonCompilerr[r8rXr9rDrrzr$eval)r{ namespaceto_python_funcr}rNrCcodes rriris,#, I %&..N7F$$T*33KS  nS12*SXLIJK MMH]-./ 499V$h 7Dy Z  r6ctj|}|jthz}t j }t Dcgc] }||vs| c}j}dt|dg}|jD](\}}|j||d||d*|j|tddj|Scc}w)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 z nplurals=z ; plural=(rwrxz);r) r8rXrarz_GettextCompilerr[r?indexr&r9rDr$)r{ used_tagsr\rN _get_indexr}rCs r to_gettextrs   D !D ]O+I!))H!-B# 1A#BHHJ#i.)4 5FMMAS #s:c?*;3?@A MMZ ./r23 776? Cs  CCc:|t|k(xr 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 )rrnum range_lists rrr s( #c(? A0jAAr6c,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 c3DK|]\}}|cxkxr|kncywrr)rmin_max_rs rrz$within_range_list..6s"@ztTts"d""@s )anyrs` rrr"s( @Z@ @@r6cNd}|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 rrr9sHG1u R1u R QB b Ir6ceZdZdZy) RuleErrorzRaised if a rule is malformed.N)rSrprqrrrr6rrrPs(r6r>r3r4r1r)r(r2r/r0z\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]]]_RULESc>|jdd}g}d}t|}||krntD]N\}}|j||}||j }|r!|j ||j fntd||||krn|dddS)N@rz3malformed CLDR pluralization rule. Got unexpected r)splitr&rmatchendrDgroupr)sr}posrtokr{rs r tokenize_rulerhs  QA$&F C a&C ) ^ICJJq#&E iikMM3 "67  ^QRSTWRXQ[\] ] ) $B$<r6cF|xr|dd|k(xr|duxs |dd|k(S)Nrrrrtokenstype_rs rtest_next_tokenrzs8  ZfRjmu, Z%4-2Y6":a=TYCYZr6c>t|||r|jSyr)rpoprs r skip_tokenrsvue,zz|-r6c d|ffS)Nrr)rs r value_noders UH r6c |dfS)Nrr)names r ident_noders 8Or6c d|fS)Nrr)rs rrange_list_noders  ##r6c d|ffS)Nnotr)rs rnegaters 2%<r6cNeZdZdZdZd dZdZdZdZdZ d Z d Z d Z d Z y)rBuInternal 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`. ct||_|jsd|_y|j|_|jrt d|jddy)NzExpected end of rule, got rr)rrrC conditionr)rEstrings rrJz_Parser.__init__s\#F+ {{DH >># ;;8R9K8NOP P r6Nct|j||}||S|t|duxr|xs|}|jstd|dtd|d|jdd)Nz expected z but end of rule reachedz but got rr)rrreprr)rErrtermtokens rexpectz_Parser.expects~4;;u5  L < /%859D{{iv-EFG G)D64;;r?13E2HIJJr6c|j}t|jddr,d||jff}t|jddr,|S)Nror) and_conditionrrrEops rrz_Parser.conditionsO    !fd3D..011Bfd3 r6c|j}t|jddr,d||jff}t|jddr,|S)Nrand)relationrrrs rrz_Parser.and_conditionsI ]]_fe4T]]_--Bfe4 r6c|j}t|jddr/t|jddrdnd}|||jffSt|jdd}d}t|jddrd}n5t|jdds|r t d|j |Sd|||j ff}|r t|S|S) Nrisrisnotinwithinz#Cannot negate operator based rules.r)rIrrrrnewfangled_relationrr)rEleftrnegatedmethodrs rrz_Parser.relationsyy{ dkk64 0&t{{FEBBdjjl++ +T[[&%8 dkk68 4Fdkk648#$IJJ//55 &$(9: :$vbz,",r6ct|jddrd}n%t|jddrd}n tddd||jff}|r t |S|S) Nr=Fz!=Tz'Expected "=" or "!=" or legacy relationrr)rrrrr)rErrrs rrz_Parser.newfangled_relationsa dkk8S 1G  Xt 4GEF F $doo&78 8$vbz,",r6cz|j}t|jdr||jfS||fS)Nr)rrr)rErs rrange_or_valuez_Parser.range_or_values6zz| dkk: .% %: r6c|jg}t|jddr7|j|jt|jddr7t |S)Nr,)rrrrDr)rErs rrz_Parser.range_listsW))+, h4   d113 4h4z**r6c2t|jd}| |dtvr td|d}t|jddrd|df|j ffSt|jddrd|df|j ffSt |S)NrrzExpected identifier variablemodrr%)rr_VARSrrr)rErrs rrIz _Parser.exprs$++v. <47%/:; ;Aw dkk65 1D":tzz|44 4  Xs 3D":tzz|44 4$r6cNtt|jddS)Nrr)rrrr`s rrz _Parser.values #dkk'215677r6)NN)rSrprqrrrJrrrrrrrrIrrr6rrBrBs<B QK  -"-+  8r6rBcfdS)%Compiler factory for the `_Compiler`.cN|j||j|fzSrr[)rErrighttmpls rz"_binary_compiler..s#TT\\$-?eAT,U%Ur6rrs`r_binary_compilerrs UUr6cfdS)rc,|j|zSrr)rExrs rrz!_unary_compiler..s4$,,q/1r6rrs`r_unary_compilerrs 11r6cy)Nrrrs rrrr6ceZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z ed Zed ZedZedZedZedZdZy) _CompilerzZThe compilers are able to transform the expressions into multiple output formats. c0|\}}t|d||S)Ncompile_)getattr)rEargrrTs rr[z_Compiler.compile%s%D-wtxt_-t44r6cy)Nr(rrs rrz_Compiler.)rr6cy)Nr)rrs rrz_Compiler.*rr6cy)Nr/rrs rrz_Compiler.+rr6cy)Nr0rrs rrz_Compiler.,rr6cy)Nr1rrs rrz_Compiler.-rr6cy)Nr2rrs rrz_Compiler..rr6cy)Nr3rrs rrz_Compiler./rr6cy)Nr4rrs rrz_Compiler.0rr6ct|Srr)rr/s rrz_Compiler.1s Qr6z (%s && %s)z (%s || %s)z(!%s)z (%s %% %s)z (%s == %s)z (%s != %s)ctr)NotImplementedError)rErrIrs rcompile_relationz_Compiler.compile_relation9s !##r6N)rSrprqrrr[ 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 rr6rrr s|5IIIIIIII'M"<0K!,/J!'*K"<0K!,/J$\2M$r6rcVeZdZdZedZedZedZedZ dZ y)rz!Compiles an expression to Python.z (%s and %s)z (%s or %s)z(not %s)z MOD(%s, %s)cdjfd|dD}|jdj|d|dS)Nrc3rK|].\}}dj|dj|d0yw)(rL)Nr)rrrrEs rrz3_PythonCompiler.compile_relation..Fs; :@1aa Q 4<<?"31 5 s47rr z, [z]))r$upperr[)rErrIrrangess` rr z _PythonCompiler.compile_relationEsN DNqM  ,,.!4<<#5"6c&DDr6N) rSrprqrrrrrrrrr rr6rrr=s3+"=1K!,/J!*-K"=1KEr6rc>eZdZdZej ZeZeZ eZ eZ dZ y)rz)Compile into a gettext plural expression.c ^g}|j|}|dD]~}|d|dk(r+|jd|d|j|dd9|j|d}|j|d}|jd|d|d|d|d dd j|dS) Nrrr z == r!z >=  && z <= z || )r[rDr$)rErrIrritemminmaxs rr z!_GettextCompiler.compile_relationUs ||D!qM CDAw$q'! AdV4 T!W(='>a@All47+ll47+ AdV4uDd3%qAB  C6;;r?#1%%r6N) rSrprqrrrrr compile_zerorrrrr rr6rrrLs)3##IIIII &r6rc,eZdZdZdZeZeZeZeZ dZ y)ryz/Compiles the expression to plain of JavaScript.cy)NzparseInt(n, 10)rrs rrz_JavaScriptCompiler.grr6cztj||||}|dk(r|j|}d|d|d|d}|S)Nrz (parseInt(z , 10) == r&r!)rr r[)rErrIrrs rr z$_JavaScriptCompiler.compile_relationmsL00vtZP T><<%DvYtfDa@D r6N) rSrprqrrrr*rrrrr rr6rryrybs%9,IIIIIr6rycneZdZdZedZedZedZedZedZ dZ d dZ y ) rZz+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 )rErs rrz_UnicodeCompiler.compile_nots$t$$hqk@4@@r6c Hg}|dD]k}|d|dk(r$|j|j|d2|j|j|dd|j|dm|j||rdndd|ddj|S)Nrrz..z notrrPr)rDr[r$)rErrIrrr#r's rr z!_UnicodeCompiler.compile_relationsqM SDAw$q'! dll4734 d1g!6 7r$,,tAw:O9PQR  S ,,t$%fR%@&388TZK[J\]]r6N)F) rSrprqrrrrrrrrrr rr6rrZrZusE5 "*-J$^4M";/K!*-J";/KA^r6rZ)r'rorkzMtuple[decimal.Decimal | int, int, int, int, int, int, Literal[0], Literal[0]])r{rmrkr)r{rmrkz(Callable[[float | decimal.Decimal], str])rror+Iterable[Iterable[float | decimal.Decimal]]rkbool)rrrrrkr)rrrklist[tuple[str, str]]r)rr3rrr str | Nonerkzlist[tuple[str, str]] | bool)rr3rrrr4)rrrkz#tuple[Literal['value'], tuple[int]])rrrkztuple[str, tuple[()]])rr1rkzItuple[Literal['range_list'], Iterable[Iterable[float | decimal.Decimal]]])rztuple[Any, ...]rkz-tuple[Literal['not'], tuple[tuple[Any, ...]]]).rr __future__rrrecollections.abcrrtypingrrrr?rzr5r8r~rirrrr Exceptionrrr[UNICODEr$r__annotations__rrrrrrrrBrrr*rrrryrZrr6rr<s# -))=  :" #:"R:"z]]@.'! D'!-'!T.B B;B B.A A;A A..) )  :2::fbjj )* ZRZZ=bggen=MTR ST jbjj ! zrzz+&'-rzz:; 40*[ ![ [ [" [ $;$N$ w8w8tV 2  $$: Ei E&y&,*&^y^r6