File manager - Edit - /opt/saltstack/salt/lib/python3.10/site-packages/salt/utils/__pycache__/data.cpython-310.pyc
Back
o ;j;� � @ sT d Z ddlZddlZddlZddlZddlZddlZddlZddlZddl m Z ddl m Z m Z mZ ddlZddlZddlZddlmZ ddlmZ ddlmZ zddlZW n eya dZY nw dZe� e �Z G d d � d e �Z did d �Z didd�Z!didd�Z"ed�djdd��Z#ed�djdd��Z$dkdd�Z% dldd�Z& dldd �Z' dld d �Z( dmd d �Z) dnd!d"�Z*ed#�ed$� dnd%d&���Z+ed'�ed(� dnd)d*���Z, dod+d,�Z-ed-�dpd/d0��Z.ed1�d2d3� �Z/dqd5d6�Z0defd7d8�Z1ed9�defd:d;��Z2ed d fd<d=�Z3ed>�d?d@� �Z4dAdB� Z5drdCdD�Z6edE�dFdE� �Z7edG�e8ffdHdG��Z9edI�dJdI� �Z:dkdKdL�Z;edM�dNdM� �Z<dOdP� Z=dQdR� Z>edS�dTdS� �Z?dsdVdW�Z@dtdXdY�ZA dudZd[�ZBdkd\d]�ZCed^�dvd_d^��ZDdwdadb�ZEedc�dkddde��ZFedf�dkdgdh��ZGdS )xzc Functions for manipulating, inspecting, or otherwise working with data types and data structures. � N)� OrderedDict)�Mapping�MutableMapping�Sequence)�DEFAULT_TARGET_DELIM)� SaltException)� jinja_filter�algorithms_guaranteedc @ sb e Zd ZdZddd�Zdd� Zdd� Zd d � Zd d � Zd d� Z dd� Z dd� Z dd� Z dd� Z dS )�CaseInsensitiveDictzq Inspired by requests' case-insensitive dict implementation, but works with non-string keys as well. Nc K s" t � | _| j|p i fi |�� dS )zy Force internal dict to be ordered to ensure a consistent iteration order, irrespective of case. N)r �_data�update)�self�init�kwargs� r �C/opt/saltstack/salt/lib/python3.10/site-packages/salt/utils/data.py�__init__( s z CaseInsensitiveDict.__init__c C s t | j�S �N)�lenr �r r r r �__len__0 s zCaseInsensitiveDict.__len__c C s ||f| j t|�< d S r �r � to_lowercase)r �key�valuer r r � __setitem__3 s z CaseInsensitiveDict.__setitem__c C s | j t|�= d S r r �r r r r r � __delitem__7 � z CaseInsensitiveDict.__delitem__c C s | j t|� d S )N� r r r r r � __getitem__: s z CaseInsensitiveDict.__getitem__c C � dd� | j �� D �S )Nc s s � | ]}|d V qdS )r Nr ��.0�itemr r r � <genexpr>> � � z/CaseInsensitiveDict.__iter__.<locals>.<genexpr>)r �valuesr r r r �__iter__= s z CaseInsensitiveDict.__iter__c C s* t |t�sdS t| �� �tt|��� �kS )NF)� isinstancer �dict� items_lowerr )r Zrvalr r r �__eq__@ s zCaseInsensitiveDict.__eq__c C s t t| �� ��S r )�reprr* �itemsr r r r �__repr__F r z CaseInsensitiveDict.__repr__c C r! )zp Returns a generator iterating over keys and values, with the keys all being lowercase. c s s � | ] \}}||d fV qdS )r Nr �r# r �valr r r r% N s � z2CaseInsensitiveDict.items_lower.<locals>.<genexpr>)r r. r r r r r+ I s z CaseInsensitiveDict.items_lowerc C s t | j�� �S )z. Returns a copy of the object )r r r. r r r r �copyP s zCaseInsensitiveDict.copyr )�__name__� __module__� __qualname__�__doc__r r r r r r( r, r/ r+ r2 r r r r r " s r Fc s| zt | � �� W S ty Y nw | j}t| t�r+�r |nt� �fdd�| �� D ��S t| t�r<|� �fdd�| D ��S | S )z� Calls data.attr() if data has an attribute/method called attr. Processes data recursively if data is a Mapping or Sequence. For Mapping, processes both keys and values. c 3 s, � | ]\}}t |� ��t |� ��fV qd S r �� __change_caser0 ��attr�preserve_dict_classr r r% e s � � � �z __change_case.<locals>.<genexpr>c 3 s � | ] }t |� ��V qd S r r7 r" r9 r r r% m s � �)�getattr�AttributeError� __class__r) r r* r. r )�datar: r; Z data_typer r9 r r8 W s � � �r8 c C � t | d|�S )z> Recursively changes everything in data to lowercase. �lowerr7 �r? r; r r r r s � r c C r@ )z> Recursively changes everything in data to uppercase. �upperr7 rB r r r � to_uppercasez rC rE � compare_dictsc C s� i }t |pi ��| p i �D ]1}|| vr d|| d�||< q ||vr+d| | d�||< q || | | kr>| | || d�||< q |S )z� Compare before and after results from various salt functions, returning a dict describing the changes that were made. � ��old�new)rJ rI )�set�union)rI rJ �retr r r r rF � s �� compare_listsc C sP i }|D ]}|| vr|� dg ��|� q| D ]}||vr%|� dg ��|� q|S )z� Compare before and after results from various salt functions, returning a dict describing the changes that were made rJ rI )� setdefault�append)rI rJ rM r$ r r r rN � s ��c s� � du rt � � t| �� v rt�d| � dS � �t| �� | }t| t�r/� fdd�| �� D �}nt| tt t t f�rEt | �� fdd�| D ��}� � t| �� |S )a� Generic method to remove circular references from objects. This has been taken from author Martijn Pieters https://stackoverflow.com/questions/44777369/ remove-circular-references-in-dicts-lists-tuples/44777477#44777477 :param ob: dict, list, tuple, set, and frozenset Standard python object :param object _seen: Object that has circular reference :returns: Cleaned Python object :rtype: type(ob) NzZCaught a circular reference in data structure below.Cleaning and continuing execution. %r c s" i | ] \}}t |� �t |� ��qS r ��_remove_circular_refs)r# �k�v��_seenr r � <dictcomp>� s ��z)_remove_circular_refs.<locals>.<dictcomp>c 3 s � | ]}t |� �V qd S r rQ )r# rT rU r r r% � s � z(_remove_circular_refs.<locals>.<genexpr>) rK �id�log� exception�addr) r* r. �list�tuple� frozenset�type�remove)�obrV �resr rU r rR � s$ � �rR �strictc C s� t | �} |s tjjjntjjj}t| t�r t| |||||||�S t| t �r0t | |||||||�S t| t �rL|rAt | ||||||�S t | |||||||�S t| t j �rV| �� S z || |||�} W | S tyj Y | S tyv |ss� Y | S w )ub Generic function which will decode whichever type is passed, if necessary. Optionally use to_str=True to ensure strings are str types and not unicode on Python 2. If `strict` is True, and `keep` is False, and we fail to decode, a UnicodeDecodeError will be raised. Passing `keep` as True allows for the original value to silently be returned in cases where decoding fails. This can be useful for cases where the data passed to this function is likely to contain binary blobs, such as in the case of cp.recv. If `normalize` is True, then unicodedata.normalize() will be used to normalize unicode strings down to a single code point per glyph. It is recommended not to normalize unless you know what you're doing. For instance, if `data` contains a dictionary, it is possible that normalizing will lead to data loss because the following two strings will normalize to the same value: - u'\u044f\u0438\u0306\u0446\u0430.txt' - u'\u044f\u0439\u0446\u0430.txt' One good use case for normalization is in the test suite. For example, on some platforms such as Mac OS, os.listdir() will produce the first of the two strings above, in which "й" is represented as two code points (i.e. one for the base character, and one for the breve mark). Normalizing allows for a more reliable test case. )rR �salt�utils� stringutils� to_unicode�to_strr) r � decode_dictr\ � decode_listr] � decode_tuple�datetime� isoformat� TypeError�UnicodeDecodeError) r? �encoding�errors�keep� normalizer; �preserve_tuplesrh Z _decode_funcr r r �decode� st ' �� � � ����� � ���ru c C s� t | �} |r | �� ni }| �� D ]�\} } t| t�r1|r%t| ||||||�n t| |||||||�} n"z t| |||||||�} W n tyG Y n t yR |sP� Y nw t| t �rdt| |||||||�} nYt| t�r�|rut| ||||||�n t| |||||||�} n<t| t �r�t | |||||||�} n+z t| |||||||�} W n ty� } zW Y d} ~ nd} ~ w t y� |s�� Y nw | || < q|S )�� Decode all string values to Unicode. Optionally use to_str=True to ensure strings are str types and not unicode on Python 2. N) rR r> r. r) r] rk rj ru rn ro r\ r ri ) r? rp rq rr rs r; rt rh rM r r �er r r ri 1 s� ����� �� � �� �� � � � �� ri c C s� t | �} g }| D ]h} t| t�rt| |||||||�} nPt| t�r8|r,t| ||||||�n t| |||||||�} n3t| t�rIt| |||||||�} n"z t| |||||||�} W n t y_ Y n t yj |sh� Y nw |� | � q|S )rv ) rR r) r\ rj r] rk r ri ru rn ro rP ) r? rp rq rr rs r; rt rh rM r$ r r r rj � sz � ���� � � �� rj c C s t t| |||||d|��S )rv T)r] rj )r? rp rq rr rs r; rh r r r rk s ��rk c C s� t | �} t| t�rt| |||||�S t| t�r t| |||||�S t| t�r8|r/t| ||||�S t| |||||�S z tj j � | ||�W S t yL Y | S t yX |sU� Y | S w )a� Generic function which will encode whichever type is passed, if necessary If `strict` is True, and `keep` is False, and we fail to encode, a UnicodeEncodeError will be raised. Passing `keep` as True allows for the original value to silently be returned in cases where encoding fails. This can be useful for cases where the data passed to this function is likely to contain binary blobs. )rR r) r � encode_dictr\ � encode_listr] � encode_tuplerd re rf �to_bytesrn �UnicodeEncodeError)r? rp rq rr r; rt r r r �encode s8 � � �� �� ���r} Zjson_decode_dictZjson_encode_dictc C sV t | �} |r | �� ni }| �� D ]�\}}t|t�r-|r#t|||||�nt||||||�}n z tjj � |||�}W n t yA Y n t yL |sJ� Y nw t|t �r\t||||||�}nHt|t�ru|rkt|||||�nt||||||�}n/t|t�r�t||||||�}n z tjj � |||�}W n t y� Y n t y� |s�� Y nw |||< q|S �z+ Encode all string values to bytes )rR r> r. r) r] rz ry rd re rf r{ rn r| r\ r rx ) r? rp rq rr r; rt rM r r r r r rx L sZ � �� �� � � �� � �� rx Zjson_decode_listZjson_encode_listc C s� t | �} g }| D ]^}t|t�rt||||||�}nHt|t�r2|r(t|||||�nt||||||�}n/t|t�rAt||||||�}n z tj j � |||�}W n t yU Y n t y` |s^� Y nw |�|� q|S r~ )rR r) r\ ry r] rz r rx rd re rf r{ rn r| rP )r? rp rq rr r; rt rM r$ r r r ry � s: � � �� � �� ry c C s t t| ||||d��S )z- Encode all string values to Unicode T)r] ry )r? rp rq rr r; r r r rz � � rz Zexactly_n_truer c s, t | �� t� fdd�t|�D ��ot� � S )zb Tests that exactly N items in an iterable are "truthy" (neither None, False, nor 0). c 3 s � | ]}t � �V qd S r ��any)r# �j��ir r r% � r& z exactly_n.<locals>.<genexpr>)�iter�all�ranger� )�iterable�amountr r� r � exactly_n� s $r� Zexactly_one_truec C s t | �S )zI Check if only one item is not None, False, or 0 in an iterable. )r� )r� r r r � exactly_one� s r� �defaultc C s, d}t ||g �}t|t�r|n|gD ]/}| D ]$} t| t�r | nt| �} t|t�r*|nt|�} t�| | �r:| | } nq|durA nq|du rL| �|d�}|rv|| v rv| | } |du r]| }nt| t�rvt|t�sktd��t j j � t �| �|�}|r�t|t�s�td��|du r�|}|S t j j � |t �|�� |S )zF Common code to filter data structures like grains and pillar Nz?filter_by default and look-up values must both be dictionaries.z.filter_by merge argument must be a dictionary.)�traverse_dict_and_listr) r\ �str�fnmatch� fnmatchcase�getr r rd re Z dictupdater r2 �deepcopy) Z lookup_dict�lookup�traverse�merger� �baserM r1 �eachr Ztest_keyZ test_eachZ base_valuesr r r � filter_by� sB �� � �r� c C s@ | }z|� |�D ]}|| }qW |S tttfy | Y S w )a Traverse a dict using a colon-delimited (or otherwise delimited, using the 'delimiter' param) target string. The target 'foo:bar:baz' will return data['foo']['bar']['baz'] if this value exists, and will otherwise return the dict in the default argument. )�split�KeyError� IndexErrorrn )r? r r� � delimiter�ptrr� r r r � traverse_dict s ���r� r� c C s� | }t |t�r |�|�}t |t�r|g}|D ]�}t |t�r�zt|�}W n/ tyR d}dd� |D �D ]}z || }d}W n tyG Y q3w |sP| Y S Y qw d}dd� |D �D ]}z || }d}W n typ Y q\w |s�z|| }W q ty� | Y S w qz|| }W q ty� ddl} z | j j � |�} W n t y� | Y Y S w | |kr�| Y S z|| }W n tt fy� | Y Y S w Y q t y� | Y S w |S )a Traverse a dict or list using a colon-delimited (or otherwise delimited, using the 'delimiter' param) target string. The target 'foo:bar:0' will return data['foo']['bar'][0] if this value exists, and will otherwise return the dict in the default argument. Function will automatically determine the target type. The target 'foo:bar:0' will return data['foo']['bar'][0] if data like {'foo':{'bar':['baz']}} , if data like {'foo':{'bar':{'0':'baz'}}} then return data['foo']['bar']['0'] Fc s � � | ] }t |t�r|V qd S r �r) r* �r# �xr r r r% 8 � � z)traverse_dict_and_list.<locals>.<genexpr>Tc s r� r r� r� r r r r% F r� r N)r) r� r� �intr\ � ValueErrorr� r� Zsalt.utils.argsre �argsZ yamlify_arg� Exceptionrn ) r? r r� r� r� r� �idxZ embed_matchZembeddedrd Z loaded_keyr r r r� sx � �� � �� � �� �r� c s> ddd��d� �fdd� � |� |�}t|�}|dkr dS t|d dd�D ]x}|�|d |� �}|d kr8|} | } n|�||d � �} t| |i |d �} t�d | ||� | i krVq$t| t�rg� | | ||d �rf dS q$t| t t f�r�| D ] } t| t�r�� | | ||d �r� dS �| | ||d �r� dS qpq$�| | ||d �r� dS q$dS )af Check for a match in a dictionary using a delimiter character to denote levels of subdicts, and also allowing the delimiter character to be matched. Thus, 'foo:bar:baz' will match data['foo'] == 'bar:baz' and data['foo']['bar'] == 'baz'. The latter would take priority over the former, as more deeply-nested matches are tried first. Fc S s� zt | ��� } W n ty tjj�| ��� } Y nw zt |��� }W n ty5 tjj�|��� }Y nw |rPzt�|| �W S t yO t � d|� Y dS w |rV| |kS t � | |�S )NzInvalid regex '%s' in matchF) r� rA ro rd re rf rg �re�matchr� rY �errorr� )�target�pattern� regex_match� exact_matchr r r �_match| s* � � � � �z subdict_match.<locals>._matchc s� d}|� d�}|r|dd � }|dkrd}|s || v r d}|s)t| |||d�r)d}|so|ro| D ]?}t| | t�rF� | | |||d�rE dS q/t| | t�ra| | D ]}�||||d�r_ dS qQq/�| | |||d�rn dS q/|S )NFz*:� �*T�r� r� )� startswith� subdict_matchr) r* r\ )r� r� r� r� rM Zwildcardr r$ �� _dict_matchr� r r r� � sV ��� �����z"subdict_match.<locals>._dict_matchr r ���Nr� )r� z5Attempting to match '%s' in '%s' using delimiter '%s'r� T)FF) r� r r� �joinr� rY �debugr) r* r\ r] ) r? �exprr� r� r� ZsplitsZ num_splitsr� r Zmatchstrr� �memberr r� r r� q s^ ,� � ����r� Zsubstring_in_listc s t � fdd�|D ��S )z� Return a boolean value that indicates whether or not a given string is present in any of the strings which comprise a list c 3 s � | ]}� |v V qd S r r )r# �s��string_to_search_forr r r% � r& z!substr_in_list.<locals>.<genexpr>r� )r� Zlist_to_searchr r� r �substr_in_list� r r� c C s> t | t�r | D ]}t |t�rt|�dkr dS q dS dS dS )zy Returns True if data is a list of one-element dicts (as found in many SLS schemas), otherwise returns False r FT)r) r\ r* r )r? �elementr r r � is_dictlist� s �r� c C s� t | t�r,z tjj�| �} W n tjjjjy+ } z t� |� i W Y d}~S d}~ww |du r4dd� }|du r<dd� }tft ft f}t | t �rs| D ]'}t ||�rRqJt |t �rht|�dkrgt� d|� i S qJt� d|� i S nt� d | � i S i }| D ]G}t ||�r�d|||�< qtt|��} || } t| �r�|r�t| |d �||| �< q|r�t� d � i S || | �||| �< q|| | �||| �< q|S ) zt Takes a list of one-element dicts (as found in many SLS schemas) and repacks into a single dictionary. Nc S � | S r r �r� r r r �key_cb � z repack_dictlist.<locals>.key_cbc S s |S r r )r� �yr r r �val_cb! r� z repack_dictlist.<locals>.val_cbr zcInvalid input for repack_dictlist: key/value pairs must contain only one element (data passed: %s).zPInvalid input for repack_dictlist: element %s is not a string/dict/numeric valuezAInvalid input for repack_dictlist, data passed is not a list (%s))�recursezUInvalid input for repack_dictlist: nested dictlist found, but recurse is set to False)r) r� rd re ZyamlZ safe_load�parserZ ParserErrorrY r� r� �floatr\ r* r �nextr� r� �repack_dictlist) r? rc r� r� r� �errZvalid_non_dictr� rM r r1 r r r r� sh �� ����� �r� �is_listc C s t | t�S )z( Check if a variable is a list. )r) r\ �r r r r r� U s �is_iterc C s6 |r t | |�r dS zt| � W dS ty Y dS w )a� Test if an object is iterable, but not a string type. Test if an object is an iterator or is iterable itself. By default this does not return True for string objects. The `ignore` argument defaults to a list of string types that are not considered iterable. This can be used to also exclude things like dictionaries or named tuples. Based on https://bitbucket.org/petershinners/yter FT)r) r� rn )�thing�ignorer r r r� ] s ��sorted_ignorecasec C s t | dd� d�S )z� Sort a list of strings ignoring case. >>> L = ['foo', 'Foo', 'bar', 'Bar'] >>> sorted(L) ['Bar', 'Foo', 'bar', 'foo'] >>> sorted(L, key=lambda x: x.lower()) ['bar', 'Bar', 'foo', 'Foo'] >>> c S s | � � S r )rA r� r r r �<lambda>� s z#sorted_ignorecase.<locals>.<lambda>�r )�sorted)Zto_sortr r r r� t s c C s� zt | �} W n ttfy Y nw zt| �} W n ttfy# Y nw t| t ftf�r0| dkS t| t�r=t| ��� dkS t| �S )a Returns a boolean value representing the "truth" of the value passed. The rules for what is a "True" value are: 1. Integer/float values greater than 0 2. The string values "True" and "true" 3. Any object for which bool(obj) returns True r �true)r� r� rn r� r) r� rA �boolr� r r r �is_true� s � � r� � mysql_to_dictc C s� i }dg}| D ]O}|s q|� d�rq|�d�}t|�D ] \}}|�� ||< qt|�dkrTt|�d }i } t|�D ]} | dk r?q8tjj� || �| || < q8| || | < q|}q|S )z; Convert MySQL-style output to a python dictionary rG �+�|r ) r� r� � enumerate�stripr r� rd re rf Zto_num) r? r rM �headers�line�compsr� �comp�index�row�fieldr r r r� � s( c C s | du r| S t ft tfttf}tt|�ttg �}t| ttf�rGg }| D ] }|dur?t|ttf�r6t|�}n t||�s?t |�}|� |� q$|S t| t�r�i }| � � D ]3\}}|durct||�sct |�}|durtt|tttf�rtt|�}n |dur�t||�s�t |�}|||< qR|S | S )zg Convert the data list, dictionary into simple types, i.e., int, float, string, bool, etc. N) r� r� r� r� r] r\ r) r* �simple_types_filterr- rP r. )r? Zsimpletypes_keysZsimpletypes_valuesZ simplearrayr Z simpledictr r r r r� � s4 r� c C s. g }| D ]}t |t�st|�}|�|� q|S )zu Given an iterable, returns its items as a list, with any non-string items converted to unicode strings. )r) r� rP )r? rM r$ r r r � stringify� s r� � json_queryc C s* t du rd}t�|� t|��t �|| �S )aj Query data using JMESPath language (http://jmespath.org). Requires the https://github.com/jmespath/jmespath.py library. :param data: A complex data structure to query :param expr: A JMESPath expression (query) :returns: The query result .. code-block:: jinja {"services": [ {"name": "http", "host": "1.2.3.4", "port": 80}, {"name": "smtp", "host": "1.2.3.5", "port": 25}, {"name": "ssh", "host": "1.2.3.6", "port": 22}, ]} | json_query("services[].port") }} will be rendered as: .. code-block:: text [80, 25, 22] Nz-json_query requires jmespath module installed)�jmespathrY r� � RuntimeError�search)r? r� r� r r r r� � s r c C s t | t�p t| �|v p | S )z� Helper function for filter_falsey to determine if something is not to be considered falsey. :param any value: The value to consider :param list ignore_types: The types to ignore when considering the value. :return bool )r) r� r_ )r � ignore_typesr r r �_is_not_considered_falsey s r� c s� |r t jt|d �d�ndd� � t| t�r-� fdd�| �� D �}t| ��fdd�|D ��S t| �rG� fdd �| D �}t| ��fd d�|D ��S | S ) a� Helper function to remove items from an iterable with falsey value. Removes ``None``, ``{}`` and ``[]``, 0, '' (but does not remove ``False``). Recurses into sub-iterables if ``recurse`` is set to ``True``. :param dict/list data: Source iterable (dict, OrderedDict, list, set, ...) to process. :param int recurse_depth: Recurse this many levels into values that are dicts or lists to also process those. Default: 0 (do not recurse) :param list ignore_types: Contains types that can be falsey but must not be filtered. Default: Only booleans are not filtered. :return type(data) .. versionadded:: 3000 r )� recurse_depthr� c S r� r r r� r r r r� . s z filter_falsey.<locals>.<lambda>c s g | ] \}}|� |�f�qS r r �r# r r ��filter_elementr r � <listcomp>2 s �z!filter_falsey.<locals>.<listcomp>c s$ g | ]\}}t |� d �r||f�qS ��r� �r� r� r� r r r� 6 s ��c 3 s � | ]}� |�V qd S r r �r# r r� r r r% = r& z filter_falsey.<locals>.<genexpr>c s g | ] }t |� d �r|�qS r� r� r� r� r r r� ? s ��)� functools�partial� filter_falseyr) r* r. r_ r� )r? r� r� Zprocessed_elementsr )r� r� r r� s. � �� � �� ��r� c C s� |pg }i }t �| �}t �|�}t| t�r�t|t�r�|s�g g }} t| �t|�krFtt| �t|��} t| �� �| d� }t|�� �| d� } t| |�D ]D\} } | | kr�| |v r^|| = || = qKt | | || |||d�}|st|| = || = qK|d || < |d || < qK| |v r�|| = | |v r�|| = qK|D ]} | | || < q�| D ]} || || < q�|s�|r�||d�}|S i }|S t| t ��r+t|t ��r+t t| �t|� �D ]N}||v r�|� |d� |� |d� q�|r�|| v r�||vr�||= q�|| v �r||v �rt | | || |||d�}|�s ||= ||= q�|d ||< |d ||< q�|�s |�r'||d�}|S i }|S t| t ��rPt|t ��rP| | �sA|| �rL| | || d�}|S i }|S t | ��r�t |��r�t|�}t|�}|�r�| D ]!}|D ]}t |||||d�}|�s�|�|� |�|� �qk�qk�qgnBg }tt| |��D ]&\}\}}t |||||d�}|�s�|�|� �q�|d ||< |d ||< �q�t|�D ] }|� |� |� |� �q�|�s�|�r�t| �|�t|�|�d�}|S i }|S | |k�r�i n||d�}|S )ax Performs a recursive diff on mappings and/or iterables and returns the result in a {'old': values, 'new': values}-style. Compares dicts and sets unordered (obviously), OrderedDicts and Lists ordered (but only if both ``old`` and ``new`` are of the same type), all other Mapping types unordered, and all other iterables ordered. :param mapping/iterable old: Mapping or Iterable to compare from. :param mapping/iterable new: Mapping or Iterable to compare to. :param list ignore_keys: List of keys to ignore when comparing Mappings. :param bool ignore_order: Compare ordered mapping/iterables as if they were unordered. :param bool ignore_missing_keys: Do not return keys only present in ``old`` but missing in ``new``. Only works for regular dicts. :return dict: Returns dict with keys 'old' and 'new' containing the differences. N)� ignore_keys� ignore_order�ignore_missing_keysrI rJ rH )r2 r� r) r r �minr\ �keys�zip�recursive_diffr rK �popr� r` r� rP �reversedr_ )rI rJ r� r� r� rb Zret_oldZret_newZ append_oldZ append_newZ min_lengthZkey_oldZkey_newr$ rM r Zlist_oldZlist_newZitem_oldZitem_newZremove_indicesr� Ziter_oldZiter_newr r r r H s� ��� � �H�H� � �1�1�&/�/�� ���� � �����r c sF d| ig}|r�d|v r|d|� d�� n|}d|v r%||� d�d d� nd�|�d�rl|�d�rl|dd� �g }| du r?|S t| t�rI| �� }n t| t�rRt| �}�fdd �� � ��fd d �|D �}d d � |D �}|S t| t�r�|| �� vr|d�igS | � |�}|dur�t |���}|S d|ig}|S d| dur��igS | igS |S ) a� Get the values for a given path. :param path: keys of the properties in the tree separated by colons. One segment in the path can be replaced by an id surrounded by curly braces. This will match all items in a list of dictionary. :param default: default value to return when no value is found :return: a list of dictionaries, with at least the "value" key providing the actual value. If a placeholder was used, the placeholder id will be a key providing the replacement for it. Note that a value that wasn't found in the tree will be an empty list. This ensures we can make the difference with a None value set by the user. r �:Nr �{�}r� c s || � < | S r r )Z value_dictr )�placeholder_namer r �_append_placeholder� s z&get_value.<locals>._append_placeholderc s, g | ]\� }�� fd d�t |���D ��qS )c s g | ]}� |���qS r r r" )r r r r r� � s ��z(get_value.<locals>.<listcomp>.<listcomp>)� get_value)r# r1 )r r� � next_pathr� r r� � s � ��z get_value.<locals>.<listcomp>c S s g | ] }|D ]}|�qqS r r )r# r� r� r r r r� s ) �findr� �endswithr) r* r. r\ r� r� r� r )�obj�pathr� rb r r. r' r r )r r� r r r r � s< " � ��r �flattenc C s� |du rt � }t| �|v rtd��|�t| �� g }| D ];}|s%|dv r%q t|�rR|du r8|�t|||d�� q |dkrL|�t|t|�d ||d�� q |�|� q |�|� q |S )aT .. versionadded:: 3005 Flatten a list. :param data: A list to flatten :param levels: The number of levels in sub-lists to descend :param preserve_nulls: Preserve nulls in a list, by default flatten removes them :param _ids: Parameter used internally within the function to detect reference cycles. :returns: A flat(ter) list of values .. code-block:: jinja {{ [3, [4, 2] ] | flatten }} # => [3, 4, 2] Flatten only the first level of a list: .. code-block:: jinja {{ [3, [4, [2]] ] | flatten(levels=1) }} # => [3, 4, [2]] Preserve nulls in a list, by default flatten removes them. .. code-block:: jinja {{ [3, None, [4, [2]] ] | flatten(levels=1, preserve_nulls=True) }} # => [3, None, 4, [2]] Nz+Reference cycle detected. Check input list.)N�None�null)�preserve_nulls�_idsr )�levelsr r ) rK rX �RecursionErrorr[ r� �extendr r� rP )r? r r r rM r� r r r r s0 & �� �sha512c C s~ t | t�r | �t�} ttt�r&|ttt�v r&t�|�}|� | � |� � }|S tt|�r;t�|�}|� | � |� � }|S t d��)z� .. versionadded:: 2014.7.0 Encodes a value with the specified encoder. value The value to be hashed. algorithm : sha512 The algorithm to use. May be any valid algorithm supported by hashlib. z#You must specify a valid algorithm.) r) r� r} Z__salt_system_encoding__�hasattr�hashlib�ALGORITHMS_ATTR_NAMEr< rJ r � hexdigestr )r � algorithmZhasher�outr r r �hashY s � � �r Z random_samplec C s2 |du r t �| |�}|S t �t|���| |�}|S )aS Return a given sample size from a list. By default, the random number generator uses the current system time unless given a seed value. .. versionadded:: 3005 value A list to e used as input. size The sample size to return. seed Any value which will be hashed as a seed for random. N)�random�sample�Randomr )r �size�seedrM r r r r z s �r Zrandom_shufflec C s t | t| �|d�S )a( Return a shuffled copy of an input list. By default, the random number generator uses the current system time unless given a seed value. .. versionadded:: 3005 value A list to be used as input. seed Any value which will be hashed as a seed for random. )r# )r r )r r# r r r �shuffle� s r$ )F)NNr )Nrc FFFFF)Nrc FFFF)Nrc FFF)Nrc FF)r )Nr� N)FFNN)r )Nr )NFF)NFN)r )Hr6 r2 rl r� r� r �loggingr r� � collectionsr �collections.abcr r r Zsalt.utils.dictupdaterd Zsalt.utils.stringutilsZsalt.utils.yamlZ salt.defaultsr Zsalt.exceptionsr Zsalt.utils.decorators.jinjar r� � ImportErrorr � getLoggerr3 rY r r8 r rE rF rN rR ru ri rj rk r} rx ry rz r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r$ r r r r �<module> s � 5 * �f � �V � �2�C�1 � /S � G % 0 � ? F!
| ver. 1.4 |
Github
|
.
| PHP 8.2.30 | Generation time: 0 |
proxy
|
phpinfo
|
Settings