#press shift+enter to execute this
print 'Hello world'

#ipython automatically show representation of 
#the return value of the last command
1+1

x = 1 #integer
y = 2.0 #float
t = True #boolean (False)
s = 'hello' #string
s2 = "world" #double quotes works too
#there are also triple quotes google python triple quotes
n=None #Null like variable None.

print x+y #you can refer to previously assigned variable.

s+' '+s2

#boolean operations
x>1 and (y>=3 or not t) and not s=='hello' and n is None

#Bonus: The only language I know that can do this
0 < x < 10

'x is %d. y is %f'%(x,y)

#even more advance stuff
#locals returns dictionary of
#local variables which you then use 
#in formatting by name
'x is %(x)d. y is %(y)f'%locals() #easier to read

l = [1, 2, 3, 4, 5, 6, 7]
print l #[1, 2, 3, 4, 5, 6, 7]
print l[2] #3
print len(l) # list length
print l[-1] #7 negative index works from the back (-1)
l2 = [] #want an empty list?
print l2

#doesn't really need hold the same type
#but don't recommend. You will just get confused
bad_list = ['dog','cat',1,1.234]

l[1] = 10 #assignment
l

l.append(999) #append list
l

#can be created from list com
l.sort() #sort
l

#searching O(N) use set for O(log(N))
10 in l

11 not in l

#useful list function
range(10) #build it all in memory

#list comprehension
#we will get to for loop later but for simple one
#list comprehension is much more readable
my_list = [2*x for x in l]
print my_list
my_list = [ (2*x,x) for x in range(10)]
print my_list
my_list = [3*x for x in range(10) if x%2==0]
print my_list

#This might come in handy
[1]*10

#in this cell try my_ and press tab
#IPython knows about local variables and
#can do autocomplete (remember locals()?)

#try type len(<TAB> here
#python can give you documentation/function signature etc.

tu = (1,2,3) #tuple immutable list
print tu
tu2 = tuple(l) #convert list to tuple
print tu2
tu3 = 4,5,6 #parenthesis is actually optional but makes it more readable
print tu3

#access
tu[1]
#you can't assign to it

#tuple expansion
x, y, z = tu
print x #1
print y #2
print z #3
print x, y, z #you can use tuple in print statement too

x, y, z = 10, 20, 30#parenthesis is actually optional
print z, y, x #any order

#useful for returning multiple values
def f(x,y):
    return x+y, x-y #parenthesis is implied
a, b = f(10,5)
print a #15
print b #5
print a, b #works too

d = {'a':1, 'b':10, 'c':100}
print d #{'a': 1, 'c': 100, 'b': 10}
d2 = dict(a=2, b=20, c=200) #using named argument
print d2 #{'a': 2, 'c': 200, 'b': 20}
d3 = dict([('a', 3),('b', 30),('c', 300)]) #list of tuples
print d3 #{'a': 3, 'c': 300, 'b': 30}
d4 = {x:2*x for x in range(10)}#comprehension (key doesn't have to be string)
print d4 #{0: 0, 1: 2, 2: 4, 3: 6, 4: 8, 5: 10, 6: 12, 7: 14, 8: 16, 9: 18}
d5 = {} #empty dict
print d5 #{}

print d['a'] #access
print len(d) #count element
d['d'] = 1000#insert
print d #{'a': 1, 'c': 100, 'b': 10, 'd': 1000}
del d['c']#remove
print d #{'a': 1, 'b': 10, 'd': 10}
print 'c' in d #keyexists?

#use dictionary in comprehension
#d.items() return generator which gives tuple 
#k,v in d.items() does tuple expansion in disguise
new_d = {k:2*v for k,v in d.items()}
print new_d #{'a': 2, 'b': 20, 'd': 20}

s = {1,2,3,4,5,6}
print s
s2 = set([4, 5, 6, 7, 8, 9, 9, 9, 9]) #from a list
#duplicated element is ignored
print s2

#membership this is O(log(n))
print 3 in s
print 10 in s
print 11 not in s

print s | s2 #union
print s & s2 #intersection
print s - s2 #differece
print s ^ s2 #symmetric differnce
print {2,3,4} <= s #subset
print s >= {2,3,4} #superset

#insert
s.update([10,11,12])
print s
print 11 in s

x = 20
if x>10: #colon
    print 'greater than 10'#don't for get the indentation
elif x>5: #parenthesis is not really needed
    print 'greater than 5'
else:
    print 'not greater than 10'
x+=1#continue your execution with lower indentation
print x

#shorthand if
y = 'oh yes' if x>100 else 'oh no' #no colon
print y

#since indentation matters sometime we don't need any statement
if x>10:
    print 'yes'
else:
    pass #pass keywoard means do nothing
x+=1
print x

#why is there no bracket??
from __future__ import braces #easter egg

#iterate over list
for i in range(5): #not recommended use xrange instead
    print i#again indentation is meaningful

#Lazy programming
#save memory
for i in xrange(5):
    print i

#looping the list
l = ['a','b','c']
for x in l:
    print x

#you can build your own generator too
l = [1,2,3,4]
#(2*y for y in l) is a generator that split out 2*y
#for every element in l
#not really a good way to write it but just to show it
for x in (2*y for y in l):#notice the brackets
    print x

#if you need index
for i,x in enumerate(l):
    print i,x

#looping dictionary
d = {'a':1,'b':10,'c':100}
#items() returns a generator which return tuple
#k,v in d.items() is tuple expansion in disguise
for k,v in d.items():
    print k,v

#looping over multiple list together
lx = [1,2,3]
ly = [x+1 for x in l]
print l,l2
for x,y in zip(lx,ly): #there is also itertools.izip that does generator
    print x,y

#complete the list with while loop
x = 0
while x<5:
    print x
    x+=1

def f(x, y): #remember the colon
    print 'x =',x #again indentation
    print 'y =',y
    return x+y
f(10,20)

#python is dynamic typing language
#specifically it's Duck Typing(wikipedia it. Fun Read.)
#this means as long as it has the right signature
#Python doesn't care
f('hello','world')

#you can pass it by name too
#this is useful since you can't always remember the order
#of the arguments
f(y='y',x='x') # notice i put y before x

#default/keyword arguments
def g(x, y, z='hey'):
    #one of the most useful function
    print locals()#return dictionary of all local variables
g(10,20)
g(10,20,30)#can do it positionally

g(10,z='ZZZZ',y='YYYY') #or using keyword

def myfunc(x,y,z, long_keyword="111000"):
    return None

#IPython knows about keyword arguments name try type this
#myfunc(x, y, z, lon<TAB>

#in your programming life time you might be
#you might be tempting to put a mutable object like list
#as default argument. Just Don't
def f(x,y,z=[]): #Don't do this
    pass
def f(x,y,z=None):
    z = [] if z is None else z

#arbitary number of argument C's va_arg
def h(x,y,*arg,**kwd):
    print locals()
h(10,20,30,40,50,custom_kwd='hey')

#Bonus: more cool stuff.
#argument expansion
def g(x, y, z):
    print locals()
t = (1,2,3)
g(*t)

#If you know lambda calculus
f = lambda x: x+1
f(3)

#define a class
class MyClass:
    x = 1 #you can define a field like this
    
    #first argument is called self. It refers to itself
    #think of it as this keyword in C
    def __init__(self, y): #constructor
        self.y = y #or define it here
    
    def do_this(self, z):
        return self.x + self.y + z

a = MyClass(10)
print a.do_this(100)

#press a.<TAB> here for IPython autocomplete

#you can even add field to it
a.z = 'haha'
print a.z

#remember when I said think of it as C pointer??
b = a
b.x = 999 #change b
print a.x #printing a.x not b.x

#you may think you won't encounter it but...
a = [1,2,3]
b = a
b[1]=10
print a

#shallow copy is easy
a = [1,2,3]
b = a[:] #remember slicing? it creates a new list
b[1] = 10
print a, b

class Parent:
    x = 10
    y = 20
    
class Child(Parent):
    x = 30
    z = 50

p = Parent()
c = Child()
print p.x
print c.x

#this might comes in handy
'_'.join(["let's",'join','this'])

x =1 
x.real

def f(x,y):
    return x+y
f.func_code.co_varnames #This is used in writing fitting library

#bonus introspection
a = MyClass(10)
dir(a)

import math #import module called math

print math.exp(2)

from math import exp #import exp from math module
print exp(3)

#not recommended but
from math import * #import every symbol in that module
sin(100)

#if you hate typing
#import it into a symbol
import math as m
m.exp(10)

def f(x):
    #we need x to be >0
    if x<0:
        raise RuntimeError('Dude!! watch what you are doing')
    return 10

f(-1)

#we can catch with with try except block
try:
    f(-1)
except RuntimeError as e:
    print e

try:
    f(-1)
except RuntimeError as e:
    print 'hoooooooooooo'
    print e
    raise #you can reraise it