B \@sdZddlmZmZmZddlZddlZddlZddlZddl m Z ddl m Z m Z mZddlmZmZmZmZmZmZmZmZddlmZdd lmZmZd d Zd d ZdZdZ dZ!dZ"dZ#dZ$ddZ%ddZ&ddZ'ddZ(e)ddZ*Gddde+Z,Gd d!d!e+Z-Gd"d#d#e+Z.d$d%Z/ee0d&d'Z1ee0e j2d(d)Z3ee4e j5d*d+Z6eej7e j5e j8d,d-Z9ed.e j5d/d0Z:ed1e j;ed2d3Zed:e j5d;d<Z?ed=e j5e j8d>d?Z@ed@e j5dAdBZAedCe j5dDdEZBedFe j5e j2dGdHZCedIe j5e j5dJdKZDedLe j5e j5dMdNZEedOe j5e j2dPdQZFxNejGeDfejHeFfejIeCfejJeEfgD]&\ZKZLeeKe j5e j5eLfdRdSZMqWeejNe j5e j5edTe j5e j5dUdVZOeejPe j5e j5edWe j5e j5dXdYZQeejRe j5e j5edZe j5e j5d[d\ZSeejTe j5e j5ed]e j5e j5d^d_ZUed`e j5e j5dadbZVeejWe j5e j5edce j5e j5dddeZXeejYe j5e j5edfe j5e j5dgdhZZeej[e j5e j5didbZVeej\e j5e j5djdkZ]eej^e j5e j5dldmZ_eej`e j5e j5dndoZaeejbe j5e j5dpdqZcee j5e j5drdsZddS)tz& Support for native homogeneous sets. )print_functionabsolute_importdivisionN)ir)typescgutilstyping) lower_builtin lower_cast iternext_implimpl_ret_borrowedimpl_ret_new_refimpl_ret_untrackedfor_itercall_len)cached_property) quicksortslicingcCs4t|}||}|||}|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_typeZ as_pointerZbitcastmake_data_helper)contextbuilderset_typeptr payload_typeZptrtypayloadr3lib/python3.7/site-packages/numba/targets/setobj.pyget_payload_structs  r!cCs|t|}||S)z7 Return the entry size for the given set type. )rrSetEntryget_abi_sizeof)rrZlltyrrr get_entry_size!sr$iFc Cs`|j}|t}|||fi}|||}|||f}t|||} t|jt } | | || S)z. Compute the hash of the given value. ) Ztyping_contextZresolve_value_typehashZ get_call_type get_function is_hash_usedrConstanttypeFALLBACKselect) rrtypvalueZ typingctxfntysigfnhis_okZfallbackrrr get_hash_value9s    r7cCst|jt}|d||S)z8 Whether the hash value denotes an empty entry. z==)rr,r-EMPTY icmp_unsigned)rrr5emptyrrr is_hash_emptyGsr;cCst|jt}|d||S)z9 Whether the hash value denotes a deleted entry. z==)rr,r-DELETEDr9)rrr5deletedrrr is_hash_deletedNsr>cCst|jt}|d||S)z9 Whether the hash value denotes an active entry. <)rr,r-r<r9)rrr5r=rrr r+Usr+SetLoop)indexentrydo_breakc@seZdZddZeddZejddZeddZejddZed d Zejd d Zed d Z e jdd Z eddZ e jddZ eddZ eddZ ddZ d ddZejd!ddZejddZdS)" _SetPayloadcCs<t||||}||_||_||_||_|d|_||_dS)Nentries)r!_context_builder_ty_payloadZ_get_ptr_by_name_entries_ptr)selfrrrrrrrr __init__cs z_SetPayload.__init__cCs|jjS)N)rImask)rLrrr rNlsz_SetPayload.maskcCs ||j_dS)N)rIrN)rLr1rrr rNpscCs|jjS)N)rIused)rLrrr rOusz_SetPayload.usedcCs ||j_dS)N)rIrO)rLr1rrr rOyscCs|jjS)N)rIfill)rLrrr rP}sz_SetPayload.fillcCs ||j_dS)N)rIrP)rLr1rrr rPscCs|jjS)N)rIfinger)rLrrr rQsz_SetPayload.fingercCs ||j_dS)N)rIrQ)rLr1rrr rQscCs|jjS)N)rIdirty)rLrrr rRsz_SetPayload.dirtycCs ||j_dS)N)rIrR)rLr1rrr rRscCs|jS)z> A pointer to the start of the entries array. )rJ)rLrrr rEsz_SetPayload.entriescCs|jS)zC A pointer to the start of the NRT-allocated area. )rK)rLrrr rsz_SetPayload.ptrcCs2t|j|j|}|jj|jt|j|d}|S)z) Get entry number *idx*. )r) rgeprGrJrFrrr"rH)rLidxZ entry_ptrrBrrr get_entrys   z_SetPayload.get_entryFc s j jj} j} jj}tjt t j ||t |d}t |d}t} t|} r|dtd} ddd}  f dd } tt |t<| }| |||}||}|| Wd QRX| | x| }| || }||}|||}|||}|| || | Wd QRXNr| }}d |||}|| | Wd QRX| Wd QRX| 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) rr%z lookup.bodyz lookup.foundzlookup.not_foundz lookup.endc s |}|j}d|6 |jf}|WdQRXWdQRXt|WdQRXr؈t|4} d|||} |WdQRXdS)zO Check entry *i* against the value being searched for. z==N) rUr)if_thenr9keybranchr;r>loadr/store)irBZ entry_hasheqj) bb_found bb_not_foundrreqfn for_insert free_indexfree_index_sentinelr5itemrLrr check_entrys   z(_SetPayload._lookup..check_entryNz==found)$rFrGr-rNrHdtyper*operatorr]rZ signaturerZbooleanrr,ralloca_once_valueand_append_basic_block for_range LINEAR_PROBESrZaddr[rY goto_blocklshrmulr/r9position_at_endZphiZIntTypeZ add_incomingtrue_bit false_bit)rLrer5rbintp_trNrhoneZfiveZperturbrAbb_bodybb_endrfr\pr^rgr) r_r`rrrarbrcrdr5rerLr _lookupsh                           z_SetPayload._lookupNc cs|j}|j}|tj}t|d}||j|}t j |||dN}| |j }t |||j} || t|j ||jd} | VWdQRXWdQRXdS)zG Iterate over the payload's entries. Yield a SetLoop. r)start)rArBrCN)rFrGget_value_typerintprr,rorNrrmrUrAr+r)rWr@rC) rLr|rrrvrwsizeZ range_looprBis_usedlooprrr _iterate!s     z_SetPayload._iteratec cs|j}|j}|tj}t|d}t|d}|j}|d}|d}t ||j } | || |V|| } |||| |} || | || } t||| j} || ||WdQRX|||| } | |_ || 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_bodyZnext_entry_endN)rFrGr}rr~rr,rNrlrrjrQrYrprZrkror[rUr+r)cbranchrs) rLrrrvzerorwrNrxryrAr\rBrrrr _next_entry5s*            z_SetPayload._next_entry)F)N)__name__ __module__ __qualname__rMpropertyrNsetterrOrPrQrRrErrUr{ contextlibcontextmanagerrrrrrr rDas$        t rDc@szeZdZddZeddZeddZeddZed d Zed d Z e j d d Z ddZ ddZ dOddZ dPddZdQddZdRddZdSddZdTddZdd Zd!d"Zd#d$Zd%d&Zd'd(Zd)d*Zd+d,Zd-d.Zd/d0ZdUd2d3Zd4d5Zd6d7ZedVd9d:Z edWd;d<Z!ed=d>Z"ed?d@Z#dAdBZ$dCdDZ%dEdFZ&dGdHZ'dXdIdJZ(dKdLZ)dMdNZ*d8S)Y SetInstancecCs2||_||_||_t|||_|||||_dS)N)rFrGrHr$ _entrysize make_helper_set)rLrrrset_valrrr rM`s  zSetInstance.__init__cCs|jjS)N)rHrh)rLrrr rhgszSetInstance.dtypecCs.|j}|j}|jj||j}t|||j|S)z/ The _SetPayload for this set. )rFrGnrt meminfo_datameminforDrH)rLrrrrrr rkszSetInstance.payloadcCs |jS)N)r _getvalue)rLrrr r1wszSetInstance.valuecCs|jjS)N)rr)rLrrr r{szSetInstance.meminfocCs|jjS)N)rparent)rLrrr rszSetInstance.parentcCs ||j_dS)N)rr)rLr1rrr rscCs|jjS)z< Return the number of elements in the size. )rrO)rLrrr get_sizeszSetInstance.get_sizecCs |jjr|rtjntj|j_dS)N)rHZ reflectedrrtrurrR)rLvalrrr set_dirtyszSetInstance.set_dirtyTc Cs|j}|j}|j}||_||_|j} t| jd} || | } |_|j t |||dd||j | |_ WdQRX|r| | | ddS)NrT)likely)rFrGr)rXrOrr,r-rorWr;rPupsizer) rLrrBrer5 do_resizerrold_hashrOrwrrr _add_entrys  zSetInstance._add_entryc Cs|j}|j}|j||dd\}}||} || ||} | j} || _|| _|j} t | j d} | | | } |_|jt ||| dd| |j| |_WdQRX|r|| |dWdQRXdS)NT)rbr)r)rFrGr{not_rWrUr)rXrOrr,r-ror;rPrr)rLrrer5rrrrgr\Z not_foundrBrrOrwrrr _add_keys$     zSetInstance._add_keycCsVt|jjt|_|j}t|jd}|j||}|_|rH||| ddS)NrT) rr,r)r-r<rOrGsubdownsizer)rLrrBrrOrwrrr _remove_entrys zSetInstance._remove_entryc CsN|j}|j}|||\}}||||} ||| |WdQRX|S)N)rFrGr{rWrUr) rLrrer5rrrrgr\rBrrr _remove_keys  zSetInstance._remove_keycCs8|j}|j}|j}t|||jj|}|||||dS)N)rFrGrr7rHrhr)rLrerrrrr5rrr ros zSetInstance.addcCs6|j}|j}|j}|||||}|||||dS)z`A version of .add for use inside functions following Python calling convention. N)rFrGr_pyapi_get_hash_valuer)rLpyapirerrrrr5rrr add_pyapis zSetInstance.add_pyapic sfdd}jjg}tj}|||}j||||g\} } j| jdd$j ||  | WdQRX| S)z=Python API compatible version of `get_hash_value()`. cstj||}j}tj|||dd}d|_t|}j |||\}t |j j |}j |||S)Nz.set_hash_item)nameZinternal) call_convZget_function_typemodulerZFunctionZget_unique_nameZlinkageZ IRBuilderrlZdecode_argumentsr7rHrhZ return_value)restyargtypesr2modr4Z inner_builderZ inner_itemr5)rrrLrr emit_wrappers z7SetInstance._pyapi_get_hash_value..emit_wrapperF)rN) rHrhrr~rZ call_functionrWrr6Z raise_errorZretZget_null_object) rLrrrrerrrr4ZstatusZretvalr)rrrLr rs  z!SetInstance._pyapi_get_hash_valuecCs8|j}|j}|j}t|||jj|}|||\}}|S)N)rFrGrr7rHrhr{)rLrerrrr5rgr\rrr containss zSetInstance.containscCs6|j}|j}|j}t|||jj|}||||}|S)N)rFrGrr7rHrhr)rLrerrrr5rgrrr discards zSetInstance.discardc Csd|j}|j}||jj}t||}|j}| }| |j || ||WdQRX| |S)N) rFrGr}rHrhrZ alloca_oncerrr[rXrrZ)rLrrZltyrXrrBrrr pop#s  zSetInstance.popcCs<|j}|j}|tj}t|t}||| ddS)NT) rFrGr}rr~rr,MINSIZE_replace_payloadr)rLrrrvminsizerrr clear1s    zSetInstance.clearc Cs:|j}|j}|j}|j}|j}t||||jd}|d||}|j|dd\}} |@| |} |j | | dd|j |tdWdQRXWdQRX| ||||} || } |j | | dd|j |tdWdQRX|j} |"} | j}|j| |j|jddWdQRXWdQRXWdQRX|S)z, Return a copy of this set. Nz==T)rF)zcannot copy set)r)rFrGrrOrPr-rHr9if_else _copy_payloadrWrrreturn_user_exc MemoryErrorchoose_alloc_size_allocate_payloadrrBrrXr))rLrrrrOrPotherZno_deleted_entriesZ if_no_deletedZ if_deletedoknentries other_payloadrrBrrr copy:s4     &zSetInstance.copyc Cs|j}|j}|j}|j}|L}|j}||j|j\}} || ||j ||ddWdQRXWdQRX| |j dS)z9 In-place intersection with *other* set. F)rN) rFrGrrrBr{rXr)rWrrrrO) rLrrrrrrrBrg_rrr intersectas $zSetInstance.intersectc CsX|j}|j}|j}|j}|"}|j}|j||j|jddWdQRX||j dS)z7 In-place difference with *other* set. F)rN) rFrGrrrBrrXr)rrO)rLrrrrrrrBrrr differencess  zSetInstance.differencec Cs|j}|j}|j}|}|jj}|jj}|j}|j||dd\} } || } | | J\} } | |j || ddWdQRX| | || ||WdQRXWdQRXWdQRX| |jj dS)zA In-place symmetric difference with *other* set. T)rbF)rN)rFrGrrrBrXr)r{rUrrrrrO)rLrrrrrrXr5rrgr\rBZ if_commonZ if_not_commonrrr symmetric_differences  .z SetInstance.symmetric_differenceFc Cs|j}|j}|j}|j}|r dnd}t|tj}||||j|j\} } | | tj |WdQRX| f| R} | j } | | j| j\} }||| | tj || WdQRXWdQRXWdQRXWdQRX||S)Nr?z<=)rFrGrrrjrtrr9rOr[rurrBr{rXr)rWrrCrZ)rLrstrictrrrrZcmp_opresZ if_smaller if_largerrrBrgrrrr issubsets&  0zSetInstance.issubsetc s|j}|j|j}|j}ttjfdd}d|j|j>\}}||||WdQRX||||WdQRXWdQRX S)Nc s^|L}|j}||j|j\}}|tj| WdQRXWdQRXdS)N) rrBr{rXr)rWr[rrurC)ZsmallerZlargerrrBrgr)rrrr checks   z%SetInstance.isdisjoint..check>) rFrGrrrjrtrr9rOrZ)rLrrrrrr otherwiser)rrr isdisjoints zSetInstance.isdisjointc Cs|j}|j}|j}|j}t|tj}||d|j|j\}}|f| R} | j } | | j | j \} } ||| |tj|| WdQRXWdQRXWdQRX||tj|WdQRXWdQRX||S)Nz==)rFrGrrrjrtrr9rOrrBr{rXr)rWrr[rurCrZ) rLrrrrrrZ if_same_sizerrrBrgrrrr equalss$ &"zSetInstance.equalsNc Csf|tj}|dkr"t|t}n$t|tr8t||}||||}||||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) r}rr~rr,r isinstanceintrr) clsrrrnitemsrvrrLrrrr allocate_exs    zSetInstance.allocate_exc CsH|||||\}}|j||dd|j|tdWdQRX|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. F)r)zcannot allocate setN)rrWrrrr)rrrrrrrLrrr 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_nullrpyobjectrrZincrefr1)rrrrrrLrrr from_meminfos zSetInstance.from_meminfoc Cs|j}t|d}t|t}|||}t||}|d} |d} || | | d| |} | d| |} |j | dd|| WdQRX|| |} | | ||| WdQRX|| | |S)zT Choose a suitable number of entries for the given number of items. rz calcsize.bodyz calcsize.endz>=F)rN)r-rr,rshlrrjrlrYrprZr9rWr[rs)rrrrrvrwr min_entriesZsize_prxryrZis_large_enoughZ next_sizerrr rs$            zSetInstance.choose_alloc_sizec Cs0|j}|j}|j}t|d}t|d}|j}|||}||j|} | d|| } |j | ddt || } | d} | d} || || D|| }|||}||| | d||}||| | WdQRX|| || }tr||d || |||||d WdQRXdS) zs When adding to the set, ensure it is properly sized for the given number of used entries. rz>=F)rz calcsize.bodyz calcsize.endNzKupsize to %zd items: current size = %zd, min entries = %zd, new size = %zd zcannot grow set)rFrGr-rr,rrrorNr9rWrrjrlrYrprZr[rrs DEBUG_ALLOCSprintf_resize)rLrrrrvrwtworrr need_resize new_size_prxrynew_size is_too_smallrrr r<s6              zSetInstance.upsizec Cs|j}|j}|j}t|d}t|d}t|t}|j}|||} || d| || |} || |} | |j |} | | d| | | d|| } |j | ddt|| } |d}|d }||||`|| }|||}| d | |}| |||Wd QRX||| ||Wd QRX|||| }trr||d || | ||||d Wd QRXd S)zw When removing from the set, ensure it is properly sized for the given number of used entries. rrz>=z<=r?F)rz calcsize.bodyz calcsize.endrNzMdownsize to %zd items: current size = %zd, min entries = %zd, new size = %zd zcannot shrink set)rFrGr-rr,rrrr/r9rorNrkrWrrjrlrYrprZrqr[rsrrr)rLrrrrvrwrrrrZmax_sizerrrrxryrrrrr rjsF                  zSetInstance.downsizec Cs|j}|j}|}|j|dd}|j||dd|j|t|fWdQRX|j}| "}|j } |j || j | j ddWdQRX||jdS)zw Resize the payload to the given number of entries. CAUTION: *nentries* must be a power of 2! T)reallocF)rN)r)rFrGrrWrrrrrrrBrrXr) _free_payloadr) rLrrerrmsgrrZ old_payloadrrrBrrr rs  zSetInstance._resizec Cs\|j}|j}||jj|j|dd}|j||dd|j |t dWdQRXdS)z Replace the payload with a new empty payload with the given number of entries. CAUTION: *nentries* must be a power of 2! T)rF)r)zcannot reallocate setN) rFrGrrrrrWrrrr)rLrrrrrrr rs zSetInstance._replace_payloadc Cs|j}|j}t|tj}|tj}t |d}t |d}| t |j } | | } |j} | | 8} t||t || t || \} } |j| dd|tj|WdQRX|j||dd|r|jj}|jj||| d}t||}n|jj|| d}t||}|jt||dd\}}||tj|WdQRX|z|sr||j_|tj|j_|j}t||j | d||_!||_"||_#|$||}||_%t&r|'|d | |j |WdQRXWdQRXWdQRX||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! rrF)rNT)rz.allocated %zd bytes for set at %p: mask = %zd )(rFrGrrjrtr}rr~rr,rrrHr#rZmuladd_with_overflowrWr[rurZrrrZmeminfo_varsize_allocis_nullmeminfo_new_varsizerrrrrZmemsetrrOrPrQrrNrr)rLrrrrrrvrrwr payload_size entry_size allocsizeZovfrralloc_okif_errorif_okrZnew_maskrrr rsV        *zSetInstance._allocate_payloadcCs|jj|j|j|dS)z9 Free an allocated old payload at *ptr*. N)rFrZmeminfo_varsize_freerGr)rLrrrr rszSetInstance._free_payloadc Cs|j}|j}t|tj}|tj}t |d}t |d}| t |j }| |} |j} | | 8} |j} ||| } |t || |t || | } |j||dd|jj|| d}t||}|jt||dd\}}||tj|WdQRX|`||j_|j}|j|_|j|_||_| |_t ||j!|j!| | t"rj|#|d| |j$| WdQRXWdQRXWdQRX||S) z7 Raw-copy the given payload into self. rrT)r)rFNz.allocated %zd bytes for set at %p: mask = %zd )%rFrGrrjrtr}rr~rr,rrrHr#rrNrorrrWrZrrrrr[rurrrrOrPrQZ raw_memcpyrErrr)rLZ src_payloadrrrrvrrwrrrrNrrrrrrrrrr rsJ       *zSetInstance._copy_payload)T)T)T)T)T)T)F)N)N)F)+rrrrMrrhrr1rrrrrrrrrrorrrrrrrrrrrrr classmethodrrrrrrrrrrrrrrr r^sP        '   '    .< ?rc@sZeZdZddZeddZeddZeddZed d Z e j d d Z d d Z dS)SetIterInstancecCsL||_||_||_|||||_|jj||j}t|||jj ||_ dS)N) rFrGrHr_iterrrrrD containerrI)rLrr iter_typeZiter_valrrrr rMQs zSetIterInstance.__init__cCsJt|||j|}||||d}|tjd}t|||j_|j |j_ |S)Nr) rr get_constantrr~rrjrrAr)rrrrrZset_instrLrArrr from_setYs  zSetIterInstance.from_setcCs |jS)N)rr)rLrrr r1bszSetIterInstance.valuecCs|jjS)N)rr)rLrrr rfszSetIterInstance.meminfocCs|j|jjS)N)rGrZrrA)rLrrr rAjszSetIterInstance.indexcCs|j||jjdS)N)rGr[rrA)rLr1rrr rAnsc Csr|j}|j}t|jd}||j|d:}|j}|| |j |j |j||_| WdQRXdS)Nr)r|)rArIrr,r-Z set_exhaustedrrBZ set_validZyield_rXrGrorC)rLresultrArrwrrBrrr iternextrs zSetIterInstance.iternextN) rrrrMrrrr1rrArrrrrr rOs   rc Cst|}t||||}t||}t||}|tj|}t ||(} | t ||d| j } | | WdQRXt||||jS)zD Build a set of the given type, containing the given items. rN)lenrrrZ pack_arrayrjrrr~rmrZrSrAror r1) rrritemsrinstZarrayZ array_ptrcountrrerrr build_sets  rcCs$|j}t|||}t||||jS)N) return_typerrr r1)rrr3argsrrrrr set_empty_constructorsrc Csh|j}|j\}|\}t||||}t||||}t||||} || jWdQRXt||||jS)N) rrrrrrror1r ) rrr3rr items_typernrrrrr set_constructorsrcCs t|||jd|d}|S)Nr)rrr)rrr3rrrrr set_lensrcCs&t|||jd|d}||dS)Nrr)rrr)rrr3rrrrr in_setsrZgetitercCs(t|||j|d}t|||j|jS)Nr)rrrr r1)rrr3rrrrr getiter_setsrrcCs&t|||jd|d}||dS)Nr)rrr)rrr3rrrrrr iternext_listitersrzset.addcCs2t|||jd|d}|d}|||S)Nrr)rrroget_dummy_value)rrr3rrrerrr set_adds rz set.discardcCs2t|||jd|d}|d}|||S)Nrr)rrrr)rrr3rrrerrr set_discards rzset.popc CsZt|||jd|d}|jj}|jt||dd|j|t dWdQRX| S)NrF)r)zset.pop(): empty set) rrrrOrWrrrrKeyErrorr)rrr3rrrOrrr set_pops  r z set.removec Csbt|||jd|d}|d}||}|j||dd|j|tdWdQRX|S)NrrF)r)zset.remove(): key not in set) rrrrWrrrr r)rrr3rrrergrrr set_removes  r z set.clearcCs(t|||jd|d}||S)Nr)rrrr)rrr3rrrrr set_clearsr zset.copycCs2t|||jd|d}|}t|||j|jS)Nr)rrrr rr1)rrr3rrrrrr set_copysr zset.difference_updatecCsBt|||jd|d}t|||jd|d}|||S)Nrr)rrrr)rrr3rrrrrr set_difference_updates rzset.intersection_updatecCsBt|||jd|d}t|||jd|d}|||S)Nrr)rrrr)rrr3rrrrrr set_intersection_update s rzset.symmetric_difference_updatecCsBt|||jd|d}t|||jd|d}|||S)Nrr)rrrr)rrr3rrrrrr set_symmetric_difference_updates rz set.updatec Cst|||jd|d}|jd}|d}t||||}|dk rZ||jj|}||t||||} || jWdQRX|dk r| |jj| S)Nrr) rrrrorrOrrr1rr) rrr3rrrrrrrrrr set_updates  rcCs:|j|jdkst|||||t|||jd|dS)Nr)rrAssertionErrorr )rrr3rop_implrrr set_inplace8srzset.differencecCsdd}|||||S)NcSs|}|||S)N)rdifference_update)absrrr difference_implDs z'set_difference..difference_impl)compile_internal)rrr3rrrrr set_differenceAsrzset.intersectioncCsdd}|||||S)NcSs@t|t|kr&|}|||S|}|||SdS)N)rrintersection_update)rrrrrr intersection_implNs  z+set_intersection..intersection_impl)r)rrr3rrrrr set_intersectionKs rzset.symmetric_differencecCsdd}|||||S)NcSs@t|t|kr&|}|||S|}|||SdS)N)rrsymmetric_difference_update)rrrrrr symmetric_difference_impl]s  z;set_symmetric_difference..symmetric_difference_impl)r)rrr3rr rrr set_symmetric_differenceZs r!z set.unioncCsdd}|||||S)NcSs@t|t|kr&|}|||S|}|||SdS)N)rrupdate)rrrrrr union_implms  zset_union..union_impl)r)rrr3rr#rrr set_unionjs r$zset.isdisjointcCs:t|||jd|d}t|||jd|d}||S)Nrr)rrr)rrr3rrrrrr set_isdisjoint|sr%z set.issubsetcCs:t|||jd|d}t|||jd|d}||S)Nrr)rrr)rrr3rrrrrr set_issubsetsr&zset.issupersetcCsdd}|||||S)NcSs ||S)N)r)rrrrr superset_implsz%set_issuperset..superset_impl)r)rrr3rr'rrr set_issupersetsr(cCs:t|||jd|d}t|||jd|d}||S)Nrr)rrr)rrr3rrrrrr r%scCsdd}|||||S)NcSs ||k S)Nr)rrrrr ne_implszset_ne..ne_impl)r)rrr3rr)rrr set_nesr*cCs>t|||jd|d}t|||jd|d}|j|ddS)NrrT)r)rrr)rrr3rrrrrr set_ltsr+cCsdd}|||||S)NcSs||kS)Nr)rrrrr gt_implszset_gt..gt_impl)r)rrr3rr,rrr set_gtsr-cCs^t|||jd|d}t|||jd|d}||jtj}||jtj}|d||S)Nrrz==)rrZptrtointrrrvZ icmp_signed)rrr3rrrZmaZmbrrr set_iss r.cCs|j|jkst|S)N)rhr)rrZfromtyZtotyrrrr set_to_setsr/)e__doc__Z __future__rrr collectionsrZmathriZllvmliterZnumbarrrZnumba.targets.imputilsr r r r r rrrZ numba.utilsrrrr!r$r8r<r.rrnrr7r;r>r+ namedtupler@objectrDrrrsetrZ IterableTyperrSetrrZAnyrrZSetIterrrrr r r r rrrriandiorisubixorZop_rrrrrkrxorr!or_r$r%ler&ger(r]ner*ltr+gtr-is_r.r/rrrr s (    ~v6