Adjust to CAP 2024.09-08

FpCategories/PackageInfo.g

@@ -10,7 +10,7 @@ SetPackageInfo( rec(
 
 PackageName := "FpCategories",
 Subtitle := "Finitely presented categories by generating quivers and relations",
-Version := "2024.09-01",
+Version := "2024.09-02",
 Date := (function ( ) if IsBound( GAPInfo.SystemEnvironment.GAP_PKG_RELEASE_DATE ) then return GAPInfo.SystemEnvironment.GAP_PKG_RELEASE_DATE; else return Concatenation( ~.Version{[ 1 .. 4 ]}, "-", ~.Version{[ 6, 7 ]}, "-01" ); fi; end)( ),
 License := "GPL-2.0-or-later",
 
@@ -85,7 +85,7 @@ Dependencies := rec(
   GAP := ">= 4.13.0",
   NeededOtherPackages := [
                    [ "GAPDoc", ">= 1.5" ],
-                   [ "CAP", ">= 2024.09-05" ],
+                   [ "CAP", ">= 2024.09-08" ],
                    [ "ToolsForCategoricalTowers", ">= 2024.03-02" ],
                    [ "QuotientCategories", ">= 2024.02-01" ],
                    [ "FinSetsForCAP", ">= 2023.10-03" ],

FpCategories/gap/Tools.autogen.gd

@@ -3,27 +3,27 @@
 #
 # Declarations
 #
-# THIS FILE IS AUTOMATICALLY GENERATED, SEE CAP_project/CAP/gap/MethodRecord.gi
+# THIS FILE IS AUTOMATICALLY GENERATED, SEE CAP_project/CAP/gap/MethodRecordTools.gi
 
 #! @Chapter Futher CAP operations
 
 #! @Section Add-methods
 
+#! @BeginGroup
 #! @Description
 #! The arguments are a category $C$ and a function $F$.
 #! This operation adds the given function $F$
 #! to the category for the basic operation `SetOfGeneratingMorphismsOfCategory`.
+#! Optionally, a weight (default: 100) can be specified which should roughly correspond
+#! to the computational complexity of the function (lower weight = less complex = faster execution).
 #! $F: (  ) \mapsto \mathtt{SetOfGeneratingMorphismsOfCategory}()$.
 #! @Returns nothing
 #! @Arguments C, F
 DeclareOperation( "AddSetOfGeneratingMorphismsOfCategory",
                   [ IsCapCategory, IsFunction ] );
 
+#! @Arguments C, F, weight
 DeclareOperation( "AddSetOfGeneratingMorphismsOfCategory",
                   [ IsCapCategory, IsFunction, IsInt ] );
+#! @EndGroup
 
-DeclareOperation( "AddSetOfGeneratingMorphismsOfCategory",
-                  [ IsCapCategory, IsList, IsInt ] );
-
-DeclareOperation( "AddSetOfGeneratingMorphismsOfCategory",
-                  [ IsCapCategory, IsList ] );

FunctorCategories/PackageInfo.g

@@ -10,7 +10,7 @@ SetPackageInfo( rec(
 
 PackageName := "FunctorCategories",
 Subtitle := "Categories of functors",
-Version := "2024.09-04",
+Version := "2024.09-05",
 
 Date := ~.Version{[ 1 .. 10 ]},
 Date := (function ( ) if IsBound( GAPInfo.SystemEnvironment.GAP_PKG_RELEASE_DATE ) then return GAPInfo.SystemEnvironment.GAP_PKG_RELEASE_DATE; else return Concatenation( ~.Version{[ 1 .. 4 ]}, "-", ~.Version{[ 6, 7 ]}, "-01" ); fi; end)( ),
@@ -89,7 +89,7 @@ Dependencies := rec(
   NeededOtherPackages := [
                    [ "GAPDoc", ">= 1.5" ],
                    [ "ToolsForHomalg", ">= 2022.12-01" ],
-                   [ "CAP", ">= 2024.09-05" ],
+                   [ "CAP", ">= 2024.09-08" ],
                    [ "MonoidalCategories", ">= 2024.06-02" ],
                    [ "CartesianCategories", ">= 2024.06-03" ],
                    [ "ToolsForCategoricalTowers", ">= 2024.03-02" ],

FunctorCategories/gap/Tools.autogen.gd

@@ -3,27 +3,27 @@
 #
 # Declarations
 #
-# THIS FILE IS AUTOMATICALLY GENERATED, SEE CAP_project/CAP/gap/MethodRecord.gi
+# THIS FILE IS AUTOMATICALLY GENERATED, SEE CAP_project/CAP/gap/MethodRecordTools.gi
 
 #! @Chapter Futher CAP operations
 
 #! @Section Add-methods
 
+#! @BeginGroup
 #! @Description
 #! The arguments are a category $C$ and a function $F$.
 #! This operation adds the given function $F$
 #! to the category for the basic operation `IsReflexive`.
+#! Optionally, a weight (default: 100) can be specified which should roughly correspond
+#! to the computational complexity of the function (lower weight = less complex = faster execution).
 #! $F: ( arg2 ) \mapsto \mathtt{IsReflexive}(arg2)$.
 #! @Returns nothing
 #! @Arguments C, F
 DeclareOperation( "AddIsReflexive",
                   [ IsCapCategory, IsFunction ] );
 
+#! @Arguments C, F, weight
 DeclareOperation( "AddIsReflexive",
                   [ IsCapCategory, IsFunction, IsInt ] );
+#! @EndGroup
 
-DeclareOperation( "AddIsReflexive",
-                  [ IsCapCategory, IsList, IsInt ] );
-
-DeclareOperation( "AddIsReflexive",
-                  [ IsCapCategory, IsList ] );

Locales/PackageInfo.g

@@ -10,7 +10,7 @@ SetPackageInfo( rec(
 
 PackageName := "Locales",
 Subtitle := "Locales, frames, coframes, meet semi-lattices of locally closed subsets, and Boolean algebras of constructible sets",
-Version := "2024.09-05",
+Version := "2024.09-06",
 Date := ~.Version{[ 1 .. 10 ]},
 Date := (function ( ) if IsBound( GAPInfo.SystemEnvironment.GAP_PKG_RELEASE_DATE ) then return GAPInfo.SystemEnvironment.GAP_PKG_RELEASE_DATE; else return Concatenation( ~.Version{[ 1 .. 4 ]}, "-", ~.Version{[ 6, 7 ]}, "-01" ); fi; end)( ),
 License := "GPL-2.0-or-later",
@@ -102,7 +102,7 @@ Dependencies := rec(
   NeededOtherPackages := [
                 [ "GAPDoc", ">= 1.5" ],
                 [ "ToolsForHomalg", ">= 2021.12-02" ],
-                [ "CAP", ">= 2024.09-05" ],
+                [ "CAP", ">= 2024.09-08" ],
                 [ "CompilerForCAP", ">= 2022.08-10" ],
                 [ "MonoidalCategories", ">= 2024.02-02" ],
                 [ "CartesianCategories", ">= 2024.02-02" ],

Locales/gap/BooleanAlgebra.autogen.gd

@@ -3,84 +3,84 @@
 #
 # Declarations
 #
-# THIS FILE IS AUTOMATICALLY GENERATED, SEE CAP_project/CAP/gap/MethodRecord.gi
+# THIS FILE IS AUTOMATICALLY GENERATED, SEE CAP_project/CAP/gap/MethodRecordTools.gi
 
 #! @Chapter Boolean algebras
 
 #! @Section Add-methods
 
+#! @BeginGroup
 #! @Description
 #! The arguments are a category $C$ and a function $F$.
 #! This operation adds the given function $F$
 #! to the category for the basic operation `MorphismFromDoubleNegation`.
+#! Optionally, a weight (default: 100) can be specified which should roughly correspond
+#! to the computational complexity of the function (lower weight = less complex = faster execution).
 #! $F: ( a ) \mapsto \mathtt{MorphismFromDoubleNegation}(a)$.
 #! @Returns nothing
 #! @Arguments C, F
 DeclareOperation( "AddMorphismFromDoubleNegation",
                   [ IsCapCategory, IsFunction ] );
 
+#! @Arguments C, F, weight
 DeclareOperation( "AddMorphismFromDoubleNegation",
                   [ IsCapCategory, IsFunction, IsInt ] );
+#! @EndGroup
 
-DeclareOperation( "AddMorphismFromDoubleNegation",
-                  [ IsCapCategory, IsList, IsInt ] );
-
-DeclareOperation( "AddMorphismFromDoubleNegation",
-                  [ IsCapCategory, IsList ] );
 
+#! @BeginGroup
 #! @Description
 #! The arguments are a category $C$ and a function $F$.
 #! This operation adds the given function $F$
 #! to the category for the basic operation `MorphismFromDoubleNegationWithGivenDoubleNegation`.
+#! Optionally, a weight (default: 100) can be specified which should roughly correspond
+#! to the computational complexity of the function (lower weight = less complex = faster execution).
 #! $F: ( a, s ) \mapsto \mathtt{MorphismFromDoubleNegationWithGivenDoubleNegation}(a, s)$.
 #! @Returns nothing
 #! @Arguments C, F
 DeclareOperation( "AddMorphismFromDoubleNegationWithGivenDoubleNegation",
                   [ IsCapCategory, IsFunction ] );
 
+#! @Arguments C, F, weight
 DeclareOperation( "AddMorphismFromDoubleNegationWithGivenDoubleNegation",
                   [ IsCapCategory, IsFunction, IsInt ] );
+#! @EndGroup
 
-DeclareOperation( "AddMorphismFromDoubleNegationWithGivenDoubleNegation",
-                  [ IsCapCategory, IsList, IsInt ] );
-
-DeclareOperation( "AddMorphismFromDoubleNegationWithGivenDoubleNegation",
-                  [ IsCapCategory, IsList ] );
 
+#! @BeginGroup
 #! @Description
 #! The arguments are a category $C$ and a function $F$.
 #! This operation adds the given function $F$
 #! to the category for the basic operation `MorphismToDoubleConegation`.
+#! Optionally, a weight (default: 100) can be specified which should roughly correspond
+#! to the computational complexity of the function (lower weight = less complex = faster execution).
 #! $F: ( a ) \mapsto \mathtt{MorphismToDoubleConegation}(a)$.
 #! @Returns nothing
 #! @Arguments C, F
 DeclareOperation( "AddMorphismToDoubleConegation",
                   [ IsCapCategory, IsFunction ] );
 
+#! @Arguments C, F, weight
 DeclareOperation( "AddMorphismToDoubleConegation",
                   [ IsCapCategory, IsFunction, IsInt ] );
+#! @EndGroup
 
-DeclareOperation( "AddMorphismToDoubleConegation",
-                  [ IsCapCategory, IsList, IsInt ] );
-
-DeclareOperation( "AddMorphismToDoubleConegation",
-                  [ IsCapCategory, IsList ] );
 
+#! @BeginGroup
 #! @Description
 #! The arguments are a category $C$ and a function $F$.
 #! This operation adds the given function $F$
 #! to the category for the basic operation `MorphismToDoubleConegationWithGivenDoubleConegation`.
+#! Optionally, a weight (default: 100) can be specified which should roughly correspond
+#! to the computational complexity of the function (lower weight = less complex = faster execution).
 #! $F: ( a, r ) \mapsto \mathtt{MorphismToDoubleConegationWithGivenDoubleConegation}(a, r)$.
 #! @Returns nothing
 #! @Arguments C, F
 DeclareOperation( "AddMorphismToDoubleConegationWithGivenDoubleConegation",
                   [ IsCapCategory, IsFunction ] );
 
+#! @Arguments C, F, weight
 DeclareOperation( "AddMorphismToDoubleConegationWithGivenDoubleConegation",
                   [ IsCapCategory, IsFunction, IsInt ] );
+#! @EndGroup
 
-DeclareOperation( "AddMorphismToDoubleConegationWithGivenDoubleConegation",
-                  [ IsCapCategory, IsList, IsInt ] );
-
-DeclareOperation( "AddMorphismToDoubleConegationWithGivenDoubleConegation",
-                  [ IsCapCategory, IsList ] );

Locales/gap/CoHeytingAlgebra.autogen.gd

@@ -3,103 +3,103 @@
 #
 # Declarations
 #
-# THIS FILE IS AUTOMATICALLY GENERATED, SEE CAP_project/CAP/gap/MethodRecord.gi
+# THIS FILE IS AUTOMATICALLY GENERATED, SEE CAP_project/CAP/gap/MethodRecordTools.gi
 
 #! @Chapter Co-Heyting algebras
 
 #! @Section Add-methods
 
+#! @BeginGroup
 #! @Description
 #! The arguments are a category $C$ and a function $F$.
 #! This operation adds the given function $F$
 #! to the category for the basic operation `ConegationOnMorphisms`.
+#! Optionally, a weight (default: 100) can be specified which should roughly correspond
+#! to the computational complexity of the function (lower weight = less complex = faster execution).
 #! $F: ( alpha ) \mapsto \mathtt{ConegationOnMorphisms}(alpha)$.
 #! @Returns nothing
 #! @Arguments C, F
 DeclareOperation( "AddConegationOnMorphisms",
                   [ IsCapCategory, IsFunction ] );
 
+#! @Arguments C, F, weight
 DeclareOperation( "AddConegationOnMorphisms",
                   [ IsCapCategory, IsFunction, IsInt ] );
+#! @EndGroup
 
-DeclareOperation( "AddConegationOnMorphisms",
-                  [ IsCapCategory, IsList, IsInt ] );
-
-DeclareOperation( "AddConegationOnMorphisms",
-                  [ IsCapCategory, IsList ] );
 
+#! @BeginGroup
 #! @Description
 #! The arguments are a category $C$ and a function $F$.
 #! This operation adds the given function $F$
 #! to the category for the basic operation `ConegationOnMorphismsWithGivenConegations`.
+#! Optionally, a weight (default: 100) can be specified which should roughly correspond
+#! to the computational complexity of the function (lower weight = less complex = faster execution).
 #! $F: ( s, alpha, r ) \mapsto \mathtt{ConegationOnMorphismsWithGivenConegations}(s, alpha, r)$.
 #! @Returns nothing
 #! @Arguments C, F
 DeclareOperation( "AddConegationOnMorphismsWithGivenConegations",
                   [ IsCapCategory, IsFunction ] );
 
+#! @Arguments C, F, weight
 DeclareOperation( "AddConegationOnMorphismsWithGivenConegations",
                   [ IsCapCategory, IsFunction, IsInt ] );
+#! @EndGroup
 
-DeclareOperation( "AddConegationOnMorphismsWithGivenConegations",
-                  [ IsCapCategory, IsList, IsInt ] );
-
-DeclareOperation( "AddConegationOnMorphismsWithGivenConegations",
-                  [ IsCapCategory, IsList ] );
 
+#! @BeginGroup
 #! @Description
 #! The arguments are a category $C$ and a function $F$.
 #! This operation adds the given function $F$
 #! to the category for the basic operation `ConegationOnObjects`.
+#! Optionally, a weight (default: 100) can be specified which should roughly correspond
+#! to the computational complexity of the function (lower weight = less complex = faster execution).
 #! $F: ( arg2 ) \mapsto \mathtt{ConegationOnObjects}(arg2)$.
 #! @Returns nothing
 #! @Arguments C, F
 DeclareOperation( "AddConegationOnObjects",
                   [ IsCapCategory, IsFunction ] );
 
+#! @Arguments C, F, weight
 DeclareOperation( "AddConegationOnObjects",
                   [ IsCapCategory, IsFunction, IsInt ] );
+#! @EndGroup
 
-DeclareOperation( "AddConegationOnObjects",
-                  [ IsCapCategory, IsList, IsInt ] );
-
-DeclareOperation( "AddConegationOnObjects",
-                  [ IsCapCategory, IsList ] );
 
+#! @BeginGroup
 #! @Description
 #! The arguments are a category $C$ and a function $F$.
 #! This operation adds the given function $F$
 #! to the category for the basic operation `MorphismFromDoubleConegation`.
+#! Optionally, a weight (default: 100) can be specified which should roughly correspond
+#! to the computational complexity of the function (lower weight = less complex = faster execution).
 #! $F: ( a ) \mapsto \mathtt{MorphismFromDoubleConegation}(a)$.
 #! @Returns nothing
 #! @Arguments C, F
 DeclareOperation( "AddMorphismFromDoubleConegation",
                   [ IsCapCategory, IsFunction ] );
 
+#! @Arguments C, F, weight
 DeclareOperation( "AddMorphismFromDoubleConegation",
                   [ IsCapCategory, IsFunction, IsInt ] );
+#! @EndGroup
 
-DeclareOperation( "AddMorphismFromDoubleConegation",
-                  [ IsCapCategory, IsList, IsInt ] );
-
-DeclareOperation( "AddMorphismFromDoubleConegation",
-                  [ IsCapCategory, IsList ] );
 
+#! @BeginGroup
 #! @Description
 #! The arguments are a category $C$ and a function $F$.
 #! This operation adds the given function $F$
 #! to the category for the basic operation `MorphismFromDoubleConegationWithGivenDoubleConegation`.
+#! Optionally, a weight (default: 100) can be specified which should roughly correspond
+#! to the computational complexity of the function (lower weight = less complex = faster execution).
 #! $F: ( a, s ) \mapsto \mathtt{MorphismFromDoubleConegationWithGivenDoubleConegation}(a, s)$.
 #! @Returns nothing
 #! @Arguments C, F
 DeclareOperation( "AddMorphismFromDoubleConegationWithGivenDoubleConegation",
                   [ IsCapCategory, IsFunction ] );
 
+#! @Arguments C, F, weight
 DeclareOperation( "AddMorphismFromDoubleConegationWithGivenDoubleConegation",
                   [ IsCapCategory, IsFunction, IsInt ] );
+#! @EndGroup
 
-DeclareOperation( "AddMorphismFromDoubleConegationWithGivenDoubleConegation",
-                  [ IsCapCategory, IsList, IsInt ] );
-
-DeclareOperation( "AddMorphismFromDoubleConegationWithGivenDoubleConegation",
-                  [ IsCapCategory, IsList ] );