diff --git a/src/sage/calculus/calculus.py b/src/sage/calculus/calculus.py index c1102b8b86e..7c85817ee97 100644 --- a/src/sage/calculus/calculus.py +++ b/src/sage/calculus/calculus.py @@ -700,7 +700,7 @@ def nintegral(ex, x, a, b, - ``maximum_num_subintervals`` -- (default: 200) maximal number of subintervals - OUTPUT: float -- approximation to the integral + OUTPUT: float; approximation to the integral - float: estimated absolute error of the approximation diff --git a/src/sage/combinat/designs/orthogonal_arrays.py b/src/sage/combinat/designs/orthogonal_arrays.py index 9a66d86ba2c..0a53dbb47b7 100644 --- a/src/sage/combinat/designs/orthogonal_arrays.py +++ b/src/sage/combinat/designs/orthogonal_arrays.py @@ -752,7 +752,7 @@ def orthogonal_array(k,n,t=2,resolvable=False, check=True,existence=False,explai - ``n`` -- integer; number of symbols - - ``t`` -- (integer; default: 2); strength of the array + - ``t`` -- integer (default: 2); strength of the array - ``resolvable`` -- boolean (default: ``False``); set to ``True`` if you want the design to be resolvable. The `n` classes of the resolvable diff --git a/src/sage/combinat/k_tableau.py b/src/sage/combinat/k_tableau.py index 077b77fae01..78bdcb8334b 100644 --- a/src/sage/combinat/k_tableau.py +++ b/src/sage/combinat/k_tableau.py @@ -3325,10 +3325,11 @@ def shape( self ): INPUT: - - ``form`` -- optional argument to indicate 'inner', 'outer' or 'skew' - (default: 'outer') + - ``form`` -- optional argument to indicate ``'inner'``, ``'outer'`` or + ``'skew'`` (default: ``'outer'``) - OUTPUT: a `k+1`-core or a pair of `k+1`-cores if form is not 'inner' or 'outer' + OUTPUT: a `k+1`-core or a pair of `k+1`-cores if form is not + ``'inner'`` or ``'outer'`` EXAMPLES:: diff --git a/src/sage/combinat/sloane_functions.py b/src/sage/combinat/sloane_functions.py index 5f13ad27d39..dc5364d232f 100644 --- a/src/sage/combinat/sloane_functions.py +++ b/src/sage/combinat/sloane_functions.py @@ -563,7 +563,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -613,7 +613,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -709,7 +709,7 @@ def __init__(self): - ``n`` -- positive integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -812,7 +812,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -867,7 +867,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -930,7 +930,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1005,7 +1005,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1081,7 +1081,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1151,7 +1151,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1208,7 +1208,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1257,7 +1257,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1310,7 +1310,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1364,7 +1364,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1417,7 +1417,7 @@ def __init__(self): - ``n`` -- integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1471,7 +1471,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1527,7 +1527,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1580,7 +1580,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1631,7 +1631,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1686,7 +1686,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1740,7 +1740,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1791,7 +1791,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1844,7 +1844,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1891,7 +1891,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -1956,7 +1956,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2007,7 +2007,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2054,7 +2054,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2105,7 +2105,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2156,7 +2156,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2208,7 +2208,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2268,7 +2268,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2326,7 +2326,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2390,7 +2390,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2444,7 +2444,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2536,7 +2536,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2595,7 +2595,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2649,7 +2649,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2736,7 +2736,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2792,7 +2792,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2856,7 +2856,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2923,7 +2923,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -2977,7 +2977,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3067,7 +3067,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3157,7 +3157,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3209,7 +3209,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3264,7 +3264,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3317,7 +3317,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3398,7 +3398,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3455,7 +3455,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3542,7 +3542,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3630,7 +3630,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3718,7 +3718,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3778,7 +3778,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3878,7 +3878,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3930,7 +3930,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -3981,7 +3981,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4032,7 +4032,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4085,7 +4085,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4138,7 +4138,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4189,7 +4189,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4245,7 +4245,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4296,7 +4296,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4348,7 +4348,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4403,7 +4403,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4458,7 +4458,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4512,7 +4512,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4564,7 +4564,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4615,7 +4615,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4716,7 +4716,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4766,7 +4766,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4816,7 +4816,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4866,7 +4866,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -4985,7 +4985,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5036,7 +5036,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5092,7 +5092,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5150,7 +5150,7 @@ def __init__(self): - ``n`` -- positive integer >= 2 - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5208,7 +5208,7 @@ def __init__(self): - ``n`` -- positive integer `\geq 3` - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5291,7 +5291,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5353,7 +5353,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5416,7 +5416,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5487,7 +5487,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5558,7 +5558,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5629,7 +5629,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5702,7 +5702,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5765,7 +5765,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5825,7 +5825,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5883,7 +5883,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5934,7 +5934,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -5986,7 +5986,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6047,7 +6047,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6102,7 +6102,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6154,7 +6154,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6270,7 +6270,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6331,7 +6331,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6394,7 +6394,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6454,7 +6454,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6512,7 +6512,7 @@ class A046660(SloaneSequence): - ``n`` -- positive integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6566,7 +6566,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6630,7 +6630,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6728,7 +6728,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -6884,7 +6884,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7051,7 +7051,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7098,7 +7098,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7146,7 +7146,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7197,7 +7197,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7242,7 +7242,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7292,7 +7292,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7338,7 +7338,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7384,7 +7384,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7432,7 +7432,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7482,7 +7482,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7562,7 +7562,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7615,7 +7615,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7670,7 +7670,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7719,7 +7719,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7775,7 +7775,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7821,7 +7821,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7905,7 +7905,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -7987,7 +7987,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -8110,7 +8110,7 @@ class A079922(SloaneSequence): - ``n`` -- positive integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -8178,7 +8178,7 @@ class A079923(SloaneSequence): - ``n`` -- positive integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -8254,7 +8254,7 @@ class A109814(SloaneSequence): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -8337,7 +8337,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -8485,7 +8485,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -8572,7 +8572,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: @@ -8689,7 +8689,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- `B_n` + OUTPUT: integer; `B_n` EXAMPLES:: @@ -8741,7 +8741,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- `C_n` + OUTPUT: integer; `C_n` EXAMPLES:: @@ -8784,7 +8784,7 @@ def __init__(self): - ``n`` -- nonnegative integer - OUTPUT: integer -- function value + OUTPUT: integer; function value EXAMPLES:: diff --git a/src/sage/combinat/words/abstract_word.py b/src/sage/combinat/words/abstract_word.py index 6f878f7a4a0..c6814b20df7 100644 --- a/src/sage/combinat/words/abstract_word.py +++ b/src/sage/combinat/words/abstract_word.py @@ -832,7 +832,7 @@ def _iterated_right_palindromic_closure_iterator(self, f=None): - ``f`` -- involution on the alphabet of ``self`` (default: ``None``); it must be callable on letters as well as words (e.g. WordMorphism) - OUTPUT: iterator -- the iterated (`f`-)palindromic closure of self + OUTPUT: iterator; the iterated (`f`-)palindromic closure of ``self`` EXAMPLES:: @@ -896,7 +896,7 @@ def _iterated_right_palindromic_closure_recursive_iterator(self, f=None): - ``f`` -- involution (default: ``None``) on the alphabet of ``self``; it must be callable on letters as well as words (e.g. WordMorphism) - OUTPUT: iterator -- the iterated (`f`-)palindromic closure of self + OUTPUT: iterator; the iterated (`f`-)palindromic closure of ``self`` ALGORITHM: @@ -994,7 +994,7 @@ def iterated_right_palindromic_closure(self, f=None, algorithm='recursive'): without having to recompute the longest `f`-palindromic suffix at each iteration [2]. - OUTPUT: word -- the iterated (`f`-)palindromic closure of self + OUTPUT: word; the iterated (`f`-)palindromic closure of ``self`` EXAMPLES:: diff --git a/src/sage/combinat/words/finite_word.py b/src/sage/combinat/words/finite_word.py index 5b4ccb57fff..8a29085ade9 100644 --- a/src/sage/combinat/words/finite_word.py +++ b/src/sage/combinat/words/finite_word.py @@ -442,7 +442,7 @@ def __pow__(self, exp): - ``exp`` -- integer; a rational, a float number or plus infinity - OUTPUT: word -- the ``exp``-th power of ``self`` + OUTPUT: word; the ``exp``-th power of ``self`` EXAMPLES: @@ -2495,8 +2495,8 @@ def lps(self, f=None, l=None): - ``l`` -- integer (default: ``None``); the length of the longest palindrome suffix of ````self[:-1]````, if known - OUTPUT: word -- If ``f`` is ``None``, the longest palindromic suffix of - ``self``; otherwise, the longest ``f``-palindromic suffix of ``self`` + OUTPUT: word; if ``f`` is ``None``, the longest palindromic suffix of + ``self``. Otherwise, the longest ``f``-palindromic suffix of ``self``. EXAMPLES:: @@ -2840,9 +2840,8 @@ def lengths_maximal_palindromes(self, f=None): it must be callable on letters as well as words (e.g. ``WordMorphism``) - OUTPUT: list -- The length of the maximal palindrome (or - ``f``-palindrome) with a given symmetry axis (letter or space between - two letters) + OUTPUT: list; the length of the maximal palindrome (or ``f``-palindrome) + with a given symmetry axis (letter or space between two letters) EXAMPLES:: @@ -2904,7 +2903,7 @@ def lps_lengths(self, f=None): It must be callable on letters as well as words (e.g. ``WordMorphism``). - OUTPUT: list -- The length of the longest palindromic (or + OUTPUT: list; the length of the longest palindromic (or ``f``-palindromic) suffix of each prefix of ``self`` EXAMPLES:: @@ -3376,7 +3375,7 @@ def order(self): Let `p(w)` be the period of a word `w`. The positive rational number `|w|/p(w)` is the *order* of `w`. See Chapter 8 of [Lot2002]_. - OUTPUT: rational -- the order + OUTPUT: rational; the order EXAMPLES:: @@ -3537,7 +3536,7 @@ def exponent(self): r""" Return the exponent of ``self``. - OUTPUT: integer -- the exponent + OUTPUT: integer; the exponent EXAMPLES:: @@ -5446,7 +5445,7 @@ def iterated_left_palindromic_closure(self, f=None): - ``f`` -- involution (default: ``None``) on the alphabet of ``self``; it must be callable on letters as well as words (e.g. ``WordMorphism``) - OUTPUT: word -- the left iterated ``f``-palindromic closure of ``self`` + OUTPUT: word; the left iterated ``f``-palindromic closure of ``self`` EXAMPLES:: @@ -6517,7 +6516,7 @@ def is_smooth_prefix(self): - ``self`` -- must be a word over the integers to get something other than ``False`` - OUTPUT: boolean -- whether ``self`` is a smooth prefix or not + OUTPUT: boolean; whether ``self`` is a smooth prefix or not EXAMPLES:: @@ -6994,8 +6993,8 @@ def is_christoffel(self): - ``self`` -- word - OUTPUT: boolean -- ``True`` if ``self`` is a Christoffel word, - ``False`` otherwise. + OUTPUT: boolean; ``True`` if ``self`` is a Christoffel word, + ``False`` otherwise EXAMPLES:: diff --git a/src/sage/combinat/words/word_char.pyx b/src/sage/combinat/words/word_char.pyx index c981ddfb14c..18be2efde90 100644 --- a/src/sage/combinat/words/word_char.pyx +++ b/src/sage/combinat/words/word_char.pyx @@ -250,7 +250,7 @@ cdef class WordDatatype_char(WordDatatype): - ``other`` -- a word (WordDatatype_char) - - ``op`` -- int, from 0 to 5 + - ``op`` -- integer from 0 to 5 TESTS:: diff --git a/src/sage/combinat/words/word_generators.py b/src/sage/combinat/words/word_generators.py index 62aca72458b..4c2931bcbd4 100644 --- a/src/sage/combinat/words/word_generators.py +++ b/src/sage/combinat/words/word_generators.py @@ -1320,7 +1320,7 @@ def MinimalSmoothPrefix(self, n): - ``n`` -- the desired length of the prefix - OUTPUT: word -- the prefix + OUTPUT: word; the prefix .. NOTE:: diff --git a/src/sage/dynamics/arithmetic_dynamics/endPN_automorphism_group.py b/src/sage/dynamics/arithmetic_dynamics/endPN_automorphism_group.py index 9806212797b..d10207210a5 100644 --- a/src/sage/dynamics/arithmetic_dynamics/endPN_automorphism_group.py +++ b/src/sage/dynamics/arithmetic_dynamics/endPN_automorphism_group.py @@ -1710,7 +1710,7 @@ def which_group(list_of_elements): - ``list_of_elements`` -- a finite list of elements of `PGL(2,K)` that we know a priori form a group - OUTPUT: string -- the isomorphism type of the group + OUTPUT: string; the isomorphism type of the group EXAMPLES:: diff --git a/src/sage/dynamics/arithmetic_dynamics/wehlerK3.py b/src/sage/dynamics/arithmetic_dynamics/wehlerK3.py index 198df61882c..3a4d3f5fc58 100644 --- a/src/sage/dynamics/arithmetic_dynamics/wehlerK3.py +++ b/src/sage/dynamics/arithmetic_dynamics/wehlerK3.py @@ -2495,7 +2495,7 @@ def cardinality( self): Enumerate points over `\mathbb{P}^2`, and then count the points on the fiber of each of those points. - OUTPUT: integer -- total number of points on the surface + OUTPUT: integer; total number of points on the surface EXAMPLES:: diff --git a/src/sage/functions/prime_pi.pyx b/src/sage/functions/prime_pi.pyx index 24c77a13d47..216e2fb2321 100644 --- a/src/sage/functions/prime_pi.pyx +++ b/src/sage/functions/prime_pi.pyx @@ -54,7 +54,7 @@ cdef class PrimePi(BuiltinFunction): possibly more) in computing ``prime_pi``, this can potentially speedup the time of computation, at a cost to memory usage. - OUTPUT: integer -- the number of primes :math:`\leq` ``x`` + OUTPUT: integer; the number of primes :math:`\leq` ``x`` EXAMPLES: @@ -219,7 +219,7 @@ cpdef Integer legendre_phi(x, a): - ``a`` -- nonnegative integer - OUTPUT: integer -- the number of positive integers :math:`\leq` ``x`` that + OUTPUT: integer; the number of positive integers :math:`\leq` ``x`` that are not divisible by the first ``a`` primes EXAMPLES:: diff --git a/src/sage/graphs/base/static_sparse_graph.pyx b/src/sage/graphs/base/static_sparse_graph.pyx index 410c8cbba72..e2486ab214a 100644 --- a/src/sage/graphs/base/static_sparse_graph.pyx +++ b/src/sage/graphs/base/static_sparse_graph.pyx @@ -33,9 +33,9 @@ Data structure The data structure is actually pretty simple and compact. ``short_digraph`` has five fields -- ``n`` -- ``int``; the number of vertices in the graph +- ``n`` -- integer; the number of vertices in the graph -- ``m`` -- ``int``; the number of edges in the graph +- ``m`` -- integer; the number of edges in the graph - ``edges`` -- ``uint32_t *``; array whose length is the number of edges of the graph @@ -48,7 +48,7 @@ five fields neighbors of vertex `n-1` : the last of them is the element addressed by ``neighbors[n]-1``. -- ``edge_labels`` -- ``list``; this cython list associates a label to each edge +- ``edge_labels`` -- list; this cython list associates a label to each edge of the graph. If a given edge is represented by ``edges[i]``, this its associated label can be found at ``edge_labels[i]``. This object is usually NULL, unless the call to ``init_short_digraph`` explicitly requires the labels diff --git a/src/sage/graphs/bliss.pyx b/src/sage/graphs/bliss.pyx index d93ef42e8ed..ba24e42a411 100644 --- a/src/sage/graphs/bliss.pyx +++ b/src/sage/graphs/bliss.pyx @@ -93,7 +93,7 @@ cdef void add_gen(void *user_param, unsigned int n, const unsigned int *aut) noe a Python object which is a pair ``(list_of_current_generators, vert_to_integer_labelling)``. - - ``n`` -- ``int``; number of points in the graph + - ``n`` -- integer; number of points in the graph - ``aut`` -- ``int *``; an automorphism of the graph """ @@ -157,17 +157,17 @@ cdef Graph *bliss_graph_from_labelled_edges(int Vnr, int Lnr, Vout, Vin, labels, INPUT: - - ``Vnr`` -- ``int``; number of vertices, such that the vertices are `0, + - ``Vnr`` -- integer; number of vertices, such that the vertices are `0, \ldots, Vnr-1` - - ``Lnr`` -- ``int``; number of labels, such that the labels are `0, \ldots, + - ``Lnr`` -- integer; number of labels, such that the labels are `0, \ldots, Lnr-1` - - ``Vout`` -- ``list``; the list of vertices of outgoing edges + - ``Vout`` -- list; the list of vertices of outgoing edges - - ``Vin`` -- ``list``; the list of vertices of ingoing edges + - ``Vin`` -- list; the list of vertices of ingoing edges - - ``labels`` -- ``list``; the list of edge labels + - ``labels`` -- list; the list of edge labels - ``partition`` -- an ordered partition of the vertex set """ @@ -234,17 +234,17 @@ cdef Digraph *bliss_digraph_from_labelled_edges(int Vnr, int Lnr, Vout, Vin, lab INPUT: - - ``Vnr`` -- ``int``; number of vertices, such that the vertices are `0, + - ``Vnr`` -- integer; number of vertices, such that the vertices are `0, \ldots, Vnr-1` - - ``Lnr`` -- ``int``; number of labels, such that the labels are `0, \ldots, + - ``Lnr`` -- integer; number of labels, such that the labels are `0, \ldots, Lnr-1` - - ``Vout`` -- ``list``; the list of vertices of outgoing edges + - ``Vout`` -- list; the list of vertices of outgoing edges - - ``Vin`` -- ``list``; the list of vertices of ingoing edges + - ``Vin`` -- list; the list of vertices of ingoing edges - - ``labels`` -- ``list``; the list of edge labels + - ``labels`` -- list; the list of edge labels - ``partition`` -- a partition of the vertex set """ @@ -306,19 +306,19 @@ cdef canonical_form_from_edge_list(int Vnr, list Vout, list Vin, int Lnr=1, list INPUT: - - ``Vnr`` -- ``int``; number of vertices, such that the vertices are `0, + - ``Vnr`` -- integer; number of vertices, such that the vertices are `0, \ldots, Vnr-1` - - ``Vout`` -- ``list``; the list of vertices of outgoing edges + - ``Vout`` -- list; the list of vertices of outgoing edges - - ``Vin`` -- ``list``; the list of vertices of ingoing edges + - ``Vin`` -- list; the list of vertices of ingoing edges - - ``Lnr`` -- ``int`` (default: 1); number of labels, such that the labels + - ``Lnr`` -- integer (default: 1); number of labels, such that the labels are `0, \ldots, Lnr-1` - - ``labels`` -- ``list`` (default: ``[]``); the list of edge labels + - ``labels`` -- list (default: ``[]``); the list of edge labels - - ``partition`` -- ``list`` (default: ``None``); a partition of the vertex + - ``partition`` -- list (default: ``None``); a partition of the vertex set - ``directed`` -- boolean (default: ``False``); whether the edges are @@ -389,7 +389,7 @@ cpdef canonical_form(G, partition=None, return_graph=False, use_edge_labels=True - ``G`` -- a Sage (Di)Graph - - ``partition`` -- ``list`` (default: ``None``); a partition of the vertices + - ``partition`` -- list (default: ``None``); a partition of the vertices of ``G`` into color classes - ``return_graph`` -- boolean (default: ``False``); whether to return the @@ -604,21 +604,21 @@ cdef automorphism_group_gens_from_edge_list(int Vnr, Vout, Vin, int Lnr=1, label INPUT: - - ``Vnr`` -- ``int``; number of vertices, such that the vertices are `0, + - ``Vnr`` -- integer; number of vertices, such that the vertices are `0, \ldots, Vnr-1` - - ``Vout`` -- ``list``; the list of vertices of outgoing edges + - ``Vout`` -- list; the list of vertices of outgoing edges - - ``Vin`` -- ``list``; the list of vertices of ingoing edges + - ``Vin`` -- list; the list of vertices of ingoing edges - - ``Lnr`` -- ``int`` (default: 1); number of labels, such that the labels + - ``Lnr`` -- integer (default: 1); number of labels, such that the labels are `0, \ldots, Lnr-1` - - ``labels`` -- ``list`` (default: ``[]``); the list of edge labels + - ``labels`` -- list (default: ``[]``); the list of edge labels - - ``int2vert`` -- ``list`` (default: ``[]``); ordering of the vertices + - ``int2vert`` -- list (default: ``[]``); ordering of the vertices - - ``partition`` -- ``list`` (default: ``None``); a partition of the vertex + - ``partition`` -- list (default: ``None``); a partition of the vertex set - ``directed`` -- boolean (default: ``False``); whether the edges are @@ -664,7 +664,7 @@ cpdef automorphism_group(G, partition=None, use_edge_labels=True) noexcept: - ``G`` -- a Sage graph - - ``partition`` -- ``list`` (default: ``None``); a partition of the vertices + - ``partition`` -- list (default: ``None``); a partition of the vertices of ``G`` into color classes. Defaults to ``None``, which is equivalent to a partition of size 1. @@ -855,9 +855,9 @@ cdef Graph *bliss_graph(G, partition, vert2int, int2vert) noexcept: - ``G`` -- a Sage Graph - - ``partition`` -- ``list``; a partition of the vertex set + - ``partition`` -- list; a partition of the vertex set - - ``vert2int, int2vert`` -- a empty ``dict`` and a empty ``list``; the + - ``vert2int, int2vert`` -- a empty ``dict`` and a empty list; the entries of the dictionary are later set to record the labeling of our graph. They are taken as arguments to avoid technicalities of returning Python objects in Cython functions. @@ -889,9 +889,9 @@ cdef Digraph *bliss_digraph(G, partition, vert2int, int2vert) noexcept: - ``G`` -- a Sage DiGraph - - ``partition`` -- ``list``; a partition of the vertex set + - ``partition`` -- list; a partition of the vertex set - - ``vert2int, int2vert`` -- a empty ``dict`` and a empty ``list``; the + - ``vert2int, int2vert`` -- a empty ``dict`` and a empty list; the entries of the dictionary are later set to record the labeling of our graph. They are taken as arguments to avoid technicalities of returning Python objects in Cython functions. diff --git a/src/sage/graphs/schnyder.py b/src/sage/graphs/schnyder.py index 971c7f1c31e..636798ee2ea 100644 --- a/src/sage/graphs/schnyder.py +++ b/src/sage/graphs/schnyder.py @@ -155,7 +155,7 @@ def _normal_label(g, comb_emb, external_face): - ``comb_emb`` -- a planar combinatorial embedding of g - ``external_face`` -- the list of three edges in the external face of g - OUTPUT: x -- tuple with entries + OUTPUT: x; tuple with entries x[0] = dict of dicts of normal labeling for each vertex of g and each adjacent neighbors u,v (u < v) of vertex: @@ -374,7 +374,7 @@ def _realizer(g, x, example=False): x[1] = (v1, v2, v3) tuple of the three external vertices (also the roots of each tree) - OUTPUT: x -- tuple with entries + OUTPUT: x; tuple with entries x[0] = dict of lists of TreeNodes: diff --git a/src/sage/interfaces/frobby.py b/src/sage/interfaces/frobby.py index 9f9c0f922f2..5eef9629fa7 100644 --- a/src/sage/interfaces/frobby.py +++ b/src/sage/interfaces/frobby.py @@ -42,7 +42,7 @@ def __call__(self, action, input=None, options=[], verbose=False): - ``options`` -- list of options without the dash in front - ``verbose`` -- boolean (default: ``False``); print detailed information - OUTPUT: string -- what Frobby wrote to the standard output stream + OUTPUT: string; what Frobby wrote to the standard output stream EXAMPLES: diff --git a/src/sage/interfaces/r.py b/src/sage/interfaces/r.py index c0d01f45d27..85bb40a9493 100644 --- a/src/sage/interfaces/r.py +++ b/src/sage/interfaces/r.py @@ -800,7 +800,7 @@ def source(self, s): - ``s`` -- string representing the function whose source code you want to see - OUTPUT: string -- source code + OUTPUT: string; source code EXAMPLES:: @@ -983,7 +983,7 @@ def help(self, command): - ``command`` -- string - OUTPUT: HelpExpression -- a subclass of string whose ``__repr__`` + OUTPUT: HelpExpression; a subclass of string whose ``__repr__`` method is ``__str__``, so it prints nicely EXAMPLES:: @@ -1066,7 +1066,7 @@ def function_call(self, function, args=None, kwds=None): """ Return the result of calling an R function, with given args and keyword args. - OUTPUT: RElement -- an object in R + OUTPUT: RElement; an object in R EXAMPLES:: @@ -1094,7 +1094,7 @@ def _an_element_(self): Return an element belonging to the R interpreter. This is used behind the scenes when doing things like comparisons, etc. - OUTPUT: RElement -- an R element + OUTPUT: RElement; an R element EXAMPLES:: @@ -1144,7 +1144,7 @@ def na(self): """ Return the NA in R. - OUTPUT: RElement -- an element of R + OUTPUT: RElement; an element of R EXAMPLES:: @@ -1176,7 +1176,7 @@ def _commands(self): """ Return list of all commands defined in R. - OUTPUT: list -- a sorted list of strings + OUTPUT: list; a sorted list of strings EXAMPLES:: @@ -1408,7 +1408,7 @@ def __getitem__(self, s): - ``s`` -- string - OUTPUT: RFunction -- the R function that in R has name s + OUTPUT: RFunction; the R function that in R has name s EXAMPLES:: @@ -1641,7 +1641,7 @@ def _comparison(self, other, symbol): - ``other`` -- RElement - ``symbol`` -- string - OUTPUT: RElement -- output is an R element; not a bool! + OUTPUT: RElement; output is an R element (not a bool!) TESTS:: @@ -1661,7 +1661,7 @@ def __eq__(self, other): - ``other`` -- RElement - OUTPUT: RElement -- an R element; not a bool! + OUTPUT: RElement; an R element (not a bool!) EXAMPLES: @@ -1681,7 +1681,7 @@ def __lt__(self, other): - ``other`` -- RElement - OUTPUT: RElement -- an R element; not a bool! + OUTPUT: RElement; an R element (not a bool!) EXAMPLES: @@ -1701,7 +1701,7 @@ def __gt__(self, other): - ``other`` -- RElement - OUTPUT: RElement -- an R element; not a bool! + OUTPUT: RElement; an R element (not a bool!) EXAMPLES: @@ -1721,7 +1721,7 @@ def __le__(self, other): - ``other`` -- RElement - OUTPUT: RElement -- an R element; not a bool! + OUTPUT: RElement; an R element (not a bool!) EXAMPLES:: @@ -1739,7 +1739,7 @@ def __ge__(self, other): - ``other`` -- RElement - OUTPUT: RElement -- an R element; not a bool! + OUTPUT: RElement; an R element (not a bool!) EXAMPLES:: @@ -1757,7 +1757,7 @@ def __ne__(self, other): - ``other`` -- RElement - OUTPUT: RElement -- an R element; not a bool! + OUTPUT: RElement; an R element (not a bool!) EXAMPLES:: @@ -1807,7 +1807,7 @@ def _sage_(self): names, they are translated to a Python dictionary, with anonymous list entries called ``#{number}``. - OUTPUT: object -- Python object + OUTPUT: object; Python object EXAMPLES:: diff --git a/src/sage/knots/knotinfo.py b/src/sage/knots/knotinfo.py index fca39034875..386e795782e 100644 --- a/src/sage/knots/knotinfo.py +++ b/src/sage/knots/knotinfo.py @@ -2295,7 +2295,7 @@ def knot_atlas_webpage(self, new=0, autoraise=True): INPUT: - - ``new`` -- ``int`` according to :func:`open` of :mod:`webbrowser` + - ``new`` -- integer according to :func:`open` of :mod:`webbrowser` (``0`` default, ``1`` new window, ``2`` new tab) - ``autoraise`` -- boolean (default: ``True``) @@ -2314,7 +2314,7 @@ def knotilus_webpage(self, new=0, autoraise=True): INPUT: - - ``new`` -- ``int`` according to :func:`open` of :mod:`webbrowser` + - ``new`` -- integer according to :func:`open` of :mod:`webbrowser` (``0`` default, ``1`` new window, ``2`` new tab) - ``autoraise`` -- boolean (default: ``True``) diff --git a/src/sage/libs/eclib/interface.py b/src/sage/libs/eclib/interface.py index 6904b6ddf88..12cbf6e0950 100644 --- a/src/sage/libs/eclib/interface.py +++ b/src/sage/libs/eclib/interface.py @@ -283,7 +283,7 @@ def two_descent(self, verbose=True, selmer_only=False, first_limit=20, 2-isogeny) flag determining whether or not to do second descent. *Default strongly recommended.* - OUTPUT: nothing -- nothing is returned + OUTPUT: nothing TESTS: diff --git a/src/sage/manifolds/differentiable/vectorfield_module.py b/src/sage/manifolds/differentiable/vectorfield_module.py index c7ff89ceb6a..200c69c078a 100644 --- a/src/sage/manifolds/differentiable/vectorfield_module.py +++ b/src/sage/manifolds/differentiable/vectorfield_module.py @@ -1133,7 +1133,7 @@ def metric(self, name: str, signature: Optional[int] = None, latex_name: Optiona INPUT: - ``name`` -- string; name given to the metric - - ``signature`` -- (integer; default: ``None``) signature `S` of the + - ``signature`` -- integer (default: ``None``); signature `S` of the metric: `S = n_+ - n_-`, where `n_+` (resp. `n_-`) is the number of positive terms (resp. number of negative terms) in any diagonal writing of the metric components; if ``signature`` is not provided, @@ -2321,7 +2321,7 @@ def metric(self, name, signature=None, latex_name=None): INPUT: - ``name`` -- string; name given to the metric - - ``signature`` -- (integer; default: ``None``) signature `S` of the + - ``signature`` -- integer (default: ``None``); signature `S` of the metric: `S = n_+ - n_-`, where `n_+` (resp. `n_-`) is the number of positive terms (resp. number of negative terms) in any diagonal writing of the metric components; if ``signature`` is not provided, diff --git a/src/sage/matrix/benchmark.py b/src/sage/matrix/benchmark.py index 2bf37b55ddd..ce72771cac7 100644 --- a/src/sage/matrix/benchmark.py +++ b/src/sage/matrix/benchmark.py @@ -132,7 +132,7 @@ def nullspace_ZZ(n=200, min=0, max=2**32, system='sage'): - ``n`` -- matrix dimension (default: ``200``) - ``min`` -- minimal value for entries of matrix (default: ``0``) - ``max`` -- maximal value for entries of matrix (default: ``2**32``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -172,7 +172,7 @@ def charpoly_ZZ(n=100, min=0, max=9, system='sage'): - ``n`` -- matrix dimension (default: ``100``) - ``min`` -- minimal value for entries of matrix (default: ``0``) - ``max`` -- maximal value for entries of matrix (default: ``9``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -212,7 +212,7 @@ def rank_ZZ(n=700, min=0, max=9, system='sage'): - ``n`` -- matrix dimension (default: ``700``) - ``min`` -- minimal value for entries of matrix (default: ``0``) - ``max`` -- maximal value for entries of matrix (default: ``9``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -251,7 +251,7 @@ def rank2_ZZ(n=400, min=0, max=2**64, system='sage'): - ``n`` -- matrix dimension (default: ``400``) - ``min`` -- minimal value for entries of matrix (default: ``0``) - ``max`` -- maximal value for entries of matrix (default: ``2**64``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -292,7 +292,7 @@ def smithform_ZZ(n=128, min=0, max=9, system='sage'): - ``n`` -- matrix dimension (default: ``128``) - ``min`` -- minimal value for entries of matrix (default: ``0``) - ``max`` -- maximal value for entries of matrix (default: ``9``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -332,7 +332,7 @@ def matrix_multiply_ZZ(n=300, min=-9, max=9, system='sage', times=1): - ``n`` -- matrix dimension (default: ``300``) - ``min`` -- minimal value for entries of matrix (default: ``-9``) - ``max`` -- maximal value for entries of matrix (default: ``9``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) - ``times`` -- number of experiments (default: ``1``) EXAMPLES:: @@ -377,7 +377,7 @@ def matrix_add_ZZ(n=200, min=-9, max=9, system='sage', times=50): - ``n`` -- matrix dimension (default: ``200``) - ``min`` -- minimal value for entries of matrix (default: ``-9``) - ``max`` -- maximal value for entries of matrix (default: ``9``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) - ``times`` -- number of experiments (default: ``50``) EXAMPLES:: @@ -423,7 +423,7 @@ def matrix_add_ZZ_2(n=200, bits=16, system='sage', times=50): - ``n`` -- matrix dimension (default: ``200``) - ``bits`` -- bitsize of entries - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) - ``times`` -- number of experiments (default: ``50``) EXAMPLES:: @@ -446,7 +446,7 @@ def det_ZZ(n=200, min=1, max=100, system='sage'): - ``n`` -- matrix dimension (default: ``200``) - ``min`` -- minimal value for entries of matrix (default: ``1``) - ``max`` -- maximal value for entries of matrix (default: ``100``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -486,7 +486,7 @@ def det_QQ(n=300, num_bound=10, den_bound=10, system='sage'): - ``n`` -- matrix dimension (default: ``200``) - ``num_bound`` -- numerator bound, inclusive (default: ``10``) - ``den_bound`` -- denominator bound, inclusive (default: ``10``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -529,7 +529,7 @@ def vecmat_ZZ(n=300, min=-9, max=9, system='sage', times=200): - ``n`` -- matrix dimension (default: ``300``) - ``min`` -- minimal value for entries of matrix (default: ``-9``) - ``max`` -- maximal value for entries of matrix (default: ``9``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) - ``times`` -- number of runs (default: ``200``) EXAMPLES:: @@ -915,7 +915,7 @@ def echelon_QQ(n=100, min=0, max=9, system='sage'): - ``n`` -- matrix dimension (default: ``300``) - ``min`` -- minimal value for entries of matrix (default: ``-9``) - ``max`` -- maximal value for entries of matrix (default: ``9``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -955,7 +955,7 @@ def inverse_QQ(n=100, min=0, max=9, system='sage'): - ``n`` -- matrix dimension (default: ``300``) - ``min`` -- minimal value for entries of matrix (default: ``-9``) - ``max`` -- maximal value for entries of matrix (default: ``9``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -995,7 +995,7 @@ def matrix_multiply_QQ(n=100, bnd=2, system='sage', times=1): - ``n`` -- matrix dimension (default: ``300``) - ``bnd`` -- numerator and denominator bound (default: ``bnd``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) - ``times`` -- number of experiments (default: ``1``) EXAMPLES:: @@ -1040,7 +1040,7 @@ def det_hilbert_QQ(n=80, system='sage'): INPUT: - ``n`` -- matrix dimension (default: ``300``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -1075,7 +1075,7 @@ def invert_hilbert_QQ(n=40, system='sage'): INPUT: - ``n`` -- matrix dimension (default: ``300``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -1110,7 +1110,7 @@ def MatrixVector_QQ(n=1000,h=100,system='sage',times=1): - ``n`` -- matrix dimension (default: ``300``) - ``h`` -- numerator and denominator bound (default: ``bnd``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) - ``times`` -- number of experiments (default: ``1``) EXAMPLES:: @@ -1167,7 +1167,7 @@ def nullspace_RR(n=300, min=0, max=10, system='sage'): - ``n`` -- matrix dimension (default: ``300``) - ``min`` -- minimal value for entries of matrix (default: ``0``) - ``max`` -- maximal value for entries of matrix (default: ``10``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: @@ -1208,7 +1208,7 @@ def nullspace_RDF(n=300, min=0, max=10, system='sage'): - ``n`` -- matrix dimension (default: ``300``) - ``min`` -- minimal value for entries of matrix (default: ``0``) - ``max`` -- maximal value for entries of matrix (default: `10``) - - ``system`` -- either 'sage' or 'magma' (default: ``'sage'``) + - ``system`` -- either ``'sage'`` or ``'magma'`` (default: ``'sage'``) EXAMPLES:: diff --git a/src/sage/matrix/matrix2.pyx b/src/sage/matrix/matrix2.pyx index 0c24777bf41..6899aa54635 100644 --- a/src/sage/matrix/matrix2.pyx +++ b/src/sage/matrix/matrix2.pyx @@ -3117,7 +3117,7 @@ cdef class Matrix(Matrix1): - ``var`` -- a variable name (default: ``'x'``) - OUTPUT: polynomial -- the characteristic polynomial of ``self`` + OUTPUT: polynomial; the characteristic polynomial of ``self`` EXAMPLES: @@ -10247,7 +10247,7 @@ cdef class Matrix(Matrix1): r""" Return the adjugate of this matrix. - OUTPUT: matrix -- the adjugate of the matrix + OUTPUT: matrix; the adjugate of the matrix EXAMPLES: @@ -15490,13 +15490,13 @@ cdef class Matrix(Matrix1): - ``p`` -- one of the following options: - - ``1`` -- the largest column-sum norm + - ``1`` -- the largest column-sum norm - - ``2`` -- (default) the Euclidean norm + - ``2`` -- (default) the Euclidean norm - - ``Infinity`` -- the largest row-sum norm + - ``Infinity`` -- the largest row-sum norm - - ``'frob'`` -- the Frobenius (sum of squares) norm + - ``'frob'`` -- the Frobenius (sum of squares) norm OUTPUT: RDF number diff --git a/src/sage/matrix/matrix_cyclo_dense.pyx b/src/sage/matrix/matrix_cyclo_dense.pyx index 3761ec8fc42..0b95a00f011 100644 --- a/src/sage/matrix/matrix_cyclo_dense.pyx +++ b/src/sage/matrix/matrix_cyclo_dense.pyx @@ -886,7 +886,7 @@ cdef class Matrix_cyclo_dense(Matrix_dense): """ Return the denominator of the entries of this matrix. - OUTPUT: integer -- the smallest integer `d` so that ``d * self`` has + OUTPUT: integer; the smallest integer `d` so that ``d * self`` has entries in the ring of integers EXAMPLES:: diff --git a/src/sage/matrix/matrix_integer_dense.pyx b/src/sage/matrix/matrix_integer_dense.pyx index 7f674579c9e..35bbfcc5012 100644 --- a/src/sage/matrix/matrix_integer_dense.pyx +++ b/src/sage/matrix/matrix_integer_dense.pyx @@ -2742,7 +2742,7 @@ cdef class Matrix_integer_dense(Matrix_dense): - ``fp`` -- floating point number implementation - - ``None`` -- nTL's exact reduction or fpLLL's wrapper (default) + - ``None`` -- NTL's exact reduction or fpLLL's wrapper (default) - ``'fp'`` -- double precision: NTL's FP or fpLLL's double diff --git a/src/sage/matrix/matrix_integer_dense_hnf.py b/src/sage/matrix/matrix_integer_dense_hnf.py index 24235abb922..5bdc2314232 100644 --- a/src/sage/matrix/matrix_integer_dense_hnf.py +++ b/src/sage/matrix/matrix_integer_dense_hnf.py @@ -105,7 +105,7 @@ def det_given_divisor(A, d, proof=True, stabilize=2): the determinant modulo `p` until ``stabilize`` successive modulo determinant computations stabilize. - OUTPUT: integer -- determinant + OUTPUT: integer; determinant EXAMPLES:: @@ -502,7 +502,7 @@ def pivots_of_hnf_matrix(H): - ``H`` -- a matrix that must be HNF - OUTPUT: list -- list of pivots + OUTPUT: list of pivots EXAMPLES:: diff --git a/src/sage/matrix/matrix_integer_dense_saturation.py b/src/sage/matrix/matrix_integer_dense_saturation.py index cae0813f6b3..b537b041e08 100644 --- a/src/sage/matrix/matrix_integer_dense_saturation.py +++ b/src/sage/matrix/matrix_integer_dense_saturation.py @@ -194,7 +194,7 @@ def saturation(A, proof=True, p=0, max_dets=5): - ``max_dets`` -- integer (default: 4); max number of dets of submatrices to compute - OUTPUT: matrix -- saturation of the matrix `A` + OUTPUT: matrix; saturation of the matrix `A` EXAMPLES:: diff --git a/src/sage/matrix/matrix_integer_sparse.pyx b/src/sage/matrix/matrix_integer_sparse.pyx index 828317da692..ff2f5404689 100644 --- a/src/sage/matrix/matrix_integer_sparse.pyx +++ b/src/sage/matrix/matrix_integer_sparse.pyx @@ -999,7 +999,7 @@ cdef class Matrix_integer_sparse(Matrix_sparse): - ``'linbox_sparse_elimination'`` -- use LinBox sparse elimination - - ``'linbox_ blackbox'`` -- linBox via a Blackbox algorithm + - ``'linbox_ blackbox'`` -- LinBox via a Blackbox algorithm - ``'linbox_wiedemann'`` -- use LinBox implementation of Wiedemann's algorithm diff --git a/src/sage/matrix/matrix_mod2_dense.pyx b/src/sage/matrix/matrix_mod2_dense.pyx index 139ad804132..abcfe65430b 100644 --- a/src/sage/matrix/matrix_mod2_dense.pyx +++ b/src/sage/matrix/matrix_mod2_dense.pyx @@ -1050,10 +1050,10 @@ cdef class Matrix_mod2_dense(matrix_dense.Matrix_dense): # dense or sparse - ``self`` -- a mutable matrix - ``algorithm`` -- string: - - ``'heuristic'`` -- uses M4RI and PLUQ (default) - - ``'m4ri'`` -- uses M4RI - - ``'pluq'`` -- uses PLUQ factorization - - ``'classical'`` -- uses classical Gaussian elimination + - ``'heuristic'`` -- uses M4RI and PLUQ (default) + - ``'m4ri'`` -- uses M4RI + - ``'pluq'`` -- uses PLUQ factorization + - ``'classical'`` -- uses classical Gaussian elimination - ``k`` -- the parameter 'k' of the M4RI algorithm. It MUST be between 1 and 16 (inclusive). If it is not specified it will be calculated as diff --git a/src/sage/matroids/matroid.pyx b/src/sage/matroids/matroid.pyx index 720ccd41c3b..5965a4455f9 100644 --- a/src/sage/matroids/matroid.pyx +++ b/src/sage/matroids/matroid.pyx @@ -5469,8 +5469,8 @@ cdef class Matroid(SageObject): to compute 3-connectivity: - ``None`` -- the most appropriate algorithm is chosen automatically - - ``'bridges'`` -- bixby and Cunningham's algorithm, based on bridges [BC1977]_ - Note that this cannot return a separator + - ``'bridges'`` -- Bixby and Cunningham's algorithm, based on bridges + [BC1977]_; note that this cannot return a separator - ``'intersection'`` -- an algorithm based on matroid intersection - ``'shifting'`` -- an algorithm based on the shifting algorithm [Raj1987]_ diff --git a/src/sage/misc/inline_fortran.py b/src/sage/misc/inline_fortran.py index fb9a7078da0..ccd4b1da87c 100644 --- a/src/sage/misc/inline_fortran.py +++ b/src/sage/misc/inline_fortran.py @@ -77,8 +77,7 @@ def __call__(self, *args, **kwds): def eval(self, x, globals=None, locals=None): """ - Compile fortran code ``x`` and adds the functions in it to - ``globals``. + Compile fortran code ``x`` and adds the functions in it to ``globals``. INPUT: diff --git a/src/sage/misc/sage_timeit_class.pyx b/src/sage/misc/sage_timeit_class.pyx index 50ab9e451d0..28f5f9f840d 100644 --- a/src/sage/misc/sage_timeit_class.pyx +++ b/src/sage/misc/sage_timeit_class.pyx @@ -62,7 +62,7 @@ class SageTimeit: ``preparse``, ``number``, ``repeat``, ``precision``. See :func:`~sage.misc.sage_timeit.sage_timeit` for details. - OUTPUT: string -- timing information as a string + OUTPUT: string; timing information EXAMPLES:: diff --git a/src/sage/misc/superseded.py b/src/sage/misc/superseded.py index 6dbf3befa92..7f15ab20f37 100644 --- a/src/sage/misc/superseded.py +++ b/src/sage/misc/superseded.py @@ -226,7 +226,7 @@ def __init__(self, issue_number, stacklevel=4): - ``issue_number`` -- integer; the github issue number where this code was introduced - - ``stack_level`` -- integer (default: `4`); This is passed on to + - ``stack_level`` -- integer (default: `4`); this is passed on to :func:`warnings.warn` EXAMPLES:: diff --git a/src/sage/modular/abvar/abvar.py b/src/sage/modular/abvar/abvar.py index 3946b0cb3e8..0639c13ddd8 100644 --- a/src/sage/modular/abvar/abvar.py +++ b/src/sage/modular/abvar/abvar.py @@ -1372,7 +1372,7 @@ def _quotient_by_finite_subgroup(self, G): OUTPUT: - - abelian variety - the quotient `Q` of ``self`` by `G` + - abelian variety; the quotient `Q` of ``self`` by `G` - ``morphism`` -- from ``self`` to the quotient `Q` @@ -4701,7 +4701,7 @@ def _invariants_of_image_of_component_group_of_J0(self, p): - ``p`` -- integer - OUTPUT: list -- of elementary invariants + OUTPUT: list of elementary invariants EXAMPLES:: diff --git a/src/sage/modular/abvar/morphism.py b/src/sage/modular/abvar/morphism.py index 4c3e96efbd6..ccf87e302e7 100644 --- a/src/sage/modular/abvar/morphism.py +++ b/src/sage/modular/abvar/morphism.py @@ -363,8 +363,7 @@ def __call__(self, X): """ INPUT: - - ``X`` -- abelian variety, finite group, or torsion - element + - ``X`` -- abelian variety, finite group, or torsion element OUTPUT: abelian variety, finite group, torsion element diff --git a/src/sage/modular/arithgroup/farey_symbol.pyx b/src/sage/modular/arithgroup/farey_symbol.pyx index 62579d78242..4abb35fe075 100644 --- a/src/sage/modular/arithgroup/farey_symbol.pyx +++ b/src/sage/modular/arithgroup/farey_symbol.pyx @@ -910,8 +910,8 @@ cdef class Farey: which is one of 'dashed', 'dotted', 'solid', 'dashdot', or '--', ':', '-', '-.', respectively - - ``color`` -- fill color (default: ``'lightgray'``); fill - color for odd part of Dedekind tesselation + - ``color`` -- (default: ``'lightgray'``) fill color for odd part of + Dedekind tesselation - ``show_pairing`` -- boolean (default: ``True``); flag for pairing diff --git a/src/sage/modular/cusps_nf.py b/src/sage/modular/cusps_nf.py index 90425575684..d698ebda640 100644 --- a/src/sage/modular/cusps_nf.py +++ b/src/sage/modular/cusps_nf.py @@ -912,7 +912,7 @@ def is_Gamma0_equivalent(self, other, N, Transformation=False): - ``N`` -- an ideal of the number field (level) - OUTPUT: boolean -- ``True`` if the cusps are equivalent + OUTPUT: boolean; ``True`` if the cusps are equivalent - a transformation matrix -- (if ``Transformation=True``) a list of integral elements [a, b, c, d] which are the entries of a 2x2 matrix @@ -1117,7 +1117,7 @@ def number_of_Gamma0_NFCusps(N): - ``N`` -- a number field ideal - OUTPUT: integer -- the number of orbits of cusps under Gamma0(N)-action + OUTPUT: integer; the number of orbits of cusps under Gamma0(N)-action EXAMPLES:: diff --git a/src/sage/modular/hecke/ambient_module.py b/src/sage/modular/hecke/ambient_module.py index e1ad9fc98d4..87668b38565 100644 --- a/src/sage/modular/hecke/ambient_module.py +++ b/src/sage/modular/hecke/ambient_module.py @@ -288,8 +288,8 @@ def degeneracy_map(self, codomain, t=1): self, or a positive integer (in which case Sage will use :meth:`~hecke_module_of_level` to find the "natural" module of the corresponding level). - - ``t`` -- int, the parameter of the degeneracy map, i.e., the map is - related to `f(q)` - `f(q^t)` + - ``t`` -- integer; the parameter of the degeneracy map, i.e., the map + is related to `f(q)` - `f(q^t)` OUTPUT: a morphism from ``self`` to ``codomain`` @@ -462,7 +462,7 @@ def fcp(self, n, var='x'): INPUT: - - ``self`` -- hecke module invariant under the Hecke operator of index + - ``self`` -- Hecke module invariant under the Hecke operator of index `n` - ``n`` --- a positive integer. diff --git a/src/sage/modular/hecke/submodule.py b/src/sage/modular/hecke/submodule.py index 6d578e96e7b..da13d881ee7 100644 --- a/src/sage/modular/hecke/submodule.py +++ b/src/sage/modular/hecke/submodule.py @@ -411,10 +411,10 @@ def degeneracy_map(self, level, t=1): INPUT: - - ``level`` -- int, the level of the codomain of the - map (positive int) + - ``level`` -- positive integer; the level of the codomain of the + map - - ``t`` -- int, the parameter of the degeneracy map, + - ``t`` -- integer; the parameter of the degeneracy map, i.e., the map is related to `f(q)` - `f(q^t)` OUTPUT: diff --git a/src/sage/modular/modform/constructor.py b/src/sage/modular/modform/constructor.py index b5837ad0c51..08a366222f2 100644 --- a/src/sage/modular/modform/constructor.py +++ b/src/sage/modular/modform/constructor.py @@ -165,7 +165,7 @@ def ModularForms(group=1, - ``group`` -- a congruence subgroup or a Dirichlet character eps - - ``weight`` -- int, the weight, which must be an integer >= 1 + - ``weight`` -- integer; the weight (`\geq 1`) - ``base_ring`` -- the base ring (ignored if group is a Dirichlet character) diff --git a/src/sage/modular/modsym/manin_symbol_list.py b/src/sage/modular/modsym/manin_symbol_list.py index 63610dff7d8..a020fcd445d 100644 --- a/src/sage/modular/modsym/manin_symbol_list.py +++ b/src/sage/modular/modsym/manin_symbol_list.py @@ -369,7 +369,7 @@ def weight(self): """ Return the weight of the Manin symbols in this :class:`ManinSymbolList`. - OUTPUT: integer -- the weight of the Manin symbols in the list + OUTPUT: integer; the weight of the Manin symbols in the list EXAMPLES:: diff --git a/src/sage/modular/pollack_stevens/modsym.py b/src/sage/modular/pollack_stevens/modsym.py index 671cebcdd94..aa9462fdc94 100644 --- a/src/sage/modular/pollack_stevens/modsym.py +++ b/src/sage/modular/pollack_stevens/modsym.py @@ -75,7 +75,7 @@ def _iterate_Up(Phi, p, M, ap, q, aq, check): - ``q`` -- prime - - ``aq`` -- hecke eigenvalue at `q` + - ``aq`` -- Hecke eigenvalue at `q` OUTPUT: Hecke-eigenvalue overconvergent modular symbol lifting self diff --git a/src/sage/modular/ssmod/ssmod.py b/src/sage/modular/ssmod/ssmod.py index 69602af5e4c..0472cde2788 100644 --- a/src/sage/modular/ssmod/ssmod.py +++ b/src/sage/modular/ssmod/ssmod.py @@ -100,7 +100,7 @@ def Phi2_quad(J3, ssJ1, ssJ2): - ``ssJ2``, ``ssJ2`` -- supersingular j-invariants over the finite field - OUTPUT: polynomial -- defined over the finite field + OUTPUT: polynomial; defined over the finite field EXAMPLES: @@ -162,7 +162,7 @@ def Phi_polys(L, x, j): - ``j`` -- supersingular j-invariant over the finite field - OUTPUT: polynomial -- defined over the finite field + OUTPUT: polynomial; defined over the finite field EXAMPLES: @@ -204,7 +204,7 @@ def dimension_supersingular_module(prime, level=1): - ``level`` -- integer; positive - OUTPUT: dimension -- integer, nonnegative + OUTPUT: dimension; integer, nonnegative EXAMPLES: @@ -255,7 +255,7 @@ def supersingular_D(prime): - ``prime`` -- integer, prime - OUTPUT: d -- integer, negative + OUTPUT: d; integer, negative EXAMPLES: @@ -496,7 +496,7 @@ def dimension(self): - ``self`` -- SupersingularModule object - OUTPUT: integer -- dimension, nonnegative + OUTPUT: integer; dimension, nonnegative EXAMPLES:: @@ -543,7 +543,7 @@ def level(self): - ``self`` -- SupersingularModule object - OUTPUT: integer -- the level, positive + OUTPUT: integer; the level, positive EXAMPLES:: @@ -567,7 +567,7 @@ def prime(self): - ``self`` -- SupersingularModule object - OUTPUT: integer -- characteristic, positive + OUTPUT: integer; characteristic, positive EXAMPLES:: @@ -591,7 +591,7 @@ def weight(self): - ``self`` -- SupersingularModule object - OUTPUT: integer -- weight, positive + OUTPUT: integer; weight, positive EXAMPLES:: @@ -769,7 +769,7 @@ def hecke_matrix(self, L): - ``L`` -- integer; positive - OUTPUT: matrix -- sparse integer matrix + OUTPUT: matrix; sparse integer matrix EXAMPLES: