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.🌌 SpectraShell

🌌 SpectraShell

Current path: lib64/python3.6/__pycache__/



⬆️ Go up: /lib64/python3.6

πŸ“„ Viewing: bisect.cpython-36.pyc

3


 \#
οΏ½@sZdZdddοΏ½ZeZd
ddοΏ½ZeZdddοΏ½Zdd	d
οΏ½ZyddlTWnek
rTYnXdS)zBisection algorithms.οΏ½NcCsd|dkrtdοΏ½οΏ½|dkr t|οΏ½}x2||krR||d}|||krH|}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.
    rzlo must be non-negativeNοΏ½οΏ½)οΏ½
ValueErrorοΏ½lenοΏ½insert)οΏ½aοΏ½xοΏ½loοΏ½hiοΏ½midοΏ½rοΏ½/usr/lib64/python3.6/bisect.pyοΏ½insort_rights	
rcCsX|dkrtdοΏ½οΏ½|dkr t|οΏ½}x2||krR||d}|||krH|}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.
    rzlo must be non-negativeNrr)rr)rrr	r
rrrr
οΏ½bisect_rights
rcCsd|dkrtdοΏ½οΏ½|dkr t|οΏ½}x2||krR||d}|||krL|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.
    rzlo must be non-negativeNrr)rrr)rrr	r
rrrr
οΏ½insort_left/s	

rcCsX|dkrtdοΏ½οΏ½|dkr t|οΏ½}x2||krR||d}|||krL|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.
    rzlo must be non-negativeNrr)rr)rrr	r
rrrr
οΏ½bisect_leftCs

r)οΏ½*)rN)rN)rN)rN)	οΏ½__doc__rZinsortrZbisectrrZ_bisectοΏ½ImportErrorrrrr
οΏ½<module>s






πŸ“