Skip to content
This repository was archived by the owner on Feb 1, 2023. It is now read-only.

Commit 68926f8

Browse files
author
Release Manager
committed
Trac #28593: cleaning backslash and refresh doc in one file
Doing two different things: - replace use of final {{{\}}} in some doc by {{{....:}}} - refresh the doc of the file {{{src/sage/modular/hecke/module.py}}} URL: https://trac.sagemath.org/28593 Reported by: chapoton Ticket author(s): Frédéric Chapoton Reviewer(s): John Palmieri
2 parents 0906961 + b4a7972 commit 68926f8

File tree

7 files changed

+179
-180
lines changed

7 files changed

+179
-180
lines changed

‎src/sage/combinat/hillman_grassl.py‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -281,8 +281,8 @@ def hillman_grassl_inverse(self):
281281
result ([Gans1981]_ Corollary 3.4)::
282282
283283
sage: a = WeakReversePlanePartition([[1,3,5],[2,4]])
284-
sage: a.hillman_grassl_inverse().conjugate() ==\
285-
....: a.conjugate().hillman_grassl_inverse()
284+
sage: aic = a.hillman_grassl_inverse().conjugate()
285+
sage: aic == a.conjugate().hillman_grassl_inverse()
286286
True
287287
"""
288288
return Tableau(hillman_grassl_inverse(list(self)))
@@ -401,8 +401,8 @@ def pak_correspondence(self):
401401
`M` and then transposing the result::
402402
403403
sage: a = WeakReversePlanePartition([[1,3,5],[2,4]])
404-
sage: a.pak_correspondence().conjugate() ==\
405-
....: a.conjugate().pak_correspondence()
404+
sage: acc = a.pak_correspondence().conjugate()
405+
sage: acc == a.conjugate().pak_correspondence()
406406
True
407407
"""
408408
return Tableau(pak_correspondence(list(self)))

‎src/sage/combinat/multiset_partition_into_sets_ordered.py‎

Lines changed: 8 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1710,8 +1710,8 @@ def _satisfies_constraints(self, x):
17101710
sage: OMPs = OrderedMultisetPartitionsIntoSets(**c)
17111711
sage: OMPs._satisfies_constraints([{2,4}, {1}, {1,4}])
17121712
True
1713-
sage: failures = {((2,4), (2,4)), ((1,2,4), (1,), (1,4)), \
1714-
((2,4), (3,), (3,)), ((2,4), (1,), (2,4))}
1713+
sage: failures = {((2,4), (2,4)), ((1,2,4), (1,), (1,4)),
1714+
....: ((2,4), (3,), (3,)), ((2,4), (1,), (2,4))}
17151715
sage: any(OMPs._satisfies_constraints(x) for x in failures)
17161716
False
17171717
sage: c = {"max_length":4, "weight":{1:2, 2:1, 4:2}}
@@ -1952,7 +1952,8 @@ def subset(self, size):
19521952

19531953
# slice by 'order'
19541954
if "alphabet" in fc:
1955-
no_alpha = {k: v for (k, v) in iteritems(self.constraints) if k is not "alphabet"}
1955+
no_alpha = {k: v for (k, v) in iteritems(self.constraints)
1956+
if k != "alphabet"}
19561957
return OrderedMultisetPartitionsIntoSets(fc["alphabet"], size, **no_alpha)
19571958

19581959
# slice by 'size'
@@ -2744,7 +2745,7 @@ def _base_iterator(constraints):
27442745
if "weight" in constraints:
27452746
return _iterator_weight(constraints["weight"])
27462747
elif "size" in constraints:
2747-
return _iterator_size(constraints["size"], \
2748+
return _iterator_size(constraints["size"],
27482749
constraints.get("length",None), constraints.get("alphabet",None))
27492750
elif "alphabet" in constraints:
27502751
A = constraints["alphabet"]
@@ -2790,9 +2791,9 @@ def _iterator_weight(weight):
27902791
sage: OMP = OrderedMultisetPartitionsIntoSets(weight)
27912792
sage: l = list(_iterator_weight(weight))
27922793
2793-
sage: sorted(map(OMP, l), key=str) == sorted(map(OMP, \
2794-
[[{1}, {1}, {'b'}], [{1}, {1,'b'}], [{1}, {'b'}, {1}], \
2795-
[{1,'b'}, {1}], [{'b'}, {1}, {1}]]), key=str)
2794+
sage: sorted(map(OMP, l), key=str) == sorted(map(OMP,
2795+
....: [[{1}, {1}, {'b'}], [{1}, {1,'b'}], [{1}, {'b'}, {1}],
2796+
....: [{1,'b'}, {1}], [{'b'}, {1}, {1}]]), key=str)
27962797
True
27972798
sage: OMP = OrderedMultisetPartitionsIntoSets({1:3, 3:1})
27982799
sage: list(map(OMP, _iterator_weight([3,0,1])))

‎src/sage/combinat/root_system/root_lattice_realizations.py‎

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -2,15 +2,15 @@
22
"""
33
Root lattice realizations
44
"""
5-
#*****************************************************************************
5+
# ****************************************************************************
66
# Copyright (C) 2007-2013 Nicolas M. Thiery <nthiery at users.sf.net>
77
# 2012 Nicolas Borie <nicolas.borie at univ-mlv.fr>
88
#
99
# (with contributions of many others)
1010
#
1111
# Distributed under the terms of the GNU General Public License (GPL)
12-
# http://www.gnu.org/licenses/
13-
#*****************************************************************************
12+
# https://www.gnu.org/licenses/
13+
# ****************************************************************************
1414
from __future__ import print_function, absolute_import
1515
from six.moves import range
1616

@@ -2882,10 +2882,10 @@ def plot_alcove_walk(self, word, start=None, foldings=None, color ="orange", **o
28822882
28832883
And another with some foldings::
28842884
2885-
sage: L.plot_alcoves(bounding_box=3) +\
2886-
....: L.plot_alcove_walk([0,1,2,0,2,0,1,2,0,1],
2885+
sage: pic = L.plot_alcoves(bounding_box=3) # long time
2886+
sage: pic += L.plot_alcove_walk([0,1,2,0,2,0,1,2,0,1], # long time (3s)
28872887
....: foldings = [False, False, True, False, False, False, True, False, True, False],
2888-
....: color="green") # long time (3s)
2888+
....: color="green"); pic
28892889
Graphics object consisting of 155 graphics primitives
28902890
28912891
TESTS::

‎src/sage/games/sudoku.py‎

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -575,16 +575,16 @@ def solve(self, algorithm = 'dlx'):
575575
[sudoku:top95]_ which we use to show that the two available algorithms obtain
576576
the same solution for each. ::
577577
578-
sage: top =['4.....8.5.3..........7......2.....6.....8.4......1.......6.3.7.5..2.....1.4......',\
579-
'52...6.........7.13...........4..8..6......5...........418.........3..2...87.....',\
580-
'6.....8.3.4.7.................5.4.7.3..2.....1.6.......2.....5.....8.6......1....',\
581-
'48.3............71.2.......7.5....6....2..8.............1.76...3.....4......5....',\
582-
'....14....3....2...7..........9...3.6.1.............8.2.....1.4....5.6.....7.8...',\
583-
'......52..8.4......3...9...5.1...6..2..7........3.....6...1..........7.4.......3.',\
584-
'6.2.5.........3.4..........43...8....1....2........7..5..27...........81...6.....',\
585-
'.524.........7.1..............8.2...3.....6...9.5.....1.6.3...........897........',\
586-
'6.2.5.........4.3..........43...8....1....2........7..5..27...........81...6.....',\
587-
'.923.........8.1...........1.7.4...........658.........6.5.2...4.....7.....9.....']
578+
sage: top =['4.....8.5.3..........7......2.....6.....8.4......1.......6.3.7.5..2.....1.4......',
579+
....: '52...6.........7.13...........4..8..6......5...........418.........3..2...87.....',
580+
....: '6.....8.3.4.7.................5.4.7.3..2.....1.6.......2.....5.....8.6......1....',
581+
....: '48.3............71.2.......7.5....6....2..8.............1.76...3.....4......5....',
582+
....: '....14....3....2...7..........9...3.6.1.............8.2.....1.4....5.6.....7.8...',
583+
....: '......52..8.4......3...9...5.1...6..2..7........3.....6...1..........7.4.......3.',
584+
....: '6.2.5.........3.4..........43...8....1....2........7..5..27...........81...6.....',
585+
....: '.524.........7.1..............8.2...3.....6...9.5.....1.6.3...........897........',
586+
....: '6.2.5.........4.3..........43...8....1....2........7..5..27...........81...6.....',
587+
....: '.923.........8.1...........1.7.4...........658.........6.5.2...4.....7.....9.....']
588588
sage: p = [Sudoku(top[i]) for i in range(10)]
589589
sage: verify = [next(p[i].solve(algorithm='dlx')) == next(p[i].solve(algorithm='backtrack')) for i in range(10)]
590590
sage: verify == [True]*10

0 commit comments

Comments
 (0)