forked from zhanghe06/python
-
Notifications
You must be signed in to change notification settings - Fork 1
/
merge_dict.py
56 lines (43 loc) · 1.14 KB
/
merge_dict.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
# coding=utf-8
__author__ = 'zhanghe'
from tools import time_log
a = {1: 1, 2: 2}
b = {1: 2, 3: 3}
# way 1
@time_log.time_log
def test_1():
print dict(a.items() + b.items())
# way 2
@time_log.time_log
def test_2():
print dict(a, **b)
# way 3
@time_log.time_log
def test_3():
c = a.copy()
c.update(b)
print c
if __name__ == '__main__':
"""
字典合并的几种方式效率测试
因时间太短,将测试时间调整到小数后6位
"""
test_1()
test_2()
test_3()
# 测试结果
# 方法test_1开始时间:Tue May 5 17:56:38 2015
# {1: 2, 2: 2, 3: 3}
# 方法test_1结束时间:Tue May 5 17:56:38 2015
# 方法test_1运行时间:0.000039S
# 方法test_2开始时间:Tue May 5 17:56:38 2015
# {1: 2, 2: 2, 3: 3}
# 方法test_2结束时间:Tue May 5 17:56:38 2015
# 方法test_2运行时间:0.000009S
# 方法test_3开始时间:Tue May 5 17:56:38 2015
# {1: 2, 2: 2, 3: 3}
# 方法test_3结束时间:Tue May 5 17:56:38 2015
# 方法test_3运行时间:0.000009S
# 结论:
# 一、当KEY重复,后面的VALUE会覆盖前面
# 二、后两种方案效率较高,推荐第二种方案