o 8ήc@sdZddlZddlZddlZddlZddlmZddlmZm Z m Z ddl m Z m Z mZmZmZmZmZmZmZddlmZddlmZddlmZdd lmZdd lmZd d Zd dZ dZ!dZ"dZ#dZ$dZ%dZ&ddZ'eddZ(ddZ)ddZ*ddZ+e,dd Z-Gd!d"d"e.Z/Gd#d$d$e.Z0Gd%d&d&e.Z1d'd(Z2e e3d)d*Z4e e3ej5d+d,Z6e e7ej8d-d.Z9e ej:ej8ej;d/d0Zeej?d5d6Z@e d7ej8ej;d8d9ZAe d:ej8ej;d;d<ZBe d=ej8d>d?ZCe d@ej8ej;dAdBZDe dCej8dDdEZEe dFej8dGdHZFe dIej8ej5dJdKZGe dLej8ej8dMdNZHe dOej8ej8dPdQZIe dRej8ej5dSdTZJejKeHfejLeJfejMeGfejNeIffD]\ZOZPe eOej8ej8ePfdUdVZQqhe ejRej8ej8e dWej8ej8dXdYZSe ejTej8ej8e dZej8ej8d[d\ZUe ejVej8ej8e d]ej8ej8d^d_ZWe ejXej8ej8e d`ej8ej8dadbZYe dcej8ej8dddeZZe ej[ej8ej8e dfej8ej8dgdhZ\e ej]ej8ej8e diej8ej8djdkZ^e ej_ej8ej8dldeZZe ej`ej8ej8dmdnZae ejbej8ej8dodpZce ejdej8ej8dqdrZee ejfej8ej8dsdtZge ej8ej8dudvZhdS)wz& Support for native homogeneous sets. N)ir)typestypingcgutils) lower_builtin lower_cast iternext_implimpl_ret_borrowedimpl_ret_new_refimpl_ret_untrackedfor_itercall_lenRefType)cached_property) quicksort)slicing) intrinsic)NumbaValueErrorcCs4t|}||}|||}|j|||dS)zx Given a set value and type, get its payload structure (as a reference, so that mutations are seen by all). ref)r SetPayload get_data_type as_pointerbitcastmake_data_helper)contextbuilderset_typeptr payload_typeptrtypayloadr";/tmp/pip-target-vg8gfxp4/lib/python/numba/cpython/setobj.pyget_payload_structs  r$cCs|t|}||S)z7 Return the entry size for the given set type. )rrSetEntryget_abi_sizeof)rrlltyr"r"r#get_entry_size#s r(iFc Cs`|j}|t}|||fi}|||}|||f}t|||} t|jt } | | || S)z. Compute the hash of the given value. ) typing_contextresolve_value_typehash get_call_type get_function is_hash_usedrConstanttypeFALLBACKselect) rrtypvalue typingctxfntysigfnhis_okfallbackr"r"r#get_hash_value;s    r@cs.fdd}|t}||fi}||fS)Ncst|||dSNr)r@)rrr7argsr8r"r#implLsz'_get_hash_value_intrinsic..impl)r.r/r0)r9r8rDr:r;r"rCr#_get_hash_value_intrinsicJs  rEcCt|jt}|d||S)z8 Whether the hash value denotes an empty entry. ==)rr3r4EMPTY icmp_unsigned)rrr=emptyr"r"r# is_hash_emptySrKcCrF)z9 Whether the hash value denotes a deleted entry. rGrr3r4DELETEDrIrrr=deletedr"r"r#is_hash_deletedZrLrQcCrF)z9 Whether the hash value denotes an active entry.  A pointer to the start of the entries array. )r_rgr"r"r#rYz_SetPayload.entriescCrt)zC A pointer to the start of the NRT-allocated area. )r`rgr"r"r#rruz_SetPayload.ptrcCs2t|j|j|}|jj|jt|j|d}|S)z) Get entry number *idx*. r) rgepr[r_rZrrr%r\)raidx entry_ptrrVr"r"r# get_entrys   z_SetPayload.get_entryFc s j jj} j} jj}j}|tj }| |||fi}  || t |d} t |d} t} t|} rQ|dtd}ddd} f dd }tt |t#| }|||| }||}|| Wd n1swY||A| }||| }|| }| || }|||}|| || |Wd n1swY,r"| }}d |||}|| |Wd n 1s2wY |Wd n 1sMwY|t dd }| tj!| tj"|| fS) ag Lookup the *item* with the given hash values in the entries. Return a (found, entry index) tuple: - If found is true, points to the entry containing the item. - If found is false, points to the empty entry that the item can be written to (only if *for_insert* is true) r)z lookup.bodyz lookup.foundzlookup.not_foundz lookup.endc s2 |}|j}d|* |jf}| Wdn1s0wYWdn1s?wYt| Wdn1s]wYrt| } d|||} |WddS1swYdSdS)zO Check entry *i* against the value being searched for. rGN) ryr/if_thenrIkeybranchrKrQloadr6store)irV entry_hasheqj bb_found bb_not_foundrreqfn for_insert free_indexfree_index_sentinelr=itemrar"r# check_entrys*     "z(_SetPayload._lookup..check_entryNrGfound)#rZr[r4rfr\dtyper-r.operatorrr0r1rr3ralloca_once_valueand_append_basic_block for_range LINEAR_PROBESraddrr~ goto_blocklshrmulr6rIposition_at_endphiIntType add_incomingtrue_bit false_bit)rarr=rintp_trfrtyctxr:r;onefiveperturbrUbb_bodybb_endrrprrr"rr#_lookupsx                               z_SetPayload._lookupNc cs|j}|j}|tj}t|d}||j|}t j |||d?}| |j }t |||j} || t|j ||jd} | VWdn1sLwYWddSWddS1sdwYdS)zG Iterate over the payload's entries. Yield a SetLoop. rzstartrTN)rZr[get_value_typerintprr3rrfrrryrUr2r/r|rSrW) rarrrrrsize range_looprVis_usedloopr"r"r#_iterate/s$    "z_SetPayload._iteratec cs|j}|j}|tj}t|d}t|d}|j}|d}|d}t ||j } | || |0|| } |||| |} || | || } t||| j} || ||Wdn1sjwY|||| } | |_ || VdS)z Yield a random entry from the payload. Caller must ensure the set isn't empty, otherwise the function won't end. rrznext_entry_bodynext_entry_endN)rZr[rrrrr3rfrrrrqr~rrrrrryr2r/cbranchr) rarrrzerorrfrrrUrrVrr"r"r# _next_entryCs.           z_SetPayload._next_entryFrd)__name__ __module__ __qualname__rbpropertyrfsetterrlrorqrsrYrryr contextlibcontextmanagerrrr"r"r"r#rXms@             v rXc@seZdZddZeddZeddZeddZed d Zed d Z e j d d Z ddZ ddZ dUddZ dVddZdVddZdUddZdUddZdUddZdd Zd!d"Zd#d$Zd%d&Zd'd(Zd)d*Zd+d,Zd-d.Zd/d0ZdWd2d3Zd4d5Zd6d7ZedXd9d:Z edXd;d<Z!ed=d>Z"ed?d@Z#dAdBZ$dCdDZ%dEdFZ&dGdHZ'dWdIdJZ(dKdLZ)dMdNZ*dOdPZ+dQdRZ,dSdTZ-d8S)Y SetInstancecCs2||_||_||_t|||_|||||_dSrd)rZr[r\r( _entrysize make_helper_set)rarrrset_valr"r"r#rbns  zSetInstance.__init__cCrcrd)r\rrgr"r"r#rurhzSetInstance.dtypecCs.|j}|j}|jj||j}t|||j|S)z/ The _SetPayload for this set. )rZr[nrt meminfo_datameminforXr\)rarrrr"r"r#r!yszSetInstance.payloadcC |jSrd)r _getvaluergr"r"r#r8 zSetInstance.valuecCrcrd)rrrgr"r"r#rrhzSetInstance.meminfocCrcrdrparentrgr"r"r#rrhzSetInstance.parentcCrirdrrjr"r"r#rrmcCrc)z< Return the number of elements in the size. )r!rlrgr"r"r#get_sizeszSetInstance.get_sizecCs$|jjr|r tjntj|j_dSdSrd)r\ reflectedrrrr!rsravalr"r"r# set_dirtyszSetInstance.set_dirtyTc Cs|j}|j}|j}||_||||_|j} t| jd} | | | } |_|j t |||dd| |j | |_ Wdn1sEwY|rQ| | |ddS)NrzTlikely)rZr[r/ incref_valuer}rlrr3r4rr|rKroupsizer) rar!rVrr= do_resizerrold_hashrlrr"r"r# _add_entrys"  zSetInstance._add_entryc Cs|j}|j}|j||dd\}} ||} || `|| } | j} || _|r-|||| _|j } t | j d}| | |} |_ |jt||| dd| |j||_Wdn1sawY|rm|| |dWddS1s}wYdS)NTrrzr)rZr[rnot_r|ryr/rr}rlrr3r4rrKrorr)rar!rr=r do_increfrrrr not_foundrVrrlrr"r"r#_add_keys.      "zSetInstance._add_keycCsft|jjt|_|r||j|j}t|jd}|j ||}|_|r,| || ddS)NrzT) rr3r/r4rN decref_valuer}rlr[subdownsizer)rar!rVr do_decrefrlrr"r"r# _remove_entrys  zSetInstance._remove_entryc Csd|j}|j}|||\}}||||} ||| |Wd|S1s+wY|Srd)rZr[rr|ryr) rar!rr=rrrrrrVr"r"r# _remove_keys   zSetInstance._remove_keycCs8|j}|j}|j}t|||jj|}|||||dSrd)rZr[r!r@r\rr)rarrrrr!r=r"r"r#rs zSetInstance.addcCs6|j}|j}|j}|||||}|||||dS)z`A version of .add for use inside functions following Python calling convention. N)rZr[r!_pyapi_get_hash_valuer)rapyapirrrrr!r=r"r"r# add_pyapis zSetInstance.add_pyapic Cs|jjg}tj}dd}|g}tj|g|R} ||| |\} } |j| dd|| Wd| S1s;wY| S)z=Python API compatible version of `get_hash_value()`. cSst|Srd)rE)rr"r"r#wrapperz2SetInstance._pyapi_get_hash_value..wrapperFrN) r\rrrr signature call_jit_coder|retget_null_object) rarrrrargtypesrestyrrBr;is_errorretvalr"r"r#rs  z!SetInstance._pyapi_get_hash_valuecCs8|j}|j}|j}t|||jj|}|||\}}|Srd)rZr[r!r@r\rr)rarrrr!r=rrr"r"r#containss zSetInstance.containscCs6|j}|j}|j}t|||jj|}||||}|Srd)rZr[r!r@r\rr)rarrrr!r=rr"r"r#discards zSetInstance.discardcCs||j}|j}||jj}t||}|j}|}| |j ||j ||ddWdn1s4wY| |S)NF)r) rZr[rr\rr alloca_oncer!rrr}rr)rarrltyr}r!rVr"r"r#pop!s   zSetInstance.popcCs<|j}|j}|tj}t|t}||| ddS)NT) rZr[rrrrr3MINSIZE_replace_payloadr)rarrrminsizer"r"r#clear0s    zSetInstance.clearc Cs|j}|j}|j}|j}|j}t||||jd}|d||}|j|dd\}} |/| |} |j | | dd|j |tdWdn1sOwYWdn1s^wY| [||||} || } |j | | dd|j |tdWdn1swY|j} |} | j}|j| |j|jddWdn1swYWdn1swYWd|SWd|S1swY|S)z, Return a copy of this set. NrGTrF)zcannot copy setr)rZr[r!rlror4r\rIif_else _copy_payloadr|r call_convreturn_user_exc MemoryErrorchoose_alloc_size_allocate_payloadrrVrr}r/)rarrr!rlrootherno_deleted_entries if_no_deleted if_deletedoknentries other_payloadrrVr"r"r#copy9sT       zSetInstance.copyc Cs|j}|j}|j}|j}|5}|j}||j|j\}} || ||j ||ddWdn1s9wYWdn1sHwY| |j dS)z9 In-place intersection with *other* set. FrN) rZr[r!rrVrr}r/r|rrrrl) rarrrr!rrrVr_r"r"r# intersect`s zSetInstance.intersectcCsl|j}|j}|j}|j}|}|j}|j||j|jddWdn1s)wY||j dS)z7 In-place difference with *other* set. FrN) rZr[r!rrVrr}r/rrl)rarrrr!rrrVr"r"r# differencers zSetInstance.differencec Cs|j}|j}|j}|m}|jj}|jj}|j}|j||dd\} } || } | | >\} } | |j || ddWdn1sEwY| | || ||Wdn1s_wYWdn1snwYWdn1s}wY| |jj dS)zA In-place symmetric difference with *other* set. TrFrN)rZr[r!rrVr}r/rryrrrrrl)rarrrrrr}r=r!rrrV if_common if_not_commonr"r"r#symmetric_differences*  z SetInstance.symmetric_differenceFc CsV|j}|j}|j}|j}|rdnd}t|tj}||||j|jy\} } | | tj |Wdn1s}|j}||j|j\}}|tj| Wdn1s-wYWddSWddS1sEwYdSrd) rrVrr}r/r|rrrrW)smallerlargerrrVrr rrr"r#checks   "z%SetInstance.isdisjoint..check>) rZr[r!rrrrrIrlr)rarrr!rrr otherwiser"rr# isdisjoints&    zSetInstance.isdisjointc CsJ|j}|j}|j}|j}t|tj}||d|j|jy\}}|L| 8} | j } | | j | j \} } ||| |tj|| Wdn1sUwYWdn1sdwYWdn1sswY||tj|Wdn1swYWdn1swY||S)NrG)rZr[r!rrrrrIrlrrVrr}r/r|rrrrWr) rarrrr!rr if_same_sizerrrVrr r"r"r#equalss6   zSetInstance.equalsNc Csf|tj}|durt|t}nt|trt||}||||}||||d}| |}||fS)z Allocate a SetInstance with its storage. Return a (ok, instance) tuple where *ok* is a LLVM boolean and *instance* is a SetInstance object (the object's contents are only valid when *ok* is true). N) rrrrr3r isinstanceintrr) clsrrrnitemsrrrarr"r"r# allocate_exs    zSetInstance.allocate_excCs^|||||\}}|j||dd|j|tdWd|S1s(wY|S)z Allocate a SetInstance with its storage. Same as allocate_ex(), but return an initialized *instance*. If allocation failed, control is transferred to the caller using the target's current call convention. Fr)zcannot allocate setN)r#r|rrrr)r!rrrr"rrar"r"r#allocates  zSetInstance.allocatecCs<||||d}||j_|tj|j_|j|||j|S)z Allocate a new set instance pointing to an existing payload (a meminfo pointer). Note the parent field has to be filled by the caller. N) rrget_constant_nullrpyobjectrrincrefr8)r!rrrrrar"r"r# from_meminfos zSetInstance.from_meminfoc Cs|j}t|d}t|t}|||}t||}|d} |d} || | | A| |} | d| |} |j | dd || Wdn1sSwY|| |} | | ||| Wdn1sswY|| | |S)zT Choose a suitable number of entries for the given number of items. rz calcsize.body calcsize.end>=FrN)r4rr3rshlrrrr~rrrIr|rr)r!rrr"rrr min_entriessize_prrris_large_enough next_sizer"r"r#rs(              zSetInstance.choose_alloc_sizec CsX|j}|j}|j}t|d}t|d}|j}|||}||j|} | d|| } |j | ddot || } | d} | d} || || '|| }|||}||| | d||}||| | Wdn1sxwY|| || }tr||d || |||||d WddS1swYdS) zs When adding to the set, ensure it is properly sized for the given number of used entries. rzr+Frr)r*NzKupsize to %zd items: current size = %zd, min entries = %zd, new size = %zd zcannot grow set)rZr[r4rr3r!r,rrfrIr|rrrr~rrrrr DEBUG_ALLOCSprintf_resize)rar"rrrrtwor!r-r need_resize new_size_prrnew_size is_too_smallr"r"r#r;s<             "zSetInstance.upsizec Cs|j}|j}|j}t|d}t|d}t|t}|j}|||} || d| || |} || |} | |j |} | | d| | | d|| } |j | ddt|| } |d}|d }||||?|| }|||}| d | |}| | ||Wd n1swY||| ||Wd n1swY|||| }tr||d || | ||||d Wd d S1swYd S)zw When removing from the set, ensure it is properly sized for the given number of used entries. rzr1r+rrRFrr)r*rNzMdownsize to %zd items: current size = %zd, min entries = %zd, new size = %zd zcannot shrink set)rZr[r4rr3rr!r,r6rIrrfrr|rrrr~rrrrrr2r3r4)rar"rrrrr5rr!r-max_sizerr6r7rrr8r9r"r"r#risR                   "zSetInstance.downsizec Cs|j}|j}|}|j|dd}|j||dd|j|t|fWdn1s-wY|j}| }|j } |j || j | j dddWdn1sSwY||jdS)zw Resize the payload to the given number of entries. CAUTION: *nentries* must be a power of 2! TreallocFrN)rr)rZr[rr|rrrrr!rrVrr}r/ _free_payloadr) rar!rerrmsgrr old_payloadrrrVr"r"r#r4s"  zSetInstance._resizecCs|j}|j}|j}|j}||jWdn1swY||jj|j |dd}|j | |dd|j |tdWddS1sPwYdS)z Replace the payload with a new empty payload with the given number of entries. CAUTION: *nentries* must be a power of 2! NTr;Fr)zcannot reallocate set)rZr[r!rrVrr}r=rrr|rrrr)rarrrrrVrr"r"r#rs  "zSetInstance._replace_payloadc Csd|j}|j}t|tj}|tj}t |d}t |d}| t |j } | | } |j} | | 8} t||t || t || \} } |j| dd|tj|Wdn1s_wY|j||dd|r|jj}|jj||| d}t||}n|||j}|j|| ||tj}t||}|j|ddn\}}||tj|Wdn1swY|@|s||j_|tj |j_!|j"}t#||j$| d||_%||_&||_'|(||}||_)t*r|+|d | |j$|Wdn 1swYWdn 1swYWdn 1s(wY||S) z Allocate and initialize payload for the given number of entries. If *realloc* is True, the existing meminfo is reused. CAUTION: *nentries* must be a power of 2! rrzFrNT)r.allocated %zd bytes for set at %p: mask = %zd ),rZr[rrrrrrrr3rrr\r&rmuladd_with_overflowr|rrrrrrmeminfo_varsize_alloc_uncheckedis_null _imp_dtormodule"meminfo_new_varsize_dtor_uncheckedr voidptr_trr%r&rr!memsetrrlrorqrrfr2r3)rarr<rrrrrrr payload_size entry_size allocsizeovfrralloc_okdtorif_errorif_okr!new_maskr"r"r#rsx         $zSetInstance._allocate_payloadcCs|jj|j|j|dS)z9 Free an allocated old payload at *ptr*. N)rZrmeminfo_varsize_freer[r)rarr"r"r#r=szSetInstance._free_payloadc Cs(|j}|j}t|tj}|tj}t |d}t |d}| t |j }| |} |j} | | 8} |j} ||| } |t || |t || | } |j||dd|||j}|j|| ||tj}t||}|j|dd|\}}||tj|Wdn1swY|O||j_|j }|j!|_!|j"|_"||_#| |_t$||j%|j%| | |&}|'|j(j)Wdn1swYt*r|+|d| |j,| Wdn1swYWdn1swYWdn 1s wY||S)z7 Raw-copy the given payload into self. rrzTrFNrA)-rZr[rrrrrrrr3rrr\r&rrfrrr|rrErFrrGrrHrDrrrrrr!rlrorq raw_memcpyrYrrrVr}r2r3r)ra src_payloadrrrrrrrrJrKrfrrLrOrrNrPrQr!rr"r"r#r sj         "zSetInstance._copy_payloadc Cstj}|tj}tt|||g}d|jj }tj |||d}|j rad|_ t |}t|||j|jd} | } | j} |j||jj | jWdn1sXwY||S)z Define the dtor for set z .dtor.set.)name linkonce_odrrN)rrHrrsize_tr FunctionTypeVoidTyper\rget_or_insert_functionis_declarationlinkage IRBuilderrrXrBrrVrdecrefr}ret_void) rarrF llvoidptrllsize_tr:fnamer<rr!rrVr"r"r#rEas$  zSetInstance._imp_dtorcC|jj|j|jj|dS)z Incref an element value N)rZrr'r[r\rrr"r"r#r}zSetInstance.incref_valuecCrd)z Decref an element value N)rZrr_r[r\rrr"r"r#rrezSetInstance.decref_value)T)TTrrd).rrrrbrrr!r8rrrrrrrrrrrrrrrrrr r rrrr classmethodr#r$r(rrrr4rrr=rrErrr"r"r"r#rlsh               '     .< CA rc@sZeZdZddZeddZeddZeddZed d Z e j d d Z d d Z dS)SetIterInstancecCsL||_||_||_|||||_|jj||j}t|||jj ||_ dSrd) rZr[r\r_iterrrrrX containerr])rarr iter_typeiter_valrr"r"r#rbs zSetIterInstance.__init__cCsJt|||j|}||||d}|tjd}t|||j_|j |j_ |SrA) rri get_constantrrrrrhrUr)r!rrrjrset_instrarUr"r"r#from_sets  zSetIterInstance.from_setcCrrd)rhrrgr"r"r#r8rzSetIterInstance.valuecCrcrd)rhrrgr"r"r#rrhzSetIterInstance.meminfocCs|j|jjSrd)r[rrhrUrgr"r"r#rUszSetIterInstance.indexcCs|j||jjdSrd)r[rrhrUrjr"r"r#rUscCs|j}|j}t|jd}||j|d#}|j}|| |j |j |j||_| WddS1s=wYdS)Nrzr)rUr]rr3r4 set_exhaustedrrV set_validyield_r}r[rrW)raresultrUr!rrrVr"r"r#iternexts  "zSetIterInstance.iternextN) rrrrbrfrnrr8rrUrrsr"r"r"r#rgs      rgc Cst|}t||||}|dkrJt||}t||}|tj|}t ||} | t ||d| j } | | Wdn1sEwYt||||jS)zD Build a set of the given type, containing the given items. rN)lenrr$r pack_arrayrrlrrrrrvrUrr r8) rrritemsr"instarray array_ptrcountrrr"r"r# build_sets   r{cCs$|j}t|||}t||||jSrd) return_typerr$r r8)rrr;rBrrwr"r"r#set_empty_constructorsr}c Cs|j}|j\}|\}t||||}t||||}t||||} || j|j ||j | jWdn1s;wYt ||||jSrd) r|rBr rr$r rr8rr_rr ) rrr;rBr items_typervnrwrr"r"r#set_constructors rcCs t|||jd|d}|SrA)rrBrrrr;rBrwr"r"r#set_lensrcCs&t|||jd|d}||dSNrrz)rrBrrr"r"r#in_setsrgetitercCs(t|||j|d}t|||j|jSrA)rgrnr|r r8rr"r"r# getiter_setsrrscCs&t|||jd|d}||dSrA)rgrBrs)rrr;rBrrrwr"r"r#iternext_listitersrzset.addcC2t|||jd|d}|d}|||Sr)rrBrget_dummy_valuerrr;rBrwrr"r"r#set_add  rz set.discardcCrr)rrBrrrr"r"r# set_discardrrzset.popcCstt|||jd|d}|jj}|jt||dd|j|t dWd| S1s1wY| S)NrFr)zset.pop(): empty set) rrBr!rlr|rrDrrKeyErrorr)rrr;rBrwrlr"r"r#set_pops  rz set.removecCs|t|||jd|d}|d}||}|j||dd|j|tdWd|S1s5wY|S)NrrzFr)zset.remove(): key not in set) rrBrr|rrrrr)rrr;rBrwrrr"r"r# set_remove's   rz set.clearcCs(t|||jd|d}||SrA)rrBrrrr"r"r# set_clear5srzset.copycCs2t|||jd|d}|}t|||j|jSrA)rrBrr r|r8rrr;rBrwrr"r"r#set_copy;srzset.difference_updatecCBt|||jd|d}t|||jd|d}|||Sr)rrBr rrr"r"r#set_difference_updateA rzset.intersection_updatecCrr)rrBr rrr"r"r#set_intersection_updateJrrzset.symmetric_difference_updatecCrr)rrBrrrr"r"r#set_symmetric_difference_updateSrrz set.updatec Cst|||jd|d}|jd}|d}t||||}|dur-||jj|}||t||||"} ||| j |j |j } || |j ||j | j Wdn1sYwY|duri| |jj|Sr)rrBr rr!rlrr castr8rrr_rr) rrr;rBrwr~rvrr8rcastedr"r"r# set_update\s    rcCs:|j|jdks J|||||t|||jd|dSrA)r|rBr )rrr;rBop_implr"r"r# set_inplacesrzset.differencecCdd}|||||S)NcSs|}|||Srd)rdifference_updateabsr"r"r#difference_impls z'set_difference..difference_implcompile_internal)rrr;rBrr"r"r#set_differencesrzset.intersectioncCr)NcSs<t|t|kr|}|||S|}|||Srd)rtrintersection_updaterr"r"r#intersection_impl  z+set_intersection..intersection_implr)rrr;rBrr"r"r#set_intersection rzset.symmetric_differencecCr)NcS<t|t|kr|}|||S|}|||Srd)rtrsymmetric_difference_updaterr"r"r#symmetric_difference_implrz;set_symmetric_difference..symmetric_difference_implr)rrr;rBrr"r"r#set_symmetric_differences rz set.unioncCr)NcSrrd)rtrupdaterr"r"r# union_implrzset_union..union_implr)rrr;rBrr"r"r# set_unionrrzset.isdisjointcC:t|||jd|d}t|||jd|d}||Sr)rrBrrr"r"r#set_isdisjoint rz set.issubsetcCrrrrBrrr"r"r# set_issubsets rzset.issupersetcCr)NcSs ||Srd)rrrr"r"r# superset_impl z%set_issuperset..superset_implr)rrr;rBrr"r"r#set_issupersetsrcCrr)rrBrrr"r"r#rrcCr)NcSs ||k Srdr"rr"r"r#ne_implrzset_ne..ne_implr)rrr;rBrr"r"r#set_nercCs>t|||jd|d}t|||jd|d}|j|ddS)NrrzT)rrrr"r"r#set_ltsrcCr)NcSs||kSrdr"rr"r"r#gt_implrzset_gt..gt_implr)rrr;rBrr"r"r#set_gtrrcCs^t|||jd|d}t|||jd|d}||jtj}||jtj}|d||S)NrrzrG)rrBptrtointrrr icmp_signed)rrr;rBrrmambr"r"r#set_iss rcCs|j|jksJ|Srd)r)rrfromtytotyrr"r"r# set_to_setsr)i__doc__ collectionsrmathrllvmliter numba.corerrrnumba.core.imputilsrrrr r r r r rnumba.core.utilsr numba.miscr numba.cpythonrnumba.extendingrnumba.core.errorsrr$r(rHrNr5rrr2r@rErKrQr2 namedtuplerSobjectrXrrgr{setr} IterableTyperrtSetrrAnyrrSetIterBORROWEDrrrrrrrrrrriandiorisubixorop_rrrrrrxorror_rrlergerrnerltrgtris_rrr"r"r"r#s ,         "6