⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.144
Server IP:
157.245.143.252
Server:
Linux www 6.11.0-9-generic #9-Ubuntu SMP PREEMPT_DYNAMIC Mon Oct 14 13:19:59 UTC 2024 x86_64
Server Software:
nginx/1.26.0
PHP Version:
8.3.11
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
usr
/
lib
/
python3
/
dist-packages
/
babel
/
__pycache__
/
View File Name :
plural.cpython-312.pyc
]xeZ U d Z ddlmZ ddlZddlZddlmZmZ ddlm Z m Z m Z e rddl m Z dZdZd8d Z G d d Zd9d Zd:d Zd9dZd;dZd;dZd<dZ G d de Zh dZd ej6 dej8 fd ej6 ddj; e d fd ej6 d fd ej6 d fd ej6 d ej8 fgZ d e d!< d=d"Z d> d?d#Z!d>d@d$Z"dAd%Z#dBd&Z$ dCd'Z%dDd(Z& G d) d* Z'd+ Z(d, Z)d- Z* G d. d/ Z+ G d0 d1e+ Z, G d2 d3e+ Z- G d4 d5e- Z. G d6 d7e+ Z/y)Ez babel.numbers ~~~~~~~~~~~~~ CLDR Plural support. See UTS #35. :copyright: (c) 2013-2023 by the Babel Team. :license: BSD, see LICENSE for more details. ) annotationsN)IterableMapping) TYPE_CHECKINGAnyCallable)Literal)zeroonetwofewmanyotherr c t | }t | }t |t r&||k( r|}n t j t | }t |t j r|j }|j }|dk r|j |d nd}dj d |D }|j d }t | }t | } t |xs d } t |xs d } ndx}x} x} } dx} } |||| | | | | fS )u Extract 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] r N c 3 2 K | ] }t | y wNstr).0ds ./usr/lib/python3/dist-packages/babel/plural.py <genexpr>z#extract_operands.<locals>.<genexpr>G s ;?a3q6?s 0) absint isinstancefloatdecimalDecimalr as_tupleexponentdigitsjoinrstriplen)sourceni dec_tupleexpfraction_digitstrailing no_trailingvwftces r extract_operandsr6 s 2 F A AA!U 6A A'A!W__%JJL 47!G)**34077;?;; ooc* M A q !AA IA aAq!Q !! c r e Zd ZdZdZd dZd dZedd Ze dd Z e dd Z ddZ dd Z dd Zy ) PluralRuleaf Represents 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_funcc j t |t r|j }t }g | _ t | D ]t \ }}|t vrt d| ||v rt d|d |j | t | j }|sX| j j ||f v y)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) r r itemssetr: sorted _plural_tags ValueErroradd_Parserastappend)selfrulesfoundkeyexprrD s r __init__zPluralRule.__init__j s eW %KKME/1 IC,& <w!788 4wn!=>> IIcN$-##C $$c3Z0 'r7 c | j }dj t D cg c] }||v s| d|| c} }dt | j d|dS c c}w )N, z: < >)rG r% r@ type__name__)rF rG tagargss r __repr__zPluralRule.__repr__ sd yyLYLSCSXLSEE#J<0LYZ4:&&'q22 Zs A Ac 6 t |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 r9 )clsrG s r parsezPluralRule.parse s eZ (L5zr7 c t j }| j D ci c] \ }}| || c}}S c c}}w )zThe `PluralRule` as a dict of unicode plural rules. >>> rule = PluralRule({'one': 'n is 1'}) >>> rule.rules {'one': 'n is 1'} )_UnicodeCompilercompiler: )rF _compilerS rD s r rG zPluralRule.rules s; $%--37==A=xsCXc]"=AAAs ;c : t d | j D S )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. c 3 & K | ] }|d yw)r Nr )r r* s r r z"PluralRule.tags.<locals>.<genexpr> s 5}!1}s ) frozensetr: rF s r tagszPluralRule.tags s 5t}}555r7 c | j S r r: r` s r __getstate__zPluralRule.__getstate__ s }} r7 c || _ y r rc )rF r: s r __setstate__zPluralRule.__setstate__ s r7 c \ t | d st | | _ | j | S )Nr; )hasattr to_pythonr; )rF r) s r __call__zPluralRule.__call__ s% tW%"4 DJzz!} r7 N)rG z-Mapping[str, str] | Iterable[tuple[str, str]]returnNone)rk r )rG :Mapping[str, str] | Iterable[tuple[str, str]] | PluralRulerk r9 )rk zMapping[str, str])rk zfrozenset[str])rk list[tuple[str, Any]])r: rn rk rl )r) float | decimal.Decimalrk r )rR __module__ __qualname____doc__ __slots__rK rU classmethodrX propertyrG ra rd rf rj r r7 r r9 r9 S se ( &I1,3 B B 6 6 ! r7 r9 c t j }dg}t j | j D ]" \ }}|j || d|d $ |j dt z dj | S )a Convert 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[ r9 rX r: rE _fallback_tagr% )ruleto_jsresultrS rD s r to_javascriptr~ su ! ) )E& 'F $$T*33S s Cwc23 4 MM(]*+ 776?r7 c t t t t d}t j }ddg}t j | j D ]+ \ }}|j d || dt | - |j dt t 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 )INWITHINMODr6 zdef evaluate(n):z- n, i, v, w, f, t, c, e = extract_operands(n)z if (z ): return z return z<rule>execevaluate) in_range_listwithin_range_list cldr_modulor6 _PythonCompilerr[ r9 rX r: rE r rz r% eval)r{ namespaceto_python_funcr} rS rD codes r ri ri s ( # , I %&..N7F $$T*33S nS 1 2*SXLIJ 4 MMH] -./ 499V$h 7Dy Z r7 c t j | } | j t hz }t j }t D cg c] }||v s| c}j }dt | dg}| j D ]( \ }}|j || d || d * |j |t d dj | S c c}w )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 z nplurals=z ; plural=(rw rx z);r ) r9 rX ra rz _GettextCompilerr[ r@ indexr' r: rE r% )r{ used_tagsr\ rS _get_indexr} rD s r to_gettextr s D !D ]O+I !))H!-B # 1A# BHHJ#i.)4 5FMMS # s:c?*;3?@ " MMZ ./r23 776? Cs CCc : | t | k( xr t | | S )a Integer 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 r num range_lists r r r s " #c(? A 0j AAr7 c , t fd|D S )a Float 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 c 3 < K | ] \ }}|k\ xr |k y wr r )r min_max_r s r r z$within_range_list.<locals>.<genexpr>+ s& HZztTsd{*sd{*Zs )anyr s ` r r r s " HZH HHr7 c N d}| dk r| dz } d}|dk r|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 r r )abreverservs r r r . sH G1u R1u R QB b Ir7 c e Zd ZdZy) RuleErrorz Raised if a rule is malformed.N)rR rp rq rr r r7 r r r E s (r7 r > r4 r5 r2 r* r) r3 r0 r1 z\s+wordz"\b(and|or|is|(?:with)?in|not|mod|[r z])\bvaluez\d+symbolz%|,|!=|=ellipsisz\.{2,3}|\u2026z(list[tuple[str | None, re.Pattern[str]]]_RULESc > | j d d } g }d}t | }||k rnt D ]N \ }}|j | | }||j }|r!|j ||j f n t d| | z ||k rn|d d d S )N@r z5malformed CLDR pluralization rule. Got unexpected %rr )splitr' r matchendrE groupr )sr} posr tokr{ r s r tokenize_ruler ] s QA$&F C a&C ) ICJJq#&E iikMM3 "67 023C& 9 : : ) $B$<r7 c F | xr | d d |k( xr |d u xs | d d |k( S )Nr r r r tokenstype_r s r test_next_tokenr p s> 2fRjmu, 2 $ 0&*Q-502r7 c > t | || r| j S y r )r popr s r skip_tokenr y s vue,zz| -r7 c d| ffS )Nr r )r s r value_noder ~ s UI r7 c | dfS )Nr r )names r ident_noder s 8Or7 c d| fS )Nr r )r s r range_list_noder s ##r7 c d| ffS )Nnotr )r s r negater s 2%<r7 c N e Zd ZdZd Zd dZd Zd Zd Zd Z d Z d Z d Z d Z y)rC u Internal 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`. c t | | _ | j sd | _ y | j | _ | j r t d| j d d y )NzExpected end of rule, got r r )r r rD conditionr )rF strings r rK z_Parser.__init__ s\ #F+ {{ DH >># ;; 8R 9K8N OP P r7 Nc t | j || }||S |t |d u xr |xs | }| j st d| d t d| d| j d d )Nz expected z but end of rule reachedz but got r r )r r reprr )rF r r termtokens r expectz_Parser.expect s~ 4;;u5 L < /%859D{{iv-E FG G)D64;;r?13E2HIJJr7 c | j }t | j dd r,d|| j ff}t | j dd r,|S )Nr or) and_conditionr r rF ops r r z_Parser.condition sO !fd3D . . 011B fd3 r7 c | j }t | j dd r,d|| j ff}t | j dd r,|S )Nr and)relationr r r s r r z_Parser.and_condition sI ]]_fe4T]]_--B fe4 r7 c | j }t | j dd r1t | j dd xr dxs d|| j ffS t | j dd }d}t | j dd rd}n5t | j dd s |r t d | j | S d||| j ff}|r t | S |S ) Nr isr isnotinwithinz#Cannot negate operator based rules.r )rJ r r r r newfangled_relationr r )rF leftnegatedmethodr s r r z_Parser.relation s yy{ dkk64 0 dkk659EgMtzz|$% % T[[&%8 dkk68 4 F dkk648#$IJJ//55 &$(9: : $vbz,",r7 c t | j dd rd}n%t | j dd rd}n t d dd|| j ff}|r t | S |S ) Nr =Fz!=Tz'Expected "=" or "!=" or legacy relationr r )r r r r r )rF r r r s r r z_Parser.newfangled_relation sa dkk8S 1G Xt 4G EF F $doo&78 8 $vbz,",r7 c z | j }t | j d r|| j fS ||fS )Nr )r r r )rF r s r range_or_valuez_Parser.range_or_value s6 zz| dkk: . % %: r7 c | j g}t | j dd r7|j | j t | j dd r7t | S )Nr ,)r r r rE r )rF r s r r z_Parser.range_list sW ))+, h4 d 1 1 3 4 h4 z**r7 c 2 t | j d }| |d t vr t d |d }t | j dd rd|df| j ffS t | j dd rd|df| j ffS t | S )Nr r z Expected identifier variablemodr r %)r r _VARSr r r )rF r r s r rJ z _Parser.expr s $++v. <47%/ :; ;Aw dkk65 1D":tzz|44 4 Xs 3D":tzz|44 4$ r7 c N t t | j d d S )Nr r )r r r r` s r r z _Parser.value s #dkk' 21 5677r7 )NN)rR rp rq rr rK r r r r r r r rJ r r r7 r rC rC s< B QK -"- + 8r7 rC c fdS )%Compiler factory for the `_Compiler`.c N | j | | j | fz S r r[ )rF r righttmpls r <lambda>z"_binary_compiler.<locals>.<lambda> s! TT\\$-? eAT,U%Ur7 r r s `r _binary_compilerr s UUr7 c fdS )r c , | j | z S r r )rF xr s r r z!_unary_compiler.<locals>.<lambda> s 4$,,q/1r7 r r s `r _unary_compilerr s 11r7 c y)Nr r r s r r r s r7 c e Zd ZdZd Zd Zd Zd Zd Zd Z d Z d Z d Z d Z ed Z ed Z ed Z ed Z ed Z ed Zd Zy) _CompilerzZThe compilers are able to transform the expressions into multiple output formats. c 0 |\ }} t | d| | S )Ncompile_)getattr)rF argr rT s r r[ z_Compiler.compile s% D-wtxt_-t44r7 c y)Nr) r r s r r z_Compiler.<lambda> #r7 c y)Nr* r r s r r z_Compiler.<lambda>! r r7 c y)Nr0 r r s r r z_Compiler.<lambda>" r r7 c y)Nr1 r r s r r z_Compiler.<lambda># r r7 c y)Nr2 r r s r r z_Compiler.<lambda>$ r r7 c y)Nr3 r r s r r z_Compiler.<lambda>% r r7 c y)Nr4 r r s r r z_Compiler.<lambda>& r r7 c y)Nr5 r r s r r z_Compiler.<lambda>' r r7 c t | S r r )r r0 s r r z_Compiler.<lambda>( s Qr7 z (%s && %s)z (%s || %s)z(!%s)z (%s %% %s)z (%s == %s)z (%s != %s)c t r )NotImplementedError)rF r rJ r s r compile_relationz_Compiler.compile_relation0 s !##r7 N)rR rp rq rr r[ 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 r r7 r r r s| 5 I I I I I I I I'M"<0K!,/J!'*K"<0K!,/J$\2M$r7 r c V e Zd ZdZ ed Z ed Z ed Z ed Z d Z y)r z!Compiles an expression to Python.z (%s and %s)z (%s or %s)z(not %s)z MOD(%s, %s)c dj |d D cg c], \ }}d| j | d| j | d. c}} }|j d| j | d| dS c c}}w )Nr r (rM )z, [z]))r% r[ upper)rF r rJ r r r rangess r r z _PythonCompiler.compile_relation< s} S]^_S`aS`!QQt||A /r$,,q/1B!DS`ab,,.!4<<#5"6c&DD bs 1A5 N) rR rp rq rr r r r r r r r r r7 r r r 4 s3 +"=1K!,/J!*-K"=1KEr7 r c > e Zd ZdZej ZeZeZ eZ eZ d Z y)r z)Compile into a gettext plural expression.c @ g }| j | }|d D ]o }|d |d k( r+|j d| d| j |d d 9t | j | \ }}|j d| d| d| d| d q dd j | dS ) Nr r r z == r z >= && z <= z || )r[ rE mapr% )rF r rJ r r itemminmaxs r r z!_GettextCompiler.compile_relationJ s ||D! qMDAw$q'! AdV4 T!W(='>a@A t||T2S AdV4uDd3%qAB " 6;;r?#1%%r7 N) rR rp rq rr r r r compile_zeror r r r r r r7 r r r A s) 3##I I I I I &r7 r c , e Zd ZdZd ZeZeZeZeZ d Z y)ry z/Compiles the expression to plain of JavaScript.c y)NzparseInt(n, 10)r r s r r z _JavaScriptCompiler.<lambda>[ s +r7 c z t j | ||| }|dk( r | j | }d| d| d| d}|S )Nr z (parseInt(z , 10) == r% r )r r r[ )rF r rJ r r s r r z$_JavaScriptCompiler.compile_relationa sO 00 &$ , T><<%D vYtfDa@D r7 N) rR rp rq rr r r* r r r r r r r7 r ry ry V s% 9 ,I I I I Ir7 ry c n e Zd ZdZ ed Z ed Z ed Z ed Z ed Z d Z d dZ y ) rZ z+Returns a unicode pluralization rule again.z%s is %sz %s is not %sz %s and %sz%s or %sz %s mod %sc , | j |d ddiS )Nr r T)r )rF r s r r z _UnicodeCompiler.compile_notw s $t$$hqk@4@@r7 c H g }|d D ]k }|d |d k( r$|j | j |d 2|j | j |d d| j |d m | j | |rdnd d| ddj | S )Nr r z..z notr rO r )rE r[ r% )rF r rJ r r r" r' s r r z!_UnicodeCompiler.compile_relationz s qMDAw$q'! dll47 34 d1g!6 7r$,,tAw:O9P QR " ,,t$%fR%@&388TZK[J\]]r7 N)F) rR rp rq rr r r r r r r r r r r7 r rZ rZ j sE 5 "*-J$^4M";/K!*-J";/KA^r7 rZ )r( ro rk zMtuple[decimal.Decimal | int, int, int, int, int, int, Literal[0], Literal[0]])r{ rm rk r )r{ rm rk z(Callable[[float | decimal.Decimal], str])r ro r +Iterable[Iterable[float | decimal.Decimal]]rk bool)r r r r rk r )r r rk list[tuple[str, str]]r )r r3 r r r str | Nonerk z list[tuple[str, str]] | bool)r r3 r r r r4 )r r rk z#tuple[Literal['value'], tuple[int]])r r rk ztuple[str, tuple[()]])r r1 rk zItuple[Literal['range_list'], Iterable[Iterable[float | decimal.Decimal]]])r ztuple[Any, ...]rk z-tuple[Literal['not'], tuple[tuple[Any, ...]]])0rr __future__r r recollections.abcr r typingr r r typing_extensionsr r@ rz r6 r9 r~ ri r r r r Exceptionr r r[ UNICODEr% r __annotations__r r r r r r r rC r r r* r r r ry rZ r r7 r <module>r= s # - / /)= 8"vZ Z z.%!P.B(I(.) ) :2::fbjj )* ZRZZ=bggen=MTR ST jbjj ! zrzz+&' -rzz:; 40 , 2 !2 2 2 " 2 $;$N$ w8 w8tV 2 $ $: Ei E&y &** (^y ^r7