实现一摞有序的纸牌
import collections
# 创建一个Card类,表示单张纸牌
# 使用namedtuple构建只有属性没有自定义方法的类对象
Card = collections.namedtuple('Card', ['rank', 'suit'])
# 一摞纸牌
class FrenchDeck:
rank = [str(i) for i in range(2, 11)] + list('JQKA')
# 黑桃 方块 梅花 红心
suit = 'spades diamonds clubs hearts'.split()
def __init__(self):
self._carts = [Card(rank, suit) for suit in self.suit
for rank in self.rank]
def __len__(self):
return len(self._carts)
def __getitem__(self, item):
return self._carts[item]
deck = FrenchDeck()
1.纸牌张数
一摞纸牌应响应len()函数,触发__len__()方法,返回一摞纸牌有多少张
print(len(deck))
# output: 52
2.抽取纸牌
该功能得益于__getitem__方法,该方法返回所给键对应的值:若对象为序列,则键为int;若对象为字典,键可以为任意值
由于__getitem__方法将操作委托给了self._cards的[]运算符,那么一摞纸牌就自动支持切片
# 抽取第一张
print(deck[0])
# output: Card(rank='2', suit='spades')
# 抽取最后一张
print(deck[-1])
# output: Card(rank='A', suit='hearts')
# 抽取纸牌最上面三张
print(deck[:3])
# output: [Card(rank='2', suit='spades'), Card(rank='3', suit='spades'), Card(rank='4', suit='spades')]
# 只抽取4张A
print(deck[12::13])
# output: [Card(rank='A', suit='spades'), Card(rank='A', suit='diamonds'),
# Card(rank='A', suit='clubs'), Card(rank='A', suit='hearts')]
3.随机抽取纸牌
python提供了从序列中随机获取一项的函数:random.choice,我们可以在一摞牌中使用这个函数来实现该功能
from random import choice
print(choice(deck))
# output: Card(rank='2', suit='hearts')
print(choice(deck))
# output: Card(rank='J', suit='hearts')
print(choice(deck))
# output: Card(rank='8', suit='diamonds')
4.纸牌迭代
实现了__getitem__特殊方法,纸牌还可以迭代
for card in deck:
print(card)
# output:
# Card(rank='2', suit='spades')
# Card(rank='3', suit='spades')
# Card(rank='4', suit='spades')
# ...
# 反向迭代这摞牌
for card in reversed(deck):
print(card)
# output:
# Card(rank='A', suit='hearts')
# Card(rank='K', suit='hearts')
# Card(rank='Q', suit='hearts')
# ...
补充:迭代往往是隐形的,如果一个容器没有实现__contain__方法,那么in运算就会做一次顺序扫描
5.纸牌排序
牌面按照点数(A最大),黑桃(最大)、红心、方块、梅花(最小)的顺序排列。按照这个规则定义排序函数,梅花2返回0,黑桃A返回51
suit_value = dict(spades=3, hearts=2, diamonds=1, clubs=0)
def deck_sort(card):
rank_value = FrenchDeck.rank.index(card.rank)
return rank_value * len(suit_value) + suit_value[card.suit]
for card in sorted(deck, key=deck_sort):
print(card)
# output:
# Card(rank='2', suit='clubs')
# Card(rank='2', suit='diamonds')
# Card(rank='2', suit='hearts')
# ...
总结
1.__len__和__getitem__的实现把所有工作委托给一个list对象,即self._cards。在实现__len__和__getitem__两个特殊方法后,FrenchDeck的行为就像标准的python序列一样,受益于语言核心特性(如迭代和切片)和标准库。
2.特殊方法是供解释器调用的而非你自己,如:len(user_object)的是__len__方法,并没有user_object.__len__()这种写法。
3.特殊方法的调用往往是隐式的,如:for i in x: 语句背后调用的是iter(x),接着又会调用x.__iter__(前提是有该方法)或x.__getitem__方法,在本文示例中,调用的是后者