# SPDX-License-Identifier: GPL-2.0-or-later # CAP: Categories, Algorithms, Programming # # Implementations # "CAP_INTERNAL_GENERATE_CONVENIENCE_METHODS_FOR_LIMITS" ,function ( package_name, method_name_record, limits )onvenience_method, number_of_diagram_arguments, limit, output_path;"" "# SPDX-License-Identifier: GPL-2.0-or-later # CAP: Categories, Algorithms, Programming # # Implementations # # THIS FILE IS AUTOMATICALLY GENERATED, SEE LimitConvenience.gi "" "; #### helper functions function ( limit, universal_morphism_name, object_name, diagram_position )ist_selector;if not diagram_position in [ "Source" , "Range" ] then "diagram_position must be \" Source\" or \" Range\"" );fi ;if limit.number_of_unbound_morphisms = 0 then # diagram can be derived from morphism(s) via diagram_position if limit.number_of_targets = 1 then "this case is currently not supported" );elif limit.number_of_targets > 1 then # derive diagram from morphisms via diagram_position "\n" ,"##\n", "InstallMethod( " , universal_morphism_name, ",\n" ," [ IsList ],\n" ," \n" ," function( list )\n" ," #% CAP_JIT_RESOLVE_FUNCTION\n", " \n" ," return " , universal_morphism_name, "( CapCategory( list[1] ), list );\n" ," \n" ,"end );\n" ,"\n" ,"##\n", "InstallOtherMethod( " , universal_morphism_name, ",\n" ," [ IsCapCategory, IsList ],\n" ," \n" ," function( cat, list )\n" ," #% CAP_JIT_RESOLVE_FUNCTION\n", " \n" ," return " , universal_morphism_name, "( cat, List( list, " , diagram_position, " ), list );\n" ," \n" ,"end );\n" ,"\n" ,"##\n", "InstallOtherMethod( " , universal_morphism_name, ",\n" ," [ IsCapCategoryObject, IsList ],\n" ," \n" ," function( test_object, list )\n" ," #% CAP_JIT_RESOLVE_FUNCTION\n", " \n" ," return " , universal_morphism_name, "( CapCategory( test_object ), test_object, list );\n" ," \n" ,"end );\n" ,"\n" ,"##\n", "InstallOtherMethod( " , universal_morphism_name, ",\n" ," [ IsCapCategory, IsCapCategoryObject, IsList ],\n" ," \n" ," function( cat, test_object, list )\n" ," #% CAP_JIT_RESOLVE_FUNCTION\n", " \n" ," return " , universal_morphism_name, "( cat, List( list, " , diagram_position, " ), test_object, list );\n" ," \n" ,"end );\n" fi ;fi ;# derive test object if IsOperation( ValueGlobal( universal_morphism_name ) ) then if diagram_position = "Source" then "Range" ;elif diagram_position = "Range" then "Source" ;else "this should never happen" );fi ;if limit.number_of_targets = 1 then "IsCapCategoryMorphism" ;"" ;else "IsList" ;"[1]" ;fi ;"" " function ( diagram_arguments..., tau )#% CAP_JIT_RESOLVE_FUNCTION ( selected_tau ), tau );end );function ( cat , diagram_arguments..., tau )#% CAP_JIT_RESOLVE_FUNCTION cat , diagram_arguments..., test_object_position( selected_tau ), tau );end );function ( diagram_arguments..., tau, P )#% CAP_JIT_RESOLVE_FUNCTION lected_tau ), tau, P );end );function ( cat , diagram_arguments..., tau, P )#% CAP_JIT_RESOLVE_FUNCTION cat , diagram_arguments..., test_object_position( selected_tau ), tau, P );end );"" ", "WithGiven" , object_name ),am_filter_list ), NameFunction ),"tau" , list_selector ),fi ;end ;function ( limit, limit_colimit, object_name, functorial_name, functorial_with_given_name )ource_diagram_arguments_string, range_diagram_arguments_string, replaced_filter_list, current_string, input_arguments_names, source_argument_name, range_argument_name, source_diagram_arguments_names, range_diagram_arguments_names, equalizer_preprocessing, test_string, additional_preconditions, test_arguments, universal_morphism_with_given_name, call_arguments;0 , limit_colimit in [ "limit" , "colimit" ] );ven_name );if Length( limit.diagram_filter_list ) > 0 and limit.number_of_unbound_morphisms = 0 and (limit.limit_object_name <> limit.colimit_object_name or limit_colimit = "limit" ) then # convenience: derive diagrams from arguments 0 , Length( filter_list ) = 1 );0 , Length( arguments_names ) = 1 );", " );if limit.number_of_targets = 1 then "Source( " , arguments_string, " )" );"Range( " , arguments_string, " )" );else "List( " , arguments_string, ", Source )" );"List( " , arguments_string, ", Range )" );fi ;t ), NameFunction );"" " ## function ( input_arguments... )arguments );end );"" ", # it is safe to use InstallOtherMethodForCompilerForCAP because there is no other two-argument convenience method for functorials "" " ## function ( cat , input_arguments... )cat , source_diagram_arguments, input_arguments..., range_diagram_arguments );end );"" ", "" " ## function ( source, input_arguments..., range )..., range_diagram_arguments, range );end );"" ", # it is safe to use InstallOtherMethodForCompilerForCAP because there is no other four-argument convenience method for with given functorials "" " ## function ( cat , source, input_arguments..., range )cat , source, source_diagram_arguments, input_arguments..., range_diagram_arguments, range );end );"" ", fi ;# derive functorials from the universality of the limit # only do this for limits, colimits will be handled by the automatic dualization of derivations if limit_colimit = "limit" then 0 , Length( limit.diagram_morphism_filter_list ) <= 1 );0 , Length( limit.diagram_morphism_arguments_names ) <= 1 );2 ];# EqualizerFunctorialWithGivenEqualizers would have 8 arguments if the source objects would be given # -> we have to work around this and derive the source objects from the morphism between the diagrams. "" ;if Length( limit.diagram_filter_list ) > 0 then if limit.number_of_targets = 1 then 0 , limit.diagram_morphism_arguments_names = [ "mu" ] );"PreCompose( cat, projection_with_given( cat, source_diagram..., source_object ), mu )" ,"[ PreCompose, 1 ]" , Concatenation( "[ " , limit.limit_projection_with_given_name, ", 1 ]" ) ];if limit.number_of_unbound_morphisms > 1 then if limit.limit_object_name <> "Equalizer" then "This is a hack which might not be valid in general." );fi ;# we are in the Equalizer case, which needs special handling (see above) "local Y, Yp;\n \n Y := Source( mu );\n Yp := Range( mu );\n " ;fi ;else 0 , limit.diagram_morphism_arguments_names = [ "L" ] );"List( [ 1 .. Length( L ) ], i -> PreCompose( cat, projection_with_given( cat, source_diagram..., i, source_object ), L[i] ) )" ,"[ PreCompose, 2 ]" , Concatenation( "[ " , limit.limit_projection_with_given_name, ", 2 ]" ) ];fi ;else 0 , limit.diagram_morphism_arguments_names = [ ] );fi ;me;"cat" ], range_diagram_arguments_names, [ source_argument_name ], test_arguments, [ range_argument_name ] );"" " ## "functorial_with_given_name using the universality of the limit_colimit" ,function ( input_arguments... )end );"" ", "[" , universal_morphism_with_given_name, ", 1 ]" ) ], additional_preconditions ),# derive functorial of empty limits from IdentityMorphism if Length( limit.diagram_filter_list ) = 0 then "" " ## "functorial_name by taking the identity morphism of object_name" ,1 ],1 ] ],function ( cat )cat , object_name( cat ) );end );"" ", fi ;fi ;end ;for limit in limits do if number_of_diagram_arguments > 0 then #### universal morphism convenience e, limit.limit_object_name, "Range" );ame, limit.colimit_object_name, "Source" );fi ;#### functorial convenience method "limit" , limit.limit_object_name, limit.limit_functorial_name, limit.limit_functorial_with_given_name );"colimit" , limit.colimit_object_name, limit.colimit_functorial_name, limit.colimit_functorial_with_given_name );if not IsExistingFileInPackageForHomalg( package_name, "LimitConvenienceOutput.gi" ) or output_string <> ReadFileFromPackageForHomalg( package_name, "LimitConvenienceOutput.gi" ) then "LimitConvenienceOutput.gi" );"WARNING: The file LimitConvenienceOutput.gi differs from the automatically generated one. " ,"You can view the automatically generated file at the following path: " ,fi ;end );
Messung V0.5 in Prozent C=91 H=98 G=94
¤ Dauer der Verarbeitung: 0.186 Sekunden
¤ *© Formatika GbR, Deutschland
