@@ -222,16 +222,16 @@ def __init__(self, x, unit=None, cr=False, sort=True, simplify=True):
222
222
- ``x`` -- a list of pairs (p, e) with e an integer;
223
223
otherwise a :class:`TypeError` is raised
224
224
225
- - ``unit`` -- (default: 1) the unit part of the factorization.
225
+ - ``unit`` -- (default: 1); the unit part of the factorization.
226
226
227
- - ``cr`` -- (default: ``False``) if ``True``, print the factorization
227
+ - ``cr`` -- (default: ``False``); if ``True``, print the factorization
228
228
with carriage returns between factors.
229
229
230
- - ``sort`` - (default: ``True``) if ``True``, sort the factors by
230
+ - ``sort`` - (default: ``True``); if ``True``, sort the factors by
231
231
calling the sort function ``self.sort()`` after creating
232
232
the factorization
233
233
234
- - ``simplify`` - (default: ``True``) if ``True``, remove duplicate
234
+ - ``simplify`` -- (default: ``True``); if ``True``, remove duplicate
235
235
factors from the factorization. See the documentation for
236
236
self.simplify.
237
237
@@ -572,7 +572,7 @@ def base_change(self, U):
572
572
573
573
def is_commutative (self ) -> bool :
574
574
"""
575
- Return ``True`` if my factors commute.
575
+ Return whether the factors commute.
576
576
577
577
EXAMPLES::
578
578
@@ -651,7 +651,7 @@ def sort(self, key=None):
651
651
652
652
INPUT:
653
653
654
- - ``key`` -- (default: ``None``) comparison key
654
+ - ``key`` -- (default: ``None``); comparison key
655
655
656
656
OUTPUT:
657
657
0 commit comments