codekingpro/portable-devtools

1+
2��i_
���RtRRR
/
Rll
t
RRR
/
Rll
tRRR
/
Rll
tRRR
/
Rll
t^RI5]t]
tR
# ]dLi;i
)	zBisection algorithms.N�keyc
�r�Vf\
W
W#4pM\
W!V
4
W#VR7pVPW!4R
#)a#
Insert item x in list a, and keep it sorted assuming a is sorted.3 4If x is already in a, insert it to the right of the rightmost x.5 6Optional args lo (default 0) and hi (default len(a)) bound the7slice of a to be searched.8 9A custom key function can be supplied to customize the sort order.10N�
r)�bisect_right�insert��
a�
x�lo�hirs&&&&$�
Lib\bisect.py�insort_rightr
s4���{�
�!��
'��
�!�S��V�R��
5���H�H�R�O�c
�$
�V^8d\
R
4
h
Vf\V4
pVf5W#8d,W#,^,pWV,8dTpK&V^
,pK1V#W#8d1W#,^,pW!W,4
8dTpK+V^
,pK6V#)a�
Return the index where to insert item x in list a, assuming a is sorted.11 12The return value i is such that all e in a[:i] have e <= x, and all e in13a[i:] have e > x.  So if x already appears in the list, a.insert(i, x) will14insert just after the rightmost x already there.15 16Optional args lo (default 0) and hi (default len(a)) bound the17slice of a to be searched.18 19A custom key function can be supplied to customize the sort order.20�lo must be non-negative��21ValueError�len�rr	r22rr�mids&&&&$ rrrs���23�A�v��2�3�3�	�z�
��V���{��g��7�q�.�C��S�6�z����1�W����I�
�g��7�q�.�C��3�q�v�;�����1�W��
�Irc
�r�Vf\
W
W#4pM\
W!V
4
W#VR7pVPW!4R
#)a!
Insert item x in list a, and keep it sorted assuming a is sorted.24 25If x is already in a, insert it to the left of the leftmost x.26 27Optional args lo (default 0) and hi (default len(a)) bound the28slice of a to be searched.29 30A custom key function can be supplied to customize the sort order.31Nr)�bisect_leftrrs&&&&$r�insort_leftr9s4���{�
��r�
&��
��C�
�F�B��
4���H�H�R�Orc
�&
�V^8d\
R
4
h
Vf\V4
pVf5W#8d,W#,^,pW,V
8dV^
,pK-TpK1V#W#8d2W#,^,pV!W,4
V
8dV^
,pK3TpK7V#)a�
Return the index where to insert item x in list a, assuming a is sorted.32 33The return value i is such that all e in a[:i] have e < x, and all e in34a[i:] have e >= x.  So if x already appears in the list, a.insert(i, x) will35insert just before the leftmost x already there.36 37Optional args lo (default 0) and hi (default len(a)) bound the38slice of a to be searched.39 40A custom key function can be supplied to customize the sort order.41rrrs&&&&$ rrrJs���42�A�v��2�3�3�	�z�
��V���{��g��7�q�.�C��v�
�z��1�W������I�
�g��7�q�.�C��1�6�{�Q���1�W����
�Ir)
�
*)�N)	�__doc__r
rrr�_bisect�ImportError�bisect�insort�rr�<module>r"
sb�


��
�T�
�"!
�T�!
�H

�D�
�"!
�D�!
�J

	��4344��	����

	��

	�s�3�=�
=