基本数据类型补充：
set 是一个无序且不重复的元素集合
1 classset(object):2 """
3 set() -> new empty set object4 set(iterable) -> new set object5
6 Build an unordered collection of unique elements.7 """
8 def add(self, *args, **kwargs): #real signature unknown
9 """
10 Add an element to a set，添加元素11
12 This has no effect if the element is already present.13 """
14 pass
15
16 def clear(self, *args, **kwargs): #real signature unknown
17 """Remove all elements from this set. 清除内容"""
18 pass
19
20 def copy(self, *args, **kwargs): #real signature unknown
21 """Return a shallow copy of a set. 浅拷贝"""
22 pass
23
24 def difference(self, *args, **kwargs): #real signature unknown
25 """
26 Return the difference of two or more sets as a new set. A中存在，B中不存在27
28 (i.e. all elements that are in this set but not the others.)29 """
30 pass
31
32 def difference_update(self, *args, **kwargs): #real signature unknown
33 """Remove all elements of another set from this set. 从当前集合中删除和B中相同的元素"""
34 pass
35
36 def discard(self, *args, **kwargs): #real signature unknown
37 """
38 Remove an element from a set if it is a member.39
40 If the element is not a member, do nothing. 移除指定元素，不存在不保错41 """
42 pass
43
44 def intersection(self, *args, **kwargs): #real signature unknown
45 """
46 Return the intersection of two sets as a new set. 交集47
48 (i.e. all elements that are in both sets.)49 """
50 pass
51
52 def intersection_update(self, *args, **kwargs): #real signature unknown
53 """Update a set with the intersection of itself and another. 取交集并更更新到A中"""
54 pass
55
56 def isdisjoint(self, *args, **kwargs): #real signature unknown
57 """Return True if two sets have a null intersection. 如果没有交集，返回True，否则返回False"""
58 pass
59
60 def issubset(self, *args, **kwargs): #real signature unknown
61 """Report whether another set contains this set. 是否是子序列"""
62 pass
63
64 def issuperset(self, *args, **kwargs): #real signature unknown
65 """Report whether this set contains another set. 是否是父序列"""
66 pass
67
68 def pop(self, *args, **kwargs): #real signature unknown
69 """
70 Remove and return an arbitrary set element.71 Raises KeyError if the set is empty. 移除元素72 """
73 pass
74
75 def remove(self, *args, **kwargs): #real signature unknown
76 """
77 Remove an element from a set; it must be a member.78
79 If the element is not a member, raise a KeyError. 移除指定元素，不存在保错80 """
81 pass
82
83 def symmetric_difference(self, *args, **kwargs): #real signature unknown
84 """
85 Return the symmetric difference of two sets as a new set. 对称差集86
87 (i.e. all elements that are in exactly one of the sets.)88 """
89 pass
90
91 def symmetric_difference_update(self, *args, **kwargs): #real signature unknown
92 """Update a set with the symmetric difference of itself and another. 对称差集，并更新到a中"""
93 pass
94
95 def union(self, *args, **kwargs): #real signature unknown
96 """
97 Return the union of sets as a new set. 并集98
99 (i.e. all elements that are in either set.)100 """
101 pass
102
103 def update(self, *args, **kwargs): #real signature unknown
104 """Update a set with the union of itself and others. 更新"""
105 pass
1：创建
1 s =set()2 s = {11,22,33,55}
2：转换
1 li = [11,22,33,44]2 tu = (11,22,33,44)3 st = '123'
4 s = set(li)
3：intersection , intersection_update方法
a = {11,22,33,44}
b= {22,66,77,88}
ret=a.intersection(b)print(ret)
intersection取得两个集合中的交集元素，并将这些元素以一个新的集合返回给一个变量接收
a = {11,22,33,44}
b= {22,66,77,88}
a.intersection_update(b)print(a)
intersection_update取得两个集合的交集元素，并更新a集合
4：isdisjoint , issubset , issuperset方法
1 s = {11,22,33,44}2 b = {11,22,77,55}3 ret = s.isdisjoint(b)#有交集返回False，没有交集返回True
4 print(ret)5 ## False
issubset判断是否为子集
a = {11,22,33,44}
b= {11,44}
ret=b.issubset(a)print(ret)##########################################
True
issuperset判断是否为父集
a = {11,22,33,44}
b= {11,44}
ret=a.issubset(b)print(ret)##########################################
False
5：discard , remove , pop
1 s = {11,22,33,44}2 s.remove(11)3 print(s)4 s.discard(22)5 print(s)6 s.pop()7 print(s)
三者都能达到移除元素的效果，区别在于remove移除集合中不存在的元素时会报错，discard移除不存在的元素是不会报错，pop无法精确控制移除哪个元素，按其自身的规则随机移除元素，返回被移除的元素，可以使用变量接收其返回值
6：symmetric_difference取差集
1 s = {11,22,33,44}2 b = {11,22,77,55}3 r1 =s.difference(b)4 r2 =b.difference(s)5 print(r1)6 print(r2)7 ret =s.symmetric_difference(b)8 print(ret)9 ## set([33, 44])
10 ## set([77, 55])
11 ## set([33, 44, 77, 55])
symmetric_difference返回两个集合中不是交集的元素
上面的代码中，将symmetric_difference换成symmetric_difference_update则表示将两个集合中不是交集的部分赋值给s
7：union , update方法
1 s = {11,22,33,44}2 b = {11,22,77,55}3 ret =s.union(b)4 print(ret)5 ## set([33, 11, 44, 77, 22, 55])
union方法合并两个集合
1 s = {11,22,33,44}2 b = {11,22,77,55}3 s.update(b)4 print(s)5 ## set([33, 11, 44, 77, 22, 55])
update方法更新s集合，将b集合中的元素添加到s集合中！update方法也可以传递一个列表，如：update([23,45,67])
练习题：有下面两个字典
要求：
1)两个字典中有相同键的，则将new_dict中的值更新到old_dict对应键的值
2)old_dict中存在的键且new_dict中没有的键，在old_dict中删除，并把new_dict中的键值更新到old_dict中
3)最后输出old_dict
1 #数据库中原有
2 old_dict ={3 "#1":{ 'hostname':'c1', 'cpu_count': 2, 'mem_capicity': 80},4 "#2":{ 'hostname':'c1', 'cpu_count': 2, 'mem_capicity': 80},5 "#3":{ 'hostname':'c1', 'cpu_count': 2, 'mem_capicity': 80}6 }7
8 #cmdb 新汇报的数据
9 new_dict ={10 "#1":{ 'hostname':'c1', 'cpu_count': 2, 'mem_capicity': 800},11 "#3":{ 'hostname':'c1', 'cpu_count': 2, 'mem_capicity': 80},12 "#4":{ 'hostname':'c2', 'cpu_count': 2, 'mem_capicity': 80}13 }
old_keys = set(old_dict.keys())
new_keys= set(new_dict.keys())
#需要更新元素的键
update_keys=old_keys.intersection(new_keys)
print(update_keys)
#需要删除元素的键
del_keys=old_keys.difference(new_keys)
#需要添加元素的键
add_keys=new_keys.difference(old_keys)
print(del_keys)
print(add_keys)
update_keys=list(update_keys)for i inupdate_keys :
old_dict[i]=new_dict[i]
del_keys=list(del_keys)for j indel_keys :
del old_dict[j]for k inlist(add_keys) :
old_dict[k]=new_dict[k]
print(old_dict)
########################################
{'#3': {'hostname': 'c1', 'cpu_count': 2, 'mem_capicity': 80}, '#1': {'hostname': 'c1', 'cpu_count': 2, 'mem_capicity': 800}, '#4': {'hostname': 'c2', 'cpu_count': 2, 'mem_capicity': 80}}
答案
collections系列
一、计数器(counter)
Counter是对字典类型的补充，用于追踪值的出现次数。
ps：具备字典的所有功能 + 自己的功能
c = Counter('abcdeabcdabcaba')
print c
输出：Counter({'a': 5, 'b': 4, 'c': 3, 'd': 2, 'e': 1})
1 ########################################################################
2 ### Counter
3 ########################################################################
4
5 classCounter(dict):6 '''Dict subclass for counting hashable items. Sometimes called a bag7 or multiset. Elements are stored as dictionary keys and their counts8 are stored as dictionary values.9
10 >>> c = Counter('abcdeabcdabcaba') # count elements from a string11
12 >>> c.most_common(3) # three most common elements13 [('a', 5), ('b', 4), ('c', 3)]14 >>> sorted(c) # list all unique elements15 ['a', 'b', 'c', 'd', 'e']16 >>> ''.join(sorted(c.elements())) # list elements with repetitions17 'aaaaabbbbcccdde'18 >>> sum(c.values()) # total of all counts19
20 >>> c['a'] # count of letter 'a'21 >>> for elem in 'shazam': # update counts from an iterable22 ... c[elem] += 1 # by adding 1 to each element's count23 >>> c['a'] # now there are seven 'a'24 >>> del c['b'] # remove all 'b'25 >>> c['b'] # now there are zero 'b'26
27 >>> d = Counter('simsalabim') # make another counter28 >>> c.update(d) # add in the second counter29 >>> c['a'] # now there are nine 'a'30
31 >>> c.clear() # empty the counter32 >>> c33 Counter()34
35 Note: If a count is set to zero or reduced to zero, it will remain36 in the counter until the entry is deleted or the counter is cleared:37
38 >>> c = Counter('aaabbc')39 >>> c['b'] -= 2 # reduce the count of 'b' by two40 >>> c.most_common() # 'b' is still in, but its count is zero41 [('a', 3), ('c', 1), ('b', 0)]42
43 '''
44 #References:
45 #http://en.wikipedia.org/wiki/Multiset
46 #http://www.gnu.org/software/smalltalk/manual-base/html_node/Bag.html
47 #http://www.demo2s.com/Tutorial/Cpp/0380__set-multiset/Catalog0380__set-multiset.htm
48 #http://code.activestate.com/recipes/259174/
49 #Knuth, TAOCP Vol. II section 4.6.3
50
51 def __init__(self, iterable=None, **kwds):52 '''Create a new, empty Counter object. And if given, count elements53 from an input iterable. Or, initialize the count from another mapping54 of elements to their counts.55
56 >>> c = Counter() # a new, empty counter57 >>> c = Counter('gallahad') # a new counter from an iterable58 >>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping59 >>> c = Counter(a=4, b=2) # a new counter from keyword args60
61 '''
62 super(Counter, self).__init__()63 self.update(iterable, **kwds)64
65 def __missing__(self, key):66 """对于不存在的元素，返回计数器为0"""
67 'The count of elements not in the Counter is zero.'
68 #Needed so that self[missing_item] does not raise KeyError
69 return070
71 def most_common(self, n=None):72 """数量大于等n的所有元素和计数器"""
73 '''List the n most common elements and their counts from the most74 common to the least. If n is None, then list all element counts.75
76 >>> Counter('abcdeabcdabcaba').most_common(3)77 [('a', 5), ('b', 4), ('c', 3)]78
79 '''
80 #Emulate Bag.sortedByCount from Smalltalk
81 if n isNone:82 return sorted(self.iteritems(), key=_itemgetter(1), reverse=True)83 return _heapq.nlargest(n, self.iteritems(), key=_itemgetter(1))84
85 defelements(self):86 """计数器中的所有元素，注：此处非所有元素集合，而是包含所有元素集合的迭代器"""
87 '''Iterator over elements repeating each as many times as its count.88
89 >>> c = Counter('ABCABC')90 >>> sorted(c.elements())91 ['A', 'A', 'B', 'B', 'C', 'C']92
93 # Knuth's example for prime factors of 1836: 2**2 * 3**3 * 17**194 >>> prime_factors = Counter({2: 2, 3: 3, 17: 1})95 >>> product = 196 >>> for factor in prime_factors.elements(): # loop over factors97 ... product *= factor # and multiply them98 >>> product99
100 Note, if an element's count has been set to zero or is a negative101 number, elements() will ignore it.102
103 '''
104 #Emulate Bag.do from Smalltalk and Multiset.begin from C++.
105 return_chain.from_iterable(_starmap(_repeat, self.iteritems()))106
107 #Override dict methods where necessary
108
109 @classmethod110 def fromkeys(cls, iterable, v=None):111 #There is no equivalent method for counters because setting v=1
112 #means that no element can have a count greater than one.
113 raiseNotImplementedError(114 'Counter.fromkeys() is undefined. Use Counter(iterable) instead.')115
116 def update(self, iterable=None, **kwds):117 """更新计数器，其实就是增加；如果原来没有，则新建，如果有则加一"""
118 '''Like dict.update() but add counts instead of replacing them.119
120 Source can be an iterable, a dictionary, or another Counter instance.121
122 >>> c = Counter('which')123 >>> c.update('witch') # add elements from another iterable124 >>> d = Counter('watch')125 >>> c.update(d) # add elements from another counter126 >>> c['h'] # four 'h' in which, witch, and watch127
128 '''
129 #The regular dict.update() operation makes no sense here because the
130 #replace behavior results in the some of original untouched counts
131 #being mixed-in with all of the other counts for a mismash that
132 #doesn't have a straight-forward interpretation in most counting
133 #contexts. Instead, we implement straight-addition. Both the inputs
134 #and outputs are allowed to contain zero and negative counts.
135
136 if iterable is notNone:137 ifisinstance(iterable, Mapping):138 ifself:139 self_get =self.get140 for elem, count initerable.iteritems():141 self[elem] = self_get(elem, 0) +count142 else:143 super(Counter, self).update(iterable) #fast path when counter is empty
144 else:145 self_get =self.get146 for elem initerable:147 self[elem] = self_get(elem, 0) + 1
148 ifkwds:149 self.update(kwds)150
151 def subtract(self, iterable=None, **kwds):152 """相减，原来的计数器中的每一个元素的数量减去后添加的元素的数量"""
153 '''Like dict.update() but subtracts counts instead of replacing them.154 Counts can be reduced below zero. Both the inputs and outputs are155 allowed to contain zero and negative counts.156
157 Source can be an iterable, a dictionary, or another Counter instance.158
159 >>> c = Counter('which')160 >>> c.subtract('witch') # subtract elements from another iterable161 >>> c.subtract(Counter('watch')) # subtract elements from another counter162 >>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch163 >>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch164 -1165
166 '''
167 if iterable is notNone:168 self_get =self.get169 ifisinstance(iterable, Mapping):170 for elem, count initerable.items():171 self[elem] = self_get(elem, 0) -count172 else:173 for elem initerable:174 self[elem] = self_get(elem, 0) - 1
175 ifkwds:176 self.subtract(kwds)177
178 defcopy(self):179 """拷贝"""
180 'Return a shallow copy.'
181 return self.__class__(self)182
183 def __reduce__(self):184 """返回一个元组(类型，元组)"""
185 return self.__class__, (dict(self),)186
187 def __delitem__(self, elem):188 """删除元素"""
189 'Like dict.__delitem__() but does not raise KeyError for missing values.'
190 if elem inself:191 super(Counter, self).__delitem__(elem)192
193 def __repr__(self):194 if notself:195 return '%s()' % self.__class__.__name__
196 items = ','.join(map('%r: %r'.__mod__, self.most_common()))197 return '%s({%s})' % (self.__class__.__name__, items)198
199 #Multiset-style mathematical operations discussed in:
200 #Knuth TAOCP Volume II section 4.6.3 exercise 19
201 #and at http://en.wikipedia.org/wiki/Multiset
202 #203 #Outputs guaranteed to only include positive counts.
204 #205 #To strip negative and zero counts, add-in an empty counter:
206 #c += Counter()
207
208 def __add__(self, other):209 '''Add counts from two counters.210
211 >>> Counter('abbb') + Counter('bcc')212 Counter({'b': 4, 'c': 2, 'a': 1})213
214 '''
215 if notisinstance(other, Counter):216 returnNotImplemented217 result =Counter()218 for elem, count inself.items():219 newcount = count +other[elem]220 if newcount >0:221 result[elem] =newcount222 for elem, count inother.items():223 if elem not in self and count >0:224 result[elem] =count225 returnresult226
227 def __sub__(self, other):228 '''Subtract count, but keep only results with positive counts.229
230 >>> Counter('abbbc') - Counter('bccd')231 Counter({'b': 2, 'a': 1})232
233 '''
234 if notisinstance(other, Counter):235 returnNotImplemented236 result =Counter()237 for elem, count inself.items():238 newcount = count -other[elem]239 if newcount >0:240 result[elem] =newcount241 for elem, count inother.items():242 if elem not in self and count <0:243 result[elem] = 0 -count244 returnresult245
246 def __or__(self, other):247 '''Union is the maximum of value in either of the input counters.248
249 >>> Counter('abbb') | Counter('bcc')250 Counter({'b': 3, 'c': 2, 'a': 1})251
252 '''
253 if notisinstance(other, Counter):254 returnNotImplemented255 result =Counter()256 for elem, count inself.items():257 other_count =other[elem]258 newcount = other_count if count < other_count elsecount259 if newcount >0:260 result[elem] =newcount261 for elem, count inother.items():262 if elem not in self and count >0:263 result[elem] =count264 returnresult265
266 def __and__(self, other):267 '''Intersection is the minimum of corresponding counts.268
269 >>> Counter('abbb') & Counter('bcc')270 Counter({'b': 1})271
272 '''
273 if notisinstance(other, Counter):274 returnNotImplemented275 result =Counter()276 for elem, count inself.items():277 other_count =other[elem]278 newcount = count if count < other_count elseother_count279 if newcount >0:280 result[elem] =newcount281 returnresult282
283 Counter
Counter
二、有序字典(orderedDict )
orderdDict是对字典类型的补充，他记住了字典元素添加的顺序
1 classOrderedDict(dict):2 'Dictionary that remembers insertion order'
3 #An inherited dict maps keys to values.
4 #The inherited dict provides __getitem__, __len__, __contains__, and get.
5 #The remaining methods are order-aware.
6 #Big-O running times for all methods are the same as regular dictionaries.
7
8 #The internal self.__map dict maps keys to links in a doubly linked list.
9 #The circular doubly linked list starts and ends with a sentinel element.
10 #The sentinel element never gets deleted (this simplifies the algorithm).
11 #Each link is stored as a list of length three: [PREV, NEXT, KEY].
12
13 def __init__(self, *args, **kwds):14 '''Initialize an ordered dictionary. The signature is the same as15 regular dictionaries, but keyword arguments are not recommended because16 their insertion order is arbitrary.17
18 '''
19 if len(args) > 1:20 raise TypeError('expected at most 1 arguments, got %d' %len(args))21 try:22 self.__root
23 exceptAttributeError:24 self.__root = root = [] #sentinel node
25 root[:] =[root, root, None]26 self.__map ={}27 self.__update(*args, **kwds)28
29 def __setitem__(self, key, value, dict_setitem=dict.__setitem__):30 'od.__setitem__(i, y) <==> od[i]=y'
31 #Setting a new item creates a new link at the end of the linked list,
32 #and the inherited dictionary is updated with the new key/value pair.
33 if key not inself:34 root = self.__root
35 last =root[0]36 last[1] = root[0] = self.__map[key] =[last, root, key]37 returndict_setitem(self, key, value)38
39 def __delitem__(self, key, dict_delitem=dict.__delitem__):40 'od.__delitem__(y) <==> del od[y]'
41 #Deleting an existing item uses self.__map to find the link which gets
42 #removed by updating the links in the predecessor and successor nodes.
43 dict_delitem(self, key)44 link_prev, link_next, _ = self.__map.pop(key)45 link_prev[1] = link_next #update link_prev[NEXT]
46 link_next[0] = link_prev #update link_next[PREV]
47
48 def __iter__(self):49 'od.__iter__() <==> iter(od)'
50 #Traverse the linked list in order.
51 root = self.__root
52 curr = root[1] #start at the first node
53 while curr is notroot:54 yield curr[2] #yield the curr[KEY]
55 curr = curr[1] #move to next node
56
57 def __reversed__(self):58 'od.__reversed__() <==> reversed(od)'
59 #Traverse the linked list in reverse order.
60 root = self.__root
61 curr = root[0] #start at the last node
62 while curr is notroot:63 yield curr[2] #yield the curr[KEY]
64 curr = curr[0] #move to previous node
65
66 defclear(self):67 'od.clear() -> None. Remove all items from od.'
68 root = self.__root
69 root[:] =[root, root, None]70 self.__map.clear()71 dict.clear(self)72
73 #-- the following methods do not depend on the internal structure --
74
75 defkeys(self):76 'od.keys() -> list of keys in od'
77 returnlist(self)78
79 defvalues(self):80 'od.values() -> list of values in od'
81 return [self[key] for key inself]82
83 defitems(self):84 'od.items() -> list of (key, value) pairs in od'
85 return [(key, self[key]) for key inself]86
87 defiterkeys(self):88 'od.iterkeys() -> an iterator over the keys in od'
89 returniter(self)90
91 defitervalues(self):92 'od.itervalues -> an iterator over the values in od'
93 for k inself:94 yieldself[k]95
96 defiteritems(self):97 'od.iteritems -> an iterator over the (key, value) pairs in od'
98 for k inself:99 yield(k, self[k])100
101 update =MutableMapping.update102
103 __update = update #let subclasses override update without breaking __init__
104
105 __marker =object()106
107 def pop(self, key, default=__marker):108 '''od.pop(k[,d]) -> v, remove specified key and return the corresponding109 value. If key is not found, d is returned if given, otherwise KeyError110 is raised.111
112 '''
113 if key inself:114 result =self[key]115 delself[key]116 returnresult117 if default is self.__marker:118 raiseKeyError(key)119 returndefault120
121 def setdefault(self, key, default=None):122 'od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od'
123 if key inself:124 returnself[key]125 self[key] =default126 returndefault127
128 def popitem(self, last=True):129 '''od.popitem() -> (k, v), return and remove a (key, value) pair.130 Pairs are returned in LIFO order if last is true or FIFO order if false.131
132 '''
133 if notself:134 raise KeyError('dictionary is empty')135 key = next(reversed(self) if last elseiter(self))136 value =self.pop(key)137 returnkey, value138
139 def __repr__(self, _repr_running={}):140 'od.__repr__() <==> repr(od)'
141 call_key =id(self), _get_ident()142 if call_key in_repr_running:143 return '...'
144 _repr_running[call_key] = 1
145 try:146 if notself:147 return '%s()' % (self.__class__.__name__,)148 return '%s(%r)' % (self.__class__.__name__, self.items())149 finally:150 del_repr_running[call_key]151
152 def __reduce__(self):153 'Return state information for pickling'
154 items = [[k, self[k]] for k inself]155 inst_dict =vars(self).copy()156 for k invars(OrderedDict()):157 inst_dict.pop(k, None)158 ifinst_dict:159 return (self.__class__, (items,), inst_dict)160 return self.__class__, (items,)161
162 defcopy(self):163 'od.copy() -> a shallow copy of od'
164 return self.__class__(self)165
166 @classmethod167 def fromkeys(cls, iterable, value=None):168 '''OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S.169 If not specified, the value defaults to None.170
171 '''
172 self =cls()173 for key initerable:174 self[key] =value175 returnself176
177 def __eq__(self, other):178 '''od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive179 while comparison to a regular mapping is order-insensitive.180
181 '''
182 ifisinstance(other, OrderedDict):183 return dict.__eq__(self, other) andall(_imap(_eq, self, other))184 return dict.__eq__(self, other)185
186 def __ne__(self, other):187 'od.__ne__(y) <==> od!=y'
188 return not self ==other189
190 #-- the following methods support python 3.x style dictionary views --
191
192 defviewkeys(self):193 "od.viewkeys() -> a set-like object providing a view on od's keys"
194 returnKeysView(self)195
196 defviewvalues(self):197 "od.viewvalues() -> an object providing a view on od's values"
198 returnValuesView(self)199
200 defviewitems(self):201 "od.viewitems() -> a set-like object providing a view on od's items"
202 returnItemsView(self)203
204 OrderedDict
OrderedDict
三、默认字典(defaultdict)
defaultdict是对字典的类型的补充，他默认给字典的值设置了一个类型。
1 classdefaultdict(dict):2 """
3 defaultdict(default_factory[, ...]) --> dict with default factory4
5 The default factory is called without arguments to produce6 a new value when a key is not present, in __getitem__ only.7 A defaultdict compares equal to a dict with the same items.8 All remaining arguments are treated the same as if they were9 passed to the dict constructor, including keyword arguments.10 """
11 def copy(self): #real signature unknown; restored from __doc__
12 """D.copy() -> a shallow copy of D."""
13 pass
14
15 def __copy__(self, *args, **kwargs): #real signature unknown
16 """D.copy() -> a shallow copy of D."""
17 pass
18
19 def __getattribute__(self, name): #real signature unknown; restored from __doc__
20 """x.__getattribute__('name') <==> x.name"""
21 pass
22
23 def __init__(self, default_factory=None, **kwargs): #known case of _collections.defaultdict.__init__
24 """
25 defaultdict(default_factory[, ...]) --> dict with default factory26
27 The default factory is called without arguments to produce28 a new value when a key is not present, in __getitem__ only.29 A defaultdict compares equal to a dict with the same items.30 All remaining arguments are treated the same as if they were31 passed to the dict constructor, including keyword arguments.32
33 # (copied from class doc)34 """
35 pass
36
37 def __missing__(self, key): #real signature unknown; restored from __doc__
38 """
39 __missing__(key) # Called by __getitem__ for missing key; pseudo-code:40 if self.default_factory is None: raise KeyError((key,))41 self[key] = value = self.default_factory()42 return value43 """
44 pass
45
46 def __reduce__(self, *args, **kwargs): #real signature unknown
47 """Return state information for pickling."""
48 pass
49
50 def __repr__(self): #real signature unknown; restored from __doc__
51 """x.__repr__() <==> repr(x)"""
52 pass
53
54 default_factory = property(lambda self: object(), lambda self, v: None, lambda self: None) #default
55 """Factory for default value called by __missing__()."""
56
57 defaultdict
defaultdict
使用方法：
1 importcollections2 dic =collections.defaultdict(list)3 dic['k1'].append('alext')4 print(dic)
练习：
1 有如下值集合 [11,22,33,44,55,66,77,88,99,90...]，将所有大于 66 的值保存至字典的第一个key中，将小于 66的值保存至第二个key的值中。2 即： {'k1': 大于66 , 'k2': 小于66}
1 values = [11, 22, 33,44,55,66,77,88,99,90]2
3 my_dict ={}4
5 for value invalues:6 if value>66:7 if my_dict.has_key('k1'):8 my_dict['k1'].append(value)9 else:10 my_dict['k1'] =[value]11 else:12 if my_dict.has_key('k2'):13 my_dict['k2'].append(value)14 else:15 my_dict['k2'] = [value]
原生字典
1 from collections importdefaultdict2
3 values = [11, 22, 33,44,55,66,77,88,99,90]4
5 my_dict =defaultdict(list)6
7 for value invalues:8 if value>66:9 my_dict['k1'].append(value)10 else:11 my_dict['k2'].append(value)12
13 defaultdict字典解决方法14
15 默认字典
默认字典
四、可命名元组(namedtuple)
根据nametuple可以创建一个包含tuple所有功能以及其他功能的类型。
import collections
MytupleClass = collections.namedtuple('MytupleClass',['x','y','z'])
obj = MytupleClass(11,33,44)
print(obj.x)
print(obj.y)
print(obj.z)
class Mytuple(__builtin__.tuple)|Mytuple(x, y)|
|Method resolution order:|Mytuple| __builtin__.tuple| __builtin__.object|
|Methods defined here:|
| __getnewargs__(self)| Return self as a plain tuple. Used by copy andpickle.|
| __getstate__(self)| Exclude the OrderedDict frompickling|
| __repr__(self)|Return a nicely formatted representation string|
|_asdict(self)|Return a new OrderedDict which maps field names to their values|
| _replace(_self, **kwds)|Return a new Mytuple object replacing specified fields with new values|
| ----------------------------------------------------------------------
|Class methods defined here:|
| _make(cls, iterable, new=, len=) from __builtin__.type| Make a new Mytuple object from a sequence oriterable|
| ----------------------------------------------------------------------
|Static methods defined here:|
| __new__(_cls, x, y)|Create new instance of Mytuple(x, y)|
| ----------------------------------------------------------------------
|Data descriptors defined here:|
| __dict__
|Return a new OrderedDict which maps field names to their values|
|x| Alias forfield number 0|
|y| Alias for field number 1
|
| ----------------------------------------------------------------------
| Data andother attributes defined here:|
| _fields = ('x', 'y')|
| ----------------------------------------------------------------------
| Methods inherited from __builtin__.tuple:|
| __add__(...)| x.__add__(y) <==> x+y|
| __contains__(...)| x.__contains__(y) <==> y inx|
| __eq__(...)| x.__eq__(y) <==> x==y|
| __ge__(...)| x.__ge__(y) <==> x>=y|
| __getattribute__(...)| x.__getattribute__('name') <==>x.name|
| __getitem__(...)| x.__getitem__(y) <==>x[y]|
| __getslice__(...)| x.__getslice__(i, j) <==>x[i:j]|
| Use of negative indices is notsupported.|
| __gt__(...)| x.__gt__(y) <==> x>y|
| __hash__(...)| x.__hash__() <==>hash(x)|
| __iter__(...)| x.__iter__() <==>iter(x)|
| __le__(...)| x.__le__(y) <==> x<=y|
| __len__(...)| x.__len__() <==>len(x)|
| __lt__(...)| x.__lt__(y) <==> x
| __mul__(...)| x.__mul__(n) <==> x*n|
| __ne__(...)| x.__ne__(y) <==> x!=y|
| __rmul__(...)| x.__rmul__(n) <==> n*x|
| __sizeof__(...)| T.__sizeof__() -- size of T in memory, inbytes|
|count(...)| T.count(value) -> integer -- returnnumber of occurrences of value|
|index(...)| T.index(value, [start, [stop]]) -> integer -- returnfirst index of value.| Raises ValueError if the value is notpresent.
Mytuple
Mytuple
五、双向队列(deque)
一个线程安全的双向队列
classdeque(object):"""deque([iterable[, maxlen]]) --> deque object
Build an ordered collection with optimized access from its endpoints."""
def append(self, *args, **kwargs): #real signature unknown
"""Add an element to the right side of the deque."""
pass
def appendleft(self, *args, **kwargs): #real signature unknown
"""Add an element to the left side of the deque."""
pass
def clear(self, *args, **kwargs): #real signature unknown
"""Remove all elements from the deque."""
pass
def count(self, value): #real signature unknown; restored from __doc__
"""D.count(value) -> integer -- return number of occurrences of value"""
return0def extend(self, *args, **kwargs): #real signature unknown
"""Extend the right side of the deque with elements from the iterable"""
pass
def extendleft(self, *args, **kwargs): #real signature unknown
"""Extend the left side of the deque with elements from the iterable"""
pass
def pop(self, *args, **kwargs): #real signature unknown
"""Remove and return the rightmost element."""
pass
def popleft(self, *args, **kwargs): #real signature unknown
"""Remove and return the leftmost element."""
pass
def remove(self, value): #real signature unknown; restored from __doc__
"""D.remove(value) -- remove first occurrence of value."""
pass
def reverse(self): #real signature unknown; restored from __doc__
"""D.reverse() -- reverse *IN PLACE*"""
pass
def rotate(self, *args, **kwargs): #real signature unknown
"""Rotate the deque n steps to the right (default n=1). If n is negative, rotates left."""
pass
def __copy__(self, *args, **kwargs): #real signature unknown
"""Return a shallow copy of a deque."""
pass
def __delitem__(self, y): #real signature unknown; restored from __doc__
"""x.__delitem__(y) <==> del x[y]"""
pass
def __eq__(self, y): #real signature unknown; restored from __doc__
"""x.__eq__(y) <==> x==y"""
pass
def __getattribute__(self, name): #real signature unknown; restored from __doc__
"""x.__getattribute__('name') <==> x.name"""
pass
def __getitem__(self, y): #real signature unknown; restored from __doc__
"""x.__getitem__(y) <==> x[y]"""
pass
def __ge__(self, y): #real signature unknown; restored from __doc__
"""x.__ge__(y) <==> x>=y"""
pass
def __gt__(self, y): #real signature unknown; restored from __doc__
"""x.__gt__(y) <==> x>y"""
pass
def __iadd__(self, y): #real signature unknown; restored from __doc__
"""x.__iadd__(y) <==> x+=y"""
pass
def __init__(self, iterable=(), maxlen=None): #known case of _collections.deque.__init__
"""deque([iterable[, maxlen]]) --> deque object
Build an ordered collection with optimized access from its endpoints.
# (copied from class doc)"""
pass
def __iter__(self): #real signature unknown; restored from __doc__
"""x.__iter__() <==> iter(x)"""
pass
def __len__(self): #real signature unknown; restored from __doc__
"""x.__len__() <==> len(x)"""
pass
def __le__(self, y): #real signature unknown; restored from __doc__
"""x.__le__(y) <==> x<=y"""
pass
def __lt__(self, y): #real signature unknown; restored from __doc__
"""x.__lt__(y) <==> x
pass@staticmethod#known case of __new__
def __new__(S, *more): #real signature unknown; restored from __doc__
"""T.__new__(S, ...) -> a new object with type S, a subtype of T"""
pass
def __ne__(self, y): #real signature unknown; restored from __doc__
"""x.__ne__(y) <==> x!=y"""
pass
def __reduce__(self, *args, **kwargs): #real signature unknown
"""Return state information for pickling."""
pass
def __repr__(self): #real signature unknown; restored from __doc__
"""x.__repr__() <==> repr(x)"""
pass
def __reversed__(self): #real signature unknown; restored from __doc__
"""D.__reversed__() -- return a reverse iterator over the deque"""
pass
def __setitem__(self, i, y): #real signature unknown; restored from __doc__
"""x.__setitem__(i, y) <==> x[i]=y"""
pass
def __sizeof__(self): #real signature unknown; restored from __doc__
"""D.__sizeof__() -- size of D in memory, in bytes"""
passmaxlen= property(lambda self: object(), lambda self, v: None, lambda self: None) #default
"""maximum size of a deque or None if unbounded"""
__hash__ =None
deque
deque
deque
注：既然有双向队列，也有单项队列(先进先出 FIFO )
classQueue:"""Create a queue object with a given maximum size.
If maxsize is <= 0, the queue size is infinite."""
def __init__(self, maxsize=0):
self.maxsize=maxsize
self._init(maxsize)#mutex must be held whenever the queue is mutating. All methods
#that acquire mutex must release it before returning. mutex
#is shared between the three conditions, so acquiring and
#releasing the conditions also acquires and releases mutex.
self.mutex =_threading.Lock()#Notify not_empty whenever an item is added to the queue; a
#thread waiting to get is notified then.
self.not_empty =_threading.Condition(self.mutex)#Notify not_full whenever an item is removed from the queue;
#a thread waiting to put is notified then.
self.not_full =_threading.Condition(self.mutex)#Notify all_tasks_done whenever the number of unfinished tasks
#drops to zero; thread waiting to join() is notified to resume
self.all_tasks_done =_threading.Condition(self.mutex)
self.unfinished_tasks=0deftask_done(self):"""Indicate that a formerly enqueued task is complete.
Used by Queue consumer threads. For each get() used to fetch a task,
a subsequent call to task_done() tells the queue that the processing
on the task is complete.
If a join() is currently blocking, it will resume when all items
have been processed (meaning that a task_done() call was received
for every item that had been put() into the queue).
Raises a ValueError if called more times than there were items
placed in the queue."""self.all_tasks_done.acquire()try:
unfinished= self.unfinished_tasks - 1
if unfinished <=0:if unfinished <0:raise ValueError('task_done() called too many times')
self.all_tasks_done.notify_all()
self.unfinished_tasks=unfinishedfinally:
self.all_tasks_done.release()defjoin(self):"""Blocks until all items in the Queue have been gotten and processed.
The count of unfinished tasks goes up whenever an item is added to the
queue. The count goes down whenever a consumer thread calls task_done()
to indicate the item was retrieved and all work on it is complete.
When the count of unfinished tasks drops to zero, join() unblocks."""self.all_tasks_done.acquire()try:whileself.unfinished_tasks:
self.all_tasks_done.wait()finally:
self.all_tasks_done.release()defqsize(self):"""Return the approximate size of the queue (not reliable!)."""self.mutex.acquire()
n=self._qsize()
self.mutex.release()returnndefempty(self):"""Return True if the queue is empty, False otherwise (not reliable!)."""self.mutex.acquire()
n= notself._qsize()
self.mutex.release()returnndeffull(self):"""Return True if the queue is full, False otherwise (not reliable!)."""self.mutex.acquire()
n= 0 < self.maxsize ==self._qsize()
self.mutex.release()returnndef put(self, item, block=True, timeout=None):"""Put an item into the queue.
If optional args 'block' is true and 'timeout' is None (the default),
block if necessary until a free slot is available. If 'timeout' is
a non-negative number, it blocks at most 'timeout' seconds and raises
the Full exception if no free slot was available within that time.
Otherwise ('block' is false), put an item on the queue if a free slot
is immediately available, else raise the Full exception ('timeout'
is ignored in that case)."""self.not_full.acquire()try:if self.maxsize >0:if notblock:if self._qsize() ==self.maxsize:raiseFullelif timeout isNone:while self._qsize() ==self.maxsize:
self.not_full.wait()elif timeout <0:raise ValueError("'timeout' must be a non-negative number")else:
endtime= _time() +timeoutwhile self._qsize() ==self.maxsize:
remaining= endtime -_time()if remaining <= 0.0:raiseFull
self.not_full.wait(remaining)
self._put(item)
self.unfinished_tasks+= 1self.not_empty.notify()finally:
self.not_full.release()defput_nowait(self, item):"""Put an item into the queue without blocking.
Only enqueue the item if a free slot is immediately available.
Otherwise raise the Full exception."""
returnself.put(item, False)def get(self, block=True, timeout=None):"""Remove and return an item from the queue.
If optional args 'block' is true and 'timeout' is None (the default),
block if necessary until an item is available. If 'timeout' is
a non-negative number, it blocks at most 'timeout' seconds and raises
the Empty exception if no item was available within that time.
Otherwise ('block' is false), return an item if one is immediately
available, else raise the Empty exception ('timeout' is ignored
in that case)."""self.not_empty.acquire()try:if notblock:if notself._qsize():raiseEmptyelif timeout isNone:while notself._qsize():
self.not_empty.wait()elif timeout <0:raise ValueError("'timeout' must be a non-negative number")else:
endtime= _time() +timeoutwhile notself._qsize():
remaining= endtime -_time()if remaining <= 0.0:raiseEmpty
self.not_empty.wait(remaining)
item=self._get()
self.not_full.notify()returnitemfinally:
self.not_empty.release()defget_nowait(self):"""Remove and return an item from the queue without blocking.
Only get an item if one is immediately available. Otherwise
raise the Empty exception."""
returnself.get(False)#Override these methods to implement other queue organizations
#(e.g. stack or priority queue).
#These will only be called with appropriate locks held
#Initialize the queue representation
def_init(self, maxsize):
self.queue=deque()def _qsize(self, len=len):returnlen(self.queue)#Put a new item in the queue
def_put(self, item):
self.queue.append(item)#Get an item from the queue
def_get(self):returnself.queue.popleft()
Queue.Queue
Queue.Queue
三元运算
三元运算(三目运算)，是对简单的条件语句的缩写。
1 #书写格式
2 result = 值1 if 条件 else值23 #如果条件成立，那么将 “值1” 赋值给result变量，否则，将“值2”赋值给result变量
1 a = 1
2 name = 'poe' if a == 1 else 'jet'
3 print(name)
深浅拷贝
一、数字和字符串
对于 数字 和 字符串 而言，赋值、浅拷贝和深拷贝无意义，因为其永远指向同一个内存地址。
1 importcopy2 ########## 数字、字符串 #########
3 n1 = 123
4 #n1 = "i am alex age 10"
5 print(id(n1))6 ### 赋值 ##
7 n2 =n18 print(id(n2))9 ### 浅拷贝 ##
10 n2 =copy.copy(n1)11 print(id(n2))12
13 ### 深拷贝 ##
14 n3 =copy.deepcopy(n1)15 print(id(n3))
二、其他基本数据类型
对于字典、元祖、列表 而言，进行赋值、浅拷贝和深拷贝时，其内存地址的变化是不同的。
1、赋值
赋值，只是创建一个变量，该变量指向原来内存地址，如：
1 n1 = {"k1": "wu", "k2": 123, "k3": ["alex", 456]}2
3 n2 = n1
2、浅拷贝
浅拷贝，在内存中只额外创建第一层数据
1 importcopy2
3 n1 = {"k1": "wu", "k2": 123, "k3": ["alex", 456]}4
5 n3 = copy.copy(n1)
3、深拷贝
深拷贝，在内存中将所有的数据重新创建一份(排除最后一层，即：python内部对字符串和数字的优化)
1 importcopy2
3 n1 = {"k1": "wu", "k2": 123, "k3": ["alex", 456]}4
5 n4 = copy.deepcopy(n1)
函数
1：函数的定义
def函数名(参数):
...
函数体
...
返回值
函数的定义主要有如下要点：
def：表示函数的关键字
函数名：函数的名称，日后根据函数名调用函数
函数体：函数中进行一系列的逻辑计算，如：发送邮件、计算出 [11,22,38,888,2]中的最大数等...
参数：为函数体提供数据
返回值：当函数执行完毕后，可以给调用者返回数据。
2：返回值
函数是一个功能块，该功能到底执行成功与否，需要通过返回值来告知调用者。
以上要点中，比较重要有参数和返回值：
def发送短信():
发送短信的代码...if发送成功:returnTrueelse:returnFalsewhileTrue:#每次执行发送短信函数，都会将返回值自动赋值给result
#之后，可以根据result来写日志，或重发等操作
result=发送短信()if result ==False:
记录日志，短信发送失败...
3：参数
函数有三种不同的参数：
普通参数
########## 定义函数 #########
#name 叫做函数func的形式参数，简称：形参
deffunc(name):printname########## 执行函数 ##########'wupeiqi' 叫做函数func的实际参数，简称：实参
func('poe')
默认参数
def func(name, age = 18):print "%s:%s" %(name,age)#指定参数
func('poe', 19)#使用默认参数
func('gin')
注：默认参数需要放在参数列表最后
动态参数
def f1(*a):print(a,type(a))
f1(123,456,[1,2,3],'who')## ((123, 456, [1, 2, 3], 'who'), )
def func(**kwargs):printargs#执行方式一
func(name＝'poe',age=18)#执行方式二
li = {'name':'poe', age:18, 'gender':'male'}
func(**li)
def f1(*a,**b) :#一个星的参数必须在前，两个星的参数必须在后
print(a,type(a))print(b,type(b))
f1(11,22,33,k1=1234,k2=456)## ((11, 22, 33), )({'k2': 456, 'k1': 1234}, )
为动态参数传入列表，元组，字典：(注：这几种数据类型在函数传参的时候只有引用传递，没有值传递)
def f1(*args) :print(args,type(args))
li= [1,2,3,4]
f1(li)
f1(*li)## (([1, 2, 3, 4],), )## ((1, 2, 3, 4), )
def f2(**kwargs) :print(kwargs,type(kwargs))
dic= {'k1':123,'k2':456}
f2(k1=dic)
f2(**dic)## ({'k1': {'k2': 456, 'k1': 123}}, )## ({'k2': 456, 'k1': 123}, )
4：内置函数
注：查看详细猛击这里
数据类型转换函数
chr(i) 函数返回ASCII码对应的字符串
print(chr(65))print(chr(66))print(chr(65)+chr(66))##########################################
A
B
AB
complex(real[,imaginary]) 函数可把字符串或数字转换为复数
print(complex("2+1j"))print(complex("2"))print(complex(2,1))##########################################
(2+1j)
(2+0j)
(2+1j)
float(x) 函数把一个数字或字符串转换成浮点数
print(float(12))print(float(12.2))##########################################
12.0
12.2
long(x[,base]) 函数把数字和字符串转换成长整数，base为可选的基数
list(x) 函数可将序列对象转换成列表
min(x[,y,z...]) 函数返回给定参数的最小值，参数可以为序列
max(x[,y,z...]) 函数返回给定参数的最大值，参数可以为序列
ord(x) 函数返回一个字符串参数的ASCII码或Unicode值
print(ord('a'))print(ord(u"A"))##########################################
97
65
str(obj) 函数把对象转换成可打印字符串
tuple(x) 函数把序列对象转换成tuple
type(x) 可以接收任何东西作为参数――并返回它的数据类型。整型、字符串、列表、字典、元组、函数、类、模块，甚至类型对象都可以作为参数被 type 函数接受
abs()函数：取绝对值
print(abs(-1.2))
all()函数与any函数：
all(iterable)：如果iterable的任意一个元素为0、''、False，则返回False，否则返回True
print(all(['a','b','c','d']))#True
print(all(['a','b','','d']))#False#注意：空元组、空列表返回值为True，这里要特别注意
any(iterable)：如果iterable的所有元素都为0、''、False，则返回False，否则返回True
print(any(['a','b','c','d']))#True
print(any(['a',0,' ',False]))#True
print(any([0,'',False]))#False
ascii(object) 函数：
返回一个可打印的对象字符串方式表示，如果是非ascii字符就会输出\x，\u或\U等字符来表示。与python2版本里的repr()是等效的函数。
print(ascii(1))print(ascii('a'))print(ascii(123))print(ascii('中文'))#非ascii字符##########################################
1
'a'
123
'\u4e2d\u6587'
lambda表达式：
学习条件运算时，对于简单的 if else 语句，可以使用三元运算来表示，即：
#普通条件语句
if 1 == 1:
name= 'poe'
else:
name= 'bruce'
#三元运算
name = 'poe' if 1 == 1 else 'bruce'
对于简单的函数，也存在一种简便的表示方式，即：lambda表达式
####################### 普通函数 #######################定义函数(普通方式)
deffunc(arg):return arg + 1
#执行函数
result = func(123)####################### lambda ######################
#定义函数(lambda表达式)
my_lambda = lambda arg : arg + 1
#执行函数
result = my_lambda(123)
生成随机数：
importrandom
chars= ''
for i in range(4) :
rand_num= random.randrange(0,4)if rand_num == 3 or rand_num == 1:
rand_digit= random.randrange(0,10)
chars+=str(rand_digit)else:
rand_case= random.randrange(65,90)
case=chr(rand_case)
chars+=caseprint(chars)
filter函数
filter()函数是 Python 内置的另一个有用的高阶函数，filter()函数接收一个函数 f 和一个list，这个函数 f 的作用是对每个元素进行判断，返回 True或 False，filter()根据判断结果自动过滤掉不符合条件的元素，返回由符合条件元素组成的新list。
例1，要从一个list [1, 4, 6, 7, 9, 12, 17]中删除偶数，保留奇数，首先，要编写一个判断奇数的函数：
#filter(fn,iterable)
defis_odd(x) :return x % 2 == 1li= [1, 4, 6, 7, 9, 12, 17]
result=filter(is_odd,li)print(result)##########################################
[1, 7, 9, 17]
例2：删除 列表中的None 或者空字符串
li = ['test', None, '', 'str', ' ', 'END']defis_not_empty(s) :return s and len(s.strip()) >0print(filter(is_not_empty,li))##########################################
['test', 'str', 'END']
例3：请利用filter()过滤出1~100中平方根是整数的数，即结果应该是：[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]
importmathdefis_sqr(x) :return math.sqrt(x) % 1 ==0print filter(is_sqr,range(1,101))
以上三个函数都可以使用lambda表达式的写法来书写，如：
result = filter(lambda x : x % 2 == 1,[1,4,6,9,12,7,17])print(result)
map()函数
map()是 Python 内置的高阶函数，它接收一个函数 f 和一个 list，并通过把函数 f 依次作用在 list 的每个元素上，得到一个新的 list 并返回
例如，对于list [1, 2, 3, 4, 5, 6, 7, 8, 9]如果希望把list的每个元素都作平方，就可以用map()函数
li = [1, 2, 3, 4, 5, 6, 7, 8, 9]print(li)deff(x) :return x*x
r= list(map(f,[1, 2, 3, 4, 5, 6, 7, 8, 9]))print(r)
注：在python3里面，map()的返回值已经不再是list,而是iterators, 所以想要使用，只用将iterator 转换成list 即可， 比如 list(map()) 。
进制转换函数(以下四个函数可以实现各进制间的互相转换)
bin(x) ：将整数x转换为二进制字符串，如果x不为Python中int类型，x必须包含方法__index__()并且返回值为integer
oct(x)：将一个整数转换成8进制字符串。如果传入浮点数或者字符串均会报错
hex(x)：将一个整数转换成16进制字符串。
int()：
传入数值时，调用其__int__()方法，浮点数将向下取整
print(int(3))#3
print(int(3.6))#3
传入字符串时，默认以10进制进行转换
print(int('36'))#36
字符串中允许包含"+"、"-"号，但是加减号与数值间不能有空格，数值后、符号前可出现空格
print(int('+36'))#36
传入字符串，并指定了进制，则按对应进制将字符串转换成10进制整数
print(int('10',2))#2
print(int('0o7',8))#7
print(int('0x15',16))#21
open函数，该函数用于文件处理
操作文件时，一般需要经历如下步骤：
打开文件
操作文件
一：打开文件
文件句柄 = open('文件路径', '模式')
打开文件时，需要指定文件路径和以何等方式打开文件，打开后，即可获取该文件句柄，日后通过此文件句柄对该文件操作。
打开文件的模式有：
r ，只读模式【默认】
w，只写模式【不可读；不存在则创建；存在则清空内容；】
x， 只写模式【不可读；不存在则创建，存在则报错】
a， 追加模式【可读； 不存在则创建；存在则只追加内容；】
f = open('test.log','r')
data=f.read()
f.close()print(data)
"+" 表示可以同时读写某个文件
r+， 读写【可读，可写】
w+，写读【可读，可写】
x+ ，写读【可读，可写】
a+， 写读【可读，可写】
#r+ 模式
f = open('test.log','r+',encoding='utf-8')print(f.tell())#打印当前指针所在的位置，此时为0
data =f.read()print(data)print(f.tell())#此时当前指针在文件最末尾
f.close()
#w+模式：先清空文件，再写入文件，写入文件后才可以读文件
f = open('test.log','w+',encoding="utf-8")
f.write('python')#写完后，指针到了最后
f.seek(0)#移动指针到开头
data =f.read()
f.close()print(data)
#a+模式：打开的同时，指针已经到最后，#写时，追加，指针到最后
f = open('test.log','a+',encoding="utf-8")print(f.tell())#读取当前指针位置，此时指针已经到最后
f.write('c++')print(f.tell())#此时要读文件必须把指针移动到文件开头
f.seek(0)
data=f.read();print(data)
f.close()
"b"表示以字节的方式操作
rb 或 r+b
wb 或 w+b
xb 或 w+b
ab 或 a+b
注：以b方式打开时，读取到的内容是字节类型，写入时也需要提供字节类型
二：文件操作
classfile(object)def close(self): #real signature unknown; restored from __doc__
关闭文件"""close() -> None or (perhaps) an integer. Close the file.
Sets data attribute .closed to True. A closed file cannot be used for
further I/O operations. close() may be called more than once without
error. Some kinds of file objects (for example, opened by popen())
may return an exit status upon closing."""
def fileno(self): #real signature unknown; restored from __doc__
文件描述符"""fileno() -> integer "file descriptor".
This is needed for lower-level file interfaces, such os.read()."""
return0def flush(self): #real signature unknown; restored from __doc__
刷新文件内部缓冲区"""flush() -> None. Flush the internal I/O buffer."""
pass
def isatty(self): #real signature unknown; restored from __doc__
判断文件是否是同意tty设备"""isatty() -> true or false. True if the file is connected to a tty device."""
returnFalsedef next(self): #real signature unknown; restored from __doc__
获取下一行数据，不存在，则报错"""x.next() -> the next value, or raise StopIteration"""
pass
def read(self, size=None): #real signature unknown; restored from __doc__
读取指定字节数据"""read([size]) -> read at most size bytes, returned as a string.
If the size argument is negative or omitted, read until EOF is reached.
Notice that when in non-blocking mode, less data than what was requested
may be returned, even if no size parameter was given."""
pass
def readinto(self): #real signature unknown; restored from __doc__
读取到缓冲区，不要用，将被遗弃"""readinto() -> Undocumented. Don't use this; it may go away."""
pass
def readline(self, size=None): #real signature unknown; restored from __doc__
仅读取一行数据"""readline([size]) -> next line from the file, as a string.
Retain newline. A non-negative size argument limits the maximum
number of bytes to return (an incomplete line may be returned then).
Return an empty string at EOF."""
pass
def readlines(self, size=None): #real signature unknown; restored from __doc__
读取所有数据，并根据换行保存值列表"""readlines([size]) -> list of strings, each a line from the file.
Call readline() repeatedly and return a list of the lines so read.
The optional size argument, if given, is an approximate bound on the
total number of bytes in the lines returned."""
return[]def seek(self, offset, whence=None): #real signature unknown; restored from __doc__
指定文件中指针位置"""seek(offset[, whence]) -> None. Move to new file position.
Argument offset is a byte count. Optional argument whence defaults to
(offset from start of file, offset should be >= 0); other values are 1
(move relative to current position, positive or negative), and 2 (move
relative to end of file, usually negative, although many platforms allow
seeking beyond the end of a file). If the file is opened in text mode,
only offsets returned by tell() are legal. Use of other offsets causes
undefined behavior.
Note that not all file objects are seekable."""
pass
def tell(self): #real signature unknown; restored from __doc__
获取当前指针位置"""tell() -> current file position, an integer (may be a long integer)."""
pass
def truncate(self, size=None): #real signature unknown; restored from __doc__
截断数据，仅保留指定之前数据"""truncate([size]) -> None. Truncate the file to at most size bytes.
Size defaults to the current file position, as returned by tell()."""
pass
def write(self, p_str): #real signature unknown; restored from __doc__
写内容"""write(str) -> None. Write string str to file.
Note that due to buffering, flush() or close() may be needed before
the file on disk reflects the data written."""
pass
def writelines(self, sequence_of_strings): #real signature unknown; restored from __doc__
将一个字符串列表写入文件"""writelines(sequence_of_strings) -> None. Write the strings to the file.
Note that newlines are not added. The sequence can be any iterable object
producing strings. This is equivalent to calling write() for each string."""
pass
def xreadlines(self): #real signature unknown; restored from __doc__
可用于逐行读取文件，非全部"""xreadlines() -> returns self.
For backward compatibility. File objects now include the performance
optimizations previously implemented in the xreadlines module."""
pass
2.x
2.x版本
classTextIOWrapper(_TextIOBase):"""Character and line based layer over a BufferedIOBase object, buffer.
encoding gives the name of the encoding that the stream will be
decoded or encoded with. It defaults to locale.getpreferredencoding(False).
errors determines the strictness of encoding and decoding (see
help(codecs.Codec) or the documentation for codecs.register) and
defaults to "strict".
newline controls how line endings are handled. It can be None, '',
'\n', '\r', and '\r\n'. It works as follows:
* On input, if newline is None, universal newlines mode is
enabled. Lines in the input can end in '\n', '\r', or '\r\n', and
these are translated into '\n' before being returned to the
caller. If it is '', universal newline mode is enabled, but line
endings are returned to the caller untranslated. If it has any of
the other legal values, input lines are only terminated by the given
string, and the line ending is returned to the caller untranslated.
* On output, if newline is None, any '\n' characters written are
translated to the system default line separator, os.linesep. If
newline is '' or '\n', no translation takes place. If newline is any
of the other legal values, any '\n' characters written are translated
to the given string.
If line_buffering is True, a call to flush is implied when a call to
write contains a newline character."""
def close(self, *args, **kwargs): #real signature unknown
关闭文件pass
def fileno(self, *args, **kwargs): #real signature unknown
文件描述符pass
def flush(self, *args, **kwargs): #real signature unknown
刷新文件内部缓冲区pass
def isatty(self, *args, **kwargs): #real signature unknown
判断文件是否是同意tty设备pass
def read(self, *args, **kwargs): #real signature unknown
读取指定字节数据pass
def readable(self, *args, **kwargs): #real signature unknown
是否可读pass
def readline(self, *args, **kwargs): #real signature unknown
仅读取一行数据pass
def seek(self, *args, **kwargs): #real signature unknown
指定文件中指针位置pass
def seekable(self, *args, **kwargs): #real signature unknown
指针是否可操作pass
def tell(self, *args, **kwargs): #real signature unknown
获取指针位置pass
def truncate(self, *args, **kwargs): #real signature unknown
截断数据，仅保留指定之前数据pass
def writable(self, *args, **kwargs): #real signature unknown
是否可写pass
def write(self, *args, **kwargs): #real signature unknown
写内容pass
def __getstate__(self, *args, **kwargs): #real signature unknown
pass
def __init__(self, *args, **kwargs): #real signature unknown
pass@staticmethod#known case of __new__
def __new__(*args, **kwargs): #real signature unknown
"""Create and return a new object. See help(type) for accurate signature."""
pass
def __next__(self, *args, **kwargs): #real signature unknown
"""Implement next(self)."""
pass
def __repr__(self, *args, **kwargs): #real signature unknown
"""Return repr(self)."""
passbuffer= property(lambda self: object(), lambda self, v: None, lambda self: None) #default
closed= property(lambda self: object(), lambda self, v: None, lambda self: None) #default
encoding= property(lambda self: object(), lambda self, v: None, lambda self: None) #default
errors= property(lambda self: object(), lambda self, v: None, lambda self: None) #default
line_buffering= property(lambda self: object(), lambda self, v: None, lambda self: None) #default
name= property(lambda self: object(), lambda self, v: None, lambda self: None) #default
newlines= property(lambda self: object(), lambda self, v: None, lambda self: None) #default
_CHUNK_SIZE= property(lambda self: object(), lambda self, v: None, lambda self: None) #default
_finalizing= property(lambda self: object(), lambda self, v: None, lambda self: None) #default
3.x
3.x版本
三：管理上下文
为了避免打开文件后忘记关闭，可以通过管理上下文，即：
with open('log','r') as f:
...
如此方式，当with代码块执行完毕时，内部会自动关闭并释放文件资源。
在Python 2.7 及以后，with又支持同时对多个文件的上下文进行管理，即：
with open('log1') as obj1, open('log2') as obj2:pass
可使用此方法对一个文件进行读操作，同时把数据又写入到另一个打开的文件中！
read()、readline() 和 readlines()
每种方法可以接受一个变量以限制每次读取的数据量，但它们通常不使用变量。 .read() 每次读取整个文件，它通常用于将文件内容放到一个字符串变量中。然而 .read() 生成文件内容最直接的字符串表示，但对于连续的面向行的处理，它却是不必要的，并且如果文件大于可用内存，则不可能实现这种处理。
.readline() 和 .readlines() 非常相似。它们都在类似于以下的结构中使用：
fh = open('c:\\autoexec.bat')for line infh.readlines():print line
.readline() 和 .readlines() 之间的差异是后者一次读取整个文件，象 .read() 一样。.readlines() 自动将文件内容分析成一个行的列表，该列表可以由 Python 的 for ... in ... 结构进行处理。另一方面，.readline() 每次只读取一行，通常比 .readlines() 慢得多。仅当没有足够内存可以一次读取整个文件时，才应该使用 .readline()。
练习题：用户名与密码的验证
首先新建一个文件，这里为test.log文件，内容为两行如下：
admin$123ginvip$123456
1：让用户选择1或2，1为登录，2为注册
2：如果用户选择1，用户输入用户名与密码，然后与test.log文件中的用户名与密码进行验证，验证成功输出“登录成功”，否则“登录失败”
3：如果用户选择2，让用户输入用户名与密码，并与test.log文件中的用户名验证，如果test.log中用户名已经存在，则输出“该用户名已经存在”，否则将用户输入的用户与密码以上面test.log文件中的形式写入test.log文件中
1 defcheck_user(user) :2 with open('test.log','r',encoding='utf-8') as f :3 for line inf :4 user_list =line.strip()5 user_list = user_list.split('$')6 if user ==user_list[0] :7 returnTrue8 returnFalse9 defregister(user,pwd) :10 with open('test.log','a',encoding='utf-8') as f :11 user_info = '\n' + user + '$' +pwd12 iff.write(user_info) :13 returnTrue14 returnFalse15 deflogin(user,pwd) :16 with open('test.log','r',encoding='utf-8') as f :17 for line inf:18 user_list =line.strip()19 user_list = user_list.split('$')20 if user == user_list[0] and pwd == user_list[1]:21 returnTrue22 returnFalse23 defmain() :24 print('welcome to my website')25 choice = input('1:login 2:register')26 if choice == '2':27 user = input('input username :')28 pwd = input('input password :')29 ifcheck_user(user) :30 print('the username is exist')31 else:32 ifregister(user,pwd) :33 print('register success')34 else:35 print('register failed')36 elif choice == '1':37 user = input('input username :')38 pwd = input('input password :')39 iflogin(user,pwd) :40 print('login success')41 else:42 print('login failed')43 main()
View Code
冒泡排序
冒泡排序的原理：
defBubble_sort(args) :for i in range(len(args)-1) :for j in range(len(args) -1):if args[j] > args[j+1]:
temp=args[j]
args[j]= args[j+1]
args[j+1] =tempreturnargs
li= [33,2,10,1,9,3,8]print(Bubble_sort(li))
练习题
1、简述普通参数、指定参数、默认参数、动态参数的区别
2、写函数，计算传入字符串中【数字】、【字母】、【空格] 以及 【其他】的个数
digit =0
case=0
space=0
other=0deffunc2(s) :globaldigit,case,space,otherif notisinstance(s,basestring) :print('the data type wrong!')returnFalsefor i ins :ifi.isdigit() :
digit+= 1
elifi.isalpha() :
case+= 1
elifi.isspace() :
space+= 1
else:
other+= 1s= 'I love python , is num 1 , o_k'a= [1,2,3]
func2(s)print(digit)print(case)print(space)print(other)########################################
1
18
8
3问题：判断是不是字符串后直接退出函数，而不执行下面的代码？
第2题答案
3、写函数，判断用户传入的对象(字符串、列表、元组)长度是否大于5。
deffunc3(v) :if len(v) > 5:returnTrueelse:returnFalse
a= 'I love python , is num 1 , o_k'l= [1,2,3]
t= (5,7,9,10,45,10)print(func3(t))
第三题答案
4、写函数，检查用户传入的对象(字符串、列表、元组)的每一个元素是否含有空内容。
5、写函数，检查传入列表的长度，如果大于2，那么仅保留前两个长度的内容，并将新内容返回给调用者。
deffunc5(lis) :if len(lis) > 2:return lis[0:2]else:returnFalse
li= [1,2,3]print(func5(li))##########################################
[1, 2]
第五题答案
6、写函数，检查获取传入列表或元组对象的所有奇数位索引对应的元素，并将其作为新列表返回给调用者。
deffunc6(lis) :
new_lis=[]for k inrange(len(lis)) :if k % 2 == 1:
new_lis.append(lis[k])returnnew_lis
li= [1,2,3,8,10,44,77]
tu= ('poe','andy','jet','bruce','jacky')print(func6(tu))##########################################
['andy', 'bruce']
第六题答案
7、写函数，检查传入字典的每一个value的长度,如果大于2，那么仅保留前两个长度的内容，并将新内容返回给调用者。
dic = {"k1": "v1v1", "k2": [11,22,33,44]}
PS:字典中的value只能是字符串或列表
deffunc7(d) :
v=d.values()
li=[]for i inv :if len(i) > 2:
li.append(i[0:2])returnliprint(func7(dic))##########################################
[[11, 22], 'v1']
第七题答案
8、写函数，利用递归获取斐波那契数列中的第 10 个数，并将该值返回给调用者
deffabonacci(n) :if n ==0 :return0elif n == 1:return 1
else:return fabonacci(n-1) + fabonacci(n-2)print(fabonacci(10))
145
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
