Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Adjust to https://github.com/homalg-project/CAP_project/pull/1346 #214

Merged
merged 1 commit into from
Jun 9, 2023
Merged

Adjust to https://github.com/homalg-project/CAP_project/pull/1346 #214

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion PackageInfo.g
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ SetPackageInfo( rec(

PackageName := "FinSetsForCAP",
Subtitle := "The elementary topos of (skeletal) finite sets",
Version := "2023.06-03",
Version := "2023.06-04",

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",
Expand Down
56 changes: 28 additions & 28 deletions gap/precompiled_categories/CategoryOfSkeletalFinSetsWithMorphismsGivenByListsPrecompiled.gi
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -314,7 +314,7 @@ function ( cat_1, s_1, alpha_1, beta_1, r_1 )
return REM_INT( QUO_INT( i_2, deduped_7_1 ^ i_3 ), deduped_7_1 );
end );
return Sum( List( hoisted_6_1, function ( k_3 )
return hoisted_4_1[(1 + hoisted_1_2[(1 + hoisted_3_1[(1 + CAP_JIT_INCOMPLETE_LOGIC( k_3 ))])])] * hoisted_5_1 ^ k_3;
return CAP_JIT_INCOMPLETE_LOGIC( hoisted_4_1[(1 + hoisted_1_2[(1 + hoisted_3_1[(1 + CAP_JIT_INCOMPLETE_LOGIC( k_3 ))])])] ) * hoisted_5_1 ^ k_3;
end ) );
end ) );
end
Expand Down Expand Up @@ -751,61 +751,61 @@ function ( cat_1, l_1, m_1 )
return REM_INT( i_2, deduped_28_1 );
end );
deduped_24_1 := Filtered( deduped_25_1, function ( x_2 )
return deduped_3_1[1 + x_2] = REM_INT( QUO_INT( CAP_JIT_INCOMPLETE_LOGIC( x_2 ), deduped_28_1 ), deduped_28_1 );
return deduped_3_1[1 + x_2] = CAP_JIT_INCOMPLETE_LOGIC( REM_INT( QUO_INT( CAP_JIT_INCOMPLETE_LOGIC( x_2 ), deduped_28_1 ), deduped_28_1 ) );
end );
hoisted_10_1 := AsList( l_1 );
deduped_8_1 := List( deduped_26_1, function ( i_2 )
return REM_INT( i_2, deduped_28_1 );
end );
deduped_23_1 := Filtered( deduped_26_1, function ( x_2 )
return deduped_8_1[1 + x_2] = hoisted_10_1[1 + REM_INT( QUO_INT( CAP_JIT_INCOMPLETE_LOGIC( x_2 ), deduped_28_1 ), deduped_29_1 )];
return deduped_8_1[1 + x_2] = CAP_JIT_INCOMPLETE_LOGIC( hoisted_10_1[1 + REM_INT( QUO_INT( CAP_JIT_INCOMPLETE_LOGIC( x_2 ), deduped_28_1 ), deduped_29_1 )] );
end );
deduped_22_1 := Length( deduped_23_1 );
deduped_21_1 := [ 0 .. deduped_22_1 - 1 ];
hoisted_13_1 := List( deduped_21_1, function ( i_2 )
return REM_INT( QUO_INT( CAP_JIT_INCOMPLETE_LOGIC( deduped_23_1[1 + i_2] ), deduped_28_1 ), deduped_29_1 );
return CAP_JIT_INCOMPLETE_LOGIC( REM_INT( QUO_INT( CAP_JIT_INCOMPLETE_LOGIC( deduped_23_1[1 + i_2] ), deduped_28_1 ), deduped_29_1 ) );
end );
deduped_20_1 := Filtered( [ 0 .. deduped_22_1 * deduped_29_1 - 1 ], function ( x_2 )
local deduped_1_2;
deduped_1_2 := CAP_JIT_INCOMPLETE_LOGIC( x_2 );
return hoisted_13_1[1 + REM_INT( deduped_1_2, deduped_22_1 )] = REM_INT( QUO_INT( deduped_1_2, deduped_22_1 ), deduped_29_1 );
return CAP_JIT_INCOMPLETE_LOGIC( hoisted_13_1[1 + REM_INT( deduped_1_2, deduped_22_1 )] ) = CAP_JIT_INCOMPLETE_LOGIC( REM_INT( QUO_INT( deduped_1_2, deduped_22_1 ), deduped_29_1 ) );
end );
hoisted_17_1 := BigInt( 2 );
deduped_5_1 := AsList( m_1 );
hoisted_15_1 := List( deduped_21_1, function ( i_2 )
return deduped_5_1[1 + deduped_8_1[(1 + deduped_23_1[(1 + i_2)])]];
end );
hoisted_16_1 := List( [ 0 .. Length( deduped_20_1 ) - 1 ], function ( i_2 )
return hoisted_15_1[1 + REM_INT( CAP_JIT_INCOMPLETE_LOGIC( deduped_20_1[(1 + i_2)] ), deduped_22_1 )];
return hoisted_15_1[1 + CAP_JIT_INCOMPLETE_LOGIC( REM_INT( CAP_JIT_INCOMPLETE_LOGIC( deduped_20_1[(1 + i_2)] ), deduped_22_1 ) )];
end );
hoisted_6_1 := List( [ 0 .. Length( deduped_24_1 ) - 1 ], function ( i_2 )
return deduped_5_1[1 + deduped_3_1[(1 + deduped_24_1[(1 + i_2)])]];
end );
deduped_19_1 := SSortedList( Filtered( [ 0 .. deduped_27_1 - 1 ], function ( x_2 )
local deduped_1_2;
deduped_1_2 := CAP_JIT_INCOMPLETE_LOGIC( REM_INT( CAP_JIT_INCOMPLETE_LOGIC( x_2 ), deduped_27_1 ) );
return IdFunc( function ( )
if (IdFunc( function ( )
if (deduped_1_2 in hoisted_6_1) then
return deduped_32_1;
else
return deduped_31_1;
fi;
return;
end )( ) + IdFunc( function ( )
if (deduped_1_2 in hoisted_16_1) then
return deduped_32_1;
else
return deduped_31_1;
fi;
return;
end )( ) * hoisted_17_1 = deduped_32_1) then
return deduped_31_1;
else
return deduped_32_1;
fi;
return;
end )( ) = deduped_32_1;
return CAP_JIT_INCOMPLETE_LOGIC( IdFunc( function ( )
if (CAP_JIT_INCOMPLETE_LOGIC( IdFunc( function ( )
if (deduped_1_2 in hoisted_6_1) then
return deduped_32_1;
else
return deduped_31_1;
fi;
return;
end )( ) ) + CAP_JIT_INCOMPLETE_LOGIC( IdFunc( function ( )
if (deduped_1_2 in hoisted_16_1) then
return deduped_32_1;
else
return deduped_31_1;
fi;
return;
end )( ) ) * hoisted_17_1 = deduped_32_1) then
return deduped_31_1;
else
return deduped_32_1;
fi;
return;
end )( ) ) = deduped_32_1;
end ) );
return CreateCapCategoryMorphismWithAttributes( cat_1, CreateCapCategoryObjectWithAttributes( cat_1, Length, BigInt( Length( deduped_19_1 ) ) ), deduped_30_1, AsList, deduped_19_1 );
end
Expand Down