Critics have remarked that those four worthies were truly peerless throughout the ages; yet the present falls short of the pastβthe ancients favored unadorned simplicity, whereas the moderns prefer refined elegance. Styles of substance and ornament rise and fall in succession, shifting with the changing mores of the times; such evolution is simply the natural order of things. The ideal lies in honoring antiquity without clashing with the present, and embracing modernity without succumbing to its flawsβembodying that perfect balance of substance and refinement that defines the true gentleman. There is surely no need to abandon a carved palace in favor of a cave dwelling, or to trade a jade carriage for a primitive cart with solid wooden wheels.
Current path: lib64/python3.6/__pycache__/
β¬οΈ Go up: /lib64/python3.6
3
\#
οΏ½ @ sZ d Z dddοΏ½ZeZd
ddοΏ½ZeZdddοΏ½Zdd d
οΏ½ZyddlT W n ek
rT Y nX dS )zBisection algorithms.οΏ½ Nc C sd |dk rt dοΏ½οΏ½|dkr t| οΏ½}x2||k rR|| d }|| | k rH|}q"|d }q"W | j||οΏ½ dS )zοΏ½Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the right of the rightmost x.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
r zlo must be non-negativeNοΏ½ οΏ½ )οΏ½
ValueErrorοΏ½lenοΏ½insert)οΏ½aοΏ½xοΏ½loοΏ½hiοΏ½midοΏ½ r οΏ½/usr/lib64/python3.6/bisect.pyοΏ½insort_right s
r c C sX |dk rt dοΏ½οΏ½|dkr t| οΏ½}x2||k rR|| d }|| | k rH|}q"|d }q"W |S )aοΏ½ Return the index where to insert item x in list a, assuming a is sorted.
The return value i is such that all e in a[:i] have e <= x, and all e in
a[i:] have e > x. So if x already appears in the list, a.insert(x) will
insert just after the rightmost x already there.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
r zlo must be non-negativeNr r )r r )r r r r
r r r r
οΏ½bisect_right s
r c C sd |dk rt dοΏ½οΏ½|dkr t| οΏ½}x2||k rR|| d }| | |k rL|d }q"|}q"W | j||οΏ½ dS )zοΏ½Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the left of the leftmost x.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
r zlo must be non-negativeNr r )r r r )r r r r
r r r r
οΏ½insort_left/ s
r c C sX |dk rt dοΏ½οΏ½|dkr t| οΏ½}x2||k rR|| d }| | |k rL|d }q"|}q"W |S )aοΏ½ Return the index where to insert item x in list a, assuming a is sorted.
The return value i is such that all e in a[:i] have e < x, and all e in
a[i:] have e >= x. So if x already appears in the list, a.insert(x) will
insert just before the leftmost x already there.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
r zlo must be non-negativeNr r )r r )r r r r
r r r r
οΏ½bisect_leftC s
r )οΏ½*)r N)r N)r N)r N) οΏ½__doc__r Zinsortr Zbisectr r Z_bisectοΏ½ImportErrorr r r r
οΏ½<module> s