a mzf@sdZddlZddlZddlZddlZddlZddlZddlZddlZddl Z ddlm Z ddl m Z mZzddlmZWneyddlmZYn0gdZGdd d eZeZd d ZGd d d eZeZeeeegZGdddeZeeZde_ddZddZ ddZ!ddZ"deddZ#e#Z$ddZ%GdddZ&e&Z'e'ej(Z)d e)_Gd!d"d"Z*d#d$Z+d%d&Z,dfd'd(Z-d)d*Z.Gd+d,d,Z/e/Z0dgd.d/Z1d0d1Z2d2d3Z3d4d5Z4d6d7Z5d8d9Z6d:d;Z7dhd=d>Z8did?d@Z9djdAdBZ:dkdCdDZ;dldEdFZdKdLZ?dMdNZ@dOdPZAdmdQdRZBGdSdTdTZCeCZDGdUdVdVZEeEZFdndWdXZGGdYdZdZe ZHeHZId[d\ZJd]d^ZKe)d_ZLdod`daZMGdbdcdcZNeOddkrddlPZPePQdS)pz$ General Utilities (part of web.py) N)local) iteritems itervalues)StringIO)1StoragestoragestorifyCountercounteritersrstripslstripsstrips safeunicodesafestr timelimitMemoizememoize re_compilere_submgroupuniqiterview IterBetter iterbettersafeiter safewrite dictreversedictfind dictfindalldictincrdictaddrequeuerestacklistgetintgetdatestrnumifydenumifycommifydateifynthstrcond CaptureStdout capturestdoutProfileprofiletryall ThreadedDict threadeddict autoassignto36sendmailc@s0eZdZdZddZddZddZdd Zd S) rao A Storage object is like a dictionary except `obj.foo` can be used in addition to `obj['foo']`. >>> o = storage(a=1) >>> o.a 1 >>> o['a'] 1 >>> o.a = 2 >>> o['a'] 2 >>> del o.a >>> o.a Traceback (most recent call last): ... AttributeError: 'a' c Cs<z ||WSty6}zt|WYd}~n d}~00dSNKeyErrorAttributeErrorselfkeykr@7/var/www/media/lib/python3.9/site-packages/web/utils.py __getattr__fs zStorage.__getattr__cCs |||<dSr8r@r=r>valuer@r@rA __setattr__lszStorage.__setattr__c Cs<z ||=Wn,ty6}zt|WYd}~n d}~00dSr8r9r<r@r@rA __delattr__os zStorage.__delattr__cCsdt|dS)Nz dict__repr__r=r@r@rArJuszStorage.__repr__N)__name__ __module__ __qualname____doc__rBrErFrJr@r@r@rArQs rcs4|ddtdur&tdr&fddfddt}|t|D]}||}t|trt||trfdd |D}n|d }t||t s|}t||trt|ts|g}t |||qVt |D]H\}}|}t||r||}|d kr"t|ts"|f}t |||q|S) a  Creates a `storage` object from dictionary `mapping`, raising `KeyError` if d doesn't have all of the keys in `requireds` and using the default values for keys found in `defaults`. For example, `storify({'a':1, 'c':3}, b=2, c=0)` will return the equivalent of `storage({'a':1, 'b':2, 'c':3})`. If a `storify` value is a list (e.g. multiple values in a form submission), `storify` returns the last element of the list, unless the key appears in `defaults` as a list. Thus: >>> storify({'a':[1, 2]}).a 2 >>> storify({'a':[1, 2]}, a=[]).a [1, 2] >>> storify({'a':1}, a=[]).a [1] >>> storify({}, a=[]).a [] Similarly, if the value has a `value` attribute, `storify will return _its_ value, unless the key appears in `defaults` as a dictionary. >>> storify({'a':storage(value=1)}).a 1 >>> storify({'a':storage(value=1)}, a={}).a >>> storify({}, a={}).a {} _unicodeF__call__csrt|tr|S|SdSr8) isinstancestr)s)rP to_unicoder@rA unicodifyszstorify..unicodifycs:t|drt|dr|jSt|dr.|jS|SdS)NfilerD)hasattrrDx)rVr@rAgetvalues   zstorify..getvaluecsg|] }|qSr@r@).0rZ)r[r@rA zstorify..r@) poprrXrtuplekeysrRlistgetrIsetattrr)mappingZ requiredsdefaultsZstorr>rDresultr@)rPr[rUrVrAr |s4!    r c@sPeZdZdZddZddZddZdd Zd d Zd d Z ddZ ddZ dS)r aKeeps count of how many times something is added. >>> c = counter() >>> c.add('x') >>> c.add('x') >>> c.add('x') >>> c.add('x') >>> c.add('x') >>> c.add('y') >>> c['y'] 1 >>> c['x'] 5 >>> c.most() ['x'] cCs ||d||d7<dS)Nrr setdefault)r=nr@r@rAadds z Counter.addcs"tt|fddt|DS)z$Returns the keys with maximum count.csg|]\}}|kr|qSr@r@r\r?vmr@rAr]r^z Counter.most..)maxrrrKr@rorAmosts z Counter.mostcs"t|fddt|DS)z$Returns the keys with minimum count.csg|]\}}|kr|qSr@r@rmror@rAr]r^z!Counter.least..)minrrrKr@rorAleasts z Counter.leastcCst||t|S)aReturns what percentage a certain key is of all entries. >>> c = counter() >>> c.add('x') >>> c.add('x') >>> c.add('x') >>> c.add('y') >>> c.percent('x') 0.75 >>> c.percent('y') 0.25 )floatsumvaluesr=r>r@r@rApercents zCounter.percentcstfddddS)zReturns keys sorted by value. >>> c = counter() >>> c.add('x') >>> c.add('x') >>> c.add('y') >>> c.sorted_keys() ['x', 'y'] cs|Sr8r@)r?rKr@rAr^z%Counter.sorted_keys..T)r>reverse)sortedrbrKr@rKrA sorted_keyss zCounter.sorted_keyscsfddDS)zReturns values sorted by value. >>> c = counter() >>> c.add('x') >>> c.add('x') >>> c.add('y') >>> c.sorted_values() [2, 1] csg|] }|qSr@r@r\r?rKr@rAr]r^z)Counter.sorted_values..r}rKr@rKrA sorted_valuess zCounter.sorted_valuescsfddDS)zReturns items sorted by value. >>> c = counter() >>> c.add('x') >>> c.add('x') >>> c.add('y') >>> c.sorted_items() [('x', 2), ('y', 1)] csg|]}||fqSr@r@r~rKr@rAr]r^z(Counter.sorted_items..rrKr@rKrA sorted_itemss zCounter.sorted_itemscCsdt|dS)Nz >> rstrips("foobar", "bar") 'foo' rrrrr@r@rAr Dsr cCs td||S)aF removes the string `remove` from the left of `text` >>> lstrips("foobar", "foo") 'bar' >>> lstrips('http://foo.org/', ['http://', 'https://']) 'foo.org/' >>> lstrips('FOOBARBAZ', ['FOO', 'BAR']) 'BAZ' >>> lstrips('FOOBARBAZ', ['BAR', 'FOO']) 'BARBAZ' rrrr@r@rArOsrcCstt|||S)zz removes the string `remove` from the both sides of `text` >>> strips("foobarfoo", "foo") 'bar' )r rrr@r@rAr`srutf-8cCs(|rt|drdd|DSt|SdS)z Converts any given object to utf-8 encoded string. >>> safestr('hello') 'hello' >>> safestr(2) '2' __next__cSsg|] }t|qSr@rr\ir@r@rAr]vr^zsafestr..N)rXrS)objencodingr@r@rArks rcsfdd}|S)a A decorator to limit a function to `timeout` seconds, raising `TimeoutError` if it takes longer. >>> import time >>> def meaningoflife(): ... time.sleep(.2) ... return 42 >>> >>> timelimit(.1)(meaningoflife)() Traceback (most recent call last): ... RuntimeError: took too long >>> timelimit(1)(meaningoflife)() 42 _Caveat:_ The function isn't stopped after `timeout` seconds but continues executing in a separate thread. (There seems to be no way to kill a thread.) inspired by csfdd}|S)NcsPGfdddtj}|}||r:td|jrJ|jd|jS)Ncs$eZdZddZfddZdS)z3timelimit.._1.._2..DispatchcSs.tj|d|_d|_|d|dS)NT) threadingThread__init__rherror setDaemonstartrKr@r@rArs   z._1.._2..Dispatch.__init__cs0zi|_Wnt|_Yn0dSr8)rhsysexc_inforrKargsfunctionkwr@rArunsz7timelimit.._1.._2..Dispatch.runN)rLrMrNrrr@rr@rADispatchsrz took too longr)rrjoinis_alive RuntimeErrorrrh)rrrc)rtimeout)rrrA_2s  z!timelimit.._1.._2r@)rrr)rrA_1sztimelimit.._1r@)rrr@rrArs rc@s"eZdZdZdddZddZdS) ra 'Memoizes' a function, caching its return values for each input. If `expires` is specified, values are recalculated after `expires` seconds. If `background` is specified, values are recalculated in a separate thread. >>> calls = 0 >>> def howmanytimeshaveibeencalled(): ... global calls ... calls += 1 ... return calls >>> fastcalls = memoize(howmanytimeshaveibeencalled) >>> howmanytimeshaveibeencalled() 1 >>> howmanytimeshaveibeencalled() 2 >>> fastcalls() 3 >>> fastcalls() 3 >>> import time >>> fastcalls = memoize(howmanytimeshaveibeencalled, .1, background=False) >>> fastcalls() 4 >>> fastcalls() 4 >>> time.sleep(.2) >>> fastcalls() 5 >>> def slowfunc(): ... time.sleep(.1) ... return howmanytimeshaveibeencalled() >>> fastcalls = memoize(slowfunc, .2, background=True) >>> fastcalls() 6 >>> timelimit(.05)(fastcalls)() 6 >>> time.sleep(.2) >>> timelimit(.05)(fastcalls)() 6 >>> timelimit(.05)(fastcalls)() 6 >>> time.sleep(.2) >>> timelimit(.05)(fastcalls)() 7 >>> fastcalls = memoize(slowfunc, None, background=True) >>> threading.Thread(target=fastcalls).start() >>> time.sleep(.01) >>> fastcalls() 9 NTcCs,||_i|_||_||_i|_t|_dSr8)funccacheexpires backgroundrunningrLock running_lock)r=rrrr@r@rArs zMemoize.__init__cstfj*js2tj<Wdn1sF0Yd fdd }jvrz|ddn@jrt jdjkrj rtj |d n|jdS) NFcsVj|rRz0jitfj<Wjnj0dSr8)racquirertimerreleaseblockrr>keywordsr=r@rAupdates z Memoize.__call__..updateTrr)targetr)F) raitemsrrrdrrrrrrrr)r=rrrr@rrArQs ,  "zMemoize.__call__)NTrLrMrNrOrrQr@r@r@rArs3 rz# A memoized version of re.compile. c@seZdZddZddZdS)_re_subm_proxycCs d|_dSr8matchrKr@r@rArsz_re_subm_proxy.__init__cCs ||_dS)Nr)r=rr@r@rArQsz_re_subm_proxy.__call__N)rLrMrNrrQr@r@r@rArsrcCs.t|}t}||j|||||jfS)z Like re.sub, but returns the replacement _and_ the match object. >>> t, m = re_subm('g(oo+)fball', r'f\1lish', 'goooooofball') >>> t 'foooooolish' >>> m.groups() ('oooooo',) )rrsubrQr)patreplstringZ compiled_patproxyr@r@rArs rcs fddtdtDS)z Returns an iterator over a series of lists of length size from iterable. >>> list(group([1,2,3,4], 2)) [[1, 2], [3, 4]] >>> list(group([1,2,3,4,5], 2)) [[1, 2], [3, 4], [5]] c3s|]}||VqdSr8r@rseqsizer@rA 1r^zgroup..r)rangerrr@rrAr(s rcCsJ|p dd}t}g}|D]*}||}||vr0q||||q|S)at Removes duplicate elements from a list while preserving the order of the rest. >>> uniq([9,0,2,1,0]) [9, 0, 2, 1] The value of the optional `key` parameter should be a function that takes a single argument and returns a key to test the uniqueness. >>> uniq(["Foo", "foo", "bar"], key=lambda s: s.lower()) ['Foo', 'bar'] cSs|Sr8r@rYr@r@rArzAr^zuniq..)setrlappend)rr>seenrhrnr?r@r@rAr4s   rc#sdddddddfdd }t}t|}t|D]&\}}tjd |||||VqFtjd |||d |d d S)z Takes an iterable `x` and returns an iterator over it which prints its progress to stderr as it iterates through. FcSs$dt||dtt|||fS)Nz%5.1f%% (%*d/%d)d)rurrS)rklenxr@r@rA plainformatTsziterview..plainformatcSsNtt|||d}||r:dd||dd}nd}dd||fS)Ng?rG rrz[%s%s]=)intru)rrkrvalspacingr@r@rAbarsWs ziterview..barscSs\|dkr dS||krt|}nt||||}t|d\}}t|d\}}d|||fS)Nrz--:--:--<z%02d:%02d:%02d)rdivmod)elapsedrkrZsecsZminsZhrsr@r@rAeta_s ziterview..etacsd||d}||krd}nd}|t|||7}|t|t|||7}||7}|S)Nrz z ETA )rr) starttimerkroutendZWIDTHrrrr@rAformatks ziterview..format r N)rr enumeraterstderrwrite)rZrrrrkyr@rrArMs  rc@s>eZdZdZddZd ddZddZd d Zd d ZeZ dS)ra Returns an object that can be used as an iterator but can also be used via __getitem__ (although it cannot go backwards -- that is, you cannot request `iterbetter[0]` after requesting `iterbetter[1]`). >>> import itertools >>> c = iterbetter(itertools.count()) >>> c[1] 1 >>> c[5] 5 >>> c[3] Traceback (most recent call last): ... IndexError: already passed 3 It is also possible to get the first value of the iterator or None. >>> c = iterbetter(iter([3, 4, 5])) >>> print(c.first()) 3 >>> c = iterbetter(iter([])) >>> print(c.first()) None For boolean test, IterBetter peeps at first value in the itertor without effecting the iteration. >>> c = iterbetter(iter(range(5))) >>> bool(c) True >>> list(c) [0, 1, 2, 3, 4] >>> c = iterbetter(iter([])) >>> bool(c) False >>> list(c) [] cCs|d|_|_dS)Nr)rr)r=iteratorr@r@rArszIterBetter.__init__NcCs*ztt|WSty$|YS0dS)zReturns the first element of the iterator or None when there are no elements. If the optional argument default is specified, that is returned instead of None when there are no elements. N)nextiter StopIteration)r=defaultr@r@rAfirsts zIterBetter.firstccsLt|dr|jVzt|jVWnty6YdS0|jd7_qdS)N_headr)rXrrrrrrKr@r@rA__iter__s  zIterBetter.__iter__cCs|||jkrtdt|z>||jkr@t|j|jd7_q|jd7_t|jWStyvtt|Yn0dS)Nzalready passed r)r IndexErrorrSrrr)r=rr@r@rA __getitem__s     zIterBetter.__getitem__cCsRt|dr|dkSt|dr$dSzt|j|_WntyHYdS0dSdS)N__len__rrTF)rXrrrrrrKr@r@rA __nonzero__s    zIterBetter.__nonzero__)N) rLrMrNrOrrrrr__bool__r@r@r@rAr~s(   rTc#s$fddtVqdS)zPMakes an iterator safe by ignoring the exceptions occurred during the iteration.cs8z WStyYqtYq0qdSr8)r traceback print_excr@itrr@rArs   zsafeiter..nextN)r)rcleanup ignore_errorsr@rrArs rcCsJt|dd}||Wdn1s.0Yt|j|dS)zWrites the content to a temp file and then moves the temp file to given filename to avoid overwriting the existing file in case of errors. z.tmpwN)openrshutilmovename)filenamecontentfr@r@rArs(rcCstddt|DS)z| Returns a new dictionary with keys and values swapped. >>> dictreverse({1: 2, 3: 4}) {2: 1, 4: 3} cSsg|]\}}||fqSr@r@)r\r>rDr@r@rAr]r^zdictreverse..)rIr)rfr@r@rArsrcCs&t|D]\}}||ur|SqdS)z Returns a key whose value in `dictionary` is `element` or, if none exists, None. >>> d = {1:2, 3:4} >>> dictfind(d, 4) 3 >>> dictfind(d, 5) N)r) dictionaryelementr>rDr@r@rArs rcCs,g}t|D]\}}||ur ||q |S)z Returns the keys whose values in `dictionary` are `element` or, if none exists, []. >>> d = {1:4, 3:4} >>> dictfindall(d, 4) [1, 3] >>> dictfindall(d, 5) [] )rr)rrresr>rDr@r@rAr s  r cCs$||d||d7<||S)z Increments `element` in `dictionary`, setting it to one if it doesn't exist. >>> d = {1:2, 3:4} >>> dictincr(d, 1) 3 >>> d[1] 3 >>> dictincr(d, 5) 1 >>> d[5] 1 rrri)rrr@r@rAr!'s r!cGsi}|D]}||q|S)z Returns a dictionary consisting of the keys in the argument dictionaries. If they share a key, the value from the last argument is used. >>> dictadd({1: 0, 2: 0}, {2: 1, 3: 1}) {1: 0, 2: 1, 3: 1} )r)Zdictsrhdctr@r@rAr";s r"r_cCs||}|d||S)zReturns the element at index after moving it to the beginning of the queue. >>> x = [1, 2, 3, 4] >>> requeue(x) 4 >>> x [4, 1, 2, 3] r)r`insert)queueindexrZr@r@rAr#Is  r#cCs||}|||S)zReturns the element at index after moving it to the top of stack. >>> x = [1, 2, 3, 4] >>> restack(x) 1 >>> x [2, 3, 4, 1] )r`r)stackr rZr@r@rAr$Ws  r$cCst|d|kr|S||S)z Returns `lst[ind]` if it exists, `default` otherwise. >>> listget(['a'], 0) 'a' >>> listget(['a'], 1) >>> listget(['a'], 1, 'b') 'b' r)r)lstindrr@r@rAr%es r%c Cs*z t|WSttfy$|YS0dS)z Returns `integer` as an int or `default` if it can't. >>> intget('3') 3 >>> intget('3a') >>> intget('3a', 0) 0 N)r TypeErrorr)integerrr@r@rAr&ts  r&c Csddd}d}|sdS|s$tj}t|jdkr>tj|}t|jdkrZtj|}n"t|jdkr|t|j|j|j}||}t|j ||j |j d}t ||}|d kr|d 9}|rt |d kr||d S| d dd}|j|jks|d kr|d|j7}|St|r^t |dkr:||ddSt |dkrT||ddS||dS|j }|j rzt|j d}t |dkr||ddS||dS)ab Converts a (UTC) datetime object to a nice string representation. >>> from datetime import datetime, timedelta >>> d = datetime(1970, 5, 1) >>> datestr(d, now=d) '0 microseconds ago' >>> for t, v in iteritems({ ... timedelta(microseconds=1): '1 microsecond ago', ... timedelta(microseconds=2): '2 microseconds ago', ... -timedelta(microseconds=1): '1 microsecond from now', ... -timedelta(microseconds=2): '2 microseconds from now', ... timedelta(microseconds=2000): '2 milliseconds ago', ... timedelta(seconds=2): '2 seconds ago', ... timedelta(seconds=2*60): '2 minutes ago', ... timedelta(seconds=2*60*60): '2 hours ago', ... timedelta(days=2): '2 days ago', ... }): ... assert datestr(d, now=d+t) == v >>> datestr(datetime(1970, 1, 1), now=d) 'January 1' >>> datestr(datetime(1969, 1, 1), now=d) 'January 1, 1969' >>> datestr(datetime(1970, 6, 1), now=d) 'June 1, 1970' >>> datestr(None) '' NcSsZ|r ||}tt|d|}t|dkr4|d7}|d7}|dkrN|d7}n|d7}|S)NrrrTrzfrom nowZago)rSabs)rkwhatZdivisorrr@r@rAagohences  zdatestr..agohenceiQrDateTimedategư>rr_dayz%B %dz 0 z, %sihourrminutesecondg.AiZ millisecond microsecond)N)datetimeutcnowtyperL fromtimestampyearmonthrrdaysseconds microsecondsrstrftimereplace) ZthennowrZonedaydeltaZ deltasecondsZ deltadaysrZdeltamicrosecondsr@r@rAr'sH           r'cCsdddt|DS)z Removes all non-digit characters from `string`. >>> numify('800-555-1212') '8005551212' >>> numify('800.555.1212') '8005551212' rcSsg|]}|r|qSr@)isdigit)r\rr@r@rAr]r^znumify..)rrS)rr@r@rAr(s r(cCsFg}|D]2}|dkr0||d|dd}q||qd|S)z Formats `string` according to `pattern`, where the letter X gets replaced by characters from `string`. >>> denumify("8005551212", "(XXX) XXX-XXXX") '(800) 555-1212' XrrNr)rr)rpatternrrr@r@rAr)s  r)cCs|dur dSt|}|dr8d}|dd}nd}d|vrT|d\}}n |d}}g}tt|dddD],\}}|r|ds|dd |d|qxd|}|r|d|7}||S) a Add commas to an integer `n`. >>> commify(1) '1' >>> commify(123) '123' >>> commify(-123) '-123' >>> commify(1234) '1,234' >>> commify(1234567890) '1,234,567,890' >>> commify(123.0) '123.0' >>> commify(1234.5) '1,234.5' >>> commify(1234.56789) '1,234.56789' >>> commify(' %.2f ' % -1234.5) '-1,234.50' >>> commify(None) >>> N-rr.r_r,)rSstriprsplitrrr)rkprefixZdollarsZcentsrrrrr@r@rAr*s&       r*cCs t|dS)z3 Formats a numified `datestring` properly. zXXXX-XX-XX XX:XX:XX)r))Z datestringr@r@rAr+:sr+cCs<|dks J|ddvr d|Sdddd|d d|S) a) Formats an ordinal. Doesn't handle negative numbers. >>> nthstr(1) '1st' >>> nthstr(0) '0th' >>> [nthstr(x) for x in [2, 3, 4, 5, 10, 11, 12, 13, 14, 15]] ['2nd', '3rd', '4th', '5th', '10th', '11th', '12th', '13th', '14th', '15th'] >>> [nthstr(x) for x in [91, 92, 93, 94, 99, 100, 101, 102]] ['91st', '92nd', '93rd', '94th', '99th', '100th', '101st', '102nd'] >>> [nthstr(x) for x in [111, 112, 113, 114, 115]] ['111th', '112th', '113th', '114th', '115th'] rr) z%sthz%sstz%sndz%srd)rr- )rd)rkr@r@rAr,As  r,cCs|r|S|SdS)z Function replacement for if-else to use in expressions. >>> x = 2 >>> cond(x % 2 == 0, "even", "odd") 'even' >>> cond(x % 2 == 0, "even", "odd") + '_row' 'even_row' Nr@) predicateZ consequence alternativer@r@rAr-Ys r-c@s eZdZdZddZddZdS)r.z Captures everything `func` prints to stdout and returns it instead. >>> def idiot(): ... print("foo") >>> capturestdout(idiot)() 'foo\n' **WARNING:** Not threadsafe! cCs ||_dSr8rr=rr@r@rAruszCaptureStdout.__init__cOs>t}tj}|t_z|j|i|W|t_n|t_0|Sr8)rrstdoutrr[)r=rrrZ oldstdoutr@r@rArQxszCaptureStdout.__call__Nrr@r@r@rAr.is r.c@s eZdZdZddZddZdS)r0a  Profiles `func` and returns a tuple containing its output and a string with human-readable profiling information. >>> import time >>> out, inf = profile(time.sleep)(.001) >>> out >>> inf[:10].strip() 'took 0.0' cCs ||_dSr8r9r:r@r@rArszProfile.__init__cGsddl}ddl}ddl}ddl}|\}}|||}t} |j|j g|R} t| } t } |j || d} | | dd| d| dt| d} | | 7} z||WntyYn0| | fS)Nr)streamrZcalls(z took z seconds )cProfilepstatsostempfilemkstempcloser0rZruncallrrZStatsZ strip_dirsZ sort_statsZ print_statsZ print_callersrSr[rIOError)r=rr>r?r@rArrZprofZstimerhrstatsrZr@r@rArQs.       zProfile.__call__Nrr@r@r@rAr0s r0c Cs|}i}t|D]\}}t|ds(q|r8||s8qt|dddz|}t||t|Wqtdt|dtddt dYq0qtd td t|D]\}}td t |d|qd S) aZ Tries a series of functions and prints their results. `context` is a dictionary mapping names to values; the value will only be tried if it's callable. >>> tryall(dict(j=lambda: True)) j: True ---------------------------------------- results: True: 1 For example, you might have a file `test/stuff.py` with a series of functions testing various things in it. At the bottom, have a line: if __name__ == "__main__": tryall(globals()) Then you can run `python test/stuff.py` and get the results of all the tests. rQ:r)rERRORz z rz(----------------------------------------zresults:rN) copyrrXrprintr!rr format_excr0rS)contextr1resultsr>rDrr@r@rAr2s(    $r2c@seZdZdZeZddZddZddZdd Z e e Z d d Z d d Z ddZ ddZeZddZddZd/ddZddZddZddZdd ZeZd!d"Zd#d$Zd%d&Zd'd(Zd0d)d*Zd+d,Zd-d.ZeZdS)1r3a# Thread local storage. >>> d = ThreadedDict() >>> d.x = 1 >>> d.x 1 >>> import threading >>> def f(): d.x = 2 ... >>> t = threading.Thread(target=f) >>> t.start() >>> t.join() >>> d.x 1 cCstj|dSr8)r3 _instancesrlrKr@r@rArszThreadedDict.__init__cCstj|dSr8)r3rMrrKr@r@rA__del__szThreadedDict.__del__cCst|Sr8)idrKr@r@rA__hash__szThreadedDict.__hash__cCsttjD] }|q dS)z"Clears all ThreadedDict instances.N)rcr3rMclear)tr@r@rA clear_allszThreadedDict.clear_allcCs |j|Sr8__dict__rxr@r@rAr szThreadedDict.__getitem__cCs||j|<dSr8rTrCr@r@rA __setitem__szThreadedDict.__setitem__cCs |j|=dSr8rTrxr@r@rA __delitem__szThreadedDict.__delitem__cCs ||jvSr8rTrxr@r@rA __contains__szThreadedDict.__contains__cCs|jdSr8)rUrQrKr@r@rArQszThreadedDict.clearcCs |jSr8)rUrHrKr@r@rArHszThreadedDict.copyNcCs|j||Sr8)rUrdr=r>rr@r@rArd!szThreadedDict.getcCs |jSr8)rUrrKr@r@rAr$szThreadedDict.itemscCs t|jSr8)rrUrKr@r@rAr'szThreadedDict.iteritemscCs |jSr8)rUrbrKr@r@rArb*szThreadedDict.keyscCs.z t|jWSty(|jYS0dSr8)iterkeysrU NameErrorrbrKr@r@rArZ-s  zThreadedDict.iterkeyscCs |jSr8)rUrwrKr@r@rArw5szThreadedDict.valuescCs t|jSr8)rrUrKr@r@rAr8szThreadedDict.itervaluescGs|jj|g|RSr8)rUr`)r=r>rr@r@rAr`;szThreadedDict.popcCs |jSr8)rUpopitemrKr@r@rAr\>szThreadedDict.popitemcCs|j||Sr8)rUrjrYr@r@rArjAszThreadedDict.setdefaultcOs|jj|i|dSr8)rUr)r=rkwargsr@r@rArDszThreadedDict.updatecCs d|jS)NzrTrKr@r@rArJGszThreadedDict.__repr__)N)N) rLrMrNrOrrMrrNrPrS staticmethodrrVrWrXZhas_keyrQrHrdrrrbrZrrwrr`r\rjrrJ__str__r@r@r@rAr3s8  r3cCs,t|D]\}}|dkrqt|||qdS)a: Automatically assigns local variables to `self`. >>> self = storage() >>> autoassign(self, dict(a=1, b=2)) >>> self.a 1 >>> self.b 2 Generally used in `__init__` methods, as in: def __init__(self, foo, bar, baz=1): autoassign(self, locals()) r=N)rre)r=localsr>rDr@r@rAr5Psr5cCsN|dkrtdd}g}|dkr@t|d\}}|d||qd|pLdS)ax Converts an integer to base 36 (a useful scheme for human-sayable IDs). >>> to36(35) 'z' >>> to36(119292) '2k1o' >>> int(to36(939387374), 36) 939387374 >>> to36(0) '0' >>> to36(-393) Traceback (most recent call last): ... ValueError: must supply a positive integer rzmust supply a positive integerZ$0123456789abcdefghijklmnopqrstuvwxyz$r0)rrrr)qlettersZ convertedrr@r@rAr6esr6z(?.listify..)rRrcrrYr@r@rAlistifys  z'_EmailMessage.__init__..listifyccbccrrcsg|]}j|dqS)r)utils parseaddr)r\remailr@rAr]r^z*_EmailMessage.__init__..z, )FromToSubjectCczContent-Transfer-Encoding7bitContent-Dispositioninlinez MIME-Versionz1.0rF)rrd email.utilsrzr{rp recipientsr"rrt new_messagers add_header set_payload multipart) r=rprqrrrsrtrrwrxryrr@r|rArs.  z_EmailMessage.__init__cCsddlm}|S)Nr)Message) email.messager)r=rr@r@rArs z_EmailMessage.new_messagecCs|js2|}|dd||j||_d|_ddl}zddlm}Wnddlm}Yn0|px| |dpxd}|}| ||d||jdd |d | d s| ||j|dS) Nz Content-Typezmultipart/mixedTr)encoders)Encoderszapplication/octet-streamr attachment)rztext/) rrrrjrs mimetypesr}rr guess_typerr encode_base64)r=rrrfmsgrrr@r@rArjs.       z_EmailMessage.attachcCsFt|jD]0\}}|dkr,|j|q |j||q i|_dS)Nz content-type)rrtlowerrsset_typer)r=r?rnr@r@rAprepare_messages  z_EmailMessage.prepare_messagecCs||j}zddlm}Wnty@ttd}Yn0|jdrZ| |n&|jddkrv| |n | |dS)Nrwebapiconfig smtp_serverZ email_engineZaws) rrs as_stringrr ImportErrorrrrdsend_with_smtp send_with_awsdefault_email_sender)r= message_textrr@r@rAros     z_EmailMessage.sendcCsnzddlm}Wnty.ttd}Yn0ddl}|jj|jd|jdd}| ||j |j dS)Nrrrraws_access_key_idaws_secret_access_key)rr) rrrrZboto.sesZsesZ SESConnectionrrdZsend_raw_emailrpr)r=rrZbotorr@r@rArs   z_EmailMessage.send_with_awsc Cszddlm}Wnty.ttd}Yn0|jd}|jdd}|jd}|jd}|jd d}|jd d }ddl} | ||} |r| ||r| | | |r|r| ||| |j |j|| dS) NrrrrZ smtp_portrZ smtp_usernameZ smtp_passwordZsmtp_debuglevelZ smtp_starttlsF)rrrrrrdsmtplibSMTPset_debuglevelehlostarttlsloginr7rprquit) r=rrserverportusernamepasswordZ debug_levelrrZ smtpserverr@r@rArs,       z_EmailMessage.send_with_smtpcCszddlm}Wnty.ttd}Yn0|jdd}|jdrRJd|jD]}|drXJdqX|d|jg|j}t j |t j d }|j |d |j |dS) NrrrZ sendmail_pathz/usr/sbin/sendmailr+securityz-f)stdinr)rrrrrrdrprr subprocessPopenPIPErrencoderCwait)r=rrr7rcmdpr@r@rAr;s   z"_EmailMessage.default_email_sendercCsdS)Nzr@rKr@r@rArJOsz_EmailMessage.__repr__cCs |jSr8)rsrrKr@r@rAr_Rsz_EmailMessage.__str__)N)N) rLrMrNrrrjrrorrrrJr_r@r@r@rAris $  ri__main__)r)N)NT)r_)r)N)N)N)N)N)N)RrOrr@rerrrrrrrZ threadlocalZ py3helpersrrrrio__all__rIrrr r r rcrar frozensetr rrr rrrrrrrcompilerrrrrrrrrrrrr r!r"r#r$r%r&r'r(r)r*r+r,r-r.r/r0r1r2r3r4r5r6Zr_urlr7rirLdoctesttestmodr@r@r@rAs  5(PW   5S   1a        a 5 1 ,g '+