bpo-40419: timeit CLI docs now mention 1,2,5,10,... trials instead of… · python-emscripten/cpython@399b9a4 · GitHub

1. python-emscripten
2. cpython

Repository navigation

• Code
• Pull requests
• Actions
• Projects
• Security and quality
• Insights

Commit 399b9a4

Browse filesBrowse the repository at this point in the historyBrowse files

miss-islington

and

sjvrijn

authored

bpo-40419: timeit CLI docs now mention 1,2,5,10,... trials instead of powers of 10 (pythonGH-19752)

(cherry picked from commit 7663523) Co-authored-by: Sander <svr003@gmail.com>

1 parent a629d4c commit 399b9a4
Copy full SHA for 399b9a4

2 files changed

+4-2Lines changed: 4 additions & 2 deletions

File tree

Expand file treeCollapse file tree

Open diff view settings

Filter options

• Doc/library
  • timeit.rst
• Lib
  • timeit.py

Expand file treeCollapse file tree

Open diff view settings

Collapse file

‎Doc/library/timeit.rst‎

Copy file name to clipboardExpand all lines: Doc/library/timeit.rst

+2-1Lines changed: 2 additions & 1 deletion

• Display the source diff
• Display the rich diff

Original file line number	Diff line number	Diff line change
@@ -251,7 +251,8 @@ quotes and using leading spaces. Multiple :option:`-s` options are treated
251	251	similarly.
252	252
253	253	If :option:`-n` is not given, a suitable number of loops is calculated by trying
254		- successive powers of 10 until the total time is at least 0.2 seconds.
	254	+ increasing numbers from the sequence 1, 2, 5, 10, 20, 50, ... until the total
	255	+ time is at least 0.2 seconds.
255	256
256	257	:func:`default_timer` measurements can be affected by other programs running on
257	258	the same machine, so the best thing to do when accurate timing is necessary is

Collapse file

‎Lib/timeit.py‎

Copy file name to clipboardExpand all lines: Lib/timeit.py

+2-1Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
@@ -29,7 +29,8 @@
29	29	treated similarly.
30	30
31	31	If -n is not given, a suitable number of loops is calculated by trying
32		- successive powers of 10 until the total time is at least 0.2 seconds.
	32	+ increasing numbers from the sequence 1, 2, 5, 10, 20, 50, ... until the
	33	+ total time is at least 0.2 seconds.
33	34
34	35	Note: there is a certain baseline overhead associated with executing a
35	36	pass statement. It differs between versions. The code here doesn't try

0 commit comments

Comments

0 (0)