I]P > d Z ddlmZ ddlZddlZddlZddlmZ ddlmZ ddlm Z ddlm
Z
dd lm Z dd
lm Z e
Z G d d e Z G d
de Z G d de Z G d de Z G d dee Z G d de Z G d de Z G d dee Z G d d e Z G d d e Z G d d e Z G d! d"e Z G d# d$e Z G d% d&e Z G d' d(e Z!eZ"eZ#e Z$ e ej% Z& e d) Z'd=d*Z( G d+ d,e Z)d- Z*d=d.Z+d/ Z,d0 Z-d1 Z.d=d2Z/d3 Z0 G d4 d5e Z1 e1d6 Z2d7 Z3 G d8 d9e Z4 G d: d;e4 Z5d< Z6dS )>z Collection classes and helpers. )absolute_importN ) binary_types)collections_abc)itertools_filterfalse)py2k) string_types) threadingc e Zd ZdZd ZdS )AbstractKeyedTuple c * t | j S )zReturn a list of string key names for this :class:`.KeyedTuple`.
.. seealso::
:attr:`.KeyedTuple._fields`
)list_fieldsselfs p/builddir/build/BUILD/cloudlinux-venv-1.0.10/venv/lib64/python3.11/site-packages/sqlalchemy/util/_collections.pykeyszAbstractKeyedTuple.keys s DL!!! N)__name__
__module__ __qualname__ __slots__r r
r r r r s( I " " " " "r r c < e Zd ZdZddZed Zd Zd ZdS )
KeyedTuplea ``tuple`` subclass that adds labeled names.
E.g.::
>>> k = KeyedTuple([1, 2, 3], labels=["one", "two", "three"])
>>> k.one
1
>>> k.two
2
Result rows returned by :class:`_query.Query` that contain multiple
ORM entities and/or column expressions make use of this
class to return rows.
The :class:`.KeyedTuple` exhibits similar behavior to the
``collections.namedtuple()`` construct provided in the Python
standard library, however is architected very differently.
Unlike ``collections.namedtuple()``, :class:`.KeyedTuple` is
does not rely on creation of custom subtypes in order to represent
a new series of keys, instead each :class:`.KeyedTuple` instance
receives its list of keys in place. The subtype approach
of ``collections.namedtuple()`` introduces significant complexity
and performance overhead, which is not necessary for the
:class:`_query.Query` object's use case.
.. seealso::
:ref:`ormtutorial_querying`
Nc t | | }|r)|j t || ng }||j d< |S )N_labels)tuple__new____dict__updatezip)clsvalslabelsts r r zKeyedTuple.__new__J sV MM#t $ $
J c&$ / / 0 0 0 0F &
9 r c > t d | j D S )zReturn a tuple of string key names for this :class:`.KeyedTuple`.
This method provides compatibility with ``collections.namedtuple()``.
.. seealso::
:meth:`.KeyedTuple.keys`
c g | ]}||S Nr
).0ls r
z&KeyedTuple._fields..^ s ???A a r )r r r s r r zKeyedTuple._fieldsS s# ?? ???@@@r c & t d|z )NzCan't set attribute: %s)AttributeErrorr keyvalues r __setattr__zKeyedTuple.__setattr__` s 6 <===r c D fd D S )zReturn the contents of this :class:`.KeyedTuple` as a dictionary.
This method provides compatibility with ``collections.namedtuple()``,
with the exception that the dictionary returned is **not** ordered.
c , i | ]}|j | S r
)r r* r0 r s r
z&KeyedTuple._asdict..j s" ???CT]3'???r )r r s `r _asdictzKeyedTuple._asdictc s( @???499;;????r r) ) r r r __doc__r propertyr r2 r7 r
r r r r * ss >
A
A X
A> > >@ @ @ @ @r r c $ e Zd ZdZd Zd Zd ZdS )_LWr
c 8 t | | S r) )r r )r# r$ s r r z _LW.__new__p s }}S$'''r c < t t | | j ffS r) )r r _real_fieldsr s r
__reduce__z_LW.__reduce__s s DJJ(9:::r c v t t | j | }| dd |S )zAReturn the contents of this :class:`.KeyedTuple` as a dictionary.N)dictr" r> popr ds r r7 z _LW._asdicty s7
T&-- . . dDr N)r r r r r r? r7 r
r r r; r; m sF I( ( (; ; ; r r; c e Zd Zd ZexZxZZdS )ImmutableContainerc : t d| j j z )Nz%s object is immutable) TypeError __class__r r argkws r
_immutablez ImmutableContainer._immutable s 04>3JJKKKr N)r r r rM __delitem__ __setitem__r2 r
r r rF rF s1 L L L /98K8+ r rF c J e Zd Zej xZxZxZxZZ d Z
d Z d Z d Z
d ZdS )
immutabledictc ^ t | }t j |g|R |S r) )rA r __init__)r# argsnews r r zimmutabledict.__new__ s0 ll3
c!D!!!!
r c d S r) r
)r rT s r rS zimmutabledict.__init__ s r c 0 t t | ffS r) )rQ rA r s r r? zimmutabledict.__reduce__ s tDzzm++r c |s| S | s&t |t r|S t | S t | }t || |S r) )
isinstancerQ rA r! )r rD d2s r unionzimmutabledict.union sb
K !]++
($Q''' t$$B KKA Ir c < dt | z S )Nzimmutabledict(%s))rA __repr__r s r r] zimmutabledict.__repr__ s "T]]4%8%888r N)r r r rF rM clearrB popitem
setdefaultr! r rS r? r[ r] r
r r rQ rQ s{ 2D2OOEOCO'OJ
, , , 9 9 9 9 9r rQ c e Zd ZdZdZd Zd Zd Z fdZd Z d Z
d Z d
Z d Z
d Zd
Zd Zd Zd Zd ZddZd Zd Zd Zd Zd Z xZS )
Propertiesz8Provide a __getattr__/__setattr__ interface over a dict._datac > t | d| d S Nrd objectr2 )r datas r rS zProperties.__init__ s 4$/////r c * t | j S r) )lenrd r s r __len__zProperties.__len__ s 4: r c h t t | j S r) )iterr rd valuesr s r __iter__zProperties.__iter__ s& D**,,--...r c t t t | d | j D z S )Nc , g | ]}t | S r
)str)r* ks r r, z&Properties.__dir__.. s+ /
/
/
CFF/
/
/
r )dirsuperrb rd r )r rI s r __dir__zProperties.__dir__ sJ 5T**++ /
/
JOO - -/
/
/
r c @ t | t | z S r) r r others r __add__zProperties.__add__ s DzzDKK''r c || j |< d S r) rc r r0 objs r rO zProperties.__setitem__
3r c | j | S r) rc r r0 s r __getitem__zProperties.__getitem__ z# r c | j |= d S r) rc r s r rN zProperties.__delitem__ s JsOOOr c || j |< d S r) rc r~ s r r2 zProperties.__setattr__ r r c d| j iS rf rc r s r __getstate__zProperties.__getstate__ s $$r c J t | d|d d S rf rg )r states r __setstate__zProperties.__setstate__ s$ 4%.99999r c X | j | S # t $ r t | w xY wr) )rd KeyErrorr. r s r __getattr__zProperties.__getattr__ s< &:c? " & & & %% % &s )c || j v S r) rc r s r __contains__zProperties.__contains__ dj r c * t | j S )z8Return an immutable proxy for this :class:`.Properties`.)ImmutablePropertiesrd r s r as_immutablezProperties.as_immutable s #4:...r c : | j | d S r) )rd r! r r1 s r r! zProperties.update s
% r Nc || v r| | S |S r) r
)r r0 defaults r getzProperties.get s $;;9 Nr c * t | j S r) )r rd r s r r zProperties.keys DJ r c N t | j S r) )r rd ro r s r ro zProperties.values s DJ%%''(((r c N t | j S r) )r rd itemsr s r r zProperties.items s DJ$$&&'''r c || j v S r) rc r s r has_keyzProperties.has_key r r c 8 | j d S r) )rd r^ r s r r^ zProperties.clear s
r r) )r r r r8 r rS rl rp rw r| rO r rN r2 r r r r r r! r r ro r r r^
__classcell__)rI s @r rb rb st BBI0 0 0 / / /
( ( ( % % %: : :& & & ! ! !/ / /
! ! ! ) ) )( ( (! ! ! r rb c e Zd ZdZdZd ZdS )OrderedPropertieszUProvide a __getattr__/__setattr__ interface with an OrderedDict
as backing store.r
c T t | t d S r) )rb rS OrderedDictr s r rS zOrderedProperties.__init__ s" D+--00000r N)r r r r8 r rS r
r r r r s4 I1 1 1 1 1r r c e Zd ZdZdZdS )r zDProvide immutable dict/object attribute to an underlying dictionary.r
N)r r r r8 r r
r r r r s NNIIIr r c e Zd ZdZdZd ZddZd Zd Zd Z d Z
dd
Z d Z d Z
d
Zd Zd Zer d Zd Zd Zd Zd Zd Zd ZdS )r zCA dict that returns keys/values/items in the order they were added._listc : t | ffS r) )r r r s r r? zOrderedDict.__reduce__ s TZZ\\O++r Nc Z g | _ ||r | j di | d S d S | j |fi | d S )Nr
)r r! )r _OrderedDict____sequencekwargss r rS zOrderedDict.__init__ sa
& %%f%%%%%
&
&
DK / / / / / / /r c H g | _ t | d S r) )r rA r^ r s r r^ zOrderedDict.clear s!
4r c * | S r) )__copy__r s r copyzOrderedDict.copy s }} r c t | S r) )r r s r r zOrderedDict.__copy__ s 4 r c * | j j |i | d S r) )r sortrJ s r r zOrderedDict.sort! s!
######r c |Qt |d r4| D ] }| ||| n
|D ]
\ }}|| |< |r| | d S d S )Nr )hasattrr rO r! )r r r r0 r1 s r r! zOrderedDict.update$ s #|V,,
&',,.. = =C$$S,s*;<<<<= #/ & &JC %DII KK r c d || vr| || |S | | S r) )rO r r/ s r r` zOrderedDict.setdefault/ s: d?? S% ( ( (L##C(( (r c * t | j S r) rn r r s r rp zOrderedDict.__iter__6 r r c t | S r) ry r s r r zOrderedDict.keys9 s Dzzr c * fd j D S )Nc g | ]
}| S r
r
r5 s r r, z&OrderedDict.values..= s 000cS 000r r r s `r ro zOrderedDict.values< s 0000TZ0000r c * fd j D S )Nc $ g | ] }|| f
S r
r
r5 s r r, z%OrderedDict.items..@ s" 777Sd3i 777r r r s `r r zOrderedDict.items? s 7777DJ7777r c D t | S r) )rn ro r s r
itervalueszOrderedDict.itervaluesD s
&& &r c t | S r) )rn r s r iterkeyszOrderedDict.iterkeysG s :: r c D t | S r) )rn r r s r iteritemszOrderedDict.iteritemsJ s
%% %r c || vr4 | j | n# t $ r |g| _ Y nw xY wt | || d S r) )r appendr. rA rO r~ s r rO zOrderedDict.__setitem__M ss d??
#
!!#&&&&!
#
#
# "U
#
sC(((((s ! 66c p t | | | j | d S r) )rA rN r remover s r rN zOrderedDict.__delitem__W s4 s###
# r c l || v }t j | |g|R }|r| j | |S r) )rA rB r r )r r0 r presentr1 s r rB zOrderedDict.pop[ sG +s-W--- # J c " " " r c z t | }| j |d |S Nr )rA r_ r r r items r r_ zOrderedDict.popitemb s2 ||D!!
$q'""" r r) )r r r r8 r r? rS r^ r r r r! r` rp r ro r r r r r rO rN rB r_ r
r r r r sP MMI, , ,0 0 0 0 ! ! !$ $ $ ) ) ) 1 1 18 8 8 & ' ' ' & & &) ) ) r r c e Zd ZddZd Zd Zd Zd Zd Zd Z d Z
d
Z d Z e Z
d ZeZd
ZeZd ZeZd ZeZd ZeZd ZeZd ZeZd Z e Z dS )
OrderedSetNc t | g | _ |6t | | _ t | | j d S g | _ d S r) )setrS r unique_listr! rC s r rS zOrderedSet.__init__i sT T
=$Q DJ JJtTZ ( ( ( ( (DJJJr c x || vr| j | t | | d S r) r r r addr elements r r zOrderedSet.addr s= $ J g & & & g r c p t | | | j | d S r) )r r r r s r r zOrderedSet.removew s2
4!!!
'"""""r c z || vr| j || t | | d S r) )r insertr r )r posr s r r zOrderedSet.insert{ s? $ J c7 + + + g r c | || v r7| j | t | | d S d S r) )r r r r s r discardzOrderedSet.discard sB d?? J g & & & JJtW % % % % % ?r c H t | g | _ d S r) )r r^ r r s r r^ zOrderedSet.clear s $
r c | j | S r) r r s r r zOrderedSet.__getitem__ r r c * t | j S r) r r s r rp zOrderedSet.__iter__ r r c , | | S r) )r[ rz s r r| zOrderedSet.__add__ s zz% r c 0 | j j d| j dS N())rI r r r s r r] zOrderedSet.__repr__ s >222DJJJ??r c |D ];}|| vr5| j | t | | <| S r) r )r iterablees r r! zOrderedSet.update sJ ! !A}}
!!!$$$a r c Z | | }| | |S r) )rI r! r r{ results r r[ zOrderedSet.union s* %%
e
r c d t | fd| D S )Nc 3 $ K | ]
}|v |V d S r) r
r* ar{ s r z*OrderedSet.intersection.. s' < . s' B Ba1E>>>>>> B Br c 3 $ K | ]
}|v|V d S r) r
r* r r s r r z2OrderedSet.symmetric_difference.. s' 88A!4--a----88r )r rI r! r s `` r symmetric_differencez OrderedSet.symmetric_difference sa E
B B B B4 B B BBB
8888888888
r c d t | fd| D S )Nc 3 $ K | ]
}|v|V d S r) r
r s r r z(OrderedSet.difference.. s' @ @A% a @ @r r rz s `r
differencezOrderedSet.difference s5 E
~~ @ @ @ @ @ @ @@@@r c t t | fd| j D | _ | S )Nc g | ]}|v | S r
r
r s r r, z2OrderedSet.intersection_update.. s :::AqEzzazzzr )r intersection_updater rz s `r r z OrderedSet.intersection_update sF E
e,,,:::::::
r c t | fd j D _ xj fd|j D z
c_ S )Nc g | ]}|v | S r
r
r s r r, z:OrderedSet.symmetric_difference_update.. 999AqDyyayyyr c g | ]}|v | S r
r
r s r r, z:OrderedSet.symmetric_difference_update.. s ;;;Qdqr )r symmetric_difference_updater rz s ` r r z&OrderedSet.symmetric_difference_update sb ''e4449999999
;;;;%+;;;;
r c n t | fd j D _ S )Nc g | ]}|v | S r
r
r s r r, z0OrderedSet.difference_update.. r r )r difference_updater rz s ` r r z OrderedSet.difference_update s; dE***9999999
r r) ) r r r rS r r r r r^ r rp r| r] __str__r! __ior__r[ __or__r __and__r __xor__r __sub__r __iand__r __ixor__r __isub__r
r r r r h sf
# # #
& & &
! ! !@ @ @ G G
F= = = G #GA A A G #H +H
!HHHr r c e Zd ZdZd(dZd Zd Zd Zd Zd Z d Z
d
Z d Z d Z
d
Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Z d Z d Z d Z d Z d Z!d! Z"d" Z#d# Z$e$Z%d$ Z&d% Z'd& Z(d' Z)dS )) IdentitySetzA set that considers only object id() for uniqueness.
This strategy has edge cases for builtin types- it's possible to have
two 'foo' strings in one of these sets, for example. Use sparingly.
Nc ^ t | _ |r| | d S d S r) )rA _membersr! r r s r rS zIdentitySet.__init__ s7
" KK ! ! ! ! ! " "r c 4 || j t | < d S r) r idr s r r zIdentitySet.add s #(
bii r c . t | | j v S r) )r r r s r r zIdentitySet.__contains__ s %yyDM))r c 0 | j t | = d S r) r r s r r zIdentitySet.remove s M"U)) $ $ $r c T | | d S # t $ r Y d S w xY wr) )r r r s r r zIdentitySet.discard sA KK DD s
''c | j }|d S # t $ r t d w xY w)Nr zpop from an empty set)r r_ r )r pairs r rB zIdentitySet.pop sM 4=((**D7N 4 4 4233 3 4s # =c 8 | j d S r) )r r^ r s r r^ zIdentitySet.clear s
r c t d )Nz cannot compare sets using cmp()rH rz s r __cmp__zIdentitySet.__cmp__ s 9:::r c P t |t r| j |j k S dS )NFrY r r rz s r __eq__zIdentitySet.__eq__ s( e[ ) ) =EN2 25r c P t |t r| j |j k S dS NTr# rz s r __ne__zIdentitySet.__ne__ s( e[ ) ) =EN2 24r c | | }t | t | k rdS t |j j t | j D ]} dS dS NFTrI rk r r r rn r r r r{ ms r issubsetzIdentitySet.issubset sv x(( t99s5zz ! !5& N 'dm.@.@.B.B)C)C
A 55tr c d t |t st S | | S r) )rY r NotImplementedr- rz s r __le__zIdentitySet.__le__ s, %-- "! !}}U###r c t |t st S t | t | k o| | S r) )rY r r/ rk r- rz s r __lt__zIdentitySet.__lt__ sB %-- "! !4yy3u::%>$--*>*>>r c | | }t | t | k rdS t | j j t |j D ]} dS dS r) r* r+ s r
issupersetzIdentitySet.issuperset sv x(( t99s5zz ! !5& M &U^-@-@-B-B(C(C
A 55tr c d t |t st S | | S r) )rY r r/ r4 rz s r __ge__zIdentitySet.__ge__) , %-- "! !u%%%r c t |t st S t | t | k o| | S r) )rY r r/ rk r4 rz s r __gt__zIdentitySet.__gt__. sB %-- "! !4yy3u::%@$//%*@*@@r c | }| j }|j | |j d |D |S )Nc 3 8 K | ]}t | |fV d S r) r r* r s r r z$IdentitySet.union..7 s, B B#3~ B B B B B Br )rI r r! )r r r memberss r r[ zIdentitySet.union3 sX !!- w''' B B B B BBBB
r c d t |t st S | | S r) )rY r r/ r[ rz s r r
zIdentitySet.__or__: s, %-- "! !zz% r c N | j d |D d S )Nc 3 8 K | ]}t | |fV d S r) r< r= s r r z%IdentitySet.update..@ s, @ @bggs^ @ @ @ @ @ @r )r r! r s r r! zIdentitySet.update? s-
@ @x @ @ @@@@@@r c h t |t st S | | | S r) )rY r r/ r! rz s r r zIdentitySet.__ior__B s1 %-- "! ! E r c | }| j }d |D |j fd| D |S )Nc , h | ]}t | S r
r< r= s r z)IdentitySet.difference..K ---SC---r c 3 . K | ]\ }}|v ||fV d S r) r
r* rt vr{ s r r z)IdentitySet.difference..M / B B11E>>aV>>>> B Br rI r r! r r r r r> r{ s @r r zIdentitySet.differenceH sl !!---H--- B B B B
B B B
r c d t |t st S | | S r) )rY r r/ r rz s r r
zIdentitySet.__sub__Q r7 r c D | | j | _ d S r) )r r r s r r z IdentitySet.difference_updateV s 11:
r c h t |t st S | | | S r) )rY r r/ r rz s r r zIdentitySet.__isub__Y s3 %-- "! ! u%%% r c | }| j }d |D |j fd| D |S )Nc , h | ]}t | S r
r< r= s r rE z+IdentitySet.intersection..b rF r c 3 . K | ]\ }}|v ||fV d S r) r
rH s r r z+IdentitySet.intersection..c s8
q!!u**QF****
r rK rL s @r r zIdentitySet.intersection_ s{ !!---H---
&}}
r c d t |t st S | | S r) )rY r r/ r rz s r r zIdentitySet.__and__h s. %-- "! ! '''r c D | | j | _ d S r) )r r r s r r z IdentitySet.intersection_updatem s ))(33<
r c h t |t st S | | | S r) )rY r r/ r rz s r r zIdentitySet.__iand__p s3 %-- "! ! ''' r c 8 | }| j d |D |j fd D |j fd D |S )Nc . i | ]}t | |S r
r< r= s r r6 z4IdentitySet.symmetric_difference..y s 222#C#222r c 3 . K | ]\ }}|v ||fV d S r) r
rH s r r z3IdentitySet.symmetric_difference..{ rJ r c 3 . K | ]\ }}|v ||fV d S r) r
)r* rt rI r> s r r z3IdentitySet.symmetric_difference..~ s5 B B1'1A1AaV1A1A1A1A B Br rK rL s @@r r z IdentitySet.symmetric_differencev s !!-22222 B B B B
B B B
B B B B
B B B
r c d t |t st S | | S r) rY r r/ r rz s r r zIdentitySet.__xor__ s. %-- "! !((///r c D | | j | _ d S r) )r r r s r r z'IdentitySet.symmetric_difference_update s 11(;;D
r c h t |t st S | | | S r) r[ rz s r r zIdentitySet.__ixor__ s3 %-- "! ! !!%((( r c z t | t | j S r) )typern r ro r s r r zIdentitySet.copy s. tDzz$t} 3 3 5 566777r c * t | j S r) )rk r r s r rl zIdentitySet.__len__ 4=!!!r c N t | j S r) )rn r ro r s r rp zIdentitySet.__iter__ s DM((**+++r c t d )Nzset objects are unhashabler r s r __hash__zIdentitySet.__hash__ s 4555r c ~ t | j dt | j dS r )r_ r r r ro r s r r] zIdentitySet.__repr__ s8 ::...T]5I5I5K5K0L0L0L0LMMr r) )*r r r r8 rS r r r r rB r^ r! r$ r' r- r0 r2 r4 r6 r9 r[ r
r! r r r
r r r r r r r r r r r r rl rp rd r] r
r r r r sc " " " "
) ) )* * *% % % 4 4 4 ; ; ; $ $ $
? ? ?
& & &
A A A
! ! !
A A A & & &
; ; ; ( ( (
= = =
0 0 0
E E E 8 8 8 H" " ", , ,6 6 6N N N N Nr r c . e Zd ZddZd Zd Zd Zd ZdS ) WeakSequencer
c j t j | fd| _ fd|D | _ d S )Nc V | }| |j | d S d S r) )_storager )r selfrefr s r _removez&WeakSequence.__init__.._remove s7 799D
$$T***** r c : g | ]}t j | S r
)weakrefref)r* r rl s r r, z)WeakSequence.__init__.. s2
.5GK ) )
r )rn ro rl rj )r _WeakSequence__elementsrl s @r rS zWeakSequence.__init__ s] #*+d"3"3 + + + +
9C
r c j | j t j || j d S r) )rj r rn ro rl r s r r zWeakSequence.append s,
W[t| < <=====r c * t | j S r) )rk rj r s r rl zWeakSequence.__len__ ra r c 8 d d | j D D S )Nc 3 K | ]}||V d S r) r
r= s r r z(WeakSequence.__iter__.. s+
sC
r c 3 * K | ]} | V d S r) r
)r* ro s r r z(WeakSequence.__iter__.. s( ;;cCCEE;;;;;;r )rj r s r rp zWeakSequence.__iter__ s3
;;T];;;
r c r | j | } | S # t $ r t d|z w xY w)NzIndex %s out of range)rj r
IndexError)r indexr s r r zWeakSequence.__getitem__ sQ -&C 355L > > > 4u <== = >s
6N)r
)r r r rS r rl rp r r
r r rg rg sd
> > >" " "
r rg c e Zd ZddZdS )OrderedIdentitySetNc t | t | _ |r|D ]}| | d S d S r) )r rS r r r )r r os r rS zOrderedIdentitySet.__init__ s] T"""#
r r) )r r r rS r
r r rz rz s( r rz c e Zd ZdZd Zd ZdS ) PopulateDictzA dict which populates missing values via a creation function.
Note the creation function takes a key, unlike
collections.defaultdict.
c || _ d S r) creator)r r s r rS zPopulateDict.__init__ s
r c : | | x| |< }|S r) r r r0 vals r __missing__zPopulateDict.__missing__ s! ,,s+++S C
r Nr r r r8 rS r r
r r r~ r~ s< r r~ c e Zd ZdZd Zd ZdS )WeakPopulateDictzaLike PopulateDict, but assumes a self + a method and does not create
a reference cycle.
c ^ |j | _ |j }t j | | _ d S r) )__func__r __self__rn ro weakself)r creator_methodr s r rS zWeakPopulateDict.__init__ s) %. !* H--
r c ` | | | x| |< }|S r) )r r r s r r z WeakPopulateDict.__missing__ s+ ,,t}}<<<S C
r Nr r
r r r r s<
. . .
r r c D t t j | S r) )r9 operator
itemgetter)idxs r r s ,S1122 r c t t j sfd| D S fd| D S )Nc 2 g | ]}|v | |S r
r
)r* xseenseen_adds r r, z unique_list.. s* DDDa!4-- ----r c V g | ]%} | v | #|&S r
r
)r* r hashfuncr r s r r, z unique_list.. sM
x{{$&&xx /D/D&
&&&r )r r )seqr r r s `@@r r r so 55DxH
DDDDD3DDDD
r c & e Zd ZdZddZd Zd ZdS )UniqueAppenderzAppends items to a collection ensuring uniqueness.
Additional appends() of the same object are ignored. Membership is
determined by identity (``is a``) not equality (``==``).
Nc || _ i | _ |rt || | _ d S t |d r|j | _ d S t |d r|j | _ d S d S )Nr r )ri _uniquegetattr_data_appenderr r r )r ri vias r rS zUniqueAppender.__init__ s~ +")$"4"4D
T8
$
$ +"&+D
T5
!
! +"&(D + +r c x t | }|| j vr!| | d| j |< d S d S r& )r r r )r r id_s r r zUniqueAppender.append sH hh dl " " % % % $DL # "r c * t | j S r) )rn ri r s r rp zUniqueAppender.__iter__! s DI r r) )r r r r8 rS r rp r
r r r r
sP + + + +% % % r r c t | dk r5t | d t j rt | d S | S )Nr r )rk rY types
GeneratorTyper )rK s r coerce_generator_argr % s;
3xx1}}CFE,?@@}CF||
r c | |S t | t j r t | t t z r| gS t | t
r| S t | S r) )rY r Iterabler r r )r r s r to_listr , sg y a 1 2 2 j <, &7 7 s
At Awwr c Z t | d |D S )zreturn True if any items of set\_ are present in iterable.
Goes through special effort to ensure __hash__ is not called
on items in iterable that don't support it.
c g | ] }|j | S r
)rd r* is r r, z$has_intersection..A s "E"E"E!*"E1"E"E"Er )boolr )set_r s r has_intersectionr 9 s/ !!"E"Eh"E"E"EFF G GGr c | t S t | t s t t | S | S r) )r rY r r s r to_setr D s9 yuu a 71:: r c | t S t | t s t t | S | S r) )
column_setrY r r s r
to_column_setr M s< y|| a $ $ '!**%%%r c v | } |r| | | j di | | S )z5Copy the given dict and update with the given values.r
)r r! )rD _newrL s r update_copyr V s@
A AHNNrNNN Hr c # K | D ]B}t |t s't |d rt | D ]}|V >|V CdS )zGiven an iterator of which further sub-elements may also be
iterators, flatten the sub-elements into a single iterator.
rp N)rY rs r flatten_iterator)r elemys r r r ` sx
$$$ z)B)B %d++
JJJJ r c ` e Zd ZdZdZddZd ZddZd Zd
Z d Z
d Z e d
Z
d ZdS )LRUCachezDictionary with 'squishy' removal of least
recently used items.
Note that either get() or [] should be used here, but
generally its not safe to do an "in" check first as the dictionary
can change subsequent to that call.
)capacity threshold
size_alert_counter_mutexd ?Nc n || _ || _ || _ d| _ t j | _ d S r )r r r r r
Lockr )r r r r s r rS zLRUCache.__init__y s1
"$
n&& r c 0 | xj dz
c_ | j S Nr )r r s r _inc_counterzLRUCache._inc_counter s
} r c t | || }||ur | |d< |d S |S N r )rA r r )r r0 r r s r r z LRUCache.get sE xxc7++ w ''))DG7NNr c v t | | }| |d< |d S r )rA r r )r r0 r s r r zLRUCache.__getitem__ s5 c**##%%QAwr c J d t | D S )Nc g | ]
}|d S )r r
r s r r, z#LRUCache.values.. s 000!000r )rA ro r s r ro zLRUCache.values s" 00dkk$ / /0000r c ( || v r| | S || |< |S r) r
r/ s r r` zLRUCache.setdefault s# $;;9 DILr c t | | }|4||| g}t | || n||d< | d S r )rA r r rO _manage_size)r r0 r1 r s r rO zLRUCache.__setitem__ sn xxc"" < 1 1 3 34D T3 - - - -DG r c 0 | j | j | j z z S r) )r r r s r size_thresholdzLRUCache.size_threshold s }t}t~ ===r c x | j d sd S t | j }t | | j | j | j z z k r|rd}| | t t | t j d d }|| j d D ] } | |d =
# t $ r Y w xY wt | | j | j | j z z k | j
d S # | j
w xY w)NFr T)r0 reverser )r acquirer r rk r r sortedrA ro r r r release)r r
by_counterr s r r zLRUCache._manage_size sL {""5)) F " do..Jd))dmdmdn.L LLL *!&JOOD))) #KK%%8+>q+A+A4
't} 7 ! !D! aMM# ! ! ! ! d))dmdmdn.L LLL
K ! ! ! ! !DK ! ! ! !s0 B"D C
D
CD C+D D9)r r Nr) )r r r r8 r rS r r r ro r` rO r9 r r r
r r r r m s LI' ' ' '
1 1 1 > > X>" " " " "r r r c
D | ft | z }t | }|r|S t | t ft d t
| D dgz }||_ t d |D |_ |t |< |S )Nc 6 g | ]\ }}||t | fS r) )_property_getters)r* r fields r r, z+lightweight_named_tuple.. s7
C$ )#./$$$r )r r
c g | ]}||S r) r
)r* fs r r, z+lightweight_named_tuple.. s ???! A r ) r
_lw_tuplesr r_ r; rA enumerater> r )namefieldshash_tp_clss r lightweight_named_tupler s
GeFmm #E
^^E
"
"F
"+F"3"3
!!
"
F !F??v???@@FN Ju Mr c 0 e Zd ZdZd Zd Zd Zd Zd ZdS )ScopedRegistrya A Registry that can store one or multiple instances of a single
class on the basis of a "scope" function.
The object implements ``__call__`` as the "getter", so by
calling ``myregistry()`` the contained object is returned
for the current scope.
:param createfunc:
a callable that returns a new object to be placed in the registry
:param scopefunc:
a callable that will return a key to store/retrieve an object.
c 0 || _ || _ i | _ dS )aV Construct a new :class:`.ScopedRegistry`.
:param createfunc: A creation function that will generate
a new value for the current scope, if none is present.
:param scopefunc: A function that returns a hashable
token representing the current scope (such as, current
thread identifier).
N)
createfunc scopefuncregistry)r r r s r rS zScopedRegistry.__init__ s %"
r c | } | j | S # t $ r0 | j || cY S w xY wr) )r r r r` r r s r __call__zScopedRegistry.__call__ sk nn D=% % D D D=++C 1B1BCC C C C Ds # 7A A c 8 | | j v S )z9Return True if an object is present in the current scope.)r r r s r haszScopedRegistry.has s ~~ 4=00r c > || j | < dS )z$Set the value for the current scope.N)r r r r s r r zScopedRegistry.set s +.
dnn&&'''r c ^ | j | = dS # t $ r Y dS w xY w)z Clear the current scope, if any.N)r r r r s r r^ zScopedRegistry.clear
sC
dnn . ./// DD s
,,N r r r r8 rS r r r r^ r
r r r r sl
D D D1 1 1
. . .
r r c 0 e Zd ZdZd Zd Zd Zd Zd ZdS )ThreadLocalRegistryz\A :class:`.ScopedRegistry` that uses a ``threading.local()``
variable for storage.
c D || _ t j | _ d S r) )r r
localr )r r s r rS z ThreadLocalRegistry.__init__ s $!))
r c | j j S # t $ r% | x}| j _ |cY S w xY wr) )r r1 r. r )r r s r r z ThreadLocalRegistry.__call__ sO =& & (,(9(9 9C$-%JJJ s ,==c , t | j d S )Nr1 )r r r s r r zThreadLocalRegistry.has$ s t}g...r c || j _ d S r) )r r1 r s r r zThreadLocalRegistry.set' s !
r c 8 | j `d S # t $ r Y d S w xY wr) )r r1 r. r s r r^ zThreadLocalRegistry.clear* s7
### DD s
Nr r
r r r r si
* * * / / /" " " r r c 8 d}| D ]}||u r|dz
}|dk r dS dS )zrGiven a sequence and search object, return True if there's more
than one, False if zero or one of them.
r r TFr
)sequencetargetcr s r has_dupesr 1 s@
A 6>>
FA1uutt 5r r) )7r8
__future__r r r rn compatr r r r r r
frozenset EMPTY_SETr r r r; rh rF rA rQ rb r r r r r r rg rz r~ r r column_dictordered_column_setr _gettersr r r r r r r r r r r r r r r r r
r r r s! & % & & & & & & # # # # # # ) ) ) ) ) )
IKK " " " " " " " " @@ @@ @@ @@ @@# @@ @@ @@F
(9 9 9 9 9 9 9 9 9 9 9 9 9& 9 9 9@L L L L L L L L^1 1 1 1 1
1 1 1 ,j ^ ^ ^ ^ ^$ ^ ^ ^Bh! h! h! h! h! h! h! h!VLN LN LN LN LN& LN LN LN^ 6 D
4
t
(
<+ , , L22
V 6
H H H
N" N" N" N" N"t N" N" N"b Xc]]
45 5 5 5 5V 5 5 5p . < r