traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Issue 2648: Add leading zero to money format recipe in the docs.

This commit is contained in:
Raymond Hettinger 2008-04-17 10:48:31 +00:00
parent 967a83c4ef
commit 5eaffc4ce1
2 changed files with 8 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Doc/library/decimal.rst
View File

@ -1426,7 +1426,7 @@ to work with the :class:`Decimal` class::
>>> moneyfmt(Decimal(123456789), sep=' ') >>> moneyfmt(Decimal(123456789), sep=' ')
'123 456 789.00' '123 456 789.00'
>>> moneyfmt(Decimal('-0.02'), neg='<', trailneg='>') >>> moneyfmt(Decimal('-0.02'), neg='<', trailneg='>')
'<.02>' '<0.02>'
""" """
q = Decimal(10) ** -places # 2 places --> '0.01' q = Decimal(10) ** -places # 2 places --> '0.01'
@ -1439,6 +1439,8 @@ to work with the :class:`Decimal` class::
for i in range(places): for i in range(places):
build(next() if digits else '0') build(next() if digits else '0')
build(dp) build(dp)
if not digits:
build('0')
i = 0 i = 0
while digits: while digits:
build(next()) build(next())

14
Doc/library/itertools.rst
View File

@ -98,7 +98,7 @@ loops that truncate the stream.
.. function:: combinations(iterable, r) .. function:: combinations(iterable, r)
Return successive *r* length combinations of elements in the *iterable*. Return *r* length subsequences of elements from the input *iterable*.
Combinations are emitted in lexicographic sort order. So, if the Combinations are emitted in lexicographic sort order. So, if the
input *iterable* is sorted, the combination tuples will be produced input *iterable* is sorted, the combination tuples will be produced
@ -108,9 +108,6 @@ loops that truncate the stream.
value. So if the input elements are unique, there will be no repeat value. So if the input elements are unique, there will be no repeat
values in each combination. values in each combination.
Each result tuple is ordered to match the input order. So, every
combination is a subsequence of the input *iterable*.
Equivalent to:: Equivalent to::
def combinations(iterable, r): def combinations(iterable, r):
@ -446,11 +443,10 @@ loops that truncate the stream.
Equivalent to nested for-loops in a generator expression. For example, Equivalent to nested for-loops in a generator expression. For example,
``product(A, B)`` returns the same as ``((x,y) for x in A for y in B)``. ``product(A, B)`` returns the same as ``((x,y) for x in A for y in B)``.
The leftmost iterators correspond to the outermost for-loop, so the output The nested loops cycle like an odometer with the rightmost element advancing
tuples cycle like an odometer (with the rightmost element changing on every on every iteration. This pattern creats a lexicographic ordering so that if
iteration). This results in a lexicographic ordering so that if the the inputs iterables are sorted, the product tuples are emitted in sorted
inputs iterables are sorted, the product tuples are emitted order.
in sorted order.
To compute the product of an iterable with itself, specify the number of To compute the product of an iterable with itself, specify the number of
repetitions with the optional *repeat* keyword argument. For example, repetitions with the optional *repeat* keyword argument. For example,