allow skipping is_transitively_reduced - #42578
Open
mantepse wants to merge 2 commits into
Open
Annotations
2 errors and 11 warnings
|
Test
Process completed with exit code 4.
|
|
Test:
src/sage/coding/linear_code.py#L0
sage: M = matrix(GF(2), [[1, 0, 0, 1, 0],\
....: [0, 1, 0, 1, 1],\
....: [0, 0, 1, 1, 1]]) ## line 68 ##
sage: C = codes.LinearCode(M) ## line 71 ##
sage: C ## line 72 ##
[5, 3] linear code over GF(2)
sage: C.generator_matrix() ## line 74 ##
[1 0 0 1 0]
[0 1 0 1 1]
[0 0 1 1 1]
sage: MS = MatrixSpace(GF(2),4,7) ## line 79 ##
sage: G = MS([[1,1,1,0,0,0,0], [1,0,0,1,1,0,0], [0,1,0,1,0,1,0], [1,1,0,1,0,0,1]]) ## line 80 ##
sage: C = LinearCode(G) ## line 81 ##
sage: C.basis() ## line 82 ##
[(1, 0, 0, 0, 0, 1, 1),
(0, 1, 0, 0, 1, 0, 1),
(0, 0, 1, 0, 1, 1, 0),
(0, 0, 0, 1, 1, 1, 1)]
sage: c = C.basis()[1] ## line 87 ##
sage: c in C ## line 88 ##
True
sage: c.nonzero_positions() ## line 90 ##
[1, 4, 6]
sage: c.support() ## line 92 ##
[1, 4, 6]
sage: c.parent() ## line 94 ##
Vector space of dimension 7 over Finite Field of size 2
sage: MS = MatrixSpace(GF(2),4,7) ## line 187 ##
sage: G = MS([[1,1,1,0,0,0,0], [1,0,0,1,1,0,0], [0,1,0,1,0,1,0], [1,1,0,1,0,0,1]]) ## line 188 ##
sage: C = LinearCode(G) ## line 189 ##
sage: C == loads(dumps(C)) ## line 190 ##
True
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 192 ##
0
sage: C = codes.HammingCode(GF(2), 3); C ## line 257 ##
[7, 4] Hamming Code over GF(2)
sage: file_loc = sage.coding.linear_code._dump_code_in_leon_format(C) ## line 259 ##
sage: f = open(file_loc); print(f.read()) ## line 260 ##
LIBRARY code;
code=seq(2,4,7,seq(
1,0,0,0,0,1,1,
0,1,0,0,1,0,1,
0,0,1,0,1,1,0,
0,0,0,1,1,1,1
));
FINISH;
sage: f.close() ## line 269 ##
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 270 ##
0
sage: class MyCodeFamily(sage.coding.linear_code.AbstractLinearCode):
....: def __init__(self, field, length, dimension, generator_matrix):
....: super().__init__(field, length,
....: "GeneratorMatrix", "Syndrome")
....: self._dimension = dimension
....: self._generator_matrix = generator_matrix
....: def generator_matrix(self):
....: return self._generator_matrix
....: def _repr_(self):
....: return "[%d, %d] dummy code over GF(%s)" % (self.length(), self.dimension(), self.base_field().cardinality()) ## line 370 ##
sage: generator_matrix = matrix(GF(17), 5, 10,
....: {(i,i):1 for i in range(5)}) ## line 383 ##
sage: C = MyCodeFamily(GF(17), 10, 5, generator_matrix) ## line 385 ##
sage: C ## line 389 ##
[10, 5] dummy code over GF(17)
sage: C.parent() ## line 394 ##
<class '__main__.MyCodeFamily_with_category'>
sage: C.category() ## line 396 ##
Category of facade finite dimensional vector spaces with basis over Finite Field of size 17
sage: C.minimum_distance() # needs sage.libs.gap ## line 401 ##
1
sage: C.is_self_orthogonal() ## line 403 ##
False
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 407 ##
0
sage: C = codes.HammingCode(GF(2), 3) ## line 427 ##
sage: C.an_element() ## line 428 ##
(1, 0, 0, 0, 0, 1, 1)
sage: C2 = C.cartesian_product(C) ## line 430 ##
sage: C2.an_element() ## line 431 ##
((1, 0, 0, 0, 0, 1, 1), (1, 0, 0, 0, 0, 1, 1))
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 433 ##
0
sage: libgap.set_seed(0) ## line 462 ##
0
sage: C = codes.HammingCode(GF(4, 'z'), 3) ## line 464 ##
sage: C.automorphism_group_gens() ## line 465 ##
([((1, 1, 1, z, z + 1, 1, 1, 1, 1, z + 1, z, z, z + 1, z + 1, z + 1, 1, z + 1, z, z, 1, z); (1,13,14,20)(2,21,8,18,7,16,19,15)(3,10,5,12,17,9,6,4), Ring endomorphism of Finite Field in z of size 2^2
Defn: z |--> z + 1),
((z, 1, z, z, z, z + 1, z, z, z, z, z, z, z + 1, z, z, z, z, z + 1, z, z, z); (1,11,5,12,3,19)(2,8)(6,18,13)(7,17,15)(9,10,14,16,20,21), Ring endomorphism of Finite Field in z of size 2^2
Defn: z |--> z + 1),
((z, z, z, z, z, z, z, z, z, z, z, z, z, z, z, z, z, z, z, z, z); (), Ring endomorphism of Finite Field in z of size 2^2
Defn: z |--> z)],
362880)
sage: C.automorphism_group_gens(equivalence='linear') ## line 481 ##
([((z, 1, z + 1, z + 1, 1, z + 1
|
|
Complete job
Node.js 20 is deprecated. The following actions target Node.js 20 but are being forced to run on Node.js 24: hendrikmuhs/ccache-action@v1.2. For more information see: https://github.blog/changelog/2025-09-19-deprecation-of-node-20-on-github-actions-runners/
|
|
Test:
src/sage/graphs/connectivity.pyx#L3204
slow doctest:: Test ran for 5.35s cpu, 5.22s wall
Check ran for 0.00s cpu, 0.00s wall
|
|
Test:
src/sage/graphs/connectivity.pyx#L1888
slow doctest:: Test ran for 5.84s cpu, 5.93s wall
Check ran for 0.00s cpu, 0.00s wall
|
|
Test:
src/sage/functions/orthogonal_polys.py#L2295
slow doctest:: Test ran for 7.59s cpu, 7.60s wall
Check ran for 0.00s cpu, 0.00s wall
|
|
Test:
src/sage/functions/hypergeometric_algebraic.py#L1685
slow doctest:: Test ran for 6.31s cpu, 6.39s wall
Check ran for 0.00s cpu, 0.00s wall
|
|
Test:
src/sage/functions/hypergeometric_algebraic.py#L1683
slow doctest:: Test ran for 5.07s cpu, 5.08s wall
Check ran for 0.00s cpu, 0.00s wall
|
|
Test:
src/doc/ja/a_tour_of_sage/index.rst#L86
slow doctest:: Test ran for 6.13s cpu, 4.63s wall
Check ran for 0.00s cpu, 0.00s wall
|
|
Test:
src/doc/it/a_tour_of_sage/index.rst#L81
slow doctest:: Test ran for 6.90s cpu, 5.37s wall
Check ran for 0.00s cpu, 0.00s wall
|
|
Test:
src/doc/es/a_tour_of_sage/index.rst#L84
slow doctest:: Test ran for 5.87s cpu, 4.45s wall
Check ran for 0.00s cpu, 0.00s wall
|
|
Test:
src/doc/de/a_tour_of_sage/index.rst#L108
slow doctest:: Test ran for 5.25s cpu, 4.35s wall
Check ran for 0.00s cpu, 0.00s wall
|
|
Test:
src/doc/el/a_tour_of_sage/index.rst#L85
slow doctest:: Test ran for 6.01s cpu, 2.73s wall
Check ran for 0.00s cpu, 0.00s wall
|
background
wait
wait-all
cancel
parallel
Loading