← Back
Editing: version.cpython-39.pyc
a XC?h�0 � @ s> d Z ddlZG dd� d�ZG dd� de�ZG dd� de�ZdS ) 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 @ sJ e Zd ZdZddd�Zdd� Zdd� Zd d � Zd d � Zd d� Z dd� Z dS )�Versionz�Abstract 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| � |� d S �N��parse��self�vstring� r �6/opt/alt/python39/lib64/python3.9/distutils/version.py�__init__& s zVersion.__init__c C s d| j jt| �f S )Nz %s ('%s'))� __class__�__name__�str�r r r r �__repr__* s zVersion.__repr__c C s | � |�}|tu r|S |dkS �Nr ��_cmp�NotImplemented�r �other�cr r r �__eq__- s zVersion.__eq__c C s | � |�}|tu r|S |dk S r r r r r r �__lt__3 s zVersion.__lt__c C s | � |�}|tu r|S |dkS r r r r r r �__le__9 s zVersion.__le__c C s | � |�}|tu r|S |dkS r r r r r r �__gt__? s zVersion.__gt__c C s | � |�}|tu r|S |dkS r r r r r r �__ge__E s zVersion.__ge__)N) r � __module__� __qualname__�__doc__r r r r r r r r r r r r s r c @ s< e Zd ZdZe�dejejB �Zdd� Z dd� Z dd� 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 �|�}|s td| ��|�ddddd�\}}}}}|rTttt|||g��| _nttt||g��d | _|r�|d t|�f| _nd | _d S ) Nzinvalid version number '%s'� � � � � )r r ) � version_re�match� ValueError�group�tuple�map�int�version� prerelease)r r r' �major�minorZpatchr. Zprerelease_numr r r r � s � zStrictVersion.parsec C sb | j d dkr*d�tt| j dd� ��}nd�tt| j ��}| jr^|| jd t| jd � }|S )Nr" r �.r! )r- �joinr+ r r. r r r r �__str__� s zStrictVersion.__str__c C s� t |t�rt|�}nt |t�s"tS | j|jkrB| j|jk r>dS dS | jsR|jsRdS | jrb|jsbdS | jsr|jrrdS | jr�|jr�| j|jkr�dS | j|jk r�dS dS n ds�J d��d S )N���r! r Fznever get here)� isinstancer r r r- r. �r r r r r r � s* zStrictVersion._cmpN) r r r r �re�compile�VERBOSE�ASCIIr& r r3 r r r r r r ] s # � r c @ sH e Zd ZdZe�dej�Zddd�Zdd� Z dd � Z d d � Z d d � Z dS )� 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| � |� d S r r r r r r r 0 s zLooseVersion.__init__c C s\ || _ dd� | j�|�D �}t|�D ],\}}zt|�||< W q$ tyN Y q$0 q$|| _d S )Nc S s g | ]}|r|d kr|�qS )r1 r )�.0�xr r r � <listcomp>: s �z&LooseVersion.parse.<locals>.<listcomp>)r � component_re�split� enumerater, r( r- )r r Z components�i�objr r r r 5 s zLooseVersion.parsec C s | j S r )r r r r r r3 E s zLooseVersion.__str__c C s dt | � S )NzLooseVersion ('%s'))r r r r r r I s zLooseVersion.__repr__c C sV t |t�rt|�}nt |t�s"tS | j|jkr2dS | j|jk rBdS | j|jkrRdS d S )Nr r4 r! )r5 r r; r r- r6 r r r r M s zLooseVersion._cmp)N) r r r r r7 r8 r9 r? r r r3 r r r r r r r; s r; )r r7 r r r; r r r r �<module> s > 1
Save File
Cancel