https://github.com/python/cpython/commit/151828d52026a1d39e31e60cca53a76e876538f2
commit: 151828d52026a1d39e31e60cca53a76e876538f2
branch: 3.13
author: Miss Islington (bot) <[email protected]>
committer: rhettinger <[email protected]>
date: 2025-04-18T17:47:25Z
summary:
[3.13] Minor doc edit: Make multinomial() the first math example (gh-132697)
(gh-132698)
files:
M Doc/library/itertools.rst
diff --git a/Doc/library/itertools.rst b/Doc/library/itertools.rst
index f996a365d56b8b..51bbca2cf0f2d4 100644
--- a/Doc/library/itertools.rst
+++ b/Doc/library/itertools.rst
@@ -1009,6 +1009,12 @@ The following recipes have a more mathematical flavor:
.. testcode::
+ def multinomial(*counts):
+ "Number of distinct arrangements of a multiset."
+ # Counter('abracadabra').values() → 5 2 2 1 1
+ # multinomial(5, 2, 2, 1, 1) → 83160
+ return prod(map(comb, accumulate(counts), counts))
+
def powerset(iterable):
"Subsequences of the iterable from shortest to longest."
# powerset([1,2,3]) → () (1,) (2,) (3,) (1,2) (1,3) (2,3) (1,2,3)
@@ -1127,12 +1133,6 @@ The following recipes have a more mathematical flavor:
n -= n // prime
return n
- def multinomial(*counts):
- "Number of distinct arrangements of a multiset."
- # Counter('abracadabra').values() → 5 2 2 1 1
- # multinomial(5, 2, 2, 1, 1) → 83160
- return prod(map(comb, accumulate(counts), counts))
-
.. doctest::
:hide:
_______________________________________________
Python-checkins mailing list -- [email protected]
To unsubscribe send an email to [email protected]
https://mail.python.org/mailman3/lists/python-checkins.python.org/
Member address: [email protected]
