Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/openstack/__pycache__/utils.cpython-39.pyc
Ðазад
a t�h)% � @ s� d dl Z d dlZd dlZd dlZd dlZd dlmZ d dlmZ d dlmZ dd� Z ddd �Z dd d �Z d d� Z dd� Z dd� ZG dd� d�ZdS )� N)�discover)�_log)� exceptionsc G s d� dd� | D ��S )a A custom version of urljoin that simply joins strings into a path. The real urljoin takes into account web semantics like when joining a url like /path this should be joined to http://host/path as it is an anchored link. We generally won't care about that in client. �/c s s | ]}t |pd ��d�V qdS )� r N)�str�strip)�.0�a� r �/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/openstack/utils.py� <genexpr> � zurljoin.<locals>.<genexpr>)�join)�argsr r r �urljoin s r � c c s� t �d�}z8|du rd}n |dkr8| du r.dntd| �}t|�}W n$ tyf t�dj|d���Y n0 t�� }d}| du s�t�� || k r�|d7 }|V |� d |� t� |� qtt� |��dS ) z�Iterate and raise an exception on timeout. This is a generator that will continually yield and sleep for wait seconds, and if the timeout is reached, will raise an exception with <message>. zopenstack.iterate_timeoutNr r g�������?z>Wait value must be an int or float value. {wait} given instead)�wait� zWaiting %s seconds) r � setup_logging�min�float� ValueErrorr � SDKException�format�time�debug�sleepZResourceTimeout)�timeout�messager �log�start�countr r r �iterate_timeout# s* �� r# Tc C s` |r&G dd� d�}|� }| | |j S g }t�� �| �D ] }|d dur8|�|d � q8|S dS )z�Gets a list of required keys from a format string Required mostly for parsing base_path urls for required keys, which use the old style string formatting. c @ s e Zd Zdd� Zdd� ZdS )z+get_string_format_keys.<locals>.AccessSaverc S s g | _ d S �N)�keys��selfr r r �__init__O s z4get_string_format_keys.<locals>.AccessSaver.__init__c S s | j �|� d S r$ )r% �append)r' �keyr r r � __getitem__R s z7get_string_format_keys.<locals>.AccessSaver.__getitem__N)�__name__� __module__� __qualname__r( r+ r r r r � AccessSaverN s r/ r N)r% �string� Formatter�parser) )Z fmt_stringZ old_styler/ r r% �tr r r �get_string_format_keysG s r4 c C s. | � � }|jr*|jr*t�|j|j|�r*dS dS )a� Determine if the given adapter supports the given microversion. Checks the min and max microversion asserted by the service and checks to make sure that ``min <= microversion <= max``. :param adapter: :class:`~keystoneauth1.adapter.Adapter` instance. :param str microversion: String containing the desired microversion. :returns: True if the service supports the microversion. :rtype: bool TF)�get_endpoint_data�min_microversion�max_microversionr Zversion_between)�adapterZ microversion� endpoint_datar r r �supports_microversiona s ���r: c C s` |durt �|�}| jdurJt �| j�}|du r6|}nt �||�rF|n|}|dur\t �|�S dS )a Get a new microversion if it is higher than session's default. :param session: The session to use for making this request. :type session: :class:`~keystoneauth1.adapter.Adapter` :param required: Version that is required for an action. :type required: String or tuple or None. :return: ``required`` as a string if the ``session``'s default is too low, the ``session``'s default otherwise. Returns ``None`` of both are ``None``. :raises: TypeError if ``required`` is invalid. N)r �normalize_version_numberZdefault_microversionZ version_match�version_to_string)�session�required�defaultr r r �pick_microversionz s ��r@ c C s� |du r dS z | � � }W n tjjjy4 d}Y n0 |du r`t�d�}|�d| jpX| j � dS |j sjdS t � |�}t � |j �}|j r�t � |j �}||k r�dS t||�}t �|�S )aQ Determinte the maximum microversion supported by both client and server. :param adapter: :class:`~keystoneauth1.adapter.Adapter` instance. :param client_maximum: Maximum microversion supported by the client. If ``None``, ``None`` is returned. :returns: the maximum supported microversion as string or ``None``. N� openstackz-Cannot determine endpoint data for service %s)r5 � keystoneauth1r Z discoveryZDiscoveryFailurer r �warningZ service_type� service_namer7 r r; r6 r r< )r8 Zclient_maximumr9 r Z client_maxZ server_maxZ server_min�resultr r r � maximum_supported_microversion� s4 � �� rF c @ s� e Zd ZdZd!dd�Zdd� Zedd� �Zd d � Zd d � Z d d� Z d"dd�Z dd� Z dd� Z dd� Zdd� Zdd� Zdd � Zd d � Zd d � ZdS )#�TinyDAGz�Tiny DAG Bases on the Kahn's algorithm, and enables parallel visiting of the nodes (parallel execution of the workflow items). Nc C s. | � � t�� | _|r*t|t�r*| �|� d S r$ )�_reset� threading�Lock�_lock� isinstance�dict� from_dict)r' �datar r r r( � s zTinyDAG.__init__c C s t � | _d| _d S )N�x )rM �_graph� _wait_timeoutr& r r r rH � s zTinyDAG._resetc C s | j S )z$Get graph as adjacency dict )rQ r& r r r �graph� s z TinyDAG.graphc C s | j �|t� � d S r$ )rQ � setdefault�set)r' �noder r r �add_node� s zTinyDAG.add_nodec C s | j | �|� d S r$ )rQ �add)r' �u�vr r r �add_edge� s zTinyDAG.add_edgec C s> | � � |�� D ](\}}| �|� |D ]}| �||� q&qd S r$ )rH �itemsrW r[ )r' rO �krZ �depr r r rN � s zTinyDAG.from_dictc C s |r || _ | S )z.Start the walking from the beginning. )rR )r' r r r r �walk� s z TinyDAG.walkc C s | � � | S r$ )�_start_traverser& r r r �__iter__� s zTinyDAG.__iter__c C sZ | j dkrR| j d8 _ z| jjd| jd�}|W S tjyN t�d��Y qV0 nt�d S )Nr r T)�blockr z,Timeout waiting for cleanup task to complete) �_it_cnt�_queue�getrR �queue�Emptyr r � StopIteration)r' �resr r r �__next__� s �zTinyDAG.__next__c C sL | j �|� | j| D ]0}| j| d8 < | j| dkr| j�|� qdS )z?Mark node as "processed" and put following items into the queuer r N)�_donerX rQ �_run_in_degreerd �put)r' rV rZ r r r � node_done s zTinyDAG.node_donec C sT | � � | _t�� | _t� | _t| j�| _ | j� � D ] \}}|dkr2| j� |� q2dS )zInitialize graph traversingr N) �_get_in_degreerl rf �Queuerd rU rk �lenrQ rc r\ rm )r' r] rZ r r r r` s zTinyDAG._start_traversec C sJ t � }dd� | j�� D �}| jD ]$}| j| D ]}|| d7 < q.q |S )z2Calculate the in_degree (count incoming) for nodesc S s i | ] }|d �qS )r r )r rY r r r � <dictcomp> r z*TinyDAG._get_in_degree.<locals>.<dictcomp>r )rM rQ r% )r' Z _in_degreerY rZ r r r ro s zTinyDAG._get_in_degreec C s& g }| D ]}|� |� | �|� q|S )z/Return the graph nodes in the topological order)r) rn )r' rE rV r r r �topological_sort! s zTinyDAG.topological_sortc C s t | j�� �S r$ )rq rQ r% r& r r r �size* s z TinyDAG.sizec C s t | j�| �� kS r$ )rq rk rt r& r r r � is_complete- s zTinyDAG.is_complete)N)N)r, r- r. �__doc__r( rH �propertyrS rW r[ rN r_ ra rj rn r` ro rs rt ru r r r r rG � s" rG )r )T)rf r0 rI r rB r rA r r r r# r4 r: r@ rF rG r r r r �<module> s $ ,
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка