o Ee@sJddlZddlZddlZddlZGdddeejjZGdddeZ dS)Nc@s6eZdZdZddZddZejZddZ dd Z d S) DictStacka A stack of dictionaries that behaves as a view on those dictionaries, giving preference to the last. >>> stack = DictStack([dict(a=1, c=2), dict(b=2, a=2)]) >>> stack['a'] 2 >>> stack['b'] 2 >>> stack['c'] 2 >>> len(stack) 3 >>> stack.push(dict(a=3)) >>> stack['a'] 3 >>> set(stack.keys()) == set(['a', 'b', 'c']) True >>> set(stack.items()) == set([('a', 3), ('b', 2), ('c', 2)]) True >>> dict(**stack) == dict(stack) == dict(a=3, c=2, b=2) True >>> d = stack.pop() >>> stack['a'] 2 >>> d = stack.pop() >>> stack['a'] 1 >>> stack.get('b', None) >>> 'c' in stack True cCs(t|}tttjdd|DS)Ncss|]}|VqdSN)keys).0crc/var/www/bmteknikk.ddns.net/venv/lib/python3.10/site-packages/setuptools/_distutils/_collections.py ,sz%DictStack.__iter__..)list__iter__iterset itertoolschain from_iterable)selfdictsrrrr *s zDictStack.__iter__cCs4ttt|D] }||vr||Sq t|r)reversedtupler r KeyError)rkeyscoperrr __getitem__.s  zDictStack.__getitem__cCstjj||Sr) collectionsabcMapping __contains__)rotherrrrr6zDictStack.__contains__cCsttt|Sr)lenr r )rrrr__len__9rzDictStack.__len__N) __name__ __module__ __qualname____doc__r rr appendpushrr rrrrrs! rc@s|eZdZdZiejfddZeddZddZ dd d Z d d Z d dZ e ddiZGdddeZedZedZdS)RangeMapaa A dictionary-like object that uses the keys as bounds for a range. Inclusion of the value for that range is determined by the key_match_comparator, which defaults to less-than-or-equal. A value is returned for a key if it is the first key that matches in the sorted list of keys. One may supply keyword parameters to be passed to the sort function used to sort keys (i.e. key, reverse) as sort_params. Let's create a map that maps 1-3 -> 'a', 4-6 -> 'b' >>> r = RangeMap({3: 'a', 6: 'b'}) # boy, that was easy >>> r[1], r[2], r[3], r[4], r[5], r[6] ('a', 'a', 'a', 'b', 'b', 'b') Even float values should work so long as the comparison operator supports it. >>> r[4.5] 'b' But you'll notice that the way rangemap is defined, it must be open-ended on one side. >>> r[0] 'a' >>> r[-1] 'a' One can close the open-end of the RangeMap by using undefined_value >>> r = RangeMap({0: RangeMap.undefined_value, 3: 'a', 6: 'b'}) >>> r[0] Traceback (most recent call last): ... KeyError: 0 One can get the first or last elements in the range by using RangeMap.Item >>> last_item = RangeMap.Item(-1) >>> r[last_item] 'b' .last_item is a shortcut for Item(-1) >>> r[RangeMap.last_item] 'b' Sometimes it's useful to find the bounds for a RangeMap >>> r.bounds() (0, 6) RangeMap supports .get(key, default) >>> r.get(0, 'not found') 'not found' >>> r.get(7, 'not found') 'not found' One often wishes to define the ranges by their left-most values, which requires use of sort params and a key_match_comparator. >>> r = RangeMap({1: 'a', 4: 'b'}, ... sort_params=dict(reverse=True), ... key_match_comparator=operator.ge) >>> r[1], r[2], r[3], r[4], r[5], r[6] ('a', 'a', 'a', 'b', 'b', 'b') That wasn't nearly as easy as before, so an alternate constructor is provided: >>> r = RangeMap.left({1: 'a', 4: 'b', 7: RangeMap.undefined_value}) >>> r[1], r[2], r[3], r[4], r[5], r[6] ('a', 'a', 'a', 'b', 'b', 'b') cCst||||_||_dSr)dict__init__ sort_paramsmatch)rsourcer*key_match_comparatorrrrr)s  zRangeMap.__init__cCs||tddtjdS)NT)reverse)r*r-)r(operatorge)clsr,rrrleftsz RangeMap.leftcCsbt|fi|j}t|tjr|||}|S|||}t||}|tj ur/t ||Sr) sortedrr* isinstancer'Itemr_find_first_match_r(undefined_valuer)ritem sorted_keysresultrrrrrs   zRangeMap.__getitem__NcCs"z||WSty|YSw)z Return the value for key if key is in the dictionary, else default. If default is not given, it defaults to None, so that this method never raises a KeyError. )r)rrdefaultrrrgets   z RangeMap.getcCs0t|j|}tt||}|r|dSt|)Nr) functoolspartialr+r filterr)rrr8is_matchmatchesrrrr6s zRangeMap._find_first_match_cCs*t|fi|j}|tj|tjfSr)r3rr*r' first_item last_item)rr9rrrboundsszRangeMap.boundsRangeValueUndefinedrc@seZdZdZdS)z RangeMap.Itemz RangeMap ItemN)r!r"r#r$rrrrr5sr5rr)r!r"r#r$r/ler) classmethodr2rr<r6rDtyper7intr5rBrCrrrrr'>sP    r') rr=rr/r rrrr(r'rrrrs 6