GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — fluentpythoncode/02-array-seq/bisect_demo.py at master · hellowac/fluentpythoncode Expand file tree/ Copy pathbisect_demo.pyMore file actions 27 lines (20 loc) · 721 Bytes / Copy pathbisect_demo.pyFile metadata and controls27 lines (20 loc) · 721 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 # BEGIN BISECT_DEMO import bisect import sys HAYSTACK = [1, 4, 5, 6, 8, 12, 15, 20, 21, 23, 23, 26, 29, 30] NEEDLES = [0, 1, 2, 5, 8, 10, 22, 23, 29, 30, 31] ROW_FMT = '{0:2d} @ {1:2d} {2}{0:<2d}' def demo(bisect_fn): for needle in reversed(NEEDLES): position = bisect_fn(HAYSTACK, needle) # <1> offset = position * ' |' # <2> print(ROW_FMT.format(needle, position, offset)) # <3> if __name__ == '__main__': if sys.argv[-1] == 'left': # <4> bisect_fn = bisect.bisect_left else: bisect_fn = bisect.bisect print('DEMO:', bisect_fn.__name__) # <5> print('haystack ->', ' '.join('%2d' % n for n in HAYSTACK)) demo(bisect_fn) # END BISECT_DEMO |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |