passagemath-gap-pkg-cddinterface 10.6.23__cp310-cp310-musllinux_1_2_aarch64.whl

gap/pkg/cddinterface/configure.ac

@@ -0,0 +1,84 @@
+#
+# CddInterface: Gap interface to Cdd package
+#
+# This file is part of the build system of a GAP kernel extension.
+# Requires GNU autoconf, GNU automake and GNU libtool.
+#
+
+dnl ##
+dnl ## Setup autoconf
+dnl ##
+AC_PREREQ([2.68])
+AC_INIT([CddInterface], [package])
+AC_CONFIG_SRCDIR([src/CddInterface.c])
+AC_CONFIG_MACRO_DIR([m4])
+AC_CONFIG_HEADERS([src/config.h])
+m4_include([m4/find_gap.m4])
+
+dnl ##
+dnl ## Set the language
+dnl ##
+AC_PROG_CC
+AC_LANG([C])
+
+dnl ##
+dnl ## Locate the GAP root dir
+dnl ##
+FIND_GAP
+
+dnl ##
+dnl ## Set cdd root dir
+dnl ##
+AC_ARG_WITH([cddlib],
+    [AS_HELP_STRING([--with-cddlib=<path>], [specify the path of cdd installation])],
+    [], [with_cddlib=yes])
+AS_IF([test "x$with_cddlib" = "xno"], [AC_MSG_ERROR([cddlib is required and cannot be disabled])])
+
+# if no path was given. as a special consideration, detect if the user has cddlib
+# installed via Homebrew (on macOS), and if so, use that
+AS_IF([test "x$with_cddlib" = "xyes"],[
+  AS_IF([command -v brew >/dev/null 2>&1],[
+    AC_MSG_NOTICE([BREW detected])
+    with_cddlib=$(brew --prefix)
+  ])
+])
+
+AS_IF([test "x$with_cddlib" != "xyes"],[
+  # Debian and Ubuntu put the headers into PREFIX/include/cdd, while on
+  # e.g. homebrew the headers are in PREFIX/include/cddlib. Finally in
+  # some cases, the headers are directly in PREFIX/include/ -- so we
+  # just add all three to the CPPFLAGS
+  AS_IF([test -d "$with_cddlib"],[],[AC_MSG_ERROR([the cddlib path is not a directory])])
+  CDD_CPPFLAGS="-I$with_cddlib/include/cdd -I$with_cddlib/include/cddlib -I$with_cddlib/include"
+  CDD_LDFLAGS="-L$with_cddlib/lib -lcddgmp -lgmp"
+],[
+  CDD_CPPFLAGS="-I/usr/include/cdd -I/usr/include/cddlib"
+  CDD_LDFLAGS="-lcddgmp -lgmp"
+])
+AC_SUBST(CDD_CPPFLAGS)
+AC_SUBST(CDD_LDFLAGS)
+
+dnl check that cddlib actually is usable
+old_CPPFLAGS="$CPPFLAGS"
+old_LDFLAGS="$LDFLAGS"
+CPPFLAGS="$CPPFLAGS $CDD_CPPFLAGS"
+LDFLAGS="$LDFLAGS $CDD_LDFLAGS"
+
+AC_CHECK_HEADER(
+  [cddlib/setoper.h],
+  [AC_DEFINE([HAVE_CDDLIB_SETOPER_H], [1], [setting HAVE_CDDLIB_SETOPER_H=1])],
+  [AC_CHECK_HEADER(
+    [setoper.h],
+    [AC_DEFINE([HAVE_CDDLIB_SETOPER_H], [0], [setting HAVE_CDDLIB_SETOPER_H=0])],
+    [AC_MSG_ERROR([could not find setoper.h])])])
+
+AC_CHECK_LIB([cddgmp],[dd_SetLinearity])
+CPPFLAGS="$old_CPPFLAGS"
+LDFLAGS="$old_LDFLAGS"
+
+
+dnl ##
+dnl ## Output everything
+dnl ##
+AC_CONFIG_FILES([Makefile])
+AC_OUTPUT

gap/pkg/cddinterface/etc/download.sh

@@ -0,0 +1,86 @@
+#!/bin/sh
+#
+# Download a file and verify its checksum; repeat until
+# the checksum matches or the user told us to give up.
+# This nice script is taken from NormalizInterface. (kamal saleh)
+
+set -e
+
+usage() {
+    cat <<EOF
+Usage: $0 URL [SHA256 [FILENAME]]
+EOF
+
+    exit $1
+}
+
+if [ $# -lt 1 ]; then
+    usage 1
+fi
+if [ $# -gt 3 ]; then
+    usage 1
+fi
+
+FileURL="$1"
+ExpectedChecksum="$2"
+if [ $# = 3 ]; then
+    Filename="$3"
+else
+    Filename=$(basename ${FileURL})
+fi
+
+while : ; do
+
+    #
+    # Download
+    #
+    if [ -e ${Filename} ] ; then
+        echo "Checking for ${Filename}... found existing file, using that"
+        # TODO: add a checksum check?
+    elif command -v wget >/dev/null 2>&1 ; then
+        echo "Checking for ${Filename}... downloading with wget"
+        wget ${FileURL}
+    elif command -v curl >/dev/null 2>&1 ; then
+        echo "Checking for ${Filename}... downloading with curl"
+        curl -L -O ${FileURL}
+    else
+        echo "Checking for ${Filename}... not found and unable to download"
+        echo
+        echo "Please manually download the following file:"
+        echo "  ${FileURL}"
+        echo "Put it into the current directory and re-run this script."
+        exit 1
+    fi
+
+    #
+    # Compute checksum
+    #
+    echo "Verifying SHA256 checksum of ${Filename}..."
+    if command -v sha256sum >/dev/null 2>&1 ; then
+        ActualChecksum=$(sha256sum ${Filename})
+    elif command -v shasum >/dev/null 2>&1 ; then
+        ActualChecksum=$(shasum -a 256 ${Filename})
+    elif command -v openssl >/dev/null 2>&1 ; then
+        ActualChecksum=$(openssl sha256 ${Filename})
+    else
+        ActualChecksum=skip
+    fi
+
+    #
+    # Compare checksum
+    #
+    case ${ActualChecksum} in
+       *${ExpectedChecksum}* )
+           echo "   valid SHA256 checksum"
+           break
+           ;;
+       *)  echo "   invalid SHA256 checksum, expected ${ExpectedChecksum} but got ${ActualChecksum}"
+           echo "     retrying in 30 seconds..."
+           sleep 30
+           rm -f ${Filename}
+           ;;
+    esac
+
+done;
+
+exit 0

gap/pkg/cddinterface/examples/30x30.g

@@ -0,0 +1,5 @@
+LoadPackage( "CddInterface" );
+
+L := List( [ 1 .. 30 ], i -> List( [ 1 .. 30 ], j-> Random( [ 1 .. 10 ] ) ) );
+C := Cdd_PolyhedronByInequalities( L );
+#V := Cdd_V_Rep( C );

gap/pkg/cddinterface/examples/FourierProjection.g

@@ -0,0 +1,83 @@
+LoadPackage( "CddInterface" );
+
+#! @Chunk Fourier
+#! To illustrate this projection, Let  $P= \mathrm{conv}( (1,2), (4,5) )$ in $\mathbb{Q}^2$.
+#! $\newline$
+#! To find its projection on the subspace $(O, x_1)$, we apply the Fourier elemination to get rid of $x_2$
+#! @Example
+P := Cdd_PolyhedronByGenerators( [ [ 1, 1, 2 ], [ 1, 4, 5 ] ] );
+#! <Polyhedron given by its V-representation>
+H := Cdd_H_Rep( P );
+#! <Polyhedron given by its H-representation>
+Display( H );
+#! H-representation
+#! linearity 1, [ 3 ]
+#! begin
+#!    3 X 3  rational
+#!
+#!     4  -1   0 
+#!    -1   1   0 
+#!    -1  -1   1 
+#! end
+P_x1 := Cdd_FourierProjection( H, 2);
+#! <Polyhedron given by its H-representation>
+Display( P_x1 );
+#! H-representation
+#! linearity 1, [ 3 ]
+#! begin
+#!    3 X 3  rational
+#!
+#!     4  -1   0
+#!    -1   1   0
+#!     0   0   1
+#! end
+Display( Cdd_V_Rep( P_x1 ) );
+#! V-representation
+#! begin
+#!    2 X 3  rational
+#!
+#!    1  1  0
+#!    1  4  0
+#! end
+
+#! @EndExample
+#! Let again $Q= Conv( (2,3,4), (2,4,5) )+ nonneg( (1,1,1) )$, and let us compute its projection on $(O,x_2,x_3)$
+#! @Example
+Q := Cdd_PolyhedronByGenerators( [ [ 1, 2, 3, 4 ],[ 1, 2, 4, 5 ], [ 0, 1, 1, 1 ] ] );
+#! <Polyhedron given by its V-representation>
+R := Cdd_H_Rep( Q );
+#! <Polyhedron given by its H-representation>
+Display( R );
+#! H-representation
+#! linearity 1, [ 4 ]
+#! begin
+#!    4 X 4  rational
+#!
+#!     2   1  -1   0 
+#!    -2   1   0   0 
+#!    -1  -1   1   0 
+#!    -1   0  -1   1 
+#! end
+P_x2_x3 := Cdd_FourierProjection( R, 1);
+#! <Polyhedron given by its H-representation>
+Display( P_x2_x3 );
+#! H-representation
+#! linearity 2, [ 1, 3 ]
+#! begin
+#!    3 X 4  rational
+#!
+#!    -1   0  -1   1 
+#!    -3   0   1   0 
+#!     0   1   0   0 
+#! end
+Display( Cdd_V_Rep( last ) ) ;
+#! V-representation 
+#! begin
+#!    2 X 4  rational
+#!                
+#!    0  0  1  1 
+#!    1  0  3  4 
+#! end
+#! @EndExample
+#! @EndChunk
+

gap/pkg/cddinterface/examples/comparing_polyhedrons.g

@@ -0,0 +1,32 @@
+
+LoadPackage( "CddInterface" );
+
+#! @BeginChunk comparing_polyhedrons
+#! @BeginExample
+A := Cdd_PolyhedronByInequalities( [ [ 10, -1, 1, 0 ],
+[ -24, 9, 2, 0 ], [ 1, 1, -1, 0 ], [ -23, -12, 1, 11 ] ], [ 4 ] );
+#! <Polyhedron given by its H-representation>
+B := Cdd_PolyhedronByInequalities( [ [ 1, 0, 0, 0 ],
+[ -4, 1, 0, 0 ], [ 10, -1, 1, 0 ], [ -3, -1, 0, 1 ] ], [ 3, 4 ] );
+#! <Polyhedron given by its H-representation>
+Cdd_IsContained( B, A );
+#! true
+Display( Cdd_V_Rep( A ) );
+#! V-representation
+#! begin
+#!    3 X 4  rational
+#!
+#!    1   2   3   4
+#!    1   4  -6   7
+#!    0   1   1   1
+#! end
+Display( Cdd_V_Rep( B ) );
+#! V-representation
+#! begin
+#!    2 X 4  rational
+#!
+#!    1   4  -6   7
+#!    0   1   1   1
+#! end
+#! @EndExample
+#! @EndChunk

gap/pkg/cddinterface/examples/demo.g

@@ -0,0 +1,65 @@
+
+
+LoadPackage( "CddInterface" );
+
+#! @Chunk demo
+#! @Example
+poly:= Cdd_PolyhedronByInequalities( [ [ 1, 3, 4, 5, 7 ], [ 1, 3, 5, 12, 34 ],
+[ 9, 3, 0, 2, 13 ]  ], [ 1 ] );
+#! <Polyhedron given by its H-representation>
+Cdd_InteriorPoint( poly );
+#! [ -194/75, 46/25, -3/25, 0 ]
+
+Cdd_FacesWithInteriorPoints( poly );
+#! [ [ 3, [ 1 ], [ -194/75, 46/25, -3/25, 0 ] ], [ 2, [ 1, 2 ],
+#! [ -62/25, 49/25, -7/25, 0 ] ], [ 1, [ 1, 2, 3 ],
+#! [ -209/75, 56/25, -8/25, 0 ] ], [ 2, [ 1, 3 ], [ -217/75, 53/25, -4/25, 0 ] ] ]
+
+Cdd_Dimension( poly );
+#! 3
+Cdd_IsPointed( poly );
+#! false
+Cdd_IsEmpty( poly );
+#! false
+Cdd_Faces( poly );
+#! [ [ 3, [ 1 ] ], [ 2, [ 1, 2 ] ], [ 1, [ 1, 2, 3 ] ], [ 2, [ 1, 3  ] ] ]
+poly1 := Cdd_ExtendLinearity( poly, [ 1, 2, 3 ] );
+#! <Polyhedron given by its H-representation>
+Display( poly1 );
+#! H-representation 
+#! linearity 3, [ 1, 2, 3 ]
+#! begin
+#!    3 X 5  rational
+#!
+#!    1   3   4   5   7 
+#!    1   3   5  12  34 
+#!    9   3   0   2  13 
+#! end
+Cdd_Dimension( poly1 );
+#! 1
+Cdd_Facets( poly );
+#! [ [ 1, 2 ], [ 1, 3 ] ]
+Cdd_GeneratingVertices( poly );
+#! [ [ -209/75, 56/25, -8/25, 0 ] ]
+Cdd_GeneratingRays( poly );
+#! [ [ -97, 369, -342, 75 ], [ -8, -9, 12, 0 ],
+#! [ 23, -21, 3, 0 ], [ 97, -369, 342, -75 ] ]
+Cdd_Inequalities( poly );
+#! [ [ 1, 3, 5, 12, 34 ], [ 9, 3, 0, 2, 13 ] ]
+Cdd_Equalities( poly );
+#! [ [ 1, 3, 4, 5, 7 ] ]
+P := Cdd_FourierProjection( poly, 2);
+#! <Polyhedron given by its H-representation>
+Display( P );
+#! H-representation 
+#! linearity 1, [ 3 ]
+#! begin 
+#!    3 X 5  rational
+#!
+#!     9    3    0    2   13 
+#!    -1   -3    0   23  101 
+#!     0    0    1    0    0 
+#! end
+#! @EndExample
+#! @EndChunk
+

gap/pkg/cddinterface/examples/example1.g

@@ -0,0 +1,115 @@
+LoadPackage("CddInterface");
+
+#! @Chunk Example1
+#! @Example
+A:= Cdd_PolyhedronByInequalities( [ [ 0, 1, 0 ], [ 0, 1, -1 ] ] );
+#! <Polyhedron given by its H-representation>
+Display( A );
+#! H-representation
+#! begin
+#!    2 X 3  rational
+#!
+#!    0   1   0
+#!    0   1  -1
+#! end
+B:= Cdd_PolyhedronByInequalities( [ [ 0, 1, 0 ], [ 0, 1, -1 ] ], [ 2 ] );
+#! <Polyhedron given by its H-representation>
+Display( B );
+#! H-representation
+#! linearity 1, [ 2 ]
+#! begin
+#!    2 X 3  rational
+#!
+#!    0   1   0
+#!    0   1  -1
+#! end
+#! @EndExample
+#! @EndChunk
+
+
+#! @Chunk Example2
+#! @Example
+A:= Cdd_PolyhedronByGenerators( [ [ 0, 1, 3 ], [ 1, 4, 5 ] ] );
+#! <Polyhedron given by its V-representation>
+Display( A );
+#! V-representation
+#! begin
+#!    2 X 3  rational
+#!
+#!    0  1  3
+#!    1  4  5
+#! end
+B:= Cdd_PolyhedronByGenerators( [ [ 0, 1, 3 ] ], [ 1 ] );
+#! <Polyhedron given by its V-representation>
+Display( B );
+#! V-representation
+#! linearity 1, [ 1 ]
+#! begin
+#!    1 X 3  rational
+#!
+#!    0  1  3
+#! end
+#! @EndExample
+#! @EndChunk
+
+#! @Chunk Example3
+#! @Example
+A:= Cdd_PolyhedronByInequalities( [ [ 0, 2, 6 ], [ 0, 1, 3 ], [1, 4, 10 ] ] );
+#! <Polyhedron given by its H-representation>
+B:= Cdd_Canonicalize( A );
+#! <Polyhedron given by its H-representation>
+Display( B );
+#! H-representation
+#! begin
+#!    2 X 3  rational
+#!
+#!    0   1   3
+#!    1   4  10
+#! end
+#! @EndExample
+#! @EndChunk
+
+#! @Chunk Example4
+#! @Example
+A:= Cdd_PolyhedronByInequalities( [ [ 0, 1, 1 ], [ 0, 5, 5 ] ] );
+#! <Polyhedron given by its H-representation>
+B:= Cdd_V_Rep( A );
+#! <Polyhedron given by its V-representation>
+Display( B );
+#! V-representation
+#! linearity 1, [ 2 ]
+#! begin
+#!    2 X 3  rational
+#!
+#!    0   1   0
+#!    0  -1   1
+#! end
+C:= Cdd_H_Rep( B );
+#! <Polyhedron given by its H-representation>
+Display( C );
+#! H-representation
+#! begin
+#!    1 X 3  rational
+#!
+#!    0  1  1
+#! end
+D:= Cdd_PolyhedronByInequalities( [ [ 0, 1, 1, 34, 22, 43 ],
+[ 11, 2, 2, 54, 53, 221 ], [33, 23, 45, 2, 40, 11 ] ] );
+#! <Polyhedron given by its H-representation>
+Cdd_V_Rep( D );
+#! <Polyhedron given by its V-representation>
+Display( last );
+#! V-representation
+#! linearity 2, [ 5, 6 ]
+#! begin
+#!    6 X 6  rational
+#!
+#!    1  -743/14   369/14    11/14        0        0
+#!    0    -1213      619       22        0        0
+#!    0       -1        1        0        0        0
+#!    0      764     -390      -11        0        0
+#!    0   -13526     6772       99      154        0
+#!    0  -116608    59496     1485        0      154
+#! end
+#! @EndExample
+#! @EndChunk

gap/pkg/cddinterface/examples/intersection.g

@@ -0,0 +1,35 @@
+LoadPackage( "CddInterface" );
+
+#! @BeginChunk intersection
+#! @BeginExample
+A := Cdd_PolyhedronByInequalities( [ [ 3, 4, 5 ] ], [ 1 ] );;
+B := Cdd_PolyhedronByInequalities( [ [ 9, 7, 2 ] ], [ 1 ] );;
+C := Cdd_Intersection( A, B );;
+Display( Cdd_V_Rep( A ) );
+#! V-representation
+#! linearity 1, [ 2 ]
+#! begin
+#!    2 X 3  rational
+#!
+#!    1  -3/4     0
+#!    0    -5     4
+#! end
+Display( Cdd_V_Rep( B ) );
+#! V-representation
+#! linearity 1, [ 2 ]
+#! begin
+#!    2 X 3  rational
+#!
+#!    1  -9/7     0
+#!    0    -2     7
+#! end
+Display( Cdd_V_Rep( C ) );
+#! V-representation
+#! begin
+#!    1 X 3  rational
+#!
+#!    1  -13/9    5/9
+#! end
+#! @EndExample
+#! @EndChunk
+

gap/pkg/cddinterface/examples/linear_programs.g

@@ -0,0 +1,64 @@
+LoadPackage( "CddInterface" );
+
+#! @Chunk Example5
+#! To illustrate the using of these functions, let us solve the linear program given by:
+#! $$\textbf{Maximize}\;\;P(x,y)= 1-2x+5y,\;\mathrm{with}$$
+#! $$100\leq x \leq 200,80\leq y\leq 170,y \geq -x+200.$$
+#! We bring the inequalities to the form $b+AX\geq 0$ and get:
+#! $$-100+x\geq 0, 200-x \geq 0, -80+y \geq 0, 170 -y \geq 0,-200 +x+y \geq 0.$$
+#! @Example
+A:= Cdd_PolyhedronByInequalities( [ [ -100, 1, 0 ], [ 200, -1, 0 ],
+[ -80, 0, 1 ], [ 170, 0, -1 ], [ -200, 1, 1 ] ] );
+#! <Polyhedron given by its H-representation>
+lp1:= Cdd_LinearProgram( A, "max", [1, -2, 5 ] );
+#! <Linear program>
+Display( lp1 );
+#! Linear program given by:
+#! H-representation
+#! begin
+#!    5 X 3  rational
+#!
+#!    -100     1     0
+#!     200    -1     0
+#!     -80     0     1
+#!     170     0    -1
+#!    -200     1     1
+#! end
+#! max  [ 1, -2, 5 ]
+Cdd_SolveLinearProgram( lp1 );
+#! [ [ 100, 170 ], 651 ]
+lp2:= Cdd_LinearProgram( A, "min", [ 1, -2, 5 ] );
+#! <Linear program>
+Display( lp2 );
+#! Linear program given by:
+#! H-representation
+#! begin
+#!    5 X 3  rational
+#!
+#!    -100     1     0
+#!     200    -1     0
+#!     -80     0     1
+#!     170     0    -1
+#!    -200     1     1
+#! end
+#! min  [ 1, -2, 5 ]
+Cdd_SolveLinearProgram( lp2 );
+#! [ [ 200, 80 ], 1 ]
+B:= Cdd_V_Rep( A );
+#! <Polyhedron given by its V-representation>
+Display( B );
+#! V-representation
+#! begin
+#!    5 X 3  rational
+#!
+#!    1  100  170
+#!    1  100  100
+#!    1  120   80
+#!    1  200   80
+#!    1  200  170
+#! end
+#! @EndExample
+#! So the optimal solution for $\texttt{lp1}$ is $(x=100,y=170)$ with optimal value $p=1-2(100)+5(170)=651$ and for $\texttt{lp2}$ is
+#! $(x=200,y=80)$ with optimal value $p=1-2(200)+5(80)=1$.
+#! @EndChunk
+

gap/pkg/cddinterface/examples/minkuwski.g

@@ -0,0 +1,35 @@
+#! @Chunk minkuwski
+#! @Example
+P := Cdd_PolyhedronByGenerators( [ [ 1, 2, 5 ], [ 0, 1, 2 ] ] );
+#! < Polyhedron given by its V-representation >
+Q := Cdd_PolyhedronByGenerators( [ [ 1, 4, 6 ], [ 1, 3, 7 ], [ 0, 3, 1 ] ] );
+#! < Polyhedron given by its V-representation >
+S := P+Q;
+#! < Polyhedron given by its H-representation >
+V := Cdd_V_Rep( S );
+#! < Polyhedron given by its V-representation >
+Display( V );
+#! V-representation 
+#! begin
+#!    4 X 3  rational
+#!
+#!    0   3   1 
+#!    1   6  11 
+#!    1   5  12 
+#!    0   1   2 
+#! end
+Cdd_GeneratingVertices( P ); 
+#! [ [ 2, 5 ] ]
+Cdd_GeneratingVertices( Q );
+#! [ [ 3, 7 ], [ 4, 6 ] ]
+Cdd_GeneratingVertices( S );
+#! [ [ 5, 12 ], [ 6, 11 ] ]
+Cdd_GeneratingRays( P );
+#! [ [ 1, 2 ] ]
+Cdd_GeneratingRays( Q );
+#! [ [ 3, 1 ] ]
+Cdd_GeneratingRays( S );
+#! [ [ 1, 2 ], [ 3, 1 ] ]
+#! @EndExample
+#! @EndChunk
+

gap/pkg/cddinterface/examples/new.g

@@ -0,0 +1,5 @@
+LoadPackage( "Cdd" );
+
+C := Cdd_PolyhedronByInequalities( [ [ 0, 1, 1 ] ] );
+
+D := Cdd_V_Rep( C );

gap/pkg/cddinterface/examples/new2.g

@@ -0,0 +1,8 @@
+LoadPackage( "Cdd" );
+f := function( m, n )
+local L, C;
+
+L := List( [ 1 .. m ], i -> List( [ 1.. n ], j -> i*j ) );
+
+return Cdd_PolyhedronByInequalities( L );
+end;

gap/pkg/cddinterface/gap/Julia.gd

@@ -0,0 +1,3 @@
+DeclareGlobalFunction( "cdd_prepare_gap_input" );
+DeclareGlobalFunction( "cdd_PolyhedronByInequalities" );
+DeclareGlobalFunction( "cdd_PolyhedronByGenerators" );

gap/pkg/cddinterface/gap/Julia.gi

@@ -0,0 +1,15 @@
+##
+InstallGlobalFunction( cdd_PolyhedronByInequalities,
+ function( arg )
+    
+    return CallFuncList( Cdd_PolyhedronByInequalities, ConvertJuliaToGAP( arg ) );
+    
+end );
+
+##
+InstallGlobalFunction( cdd_PolyhedronByGenerators,
+ function( arg )
+    
+    return CallFuncList( Cdd_PolyhedronByGenerators, ConvertJuliaToGAP( arg ) );
+    
+end );