File: //proc/self/root/usr/lib/python3/dist-packages/landscape/lib/__pycache__/persist.cpython-38.pyc
U
���cR � @ s� d dl Z d dlZd dlZd dlZd dlmZ ddddddd d
gZe� ZG d d � d e �Z
G d d
� d
e
�Z G d
d� de�Z G dd� de�Z
e�d�jZdd� Zdd� ZG dd� de�ZG dd� de�ZG dd� de�ZdS )� N)�
StringType�Persist�
PickleBackend�BPickleBackend�path_string_to_tuple�path_tuple_to_string�
RootedPersist� PersistError�PersistReadOnlyErrorc @ s e Zd ZdS )r N��__name__�
__module__� __qualname__� r r �7/usr/lib/python3/dist-packages/landscape/lib/persist.pyr % s c @ s e Zd ZdS )r
Nr r r r r r
) s c @ s� e Zd ZdZd(dd�Zdd� Zdd� Zd d
� Zeee�Z ee�Z
d d � Z d
d� Z dd� Z
d)dd�Zeefdd�Zd*dd�Zedddfdd�Zd+dd�Zd,d d �Zd-d d �Zd.d d!�Zeddfd"d#�Zd/d$d%�Zd&d'� ZdS )0r a Persist a hierarchical database of key=>value pairs.
There are three different kinds of option maps, regarding the
persistence and priority that maps are queried.
- hard - Options are persistent.
- soft - Options are not persistent, and have a higher priority
than persistent options.
- weak - Options are not persistent, and have a lower priority
than persistent options.
@ivar filename: The name of the file where persist data is saved
or None if no filename is available.
Nc C sd |dkrt � }|| _|�� | _i | _i | _d| _d| _| | _|| _ |dk r`t
j � |�r`| �
|� dS )a�
@param backend: The backend to use. If none is specified,
L{BPickleBackend} will be used.
@param filename: The default filename to save to and load from. If
specified, and the file exists, it will be immediately
loaded. Specifying this will also allow L{save} to be called
without any arguments to save the persist.
NF)r �_backend�new�_hardmap�_softmap�_weakmap� _readonly� _modifiedZ_config�filename�os�path�exists�load)�selfZbackendr r r r �__init__? s
zPersist.__init__c C s | j S �N)r �r r r r �
_get_readonlyU s zPersist._get_readonlyc C s t |�| _d S r )�boolr )r �flagr r r �
_set_readonlyX s zPersist._set_readonlyc C s | j S r �r r r r r �
_get_modified[ s zPersist._get_modifiedc C s
d| _ dS )z(Set the database status as non-modified.FNr% r r r r �reset_modifieda s zPersist.reset_modifiedc C s | j rtd��dS )zRAssert if the object is writable
@raise: L{PersistReadOnlyError}
z"Configuration is in readonly mode.N)r r
r r r r �assert_writablee s zPersist.assert_writablec s� � �fdd�}t j�� �� t j�� �s<|� r0dS td� ��t j�� �dkrV|� dS z�j�� ��_W n, t k
r� |� r�Y dS td� ��Y nX dS )zLoad a persisted database.c s` � d } t j�| �r\t j�| �dkr\z�j�| ��_W n tk
rV td| ��Y nX dS dS )N�.oldr � Broken configuration file at %sTF) r r �isfile�getsizer r r � Exceptionr )Z filepathold��filepathr r r �load_oldp s �� z Persist.load.<locals>.load_oldNzFile not found: %sr r* )
r r �
expanduserr+ r r, r r r r- )r r/ r0 r r. r r m s z Persist.loadc C s� |dkr | j dkrtd��| j }tj�|�}tj�|�rHt�||d � tj�|�}|rntj�|�snt� |� | j
� || j � dS )z�Save the persist to the given C{filepath}.
If None is specified, then the filename passed during construction will
be used.
If the destination file already exists, it will be renamed
to C{<filepath>.old}.
NzNeed a filename!r) )
r r r r r1 r+ �rename�dirname�isdir�makedirsr �saver )r r/ r3 r r r r6 � s
z Persist.savec
C s8 |t k r| j�|�}t|�}t }|}|r�|}|�d�}| j�||�}|tkr�|rb|d t|� � }tdt |�t
|�t |�f ��||kr$q�q$||k r�||k r�| j� |||�}n�||kr�|}nxt|�dkr�t |d �t
kr�g } q�i } n|} | j� ||| �}|tk�rtdt |�t |�f ��|�s$�q4|}|�d�}q�|S )Nr zCan't traverse %r (%r): %rzCan't traverse %r with %r)�NOTHINGr �copy�list�pop�get�NotImplemented�lenr �typer �str�set�int)
r �objr �default�setvalueZqueue�marker�newobj�elemZnewvaluer r r � _traverse� sN
��
� zPersist._traverseFc C s� t |t�rt|�}t}|r,| �| j||�}nl|rB| �| j||�}nV|rX| �| j||�}n@| �| j||�}||kr�| �| j||�}||kr�| �| j||�}|S r )�
isinstancer r r7 rH r r r )r r �soft�hard�weakrE �valuer r r � _getvalue� s
zPersist._getvaluec C sV | � ||||�}t}||kr dS ||kr,dS | j�||�}|tkrRtdt|� ��|S )NFTz Can't check %r for containment)rN r7 r �hasr< r r> ) r r rM rJ rK rL rB rE �resultr r r rO � s z Persist.hasc C sD | � ||||�}|tkr g S | j�|�}|tkr@tdt|� ��|S )NzCan't return keys for %s)rN r7 r �keysr< r r> )r r rJ rK rL rB rP r r r rQ � s z Persist.keysc C s( | � ||||�}|tkr |S | j�|�S r )rN r7 r r8 )r r rC rJ rK rL rM r r r r; � s z Persist.getc C sZ |st �t|t�rt|�}|r&| j}n |r2| j}n| �� d| _| j}| j |||d� d S �NT)rD )
�AssertionErrorrI r r r r r( r r rH )r r rM rJ rL �mapr r r r@ � s
z Persist.setc C s� |st �t|t�rt|�}|r&| j}n |r2| j}n| �� d| _| j}|rn| � ||�}t
|�t krn||krnd S |t j
f }| j |||d� d S rR )rS rI r r r r r( r r rH r> r9 �sys�maxsize)r r rM �uniquerJ rL rT Zcurrentr r r �add
s
z Persist.addc C s� |st �t|t�rt|�}|r&| j}n |r2| j}n| �� d| _| j}t }|r�||krx| �
||d d� �}|d }d} n| �
||�}|}d} d}
||k r�| j � ||| �}
|
t
kr�td|t|�f ��| j �|�r�||k r�|}q�|d d� }qJq�qJ|
S )NT���FzCan't remove %r from %r)rS rI r r r r r( r r r7 rH r �remover< r r> �empty) r r rM rJ rL rT rE rB rG �isvaluerP r r r rZ s@
� zPersist.removec C s� |s|s| � � t|t�r"t|�}t|t�r4t|�}d}t}| �|||pJ| |�}||k r~| j|||d� | �||||� d}|S )NF)rJ rL T)r( rI r r r7 rN rZ r@ )r �oldpath�newpathrJ rL rP rE rM r r r �moveB s
z Persist.movec C s
t | |�S )zv
Rebase the database hierarchy.
@return: A L{RootedPersist} using this L{Persist} as parent.
)r �r r r r r �root_atR s zPersist.root_at)NN)N)FFF)FFF)NFFF)FF)FFF)FF)r r
r �__doc__r r! r$ r& �property�readonly�modifiedr' r( r r6 r7 rH rN rO rQ r; r@ rX rZ r_ ra r r r r r - s*
"
+
%
c @ s� e Zd ZdZdd� Zedd� �Zedd� �Zdd� Ze d d d fd
d �Z
dd d
�Z d dd�Z d dd�Z
d dd�Ze d d fdd�Zd dd�Zdd� ZdS ) r ax Root a L{Persist}'s tree at a particular branch.
This class shares the same interface of L{Persist} and provides a shortcut
to access the nodes of a particular branch in a L{Persist}'s tree.
The chosen branch will be viewed as the root of the tree of the
L{RootedPersist} and all operations will be forwarded to the parent
L{Persist} as appropriate.
c C s& || _ t|t�r t|�| _n|| _dS )z�
@param parent: the parent L{Persist}.
@param root: a branch of the parent L{Persist}'s tree, that
will be used as root of this L{RootedPersist}.
N)�parentrI r r �root)r rf rg r r r r f s
zRootedPersist.__init__c C s | j jS r )rf rd r r r r �<lambda>r � zRootedPersist.<lambda>c C s | j jS r )rf re r r r r rh s ri c C s | j �� d S r )rf r( r r r r r( u s z RootedPersist.assert_writableFc C s, t |t�rt|�}| j�| j| ||||�S r )rI r r rf rO rg )r r rM rJ rK rL r r r rO x s
zRootedPersist.hasc C s* t |t�rt|�}| j�| j| |||�S r )rI r r rf rQ rg )r r rJ rK rL r r r rQ } s
zRootedPersist.keysNc C s, t |t�rt|�}| j�| j| ||||�S r )rI r r rf r; rg )r r rC rJ rK rL r r r r; � s
zRootedPersist.getc C s* t |t�rt|�}| j�| j| |||�S r )rI r r rf r@ rg �r r rM rJ rL r r r r@ � s
zRootedPersist.setc C s, t |t�rt|�}| j�| j| ||||�S r )rI r r rf rX rg )r r rM rW rJ rL r r r rX � s
zRootedPersist.addc C s* t |t�rt|�}| j�| j| |||�S r )rI r r rf rZ rg rj r r r rZ � s
zRootedPersist.removec C sB t |t�rt|�}t |t�r$t|�}| j�| j| | j| ||�S r )rI r r rf r_ rg )r r] r^ rJ rL r r r r_ � s
�zRootedPersist.movec C s$ t |t�rt|�}| j�| j| �S r )rI r r rf ra rg r` r r r ra � s
zRootedPersist.root_at)FFF)NFFF)FF)FFF)FF)r r
r rb r rc rd re r( r7 rO rQ r; r@ rX rZ r_ ra r r r r r [ s
z(\[-?\d+\])|(?<!\\)\.c C s� d| krd| kr| fS g }t | �}|D ]p}|r&|d dkr�|d dkr�z|�t|dd� �� W q� tk
r� td| ��Y q�X q&|�|�dd�� q&t|�S ) a� Convert a L{Persist} path string to a path tuple.
Examples:
>>> path_string_to_tuple("ab")
("ab",)
>>> path_string_to_tuple("ab.cd")
("ab", "cd"))
>>> path_string_to_tuple("ab[0][1]")
("ab", 0, 1)
>>> path_string_to_tuple("ab[0].cd[1]")
("ab", 0, "cd", 1)
Raises L{PersistError} if the given path string is invalid.
�.�[r rY �]� zInvalid path index: %r�\.)�
_splitpath�appendrA �
ValueErrorr �replace�tuple)r rP �tokens�tokenr r r r � s c C sP g }| D ]<}t |�tkr.|d d| 7 < q|�t|��dd�� qd�|�S )NrY z[%d]rk ro )r> rA rq r? rs �join)r rP rG r r r r � s c @ sd e Zd ZdZdd� Zdd� Zdd� Zefdd �Zd
d � Z d d
� Z
dd� Z dd� Z dd� Z
dd� ZdS )�BackendaD
Base class for L{Persist} backends implementing hierarchical storage
functionality.
Each node of the hierarchy is an object of type C{dict}, C{list}
or C{tuple}. A node can have zero or more children, each child can be
another node or a leaf value compatible with the backend's serialization
mechanism.
Each child element is associated with a unique key, that can be used to
get, set or remove the child itself from its containing node. If the node
object is of type C{dict}, then the child keys will be the keys of the
dictionary, otherwise if the node object is of type C{list} or C{tuple}
the child element keys are the indexes of the available items, or the value
of items theselves.
The root node object is always a C{dict}.
For example:
>>> backend = Backend()
>>> root = backend.new()
>>> backend.set(root, "foo", "bar")
'bar'
>>> egg = backend.set(root, "egg", [1, 2, 3])
>>> backend.set(egg, 0, 10)
10
>>> root
{'foo': 'bar', 'egg': [10, 2, 3]}
c C s t �d S r ��NotImplementedErrorr r r r r � s z Backend.newc C s t �d S r ry )r r/ r r r r � s z Backend.loadc C s t �d S r ry )r r/ rT r r r r6 � s z Backend.savec C sz t |�tkr|�||�}n\t |�ttfkrrt |�tkr^z || }W qp tk
rZ |}Y qpX qv||krl|}qv|}nt}|S )z(Lookup a child in the given node object.)r> �dictr; rt r9 rA �
IndexErrorr< )r rB rG Z_markerrF r r r r; � s z Backend.getc C s� t |�tkr| }||< nnt |�tkr�t |�tkr�t|�}||krR|�d� |}n$|dk rvt|�|krv|�dd� d}| }||< nt}|S )z:Set the value of the given child in the given node object.Nr ) r> r{ r9 rA r= rq �abs�insertr< )r rB rG rM rF Zlenobjr r r r@ s
z Backend.setc s� d}t |�tkr$� |kr�|� = d}nnt |�tkr�|sft � �tkrfz|� = d}W q� tk
rb Y q�X q�� |kr�� fdd�|D �|dd�< d}nt}|S )z�Remove a the given child in the given node object.
@param isvalue: In case the node object is a C{list}, a boolean
indicating if C{elem} is the index of the child or the value
of the child itself.
FTc s g | ]}|� kr|�qS r r )�.0�x�rG r r �
<listcomp>1 s z"Backend.remove.<locals>.<listcomp>N)r> r{ r9 rA r| r< )r rB rG r\ rP r r� r rZ s" zBackend.removec C s t |�ttfkrt�|�S |S )zCopy a node or a value.)r> r{ r9 r8 �deepcopy)r rM r r r r8 7 s
z Backend.copyc C s | S )z.Whether the given node object has no children.r )r rB r r r r[ = s z
Backend.emptyc C s t |dd�}|r||�S tS )z?Whether the given node object contains the given child element.� __contains__N)�getattrr< )r rB rG �containsr r r rO A s z Backend.hasc C s2 t |dd�}|r|� S t|�tkr.tt|��S tS )z?Return the keys of the child elements of the given node object.rQ N)r� r> r9 �ranger= r< )r rB rQ r r r rQ H s z Backend.keysN)r r
r rb r r r6 r7 r; r@ rZ r8 r[ rO rQ r r r r rx � s rx c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
r c C s ddl m} || _d S )Nr )�cPickle)Zlandscape.lib.compatr� �_pickle)r r� r r r r T s zPickleBackend.__init__c C s i S r r r r r r r X s zPickleBackend.newc
C s. t |d��}| j�|�W 5 Q R � S Q R X d S �N�rb)�openr� r �r r/ �fdr r r r [ s zPickleBackend.loadc C s* t |d��}| j�||d� W 5 Q R X d S )N�wb� )r� r� �dump�r r/ rT r� r r r r6 _ s zPickleBackend.saveN�r r
r r r r r6 r r r r r R s c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
r c C s ddl m} || _d S )Nr )�bpickle)Z
landscape.libr� �_bpickle)r r� r r r r f s zBPickleBackend.__init__c C s i S r r r r r r r j s zBPickleBackend.newc
C s2 t |d�� }| j�|�� �W 5 Q R � S Q R X d S r� )r� r� �loads�readr� r r r r m s zBPickleBackend.loadc C s, t |d��}|�| j�|�� W 5 Q R X d S )Nr� )r� �writer� �dumpsr� r r r r6 q s zBPickleBackend.saveNr� r r r r r d s )r rU r8 �reZtwisted.python.compatr �__all__�objectr7 r- r r
r r �compile�splitrp r r rx r r r r r r �<module> s2 � 0I