passagemath-gap-pkg-cddinterface 10.6.40__cp311-cp311-macosx_13_0_x86_64.whl

gap/pkg/cddinterface/gap/tools.gd

@@ -0,0 +1,12 @@
+DeclareOperation("PTM", [ IsMatrix ] );
+DeclareOperation( "IsCompatiblePolyhedronList", [IsList] );
+DeclareOperation( "GiveGeneratingVerticesAndGeneratingRays", [ IsList, IsList ] );
+DeclareOperation( "GiveInequalitiesAndEqualities", [ IsList, IsList ] );
+DeclareOperation( "LcmOfDenominatorRatInList", [IsList] );
+DeclareOperation( "CanonicalizeList", [IsList, IsInt] );
+DeclareGlobalFunction( "LIST_TO_CDD_POLYHEDRON" );
+DeclareAttribute( "CDD_POLYHEDRON_TO_LIST", IsCddPolyhedron  );
+DeclareOperation( "GetRidOfLinearity", [ IsCddPolyhedron ] );
+DeclareOperation( "LinearProgramToList", [ IsCddLinearProgram ] );
+DeclareGlobalFunction( "NumberOfDigitsOfTheNumber" );
+DeclareGlobalFunction( "CanonicalizeListOfFacesAndInteriorPoints" );

gap/pkg/cddinterface/gap/tools.gi

@@ -0,0 +1,472 @@
+InstallGlobalFunction( NumberOfDigitsOfTheNumber,
+  function(a)     
+    
+    return Length( String( a ) );
+    
+end);
+
+# this functions prints a matrix in good form
+InstallMethod( PTM,
+            [ IsMatrix ],
+  function( matrix )
+    local i,j,m,t,n;
+    
+    m := 1;
+    
+    n := 1;
+     
+    for i in [ 1 .. Length( matrix ) ] do
+      
+      if n < NumberOfDigitsOfTheNumber( matrix[ i ][ 1 ] ) then
+        
+        n:= NumberOfDigitsOfTheNumber( matrix[ i ][ 1 ] );
+      
+      fi;
+    
+    od;
+    
+    for i in [ 1 .. Length( matrix ) ] do
+      
+      for  j in [ 1 .. Length( matrix[ 1 ] ) ] do
+        
+        if m < NumberOfDigitsOfTheNumber( matrix[ i ][ j ] ) then
+          
+          m := NumberOfDigitsOfTheNumber( matrix[ i ][ j ] );
+        
+        fi;
+      
+      od;
+    
+    od;
+    
+    Print("   ");
+    
+    for i in [ 1 .. Length( matrix[ 1 ] ) * ( m + 2 ) - 2 ] do
+      
+      Print(" ");
+    
+    od;
+    
+    Print( "  ", "\n" );
+    
+    for i in [ 1 .. Length( matrix ) ] do
+      
+      Print( "   " );
+      
+      for j in [ 1 .. Length( matrix[ 1 ] ) ] do
+        
+        if j=1 then 
+                           
+          for t in [ 1 .. n - NumberOfDigitsOfTheNumber( matrix[ i ][ j ] ) ] do
+            
+            Print( " " );
+          
+          od;
+        
+        else 
+          
+          for t in [ 1 .. m + 2 - NumberOfDigitsOfTheNumber( matrix[ i ][ j ] ) ] do
+            
+            Print(" ");
+          
+          od;
+        
+        fi;
+        
+        Print( matrix[ i ][ j ] );
+      
+      od;
+      
+      Print(" ","\n");
+    
+    od;
+    
+end );
+
+##
+InstallMethod( IsCompatiblePolyhedronList,
+               [ IsList ],
+               
+  function ( list )
+    local i;
+    
+    if not ForAll( [1,4,5], i -> list[i] in NonnegativeIntegers) then
+      Error( "The first five entries must be non-negative integers" );
+    fi;
+    
+    if not( IsList( list[6]) and IsList( list[7] ) ) then
+      
+      Error( "The last two arguments should be lists" );
+    
+    fi;
+    
+    if not IsEmpty( list[ 7 ] ) then
+      
+      if NrRows( list[ 7 ] ) <> list[ 4 ] then
+        
+        Error( "The matrix has the wrong number of rows" );
+      
+      fi;
+      
+      if NrCols( list[ 7 ] ) <> list[ 5 ] then
+        
+        Error( "The matrix has the wrong number of columns" );
+      
+      fi;
+    
+    fi;
+    
+    for i in list[ 6 ] do
+       
+       if i > list[ 4 ] then
+         
+         Error( "The linearity is not compatible" );
+       
+       fi;
+    
+    od;
+    
+    return true;
+    
+end );
+
+##
+InstallMethod( LcmOfDenominatorRatInList,
+               [ IsList ],
+               
+  function( list )
+    
+    return Lcm( List( list, DenominatorRat ) );
+    
+end );
+
+##
+InstallGlobalFunction( LIST_TO_CDD_POLYHEDRON,
+  function( arg )
+    local numtype, matrix, L, temp1, temp2, temp3, temp4, p, i;
+    
+    matrix := arg[ 5 ];
+    
+    if not IsEmpty( matrix ) and NrRows( matrix ) > 0 then
+      
+      matrix := CanonicalizeList( matrix, arg[ 1 ] );
+    
+    fi;
+    
+    if arg[ 1 ] = 2 then
+      
+      temp2 := GiveGeneratingVerticesAndGeneratingRays( matrix, [ ] )[ 1 ];
+        
+        if temp2 = [ List( [ 2 .. arg[ 3 ] ], i -> 0 ) ] and
+            not NrRows( matrix ) = 1 then
+
+          temp3 := StructuralCopy( matrix );
+          
+          temp4 := StructuralCopy( arg[ 4 ] );
+          
+          temp1 := [ 1 ];
+          
+          Append( temp1, temp2[ 1 ] );
+          
+          p := Position( temp3, temp1 );
+          
+          Remove( temp3, p );
+          
+          for i in [ p..Length( temp4 ) ] do
+            temp4[ i ]:= temp4[ i ] - 1;
+          od;
+          
+          if Length( arg[ 4 ] ) = 0 then
+            
+            return Cdd_PolyhedronByGenerators( temp3 );
+          
+          else 
+            
+            return Cdd_PolyhedronByGenerators( temp3 , temp4 );
+          
+          fi;
+          
+        fi;
+        
+        if Length( arg[ 4 ] ) = 0 then
+          
+          return Cdd_PolyhedronByGenerators( matrix );
+        
+        else
+          
+          return Cdd_PolyhedronByGenerators( matrix , arg[ 4 ] );
+          
+        fi;
+    
+    else 
+      
+      if arg[ 2 ] = 0 then
+        
+        L := ListWithIdenticalEntries( arg[ 3 ], 0 );
+        L[ 1 ] := 1;
+        return Cdd_PolyhedronByInequalities( [ L ] );
+        
+      fi;
+      
+      if Length( arg[ 4 ] ) = 0 then
+        
+        return Cdd_PolyhedronByInequalities( matrix );
+      
+      else
+        
+        return Cdd_PolyhedronByInequalities( matrix , arg[ 4 ] );
+      
+      fi;
+    
+    fi;
+   
+end );
+
+##
+InstallMethod( CDD_POLYHEDRON_TO_LIST,
+        [ IsCddPolyhedron ],
+  function( poly )
+    local L, matrix, lin, temp;
+    
+    L := [  ];
+    
+    if (poly!.rep_type = "H-rep" ) then
+      L[ 1 ] := 1;
+    else
+      L[ 1 ] := 2;
+    fi;
+    
+    matrix := poly!.matrix;
+    
+    L[ 2 ] := NrRows( matrix );
+    L[ 3 ] := NrCols( matrix );
+    L[ 4 ] := poly!.linearity;
+    L[ 5 ] := matrix;
+    L[ 6 ] := 0;
+    L[ 7 ] := [ ];
+    
+    return L;
+    
+end );
+
+##
+InstallMethod( CanonicalizeList,
+               [ IsList, IsInt ],
+               
+  function( matrix, rep )
+    local res, i;
+    
+    res:= [ ];
+    
+    if rep = 1 then
+    
+      for i in [ 1.. Length( matrix ) ] do
+        
+        if not IsZero( matrix[ i ] ) then
+          
+          res[ i ] := LcmOfDenominatorRatInList( matrix[ i ] )*
+              matrix[ i ] / Iterated(
+                  LcmOfDenominatorRatInList( matrix[ i ] )*matrix[ i ], Gcd
+                                    );
+           
+        else 
+          
+          res[ i ] := matrix[ i ];
+          
+        fi;
+      
+      od;
+      
+      return res;
+      
+    fi;
+    
+    for i in [ 1.. Length( matrix ) ] do
+      
+      if matrix[ i ][ 1 ] = 0 then
+        
+        res[ i ]:= LcmOfDenominatorRatInList( matrix[ i ] )*
+              matrix[ i ] / Iterated(
+                  LcmOfDenominatorRatInList( matrix[ i ] )*matrix[ i ], Gcd
+                                    );
+      
+      else 
+        
+        res[ i ] := matrix[ i ];
+      
+      fi;
+    
+    od;
+    
+    return res;
+    
+end );
+
+InstallMethod( LinearProgramToList,
+    [IsCddLinearProgram ],
+  function( lp )
+    local result;
+    
+    result:= ShallowCopy( CDD_POLYHEDRON_TO_LIST( Cdd_H_Rep( lp!.polyhedron ) ) );
+    
+    if lp!.objective = "max" then
+      
+      result[ 6 ] := 1;
+    
+    else
+      
+      result[ 6 ] := 2;
+    
+    fi;
+    
+    result[ 7 ] := lp!.rowvector;
+    
+    return result;
+    
+end );
+
+###
+
+InstallMethod( GiveGeneratingVerticesAndGeneratingRays,
+               [ IsList, IsList ],
+  function( matrix, linearity )
+    local generating_vertices, generating_rays, current, temp, l, i;
+    
+    generating_vertices:= [  ];
+    
+    generating_rays:= [  ];
+    
+    temp := StructuralCopy( matrix );
+    
+    l := Length( temp );
+    
+    for i in [ 1..l ] do
+      
+      current := temp[ i ];
+      
+      if current[ 1 ] = 1 then
+        
+        Remove( current, 1 );
+        
+        if i in linearity then
+          
+          Add( generating_vertices, current );
+          
+          Add( generating_vertices, -current );
+        
+        else
+          
+          Add( generating_vertices, current );
+        
+        fi;
+       
+      else
+      
+        Remove( current, 1 ); 
+        
+        if not IsZero( current ) then
+          
+          if i in linearity then
+            
+            Add( generating_rays, current );
+            
+            Add( generating_rays, -current );
+          
+          else
+            
+            Add( generating_rays, current );
+          
+          fi;
+        
+        else 
+         
+         Add( generating_vertices, current );
+         
+        fi;
+      
+      fi;
+    
+    od;
+    
+    return [ generating_vertices, generating_rays ];
+    
+end );
+
+####
+InstallMethod( GiveInequalitiesAndEqualities,
+               [ IsList, IsList ],
+  function( matrix, linearity )
+    local equalities, inequalities , current, temp, l, i;
+    
+    inequalities:= [];
+    
+    equalities:= [];
+    
+    l:= Length( matrix );
+    
+    for i in [ 1..l ] do
+      
+      current:= matrix[ i ];
+      
+      if i in linearity then
+        
+        Add( equalities, current );
+      
+      else
+        
+        Add( inequalities, current );
+       
+      fi;
+    
+    od;
+    
+  return [ inequalities, equalities ];
+
+end );
+
+InstallMethod( GetRidOfLinearity,
+               [ IsCddPolyhedron ],
+function( poly )
+  local i, temp;
+  
+  if poly!.rep_type = "V-rep" then
+    
+    Error( "This function is written for H-rep polyhedra" );
+  
+  fi;
+  
+  temp:= StructuralCopy( poly!.matrix );
+  
+  for i in poly!.linearity do
+    
+    Add( temp, -temp[ i ] );
+  
+  od;
+  
+  return Cdd_PolyhedronByInequalities( temp );
+  
+end );
+
+##
+InstallGlobalFunction( CanonicalizeListOfFacesAndInteriorPoints,
+  function( L )
+    local new_L;
+    
+    if IsInt( L ) then
+      
+      return [];
+    
+    elif IsList( L ) and Length( L ) = 3 and IsInt( L[ 1 ] ) then
+      
+      new_L := List( L, ShallowCopy );
+      
+      return [ new_L ];
+    
+    else
+      
+      return Concatenation( List( L, CanonicalizeListOfFacesAndInteriorPoints ) );
+    
+    fi;
+
+end );
+

gap/pkg/cddinterface/init.g

@@ -0,0 +1,17 @@
+#
+# CddInterface: Gap interface to Cdd package
+#
+# Reading the declaration part of the package.
+#
+
+if not LoadKernelExtension("CddInterface") then
+    Error("failed to load the CddInterface package kernel extension");
+fi;
+
+ReadPackage( "CddInterface", "gap/polyhedra.gd");
+ReadPackage( "CddInterface", "gap/tools.gd");
+
+if IsPackageMarkedForLoading( "JuliaInterface", ">= 0.2" ) and
+   IsPackageMarkedForLoading( "ToolsForHomalg", ">= 2020.05.12" ) then
+    ReadPackage( "CddInterface", "gap/Julia.gd");
+fi;

gap/pkg/cddinterface/install.sh

@@ -0,0 +1,64 @@
+#!/bin/bash
+
+set -e # abort upon error
+
+if [ "$#" -ge 1 ]; then
+    gap_path=$1
+    shift
+else
+    gap_path=../..
+fi
+
+current_dir=$(pwd)
+cd $gap_path
+
+if [ -f "sysinfo.gap" ]; then
+    echo "Ok, thanks I found the gap installation."
+else
+    echo "ERROR: It seems that the given location for gap installation is not correct."
+    echo "The given location is $(pwd)."
+    exit 1
+fi
+
+cd $current_dir
+
+echo "## Setting variables"
+echo "I am now in $(pwd)"
+
+cddlib_VERSION=0.94m
+#cddlib_SHA256=?
+cddlib_BASE=cddlib-${cddlib_VERSION}
+cddlib_TAR=${cddlib_BASE}.tar.gz
+cddlib_URL=https://github.com/cddlib/cddlib/releases/download/${cddlib_VERSION}/${cddlib_TAR}
+
+echo
+echo "##"
+echo "## downloading ${cddlib_TAR}"
+echo "##"
+
+rm -rf cddlib*
+rm -rf current_cddlib
+etc/download.sh ${cddlib_URL}
+tar xvf ${cddlib_TAR}
+ln -sf $current_dir/${cddlib_BASE} $current_dir/current_cddlib
+rm -rf ${cddlib_TAR}
+
+echo "##"
+echo "## compiling cddlib ${cddlib_VERSION}"
+echo "##"
+
+cd ${cddlib_BASE}
+mkdir build
+./bootstrap
+./configure --prefix=$(pwd)/build
+make
+make install
+
+echo "##"
+echo "## compiling cdd interface"
+echo "##"
+
+cd $current_dir
+./autogen.sh
+./configure --with-gaproot=${gap_path} --with-cddlib=$(pwd)/current_cddlib/build
+make

gap/pkg/cddinterface/makedoc.g

@@ -0,0 +1,19 @@
+#
+# CddInterface: interface to cdd library
+#
+# This file is a script which compiles the package manual.
+#
+
+if fail = LoadPackage("AutoDoc", ">= 2019.04.10") then
+    Error("AutoDoc 2019.04.10 or newer is required");
+fi;
+
+AutoDoc( 
+        rec(
+            scaffold := rec( entities := [ "GAP4", "homalg" ] ),
+            autodoc := rec( files := [ "doc/intro.autodoc" ] ),
+            #extract_examples := rec( units := "Single" )
+            ) 
+        );
+
+QUIT;

gap/pkg/cddinterface/read.g

@@ -0,0 +1,12 @@
+#
+# CddInterface: Gap interface to Cdd package
+#
+# Reading the implementation part of the package.
+#
+ReadPackage( "CddInterface", "gap/polyhedra.gi");
+ReadPackage( "CddInterface", "gap/tools.gi");
+
+if IsPackageMarkedForLoading( "JuliaInterface", ">= 0.2" ) and
+   IsPackageMarkedForLoading( "ToolsForHomalg", ">= 2020.05.12" ) then
+    ReadPackage( "CddInterface", "gap/Julia.gi");
+fi;

gap/pkg/cddinterface/tst/01.tst

@@ -0,0 +1,37 @@
+# CddInterface, single 1
+#
+# DO NOT EDIT THIS FILE - EDIT EXAMPLES IN THE SOURCE INSTEAD!
+#
+# This file has been generated by AutoDoc. It contains examples extracted from
+# the package documentation. Each example is preceded by a comment which gives
+# the name of a GAPDoc XML file and a line range from which the example were
+# taken. Note that the XML file in turn may have been generated by AutoDoc
+# from some other input.
+#
+gap> START_TEST( "cddinterface01.tst");
+
+# doc/_Chunks.xml:91-113
+gap> A:= Cdd_PolyhedronByInequalities( [ [ 0, 1, 0 ], [ 0, 1, -1 ] ] );
+<Polyhedron given by its H-representation>
+gap> Display( A );
+H-representation
+begin
+   2 X 3  rational
+
+   0   1   0
+   0   1  -1
+end
+gap> B:= Cdd_PolyhedronByInequalities( [ [ 0, 1, 0 ], [ 0, 1, -1 ] ], [ 2 ] );
+<Polyhedron given by its H-representation>
+gap> Display( B );
+H-representation
+linearity 1, [ 2 ]
+begin
+   2 X 3  rational
+
+   0   1   0
+   0   1  -1
+end
+
+#
+gap> STOP_TEST("cddinterface01.tst", 1 );

gap/pkg/cddinterface/tst/02.tst

@@ -0,0 +1,36 @@
+# CddInterface, single 2
+#
+# DO NOT EDIT THIS FILE - EDIT EXAMPLES IN THE SOURCE INSTEAD!
+#
+# This file has been generated by AutoDoc. It contains examples extracted from
+# the package documentation. Each example is preceded by a comment which gives
+# the name of a GAPDoc XML file and a line range from which the example were
+# taken. Note that the XML file in turn may have been generated by AutoDoc
+# from some other input.
+#
+gap> START_TEST( "cddinterface02.tst");
+
+# doc/_Chunks.xml:119-140
+gap> A:= Cdd_PolyhedronByGenerators( [ [ 0, 1, 3 ], [ 1, 4, 5 ] ] );
+<Polyhedron given by its V-representation>
+gap> Display( A );
+V-representation
+begin
+   2 X 3  rational
+
+   0  1  3
+   1  4  5
+end
+gap> B:= Cdd_PolyhedronByGenerators( [ [ 0, 1, 3 ] ], [ 1 ] );
+<Polyhedron given by its V-representation>
+gap> Display( B );
+V-representation
+linearity 1, [ 1 ]
+begin
+   1 X 3  rational
+
+   0  1  3
+end
+
+#
+gap> STOP_TEST("cddinterface02.tst", 1 );

gap/pkg/cddinterface/tst/03.tst

@@ -0,0 +1,50 @@
+# CddInterface, single 3
+#
+# DO NOT EDIT THIS FILE - EDIT EXAMPLES IN THE SOURCE INSTEAD!
+#
+# This file has been generated by AutoDoc. It contains examples extracted from
+# the package documentation. Each example is preceded by a comment which gives
+# the name of a GAPDoc XML file and a line range from which the example were
+# taken. Note that the XML file in turn may have been generated by AutoDoc
+# from some other input.
+#
+gap> START_TEST( "cddinterface03.tst");
+
+# doc/_Chunks.xml:149-184
+gap> P := Cdd_PolyhedronByGenerators( [ [ 1, 1, 2 ], [ 1, 4, 5 ] ] );
+<Polyhedron given by its V-representation>
+gap> H := Cdd_H_Rep( P );
+<Polyhedron given by its H-representation>
+gap> Display( H );
+H-representation
+linearity 1, [ 3 ]
+begin
+   3 X 3  rational
+
+    4  -1   0 
+   -1   1   0 
+   -1  -1   1 
+end
+gap> P_x1 := Cdd_FourierProjection( H, 2);
+<Polyhedron given by its H-representation>
+gap> Display( P_x1 );
+H-representation
+linearity 1, [ 3 ]
+begin
+   3 X 3  rational
+
+    4  -1   0
+   -1   1   0
+    0   0   1
+end
+gap> Display( Cdd_V_Rep( P_x1 ) );
+V-representation
+begin
+   2 X 3  rational
+
+   1  1  0
+   1  4  0
+end
+
+#
+gap> STOP_TEST("cddinterface03.tst", 1 );