OpenSource/GildedRose-Refactoring-Kata
1
0
Fork 0
mirror of https://github.com/emilybache/GildedRose-Refactoring-Kata.git synced 2025-12-12 20:32:15 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

added encoding. Decided itertools.zip_longest was overkill, refactored to use simpler method.

Browse Source
This commit is contained in:
emilybache 2012-11-21 11:11:46 +01:00
parent 1cf0963de5
commit 7333fc844e
3 changed files with 8 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Tennis/python/tennis.py
View File

@ -1,4 +1,4 @@
# -*- coding: utf-8 -*-
class TennisGameDefactored1: class TennisGameDefactored1:

2
Tennis/python/tennis_test.py
View File

@ -1,3 +1,5 @@
# -*- coding: utf-8 -*-
import pytest import pytest
from tennis import TennisGame from tennis import TennisGame

9
Tennis/python/tennis_unittest.py
View File

@ -1,5 +1,6 @@
# -*- coding: utf-8 -*-
import unittest import unittest
from itertools import izip_longest
from tennis import TennisGame from tennis import TennisGame
@ -52,10 +53,10 @@ test_cases = [
def play_game(p1Points, p2Points, p1Name, p2Name): def play_game(p1Points, p2Points, p1Name, p2Name):
game = TennisGame(p1Name, p2Name) game = TennisGame(p1Name, p2Name)
for p1, p2 in izip_longest(range(p1Points), range(p2Points)): for i in range(max(p1Points, p2Points)):
if p1 is not None: if i < p1Points:
game.won_point(p1Name) game.won_point(p1Name)
if p2 is not None: if i < p2Points:
game.won_point(p2Name) game.won_point(p2Name)
return game return game