관리-도구
편집 파일: _pset.cpython-311.pyc
� �܋f= � � � d dl mZmZ d dlZd dlmZ G d� de� � Z ej e� � ej e� � e e� � � � Z d d�Z d � ZdS )� )�Set�HashableN)�pmapc �Z � � e Zd ZdZdZ� fd�Zd� Zd� Zd� Zd� Z d� Z d � Zd � Ze dd�� � Zd � Zd� Zd� Zd� Z G d� de� � Zd� Zd� Zej Zej Zej Zej Zej Zej Zej Zej Zej Z ej! Z!eZ"eZ#eZ$eZ%e Z&e!Z'ej( Z(� xZ)S )�PSeta! Persistent set implementation. Built on top of the persistent map. The set supports all operations in the Set protocol and is Hashable. Do not instantiate directly, instead use the factory functions :py:func:`s` or :py:func:`pset` to create an instance. Random access and insert is log32(n) where n is the size of the set. Some examples: >>> s = pset([1, 2, 3, 1]) >>> s2 = s.add(4) >>> s3 = s2.remove(2) >>> s pset([1, 2, 3]) >>> s2 pset([1, 2, 3, 4]) >>> s3 pset([1, 3, 4]) )�_map�__weakref__c �f �� t t | � � � | � � }||_ |S �N)�superr �__new__r )�cls�m�self� __class__s ��G/opt/cloudlinux/venv/lib64/python3.11/site-packages/pyrsistent/_pset.pyr zPSet.__new__ s, �� ��T�3���'�'��,�,���� ��� c � � || j v S r )r �r �elements r �__contains__zPSet.__contains__# s � ��$�)�#�#r c �* � t | j � � S r )�iterr �r s r �__iter__z PSet.__iter__&