passagemath-gap 10.5.43__cp310-cp310-macosx_14_0_arm64.whl → 10.6.1rc1__cp310-cp310-macosx_14_0_arm64.whl

{passagemath_gap-10.5.43.dist-info → passagemath_gap-10.6.1rc1.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-gap
-Version: 10.5.43
+Version: 10.6.1rc1
 Summary: passagemath: Computational Group Theory with GAP
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -19,19 +19,18 @@ Classifier: Intended Audience :: Science/Research
 Classifier: Operating System :: POSIX
 Classifier: Operating System :: MacOS :: MacOS X
 Classifier: Programming Language :: Python :: 3 :: Only
-Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
-Requires-Python: <3.14,>=3.9
+Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
 Requires-Dist: cysignals!=1.12.0,>=1.11.2
 Requires-Dist: memory_allocator
-Requires-Dist: passagemath-environment~=10.5.43.0
-Requires-Dist: passagemath-categories~=10.5.43.0
+Requires-Dist: passagemath-environment==10.6.1rc1
+Requires-Dist: passagemath-categories==10.6.1rc1
 Provides-Extra: test
 Requires-Dist: passagemath-repl; extra == "test"
 
@@ -76,7 +75,7 @@ passagemath attempts to support all major Linux distributions and recent version
 macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
 virtualization.
 
-Complete sets of binary wheels are provided on PyPI for Python versions 3.9.x-3.12.x.
+Complete sets of binary wheels are provided on PyPI for Python versions 3.10.x-3.13.x.
 Python 3.13.x is also supported, but some third-party packages are still missing wheels,
 so compilation from source is triggered for those.
 

{passagemath_gap-10.5.43.dist-info → passagemath_gap-10.6.1rc1.dist-info}/METADATA.bak

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-gap
-Version: 10.5.43
+Version: 10.6.1rc1
 Summary: passagemath: Computational Group Theory with GAP
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -19,20 +19,19 @@ Classifier: Intended Audience :: Science/Research
 Classifier: Operating System :: POSIX
 Classifier: Operating System :: MacOS :: MacOS X
 Classifier: Programming Language :: Python :: 3 :: Only
-Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
-Requires-Python: <3.14,>=3.9
+Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
 Requires-Dist: cysignals!=1.12.0,>=1.11.2
 Requires-Dist: memory_allocator
-Requires-Dist: passagemath-conf~=10.5.43.0
-Requires-Dist: passagemath-environment~=10.5.43.0
-Requires-Dist: passagemath-categories~=10.5.43.0
+Requires-Dist: passagemath-conf==10.6.1rc1
+Requires-Dist: passagemath-environment==10.6.1rc1
+Requires-Dist: passagemath-categories==10.6.1rc1
 Provides-Extra: test
 Requires-Dist: passagemath-repl; extra == "test"
 
@@ -77,7 +76,7 @@ passagemath attempts to support all major Linux distributions and recent version
 macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
 virtualization.
 
-Complete sets of binary wheels are provided on PyPI for Python versions 3.9.x-3.12.x.
+Complete sets of binary wheels are provided on PyPI for Python versions 3.10.x-3.13.x.
 Python 3.13.x is also supported, but some third-party packages are still missing wheels,
 so compilation from source is triggered for those.
 

{passagemath_gap-10.5.43.dist-info → passagemath_gap-10.6.1rc1.dist-info}/RECORD

@@ -1,11 +1,11 @@
 passagemath_gap.dylibs/libreadline.8.2.dylib,sha256=gMjzPdDup0edmSYMOcb8CM5iODcwCzM9XROsVV_tJ_I,312608
-passagemath_gap.dylibs/libgap.9.dylib,sha256=W_ZTT1nmD2yJSV7NvONoWaSkmmMhfsrz8TG66KpAuzg,2475408
+passagemath_gap.dylibs/libgap.9.dylib,sha256=-Tp0GHPIgvbchlCWAW6uWSqYobwNODAcEzS4RDiD7Ik,2475408
 passagemath_gap.dylibs/libgmp.10.dylib,sha256=B7ReWYn6LgAnERoGBg2WlT0gFhJFVgBkW4i7UNz7Vg0,464688
 gap/CITATION,sha256=MnPKDTe9tpRqVXgjpptKgFLPWoV7Ottj9MHEMJgvd8E,2106
 gap/LICENSE,sha256=gXf5dRMhNSbfLPYYTY_5hsZ1r7UU1OaKQEAQUhuIBkM,18092
 gap/INSTALL.md,sha256=6mu89qCZoDyakSrB6NS8Y9ch59Cnx22jQQWgOtQqIRM,26518
 gap/README.md,sha256=uQAfvPpWvNmFGCO0p_fcJnjz8hU0KG0O3fgWM1ZSBZo,6555
-gap/gap,sha256=VZrOeNu5rGnLJpcVIrG6xZuildhrcAQLC-B07zYlX74,52032
+gap/gap,sha256=N_3LMMpBgyGpyjHo1xdCZfq-D2tyBqh5k3u8KxGEKvk,52032
 gap/CONTRIBUTING.md,sha256=ETeQXP8shqpBa8kjFQ-P-PatuJ09OX3J4fEI9hbGTAk,9576
 gap/COPYRIGHT,sha256=xS8Dkc5sFfgcrgVXoN6KtpNtDKLV4VAXnbcQEsbpwWw,2854
 gap/sysinfo.gap,sha256=2u7oz67BRBHxRnEYvDYI-eZyt4fkZP03YMgDwC4YCHw,2581
@@ -10478,21 +10478,21 @@ gap/pkg/ctbllib/doc2/ctblcons18.png,sha256=8X6PO82PlIlmJryxn5ux_44UqVZz0djE5QrZQ
 gap/pkg/ctbllib/doc2/ctocenex2.png,sha256=k6VZQ4yBdR4L-C6hY7fWAP3B2XMm4RSEnWhFx66WweU,1504
 gap/pkg/ctbllib/doc2/chapInd_mj.html,sha256=dmd_hWTMRRBWQg2qDj3bTSsBzUv_gqg73HwtGFNnv0o,2613
 gap/pkg/ctbllib/doc2/chooser.html,sha256=ZBwBn_4DujhjpNNtb5qCsU4zHcH6hiXQcDOnK2AIpnw,3886
-passagemath_gap-10.5.43.dist-info/RECORD,,
-passagemath_gap-10.5.43.dist-info/METADATA.bak,sha256=zlLCNhzxly9PGy0xdUZoWC67jCldegXl3tnvJeIQrlo,5209
-passagemath_gap-10.5.43.dist-info/WHEEL,sha256=BY2G-e9pCnwWPELNk7GCw-k-0y7AcCiRrhf_nAfhQVk,136
-passagemath_gap-10.5.43.dist-info/top_level.txt,sha256=Kmzulf9WsphADFQuqgvdy5mvTLDj_V2zkFHU2s3UXos,6
-passagemath_gap-10.5.43.dist-info/METADATA,sha256=79Y3LO9yBG-01OCUUZ8KXog1-QZCUknRLEabsFYJbAo,5166
+passagemath_gap-10.6.1rc1.dist-info/RECORD,,
+passagemath_gap-10.6.1rc1.dist-info/METADATA.bak,sha256=YNb1NI2ePeCev1mPQIHh1NPC8RKGgflrqzotcCDkbT0,5163
+passagemath_gap-10.6.1rc1.dist-info/WHEEL,sha256=BY2G-e9pCnwWPELNk7GCw-k-0y7AcCiRrhf_nAfhQVk,136
+passagemath_gap-10.6.1rc1.dist-info/top_level.txt,sha256=Kmzulf9WsphADFQuqgvdy5mvTLDj_V2zkFHU2s3UXos,6
+passagemath_gap-10.6.1rc1.dist-info/METADATA,sha256=y6_bPA6FDKUDZAWkBhu1ohVhRahFwO6bwilYVCKsjys,5120
 sage/all__sagemath_gap.py,sha256=RMuy5dc4uE3eazyDuyWx8iiZnxlbpuU4Kn1S-_RgNgA,593
-sage/combinat/enumeration_mod_permgroup.pyx,sha256=ZLeehu3ACXydKZQs-tzo5lgcodJY09u3jEOIT4odR84,9990
-sage/combinat/enumeration_mod_permgroup.cpython-310-darwin.so,sha256=-I54iy8clfEoq97ZfCMCTFvTJiLUNw4PJZMtqFYomXU,135088
+sage/combinat/enumeration_mod_permgroup.pyx,sha256=JfO8wrPfkjMsudy-7y8-ottLuxT0be0wPIjy3_YHU6I,9989
+sage/combinat/enumeration_mod_permgroup.cpython-310-darwin.so,sha256=NMq5ucJr4XhJmOxcw9B9suTudvCFUirlETb73Ncstww,135104
 sage/combinat/all__sagemath_gap.py,sha256=Tzpetos0ih-3KeCyjXrlRL8IHaMKehOTYLKYbpM_g8w,42
 sage/combinat/enumeration_mod_permgroup.pxd,sha256=1MzkJhWyxuKGTb8Q_V0qr1Zlm8S8tuYbFqvXCQLfMug,587
 sage/combinat/root_system/reflection_group_element.pyx,sha256=NVKjj24WPnEeUKD13q8w_ujw5lyL7oOodxwp5Q1JgVA,45463
-sage/combinat/root_system/reflection_group_c.cpython-310-darwin.so,sha256=BxG9mt7SmG57HYzAFBk4Ijo7gGmaNmrdecPB8cSvZjI,225568
-sage/combinat/root_system/reflection_group_element.cpython-310-darwin.so,sha256=lWVkhbgMq_ISWk4CYtcTaBggaM4bkUksMDXBYMGnWEw,289152
-sage/combinat/root_system/weyl_group.py,sha256=BC_MXAMtKQGtTiXS2AMXf7jyicJXs-29jG1APxe_ouQ,46106
-sage/combinat/root_system/reflection_group_complex.py,sha256=Dnx1uwa_BbihXX9DlO6KdaF6JMC9fx7pgmQpl9LKgo4,84377
+sage/combinat/root_system/reflection_group_c.cpython-310-darwin.so,sha256=h3iVS5eBP83nDClEcfiPjwmpiSUZRAjIFe2JnjoBTGk,225568
+sage/combinat/root_system/reflection_group_element.cpython-310-darwin.so,sha256=BZ5YOX7PjD616MFFi6tmmZaYMN3pdIhZTEdkdgT1YvU,289152
+sage/combinat/root_system/weyl_group.py,sha256=BeX9e-3KmjlF-_7cVNeDOM3VyCXn9jYUJGV8CSjPRwA,46122
+sage/combinat/root_system/reflection_group_complex.py,sha256=lBgJQ_or2L0moL8PE_bTYBfd1zr725_eP1018PtAnvw,84327
 sage/combinat/root_system/all__sagemath_gap.py,sha256=Tzpetos0ih-3KeCyjXrlRL8IHaMKehOTYLKYbpM_g8w,42
 sage/combinat/root_system/reflection_group_c.pyx,sha256=dgpfjw6tgw-ojmk3IvHHnrDqu1wVx52yfLkH-0XwCu0,21861
 sage/combinat/root_system/reflection_group_element.pxd,sha256=1RVx6VLkhNGSC0iv_vWePsQXWeEqjjz8rQ4F-k0Mm8M,552
@@ -10503,9 +10503,9 @@ sage/ext_data/gap/sage.g,sha256=g38h92MCy3q3Wq6uTfQNzftx0pvKs7W5cbLrDQXStnw,4533
 sage/ext_data/gap/joyner/hurwitz_crv_rr_sp.gap,sha256=7KiCCji_Z2nCxceABiCiZ2mTk9pH2Uv0msAYvV8vsAw,9286
 sage/ext_data/gap/joyner/modular_crv_rr_sp.gap,sha256=WC_XUFN8Bh-rUin5BA_UlZDLtxR8qJRWAKnzSeSYz58,7030
 sage/groups/libgap_mixin.py,sha256=xwgYFNYA1OuPGihXJeT0hPH1sjsT446KC_4yQZv-j-s,31759
-sage/groups/class_function.py,sha256=-czKiHU_PZfW2fc-itBBoOEdxX-9e4vAZC_hgjeneNM,48648
-sage/groups/libgap_wrapper.pyx,sha256=tDgmlzl-EGycsI3k7zZ6OlqFkfqihQrqPkdGShm6pAM,23501
-sage/groups/libgap_wrapper.cpython-310-darwin.so,sha256=WcBFdNwJop8WmT6dUQ6qO2E7jWC9AosjD82mlLXwFP4,253680
+sage/groups/class_function.py,sha256=NjISnnM2eQntPYpzspbzkPhg0uVoPm0rA7RmBPNFB5A,48599
+sage/groups/libgap_wrapper.pyx,sha256=rlSD90ziIzyJqgZyXarJdpT6zT7joHSTDm-hP4k7Vi8,23510
+sage/groups/libgap_wrapper.cpython-310-darwin.so,sha256=wzmfoRHTZ9maVetNMjaR7SpBLwsVQw6NSnA7UifOTQI,272112
 sage/groups/libgap_morphism.py,sha256=aNIDzJUqYRQBAXfv3V0sOidbiicl0-4A6h_oxtoLU_w,27860
 sage/groups/all__sagemath_gap.py,sha256=0jMNQaDJCB91-B5Vb42YjN2ZS0J92UMejcEq9B_ALuM,348
 sage/groups/galois_group_perm.py,sha256=U8o3hNZYw1iVR2jPgOtjsre8T9VoUqXtLE7on-VmKFg,7668
@@ -10514,18 +10514,18 @@ sage/groups/libgap_wrapper.pxd,sha256=3GN4VL7SbZGZR4Lx_hyv_drcBH32XnO2VvWc2yqB3k
 sage/groups/conjugacy_classes.py,sha256=IlA9emEBpGi8oremSwjeKUkSSreqUE-XiqlZHaWgxis,17014
 sage/groups/perm_gps/symgp_conjugacy_class.py,sha256=zxgZ8ctHn0hWYyAYMMG_9T2EtmSWcNMj09xGViXpAMw,12272
 sage/groups/perm_gps/permgroup_morphism.py,sha256=MOk3UQZyu9zuIbZI6cNx_9njP50Q6dWmXzFG2OHmU8k,11589
-sage/groups/perm_gps/permgroup.py,sha256=O0MCoYfHUfNqh2RyPgb4p9JnGHwnvKgfkRhdUlSThcA,198883
+sage/groups/perm_gps/permgroup.py,sha256=qFujAsEGjkHpd51zMAh_LmMU0nWSsCm2dPipVV08SxA,197753
 sage/groups/perm_gps/cubegroup.py,sha256=JhDtdlR1X5vMeNpeZ7JkUFjycA23mETDqIsPhdZXhY0,59382
 sage/groups/perm_gps/constructor.py,sha256=DIPRBoKlEm_8V66EBaVydJknCWw83ejMwvZd2oBrUSw,9055
 sage/groups/perm_gps/permutation_groups_catalog.py,sha256=nBJCF8Ci2a4IX7fw3gabqzpOJGdRZyO0I4A2WRjtEY8,1272
 sage/groups/perm_gps/permgroup_named.py,sha256=u46E5qd97WjPB7pI_TAE7flElNX2cDho3Rz2sg_lsmY,119818
 sage/groups/perm_gps/all.py,sha256=iDGHouhuDklSyispK95tIYUecqKrjPgjZeexTOJ_If0,1428
 sage/groups/perm_gps/permgroup_element.pxd,sha256=vKhO951GtbTnqDTGEeOndLsvCni3KSx1QBRKInC-xAc,1347
-sage/groups/perm_gps/permgroup_element.pyx,sha256=TAvbnXevK8_o84Z8GeYSkiH5m3K9qsnracP4-9zJOrM,69856
-sage/groups/perm_gps/permgroup_element.cpython-310-darwin.so,sha256=s32MnRwm6ELgTnINZYsbDjhsZSKbo57YlSVi__jPrw4,399600
+sage/groups/perm_gps/permgroup_element.pyx,sha256=Lf5qdlDjsfy_Jq9tlI2_L-5ZQEYVTsyekvg-3uYtxcY,70445
+sage/groups/perm_gps/permgroup_element.cpython-310-darwin.so,sha256=hajfWG8kQjBlnHez-pYfFdqWoA1hGc3xQIxlL_afhsk,418224
 sage/groups/perm_gps/partn_ref/all__sagemath_gap.py,sha256=Tzpetos0ih-3KeCyjXrlRL8IHaMKehOTYLKYbpM_g8w,42
 sage/groups/perm_gps/partn_ref2/refinement_generic.pyx,sha256=NyOI48ggOkTSfNz56lUx3Z1eK65UZZRNXV9ku98u9fg,38135
-sage/groups/perm_gps/partn_ref2/refinement_generic.cpython-310-darwin.so,sha256=2KRK3PfLbiQfgq0rfEaiOVvCQnYlYqr_cV3n-3tibLY,188720
+sage/groups/perm_gps/partn_ref2/refinement_generic.cpython-310-darwin.so,sha256=aUQ8l5drYL7jDx2bIaW1D-p7zEDN8A8O5IKpYdTlwHA,188720
 sage/groups/perm_gps/partn_ref2/refinement_generic.h,sha256=38tsIbqXuLaEiAPSW-obee7Nx1ztC-dAchuPir1jHtI,1112
 sage/groups/perm_gps/partn_ref2/all.py,sha256=Tzpetos0ih-3KeCyjXrlRL8IHaMKehOTYLKYbpM_g8w,42
 sage/groups/perm_gps/partn_ref2/refinement_generic.pxd,sha256=PBlntyHTRNvKW00ec728ay4w2Z0uAXskzrHqwbm7wC0,3836
@@ -10535,12 +10535,12 @@ sage/groups/abelian_gps/abelian_group_morphism.py,sha256=G3MNt9F7iOPbcd-yfHg6Dnv
 sage/groups/abelian_gps/all__sagemath_gap.py,sha256=ouqkntfIYCrgSyLg4UODAVrKGj3mJRn17a6gsKaFNJM,201
 sage/groups/matrix_gps/orthogonal_gap.py,sha256=gdu4dopyxM7Q6zdGI-sczmbz31pC96Dbu4WWr0OX8f0,4328
 sage/groups/matrix_gps/unitary_gap.py,sha256=aIwWF1LmpX1PXL1LDMV-hLHtwUJrXFrkC1pfoZYZjOE,2296
-sage/groups/matrix_gps/binary_dihedral.py,sha256=ohXLkTpOGdH7cYsME2MOHFGoqjhVxLB-a0Zt0sMojxY,3939
+sage/groups/matrix_gps/binary_dihedral.py,sha256=D_X_BZer4cwZebflHlMl8njPlhd-otuilPYjKNHMceI,3937
 sage/groups/matrix_gps/isometries.py,sha256=1jm8St4iPIm_r8tYmoRtafclTF2cVOkAYrZoxohrrSE,15821
 sage/groups/matrix_gps/finitely_generated_gap.py,sha256=KUP5YMIp_43DOLA9y--zaB0sGrKjHiwas7UvvnPDX30,39337
 sage/groups/matrix_gps/linear_gap.py,sha256=voHn-cH6SHAhIzLFTmg7yDr1wjkVvCoGl8_8CIJculg,789
 sage/groups/matrix_gps/named_group_gap.py,sha256=qHQY-xRmkt_gjLceQpn2GqRih4gl9VgAr5V442WaJvs,2154
-sage/groups/matrix_gps/group_element_gap.cpython-310-darwin.so,sha256=s8KRhXbmGt4DKABRVvBmbTyj6N7vv2ouOFJTLffhJJo,186496
+sage/groups/matrix_gps/group_element_gap.cpython-310-darwin.so,sha256=k2CUAG11mYxsOhzUzyVH7VEjQQPCAh4LzmDFDE_xppw,204944
 sage/groups/matrix_gps/group_element_gap.pxd,sha256=LN2A5zqKkzMBfC8gu7bQ-JrVfuHvt_-CntE2m8mb4A8,220
 sage/groups/matrix_gps/group_element_gap.pyx,sha256=l_1EdHz1xMaTmaB3pfBB5ai3SQC9S96-xOn0yztiE9E,13282
 sage/groups/matrix_gps/heisenberg.py,sha256=QpHMsIuUbLvvExGn0OPxp-2nGFuKUBsVP4wAne8nBjg,8274
@@ -10558,34 +10558,34 @@ sage/libs/gap/all.py,sha256=Tzpetos0ih-3KeCyjXrlRL8IHaMKehOTYLKYbpM_g8w,42
 sage/libs/gap/test.py,sha256=u9dmPL-NFNYcump22uL_I3goylGOw6rK0-Ctk9f1gb4,671
 sage/libs/gap/operations.py,sha256=pjGCr4wukT0F3lIbBnmZ3XJO4ufIKeIslxWjDFgVWoc,3616
 sage/libs/gap/context_managers.py,sha256=w6MOfJFgtijEDT77aJJ5bFfHV5wbPVN42BOW04KBL1A,3319
-sage/libs/gap/element.cpython-310-darwin.so,sha256=YUTZSLwGl5lCUmNigO9f2WtAkqdqtC3m19pkCK3UT2E,465024
+sage/libs/gap/element.cpython-310-darwin.so,sha256=2BzaN8rA1AZXfKR-93ofilvppBXkfTeRhgphB9yUMTA,465040
 sage/libs/gap/sage.gaprc,sha256=thmhuOlUaHRTrCUWeaCT-VLTE2AKuN1_c5wETdjXBGc,1304
 sage/libs/gap/element.pxd,sha256=4_-Te0nkerQk1MCI4qfeALfUWN1Jn1QbEpGQe2vrGn4,3297
 sage/libs/gap/all_documented_functions.py,sha256=79ehQ66NrZFT3Oc1ZCYA4f-pxYorYV2YaZI0nTvz7Ss,612
 sage/libs/gap/test_long.py,sha256=Y4874pVnQUR6GPD2IJHP68YKblWeO6m2ZvW11sPJA3w,1282
 sage/libs/gap/gap_globals.py,sha256=klLCm09wJmEXnZ_V5pHKn7OOwxREIILcYmPeglHsKTw,1360
-sage/libs/gap/libgap.cpython-310-darwin.so,sha256=rxNvlQ-6yRaHSOR7GAUWIZ_rzmi_OOfWOyccUTe_FYk,202000
-sage/libs/gap/util.cpython-310-darwin.so,sha256=Rj8ADGyoSl77PI_9wNOFcNSeK87KZgbON2Eb4eRG-bU,143488
+sage/libs/gap/libgap.cpython-310-darwin.so,sha256=SoPbP2oVOEzM7qcQcLtzUzDxtUZpHgFkGuGOYUr1WK4,202000
+sage/libs/gap/util.cpython-310-darwin.so,sha256=SAEtJi1PaKvTvS0yzBsBRK4qsCpkmWZqpYVslJwmIEo,143504
 sage/libs/gap/libgap.pyx,sha256=SWQqkcSSFvUkv5CcOIQTPTO6O9gUIhCxRCk2mEJqiAk,23664
 sage/libs/gap/util.pyx,sha256=xDs-zKqFLr5UqafL29yS7yco1h5Q81geESFHSESdVj4,16009
 sage/coding/all__sagemath_gap.py,sha256=Tzpetos0ih-3KeCyjXrlRL8IHaMKehOTYLKYbpM_g8w,42
-sage/coding/codecan/codecan.cpython-310-darwin.so,sha256=corCvwxRvzt23pDbw80LH9X5kW2_cl85q762RERL_IE,262400
-sage/coding/codecan/codecan.pxd,sha256=-yV_3H7du9kKSpYi4kx-LyAifWzxt8Us_syox2OSA20,2805
-sage/coding/codecan/autgroup_can_label.cpython-310-darwin.so,sha256=02C3QrsyI7Bb89CXaxZm-7Znbikn-dw4-M1UiSn55nQ,252904
+sage/coding/codecan/codecan.cpython-310-darwin.so,sha256=rHzHHw5eY8vpCxqEVV0YVDRjFmzmKKEbbm4EEPSXsGc,262400
+sage/coding/codecan/codecan.pxd,sha256=YR5-u7RV9JRxOsG7pkPN8h42A9c6CaUdA5QG2qXQMnQ,2807
+sage/coding/codecan/autgroup_can_label.cpython-310-darwin.so,sha256=3EEkNFkCvYbQb2pLaOoOFqiRgjp0jsFDDSii8Eb5wMI,252840
 sage/coding/codecan/all.py,sha256=Tzpetos0ih-3KeCyjXrlRL8IHaMKehOTYLKYbpM_g8w,42
-sage/coding/codecan/autgroup_can_label.pyx,sha256=6OYBLt5vtCcX1Y5bceTSN50RVv-4b1Yoebh8-8A6EGs,26106
+sage/coding/codecan/autgroup_can_label.pyx,sha256=Gf3C3hENQ6J5xMCWBtcBboFtc8u8RAg6ktXaGGK2LHg,26467
 sage/coding/codecan/all__sagemath_gap.py,sha256=Tzpetos0ih-3KeCyjXrlRL8IHaMKehOTYLKYbpM_g8w,42
-sage/coding/codecan/codecan.pyx,sha256=yabHsbRpxbHbyTNrTtihCvk87FRZxvvyLpyM7UWM_Dw,44926
+sage/coding/codecan/codecan.pyx,sha256=6kq55p_wgc_k3sKoAuPWq_YTj2gXHXhlYsnaW5hIyCc,45189
 sage/rings/universal_cyclotomic_field.py,sha256=9SxDpQErP79YT7eaJwl-eQgeM15ZEPHy_JZtoMsmk0M,49761
-sage/rings/species.py,sha256=-jdi1vxVGINhzTAewIT_q4-itSiZQ5esZpK7i4QEWXY,95477
+sage/rings/species.py,sha256=oWdmsS-fd7INB_r183fbIysNhQJJYuu8UCVuvl43Ph4,97187
 sage/rings/all__sagemath_gap.py,sha256=zp3YvAicr5KOBRkL4JowXChnJ4alNq2pq-DzejZ11DE,195
 sage/geometry/ribbon_graph.py,sha256=RdiKR3d0-zwqDc3QWvbQ1ODIVgzRQ3nAJcggmf0o97k,48909
 sage/geometry/all__sagemath_gap.py,sha256=REzYJFn-wm_XHNsj7VemcU2CAtiOrEwa5flNcs0zAR4,163
 sage/matrix/matrix_gap.pxd,sha256=SjdGKj8fAWF2WojhiVbyRzl9uJQPLywixGrUO-ohUfQ,305
-sage/matrix/matrix_gap.cpython-310-darwin.so,sha256=A6flBjTqwzx6n18ISpTqu3_K2yiTJ24RXny8YEh5Mx8,161376
+sage/matrix/matrix_gap.cpython-310-darwin.so,sha256=TzIdARjAsHR4RWbcBGYNTnXgky6kXrpKwWhCEFNl0kQ,161392
 sage/matrix/all__sagemath_gap.py,sha256=Tzpetos0ih-3KeCyjXrlRL8IHaMKehOTYLKYbpM_g8w,42
 sage/matrix/matrix_gap.pyx,sha256=gPOMGKhRezDGrxGdvxSm-jyqBXvdZ1WY2tYO3RU_4mE,13747
 sage/interfaces/all__sagemath_gap.py,sha256=Tzpetos0ih-3KeCyjXrlRL8IHaMKehOTYLKYbpM_g8w,42
 sage/interfaces/gap3.py,sha256=oumiD4-ntTNg3g4qP733rlp4ud-c5FXgrk_Pjtcqcik,32914
-sage/interfaces/gap.py,sha256=f3JtMUDsi-4cmylHHZA0QF5FPkKe7ci-BXHkEyu1F68,59667
+sage/interfaces/gap.py,sha256=41vr5oGme6KBdHSS5u3fLN_Nmd1rOs4bwRECPqRq50s,59989
 sage/interfaces/gap_workspace.py,sha256=6325mTcx8RgDfHGHuUse-QwM1sSj8S9dFNMvwir7Z_U,4719

sage/coding/codecan/autgroup_can_label.pyx

@@ -246,7 +246,7 @@ class LinearCodeAutGroupCanLabel:
         z.sort()
         z = [i for (p, i) in z]
 
-        normalization_factors = [ F.one() ] * mat.ncols()
+        normalization_factors = [F.one()] * mat.ncols()
         if algorithm_type == "permutational":
             for c in col_list:
                 c.set_immutable()
@@ -258,20 +258,20 @@ class LinearCodeAutGroupCanLabel:
 
         normalization = S(v=normalization_factors)
         normalization_inverse = normalization ** (-1)
-        col_set = list({col_list[y] for y in nz })
+        col_set = list({col_list[y] for y in nz})
         col2pos = []
         col2P = []
         for c in col_set:
-            X = [(pos2P[y], y) for y in range(mat.ncols()) if col_list[y] == c ]
+            X = [(pos2P[y], y) for y in range(mat.ncols()) if col_list[y] == c]
             X.sort()
-            col2pos.append([b for (a, b) in X ])
-            col2P.append([a for (a, b) in X ])
+            col2pos.append([b for _, b in X])
+            col2P.append([a for a, _ in X])
 
         zipped = sorted(zip(col2P, col_set, col2pos))
 
-        col2P = [qty for (qty, c, pos) in zipped]
-        col_set = [c for (qty, c, pos) in zipped]
-        col2pos = [pos for (qty, c, pos) in zipped]
+        col2P = [qty for qty, c, pos in zipped]
+        col_set = [c for qty, c, pos in zipped]
+        col2pos = [pos for qty, c, pos in zipped]
         P_refined = []
         p = [0]
         act_qty = col2P[0]
@@ -291,7 +291,9 @@ class LinearCodeAutGroupCanLabel:
             # the dimension of the dual code
             # in this case we work with the code itself.
             pr = PartitionRefinementLinearCode(len(col_set),
-                matrix(col_set).transpose(), P=P_refined, algorithm_type=algorithm_type)
+                                               matrix(col_set).transpose(),
+                                               P=P_refined,
+                                               algorithm_type=algorithm_type)
 
             # this command allows you some advanced debugging
             # it prints the backtrack tree -> must be activated when installing
@@ -299,8 +301,11 @@ class LinearCodeAutGroupCanLabel:
 
             can_transp = pr.get_transporter()
             can_col_set = pr.get_canonical_form().columns()
-            self._PGammaL_autom_gens = self._compute_PGammaL_automs(pr.get_autom_gens(),
-                normalization, normalization_inverse, col2pos)
+            self._PGammaL_autom_gens = self._compute_PGammaL_automs(
+                pr.get_autom_gens(),
+                normalization,
+                normalization_inverse, col2pos
+            )
             self._PGammaL_autom_size = pr.get_autom_order_permutation()
             self._PGammaL_autom_size *= pr.get_autom_order_inner_stabilizer()
             self._full_autom_order = self._PGammaL_autom_size
@@ -333,28 +338,27 @@ class LinearCodeAutGroupCanLabel:
                         A.append(S_short(perm=_cyclic_shift(n, p)))
                     self._full_autom_order *= factorial(len(p))
             self._PGammaL_autom_size = self._full_autom_order / (len(F) - 1)
-            self._PGammaL_autom_gens = self._compute_PGammaL_automs(A,
-                normalization, normalization_inverse, col2pos)
+            self._PGammaL_autom_gens = self._compute_PGammaL_automs(
+                A, normalization, normalization_inverse, col2pos)
         else:
             # use the dual code for the computations
             # this might have zero columns or multiple columns, hence
             # we call this algorithm again.
             short_dual_code = LinearCode(matrix(col_set).transpose()).dual_code()
             agcl = LinearCodeAutGroupCanLabel(short_dual_code,
-                P=P_refined, algorithm_type=algorithm_type)
+                                              P=P_refined,
+                                              algorithm_type=algorithm_type)
             can_transp = agcl.get_transporter()
             can_transp.invert_v()
             can_col_set = agcl.get_canonical_form().parity_check_matrix().columns()
             A = agcl.get_autom_gens()
             for a in A:
                 a.invert_v()
-            self._PGammaL_autom_gens = self._compute_PGammaL_automs(A,
-                normalization, normalization_inverse, col2pos)
+            self._PGammaL_autom_gens = self._compute_PGammaL_automs(
+                A, normalization, normalization_inverse, col2pos)
             self._PGammaL_autom_size = agcl.get_PGammaL_order()
             self._full_autom_order = agcl.get_autom_order()
 
-        count = 0
-        block_ptr = []
         canonical_form = matrix(F, mat.ncols(), mat.nrows())
 
         perm = [-1] * mat.ncols()
@@ -363,8 +367,8 @@ class LinearCodeAutGroupCanLabel:
         for i in range(len(can_col_set)):
             img = can_transp.get_perm()(i + 1)
             for j in col2pos[img - 1]:
-                pos = P[ pos2P[j] ].pop()
-                canonical_form[ pos ] = can_col_set[i]
+                pos = P[pos2P[j]].pop()
+                canonical_form[pos] = can_col_set[i]
                 mult[pos] = can_transp.get_v()[i]
                 perm[pos] = j + 1
 
@@ -376,14 +380,17 @@ class LinearCodeAutGroupCanLabel:
 
         self._canonical_form = LinearCode(canonical_form.transpose())
         self._transporter = S(perm=Permutation(perm), v=mult, autom=can_transp.get_autom()) * normalization
-        self._trivial_autom_gens, a = self._compute_trivial_automs(normalization,
-            normalization_inverse, z, [pos2P[x] for x in z], zero_column_case=True)
+        self._trivial_autom_gens, a = self._compute_trivial_automs(
+            normalization,
+            normalization_inverse, z, [pos2P[x] for x in z],
+            zero_column_case=True)
         self._full_autom_order *= a
 
         for i in range(len(col2P)):
             if len(col2P[i]) > 1:
                 A, a = self._compute_trivial_automs(normalization,
-                    normalization_inverse, col2pos[i], col2P[i])
+                                                    normalization_inverse,
+                                                    col2pos[i], col2P[i])
                 self._full_autom_order *= a
                 self._trivial_autom_gens += A
 
@@ -461,11 +468,13 @@ class LinearCodeAutGroupCanLabel:
                 aut_order *= factorial(j - beg)
                 # we append a transposition of the first two elements
                 A.append(normalization_inverse *
-                    S(perm=_cyclic_shift(n, col2pos[beg:beg + 2])) * normalization)
+                         S(perm=_cyclic_shift(n, col2pos[beg:beg + 2])) *
+                         normalization)
                 if j - beg > 2:
                     # we append a cycle on all elements
                     A.append(normalization_inverse *
-                        S(perm=_cyclic_shift(n, col2pos[beg:j])) * normalization)
+                             S(perm=_cyclic_shift(n, col2pos[beg:j])) *
+                             normalization)
             beg = j
         return A, aut_order
 

sage/coding/codecan/codecan.pxd

@@ -37,8 +37,8 @@ cdef class PartitionRefinementLinearCode(PartitionRefinement_generic):
     cdef int _k, _q
     cdef long *_hyp_refine_vals_scratch
     cdef object _inner_group_stabilizer_order
-    cdef bitset_t *_hyp2points # hyperplanes to points
-    cdef bitset_t *_points2hyp # points to hyperplanes, transpose of _hyp2points
+    cdef bitset_t *_hyp2points  # hyperplanes to points
+    cdef bitset_t *_points2hyp  # points to hyperplanes, transpose of _hyp2points
     cdef PartitionStack *_hyp_part
     cdef object _matrix, _root_matrix
     cdef InnerGroup _inner_group

sage/coding/codecan/codecan.pyx

@@ -85,14 +85,14 @@ is returned by generators::
     True
 """
 
-#*******************************************************************************
+# *****************************************************************************
 #       Copyright (C) 2012 Thomas Feulner <thomas.feulner@uni-bayreuth.de>
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
 #  as published by the Free Software Foundation; either version 2 of
 #  the License, or (at your option) any later version.
 #                  https://www.gnu.org/licenses/
-#*******************************************************************************
+# *****************************************************************************
 from itertools import repeat
 from copy import copy
 from cysignals.memory cimport check_allocarray, sig_free
@@ -378,8 +378,9 @@ cdef class InnerGroup:
             6 -> 6 7 -> 7 8 -> 8 9 -> 9
         """
         return r"Subgroup of (GL(k,q) times \GF{q}^n ) rtimes Aut(\GF{q}) " + \
-            "with rank = %s, frobenius power = %s and partition =%s" % (self.rank,
-            self.frob_pow, OP_string(self.row_partition))
+            "with rank = %s, frobenius power = %s and partition =%s" % (
+                self.rank,
+                self.frob_pow, OP_string(self.row_partition))
 
     cdef void minimize_by_frobenius(self, object v, int *applied_frob, int *stab_pow) noexcept:
         r"""
@@ -637,7 +638,8 @@ cdef class PartitionRefinementLinearCode(PartitionRefinement_generic):
         else:
             P = remaining_inner_group.column_blocks(self._best_candidate)
             for p in P:
-                x = S(v=[ F.primitive_element() if i in p else F.one()  for i in range(self._n) ])
+                x = S(v=[F.primitive_element() if i in p else F.one()
+                         for i in range(self._n)])
                 self._autom_group_generators.append(transp_inv * x * self._transporter)
             self._inner_group_stabilizer_order = (len(F) - 1) ** len(P)
 
@@ -756,10 +758,9 @@ cdef class PartitionRefinementLinearCode(PartitionRefinement_generic):
         This graph will be later used in the refinement procedures.
         """
         cdef FFSS_projPoint iter = FFSS_projPoint(self._matrix)
-        cdef mp_bitcnt_t i,j
+        cdef mp_bitcnt_t i, j
 
         ambient_space = (self._matrix.base_ring()) ** (self._n)
-        weights2size = [0] * (self.len() + 1)
         W = [[] for _ in repeat(None, self.len() + 1)]
         span = [ambient_space.zero_subspace()] * (self.len() + 1)
         min_weight = self.len()
@@ -814,8 +815,9 @@ cdef class PartitionRefinementLinearCode(PartitionRefinement_generic):
     cdef bint _minimization_allowed_on_col(self, int pos) noexcept:
         r"""
         Decide if we are allowed to perform the inner minimization on position
-        ``pos`` which is supposed to be a singleton. For linear codes over finite
-        fields, we can always return ``True``.
+        ``pos`` which is supposed to be a singleton.
+
+        For linear codes over finite fields, we can always return ``True``.
         """
         return True
 
@@ -834,8 +836,9 @@ cdef class PartitionRefinementLinearCode(PartitionRefinement_generic):
         - ``True`` if and only if the actual node compares less or equal
           to the candidate for the canonical form.
         """
-        self._matrix = self._inner_group.minimize_matrix_col(self._matrix, pos,
-                            self._fixed_minimized, inner_group_changed)
+        self._matrix = self._inner_group.minimize_matrix_col(
+            self._matrix, pos,
+            self._fixed_minimized, inner_group_changed)
 
         # finally compare the new column with the best candidate
         if self._is_candidate_initialized:
@@ -912,7 +915,7 @@ cdef class PartitionRefinementLinearCode(PartitionRefinement_generic):
         - ``False`` only if the image under this homomorphism of group actions
           compares larger than the image of the candidate for the canonical form.
         """
-        cdef int i, j, res, stab_pow, apply_pow
+        cdef int i, res, stab_pow, apply_pow
 
         if self._inner_group.rank < 2:
             return True
@@ -990,7 +993,9 @@ cdef class PartitionRefinementLinearCode(PartitionRefinement_generic):
         cdef long * best_vals = self._point_refine_vals.get_row(self._nr_of_point_refine_calls)
         self._nr_of_point_refine_calls += 1
         cdef bint ret_val = self._one_refinement(best_vals, 0, self._n,
-            inner_stab_changed, changed_partition, "point_refine")
+                                                 inner_stab_changed,
+                                                 changed_partition,
+                                                 "point_refine")
 
         if not changed_partition[0]:
             self._part.depth -= 1
@@ -1033,8 +1038,10 @@ cdef class PartitionRefinementLinearCode(PartitionRefinement_generic):
         self._nr_of_hyp_refine_calls += 1
 
         cdef tuple ret_val = PS_refinement(self._hyp_part,
-            self._hyp_refine_vals_scratch, best_vals, 0, self._hyp_part.degree,
-            &self._is_candidate_initialized, changed_partition)
+                                           self._hyp_refine_vals_scratch,
+                                           best_vals, 0, self._hyp_part.degree,
+                                           &self._is_candidate_initialized,
+                                           changed_partition)
 
         if not changed_partition[0]:
             self._hyp_part.depth -= 1
@@ -1095,11 +1102,11 @@ cdef class PartitionRefinementLinearCode(PartitionRefinement_generic):
             else:
                 self._latex_debug_string += " & "
 
-        permuted_matrix = self._matrix.matrix_from_columns([self._part.entries[i] for i in range(self._n) ])
+        permuted_matrix = self._matrix.matrix_from_columns([self._part.entries[i] for i in range(self._n)])
 
         # Now we will finally print the matrix.
-        for i from 0 <= i < self._k:
-            for j from 0 <= j < (self._n - 1):
+        for i in range(self._k):
+            for j in range(self._n - 1):
                 self._latex_debug_string += "$" + permuted_matrix[i, j]._latex_() + "$ & "
             self._latex_debug_string += "$" + permuted_matrix[i, self._n - 1]._latex_() + "$ \\\\\n"
 

sage/combinat/enumeration_mod_permgroup.pyx

@@ -3,14 +3,14 @@
 r"""
 Tools for enumeration modulo the action of a permutation group
 """
-#*****************************************************************************
+# ***************************************************************************
 #    Copyright (C) 2010-12 Nicolas Borie <nicolas.borie at math dot u-psud.fr>
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
 #
 #              The full text of the GPL is available at:
-#                    http://www.gnu.org/licenses/
-#*****************************************************************************
+#                    https://www.gnu.org/licenses/
+# ***************************************************************************
 
 from sage.groups.perm_gps.permgroup_element cimport PermutationGroupElement
 

sage/combinat/root_system/reflection_group_complex.py

@@ -197,26 +197,25 @@ AUTHORS:
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
 
-from sage.misc.cachefunc import cached_method, cached_function
-from sage.misc.misc_c import prod
 from sage.categories.category import Category
-from sage.categories.permutation_groups import PermutationGroups
 from sage.categories.complex_reflection_groups import ComplexReflectionGroups
 from sage.categories.coxeter_groups import CoxeterGroups
+from sage.categories.permutation_groups import PermutationGroups
+from sage.combinat.root_system.cartan_matrix import CartanMatrix
 from sage.combinat.root_system.reflection_group_element import ComplexReflectionGroupElement, _gap_return
-from sage.sets.family import Family
-from sage.structure.unique_representation import UniqueRepresentation
 from sage.groups.perm_gps.permgroup import PermutationGroup_generic
-from sage.combinat.permutation import Permutation
-from sage.rings.integer_ring import ZZ
-from sage.rings.rational_field import QQ
+from sage.interfaces.gap3 import gap3
 from sage.matrix.constructor import matrix
 from sage.matrix.special import identity_matrix
-from sage.structure.element import Matrix
-from sage.interfaces.gap3 import gap3
-from sage.modules.free_module_element import vector
-from sage.combinat.root_system.cartan_matrix import CartanMatrix
+from sage.misc.cachefunc import cached_method, cached_function
+from sage.misc.misc_c import prod
 from sage.misc.sage_eval import sage_eval
+from sage.modules.free_module_element import vector
+from sage.rings.integer_ring import ZZ
+from sage.rings.rational_field import QQ
+from sage.sets.family import Family
+from sage.structure.element import Matrix
+from sage.structure.unique_representation import UniqueRepresentation
 
 
 class ComplexReflectionGroup(UniqueRepresentation, PermutationGroup_generic):

sage/combinat/root_system/weyl_group.py

@@ -927,7 +927,7 @@ class WeylGroupElement(MatrixGroupElement_gap):
 
         return s is positive
 
-    def has_left_descent(self, i):
+    def has_left_descent(self, i) -> bool:
         """
         Test if ``self`` has a left descent at position ``i``.
 
@@ -948,7 +948,7 @@ class WeylGroupElement(MatrixGroupElement_gap):
         """
         return self.has_descent(i, side='left')
 
-    def has_right_descent(self, i):
+    def has_right_descent(self, i) -> bool:
         """
         Test if ``self`` has a right descent at position ``i``.
 

sage/groups/class_function.py

@@ -68,7 +68,6 @@ def ClassFunction(group, values):
         sage: chi = ClassFunction(G, values); chi
         Character of Cyclic group of order 4 as a permutation group
     """
-    from sage.misc.superseded import deprecation
     try:
         return group.class_function(values)
     except AttributeError:

sage/groups/libgap_wrapper.pyx

@@ -364,7 +364,7 @@ class ParentLibGAP(SageObject):
                 for gap_subgroup in self._libgap.MaximalNormalSubgroups()]
 
     @cached_method
-    def gens(self):
+    def gens(self) -> tuple:
         """
         Return the generators of the group.
 

sage/groups/matrix_gps/binary_dihedral.py

@@ -83,7 +83,7 @@ class BinaryDihedralGroup(UniqueRepresentation, FinitelyGeneratedMatrixGroup_gap
 
         MS = MatrixSpace(R, 2)
         zero = R.zero()
-        gens = [ MS([zeta, zero, zero, ~zeta]), MS([zero, i, i, zero]) ]
+        gens = [MS([zeta, zero, zero, ~zeta]), MS([zero, i, i, zero])]
 
         from sage.libs.gap.libgap import libgap
         gap_gens = [libgap(matrix_gen) for matrix_gen in gens]