码迷,mamicode.com
首页 > 编程语言 > 详细

Python数据结构

时间:2015-06-09 16:42:12      阅读:111      评论:0      收藏:0      [点我收藏+]

标签:

1、序列

 

2、字典

 

3、集合

 

import time
from collections import deque
  
num = 100000
  
def append(c):
    for i in range(num):
        c.append(i)
  
def appendleft(c):
    if isinstance(c, deque):
        for i in range(num):
            c.appendleft(i)
    else:
        for i in range(num):
            c.insert(0, i)
def pop(c):
    for i in range(num):
        c.pop()
  
def popleft(c):
    if isinstance(c, deque):
        for i in range(num):
            c.popleft()
    else:
        for i in range(num):
            c.pop(0)
  
for container in [deque, list]:
    for operation in [append, appendleft, pop, popleft]:
        c = container(range(num))
        start = time.time()
        operation(c)
        elapsed = time.time() - start
        print "Completed {0}/{1} in {2} seconds: {3} ops/sec".format(
              container.__name__, operation.__name__, elapsed, num / elapsed)
 

 

Python数据结构

标签:

原文地址:http://www.cnblogs.com/tommy-wt/p/4563634.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!