Updating code

Author: AllenDowney

code/Card.py

@@ -1,12 +1,16 @@
-"""This module contains code from
-Think Python by Allen B. Downey
-http://thinkpython.com
+"""This module contains a code example related to
 
-Copyright 2012 Allen B. Downey
-License: GNU GPLv3 http://www.gnu.org/licenses/gpl.html
+Think Python, 2nd Edition
+by Allen Downey
+http://thinkpython2.com
 
+Copyright 2015 Allen Downey
+
+License: http://creativecommons.org/licenses/by/4.0/
 """
 
+from __future__ import print_function, division
+
 import random
 
 
@@ -50,24 +54,34 @@ class Deck(object):
     """
 
     def __init__(self):
+        """Initializes the Deck with 52 cards.
+        """
         self.cards = []
         for suit in range(4):
             for rank in range(1, 14):
                 card = Card(suit, rank)
                 self.cards.append(card)
 
     def __str__(self):
+        """Returns a string representation of the deck.
+        """
         res = []
         for card in self.cards:
             res.append(str(card))
         return '\n'.join(res)
 
     def add_card(self, card):
-        """Adds a card to the deck."""
+        """Adds a card to the deck.
+
+        card: Card
+        """
         self.cards.append(card)
 
     def remove_card(self, card):
-        """Removes a card from the deck."""
+        """Removes a card from the deck or raises exception if it is not there.
+        
+        card: Card
+        """
         self.cards.remove(card)
 
     def pop_card(self, i=-1):
@@ -122,8 +136,8 @@ def find_defining_class(obj, method_name):
     deck.shuffle()
 
     hand = Hand()
-    print find_defining_class(hand, 'shuffle')
+    print(find_defining_class(hand, 'shuffle'))
 
     deck.move_cards(hand, 5)
     hand.sort()
-    print hand
+    print(hand)

code/button_demo.py

@@ -1,15 +1,24 @@
-"""This module contains code from
-Think Python by Allen B. Downey
-http://thinkpython.com
+"""This module contains a code example related to
 
-Copyright 2012 Allen B. Downey
-License: GNU GPLv3 http://www.gnu.org/licenses/gpl.html
+Think Python, 2nd Edition
+by Allen Downey
+http://thinkpython2.com
 
-http://www.cartalk.com/content/puzzler/transcripts/200725
+Copyright 2015 Allen Downey
+
+License: http://creativecommons.org/licenses/by/4.0/
 """
 
+from __future__ import print_function, division
+
+
 def is_triple_double(word):
-    """Tests if a word contains three consecutive double letters."""
+    """Tests if a word contains three consecutive double letters.
+    
+    word: string
+
+    returns: bool
+    """
     i = 0
     count = 0
     while i < len(word)-1:
@@ -30,12 +39,12 @@ def find_triple_double():
     for line in fin:
         word = line.strip()
         if is_triple_double(word):
-            print word
+            print(word)
 
 
-print 'Here are all the words in the list that have'
-print 'three consecutive double letters.'
+print('Here are all the words in the list that have')
+print('three consecutive double letters.')
 find_triple_double()
-print ''
+print('')
 
 

code/canvas_demo.py

@@ -1,41 +1,51 @@
-"""This module contains code from
-Think Python by Allen B. Downey
-http://thinkpython.com
+"""This module contains a code example related to
 
-Copyright 2012 Allen B. Downey
-License: GNU GPLv3 http://www.gnu.org/licenses/gpl.html
+Think Python, 2nd Edition
+by Allen Downey
+http://thinkpython2.com
 
-    http://www.cartalk.com/content/puzzler/transcripts/200803
+Copyright 2015 Allen Downey
+
+License: http://creativecommons.org/licenses/by/4.0/
 """
 
-def has_palindrome(i, start, len):
-    """return True if the integer i, when written as a string,
-    contains a palindrome with length (len), starting at index (start).
+from __future__ import print_function, division
+
+
+def has_palindrome(i, start, length):
+    """Checks if the string representation of i has a palindrome.
+
+    i: integer
+    start: where in the string to start
+    length: length of the palindrome to check for
     """
-    s = str(i)[start:start+len]
+    s = str(i)[start:start+length]
     return s[::-1] == s
+
 
 def check(i):
-    """check whether the integer (i) has the properties described
-    in the puzzler
+    """Checks if the integer (i) has the desired properties.
+
+    i: int
     """
-    return (has_palindrome(i, 2, 4)   and
+    return (has_palindrome(i, 2, 4) and
             has_palindrome(i+1, 1, 5) and
             has_palindrome(i+2, 1, 4) and
             has_palindrome(i+3, 0, 6))
 
-def check_all():
-    """enumerate the six-digit numbers and print any that satisfy the
-    requirements of the puzzler"""
 
+def check_all():
+    """Enumerate the six-digit numbers and print any winners.
+    """
     i = 100000
-    while i <= 999999:
+    while i <= 999996:
         if check(i):
-            print i
+            print(i)
         i = i + 1
 
-print 'The following are the possible odometer readings:'
+
+print('The following are the possible odometer readings:')
 check_all()
-print
+print()
 
 

code/cartalk1.py

@@ -1,58 +1,80 @@
-"""This module contains code from
-Think Python by Allen B. Downey
-http://thinkpython.com
+"""This module contains a code example related to
 
-Copyright 2012 Allen B. Downey
-License: GNU GPLv3 http://www.gnu.org/licenses/gpl.html
+Think Python, 2nd Edition
+by Allen Downey
+http://thinkpython2.com
 
-    http://www.cartalk.com/content/puzzler/transcripts/200813
+Copyright 2015 Allen Downey
+
+License: http://creativecommons.org/licenses/by/4.0/
 """
 
-def str_fill(i, len):
-    """return the integer (i) written as a string with at least
-    (len) digits"""
-    return str(i).zfill(len)
+from __future__ import print_function, division
+
+
+def str_fill(i, n):
+    """Returns i as a string with at least n digits.
+
+    i: int
+    n: int length
+
+    returns: string
+    """
+    return str(i).zfill(n)
 
 
 def are_reversed(i, j):
-    """ return True if the integers i and j, written as strings,
-    are the reverse of each other"""
-    return str_fill(i,2) == str_fill(j,2)[::-1]
+    """Checks if i and j are the reverse of each other.
+
+    i: int
+    j: int
+
+    returns:bool
+    """
+    return str_fill(i, 2) == str_fill(j, 2)[::-1]
 
 
 def num_instances(diff, flag=False):
-    """returns the number of times the mother and daughter have
-    pallindromic ages in their lives, given the difference in age.
-    If flag==True, prints the details."""
+    """Counts the number of palindromic ages.
+
+    Returns the number of times the mother and daughter have
+    palindromic ages in their lives, given the difference in age.
+
+    diff: int difference in ages
+    flag: bool, if True, prints the details
+    """
     daughter = 0
     count = 0
     while True:
         mother = daughter + diff
         if are_reversed(daughter, mother) or are_reversed(daughter, mother+1):
             count = count + 1
             if flag:
-                print daughter, mother
+                print(daughter, mother)
         if mother > 120:
             break
         daughter = daughter + 1
     return count
 
 
 def check_diffs():
-    """enumerate the possible differences in age between mother
-    and daughter, and for each difference, count the number of times
+    """Finds age differences that satisfy the problem.
+
+    Enumerates the possible differences in age between mother
+    and daughter, and for each difference, counts the number of times
     over their lives they will have ages that are the reverse of
-    each other."""
+    each other.
+    """
     diff = 10
     while diff < 70:
         n = num_instances(diff)
         if n > 0:
-            print diff, n
+            print(diff, n)
         diff = diff + 1
 
-print 'diff  #instances'
+print('diff  #instances')
 check_diffs()
 
-print
-print 'daughter  mother'
+print()
+print('daughter  mother')
 num_instances(18, True)