看流畅python中的代码

import collections

Card = collections.namedtuple('Card', ['rank', 'suit'])

class FrenchDeck:
    ranks = [str(n) for n in range(2,11)] + list('JQKA')
    suits = 'sapdes diamonds clubs hearts'.split()

    def __init__(self):
        self._cards = [Card(rank, suit) for suit in self.suits for rank in self.ranks] + [('king', 'large'), ('king', 'small')]

    def __len__(self):
        return len(self._cards)

    def __getitem__(self, position):
        return self._cards[position]


beer_card = Card('7', 'diamonds')

print(beer_card)

deck = FrenchDeck()

for i,value in enumerate(deck):
    print 'deck[%d] = %s' %(i, value)
import sys
import bisect

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):
        positon = bisect_fn(HAYSTACK, needle)
        offset = positon * '    |'
        print(ROW_FMT.format(needle, positon, offset))

if __name__ == '__main__':
    if sys.argv[-1] == 'left':
        bisect_fn = bisect.bisect_left
    else:
        bisect_fn = bisect.bisect_right

    #bisect_fn = bisect.bisect_left
    print ('demo:', bisect_fn.__name__)
    print('haystatck -->', ''.join('%3d' % n for n in HAYSTACK))

    demo(bisect_fn)

猜你喜欢

转载自blog.csdn.net/lightjia/article/details/78533239