a0bi z S SK r S SKrS SKrS SKr " S S\\ R
R 5 r " S S\5 r g) Nc H \ rS rSrSrS rS r\R r S r
S r Sr g) DictStack a:
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
c [ R U 5 n[ [ [ R
R
S U 5 5 5 5 $ )Nc 3 @ # U H oR 5 v M g 7fN)keys).0cs ڛ/builddir/build/BUILDROOT/alt-python313-setuptools-69.0.2-3.el8.x86_64/opt/alt/python313/lib/python3.13/site-packages/setuptools/_distutils/_collections.py %DictStack.__iter__.., s 5N1ffhhs )list__iter__iterset itertoolschain
from_iterable)selfdictss r r DictStack.__iter__* s5
d#C 555N5NNOPP c [ [ [ R U 5 5 5 H nX; d M
X! s $ [ U5 er )reversedtupler r KeyError)r keyscopes r __getitem__DictStack.__getitem__. s8 eDMM$$7 89E| z! : smr c T [ R R R X5 $ r ) collectionsabcMapping __contains__)r others r r& DictStack.__contains__6 s &&33D@@r c < [ [ [ U 5 5 5 $ r )lenr r )r s r __len__DictStack.__len__9 s 4T
#$$r N)
__name__
__module__ __qualname____firstlineno____doc__r r r appendpushr& r+ __static_attributes__r- r r r r s) BQ ;;DA%r r c \ rS rSrSr0 \R 4S jr\S 5 r S r
SS jr S r S r
\" S
S 0 5 " 5 r " S S
\5 r\" S5 r\" S5 rSrg)RangeMap> a
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')
c F [ R X5 X l X0l g r )dict__init__ sort_paramsmatch)r sourcer< key_match_comparators r r; RangeMap.__init__ s
d#&)
r c < U " U[ SS9[ R S9$ )NT)reverse)r< r? )r: operatorge)clsr> s r left
RangeMap.left s T 2
r c > [ U R 5 40 U R D6n[ U[ R
5 ( a U R
X! 5 nU$ U R X!5 n[ R
X5 nU[ R L a [ U5 eU$ r ) sortedr r<
isinstancer7 Itemr _find_first_match_r: undefined_valuer )r item sorted_keysresultr s r r RangeMap.__getitem__ s TYY[=D,<,<= dHMM * *%%k&78F
))+ $$TZZ6vh-. 1: tn r c [ U R 5 40 U R D6nU[ R U[ R
4$ r )rI r r< r7
first_item last_item)r rO s r boundsRangeMap.bounds s> TYY[=D,<,<= H / /0+h>P>P2QRRr RangeValueUndefinedr- c \ rS rSrSrSrg)
RangeMap.Item z
RangeMap Itemr- N)r. r/ r0 r1 r2 r5 r- r r rK rd s r rK r )r= r< r )r. r/ r0 r1 r2 rC ler; classmethodrF r rT rL r` typerM intrK r^ r_ r5 r- r r r7 r7 > sv N` ,.HKK *
S
0"b9;Os aJRIr r7 )
r# rW r rC r r$ r% r r: r7 r- r r rk s8 2%koo-- 2%lDt Dr