From: Miss Islington (bot) <31488909+miss-islington@users.noreply.github.com>
Date: Wed, 5 Nov 2025 18:15:05 +0000 (+0100)
Subject: [3.13] Docs: Fix cached calls count in factorial example (gh-140882) (gh-141032)
X-Git-Url: http://git.ipfire.org/gitweb.cgi?a=commitdiff_plain;h=2dd0a6ad9c6b94a9ddac716aa894415b74617845;p=thirdparty%2FPython%2Fcpython.git

[3.13] Docs: Fix cached calls count in factorial example (gh-140882) (gh-141032)

Co-authored-by: Clifford Gama <cliffygamy@gmail.com>
---

diff --git a/Doc/library/functools.rst b/Doc/library/functools.rst
index 2885f9a4b7a6..18c83b1fda17 100644
--- a/Doc/library/functools.rst
+++ b/Doc/library/functools.rst
@@ -42,11 +42,11 @@ The :mod:`functools` module defines the following functions:
         def factorial(n):
             return n * factorial(n-1) if n else 1
 
-        >>> factorial(10)      # no previously cached result, makes 11 recursive calls
+        >>> factorial(10)   # no previously cached result, makes 11 recursive calls
         3628800
-        >>> factorial(5)       # just looks up cached value result
+        >>> factorial(5)    # no new calls, just returns the cached result
         120
-        >>> factorial(12)      # makes two new recursive calls, the other 10 are cached
+        >>> factorial(12)   # two new recursive calls, factorial(10) is cached
         479001600
 
    The cache is threadsafe so that the wrapped function can be used in