Edit File: UniSet.cpython-37.pyc
B �]� � @ sf d dl mZ d dlmZ G dd� de�ZG dd� de�ZG dd� de�ZG d d � d e�ZG d d � d e�Z G d d� de�Z G dd� de�Z G dd� d�Z G dd� de �Z G dd� de �ZG dd� de �ZG dd� de �ZG dd � d e �ZG d d � d e �ZG d d � d e �ZG d!d"� d"e�ZG d#d$� d$e �ZG d%d&� d&�Zd'd(� fd)d*�Zd+d(� fd,d-�ZG d.d/� d/�Zd0S )1� )�reduce)� property_expc @ sD e Zd ZdZdZdZdZdd� ZeZdd� Z d d � Z d d � Z d d� Z dd� Z dd� Zdd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� ZeZd%d&� Zd'd(� Zd)d*� Zd+d,� Z d-d.� Z e Z e d/d0� d1d2�Z d3d4� Z!e d5d0� �Z"d6d7� Z#d8d9� Z$d:d;� Z%d<d=� Z&d>d?� Z'd@dA� Z(e dBd0� dCd2�Z)e dDd0� dEd2�Z*dFS )G�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 C s | j �d| |�S )z, Return the intersection of self and other. �and)r �c_binop)�self�other� r �E/opt/alt/python37/lib64/python3.7/site-packages/guppy/heapy/UniSet.py�__and__ s zUniSet.__and__c O s | j �| ||�S )N)r �c_call)r �args�kwdsr r r �__call__ � zUniSet.__call__c C s | j �| |�S )z< Return True if other is a member of self, False otherwise. )r � c_contains)r r r r r � __contains__ s zUniSet.__contains__c C s | |ko| |kS )zJ Return True if self contains the same elements as other, False otherwise.r )r r r r r �__eq__! s z UniSet.__eq__c C s | 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 r r r �__hash__' s zUniSet.__hash__c C s | j �d| �S )z Return the complement of self. �invert)r �c_unop)r r r r � __invert__. s zUniSet.__invert__c C s0 | |kr dS 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_ge)r r r r r �__ge__4 s z UniSet.__ge__c C s | |ko| |k S )z[ Return True if self is a strict (may not be equal to) superset of other. False otherwise. r )r r r r r �__gt__? s z UniSet.__gt__c s �j jj�� �fdd��S )z Get family-specific attribute. c s �j ��� �S )N)r � c_getattrr )r r r r �<lambda>J r z$UniSet.__getattr__.<locals>.<lambda>)r �mod�ViewZenter)r r r )r r r � __getattr__F s zUniSet.__getattr__c C s0 | |kr dS 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_le)r r r r r �__le__L s z UniSet.__le__c C s | j �| |�S )a� <<This is about to change, does not work as one may expected. Nov 19 2005. >>> 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)Z return_specZ argument_specr r r � __lshift__W s zUniSet.__lshift__c C s | |ko| |k S )zY Return True if self is a strict (may not be equal to) subset of other, False otherwise. r )r r r r r �__lt__q s z UniSet.__lt__c C s$ 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_mul)r r r r r �__mul__x s zUniSet.__mul__c C s | |k S )zN Return True if self does not equal other, False otherwise. See also: __eq__. r )r r r r r �__ne__� s z UniSet.__ne__c C s | j �| �S )z= Return True if self contains some element, False otherwise. )r � c_nonzero)r r r r �__bool__� s zUniSet.__bool__c C s | j �d| |�S )z% Return the union of self and other. �or)r r )r r r r r �__or__� s z UniSet.__or__c C s | j �| �S )zW Return a string representing self. This is usually the same string as from __str__. )r �c_repr)r r r r �__repr__� s zUniSet.__repr__c C s | 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_str)r r r r �__str__� s zUniSet.__str__c C s$ 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_sub)r r r r r �__sub__� s zUniSet.__sub__c C s$ 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). )r r r r r7 )r r r r r �__rsub__� s zUniSet.__rsub__c C s$ 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_xor)r r r r r �__xor__� s zUniSet.__xor__c C s | j �| �S )N)r � c_get_brief)r r r r r# � r zUniSet.<lambda>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 C s | j jjjj�| �S )N)r r$ �_root�guppyr= Z help_instance)r r r r � _get_help� s zUniSet._get_helpc C s | j jjjjj�| �S )N)r r$ r> r? �etcZHelp�dir)r r r r r# � r c C s | j �| �S )N)r � c_get_ckc)r r r r �get_ckc� s zUniSet.get_ckcc C s | 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 r= r r r �_derive_origin_� s zUniSet._derive_origin_c C s | 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_disjoint)r r r r r �disjoint� s zUniSet.disjointc C s | 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 �envr r r � get_examples� s zUniSet.get_examplesc C s | 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_render)r r r r � get_render s zUniSet.get_renderc C s | 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 �elementrJ r r r � test_contains s zUniSet.test_containsc C s | j �| �S )N)r � c_get_biper)r r r r r# % 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 C s | j �| �S )N)r � c_get_dictof)r r r r r# 0 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_Z _instahelp_Z _doc_nodesr �__rand__r r r r r r r! r& r( r* r+ r- r. r0 r2 �__ror__r4 r6 r8 r9 r; �__rxor__r �briefr@ r= rD rF rH rK rM rP �biper�dictofr r r r r sT r c @ s e Zd ZdZdd� Zdd� ZdS )�Kind)�argc C s || _ |j| _|| _d | _d S )N)r r r_ r )r r r_ r r r �__init__= s z Kind.__init__c C s | j �| |�S )N)r �c_alt)r �cmpr r r �altC s zKind.altN)rS rT rU rV r` rc r r r r r^ : s r^ c @ sD e Zd ZdZdZdd� Zdd� Zdd� Zd d � ZdUdd�Z dVdd�Z dd� Z dd� Z dd� Z edd� dd �Zed d� d d �Zed d� d d �Zed!d� d"d �Zed#d� d$d �Zed%d� d&d �Zed'd� d(d �Zed)d� d*d �Zed+d� d,d �Zed-d� d.d �Zed/d� d0d �Zed1d� d2d �Zed3d� d4d �Zed5d� d6d �Z ed7d� d8d � Z Z ed9d� d:d �Z ed;d� d<d �Z ed=d� d>d �Z!ed?d� d@d �Z"edAd� dBd �Z#edCd� dDd �Z$edEd� dFd �Z%edGd� dHd �Z&edId� dJd �Z'edKd� dLd �Z(ee dMd �Z)ee dNd �Z*ee dOd �Z*ee dPd �Z+edQd� dRd �Z,edSd� dTd �Z-d S )W� IdentitySet)�_er� _partitionz(heapy_UniSet.html#heapykinds.IdentitySetc C s | j �| |�S )N)r � c_getitem)r �idxr r r � __getitem__K r zIdentitySet.__getitem__c C s | j �| �S )N)r �c_len)r r r r �__len__L r zIdentitySet.__len__c C s | j �| �S )N)r �c_iter)r r r r �__iter__M r zIdentitySet.__iter__c C s | j �| �S )z{ Return a string representating self. This differs from the .brief attribute in that it is a tabular representation. ... )r r5 )r r r r r6 O s zIdentitySet.__str__Nr Fc C s | j j�| ||||||||� S )a� x.get_rp(depth=None, er=None, imdom=0, bf=0, src=None, stopkind=None, nocyc=False, ref=None) Return an object representing the pattern of references to the objects in X. The returned object is of kind ReferencePattern. Arguments depth The depth to which the pattern will be generated. The default is taken from depth of this module. er The equivalence relation to partition the referrers. The default is Clodo. imdom If true, the immediate dominators will be used instead of the referrers. This will take longer time to calculate, but may be useful to reduce the complexity of the reference pattern. bf If true, the pattern will be printed in breadth-first order instead of depth-first. (Experimental.) src If specified, an alternative reference source instead of the default root. stopkind The referrers of objects of kind stopkind will not be followed. nocyc When True, certain cycles will not be followed. ref See also rp (a shorthand for common cases) )r �RefPat�rp) r �depth�er�imdomZbf�srcZstopkindZnocyc�refr r r �get_rpZ s "zIdentitySet.get_rpr c C s | j j�| |||�S )a? x.get_shpaths(draw:[src, avoid_nodes, avoid_edges]) -> Paths Return an object containing the shortest paths to objects in x. The optional arguments are: src:IdentitySet An alternative source set of objects avoid_nodes:IdentitySet Nodes to avoid avoid_edges:NodeGraph Edges to avoid )r �Path�shpaths)r rs Z avoid_nodesZ avoid_edgesr r r � get_shpaths s zIdentitySet.get_shpathsc C s | j �| |�S )z< x.by(er) -> A copy of x, but using er for equiv. relation. )r �get_by)r rq r r r �by� s zIdentitySet.byc C s | j |�| j�j S )N)�statrz rq )r r r r r �diff� s zIdentitySet.diffc O s | j j||� dS )zD Dump statistical data to a file Shorthand for .stat.dump N)r{ �dump)r r r r r r r} � s zIdentitySet.dumpc C s | � d�S )N�Clodo)rz )r r r r r# � r zIdentitySet.<lambda>z=A copy of self, but with 'Clodo' as the equivalence relation.)r= c C s | � d�S )N�Idset)rz )r r r r r# � r z�A copy of self, but with 'Idset' as the equivalence relation. Note This is mainly for special purpose internal use. The Id equivalence relation is more efficient when partitioning large sets.c C s | � d�S )NZId)rz )r r r r r# � r z:A copy of self, but with 'Id' as the equivalence relation.c C s | � d�S )N�Module)rz )r r r r r# � r z>A copy of self, but with 'Module' as the equivalence relation.c C s | � d�S )NZRcs)rz )r r r r r# � r z;A copy of self, but with 'Rcs' as the equivalence relation.c C s | � d�S )N�Size)rz )r r r r r# � r z<A copy of self, but with 'Size' as the equivalence relation.c C s | � d�S )N�Type)rz )r r r r r# � r z<A copy of self, but with 'Type' as the equivalence relation.c C s | � d�S )N�Unity)rz )r r r r r# � r z=A copy of self, but with 'Unity' as the equivalence relation.c C s | � d�S )NZVia)rz )r r r r r# � r z< A copy of self, but with 'Via' as the equivalence relation.c C s | j �| �S )N)r �get_er)r r r r r# � r zUThe equivalence relation used for partitioning when representing / printing this set.c C s t | j�S )N)�len�nodes)r r r r r# � r z,The number of individual objects in the set.c C s | j j�| �S )N)r r% �dominos)r r r r r# � r z�The set 'dominated' by a set of objects. This is the objects that will become deallocated, directly or indirectly, when the objects in the set are deallocated. See also: domisize.c C s | j j�| �S )N)r r% �domisize)r r r r r# � r z�The dominated size of a set of objects. This is the total size of memory that will become deallocated, directly or indirectly, when the objects in the set are deallocated. See also: dominos, size. c C s | j j�| �S )N)r r% rr )r r r r r# � r z�The immediate dominators of a set of objects. The immediate dominators is a subset of the referrers. It includes only those referrers that are reachable directly, avoiding any other referrer.c C s | j j�| �S )N)r r% �indisize)r r r r r# � r z�The total 'individual' size of the set of objects. The individual size of an object is the size of memory that is allocated directly in the object, not including any externally visible subobjects. See also: domisize.c C s | j | S )N)rq )r r r r r# � r z�The kind of objects in the set. The kind is the union of the element-wise classifications as determined by the equivalence relation in use by the set.c C s t | �S )N)� MappingProxy)r r r r r# � r a� An object that can be used to map operations to the objects in self, forming a new set of the result. The returned object is an instance of MappingProxy. This works currently as follows: o Getting an attribute of the MappingProxy object will get the attribute from each of the objects in the set and form a set of the results. If there was an exception when getting some attribute, it would be ignored. o Indexing the MappingProxy object will index into each of the objects in the set and return a set of the results. Exceptions will be ignored. Example: >>> hp.iso({'a':'b'}, {'a':1}).maprox['a'].byid Set of 2 objects. Total size = 40 bytes. Index Size % Cumulative % Kind: Name/Value/Address 0 28 70.0 28 70.0 str: 'b' 1 12 30.0 40 100.0 int: 1 >>> <This is an experimental feature, so the name is intentionally made mystically-sounding, and is a shorthand for 'mapping proxy'.>c C s | j �| �S )N)r �get_more)r r r r r# � r z�An object that can be used to show more lines of the string representation of self. The object returned, a MorePrinter instance, has a string representation that continues after the end of the representation of self.c C s | j �| �S )N)r � get_owners)r r r r r# r z�The set of objects that 'own' objects in self. The owner is defined for an object of type dict, as the object (if any) that refers to the object via its special __dict__ attribute.c C s | j �| �S )N)r � get_partition)r r r r r# r a� A partition of the set of objects in self. The set is partitioned into subsets by equal kind, as given by a equivalence relation. Unless otherwise specified, the equivalence relation used is 'byclodo', which means it classifies 'by type or dict owner'. Different equivalence relations are specified for sets created by the 'by_...' attributes of any IdentitySet object. The value is an instance of guppy.heapy.Part.Partition.c C s | j �| �S )N)r � get_parts)r r r r r# r z�An iterable object, that can be used to iterate over the 'parts' of self. The iteration order is determined by the sorting order the set has, in the table printed when partitioned.c C s | � | j�S )N)rx � referrers)r r r r r# r z;The paths from the direct referrers of the objects in self.c C s | j �| �S )N)� referentsrx )r r r r r# r z2The paths to the referents of the objects in self.c C s | j j�| �S )N)r r% r� )r r r r r# r zOThe set of objects that are directly referred to by any of the objects in self.c C s | j j�| �S )N)r r% r� )r r r r r# r zEThe set of objects that directly refer to any of the objects in self.zprp: ReferencePattern An object representing the pattern of references to the objects in X. See also get_rpzsx.shpaths: Paths An object containing the shortest paths to objects in x. Synonym sp See also get_shpathsznx.sp: Paths An object containing the shortest paths to objects in x. Synonym sp See also get_shpathszsx.sp: Paths An object containing the shortest paths to objects in x. Synonym shpaths See also get_shpathsc C s | j �� S )N)� partitionZget_stat)r r r r r# F r z�x.stat: Stat An object summarizing the statistics of the partitioning of x. This is useful when only the statistics is required, not the objects themselves. The statistics can be dumped to a file, unlike the set of objects itself.c C s | j �| �S )N)r � get_theone)r r r r r# N r z�theone: Anything The one object in a singleton set. In case the set does not contain exactly one object, the exception ValueError will be raised. )NNr r NNFN)NNr ).rS rT rU rV rW ri rk rm r6 ru rx rz r| r} r ZbyclodoZbyidsetZbyidZbymoduleZbyrcsZbysizeZbytypeZbyunityZbyviarq �countr� r� rr r� �size�kindZmaprox�more�ownersr� �partsZpathsinZpathsoutr� r� ro rw �spr{ �theoner r r r rd G s� $ rd c @ s e Zd ZdZdd� ZdS )�IdentitySetMulti)r� c C s || _ |j| _|| _d | _d S )N)r r r� r )r r r� r r r r` Y s zIdentitySetMulti.__init__N)rS rT rU rV r` r r r r r� V s r� c @ s< e Zd ZdZdZdd� Zedd� dd�Zd d � Zee�Z d S ) �IdentitySetSingleton)�_nodez1heapy_UniSet.html#heapykinds.IdentitySetSingletonc C s || _ |j| _|| _d | _d S )N)r r r� r )r r �noder r r r` d s z IdentitySetSingleton.__init__c C s | j �| jf�S )N)r � immnodesetr� )r r r r r# k r z IdentitySetSingleton.<lambda>z�x.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.)r= c C s | j S )N)r� )r r r r � _get_theoner s z IdentitySetSingleton._get_theoneN) rS rT rU rV rW r` r r� r� r� r r r r r� ` s r� c @ sR e Zd ZdZdZdZddd�Zdd� Zd d � Ze e�Z d d � Z e e �Z d d� Z dS )�EquivalenceRelationa� An equivalence relation is a binary relation between two elements of a set which groups them together as being "equivalent" in some way. An equivalence relation is reflexive, symmetric, and transitive. In other words, the following must hold for "~" to be an equivalence relation on X: * Reflexivity: a ~ a * Symmetry: if a ~ b then b ~ a * Transitivity: if a ~ b and b ~ c then a ~ c. An equivalence relation partitions a set into several disjoint subsets, called equivalence classes. All the elements in a given equivalence class are equivalent among themselves, and no element is equivalent with any element from a different class. )� classifier�erargsz0heapy_UniSet.html#heapykinds.EquivalenceRelationr c C s$ || _ |j| _|| _|| _d | _d S )N)r r r� r� r )r r r� r� r r r r` � s z EquivalenceRelation.__init__c C s | j �| |�S )N)r rg )r rh r r r ri � s z EquivalenceRelation.__getitem__c C s | j j�| �S )N)r � ClassifiersZ mker_dictof)r r r r � _get_dictof� s z EquivalenceRelation._get_dictofc C s | j j�| �S )N)r r� Z mker_refdby)r r r r � _get_refdby� s z EquivalenceRelation._get_refdbyc O s | j j| f|�|�S )N)r� Z get_sokind)r r r r r r �sokind� s zEquivalenceRelation.sokindN)r )rS rT rU �__doc__rV rW r` ri r� r r] r� Zrefdbyr� r r r r r� x s r� c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) r� )�_set_c C s || _ d S )N)r� )r �setr r r r` � s zMappingProxy.__init__c C s& |dkrt �| |�S | jj�| j|�S )Nr� )�object�__getattribute__r� r �maprox_getattr)r �namer r r r� � s z MappingProxy.__getattribute__c C s | j j�| j |�S )N)r� r �maprox_getitem)r r� r r r ri � s zMappingProxy.__getitem__N)rS rT rU rV r` r� ri r r r r r� � s r� c @ sf e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd d � Z dd� Z dd� Z dd� Z dd� Z dd� Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� Zd*i fd+d,�Zd-d.� Zd/d0� Zd1d2� Zd3d4� Z d5d6� Z d7d8� Z d9d:� Z d;d<� Z d=d>� Z!d?d@� Z"dAdB� Z#dCdD� Z$dEdF� Z%dGdH� Z&dIdJ� Z'dKdL� Z(dMdN� Z)dOdP� Z*dQdR� Z+dSdT� Z,dUdV� Z-dS )W�FamilyNc C sL || _ |jj| _|j| _|j| _|�� | _| j j| _|�| g�| _t | _ d S )N) r$ �_parent�Docr �typesr� � disjoints� export_dict�supersr^ �Set)r r$ r r r r` � s zFamily.__init__c C s | � | |�S )N)r� )r r_ r r r r � s zFamily.__call__c C s | j �| |�S )N)r� � add_origin)r �originr r r rF � s zFamily._derive_origin_c C s, | � | |�}| j�|| jj| f|�� �}|S )N)r� r� r� �callfunc)r �tup�rr r r �specotup� s zFamily.specotupc C s( | � | |�}| j�|| j�| |��}|S )N)r� r� r� r� )r r_ r� r r r �specoarg� s zFamily.specoargc C s, | � | |�}| j�|| jj| f|�� �}|S )N)r� r� r� r� )r r_ r� r� r r r � specoargtup� s zFamily.specoargtupc C sN | j | jj kr | jj �� | _ || j kr@| j | |k r@td| ��|| j |< d S )Nz Duplicate: %s)r� r$ �copy� ValueError)r r� �valuer r r � add_export� s zFamily.add_exportc C s t d| ��d S )Nz!No alternative set for family %s.)r� )r �arb r r r ra � s z Family.c_altc C s, t |t�s| �|�}t| d| �||�}|S )N�c_)r r r �getattr)r �opr� �br� r r r r � s zFamily.c_binopc C s t | d| �|�}|S )Nr� )r� )r r� r� r� r r r r � s z Family.c_unopc C s | j �||�S )N)r� r� )r r� r� r r r rE � s zFamily.c_derive_originc C s t d��d S )NzNot callable set)r� )r r� r r r r r r � s z Family.c_callc C s | j }||�|�@ |jk S )N)r$ �iso�Nothing)r r� r� r$ r r r r � s zFamily.c_containsc C s | j j�|�S )N)r$ r� r\ )r r� r r r rQ � s zFamily.c_get_biperc C s | j j�|�S )N)r$ r� r] )r r� r r r rR � s zFamily.c_get_dictofc C s ||@ | j jkS )N)r$ r� )r r� r� r r r rG � s zFamily.c_disjointc C s t | d|jjf �||�S )Nz_factordisjoint_%s)r� r �opname)r r� r� r r r �c_factordisjoint� s zFamily.c_factordisjointc C s d|| � |�f S )Nz[%s %s])r< )r r� rc r r r �c_get_brief_alt s zFamily.c_get_brief_altc C s | j �|�S )N)r$ �uniset_from_setcastable)r �Xr r r r s zFamily.c_unisetc C s g S )Nr )r r� rJ r r r rI s zFamily.c_get_examplesr c C s. | j }||kr"|| |f|�|�S | �||�S )N)r� � c_getattr2)r r� r� r r �dr r r r" s zFamily.c_getattrc C s t |��d S )N)�AttributeError)r r� r� r r r r� s zFamily.c_getattr2c C s | j jjS )N)r$ Z summary_str� str_address)r r� r r r rL s zFamily.c_get_renderc C s |j S )N)r[ )r r� r� r r r � c_get_str_for s zFamily.c_get_str_forc C s, |� � }t|d|�}t|dd �}|s(d}|S )N�im_func�_idpart_header�Value)rM r� )r r� �render�hr r r �c_get_idpart_header s zFamily.c_get_idpart_headerc C s d| S )Nz<%s>r )r r� r r r �c_get_idpart_label( s zFamily.c_get_idpart_labelc C s | � |�S )N)rL )r r� r r r �c_get_idpart_render+ s zFamily.c_get_idpart_renderc C s2 | � |�}|tkrdS t|d|�}t|d|�}|S )N�IDENTITYr� �_idpart_sortrender)r� �reprr� )r r� r� r� r r r �c_get_idpart_sortrender. s z Family.c_get_idpart_sortrenderc C s t |j�S )N)�hashr_ )r r� r r r r 6 s z Family.c_hashc C s t d��d S )Nziteration over non-sequence)� TypeError)r r� r r r rl 9 s z Family.c_iterc C s t d��d S )Nzlen() of unsized object)r� )r r� r r r rj < s z Family.c_lenc C s dS )NTr )r r� r r r r/ ? s zFamily.c_nonzeroc C s | j jj�||�S )N)r$ r� �SpecZcprod)r r� r� r r r r, B s z Family.c_mulc C s" | j �| �||�| j �d||��S )N�lshift)r� r� �c_mapZbinop)r r� r� r r r r) E s zFamily.c_lshiftc C s> t |t�rt|�}t |t�s"|f}|d|f }| jjjj|� S )Nz->)r �list�tupler$ r� r� �mapping)r r� r� �tr r r r� H s z Family.c_mapc C s | � |�S )N)r5 )r r� r r r r3 P s z Family.c_reprc C s | � |�S )N)r< )r r� r r r r5 S s z Family.c_strc C s || @ S )Nr )r r� r� r r r r7 V s z Family.c_subc C s2 | � ||�s.|�d| j|�|�|�|�f �S dS )Nz%s: %s does not contain %sT)r �failed� __class__r� )r r� r� rJ r r r rN Y s "zFamily.c_test_containsc C s || || B S )Nr )r r� r� r r r r: ^ s z Family.c_xorc C s |j �||�S )N)r �_or_TERM)r r� r� r r r �_or_ORa s z Family._or_ORc C s | � ||�S )N)� _and_ATOM)r r� r� r r r � _rand_ATOMd s zFamily._rand_ATOM).rS rT rU �superclr` r rF r� r� r� r� ra r r rE r r rQ rR rG r� r� r rI r" r� rL r� r� r� r� r� r rl rj r/ r, r) r� r3 r5 r7 rN r: r� r� r r r r r� � sV r� c @ s� e Zd ZdZdZdZdd� Zdd� Zdd� Zd d � Z d d � Z d d� Z dd� Z dd� Z dd� Ze Z ZZdd� Zdd� Ze ZZdd� Zdd � Zd d � Ze ZZd d � Zd!d"� Zd#d$� Z d%d&� Z d'd(� Z d)S )*� AtomFamilyTZATOMc C s t �| |� | j| gO _d S )N)r� r` r� )r r$ r r r r` m s zAtomFamily.__init__c C s |j �||�S )N)r r� )r r� r� r r r �c_andq s zAtomFamily.c_andc C s | j �||�S )N)r$ �fam_And)r r� r� r r r r� t s zAtomFamily._and_ATOMc C s |j �||�S )N)r r� )r r� r� r r r �_and_ANDw s zAtomFamily._and_ANDc C s | j �||�S )N)r$ r� )r r� r� r r r � _and_FACTORz s zAtomFamily._and_FACTORc C s |j �||�S )N)r r� )r r� r� r r r � _and_INVERT} s zAtomFamily._and_INVERTc C s |j j|j j@ p |j j|j j@ S )N)r r� r� )r r� r� r r r �_factordisjoint_ATOM� s z AtomFamily._factordisjoint_ATOMc C s |j �||�S )N)r r� )r r� r� r r r �_factordisjoint_INVERT� s z!AtomFamily._factordisjoint_INVERTc C s |j �||�S )N)r �_ge_ATOM)r r� r� r r r r' � s zAtomFamily.c_lec C s | j d k o| j |kS )N)r� )r r� r� r r r �_le_ATOM� s zAtomFamily._le_ATOMc C s |j �||�S )N)r r� )r r� r� r r r r � s zAtomFamily.c_gec C s |j jd k o|j j|kS )N)r r� )r r� r� r r r r� � s zAtomFamily._ge_ATOMc C s |j �||�S )N)r �_or_ATOM)r r� r� r r r �c_or� s zAtomFamily.c_orc C s | j �||�S )N)r$ �fam_Or)r r� r� r r r r� � s zAtomFamily._or_ATOMc C s | j �|�S )N)r$ � fam_Invert)r r� r r r �c_invert� s zAtomFamily.c_invertc C s || _ | j|jjO _d S )N)r� r� r )r r_ r r r � defrefining� s zAtomFamily.defrefiningc G s2 | j |O _ | j}|d k r.| j |jj O _ d S )N)r� r� r )r r �scr r r � defdisjoint� s zAtomFamily.defdisjointc C s | � |� | �|j� d S )N)r r r )r r_ r r r � defrefidis� s zAtomFamily.defrefidisc C s | j S )N)r� )r r r r � fam_union� s zAtomFamily.fam_unionN) rS rT rU �isatom�isfactorr� r` r� r� r� r� r� r� r� r' �_le_AND� _le_INVERTr� r � _ge_INVERT�_ge_ANDr� r� r� �_or_AND� _or_INVERTr� r r r r r r r r r� h s2 r� c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S ) � ArgAtomFamilyc C s | � |�\}}}|�|||�S )N)rC Z select_ids)r r� r� �cla�krb r r r �_and_ID� s zArgAtomFamily._and_IDc C s. | |j kr|j|jkS |j jd k o,|j j|kS )N)r r_ r� )r r� r� r r r r� � s zArgAtomFamily._ge_ATOMc C s* | |j kr|j|jkS | jd k o(| j|kS )N)r r_ r� )r r� r� r r r r� � s zArgAtomFamily._le_ATOMc C s | j |jdfS )Nz==)r� r_ )r r� r r r rC � s zArgAtomFamily.c_get_ckcN)rS rT rU r r� r� rC r r r r r � s r c @ s� e Zd ZdZdZdZdd� Zdd� Zdd� Zd d � Z d d � Z d d� Z e Z Z dd� Zdd� Zdd� Ze Z ZZdd� Zdd� Ze Z ZZdd� Zdd � Zd d � Ze Z Z d d � Z d!d"� Z d#d$� Z d%d&� Z!d'd(� Z"d)d*� Z#d+d,� Z$d-d.� Z%d/S )0� AndFamilyZANDFc C s< ||kr |S ||kr|S |j �||�r.| jjS | �||f�S )N)r r� r$ r� �_cons)r r� r� r r r r � s zAndFamily.__call__c C s< t |�dkr | �| t|��S t |�dkr0|d S | jjS d S )N� r )r� r� r� r$ r� )r r_ r r r r � s zAndFamily._consc C s~ g }xt|j D ]j}y|�|�}W n tk r2 Y q X x@t|�D ]4}x.|j D ]}||k rJ|�||�sJP qJW |�|� q>W q W |S )N)r_ rK Z CoverageErrorr� �contains�append)r r� rJ �ex�ai�e�eiZajr r r rI � s zAndFamily.c_get_examplesc C s |j �||�S )N)r r� )r r� r� r r r r� � s zAndFamily.c_andc C s x|j D ] }||M }qW |S )N)r_ )r r� r� r r r r� � s zAndFamily._and_ANDc C s^ g }xD|j D ]:}||kr |S ||kr&q |j�||�r<| jjS |�|� q W |�|� | �|�S )N)r_ r r� r$ r� r r )r r� r� �xsr r r r r� s zAndFamily._and_FACTORc C s@ |j d |@ }x,|j dd � D ]}|| jjkr0P ||@ }q W |S )Nr r )r_ r$ r� )r r� r� r r r r s zAndFamily._and_IDc C s |j �||�S )N)r r )r r� r� r r r r' s zAndFamily.c_lec C s\ ||@ }|j | k s&t|j�t|j�kr*dS x,|jD ]"}x |jD ]}||kr>P q>W dS q2W dS )NFT)r r� r_ )r r� r� �x�yr r r �_le_TERM s zAndFamily._le_TERMc C s |j �||�S )N)r r )r r� r� r r r r - s zAndFamily.c_gec C s x|j D ]}||ksdS qW dS )NFT)r_ )r r� r� r r r �_ge_TERM0 s zAndFamily._ge_TERMc C s |j �||�S )N)r r )r r� r� r r r r� 8 s zAndFamily.c_orc C s� | j j }x�t|j�D ]�\}}xzt|j�D ]l\}}||B |kr*| �|jd |� |j|d d � �}| �|jd |� |j|d d � �} || kr*|S q*W qW | j �||�S )Nr )r$ r� � enumerater_ r r� ) r r� r� ZOmega�ir �jZbjZaaZbbr r r r ; s && zAndFamily._or_ANDc C s| ||kr |S ||kr|S g }xP|j D ]"}||B }|jjrD|�|� q$P q$W | jj }x|D ] }||M }qZW |S | j�||�S )N)r_ r r r r$ r� r� )r r� r� r r Zaibr� r r r r r� H s zAndFamily._or_TERMc C s& | j j}x|jD ]}|| O }qW |S )N)r$ r� r_ )r r� r� r r r r r� _ s zAndFamily.c_invertc C s x|j D ]}||krdS qW dS )NFT)r_ )r r� r� r r r r r f s zAndFamily.c_containsc C s, x&|j D ] }|�||d�s|�d�S qW dS )Nr ZFailedT)r_ rP r� )r r� r� rJ r r r r rN l s zAndFamily.c_test_containsc C s ||@ | j jkS )N)r$ r� )r r� r� r r r � c_disjoint3r s zAndFamily.c_disjoint3c C s, x |j D ]}|�� }|r|S qW dd� }|S )Nc S s t t| ��S )N)�hex�id)�or r r r� { s z!AndFamily.c_get_render.<locals>.r)r_ rM )r �cr� r� r r r rL u s zAndFamily.c_get_renderc C s" dd� |j D �}dd�|� d S )Nc S s g | ] }|j �qS r )r[ )�.0r� r r r � <listcomp>� s z)AndFamily.c_get_brief.<locals>.<listcomp>z(%s)z & �))r_ �join)r r& �namesr r r r< s zAndFamily.c_get_briefc C s, | j j�dd� |jD ��jdt|j� dfS )Nc S s g | ] }|j �qS r )r\ )r' r r r r r( � s z'AndFamily.c_get_ckc.<locals>.<listcomp>)r z==)r$ r� �mker_andr_ r� r� )r r� r r r rC � s zAndFamily.c_get_ckcc C s dd� |j D �}dd�|� S )Nc S s g | ] }t |��qS r )r� )r' r r r r r( � s z$AndFamily.c_repr.<locals>.<listcomp>z(%s)z & )r_ r* )r r� �reprsr r r r3 � s zAndFamily.c_reprN)&rS rT rU r� r r r r rI r� r� r� r� r� r r' r r� r r r r r� r r r� r r� r� r r� r rN r" rL r< rC r3 r r r r r � s: r c @ s e Zd ZdZdZdZdd� Zdd� Zdd� Zd d � Z d d � Z d d� Z dd� Z dd� Z e Z ZZdd� Zdd� Zdd� Ze Z ZZdd� Zdd � Ze Z ZZd d � Z d d � Z e Z Z Z d!d"� Z!d#d$� Z"d%d&� Z#d'd(� Z$d)d*� Z%d+d,� Z&d-d.� Z'd/d0� Z(d1d2� Z)d3S )4�OrFamily�ORFc C s& ||kr |S ||kr|S | � ||f�S )N)r )r r� r� r r r r � s zOrFamily.__call__c C sb x$|D ] }|j jst|j t�st�qW t|�dkrBt�| t|��S t|�dkrV|d S | j j S d S )Nr r ) r r r r �AssertionErrorr� r� r r� r$ r� )r r_ r� r r r r � s zOrFamily._consc C s x|j D ]}||krdS qW dS )NTF)r_ )r r� r� r r r r r � s zOrFamily.c_containsc C s | j jj|j� jt|j�dfS )N�<)r$ �UseZfindexr_ r� r� )r r� r r r rC � s zOrFamily.c_get_ckcc # sz � fdd�|j D �}x`d}xPt|�D ]D\}}|d k r$yt|�V W n tk r^ d ||< Y q$X |d7 }q$W |sP qW d S )Nc s g | ]}t � �|���qS r )�iterrK )r' r )rJ r r r( � s z+OrFamily.c_get_examples.<locals>.<listcomp>r r )r_ r �next� StopIteration)r r� rJ Zexa�nr r r )rJ r rI � s zOrFamily.c_get_examplesc s �� |j� �fdd�d�S )Nc s �� | � d�S )NzSome x)rP )r )r� rJ r r r# � r z*OrFamily.c_test_contains.<locals>.<lambda>r1 )Zforsomer_ )r r� r� rJ r )r� rJ r rN � s zOrFamily.c_test_containsc C s& | |j kr| �||�S | �||�S d S )N)r �_and_OR� _and_TERM)r r� r� r r r r� � s zOrFamily.c_andc C s( | j j}x|jD ]}|||@ O }qW |S )N)r$ r� r_ )r r� r� r� r r r r8 � s zOrFamily._and_TERMc C s8 | j j}x*|jD ] }x|jD ]}|||@ O }q W qW |S )N)r$ r� r_ )r r� r� r� Zbir r r r7 � s zOrFamily._and_ORc C sF |j d }|j�||�}x(|j dd � D ]}||j�||�O }q(W |S )Nr r )r_ r r )r r� r� r r� r r r r � s zOrFamily._and_IDc C sL ||@ }|j | kr@|j |j k s2t|j�t|j�kr6dS dsHt�n||kS d S )NFr )r r� r_ r0 )r r� r� r r r r � s zOrFamily._ge_TERMc C s& |j | kr| �||�S | �||�S d S )N)r r' r )r r� r� r r r r � s z OrFamily.c_gec C s x|j D ]}||ksdS qW dS )NFT)r_ )r r� r� r r r r r' � s z OrFamily.c_lec C s |j �||�S )N)r r� )r r� r� r r r r� � s z OrFamily.c_orc C sN g }d}x,|j D ]"}||ks|�|� ||krd}qW |sD|�|� | �|�S )NFT)r_ r r )r r� r� r �ltr r r r� � s zOrFamily._or_TERMc C s t |j|j �}| �|�S )N)�maximalsr_ r )r r� r� r r r r r� s zOrFamily._or_ORc C s2 |j d }x |j dd � D ]}|| M }q W |S )Nr r )r_ )r r� r� r r r r r� s zOrFamily.c_invertc C sP | j �dd� |jD ��}t|�dkr0t|�d S dd� }d|_dd � |_|S d S ) Nc S s g | ] }|� � �qS r )rM )r' r� r r r r( s z)OrFamily.c_get_render.<locals>.<listcomp>r r c S s t t| ��S )N)r# r$ )r% r r r r� s z OrFamily.c_get_render.<locals>.r�Addressc S s t | �S )N)r$ )r r r r r# r z'OrFamily.c_get_render.<locals>.<lambda>)r$ � mutnodesetr_ r� r� r� r� )r r& Zrendersr� r r r rL s zOrFamily.c_get_renderc C s* dd� |j D �}|�� dd�|� d S )Nc S s g | ] }|j �qS r )r[ )r' r� r r r r( # s z(OrFamily.c_get_brief.<locals>.<listcomp>�(z | r) )r_ �sortr* )r r& r+ r r r r< " s zOrFamily.c_get_briefc C s dS )NZBriefr )r r� r r r r� ' s z OrFamily.c_get_idpart_headerc C s dS )Nz<mixed>r )r r� r r r r� * s zOrFamily.c_get_idpart_labelc s. | j jj}|j��j�i � � ��fdd�}|S )Nc sb �� | �}� �|�}|d krJ��|�}��|�j}|�� }||f}|� |< |\}}d||| �f S )Nz%s: %s)�classify�get�get_kindr[ rM )r r �brr� r� r� )�brmemor �clir r r� 4 s z,OrFamily.c_get_idpart_render.<locals>.render)r$ r2 r~ r� rD )r r� rq r� r )rC r rD r r� - s z OrFamily.c_get_idpart_renderc s. | j jj}|j��j�i � � ��fdd�}|S )Nc sp �� | �}� �|�}|d krP��|�}��|�j}|j�|�}||f}|� |< n|\}}|dkrh|| �} || fS )Nr� )r? r@ rA r[ r r� )r r rB r� r� r� )rC r rD r r r� K s z0OrFamily.c_get_idpart_sortrender.<locals>.render)r$ r2 r~ r� rD )r r� rq r� r )rC r rD r r� D s z OrFamily.c_get_idpart_sortrenderc C s& dd� |j D �}|�� dd�|� S )Nc S s g | ] }t |��qS r )r� )r' r r r r r( \ s z#OrFamily.c_repr.<locals>.<listcomp>z(%s)z | )r_ r> r* )r r� r- r r r r3 [ s zOrFamily.c_reprN)*rS rT rU r� r r r r r rC rI rN r� r8 r� r� r� r7 r r r� r r r r' r� r r r� r� r� r r r� r� rL r< r� r� r� r� r3 r r r r r. � s> r. c @ s� e Zd ZdZdZdZdd� Zdd� Zdd � Zd d � Z e Z d d � Z e Z Z dd� Zdd� Zdd� Zdd� ZeZdd� Zdd� Zdd� Ze Z ZZd d � ZeZd d � Ze Z Z d d!� Z d"d#� Z d$d%� Z d&d'� Z!d(d)� Z"d*S )+� InvertFamilyZINVERTFTc C s0 |j js t�|| jjkr | jjS t�| |�S d S )N)r r r0 r$ r� � NotNothingr� r )r r� r r r r f s zInvertFamily.__call__c C s |� |j|d�S )NrE )Ztest_contains_notr_ )r r� r� rJ r r r rN m s z InvertFamily.c_test_containsc C s ||j kS )N)r_ )r r� r� r r r r p s zInvertFamily.c_containsc C s |j �||�S )N)r r� )r r� r� r r r r� s s zInvertFamily.c_andc C s( |j |@ }|jjr| |�}| j�||�S )N)r_ r r r$ r� )r r� r� r r r r r� x s zInvertFamily._and_FACTORc C s |||j @ S )N)r_ )r r� r� r r r r � s zInvertFamily._and_IDc C s ||j kS )N)r_ )r r� r� r r r r� � s z!InvertFamily._factordisjoint_ATOMc C s dS )NFr )r r� r� r r r r� � s z#InvertFamily._factordisjoint_INVERTc C s |j �||�S )N)r r )r r� r� r r r r' � s zInvertFamily.c_lec C s dS )NFr )r r� r� r r r r� � s zInvertFamily._le_ATOMc C s |j |j kS )N)r_ )r r� r� r r r r � s zInvertFamily._le_INVERTc C s |j �|�S )N)r_ rH )r r� r� r r r r � s zInvertFamily.c_gec C s |j �||�S )N)r r )r r� r� r r r r� � s zInvertFamily.c_orc C s< |j |kr| jj S |j |@ }|| jjkr.|S | j�||�S )N)r_ r$ r� r� )r r� r� r r r r � _or_FACTOR� s zInvertFamily._or_FACTORc C s |j S )N)r_ )r r� r r r r� � s zInvertFamily.c_invertc C s |j �� S )N)r_ rM )r r� r r r rL � s zInvertFamily.c_get_renderc C s4 |j j}|�d�s,|�d�s,d|kr,d| }d| S )Nr= r1 � z(%s)z~%s)r_ r[ � startswith)r r� r6 r r r r< � s zInvertFamily.c_get_briefc C s |j jjddfS )Nr z!=)r_ r\ r� )r r� r r r rC � s zInvertFamily.c_get_ckcc C s dt |j� S )Nz~%s)r� r_ )r r� r r r r3 � s zInvertFamily.c_reprN)#rS rT rU r� r r r rN r r� r� r� r� r� r r� r� r' r r� r r r� r r r� r rG r� r r� rL r< rC r3 r r r r rE a s8 rE c @ s$ e Zd Zdd� Zdd� Zdd� ZdS )� FamilyFamilyc C s t �| |� | �ddd� � d S )N�unionc S s | j �� S )N)r_ r )r r r r r# � r z'FamilyFamily.__init__.<locals>.<lambda>)r� r` r� )r r$ r r r r` � s zFamilyFamily.__init__c C s t |t�o|j|jkS )N)r r r r_ )r r� r� r r r r � s zFamilyFamily.c_containsc C s d|j j S )Nz <Family: %s>)r_ r� )r r& r r r r< � s zFamilyFamily.c_get_briefN)rS rT rU r` r r< r r r r rJ � s rJ c @ sF e Zd Zdd� Zdd� ZdHdd�Zdd � Zd d � Zd d � Zdd� Z dd� Z dd� Z dd� Z dd� Z dd� Zdd� Zd d � Ze Z ZZd d � Ze Z Z ZZd d!� Zd"d#� Zd$d%� Zd&d'� Z d(d)� Z d*d+� Z d,d-� Z d.d/� Z d0d1� Z!d2d3� Z"d4d5� Z#d6d7� Z$d8d9� Z%d:d;� Z&d<d=� Z'd>d?� Z(dId@dA�Z)dJdBdC�Z*dDdE� Z+dFdG� Z,dS )K�IdentitySetFamilyc C sL t �| |� | �|j� |j| _|j| _|j| _|j| _|j| _|j | _ d S )N) r� r` r ZAnythingr� �Partrv rn r% r2 )r r$ r r r r` � s zIdentitySetFamily.__init__c O s | j |f|�S )N)r )r r r r r r r � s zIdentitySetFamily.__call__Nc C s2 | � |�}|s| jjS t| |�}|d k r.||_|S )N)r� r$ r� r� re )r r_ rq r� r r r r � s zIdentitySetFamily._consc C sH |j | kr | �|j|j@ �S |j | jjkr6| �||�S |j �||�S d S )N)r r r� r$ r� r� r )r r� r� r r r r� � s zIdentitySetFamily.c_andc C s. |j | kr | �|j|j@ �S |j �||�S d S )N)r r r� r )r r� r� r r r r� � s zIdentitySetFamily._and_ATOMc C s |j �||�S )N)r r )r r� r� r r r r� s zIdentitySetFamily._and_ANDc C s | � |j|j@ �S )N)r r� )r r� r� r r r r s zIdentitySetFamily._and_IDc C sB |j j| kr | �|j|j j �S || jjkr0|S |j�||�S d S )N)r_ r r r� r$ rF r )r r� r� r r r r� s z IdentitySetFamily._and_INVERTc C s | j jjj|jdfS )Nz<=)r$ r� r r� r� )r r� r r r rC s zIdentitySetFamily.c_get_ckcc C s t |j�S )N)r� r� )r r� r r r r s zIdentitySetFamily.c_hashc C s t d��d S )Nziteration over non-sequence)r� )r r� r r r rl s zIdentitySetFamily.c_iterc C s |j jS )N)r� Znumrows)r r� r r r rj s zIdentitySetFamily.c_lenc C s ||j kS )N)r� )r r� r� r r r r % s z IdentitySetFamily.c_containsc C s$ |j | k r|j �||�}|j|jkS )N)r r r� )r r� r� r r r r' ( s zIdentitySetFamily.c_lec C s@ |j | kr | �|j|jB �S ||j �||� }|j �||�S d S )N)r r r� r r� )r r� r� r r r r� / s zIdentitySetFamily.c_orc C s | � |�S )N)�get_str_summary)r r& r r r r< 8 s z IdentitySetFamily.c_get_briefc C s |j �� S )N)r� rM )r r� r r r rL ; s z IdentitySetFamily.c_get_renderc C s |j �|�S )N)r� Zget_set)r r� rh r r r rg > s zIdentitySetFamily.c_getitemc C s, | j jj�� }|j�|��|� |�� �� S )N) r$ r� �OutputHandlingZ output_bufferr r� Zppob�getvalue�rstrip)r r� �obr r r r5 A s zIdentitySetFamily.c_strc C sZ | j �� }x<|jD ]2}yt||�}W n tk r8 Y qX |�|� qW | �| j �|��S )N)r$ r< r� r� r� �addr r� )r r� r� �nsr �vr r r r� F s z IdentitySetFamily.maprox_getattrc C s\ | j �� }x>|jD ]4}y || }W n ttfk r: Y qX |�|� qW | �| j �|��S )N)r$ r< r� �KeyError� IndexErrorrS r r� )r r� rh rT r rU r r r r� Q s z IdentitySetFamily.maprox_getitemc C s dS )NzKind: Name/Value/Addressr )r r� r r r r� \ s z%IdentitySetFamily.c_get_idpart_headerc C s dS )Nr r )r r� r r r r� _ s z$IdentitySetFamily.c_get_idpart_labelc s � fdd�}|S )Nc s" � j �| �} | j�d��d�}|S )Nz<1 �>)r$ r� r[ �lstriprQ )r r� )r r r r� c s z5IdentitySetFamily.c_get_idpart_render.<locals>.renderr )r r� r� r )r r r� b s z%IdentitySetFamily.c_get_idpart_renderc C s g }t |t�r|�|� n�y|�d�}W n tk rD td��Y nX |dgkrTg }xb|D ]Z}y*|�� rr|�d�rzd| }t| j |�}W n t k r� t d| ��Y nX |�|� qZW |s�| j j }n,|d }x"t dt|��D ]}||| M }q�W |j|k �r| j|j|d�}|S ) N�&z.by(): Equivalence relation or string expected.r Zer_z;by(): No such equivalence relation defined in heapy.Use: %rr r )rq )r r� r �split� Exceptionr� �istitlerI r� r2 r� r� r� �ranger� rq r r� )r r� rq �ers�ss�sr r r r ry i s6 zIdentitySetFamily.get_byc C s4 y |j }W n$ tk r. | jjj}||_ Y nX |S )N)re r� r$ r2 r~ )r r� rq r r r r� � s zIdentitySetFamily.get_erc C s | j j�||j�S )N)r$ rO Zbasic_more_printerr� )r r� r r r r� � s zIdentitySetFamily.get_morec C s | j jjj�|�S )N)r$ r2 r~ r� r� )r r� r r r r� � s z IdentitySetFamily.get_ownersc C sH y |j }W n8 tk rB |jj�� |jj�||j�}||_ Y nX |S )N)rf r� r r% Z clear_checkrM r� rq )r r� �pr r r r� � s z IdentitySetFamily.get_partitionc C s |j �||�}|S )N)r r� )r r� r ra r r r �get_str_idpart� s z IdentitySetFamily.get_str_idpartc C s� g }|� d|j � |� |j�||�� |� d� |� | �|||td�|�� �� d�|�}t|�|kr~|d |d � d }|S )Nz%d z: r � z...)r r� r r� �get_str_renderedr� r* )r r� r � max_length�strsra r r r �get_str_refpat� s z IdentitySetFamily.get_str_refpatc C s� |d kr d}g }d}|� � }xZ|jD ]P}||�}|rZ|t|� d |krZ|d d7 < P |t|�d 7 }|�|� q$W |�� d�|�S )N�2 r � ���z...z, )rM r� r� r r> r* ) r r� r rf rg Zlensr� rb Zrsr r r re � s z"IdentitySetFamily.get_str_renderedc C s2 |d kr| j j}|d kr |j}|j}|j�|�}dd� |D �}tdd� |�}dt|�|j� ||�f }|d7 }t|�} g } xb|D ]Z\}}| � |||| �} t|�dkr�d|j || f } | � | � | t| �d 7 } | |kr�P q�W t| �dkr�| j d d� d � |d �| �d 7 }t|�|k�r.|d |d � d }|S )Nc S s g | ] \}}|�qS r r )r' r rU r r r r( � s z5IdentitySetFamily.get_str_summary.<locals>.<listcomp>c S s | |B S )Nr )r r r r r r# � r z3IdentitySetFamily.get_str_summary.<locals>.<lambda>z<%d %sz: r z <%d %s: %s>rd c S s | | � d�d � S )NrH )�index)r r r r r# � r )�keyz | rX � z...>)r$ �max_summary_lengthrq r� r� r� r r� r r� re r� r r> r* ) r r& rf rq r� �items�keysr ra ZbslenZbstrs�cssr r r rN � s4 z!IdentitySetFamily.get_str_summaryc C s dd� |j �� D �S )Nc S s g | ]}|�qS r r )r' r r r r r( � s z/IdentitySetFamily.get_parts.<locals>.<listcomp>)r� Zget_sets)r r� r r r r� � s zIdentitySetFamily.get_partsc C s( t |j�dkr t|j�d S td��d S )Nr r z theone requires a singleton set)r� r� r� r� )r r� r r r r� � s z IdentitySetFamily.get_theone)N)N)NN)-rS rT rU r` r r r� r� r� r r� rC r rl rj r r' r� r r r� r� r r r� r< rL rg r5 r� r� r� r� r� ry r� r� r� r� rc rh re rN r� r� r r r r rL � sJ rL c @ s� e Zd Zdd� Zdd� Ze Z Z Z ZZ dd� Z dd� Z e Z Z Zd d � Zd d � Zd d� Zdd� Ze Z ZZdd� Zdd� Zdd� Ze Z Z ZZ dd� Z dd� Z dd � Z d S ) � EmptyFamilyc C s t �| |� d S )N)rL r` )r r$ r r r r` � s zEmptyFamily.__init__c C s |S )Nr )r r� r� r r r r� � s zEmptyFamily.c_andc C s dS )NFr )r r� r� r r r r � s zEmptyFamily.c_containsc C s ||kr dS dS )NTFr )r r� r� r r r r � s zEmptyFamily.c_gec C s dS )Nz <Nothing>r )r r� r r r r< s zEmptyFamily.c_get_briefc C s d| j jjdf S )Nz%s%sr� )r$ r2 Zreprefix)r r� r r r r3 s zEmptyFamily.c_reprc C s t d�S )Nr )r3 )r r� r r r rl s zEmptyFamily.c_iterc C s dS )NTr )r r� r� r r r r' s zEmptyFamily.c_lec C s dS )Nr r )r r� r r r rj s zEmptyFamily.c_lenc C s dS )NFr )r r� r r r r/ s zEmptyFamily.c_nonzeroc C s |S )Nr )r r� r� r r r r� s zEmptyFamily.c_orc C s | � |�S )N)r< )r r� r r r r5 s zEmptyFamily.c_strc C s |S )Nr )r r� r� r r r r7 ! s zEmptyFamily.c_subc C s |S )Nr )r r� r� r r r r: $ s zEmptyFamily.c_xorN) rS rT rU r` r� r� r� r� r7 r r r r� r r r< r3 rl r' r� r r rj r/ r� r� r r r� r5 r7 r: r r r r rs � s$ rs c @ sd e Zd Zdd� Zdd� Zdd� Zdd� Zd d � Zd d � Zd d� Z dd� Z dd� Z dd� Z dd� Z dS )�EquivalenceRelationFamilyc C s& t �| |� t| _|j| _|j| _d S )N)r� r` r� r� r2 r� )r r$ r r r r` ) s z"EquivalenceRelationFamily.__init__c O s |||�}| � | |�}||_|S )N)r� rq )r � constructorr r Zclrq r r r r / s z"EquivalenceRelationFamily.__call__c C sh yt |�|��dkS tk rb y |�� }W n tk rB dS X |d j|ko\|d dkS Y nX d S )Nr Fr rj z==)r� rz r� rD r\ rq )r r� r� Zckcr r r r 7 s z$EquivalenceRelationFamily.c_containsc C s: |j }yt|d�}W n tk r0 t|��Y nX ||�S )NZget_attr_for_er)r� r� r� )r r� r� r� �gr r r r" C s z#EquivalenceRelationFamily.c_getattrc C s� |j | k rt�| ||�S g }x.||fD ]"}|jr>|�|j� q&|�|� q&W t|�}t|�dkrh|d S | j� |�}t |�|_|S )Nr r ) r r� r� r� �extendr �minimalsr� r� r, r� )r r� r� r_ r rq r r r r� K s z EquivalenceRelationFamily.c_andc C s |j | kr|j|jjkS dS )NF)r r� �super_classifiers)r r� r� r r r r� [ s z"EquivalenceRelationFamily._ge_ATOMc C s |j | kr|j|jjkS dS )NF)r r� ry )r r� r� r r r r� ` s z"EquivalenceRelationFamily._le_ATOMc C s |j j||�S )N)r� Z get_userkind)r r� r r r r r r e s z EquivalenceRelationFamily.c_callc C s d|j S )NzEquiv. relation %s)r� )r r� r r r r< h s z%EquivalenceRelationFamily.c_get_briefc C s |j �| j�|��S )N)r� Zrelimgr$ � nodeset_adapt)r r� rh r r r rg k s z#EquivalenceRelationFamily.c_getitemc C s |j �� S )N)r� Z get_reprname)r r� r r r r3 n s z EquivalenceRelationFamily.c_reprN)rS rT rU r` r r r" r� r� r� r r< rg r3 r r r r rt ( s rt c @ s� e Zd Zdd� Zd/dd�Zdd� Zdd � Zd e_ee_ d d � Z d e _ee _ dd� Z de _dd� Z de _dd� Z de _dd� Zde_dd� Zde_d d � Zd e_d d � Zde_d!d"� Zd#e_d$e_ eZd%d&� Zd'e_d0d(d)�Zde_d*d+� Zd,d-� e_d.S )1� Summary_strc & C s8 || _ |jj}i | _x2t|j�� �D ] \}}t|t�r$d| | j|< q$W x.t|j �� �D ] \}}t|t�rX|| j|< qXW i | _ x(dD ] }t ||� � d �}|| j |< q�W |j | jt| j|j| j|j| jt| jt| jt| j|j| j|j| jt | jt | jtd �| j|j | j |j | j!|j"| j#t$| j%t&| j%t'| jt| j(i| _)d S )Nztypes.%s)�module�functionr� )*r$ r� �_module�invtypes�sorted�__dict__rp r �type� __builtins__�shorter_invtypesr� � capitalize�NodeSet�str_address_len�bool�str_repr�BuiltinFunctionType�str_builtin_function�CodeType�str_code�complex�dict�float� FrameType� str_frame� FunctionType� str_function�intr� � MethodType� str_method� ModuleType� str_module� TracebackType� str_traceback�bytes� str_limrepr�strr� �str_type�table)r r$ r� r rU r� r� r r r r` s s@ zSummary_str.__init__Fc sT | j �|���d kr,t|t�r&| j�n| j�� rLd�jjjkrL� �fdd�S �S d S )N�longerc s �| � d�S )N)r� r )r )r� r r r r# � r z&Summary_str.__call__.<locals>.<lambda>) r� r@ � issubclassr� r� r� �__func__�__code__� co_varnames)r rm r� r )r� r r r � s zSummary_str.__call__c C s || j |< d S )N)r� )r r� �funcr r r � set_function� s zSummary_str.set_functionc C s t t|��S )N)r# r$ )r r r r r r� � s zSummary_str.str_addressr; c C s | � |�| �|� S )N)r� �str_len)r r r r r r� � s zSummary_str.str_address_lenzAddress*Lengthc C s$ |j }|j}|dkr d||f }|S )N�builtinsz%s.%s)rS rT )r r r6 �mr r r r� � s z Summary_str.str_builtin_function�Namec C s" d| j jjj�|j�|j|jf S )Nz%s:%d:%s)r$ r> �os�path�basename� co_filename�co_firstlineno�co_name)r r r r r r� � s zSummary_str.str_codezFile:Line:Namec C s d|j j| �|�f S )Nz <%s at %s>)�f_coder� r� )r r r r r r� � s zSummary_str.str_framezName at Addressc C s d|j |jf S )Nz%s.%s)rT rS )r r r r r r� � s zSummary_str.str_functionc C s dt |� S )Nz*%d)r� )r r r r r r� � s zSummary_str.str_lenZLengthc C sd | � |jj�}|jd k r,d|| �|j�f }|j}y |j}W n tk rV |j}Y nX d||f S )Nz <%s at %s>z%s.%s)r� �__self__r� r� r� r� rS )r r Zcnr� � func_namer r r r� � s zSummary_str.str_methodz Type/<Type at address> . methodc C s |j S )N)rS )r r r r r r� � s zSummary_str.str_modulec C s | j jj�|�S )N)r$ r> �reprlibr� )r r r r r r� � s zSummary_str.str_limreprzRepresentation (limited)r� c C s d| � |j�| �|�f S )Nz<in frame %s at %s>)r� �tb_framer� )r r r r r r� � s zSummary_str.str_tracebackzFrame at Addressc C s< || j kr|s| j | S || jkr,| j| S d|j|jf S )Nz%s.%s)r� r rT rS )r r r� r r r r� � s zSummary_str.str_typec C s$ || j kr| j | S d|j|jf S )Nz%s.%s)r rT rS )r r r r r �str_type_longer� s zSummary_str.str_type_longerc C s t S )N)r� )r r r r r# � r zSummary_str.<lambda>N)F)F)rS rT rU r` r r� r� r� r$ r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� Z_longer_methodr r r r r{ r sB ) r{ c C s | |kS )Nr )r r r r r r# � r r# c C s^ g }xT| D ]L}xF| D ]}|||�r|||�sP qW x"|D ]}|||�r8P q8W |� |� q W |S )z< Find the maximal element(s) of a partially ordered sequence)r )�A�ler� r r� r r r r: � s r: c C s | |kS )Nr )r r r r r r# r c C s^ g }xT| D ]L}xF| D ]}|||�r|||�sP qW x"|D ]}|||�r8P q8W |� |� q W |S )zH Find the minimal element(s) of a sequence of partially ordered elements)r )r� r� r� r r� r r r rx s rx c @ s� e Zd ZdZdZdZdZdZdZdd� Z d d � Z d d � Z d d� Z dd� Z dd� Zdd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd2d$d%�Zd&d'� Zd(d)� Zd*d+� Zd,d-� Zd3d.d/�Z d0d1� Z d#S )4� _GLUECLAMP_�P TF)r r% rv rn )ro �out_reach_module_names�auto_convert_type�auto_convert_iter�output)z_parent:Classifiersz_parent:ImpSetz_parent.ImpSet:emptynodesetz_parent.ImpSet:immnodesetz_parent.ImpSet:mutnodesetz_parent.ImpSet:NodeSetz _parent:Partz _parent:Pathz_parent:RefPatz_parent:OutputHandlingz _parent:Viewz_parent.View:_hiding_tag_z_parent.View:hvz _parent:Usez _root:typesc C s | j jj�d �S )N)r2 r� r� rA )r r r r � _get_Anything9 r z_GLUECLAMP_._get_Anythingc C s t t| �| j�S )N)r� rs Z emptynodeset)r r r r � _get_Nothing: s z_GLUECLAMP_._get_Nothingc C s t �| j| j�S )N)r� r r� r� )r r r r �_get_NotNothing< s z_GLUECLAMP_._get_NotNothingc C st i }xjt | j�� �D ]X\}}t|dd�}xB|D ]:}t||�}||kr`|| |k r`td||f ��|||< q.W qW |S )NZ_uniset_exportsr z#Duplicate export: %r defined in: %r)r� Zout_reach_dictrp r� � RuntimeError)r r� r rU r r r r r �_get_export_dict? s z _GLUECLAMP_._get_export_dictc C s( i }x | j D ]}t| j|�||< q W |S )N)r� r� r� )r r� r� r r r �_get_out_reach_dictK s z _GLUECLAMP_._get_out_reach_dictc C s | � | �S )N)r{ )r r r r �_get_summary_strQ r z _GLUECLAMP_._get_summary_strc C s | � | �S )N)r )r r r r � _get_fam_AndS r z_GLUECLAMP_._get_fam_Andc C s t | �S )N)rt )r r r r � _get_fam_EquivalenceRelationT s z(_GLUECLAMP_._get_fam_EquivalenceRelationc C s | � | �S )N)r. )r r r r � _get_fam_OrW r z_GLUECLAMP_._get_fam_Orc C s | � | �S )N)rL )r r r r �_get_fam_IdentitySetX r z _GLUECLAMP_._get_fam_IdentitySetc C s | � | �S )N)rE )r r r r �_get_fam_InvertY r z_GLUECLAMP_._get_fam_Invertc C s | � | �S )N)rJ )r r r r �_get_fam_FamilyZ r z_GLUECLAMP_._get_fam_Familyc s i � � �fdd�}|S )Nc sJ �� � �}|d kr:G � fdd�d� �j�}� j|_|�� < |�f|�|�S )Nc s e Zd Z� fdd�ZdS )z8_GLUECLAMP_._get_fam_mixin_argatom.<locals>.f.<locals>.Cc s& |j �| |� � j| |f|�|� d S )N)r r` )r r$ r r )�Mixinr r r` c s zA_GLUECLAMP_._get_fam_mixin_argatom.<locals>.f.<locals>.C.__init__N)rS rT rU r` r )r� r r �Cb s r� )r@ r rS )r� r r r� )�memor )r� r �f_ s z-_GLUECLAMP_._get_fam_mixin_argatom.<locals>.fr )r r� r )r� r r �_get_fam_mixin_argatom\ s z"_GLUECLAMP_._get_fam_mixin_argatomc C sR t || j�r|}n(t || j�r*| �|�}ntdt|� ��|j| jk rNtd��|S )Nz(IdentitySet or NodeSet expected, got %r.zPThe argument has wrong _hiding_tag_, you may convert it by Use.idset or Use.iso.)r rd r� �idsetr� r� r r� )r r� Zidsr r r � idset_adaptl s z_GLUECLAMP_.idset_adaptNc C s | j j| �|�|d�S )N)rq )�fam_IdentitySetr r� )r �iterablerq r r r r� y s z_GLUECLAMP_.idsetc C s | j S )N)r� )r r r r �_get_iso| s z_GLUECLAMP_._get_isoc C s t || j�S )N)r r )r �objr r r �isuniset s z_GLUECLAMP_.isunisetc C sN t || j�r|}n$t || j�r&|j}ntdt|� ��|j| jk rJtd��|S )Nz(IdentitySet or NodeSet expected, got %r.zPThe argument has wrong _hiding_tag_, you may convert it by Use.idset or Use.iso.)r r� rd r� r� r� r r� )r r� rT r r r rz � s z_GLUECLAMP_.nodeset_adaptc C s t || j�s| �|�}|S )N)r rd r� )r r� r r r �retset� s z_GLUECLAMP_.retsetc C s@ |s | j S |d }x |dd � D ] }||O }q W |S | j�|�S )Nr r )r� r: r� r )r r Z maximizedr� r� r r r rK � s z_GLUECLAMP_.unionc C s� t |t�r|j| jkr|S | j}t |t�r<| jr<| j�|�S t || j�r^|j| jkr^| � |�S | j r�y t |�}W n t k r� Y n X | � |�S t d��d S )NzPArgument is not automatically convertible to a UniSet with correct _hiding_tag_.) r r r r� r� r� r2 r� r� r� r� r3 r� )r r� r� �itr r r r� � s z#_GLUECLAMP_.uniset_from_setcastable)N)F) rS rT rU ro r� r� r� Z _chgable_Z _imports_r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rz r� rK r� r r r r r� s6 r� N)� functoolsr Zguppy.etc.Descriptorr r� r r^ rd r� r� r� r� r� r� r r r. rE rJ rL rs rt r{ r: rx r� r r r r �<module> s@ 6 , 6T @ Rl =J