Yf90 @ sU d Z d d l Z Gd d d Z Gd d d e Z Gd d d e Z d S) a Provides classes to represent module version numbers (one class for
each style of version numbering). There are currently two such classes
implemented: StrictVersion and LooseVersion.
Every version number class implements the following interface:
* the 'parse' method takes a string and parses it to some internal
representation; if the string is an invalid version number,
'parse' raises a ValueError exception
* the class constructor takes an optional string argument which,
if supplied, is passed to 'parse'
* __str__ reconstructs the string that was passed to 'parse' (or
an equivalent string -- ie. one that will generate an equivalent
version number instance)
* __repr__ generates Python code to recreate the version number instance
* _cmp compares the current instance with either another instance
of the same class or a string (which will be parsed to an instance
of the same class, thus must follow the same rules)
Nc @ sm e Z d Z d Z d d d Z d d Z d d Z d d
Z d d Z d
d Z d d Z
d S)VersionzAbstract base class for version numbering classes. Just provides
constructor (__init__) and reproducer (__repr__), because those
seem to be the same for all version numbering classes; and route
rich comparisons to _cmp.
Nc C s | r | j | d S)N)parse)selfvstring r 6/opt/alt/python35/lib64/python3.5/distutils/version.py__init__& s zVersion.__init__c C s d | j j t | f S)Nz %s ('%s')) __class____name__str)r r r r __repr__* s zVersion.__repr__c C s) | j | } | t k r | S| d k S)Nr )_cmpNotImplemented)r othercr r r __eq__- s zVersion.__eq__c C s) | j | } | t k r | S| d k S)Nr )r
r )r r r r r r __lt__3 s zVersion.__lt__c C s) | j | } | t k r | S| d k S)Nr )r
r )r r r r r r __le__9 s zVersion.__le__c C s) | j | } | t k r | S| d k S)Nr )r
r )r r r r r r __gt__? s zVersion.__gt__c C s) | j | } | t k r | S| d k S)Nr )r
r )r r r r r r __ge__E s zVersion.__ge__) r
__module__ __qualname____doc__r r r r r r r r r r r r s r c @ sV e Z d Z d Z e j d e j e j B Z d d Z d d Z
d d Z d S)
StrictVersiona? Version numbering for anal retentives and software idealists.
Implements the standard interface for version number classes as
described above. A version number consists of two or three
dot-separated numeric components, with an optional "pre-release" tag
on the end. The pre-release tag consists of the letter 'a' or 'b'
followed by a number. If the numeric components of two version
numbers are equal, then one with a pre-release tag will always
be deemed earlier (lesser) than one without.
The following are valid version numbers (shown in the order that
would be obtained by sorting according to the supplied cmp function):
0.4 0.4.0 (these two are equivalent)
0.4.1
0.5a1
0.5b3
0.5
0.9.6
1.0
1.0.4a3
1.0.4b1
1.0.4
The following are examples of invalid version numbers:
1
2.7.2.2
1.3.a4
1.3pl1
1.3c4
The rationale for this version numbering system will be explained
in the distutils documentation.
z)^(\d+) \. (\d+) (\. (\d+))? ([ab](\d+))?$c C s | j j | } | s( t d | | j d d d d d \ } } } } } | r| t t t | | | g | _ n" t t t | | g d | _ | r | d t | f | _ n d | _ d S) Nzinvalid version number '%s' r )r )
version_rematch
ValueErrorgrouptuplemapintversion
prerelease)r r r majorminorZpatchr' Zprerelease_numr r r r s *$" zStrictVersion.parsec C s | j d d k r; d j t t | j d d } n d j t t | j } | j r | | j d t | j d } | S)Nr r .r )r& joinr$ r r' )r r r r r __str__ s ( "zStrictVersion.__str__c C s t | t r t | } | j | j k rG | j | j k rC d Sd S| j r_ | j r_ d S| j rv | j rv d S| j r | j r d S| j r | j r | j | j k r d S| j | j k r d Sd Sn d s t d d S)Nr r Fznever get herer- r- )
isinstancer r r& r' AssertionError)r r r r r r
s& zStrictVersion._cmpN) r
r r r recompileVERBOSEASCIIr r r, r
r r r r r ] s #
r c @ sj e Z d Z d Z e j d e j Z d d d Z d d Z d d Z
d
d Z d d
Z d S) LooseVersiona Version numbering for anarchists and software realists.
Implements the standard interface for version number classes as
described above. A version number consists of a series of numbers,
separated by either periods or strings of letters. When comparing
version numbers, the numeric components will be compared
numerically, and the alphabetic components lexically. The following
are all valid version numbers, in no particular order:
1.5.1
1.5.2b2
161
3.10a
8.02
3.4j
1996.07.12
3.2.pl0
3.1.1.6
2g6
11g
0.960923
2.2beta29
1.13++
5.5.kw
2.0b1pl0
In fact, there is no such thing as an invalid version number under
this scheme; the rules for comparison are simple and predictable,
but may not always give the results you want (for some definition
of "want").
z(\d+ | [a-z]+ | \.)Nc C s | r | j | d S)N)r )r r r r r r . s zLooseVersion.__init__c C s{ | | _ d d | j j | D } xC t | D]5 \ } } y t | | | <Wq5 t k
ri Yq5 Xq5 W| | _ d S)Nc S s( g | ] } | r | d k r | q S)r* r ).0xr r r
<listcomp>8 s z&LooseVersion.parse.<locals>.<listcomp>)r component_resplit enumerater% r! r& )r r Z
componentsiobjr r r r 3 s
zLooseVersion.parsec C s | j S)N)r )r r r r r, C s zLooseVersion.__str__c C s d t | S)NzLooseVersion ('%s'))r )r r r r r G s zLooseVersion.__repr__c C sa t | t r t | } | j | j k r1 d S| j | j k rG d S| j | j k r] d Sd S)Nr r r- )r. r r4 r& )r r r r r r
K s zLooseVersion._cmp)
r
r r r r0 r1 r2 r8 r r r, r r
r r r r r4 s r4 )r r0 r r r4 r r r r <module> s >