""" Purpose: implement test 2 modules """ def honorable( ) : return "yes" # ------------------------------------------------------------- def btog( b ) : result = 42 * b return result # ------------------------------------------------------------- def ulate( items ) : total = 0 for element in items : if ( element < 0 ) : total = total + element else : total = total - element return total # ------------------------------------------------------------- def cmp( items ) : pos = 0 zeroes = 0 negs = 0 for element in items : if ( element > 0 ) : pos = pos + 1 elif ( element < 0 ) : negs = negs + 1 else : zeroes = zeroes + 1 result = [ negs, zeroes, pos ] return result # ------------------------------------------------------------- def build( items ) : d = {} for element in items : v = items.count( element ) d[ element ] = v return d # ------------------------------------------------------------- def skew( p ) : r, g, b = p if ( r == max( p ) ) : return ( r, 0, 0 ) elif ( g == max( p ) ) : return ( 0, g, 0 ) else : return ( 0, 0, b ) # alternate - incorrect def skew2( p ) : if ( r > g and r > b ) : # this ignores possible ties, so it is incorrect. must account for r == g or r == b return ( r, 0, 0) elif ( g > b ) : return ( 0, g, 0 ) else : return ( 0, 0, b ) # alternate - correct def skew3( p ) : if ( r >= g and r >= b ) : return ( r, 0, 0) elif ( g >= b ) : return ( 0, g, 0 ) else : return ( 0, 0, b ) # ------------------------------------------------------------- def tract( s1, s2 ) : result = "" for ch in s1 : if ( ch in result ) : pass elif ( ch not in s2 ) : # note that the elif is needed to ensure that this block of code is not entered if the # previous condition was met ( ch in result ) result = result + ch return result