@@ -70,15 +70,14 @@ arguments::
70
70
71
71
System version Python version Times as fast
72
72
-----------------------------------------------------
73
- Windows 7 64-bit 2.7.7 64-bit TODO
74
- Windows 7 64-bit SSD 2.7.7 64-bit 23.2
73
+ Windows 7 64-bit 2.7.7 64-bit 10.4
74
+ Windows 7 64-bit SSD 2.7.7 64-bit 10.3
75
75
Windows 7 64-bit NFS 2.7.6 64-bit TODO
76
- Windows 7 64-bit 3.4.1 64-bit TODO
76
+ Windows 7 64-bit SSD 3.4.1 64-bit 9.9
77
+ Windows 7 64-bit SSD 3.5.0 64-bit 9.5
77
78
78
- CentOS 6.5 64-bit 2.7.6 64-bit TODO
79
- Ubuntu 12.04 32-bit 2.7.3 32-bit TODO
80
-
81
- Mac OS X 10.9.3 2.7.5 64-bit TODO
79
+ CentOS 6.2 64-bit 2.6.6 64-bit 3.9
80
+ Ubuntu 14.04 64-bit 2.7.6 64-bit 5.8
82
81
83
82
All of the above tests were done using the fast C version of scandir
84
83
(source code in `_scandir.c `).
@@ -87,14 +86,6 @@ Note that the gains are less than the above on smaller directories and greater
87
86
on larger directories. This is why ``benchmark.py `` creates a test directory
88
87
tree with a standardized size.
89
88
90
- TODO: update --
91
- Another quick benchmark I've done (on Windows 7 64-bit) is running Eli
92
- Bendersky's `pss <https://github.com/eliben/pss >`_ source code searching tool
93
- across a fairly large code tree (4938 files, 598 dirs, 200 MB). Using pss out
94
- of the box with ``os.walk() `` on a not-found string takes 0.91 seconds. But
95
- after monkey-patching in ``scandir.walk() `` it takes only 0.34 seconds -- 2.7
96
- times as fast.
97
-
98
89
99
90
The API
100
91
-------
0 commit comments