⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.30
Server IP:
45.79.8.107
Server:
Linux localhost 5.15.0-140-generic #150-Ubuntu SMP Sat Apr 12 06:00:09 UTC 2025 x86_64
Server Software:
nginx/1.18.0
PHP Version:
8.1.2-1ubuntu2.21
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
lib
/
python3
/
dist-packages
/
babel
/
__pycache__
/
View File Name :
plural.cpython-310.pyc
o V\BS @ s d Z ddlZddlmZ dZdZdd ZG dd d eZd d Z d d Z dd Z dd Z dd Z dd ZG dd deZdZdedejfdedefd ed fd ed fd ed!ejfgZd"d# ZdBd$d%ZdBd&d'Zd(d) Zd*d+ Zd,d- Zd.d/ Z G d0d1 d1eZ d2d3 Z d4d5 Z d6d7 Z G d8d9 d9eZ!G d:d; d;e!Z"G d<d= d=e!Z#G d>d? d?e#Z$G d@dA dAe!Z%dS )Cz babel.numbers ~~~~~~~~~~~~~ CLDR Plural support. See UTS #35. :copyright: (c) 2013-2019 by the Babel Team. :license: BSD, see LICENSE for more details. N)decimal)ZzeroZoneZtwofewmanyotherr c C s t | }t|}t|tr||kr|}ntt|}t|tjrY| }|j}|dk r3|j |d nd}d dd |D }| d}t |}t |} t|pPd} t|pVd} 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`: https://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] r N c s s | ]}t |V qd S Nstr).0dr r ./usr/lib/python3/dist-packages/babel/plural.py <genexpr>A s z#extract_operands.<locals>.<genexpr>0) absint isinstancefloatr ZDecimalr Zas_tupleZexponentdigitsjoinrstriplen) sourceniZ dec_tupleZexpZfraction_digitsZtrailingZ no_trailingvwftr r r extract_operands s$ r c @ sd e Zd ZdZdZdd Zdd Zedd Ze d d Z e d d d dZ dd Z dd Z dd ZdS ) 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 C s t |tr | }t }g | _tt|D ],\}}|tvr#td| ||v r-td| | | t |j }|rA| j ||f qdS )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 dictitemssetr! sortedlist _plural_tags ValueErroradd_Parserastappend)selfrulesfoundkeyexprr, r r r __init__c s zPluralRule.__init__c s, | j dt| jd fddtD f S )Nz<%s %r>z, c s$ g | ]}| v rd | | f qS )z%s: %sr r tagr/ r r <listcomp>} s z'PluralRule.__repr__.<locals>.<listcomp>)r/ type__name__r r( r. r r6 r __repr__y s zPluralRule.__repr__c C s 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 )clsr/ r r r parse s zPluralRule.parsec s t j t fdd| jD S )zThe `PluralRule` as a dict of unicode plural rules. >>> rule = PluralRule({'one': 'n is 1'}) >>> rule.rules {'one': 'n is 1'} c s g | ] \}}| |fqS r r )r r5 r, _compiler r r7 s z$PluralRule.rules.<locals>.<listcomp>)_UnicodeCompilercompiler# r! r: r r> r r/ s zPluralRule.rulesc C s t dd | jD S )Nc S s g | ]}|d qS )r r )r r r r r r7 z'PluralRule.<lambda>.<locals>.<listcomp>) frozensetr! xr r r <lambda> rB zPluralRule.<lambda>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.)docc C s | j S r r! r: r r r __getstate__ zPluralRule.__getstate__c C s || _ d S r rH )r. r! r r r __setstate__ zPluralRule.__setstate__c C s t | ds t| | _| |S )Nr" )hasattr to_pythonr" )r. r r r r __call__ s zPluralRule.__call__N)r9 __module__ __qualname____doc__ __slots__r3 r; classmethodr= propertyr/ tagsrI rK rO r r r r r L s r c C sR t j}dg}t| jD ]\}}|d|||f q |dt d|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 %s ? %r : z%r; })r )_JavaScriptCompilerrA r r= r! r- _fallback_tagr )ruleZto_jsresultr5 r, r r r to_javascript s r[ c C s t tttd}t j}ddg}t| jD ]\}}| d||t |f 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 )INZWITHINZMODr zdef evaluate(n):z' n, i, v, w, f, t = extract_operands(n)z if (%s): return %rz return %r z<rule>execZevaluate) in_range_listwithin_range_list cldr_modulor _PythonCompilerrA r r= r! r- r rX r eval)rY namespaceZto_python_funcrZ r5 r, coder r r rN s rN c s t | } | jthB t j} fddtD j}dt g}| j D ]\}}| d||||f q#| d|t d |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 c s g | ]}| v r|qS r r r4 Z used_tagsr r r7 z to_gettext.<locals>.<listcomp>znplurals=%d; plural=(z %s ? %d : z%d)r ) r r= rV rX _GettextCompilerrA r( indexr r! r- r )rY r? Z _get_indexrZ r5 r, r rf r to_gettext s rj c C s | t | ko 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_listr r r r_ r_ c s t fdd|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 s$ | ] \}} |ko |kV qd S r r )r Zmin_Zmax_rl r r r $ s " z$within_range_list.<locals>.<genexpr>)anyrk r ro r r` rn r` c C s@ d}| dk r | d9 } d}|dk r|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 r r )abreverservr r r ra ' s ra c @ s e Zd ZdZdS ) RuleErrorz Raised if a rule is malformed.N)r9 rP rQ rR r r r r rw > s rw Znivwftz\s+wordz)\b(and|or|is|(?:with)?in|not|mod|[{0}])\bvaluez\d+symbolz%|,|!=|=ellipsisz\.{2,3}|\u2026c C s | dd } g }d}t| }||k rAtD ] \}}|| |}|d ur4| }|r2||| f n qtd| | ||k s|d d d S )N@r z5malformed CLDR pluralization rule. Got unexpected %rrq )splitr _RULESmatchendr- grouprw )srZ posr tokrY r r r r tokenize_ruleM s$ r c C s, | o| d d |ko|d u p| d d |kS )Nrq r rr r tokenstype_ry r r r test_next_token` s r c C s t | ||r | S d S r )r popr r r r skip_tokene s r c C d| ffS )Nry r )ry r r r value_nodej rL r c C s | dfS )Nr r )namer r r ident_noden r c C s d| fS )Nrm r )rm r r r range_list_noder r r c C r )Nnotr )rv r r r negatev rL r c @ sb e Zd ZdZdd ZdddZdd Zd d Zd d Zd d Z dd Z dd Z dd Z dd Z dS )r+ 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 instanciation into an attribute called `ast`. c C sD t || _| js d | _d S | | _| jr td| jd d d S )Nz Expected end of rule, got %rrq rr )r r r, conditionrw )r. stringr r r r3 s z_Parser.__init__Nc C sb t | j||}|d ur |S |d u rt|d u r|p|}| js$td| td|| jd d f )Nz#expected %s but end of rule reachedzexpected %s but got %rrq rr )r r reprrw )r. r ry Ztermtokenr r r expect s z_Parser.expectc C 8 | }t| jddrd|| ff}t| jdds |S )Nrx or) and_conditionr r r. opr r r r z_Parser.conditionc C r )Nrx and)relationr r r r r r r r z_Parser.and_conditionc C s | }t| jddr t| jddrdpd|| ffS t| jdd}d}t| jddr/d}nt| jddsA|r<td| |S d||| ff}|rPt|S |S ) Nrx isr ZisnotinZwithinz#Cannot negate operator based rules.r )r2 r r ry rw newfangled_relationrm r )r. leftnegatedmethodrv r r r r s z_Parser.relationc C sR t | jddr d}nt | jddrd}ntddd|| ff}|r't|S |S ) Nrz =Fz!=Tz'Expected "=" or "!=" or legacy relationr r )r r rw rm r )r. r r rv r r r r s z_Parser.newfangled_relationc C s( | }t| jdr|| fS ||fS )Nr{ )ry r r )r. r r r r range_or_value s z_Parser.range_or_valuec C s< | g}t| jddr|| t| jdds t|S )Nrz ,)r r r r- r )r. rm r r r rm s z_Parser.range_listc C s| t | jd}|d u s|d tvrtd|d }t | jddr)d|df| ffS t | jddr:d|df| ffS t|S )Nrx rr z Expected identifier variablemodr rz %)r r _VARSrw ry r )r. rx r r r r r2 s z _Parser.exprc C s t t| dd S )Nry rr )r r r r: r r r ry s z _Parser.value)NN)r9 rP rQ rR r3 r r r r r r rm r2 ry r r r r r+ z s ! r+ c fddS )%Compiler factory for the `_Compiler`.c s | || |f S r rA )r. lrZtmplr r rF rg z"_binary_compiler.<locals>.<lambda>r r r r r _binary_compiler r c r )r c s | | S r r )r. rE r r r rF s z!_unary_compiler.<locals>.<lambda>r r r r r _unary_compiler r r c C dS )Nr r rD r r r rF rF c @ s e Zd ZdZdd Zdd Zdd Zdd Zdd Zd d Z d d Z d d Z e d Z e d ZedZe dZe dZe dZdd ZdS ) _CompilerzZThe compilers are able to transform the expressions into multiple output formats. c C s |\}}t | d| | S )NZcompile_)getattr)r. argr argsr r r rA s z_Compiler.compilec C r )Nr r rD r r r rF r z_Compiler.<lambda>c C r )Nr r rD r r r rF r c C r )Nr r rD r r r rF r c C r )Nr r rD r r r rF r c C r )Nr r rD r r r rF r c C r )Nr r rD r r r rF r c C s t |S r r )rE r r r r rF s z (%s && %s)z (%s || %s)z(!%s)z (%s %% %s) (%s == %s)z (%s != %s)c C s t r )NotImplementedError)r. r r2 rm r r r compile_relation rJ z_Compiler.compile_relationN)r9 rP rQ rR rA 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_isnotr r r r r r s" r c @ s8 e Zd ZdZedZedZedZedZ dd Z dS ) rb z!Compiles an expression to Python.z (%s and %s)z (%s or %s)z(not %s)z MOD(%s, %s)c s8 dd fdd|d D }d| ||f S )Nz[%s]r c s g | ] }d t t j| qS )z(%s, %s))tuplemaprA )r Zrange_r: r r r7 ' s z4_PythonCompiler.compile_relation.<locals>.<listcomp>rr z %s(%s, %s))r upperrA )r. r r2 rm Zcompile_range_listr r: r r % s z _PythonCompiler.compile_relationN) r9 rP rQ rR r r r r r r r r r r r rb s rb c @ s. e Zd ZdZejZeZeZ eZ eZ dd Z dS )rh z)Compile into a gettext plural expression.c C s~ g }| |}|d D ],}|d |d kr$|d|| |d f q t| j |\}}|d||||f q dd| S )Nrr r r z(%s >= %s && %s <= %s)z(%s)z || )rA r- r r )r. r r2 rm rv itemminmaxr r r r 6 s z!_GettextCompiler.compile_relationN) r9 rP rQ rR r r r compile_zeror r r r r r r r r rh - s rh c @ s0 e Zd ZdZdd ZeZeZeZeZ dd Z dS )rW z/Compiles the expression to plain of JavaScript.c C r )NzparseInt(n, 10)r rD r r r rF O r z _JavaScriptCompiler.<lambda>c C s4 t | |||}|dkr| |}d|||f }|S )Nr z (parseInt(%s, 10) == %s && %s))rh r rA )r. r r2 rm re r r r r U s z$_JavaScriptCompiler.compile_relationN) r9 rP rQ rR r r r r r r r r r r r rW J s rW c @ sJ e Zd ZdZedZedZedZedZedZ dd Z 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 %sc C s | j |d ddiS )Nrr r T)r )r. r r r r r k s z _UnicodeCompiler.compile_notFc C sv g }|d D ]"}|d |d kr| | |d q| dtt| j| qd| ||r2dp3d|d|f S )Nrr r z%s..%sz %s%s %s %sz notr r )r- rA r r r )r. r r2 rm r Zrangesr r r r r n s z!_UnicodeCompiler.compile_relationN)F) r9 rP rQ rR r r r r r r r r r r r r r@ ^ s r@ r )&rR reZ babel._compatr r( rX r objectr r[ rN rj r_ r` ra Exceptionrw r rA UNICODEformatr~ r r r r r r r r+ r r r r rb rh rW r@ r r r r <module> sN 8]( {