File: //usr/lib64/python3.9/site-packages/rhsm/__pycache__/huffman.cpython-39.pyc
a
X�Zh* � @ s: d dl Z d dlZd dlmZmZmZmZ G dd� d�ZdS )� N)�Optional�List�Union�Tuplec @ s e Zd ZdZd$eeeeef ed ed ed dd�dd�Z e
d d d d�dd��Z e e
d �d
d ��Ze ed �d d
��Ze ed �dd��Ze
ed d d�dd��Zd e
d�dd�Zd e
d�dd�Zd e
d�dd�Zd e
d�dd�Zd e
d�d d �Zd e
d�d d �Zed �d d!�Zed �d"d#�ZdS )%� HuffmanNodez.
Represents a node in a Huffman tree.
N)�weight�value�left�right�parent�returnc C s" || _ || _|| _|| _|| _dS )a�
:param weight: number representing the weight/priority of this node
:param value: any value carried by this node, such as a symbol to be
used in reconstructing (decompressing) some data.
:param left: child node on the left, should have weight <= right
:param right: child node on the right, should have weight >= left
:param parent: parent node
N)r r r r
r )�selfr r r r
r � r �2/usr/lib64/python3.9/site-packages/rhsm/huffman.py�__init__ s
zHuffmanNode.__init__)r r
r c C s& | |j |j d||�}||_||_|S )a(
Combine two nodes according to Huffman's tree-building algorithm. The
weight of the left node should be <= that of the right node. If weights
are equal, left should be the node that was in the queue longer. This
creates a new node and sets it as the parent attribute of each child.
:param left: child node on the left, should have weight <= right
:param right: child node on the right, should have weight >= left
:return: new node that is the combination of left and right
N)r r )�clsr r
�noder r r �combine. s
zHuffmanNode.combine)r c C s | j du o| jdu S )zJ
:return: True iff left and right are None, else False
N)r
r �r
r r r �is_leaf@ s zHuffmanNode.is_leafc C s& | j du rt�| j j| u r dS dS dS )z[
:return: '0' if self is left of its parent, or '1' if right of parent.
N�0�1)r �AttributeErrorr r r r r �direction_from_parentG s
z!HuffmanNode.direction_from_parentc C sH | j std��g }| }|dur>|jdur6|�d|j� |j}qd�|�S )z^
:return: Huffman code for this node as a series of characters '0' and '1'
znode is not a leafNr � )r r r �insertr �join)r
ZturnsZ next_noder r r �codeS s
zHuffmanNode.code)�nodesr c s~ t �� � � fdd�|D �}t�|� t�|�\}}zt�|�\}}W n tyZ | Y S 0 t�|| �||�t� �f� q$dS )z�
:param nodes: list of HuffmanNode instances that will become leaves
in a Huffman tree.
:return: HuffmanNode instance that is the root node of the tree
c s g | ]}|t � �f�qS r )�next)�.0r �Zcounterr r �
<listcomp>m � z*HuffmanNode.build_tree.<locals>.<listcomp>N) � itertools�count�heapq�heapify�heappop�
IndexError�heappushr r )r r Zqueuer r% r
r r! r �
build_treeb s
zHuffmanNode.build_tree)�otherr c C s | j |j k S �N�r �r
r, r r r �__lt__{ s zHuffmanNode.__lt__c C s | j |j kS r- r. r/ r r r �__le__~ s zHuffmanNode.__le__c C s | j |j kS r- r. r/ r r r �__gt__� s zHuffmanNode.__gt__c C s | j |j kS r- r. r/ r r r �__ge__� s zHuffmanNode.__ge__c C s t |d�sdS | j|jkS )Nr F��hasattrr r/ r r r �__eq__� s
zHuffmanNode.__eq__c C s t |d�sdS | j|jkS )Nr Tr4 r/ r r r �__ne__� s
zHuffmanNode.__ne__c C s | j S r- )r r r r r �__hash__� s zHuffmanNode.__hash__c C s d| j | jf S )NzHuffmanNode(%d, "%s"))r r r r r r �__repr__� s zHuffmanNode.__repr__)NNNN)�__name__�
__module__� __qualname__�__doc__�intr �str�dictr r � classmethodr �property�boolr r r r r+ r0 r1 r2 r3 r6 r7 r8 r9 r r r r r s> � � r )r& r$ �typingr r r r r r r r r �<module> s