Current File : //proc/thread-self/root/opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyc
�
A��Qc @ s d Z d d l Z d! Z d Z d e f d
� � YZ d � Z d � Z d
� Z d � Z d � Z
d � Z d e f d � � YZ
d e f d � � YZ d � Z d � Z d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d S(" s�
babel.numbers
~~~~~~~~~~~~~
CLDR Plural support. See UTS #35.
:copyright: (c) 2013 by the Babel Team.
:license: BSD, see LICENSE for more details.
i����Nt zerot onet twot fewt manyt othert
PluralRulec B st e Z d Z d
Z d � Z d � Z e d � � Z e d � � Z e d � d d �Z
d
� Z d � Z d � Z
RS( s� 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.
t abstractt _funcc C s� t | t � r | j � } n t � } g | _ x� t t | � � D]v \ } } | t k rn t d | � � n | | k r� t d | � � n | j | � | j j
| t | � j f � qC Wd S( s$ 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
s unknown tag %rs tag %r defined twiceN(
t
isinstancet dictt itemst setR t sortedt listt _plural_tagst
ValueErrort addt appendt _Parsert ast( t selft rulest foundt keyt expr( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt __init__( s
c C sV | j } d t | � j d j g t D]& } | | k r% d | | | f ^ q% � f S( Ns <%s %r>s , s %s: %s( R t typet __name__t joinR ( R R t tag( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt __repr__< s
c C s t | | � r | S| | � S( s
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 ( t clsR ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt parseD s c C s> t � j } t g | j D] \ } } | | | � f ^ q � S( s� The `PluralRule` as a dict of unicode plural rules.
>>> rule = PluralRule({'one': 'n is 1'})
>>> rule.rules
{'one': 'n is 1'}
( t _UnicodeCompilert compileR
R ( R t _compileR R ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR P s c C s$ t g | j D] } | d ^ q
� S( Ni ( t frozensetR ( t xt i( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt <lambda>[ s t docs�
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.c C s | j S( N( R ( R ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt __getstate__` s c C s
| | _ d S( N( R ( R R ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt __setstate__c s c C s. t | d � s! t | � | _ n | j | � S( NR ( t hasattrt to_pythonR ( R t n( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt __call__f s ( s abstracts _func( R t
__module__t __doc__t __slots__R R t classmethodR! t propertyR t tagsR* R+ R/ ( ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR s c C ss t � j } d g } x= t j | � j D]) \ } } | j d | | � | f � q( W| j d t � d j | � S( s� 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
s (function(n) { return s
%s ? %r : s %r; })t ( t _JavaScriptCompilerR# R R! R R t
_fallback_tagR ( t rulet to_jst resultR R ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt
to_javascriptl s !c C s� i t d 6t d 6t d 6} t � j } d g } xC t j | � j D]/ \ } } | j d | | � t | � f � qC W| j d t
� t d j | � d d � } t | | � | d
S( s< 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
t INt WITHINt MODs def evaluate(n):s if (%s): return %rs
return %rs
s <rule>t exect evaluate(
t
in_range_listt within_range_listt cldr_modulot _PythonCompilerR# R R! R R t strR8 R t eval( R9 t namespaceR- R; R R t code( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR- � s
'
c C s� t j | � } | j t t g � B} t � j } g t D] } | | k r8 | ^ q8 j } d t | � g } x: | j
D]/ \ } } | j d | | � | | � f � qv W| j d | t � � d j | � S( s~ 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
s nplurals=%d; plural=(s
%s ? %d : s %d)R6 (
R R! R5 R R8 t _GettextCompilerR# R t indext lenR R R ( R9 t used_tagsR$ R t
_get_indexR; R ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt
to_gettext� s
('c C s | t | � k o t | | � S( s� 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
( t intRC ( t numt
range_list( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyRB � s c s t � f d � | D� � S( s� 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- | ]# \ } } � | k o$ � | k Vq d S( N( ( t .0t min_t max_( RQ ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pys <genexpr>� s ( t any( RQ RR ( ( RQ s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyRC � s c C s_ d } | d k r% | d 9} d } n | d k r> | d 9} n | | } | r[ | d 9} n | S( s� Javaish 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
i i����i ( ( t at bt reverset rv( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyRD � s
t RuleErrorc B s e Z d Z RS( s Raised if a rule is malformed.( R R0 R1 ( ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR[ � s R c B s� e Z d Z d e j d � f d e j d � f d e j d � f d e j d � f d e j d � f g Z d
� Z d d � Z d d � Z d d d
� Z
d � Z d � Z d � Z
d � Z d � Z d � Z d � Z RS( s� 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)*
and_condition = relation ('and' relation)*
relation = is_relation | in_relation | within_relation | 'n' <EOL>
is_relation = expr 'is' ('not')? value
in_relation = expr ('not')? 'in' range_list
within_relation = expr ('not')? 'within' range_list
expr = 'n' ('mod' value)?
range_list = (range | value) (',' range_list)*
value = digit+
digit = 0|1|2|3|4|5|6|7|8|9
range = 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'.
The translator parses the expression on instanciation into an attribute
called `ast`.
s \s+(?u)t words% \b(and|or|is|(?:with)?in|not|mod|n)\bt values \d+t commat ,t ellipsiss \.\.c C s | j � } g } d } t | � } x� | | k r� x{ | j D]\ \ } } | j | | � } | d k r= | j � } | r� | j | | j � f � n Pq= q= Wt d | | � � q' W| d d d � | _ | j
� | _ | j rt d | j d d � � n d S( Ni s5 malformed CLDR pluralization rule. Got unexpected %ri����s Expected end of rule, got %ri ( t lowerRL t _rulest matcht Nonet endR t groupR[ t tokenst conditionR ( R t stringR; t posRe t tokR9 Rc ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR $ s& c C sA | j o@ | j d d | k o@ | d k p@ | j d d | k S( Ni����i i ( Rg Rd ( R R R] ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt test; s c C s# | j | | � r | j j � Sd S( N( Rl Rg t pop( R R R] ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt skip? s c C s� | j | | � } | d k r" | S| d k rO t | d k rC | pF | � } n | j sk t d | � � n t d | | j d d f � � d S( Ns# expected %s but end of rule reacheds expected %s but got %ri����i ( Rn Rd t reprRg R[ ( R R R] t termt token( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt expectC s ! c C sA | j � } x. | j d d � r< d | | j � f f } q W| S( NR\ t or( t
and_conditionRn ( R t op( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyRh M s c C sA | j � } x. | j d d � r< d | | j � f f } q W| S( NR\ t and( t relationRn ( R Ru ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyRt S s c C s� | j � } | j d d � rL | j d d � r6 d p9 d | | j � f f S| j d d � } d } | j d d � r d } n | j d d d d �d | | | j � f f } | r� d | f f } n | S(
NR\ t ist nott isnott int withinRp s 'within' or 'in'Rw ( R Rn R] Rr RR ( R t leftt negatedt methodRZ ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyRw Y s c C s9 | j � } | j d � r+ | | j � f S| | f Sd S( NR` ( R] Rn ( R R} ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt range_or_valuei s c C sB | j � g } x& | j d � r7 | j | j � � q Wd | f S( NR^ RR ( R� Rn R ( R RR ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyRR p s c C sH | j d d � | j d d � r> d d d f | j � f f Sd d f S( NR\ R. t mod( ( ( Rr Rn R] ( R ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR v s c C s d t | j d � d � f f S( NR] i ( RP Rr ( R ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR] | s N( R R0 R1 Rd t reR# Rb R Rl Rn Rr Rh Rt Rw R� RR R R] ( ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR s"
c s
� f d � S( s% Compiler factory for the `_Compiler`.c s � | j | � | j | � f S( N( R# ( R t lt r( t tmpl( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR( � s ( ( R� ( ( R� s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt _binary_compiler� s c s
� f d � S( s% Compiler factory for the `_Compiler`.c s � | j | � S( N( R# ( R R& ( R� ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR( � s ( ( R� ( ( R� s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt _unary_compiler� s t _Compilerc B sz e Z d Z d � Z d � Z d � Z e d � Z e d � Z e d � Z
e d � Z e d � Z e d � Z
d
� Z RS( sZ The compilers are able to transform the expressions into multiple
output formats.
c C s# | \ } } t | d | � | � S( Nt compile_( t getattr( R t argRu t args( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR# � s c C s d S( NR. ( ( R& ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR( � s c C s
t | � S( N( RF ( R& t v( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR( � s s
(%s && %s)s
(%s || %s)s (!%s)s
(%s %% %s)s
(%s == %s)s
(%s != %s)c C s
t � � d S( N( t NotImplementedError( R R R RR ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt compile_relation� s ( R R0 R1 R# t compile_nt
compile_valueR� t compile_andt
compile_orR� t compile_nott compile_modt
compile_ist
compile_isnotR� ( ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR� � s RE c B sG e Z d Z e d � Z e d � Z e d � Z e d � Z d � Z RS( s! Compiles an expression to Python.s (%s and %s)s
(%s or %s)s (not %s)s MOD(%s, %s)c C s` d d j g | d D]" } d t t | j | � � ^ q � } d | j � | j | � | f S( Ns [%s]R_ i s (%s, %s)s
%s(%s, %s)( R t tuplet mapR# t upper( R R R RR t range_t compile_range_list( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR� � s
4(
R R0 R1 R� R� R� R� R� R� R� ( ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyRE � s RJ c B s e Z d Z d � Z RS( s) Compile into a gettext plural expression.c C s� g } | j | � } x� | d D]v } | d | d k ra | j d | | j | d � f � q t | j | � \ } } | j d | | | | f � q Wd d j | � S( Ni i s
(%s == %s)s (%s >= %s && %s <= %s)s (%s)s || ( R# R R� R ( R R R RR RZ t itemt mint max( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR� � s ( R R0 R1 R� ( ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyRJ � s R7 c B s e Z d Z d � Z RS( s/ Compiles the expression to plain of JavaScript.c C sM t j | | | | � } | d k rI | j | � } d | | | f } n | S( NR{ s (parseInt(%s) == %s && %s)( RJ R� R# ( R R R RR RI ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR� � s ( R R0 R1 R� ( ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR7 � s R" c B s_ e Z d Z e d � Z e d � Z e d � Z e d � Z e d � Z d � Z e
d � Z RS( s+ Returns a unicode pluralization rule again.s %s is %ss %s is not %ss %s and %ss %s or %ss %s mod %sc C s | j d t | d � S( NR~ i ( R� t True( R Rw ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR� � s c C s� g } xf | d D]Z } | d | d k rH | j | j | d � � q | j d t t | j | � � � q Wd | j | � | r� d p� d | d j | � f S( Ni i s %s..%ss
%s%s %s %ss notR6 R_ ( R R# R� R� R ( R R R RR R~ t rangesR� ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR� � s '( R R0 R1 R� R� R� R� R� R� R� t FalseR� ( ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyR" � s ( R R R R R s other( R1 R� R R8 t objectR R< R- RO RB RC RD t ExceptionR[ R R� R� R� RE RJ R7 R" ( ( ( s= /opt/alt/python27/lib/python2.7/site-packages/babel/plural.pyt <module>
s& Y $
Mini Shell