Merge pull request UWPCE-PythonCert#31 from UWPCE-PythonCert/master

SESSION 6 Passing functions to functions

Author: JavierVzz

jingdai/cigar_party.py

@@ -0,0 +1,27 @@
+#!/usr/bin/env python
+
+"""
+When squirrels get together for a party, they like to have cigars.
+A squirrel party is successful when the number of cigars is between
+40 and 60, inclusive. Unless it is the weekend, in which case there
+is no upper bound on the number of cigars.
+
+Return True if the party with the given values is successful,
+or False otherwise.
+"""
+
+
+def cigar_party(cigars, is_weekend):
+    if is_weekend is False:
+        if cigars>=40 and cigars <=60:
+            return True
+        else:
+            return False
+    else:
+        if cigars>=40:
+            return True
+        else:
+            return False
+
+#a=cigar_party(30,True)
+#print(a)

jingdai/mailroom.py

@@ -17,6 +17,10 @@ def send_a_thankyou(donation):
 
     if user_prompt1 in names:
         user_prompt2=input("Amount > ")
+        try:
+            user_prompt2<0
+        except:
+            print('Please enter a positive number')
         new_pair=(user_prompt1,float(user_prompt2))
         donation.append(new_pair)
     else:
@@ -46,14 +50,14 @@ def create_a_report(donation):
                 count=1+count
         sum_list=(i,sum,count,float(sum/count))
         sum_lists.append(sum_list)
-
+    print(sum_lists)
 
     header_line='{:>12}  |{:>12}  |{:>12}  |{:>12}  '.format("Donor Name","Total Given","Num Gifts","Average Gift")
     print(header_line)
     for sum_list in sum_lists:
         line_new = '{:>12}  ${:>12}  {:>12}  ${:+.2f}  '.format(*sum_list)
         print(line_new)
-    return
+    return sum_lists
 
 def send_a_letter(donation):
     names=[] #create a list which has all the donor's name
@@ -85,13 +89,15 @@ def send_a_letter(donation):
 
 if __name__ == "__main__":
     donation=[("Andy","Thomas", 300),("Sally", "Bui", 400),("Andy","Tom", 100),("Tom","Colin", 700),("Lisa","Dodo",90),("Abby","Lust",1000),("Abby","Lust",200)]
-    while True:
+    while True: #while loop if input value not in the defined value, it just go back to the first input.
         user_prompt=input("1.Send a Thank You; 2.Create a Report; 3.Send a Letter; 4.quit > ")
+        if user_prompt not in '1234':
+            print("Please select a number that is in the range of 1 to 4.")
 
         if user_prompt=="2":
             create_a_report(donation)
         if user_prompt=="1":
-            send_a_thankyou(donation)
+            end_a_thankyou(donation)
         if user_prompt=="3":
             send_a_letter(donation)
         if user_prompt=="4":
@@ -101,3 +107,4 @@ def send_a_letter(donation):
 
 
 
+

jingdai/mailroom_unitest.py

@@ -0,0 +1,7 @@
+#!/usr/bin/env python
+
+import mailroom
+
+def test_1():
+    donation=[("Andy","Thomas", 300),("Sally", "Bui", 400),("Andy","Tom", 100),("Tom","Colin", 700),("Lisa","Dodo",90),("Abby","Lust",1000),("Abby","Lust",200),("Abby","Lust",300)]
+    assert mailroom.create_a_report(donation)==[('AndyThomas', 300, 1, 300.0), ('SallyBui', 400, 1, 400.0), ('AndyTom', 100, 1, 100.0), ('TomColin', 700, 1, 700.0), ('LisaDodo', 90, 1, 90.0), ('AbbyLust', 1500, 3, 500.0)]

jingdai/test_cigar_party.py

@@ -0,0 +1,61 @@
+#!/usr/bin/env python
+
+"""
+When squirrels get together for a party, they like to have cigars.
+A squirrel party is successful when the number of cigars is between
+40 and 60, inclusive. Unless it is the weekend, in which case there
+is no upper bound on the number of cigars.
+
+Return True if the party with the given values is successful,
+or False otherwise.
+"""
+
+
+# you can change this import to test different versions
+from cigar_party import cigar_party
+# from cigar_party import cigar_party2 as cigar_party
+# from cigar_party import cigar_party3 as cigar_party
+
+
+def test_1():
+    assert cigar_party(30, False) is False
+
+
+def test_2():
+    assert cigar_party(50, False) is True
+
+
+def test_3():
+    assert cigar_party(70, True) is True
+
+
+def test_4():
+    assert cigar_party(30, True) is False
+
+
+def test_5():
+    assert cigar_party(50, True) is True
+
+
+def test_6():
+    assert cigar_party(60, False) is True
+
+
+def test_7():
+    assert cigar_party(61, False) is False
+
+
+def test_8():
+    assert cigar_party(40, False) is True
+
+
+def test_9():
+    assert cigar_party(39, False) is False
+
+
+def test_10():
+    assert cigar_party(40, True) is True
+
+
+def test_11():
+    assert cigar_party(39, True) is False

jingdai/trigram.py

@@ -1 +1 @@
-#!/usr/bin/env python3import randomdef open_file(file):    with open(file,'r') as f:        s=f.read()        s = s.replace("\n", " ") # remove  line feed        s = s.replace("--"," ")        s = s.replace(",","")        s = s.replace(".","")        s = s.replace("(","")        s = s.replace(")","")    return sdef build_dict(s):    l=s.split(' ')    d={}    for i in range(len(l)-2):            values=[]            key=l[i]+ ' '+l[i+1]            value=l[i+2]            values.append(value)            if key in d:                for i in range(len(d[key])): # get all the elements from the value list                    values.append(d[key][i])                    values.reverse()            d[key]=values    key_count={} # store number of values of a key    key_list=list(d.keys())    for key in key_list:        if key in d.keys():            count=len(d[key])            key_count[key]=count    return (d, key_count, key_list)def trigram(d,key_count,key_list):    seed=random.randint(0,len(key_list)) # choose a random number as a starting point    start_point=key_list[seed-1]    new_string=start_point    key_point={}   # store the number of how many times a key was hit    key_point=key_count.copy()    for key in key_point:        values=0        key_point[key]=values    for i in range(len(d)):        nl=new_string.split(' ')        new_key=nl[i] + ' '+nl[i+1]        if new_key in d:            if key_count[new_key]==1:                new_string= new_string+ ' ' + d[new_key][0]                key_point[new_key]=1            elif key_count[new_key]>1:                if key_point[new_key]<key_count[new_key]:                    i=0                    new_string= new_string+ ' ' + d[new_key][key_point[new_key]] # if a key has multiple values, then return each value one after another                    key_point[new_key]=(key_point[new_key]+1)        else:            break    return(new_string)if __name__ == "__main__":    file='/home/vagrant/github/Py100-2017q1/jingdai/sherlock_small.txt'    try:        s=open_file(file)#read file and transform file    except ImportError:        raise    d, key_count, key_list=build_dict(s)    string=trigram(d, key_count, key_list)    print(string)
+#!/usr/bin/env python3import randomdef open_file(file):    with open(file,'r') as f:        s=f.read()        s = s.replace("\n", " ") # remove  line feed        s = s.replace("--"," ")        s = s.replace(",","")        s = s.replace(".","")        s = s.replace("(","")        s = s.replace(")","")    return sdef build_dict(s):    l=s.split(' ')    d={}    for i in range(len(l)-2):            values=[]            key=l[i]+ ' '+l[i+1]            value=l[i+2]            values.append(value)            if key in d:                for i in range(len(d[key])): # get all the elements from the value list                    values.append(d[key][i])                    values.reverse()            d[key]=values    key_count={} # store number of values of a key    key_list=list(d.keys())    for key in key_list:        if key in d.keys():            count=len(d[key])            key_count[key]=count    return (d, key_count, key_list)def trigram(d,key_count,key_list):    seed=random.randint(0,len(key_list)) # choose a random number as a starting point    start_point=key_list[seed-1]    new_string=start_point    key_point={}   # store the number of how many times a key was hit    key_point=key_count.copy()    for key in key_point:        values=0        key_point[key]=values    for i in range(len(d)):        nl=new_string.split(' ')        new_key=nl[i] + ' '+nl[i+1]        if new_key in d:            if key_count[new_key]==1:                new_string= new_string+ ' ' + d[new_key][0]                key_point[new_key]=1            elif key_count[new_key]>1:                if key_point[new_key]<key_count[new_key]:                    i=0                    new_string= new_string+ ' ' + d[new_key][key_point[new_key]] # if a key has multiple values, then return each value one after another                    key_point[new_key]=(key_point[new_key]+1)        else:            break    return(new_string)if __name__ == "__main__":    file='/home/vagrant/github/Py100-2017q1/jingdai/sherlock_small.txt'    try:        f = open(file)    except OSError:        print("file is not there!!")        raise    s=open_file(file)#read file and transform file    d, key_count, key_list=build_dict(s)    string=trigram(d, key_count, key_list)    print(string)

jingdai/trigram_2.py

@@ -0,0 +1,85 @@
+#!/usr/bin/env python3
+import random
+
+def open_file(file):
+
+    with open(file,'r') as f:
+        s=f.read()
+        s = s.replace("\n", " ") # remove  line feed
+        s = s.replace("--"," ")
+        s = s.replace(",","")
+        s = s.replace(".","")
+        s = s.replace("(","")
+        s = s.replace(")","")
+
+    return s
+
+
+def build_dict(s):
+    l=s.split(' ')
+    d={}
+    for i in range(len(l)-2):
+            values=[]
+            key=l[i]+ ' '+l[i+1]
+            value=l[i+2]
+            values.append(value)
+            if key in d:
+                for i in range(len(d[key])): # get all the elements from the value list
+                    values.append(d[key][i])
+                    values.reverse()
+            d[key]=values
+
+    key_count={} # store number of values of a key
+    key_list=list(d.keys())
+    for key in key_list:
+        if key in d.keys():
+            count=len(d[key])
+            key_count[key]=count
+
+    return (d, key_count, key_list)
+
+def trigram(d,key_count,key_list):
+    seed=random.randint(0,len(key_list)) # choose a random number as a starting point
+    start_point=key_list[seed-1]
+    new_string=start_point
+    key_point={}   # store the number of how many times a key was hit
+    key_point=key_count.copy()
+    for key in key_point:
+        values=0
+        key_point[key]=values
+
+    for i in range(len(d)):
+
+        nl=new_string.split(' ')
+        new_key=nl[i] + ' '+nl[i+1]
+        if new_key in d:
+            if key_count[new_key]==1:
+                new_string= new_string+ ' ' + d[new_key][0]
+                key_point[new_key]=1
+            elif key_count[new_key]>1:
+                if key_point[new_key]<key_count[new_key]:
+                    i=0
+                    new_string= new_string+ ' ' + d[new_key][key_point[new_key]] # if a key has multiple values, then return each value one after another
+                    key_point[new_key]=(key_point[new_key]+1)
+        else:
+            break
+
+    return(new_string)
+
+
+if __name__ == "__main__":
+    file='/home/vagrant/github/Py100-2017q1/jingdai/sherlock_small.txt'
+    try:
+        f = open(file)
+    except OSError:
+        print("file is not there!!")
+        raise
+
+
+    s=open_file(file)#read file and transform file
+    d, key_count, key_list=build_dict(s)
+    string=trigram(d, key_count, key_list)
+    print(string)
+
+
+

mbozee/mailroom_ui/Procfile

@@ -0,0 +1 @@
+web: gunicorn app:app

mbozee/mailroom_ui/README.md

@@ -0,0 +1,3 @@
+Deployed on Heroku: http://mailroomapp.herokuapp.com/
+
+Uses Python to generate fictitious donation data. Flask deployed on Heroku.

mbozee/mailroom_ui/app.py

@@ -0,0 +1,29 @@
+from flask import Flask, render_template
+
+app = Flask(__name__)
+
+
+@app.route("/")
+def index():
+    donors = {
+        'Donovan Leitch': [100, 20, 1000],
+        'Stevie Nicks': [200, 500],
+        'Ian Anderson': [190],
+        'Mavis Staples': [170, 40, 130],
+        'Suzanne Vega': [160, 300]
+    }
+
+    donors_sorted = sorted(donors.items(),
+                           key=lambda t: sum(t[1]), reverse=True)
+
+    for donor in donors_sorted:
+        donor_name = donor[0]
+        total_given = sum(donor[1])
+        num_gifts = len(donor[1])
+        avg_gift = round(sum(donor[1])/len(donor[1]))
+
+    return render_template("index.html", donors=donors, donors_sorted=donors_sorted, donor_name=donor_name, total_given=total_given, num_gifts=num_gifts, avg_gift=avg_gift)
+
+
+if __name__ == "__main__":
+    app.run(debug=True, port=8000, host='0.0.0.0')