⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.30
Server IP:
45.79.8.107
Server:
Linux localhost 5.15.0-140-generic #150-Ubuntu SMP Sat Apr 12 06:00:09 UTC 2025 x86_64
Server Software:
nginx/1.18.0
PHP Version:
8.1.2-1ubuntu2.21
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
lib
/
python3
/
dist-packages
/
debian
/
__pycache__
/
View File Name :
_util.cpython-310.pyc
o |a4 @ s d dl Z d dl mZ z d dlmZmZmZmZmZmZm Z m Z m Z m Z e dZ W n ey3 dZ Y nw dd ZG dd d eZeZd d ZG d d d ee ZG dd dee ZG dd deZdS ) N) ReferenceType) IterableOptionalGenericDictListIteratorTypeVar TYPE_CHECKINGAnyCallableTFc C s | d ur| S d S N )refr r ./usr/lib/python3/dist-packages/debian/_util.py resolve_ref s r c s\ e Zd ZdZddgZer fddZdd Zdd Zd d Z d d Z dd Z dd Z Z S )_CaseInsensitiveStringz Case insensitive string. str_lowerstr_origc s t t| | d| _d| _d S )N )superr __init__r r )selfs __class__r r r s z _CaseInsensitiveString.__init__c C s t | |}||_| |_|S r )str__new__r lowerr )clsstr_r r r r r $ s z _CaseInsensitiveString.__new__c C | j S r )r r r r r __str__, z _CaseInsensitiveString.__str__c C t | jS r )hashr r# r r r __hash__0 z _CaseInsensitiveString.__hash__c C s& z| j | kW S ty Y dS w )NF)r r AttributeErrorr otherr r r __eq__4 s z _CaseInsensitiveString.__eq__c C s | |k S r r r+ r r r __ne__; r) z _CaseInsensitiveString.__ne__c C r" r )r r# r r r r ? r% z _CaseInsensitiveString.lower)__name__ __module__ __qualname____doc__ __slots__r r r r$ r( r- r. r __classcell__r r r r r s r c C s | S r )r xr r r default_field_sort_keyG s r7 c @ s~ e Zd ZdZdd Zedd Zejdd Zdd Zd d d d Z d d d dZ e dd Z e dd Z dd Zdd ZdS )LinkedListNode)_previous_nodevalue next_node __weakref__c C s d | _ d | _|| _d S r )r9 r; r: r r: r r r r P zLinkedListNode.__init__c C r& r )r r9 r# r r r previous_nodeV z LinkedListNode.previous_nodec C s" |d ur t || _d S d | _d S r )weakrefr r9 r noder r r r? [ s "c C s" t | j| j d | _d | _| jS r )r8 link_nodesr? r; r: r# r r r remove` s zLinkedListNode.removeF) skip_currentc c , |r| j n| }|r|V |j }|s d S d S r )r; r rF rC r r r iter_nextg zLinkedListNode.iter_nextc c rG r )r? rH r r r iter_previousp rJ z LinkedListNode.iter_previousc C s |r| |_ | r || _d S d S r r? r; rL r r r rD y s zLinkedListNode.link_nodesc C s t | | t || d S r )r8 rD ) first_nodenew_node last_noder r r _insert_link s zLinkedListNode._insert_linkc C s* | |ur || j us J t| j || d S r )r? r8 rP r rN r r r insert_before z LinkedListNode.insert_beforec C s* | |ur || j us J t| || j d S r )r; r8 rP rQ r r r insert_after rS zLinkedListNode.insert_afterN)r/ r0 r1 r3 r propertyr? setterrE rI rK staticmethodrD rP rR rT r r r r r8 L s$ r8 c @ s e Zd ZdZdZd&ddZdd Zdd Zed d Z d d Z dd Z dd Z dd Z dd Zdd Zdd Zdd Zd d Zd d Zd d! Zd"d# Zd$d% ZdS )' LinkedListav Specialized linked list implementation to support the deb822 parser needs We deliberately trade "encapsulation" for features needed by this library to facilitate their implementation. Notably, we allow nodes to leak and assume well-behaved calls to remove_node - because that makes it easier to implement components like Deb822InvalidParagraphElement. head_node tail_node_sizeNc C s, d | _ d | _d| _|d ur| | d S d S Nr )rZ r[ r\ extend)r valuesr r r r s zLinkedList.__init__c C s | j d uS r )rZ r# r r r __bool__ r) zLinkedList.__bool__c C r" r )r\ r# r r r __len__ r% zLinkedList.__len__c C s | j d ur | j jS d S r )r[ r: r# r r r tail s zLinkedList.tailc C s" | j d u r td| | j d S )Nzpop from empty list)r[ IndexError remove_noder# r r r pop s zLinkedList.popc c s& | j }|d u r d S | E d H d S r )rZ rI )r rZ r r r iter_nodes s zLinkedList.iter_nodesc c s dd | D E d H d S )Nc s | ]}|j V qd S r r: ).0rC r r r <genexpr> z&LinkedList.__iter__.<locals>.<genexpr>)rf r# r r r __iter__ s zLinkedList.__iter__c c s0 | j }|d u r d S dd | D E d H d S )Nc s rg r rh )ri nr r r rj rk z*LinkedList.__reversed__.<locals>.<genexpr>)r[ rK )r r[ r r r __reversed__ s zLinkedList.__reversed__c C sl || j u r|j| _ | j d u rd | _n|| ju r"|j| _| jd us"J | jdks)J | jd8 _| d S )Nr )rZ r; r[ r? r\ rE rB r r r rd s zLinkedList.remove_nodec C s" | j d u r | |S | || j S r )rZ appendrR r= r r r insert_at_head s zLinkedList.insert_at_headc C sR t |}| jd u r|| _|| _n| jd usJ | j| || _| jd7 _|S )Nro )r8 rZ r[ rT r\ )r r: rC r r r rp s zLinkedList.appendc C | t||S r )insert_node_beforer8 r r: existing_noder r r rR zLinkedList.insert_beforec C rr r )insert_node_afterr8 rt r r r rT rv zLinkedList.insert_afterc C Z | j d u r td|jd us|jd urtd|| || j u r$|| _ | jd7 _|S Nz,List is empty; node argument cannot be validz&New node must not already be inserted!ro )rZ ValueErrorr; r? rR r\ r rN ru r r r rs z LinkedList.insert_node_beforec C rx ry )r[ rz r; r? rT r\ r{ r r r rw r| z LinkedList.insert_node_afterc C |D ]}| | qd S r )rp )r r_ vr r r r^ zLinkedList.extendc C s d | _ d | _d| _d S r] rY r# r r r clear r> zLinkedList.clearr )r/ r0 r1 r2 r3 r r` ra rU rb re rf rl rn rd rq rp rR rT rs rw r^ r r r r r rX s* rX c @ s~ e Zd ZdZd ddZdd Zdd Zd d Zd d Zd d Z dd Z eZ dd Z dd Z dd Zdd Zdd Zdd ZdS ) OrderedSetzA set-like object that preserves order when iterating over it We use this to keep track of keys in Deb822Dict, because it's much faster to look up if a key is in a set than in a list. Nc C s2 i | _ t | _|d u r g }|D ]}| | qd S r )_OrderedSet__tablerX _OrderedSet__orderaddr iterableitemr r r r # s zOrderedSet.__init__c C sF || vr!| j |}z|| j|< W d S ty | j | w d S r )r rp r Exceptionrd r r rC r r r r 1 s zOrderedSet.addc C s" | j | }| j |= | j| d S r )r r rd r r r r rE ? s zOrderedSet.removec C r& r )iterr r# r r r rl G r@ zOrderedSet.__iter__c C s t t| jS r )r reversedr r# r r r rn L s zOrderedSet.__reversed__c C r& r )lenr r# r r r ra Q r) zOrderedSet.__len__c C s || j v S r )r r r r r r __contains__U s zOrderedSet.__contains__c C r} r )r r r r r r^ ^ r zOrderedSet.extendc C | || jj dS )z2Re-order the given item so it is "last" in the setN)_reorderr rp r r r r order_lastd zOrderedSet.order_lastc C r )z3Re-order the given item so it is "first" in the setN)r r rq r r r r order_firsti r zOrderedSet.order_firstc 4 ||krt dj| | fdd dS )zTRe-order the given item so appears directly after the reference item in the sequence*Cannot re-order an item relative to itselfc j | S r )r rR r5 reference_noder r r <lambda>t z)OrderedSet.order_before.<locals>.<lambda>Nrz r r r r reference_itemr r r order_beforen zOrderedSet.order_beforec r )zURe-order the given item so appears directly before the reference item in the sequencer c r r )r rT r5 r r r r | r z(OrderedSet.order_after.<locals>.<lambda>Nr r r r r order_afterv r zOrderedSet.order_afterc C s. | j | }| j| ||j}|| j |< d S r )r r rd r: )r r reinserterrC rN r r r r ~ s zOrderedSet._reorderr )r/ r0 r1 r2 r r rE rl rn ra r rp r^ r r r r r r r r r r s r )rA r typingr r r r r r r r r r r ImportErrorr r r _strIr7 r8 rX objectr r r r r <module> s 0 -I