FluentPython读书笔记3 --2-8.1

# -*- coding:utf-8 -*-
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}{1:<2d}'

def demo(bisect_sn):
        for needle in reversed(NEEDLES):
                position = bisect_sn(HAYSTACK, needle)
                offset = position * '  |'
                print ROW_FMT.format(needle, position, offset)

if __name__ == '__main__':
        if sys.argv[-1] == 'left':
                bisect_fn = bisect.biset_left
        else:
                bisect_fn = bisect.bisect
        print'DEMO: ', bisect_fn.__name__
        # '%2d' % n 相当于一个整体
        print'haystack ->', ' '.join('%2d' % n for n in HAYSTACK)
        demo(bisect_fn)

1. reversed() 返回一个反转迭代器：

# 这么看for循环只要是一个迭代器都可以 ？
>&g