Skip to content

Commit d8a4722

Browse files
author
Release Manager
committed
sagemathgh-39186: Remove backslash hack in doctest Would fix sagemath#39058 . I think it's cleaner to remove this thing anyway (given that it doesn't work in the real Sage command prompt either) ### 📝 Checklist <!-- Put an `x` in all the boxes that apply. --> - [x] The title is concise and informative. - [x] The description explains in detail what this PR is about. - [x] I have linked a relevant issue or discussion. - [x] I have created tests covering the changes. - [ ] I have updated the documentation and checked the documentation preview. ### ⌛ Dependencies <!-- List all open PRs that this PR logically depends on. For example, --> <!-- - sagemath#12345: short description why this is a dependency --> <!-- - sagemath#34567: ... --> URL: sagemath#39186 Reported by: user202729 Reviewer(s): Tobias Diez
2 parents 707b58f + 0ed925b commit d8a4722

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

42 files changed

+334
-367
lines changed

‎src/doc/en/developer/coding_basics.rst‎

Lines changed: 3 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1114,12 +1114,10 @@ written.
11141114
The :ref:`doctest fixer <section-fixdoctests-optional-needs>` uses
11151115
tab stops at columns 48, 56, 64, ... for these tags.
11161116

1117-
- **Split long lines:** You may want to split long lines of code with a
1118-
backslash. Note: this syntax is non-standard and may be removed in the
1119-
future::
1117+
- **Split long lines:** Standard Python rules apply. For example::
11201118

1121-
sage: n = 123456789123456789123456789\
1122-
....: 123456789123456789123456789
1119+
sage: n = (123456789123456789123456789 +
1120+
....: 123456789123456789123456789)
11231121
sage: n.is_prime()
11241122
False
11251123

‎src/doc/en/thematic_tutorials/lie/branching_rules.rst‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -344,7 +344,7 @@ we could accomplish the branching in two steps, thus::
344344
sage: A1xA1 = WeylCharacterRing("A1xA1", style="coroots")
345345
sage: reps = [A3(fw) for fw in A3.fundamental_weights()]
346346
sage: [pi.branch(C2, rule="symmetric").branch(B2, rule="isomorphic"). \
347-
branch(D2, rule="extended").branch(A1xA1, rule="isomorphic") for pi in reps]
347+
....: branch(D2, rule="extended").branch(A1xA1, rule="isomorphic") for pi in reps]
348348
[A1xA1(1,0) + A1xA1(0,1), 2*A1xA1(0,0) + A1xA1(1,1), A1xA1(1,0) + A1xA1(0,1)]
349349

350350
As you can see, we've redone the branching rather circuitously this

‎src/doc/en/thematic_tutorials/lie/crystals.rst‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -741,7 +741,7 @@ irreducible crystal. We can make four such crystals::
741741
sage: C = crystals.Letters("A2")
742742
sage: T = crystals.TensorProduct(C,C,C)
743743
sage: [T1,T2,T3,T4] = \
744-
[crystals.TensorProduct(C,C,C,generators=[v]) for v in T.highest_weight_vectors()]
744+
....: [crystals.TensorProduct(C,C,C,generators=[v]) for v in T.highest_weight_vectors()]
745745
sage: [B.cardinality() for B in [T1,T2,T3,T4]]
746746
[10, 8, 8, 1]
747747
sage: [B.character(A2) for B in [T1,T2,T3,T4]]
@@ -754,7 +754,7 @@ We see that two of these crystals are isomorphic, with character
754754
sage: C = crystals.Letters("A2")
755755
sage: T = crystals.TensorProduct(C,C,C)
756756
sage: [T1,T2,T3,T4] = \
757-
[crystals.TensorProduct(C,C,C,generators=[v]) for v in T.highest_weight_vectors()]
757+
....: [crystals.TensorProduct(C,C,C,generators=[v]) for v in T.highest_weight_vectors()]
758758
sage: T1.plot()
759759
Graphics object consisting of 35 graphics primitives
760760
sage: T2.plot()

‎src/doc/en/thematic_tutorials/sandpile.rst‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1174,7 +1174,7 @@ dict (configuration)
11741174
EXAMPLES::
11751175

11761176
sage: g = {0:{},1:{0:1,3:1,4:1},2:{0:1,3:1,5:1}, \
1177-
3:{2:1,5:1},4:{1:1,3:1},5:{2:1,3:1}}
1177+
....: 3:{2:1,5:1},4:{1:1,3:1},5:{2:1,3:1}}
11781178
sage: S = Sandpile(g,0)
11791179
sage: S.burning_config()
11801180
{1: 2, 2: 0, 3: 1, 4: 1, 5: 0}
@@ -1226,7 +1226,7 @@ OUTPUT: dict
12261226
EXAMPLES::
12271227

12281228
sage: g = {0:{},1:{0:1,3:1,4:1},2:{0:1,3:1,5:1},\
1229-
3:{2:1,5:1},4:{1:1,3:1},5:{2:1,3:1}}
1229+
....: 3:{2:1,5:1},4:{1:1,3:1},5:{2:1,3:1}}
12301230
sage: S = Sandpile(g,0)
12311231
sage: S.burning_config()
12321232
{1: 2, 2: 0, 3: 1, 4: 1, 5: 0}

‎src/sage/coding/delsarte_bounds.py‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -490,7 +490,7 @@ def delsarte_bound_additive_hamming_space(n, d, q, d_star=1, q_base=0, return_da
490490
sage: codes.bounds.delsarte_bound_additive_hamming_space(11, 6, 2)
491491
3
492492
sage: a,p,val = codes.bounds.delsarte_bound_additive_hamming_space(\
493-
11, 6, 2, return_data=True)
493+
....: 11, 6, 2, return_data=True)
494494
sage: [j for i,j in p.get_values(a).items()]
495495
[1, 0, 0, 0, 0, 0, 5, 2, 0, 0, 0, 0]
496496
@@ -514,13 +514,13 @@ def delsarte_bound_additive_hamming_space(n, d, q, d_star=1, q_base=0, return_da
514514
TESTS::
515515
516516
sage: a,p,x = codes.bounds.delsarte_bound_additive_hamming_space(\
517-
19,15,7,return_data=True,isinteger=True)
517+
....: 19,15,7,return_data=True,isinteger=True)
518518
sage: [j for i,j in p.get_values(a).items()]
519519
[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 307, 0, 0, 1, 34]
520520
sage: codes.bounds.delsarte_bound_additive_hamming_space(19,15,7,solver='glpk')
521521
3
522522
sage: codes.bounds.delsarte_bound_additive_hamming_space(\
523-
19,15,7, isinteger=True, solver='glpk')
523+
....: 19,15,7, isinteger=True, solver='glpk')
524524
3
525525
"""
526526
from sage.numerical.mip import MIPSolverException

‎src/sage/coding/extended_code.py‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -134,8 +134,8 @@ def parity_check_matrix(self):
134134
EXAMPLES::
135135
136136
sage: C = LinearCode(matrix(GF(2),[[1,0,0,1,1],\
137-
[0,1,0,1,0],\
138-
[0,0,1,1,1]]))
137+
....: [0,1,0,1,0],\
138+
....: [0,0,1,1,1]]))
139139
sage: C.parity_check_matrix()
140140
[1 0 1 0 1]
141141
[0 1 0 1 1]
@@ -259,8 +259,8 @@ def generator_matrix(self):
259259
EXAMPLES::
260260
261261
sage: C = LinearCode(matrix(GF(2),[[1,0,0,1,1],\
262-
[0,1,0,1,0],\
263-
[0,0,1,1,1]]))
262+
....: [0,1,0,1,0],\
263+
....: [0,0,1,1,1]]))
264264
sage: Ce = codes.ExtendedCode(C)
265265
sage: E = codes.encoders.ExtendedCodeExtendedMatrixEncoder(Ce)
266266
sage: E.generator_matrix()

‎src/sage/coding/information_set_decoder.py‎

Lines changed: 12 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -157,10 +157,10 @@ def decode(self, r):
157157
EXAMPLES::
158158
159159
sage: M = matrix(GF(2), [[1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0],\
160-
[0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1],\
161-
[0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0],\
162-
[0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1],\
163-
[0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1]])
160+
....: [0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1],\
161+
....: [0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0],\
162+
....: [0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1],\
163+
....: [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1]])
164164
sage: C = codes.LinearCode(M)
165165
sage: from sage.coding.information_set_decoder import LeeBrickellISDAlgorithm
166166
sage: A = LeeBrickellISDAlgorithm(C, (2,2))
@@ -448,10 +448,10 @@ def decode(self, r):
448448
EXAMPLES::
449449
450450
sage: M = matrix(GF(2), [[1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0],\
451-
[0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1],\
452-
[0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0],\
453-
[0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1],\
454-
[0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1]])
451+
....: [0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1],\
452+
....: [0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0],\
453+
....: [0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1],\
454+
....: [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1]])
455455
sage: C = codes.LinearCode(M)
456456
sage: from sage.coding.information_set_decoder import LeeBrickellISDAlgorithm
457457
sage: A = LeeBrickellISDAlgorithm(C, (2,2))
@@ -929,10 +929,10 @@ def decode_to_code(self, r):
929929
EXAMPLES::
930930
931931
sage: M = matrix(GF(2), [[1,0,0,0,0,0,1,0,1,0,1,1,0,0,1],\
932-
[0,1,0,0,0,1,1,1,1,0,0,0,0,1,1],\
933-
[0,0,1,0,0,0,0,1,0,1,1,1,1,1,0],\
934-
[0,0,0,1,0,0,1,0,1,0,0,0,1,1,0],\
935-
[0,0,0,0,1,0,0,0,1,0,1,1,0,1,0]])
932+
....: [0,1,0,0,0,1,1,1,1,0,0,0,0,1,1],\
933+
....: [0,0,1,0,0,0,0,1,0,1,1,1,1,1,0],\
934+
....: [0,0,0,1,0,0,1,0,1,0,0,0,1,1,0],\
935+
....: [0,0,0,0,1,0,0,0,1,0,1,1,0,1,0]])
936936
sage: C = LinearCode(M)
937937
sage: c = C.random_element()
938938
sage: Chan = channels.StaticErrorRateChannel(C.ambient_space(), 2)

‎src/sage/coding/linear_code.py‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -66,8 +66,8 @@ class should inherit from this class. Also ``AbstractLinearCode`` should never
6666
A ``LinearCode`` is instantiated by providing a generator matrix::
6767
6868
sage: M = matrix(GF(2), [[1, 0, 0, 1, 0],\
69-
[0, 1, 0, 1, 1],\
70-
[0, 0, 1, 1, 1]])
69+
....: [0, 1, 0, 1, 1],\
70+
....: [0, 0, 1, 1, 1]])
7171
sage: C = codes.LinearCode(M)
7272
sage: C
7373
[5, 3] linear code over GF(2)

‎src/sage/coding/linear_code_no_metric.py‎

Lines changed: 23 additions & 23 deletions
Original file line numberDiff line numberDiff line change
@@ -525,7 +525,7 @@ def systematic_generator_matrix(self, systematic_positions=None):
525525
EXAMPLES::
526526
527527
sage: G = matrix(GF(3), [[ 1, 2, 1, 0],\
528-
[ 2, 1, 1, 1]])
528+
....: [ 2, 1, 1, 1]])
529529
sage: C = LinearCode(G)
530530
sage: C.generator_matrix()
531531
[1 2 1 0]
@@ -577,8 +577,8 @@ def standard_form(self, return_permutation=True):
577577
sage: Cs is C
578578
True
579579
sage: C = LinearCode(matrix(GF(2), [[1,0,0,0,1,1,0],\
580-
[0,1,0,1,0,1,0],\
581-
[0,0,0,0,0,0,1]]))
580+
....: [0,1,0,1,0,1,0],\
581+
....: [0,0,0,0,0,0,1]]))
582582
sage: Cs, p = C.standard_form()
583583
sage: p
584584
[1, 2, 7, 3, 4, 5, 6]
@@ -627,7 +627,7 @@ def redundancy_matrix(self):
627627
[1 1 0]
628628
[1 1 1]
629629
sage: C = LinearCode(matrix(GF(3),2,[1,2,0,\
630-
2,1,1]))
630+
....: 2,1,1]))
631631
sage: C.systematic_generator_matrix()
632632
[1 2 0]
633633
[0 0 1]
@@ -1053,9 +1053,9 @@ class LinearCodeSystematicEncoder(Encoder):
10531053
10541054
sage: LCSE = codes.encoders.LinearCodeSystematicEncoder
10551055
sage: G = Matrix(GF(2), [[1,1,1,0,0,0,0,0],\
1056-
[1,0,0,1,1,0,0,0],\
1057-
[0,1,0,1,0,1,0,0],\
1058-
[1,1,0,1,0,0,1,1]])
1056+
....: [1,0,0,1,1,0,0,0],\
1057+
....: [0,1,0,1,0,1,0,0],\
1058+
....: [1,1,0,1,0,0,1,1]])
10591059
sage: C = LinearCode(G)
10601060
sage: E = LCSE(C)
10611061
sage: E.generator_matrix()
@@ -1207,9 +1207,9 @@ def generator_matrix(self):
12071207
12081208
sage: LCSE = codes.encoders.LinearCodeSystematicEncoder
12091209
sage: G = Matrix(GF(2), [[1,1,1,0,0,0,0],\
1210-
[1,0,0,1,1,0,0],\
1211-
[0,1,0,1,0,1,0],\
1212-
[1,1,0,1,0,0,1]])
1210+
....: [1,0,0,1,1,0,0],\
1211+
....: [0,1,0,1,0,1,0],\
1212+
....: [1,1,0,1,0,0,1]])
12131213
sage: C = LinearCode(G)
12141214
sage: E = LCSE(C)
12151215
sage: E.generator_matrix()
@@ -1230,9 +1230,9 @@ def generator_matrix(self):
12301230
Another example where there is no generator matrix of the form `[I \vert H]`::
12311231
12321232
sage: G = Matrix(GF(2), [[1,1,0,0,1,0,1],\
1233-
[1,1,0,0,1,0,0],\
1234-
[0,0,1,0,0,1,0],\
1235-
[0,0,1,0,1,0,1]])
1233+
....: [1,1,0,0,1,0,0],\
1234+
....: [0,0,1,0,0,1,0],\
1235+
....: [0,0,1,0,1,0,1]])
12361236
sage: C = LinearCode(G)
12371237
sage: E = LCSE(C)
12381238
sage: E.generator_matrix()
@@ -1277,8 +1277,8 @@ def systematic_permutation(self):
12771277
EXAMPLES::
12781278
12791279
sage: C = LinearCode(matrix(GF(2), [[1,0,0,0,1,1,0],\
1280-
[0,1,0,1,0,1,0],\
1281-
[0,0,0,0,0,0,1]]))
1280+
....: [0,1,0,1,0,1,0],\
1281+
....: [0,0,0,0,0,0,1]]))
12821282
sage: E = codes.encoders.LinearCodeSystematicEncoder(C)
12831283
sage: E.systematic_positions()
12841284
(0, 1, 6)
@@ -1309,9 +1309,9 @@ def systematic_positions(self):
13091309
13101310
sage: LCSE = codes.encoders.LinearCodeSystematicEncoder
13111311
sage: G = Matrix(GF(2), [[1,1,1,0,0,0,0],\
1312-
[1,0,0,1,1,0,0],\
1313-
[0,1,0,1,0,1,0],\
1314-
[1,1,0,1,0,0,1]])
1312+
....: [1,0,0,1,1,0,0],\
1313+
....: [0,1,0,1,0,1,0],\
1314+
....: [1,1,0,1,0,0,1]])
13151315
sage: C = LinearCode(G)
13161316
sage: E = LCSE(C)
13171317
sage: E.systematic_positions()
@@ -1320,9 +1320,9 @@ def systematic_positions(self):
13201320
We take another matrix with a less nice shape::
13211321
13221322
sage: G = Matrix(GF(2), [[1,1,0,0,1,0,1],\
1323-
[1,1,0,0,1,0,0],\
1324-
[0,0,1,0,0,1,0],\
1325-
[0,0,1,0,1,0,1]])
1323+
....: [1,1,0,0,1,0,0],\
1324+
....: [0,0,1,0,0,1,0],\
1325+
....: [0,0,1,0,1,0,1]])
13261326
sage: C = LinearCode(G)
13271327
sage: E = LCSE(C)
13281328
sage: E.systematic_positions()
@@ -1343,8 +1343,8 @@ def systematic_positions(self):
13431343
positions (even if another choice might also be systematic)::
13441344
13451345
sage: G = Matrix(GF(2), [[1,0,0,0],\
1346-
[0,1,0,0],\
1347-
[0,0,1,1]])
1346+
....: [0,1,0,0],\
1347+
....: [0,0,1,1]])
13481348
sage: C = LinearCode(G)
13491349
sage: E = LCSE(C, systematic_positions=[0,1,3])
13501350
sage: E.systematic_positions()

‎src/sage/combinat/designs/gen_quadrangles_with_spread.pyx‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -267,7 +267,7 @@ def generalised_quadrangle_hermitian_with_ovoid(const int q):
267267
TESTS::
268268
269269
sage: from sage.combinat.designs.gen_quadrangles_with_spread import \
270-
is_GQ_with_spread, dual_GQ_ovoid
270+
....: is_GQ_with_spread, dual_GQ_ovoid
271271
sage: t = designs.generalised_quadrangle_hermitian_with_ovoid(3)
272272
sage: t = dual_GQ_ovoid(*t)
273273
sage: is_GQ_with_spread(*t, s=3, t=9)

0 commit comments

Comments
 (0)