/opt/cloudlinux/venv/lib/python3.11/site-packages/guppy/heapy/__pycache__
Edit: /opt/cloudlinux/venv/lib/python3.11/site-packages/guppy/heapy/__pycache__/UniSet.cpython-311.pyc (122343B)
§
¬Ë
à(]Åã óD — d dl mZ d dlmZ G d„ de¦ « Z G d„ de¦ « Z G d„ de¦ « Z G d „ d
e¦ « Z G d„ de¦ « Z G d
„ de¦ « Z
G d„ de¦ « Z G d„ d¦ « Z G d„ de¦ « Z
G d„ de
¦ « Z G d„ de¦ « Z G d„ de¦ « Z G d„ de¦ « Z G d„ de
¦ « Z G d„ d e
¦ « Z G d!„ d"e¦ « Z G d#„ d$e
¦ « Z G d%„ d&¦ « Zd'„ fd(„Zd)„ fd*„Z G d+„ d,¦ « Zd-S ).é )Úreduce)Úproperty_expc ó> — e Zd ZdZdZdZdZd„ ZeZd„ Z d„ Z
d„ Zd „ Zd
„ Z
d„ Zd„ Zd
„ Zd„ Zd„ Zd„ Zd„ Zd„ Zd„ Zd„ ZeZd„ Zd„ Zd„ Zd„ Zd„ ZeZ ed„ d¬¦ « Z d„ Z! ed„ ¦ « Z"d„ Z#d „ Z$d!„ Z%d"„ Z&d#„ Z'd$„ Z( ed%„ d&¬¦ « Z) ed'„ d(¬¦ « Z*d)S )*ÚUniSet)Ú_hiding_tag_ÚfamÚ_origin_z#heapy_UniSet.html#heapykinds.UniSetÚ zÙnodes: ImmNodeSet
The actual objects contained in x. These are called nodes because
they are treated with equality based on address, and not on the
generalized equality that is used by ordinary builtin sets or dicts.c ó: — | j d| |¦ « S )z,
Return the intersection of self and other.
Úand©r Úc_binop©ÚselfÚothers úf/builddir/build/BUILD/cloudlinux-venv-1.0.12/venv/lib64/python3.11/site-packages/guppy/heapy/UniSet.pyÚ__and__zUniSet.__and__ s € ð Œx×Ò t¨UÑ3Ô3Ð3ó c ó: — | j | ||¦ « S ©N)r Úc_call©r ÚargsÚkwdss r Ú__call__zUniSet.__call__ s € ¨d¬h¯oªo¸dÀDÈ$Ñ.OÔ.OÐ'Or c ó8 — | j | |¦ « S )z<
Return True if other is a member of self, False otherwise.
)r Ú
c_containsr s r Ú__contains__zUniSet.__contains__ s € ð Œx×"Ò" 4¨Ñ/Ô/Ð/r c ó — | |k o| |k S )zJ
Return True if self contains the same elements as other,
False otherwise.© r s r Ú__eq__z
UniSet.__eq__! s € ð �uŠ}Ð. ¨¢Ð.r c ó6 — | j | ¦ « S )zh
Return an hash based on the kind of the set of self and
the addresses of its elements, if any.
)r Úc_hash©r s r Ú__hash__zUniSet.__hash__' s € ð
Œx�Š˜tÑ$Ô$Ð$r c ó8 — | j d| ¦ « S )z
Return the complement of self.
Úinvert)r Úc_unopr$ s r Ú
__invert__zUniSet.__invert__. s € ð Œx�Š˜x¨Ñ.Ô.Ð.r c ó¢ — | |u rdS t |t ¦ « s| j |¦ « }| j | |¦ « S )zT
Return True if self is a superset of (and may be equal to) other,
False otherwise.
T)Ú
isinstancer r Úc_unisetÚc_ger s r Ú__ge__z
UniSet.__ge__4 óO € ð
�5ˆ=ˆ=Ø�4ݘ%¥Ñ(Ô(ð -Ø”H×%Ò% eÑ,Ô,ˆEØŒx�}Š}˜T 5Ñ)Ô)Ð)r c ó — | |k o| |k S )z[
Return True if self is a strict (may not be equal to) superset of other.
False otherwise.
r r s r Ú__gt__z
UniSet.__gt__? ó € ð
�uŠ}Ð2 T¨U¢]Ð!2Ð2r c óV ‡ ‡— ‰ j j j ˆˆ fd„¦ « S )z
Get family-specific attribute.
c ó: •— ‰j ‰‰ ¦ « S r )r Ú c_getattr)r r s €€r ú
z$UniSet.__getattr__..J s ø€ ¨t¬x×/AÒ/AÀ$ÈÑ/NÔ/N€ r )r ÚmodÚViewÚenterr s ``r Ú__getattr__zUniSet.__getattr__F s. øø€ ð ŒxŒ|Ô ×&Ò&Ð'NÐ'NÐ'NÐ'NÐ'NÑOÔOÐOr c ó¢ — | |u rdS t |t ¦ « s| j |¦ « }| j | |¦ « S )zR
Return True if self is a subset of (and may be equal to) other,
False otherwise.
T)r+ r r r, Úc_ler s r Ú__le__z
UniSet.__le__L r/ r c ó8 — | j | |¦ « S )aÙ
<>>
Return a 'mapping' set, which may be used for specification and test
purposes. It implements the syntax:
return_spec << argument_spec
The elements of the set returned are the callable objects that return
values in return_spec, when called with arguments according to
argument_spec. The return_spec may be any kind of sets that can test
for element containment. The argument_spec may be a set or a tuple. If
it is a set, it should be able to generate some examples, to allow the
mapping to be tested. When argument_spec is a set, the mapping will
have a single argument. Any number of arguments may be specified using
an argument_spec which is a tuple. The arguments are then specified
with sets, that should be able to generate examples. Special features
of the mapping such as optional arguments may be specified in the same
way as when using the 'mapping' function in the Spec.py module.
)r Úc_lshift)Úreturn_specÚ
argument_specs r Ú
__lshift__zUniSet.__lshift__W s € ð0 Œ×'Ò'¨°]ÑCÔCÐCr c ó — | |k o| |k S )zY
Return True if self is a strict (may not be equal to) subset of other,
False otherwise.
r r s r Ú__lt__z
UniSet.__lt__q r2 r c ó– — t |t ¦ « s| j |¦ « }| j | |¦ « S )ac
Return the cartesian product of self and other, which is the set of
pairs where the first element is a member of self and the second
element is a member of other.
NOTE: Unlike what one might expect from the way the cartesian product
may be defined mathematically, the operation as implemented here is
nonassociative, i.e.
a*b*c == (a*b)*c != a*(b*c)
In the mathematical case, a*b*c would be a set of triples, but here it
becomes a set of pairs with the first element in (a*b) and the second
element in c.
To create sets of triples etc. the cprod() factory function in Spec.py
could be used directly.
)r+ r r r, Úc_mulr s r Ú__mul__zUniSet.__mul__x sA € õ( ˜%¥Ñ(Ô(ð -Ø”H×%Ò% eÑ,Ô,ˆEØŒx�~Š~˜d EÑ*Ô*Ð*r c ó — | |k S )zN
Return True if self does not equal other,
False otherwise. See also: __eq__.
r r s r Ú__ne__z
UniSet.__ne__� s € ð
˜5’=Ð Ð r c ó6 — | j | ¦ « S )z=
Return True if self contains some element,
False otherwise.
)r Ú c_nonzeror$ s r Ú__bool__zUniSet.__bool__— s € ð
Œx×!Ò! $Ñ'Ô'Ð'r c ó: — | j d| |¦ « S )z%
Return the union of self and other.
Úorr
r s r Ú__or__z
UniSet.__or__ž s € ð Œx×Ò d¨EÑ2Ô2Ð2r c ó6 — | j | ¦ « S )zW
Return a string representing self. This is usually the same string
as from __str__.
)r Úc_reprr$ s r Ú__repr__zUniSet.__repr__¦ s € ð Œx�Š˜tÑ$Ô$Ð$r c ó6 — | j | ¦ « S )z�
Return a string representing self. The string is usually the same as the .brief
attribute, but a major exception is the IdentitySet class.
©r Úc_strr$ s r Ú__str__zUniSet.__str__® s € ð Œx�~Š~˜dÑ#Ô#Ð#r c ó– — t |t ¦ « s| j |¦ « }| j | |¦ « S )zq
Return the assymetrical set difference. That is, the set of elements
in self, except those that are in others.
©r+ r r r, Úc_subr s r Ú__sub__zUniSet.__sub__¶ óA € õ
˜%¥Ñ(Ô(ð -Ø”H×%Ò% eÑ,Ô,ˆEØŒx�~Š~˜d EÑ*Ô*Ð*r c ó– — t |t ¦ « s| j |¦ « }|j || ¦ « S )zç
Return the assymetrical set difference. That is, the
set of elements in other, except those that are in self.
This is like __sub__ except it handles the case when the left
argument is not a UniSet (but convertible to a UniSet).
rX r s r Ú__rsub__zUniSet.__rsub__¿ sA € õ ˜%¥Ñ(Ô(ð -Ø”H×%Ò% eÑ,Ô,ˆEØŒy�Š˜u dÑ+Ô+Ð+r c ó– — t |t ¦ « s| j |¦ « }| j | |¦ « S )zy
Return the symmetrical set difference. That is, the set of elements
that are in one of self or other, but not in both.
)r+ r r r, Úc_xorr s r Ú__xor__zUniSet.__xor__Ë r[ r c ó6 — | j | ¦ « S r )r Úc_get_briefr$ s r r6 zUniSet.Õ ó € d¤h×&:Ò&:¸4Ñ&@Ô&@€ r a A string representation of self, which is brief relative to the
representation returned by __str__ and __repr__. (In many cases it is
the same - both are then brief - but for IdentitySet objects the brief
representation is typically much shorter than the non-brief one.)©Údocc ó^ — | j j j j j | ¦ « S r )r r7 Ú_rootÚguppyre Ú
help_instancer$ s r Ú _get_helpzUniSet._get_helpÝ s# € ØŒxŒ|Ô!Ô'Ô+×9Ò9¸$Ñ?Ô?Ð?r c óh — | j j j j j j | ¦ « S r )r r7 rg rh ÚetcÚHelpÚdirr$ s r r6 zUniSet.à s$ € D¤H¤LÔ$6Ô$<Ô$@Ô$E×$IÒ$IÈ$Ñ$OÔ$O€ r c ó6 — | j | ¦ « S r )r Ú c_get_ckcr$ s r Úget_ckczUniSet.get_ckcâ s € ð Œx×!Ò! $Ñ'Ô'Ð'r c ó8 — | j | |¦ « S )z–
Return information about the 'origin' of the set. This was intended to be
used for specification purposes - is experimental, noncomplete, temporary.
)r Úc_derive_origin)r re s r Ú_derive_origin_zUniSet._derive_origin_ç s € ð
Œx×'Ò'¨¨cÑ2Ô2Ð2r c ó8 — | j | |¦ « S )zÀ
Return True if self and other are disjoint sets, False otherwise. This
is equivalent to calculating
(self & other) == Nothing
but may be implemented more efficiently in some cases.
)r Ú
c_disjointr s r ÚdisjointzUniSet.disjointî s € ð Œx×"Ò" 4¨Ñ/Ô/Ð/r c ó8 — | j | |¦ « S )aV
Return an iterable object or an iterator, which provides someexamples
of the elements of self. (A minimum of 2 examples should normally be
provided, but it may depend on some test configuration options.)
This is used for automatic test generation from specifications. The
env argument is according to specification of TestEnv in Spec.py,
)r Úc_get_examples)r Úenvs r Úget_exampleszUniSet.get_examplesù s € ð Œx×&Ò& t¨SÑ1Ô1Ð1r c ó6 — | j | ¦ « S )a•
Return a function that may be used to render the representation of the
elements of self. This is mainly intended for internal representation
support.
The function returned depends on the kind of elements self
contains. The rendering function is choosen so that it will be
appropriate, and can be used safely, for all objects of that kind.
For the most general kind of objects, the rendering function will only
return an address representation. For more specialized kinds, the
function may provide more information, and can be equivalent to the
builtin repr() when the kind is narrow enough that it would work for
all elements of that kind without exception.
)r Úc_get_renderr$ s r Ú
get_renderzUniSet.get_render s € ð Œx×$Ò$ TÑ*Ô*Ð*r c ó: — | j | ||¦ « S )ae
Test if self contains the element object. This is used mainly for
internal use for automatic (experimental) testing of specifications.
The env argument is according to specification of TestEnv in Spec.py.
It provides support for things that depends on the specific test
situation, such as a test reporting protocol. If test_contains did
find the element to be contained in self, the method will return
(usually True). But if the element was not contained in self, the
method should call env.failed(message), and return whatever may
be returned; though typically env.failed() would raise an exception.
)r Úc_test_contains)r Úelementrz s r Ú
test_containszUniSet.test_contains s € ð Œx×'Ò'¨¨g°sÑ;Ô;Ð;r c ó6 — | j | ¦ « S r )r Úc_get_biperr$ s r r6 zUniSet.% rc r zûA bipartitioning equivalence relation based on x. This may be used to
partition or classify sets into two equivalence classes:
x.biper(0) == x
The set of elements that are in x.
x.biper(1) == ~x
The set of elements that are not in x.
c ó6 — | j | ¦ « S r )r Úc_get_dictofr$ s r r6 zUniSet.0 s € t¤x×'<Ò'<¸TÑ'BÔ'B€ r a4 dictof: UniSet
If x represents a kind of objects with a builtin __dict__ attribute,
x.dictof is the kind representing the set of all those dict
objects. In effect, x.dictof maps lambda e:getattr(e, '__dict__') for
all objects e in x. But it is symbolically evaluated to generate a new
symbolic set (a Kind).N)+Ú__name__Ú
__module__Ú__qualname__Ú __slots__Ú
_help_url_Ú_instahelp_Ú
_doc_nodesr Ú__rand__r r r! r% r) r. r1 r: r= rB rD rG rI rL rO Ú__ror__rR rV rZ r] r` Ú__rxor__r Úbriefrj re rq rt rw r{ r~ r‚ ÚbiperÚdictofr r r r r s^ € € € € € Ø2€IØ6€JØ€KðH€Jð4ð 4ð 4ð €HàOÐOÐOð0ð 0ð 0ð/ð /ð /ð%ð %ð %ð/ð /ð /ð *ð *ð *ð3ð 3ð 3ðPð Pð Pð *ð *ð *ðDð Dð Dð43ð 3ð 3ð+ð +ð +ð0!ð !ð !ð(ð (ð (ð3ð 3ð 3ð €Gð%ð %ð %ð$ð $ð $ð+ð +ð +ð
,ð
,ð
,ð+ð +ð +ð €HàˆLÐ@Ð@ðEð
ñ
ô
€Eð@ð @ð @ð ˆ,ÐOÐOÑ
PÔ
P€Cð(ð (ð (ð
3ð 3ð 3ð 0ð 0ð 0ð 2ð 2ð 2ð+ð +ð +ð$
<ð
<ð
<ð
ˆLÐ@Ð@ðð
ñ
ô
€Eð ˆ\ÐBÐBððñ ô €F€F€Fr r c ó — e Zd ZdZd„ Zd„ ZdS )ÚKind©Úargc óH — || _ |j | _ || _ d | _ d S r )r r r— r )r r r— s r Ú__init__z
Kind.__init__= s&