list ==>
v = [1,2,3]
v.extend([12,13]) # iterator object
v.append(10)
v.pop() # return last element
v.insert(index,value) # front is index later is value
v.sort(cmp) # sort , cmp is function user-defined
v.index(position) # if position > len , raise exception
v.reverse() # u know
v.count(value) # count
v.remove(value) # remove one value
dict ==>
d = {'a':1,'b':2}
d.keys() # return list
d.values() # return list of valuse
d.setdefault(key,value) # if d[key] return d[key] else d[key] = value
d.get(key,value) # the same to front but
d.items() # return list of tuple
d.itervalues() # adapter # iterators of values
d.iterkeys() # same to front
d.iteritems() # iterators once one key ,item
d.pop(key) # return value = d[key]
d.update(dict()) # new dict
d.clear() # so horrible
d.fromkeys(tuple,value) # u can use it to make dict quickly if all keys' value same but u should new a one copy
d.has_key(key) # judge d[key] ==> if key in d
tuple == >
v = (1,2,3)
set ==>
b = set() # set([]) list
b.add(value)
b.pop() # from front
b.remove(value)
b.update(value) # value ---- tuple ,list ,set ...
b.discard(value) # remove value in set
#-----------------------------#
zip =>
zip(list,list) # pair tuple in list
reduce =>
################## skills
dict([[y,x] for x,y in d.iteritems()]) # reverse key and value