passagemath-gap-pkg-cddinterface 10.6.40__cp311-cp311-macosx_13_0_x86_64.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- gap/pkg/cddinterface/LICENSE +344 -0
- gap/pkg/cddinterface/PackageInfo.g +103 -0
- gap/pkg/cddinterface/README.md +129 -0
- gap/pkg/cddinterface/ToDo.txt +2 -0
- gap/pkg/cddinterface/bin/x86_64-apple-darwin24-default64-kv10/CddInterface.so +0 -0
- gap/pkg/cddinterface/etc/download.sh +86 -0
- gap/pkg/cddinterface/examples/30x30.g +5 -0
- gap/pkg/cddinterface/examples/FourierProjection.g +83 -0
- gap/pkg/cddinterface/examples/comparing_polyhedrons.g +32 -0
- gap/pkg/cddinterface/examples/demo.g +65 -0
- gap/pkg/cddinterface/examples/example1.g +115 -0
- gap/pkg/cddinterface/examples/intersection.g +35 -0
- gap/pkg/cddinterface/examples/linear_programs.g +64 -0
- gap/pkg/cddinterface/examples/minkuwski.g +35 -0
- gap/pkg/cddinterface/examples/new.g +5 -0
- gap/pkg/cddinterface/examples/new2.g +8 -0
- gap/pkg/cddinterface/gap/Julia.gd +3 -0
- gap/pkg/cddinterface/gap/Julia.gi +15 -0
- gap/pkg/cddinterface/gap/polyhedra.gd +268 -0
- gap/pkg/cddinterface/gap/polyhedra.gi +871 -0
- gap/pkg/cddinterface/gap/tools.gd +12 -0
- gap/pkg/cddinterface/gap/tools.gi +472 -0
- gap/pkg/cddinterface/init.g +17 -0
- gap/pkg/cddinterface/install.sh +64 -0
- gap/pkg/cddinterface/makedoc.g +19 -0
- gap/pkg/cddinterface/read.g +12 -0
- gap/pkg/cddinterface/tst/01.tst +37 -0
- gap/pkg/cddinterface/tst/02.tst +36 -0
- gap/pkg/cddinterface/tst/03.tst +50 -0
- gap/pkg/cddinterface/tst/04.tst +51 -0
- gap/pkg/cddinterface/tst/05.tst +41 -0
- gap/pkg/cddinterface/tst/06.tst +44 -0
- gap/pkg/cddinterface/tst/07.tst +46 -0
- gap/pkg/cddinterface/tst/08.tst +66 -0
- gap/pkg/cddinterface/tst/09.tst +28 -0
- gap/pkg/cddinterface/tst/10.tst +56 -0
- gap/pkg/cddinterface/tst/11.tst +70 -0
- gap/pkg/cddinterface/tst/etest_1.tst +6 -0
- gap/pkg/cddinterface/tst/etest_2.tst +33 -0
- gap/pkg/cddinterface/tst/testall.g +10 -0
- passagemath_gap_pkg_cddinterface/.dylibs/libcddgmp.0.dylib +0 -0
- passagemath_gap_pkg_cddinterface/.dylibs/libgmp.10.dylib +0 -0
- passagemath_gap_pkg_cddinterface/__init__.py +3 -0
- passagemath_gap_pkg_cddinterface-10.6.40.dist-info/METADATA +93 -0
- passagemath_gap_pkg_cddinterface-10.6.40.dist-info/METADATA.bak +94 -0
- passagemath_gap_pkg_cddinterface-10.6.40.dist-info/RECORD +51 -0
- passagemath_gap_pkg_cddinterface-10.6.40.dist-info/WHEEL +6 -0
- passagemath_gap_pkg_cddinterface-10.6.40.dist-info/top_level.txt +2 -0
- sage/all__sagemath_gap_pkg_cddinterface.py +1 -0
- sage/libs/all__sagemath_gap_pkg_cddinterface.py +1 -0
- sage/libs/gap_pkg_cddinterface.cpython-311-darwin.so +0 -0
|
@@ -0,0 +1,51 @@
|
|
|
1
|
+
# CddInterface, single 4
|
|
2
|
+
#
|
|
3
|
+
# DO NOT EDIT THIS FILE - EDIT EXAMPLES IN THE SOURCE INSTEAD!
|
|
4
|
+
#
|
|
5
|
+
# This file has been generated by AutoDoc. It contains examples extracted from
|
|
6
|
+
# the package documentation. Each example is preceded by a comment which gives
|
|
7
|
+
# the name of a GAPDoc XML file and a line range from which the example were
|
|
8
|
+
# taken. Note that the XML file in turn may have been generated by AutoDoc
|
|
9
|
+
# from some other input.
|
|
10
|
+
#
|
|
11
|
+
gap> START_TEST( "cddinterface04.tst");
|
|
12
|
+
|
|
13
|
+
# doc/_Chunks.xml:188-224
|
|
14
|
+
gap> Q := Cdd_PolyhedronByGenerators( [ [ 1, 2, 3, 4 ],[ 1, 2, 4, 5 ], [ 0, 1, 1, 1 ] ] );
|
|
15
|
+
<Polyhedron given by its V-representation>
|
|
16
|
+
gap> R := Cdd_H_Rep( Q );
|
|
17
|
+
<Polyhedron given by its H-representation>
|
|
18
|
+
gap> Display( R );
|
|
19
|
+
H-representation
|
|
20
|
+
linearity 1, [ 4 ]
|
|
21
|
+
begin
|
|
22
|
+
4 X 4 rational
|
|
23
|
+
|
|
24
|
+
2 1 -1 0
|
|
25
|
+
-2 1 0 0
|
|
26
|
+
-1 -1 1 0
|
|
27
|
+
-1 0 -1 1
|
|
28
|
+
end
|
|
29
|
+
gap> P_x2_x3 := Cdd_FourierProjection( R, 1);
|
|
30
|
+
<Polyhedron given by its H-representation>
|
|
31
|
+
gap> Display( P_x2_x3 );
|
|
32
|
+
H-representation
|
|
33
|
+
linearity 2, [ 1, 3 ]
|
|
34
|
+
begin
|
|
35
|
+
3 X 4 rational
|
|
36
|
+
|
|
37
|
+
-1 0 -1 1
|
|
38
|
+
-3 0 1 0
|
|
39
|
+
0 1 0 0
|
|
40
|
+
end
|
|
41
|
+
gap> Display( Cdd_V_Rep( last ) ) ;
|
|
42
|
+
V-representation
|
|
43
|
+
begin
|
|
44
|
+
2 X 4 rational
|
|
45
|
+
|
|
46
|
+
0 0 1 1
|
|
47
|
+
1 0 3 4
|
|
48
|
+
end
|
|
49
|
+
|
|
50
|
+
#
|
|
51
|
+
gap> STOP_TEST("cddinterface04.tst", 1 );
|
|
@@ -0,0 +1,41 @@
|
|
|
1
|
+
# CddInterface, single 5
|
|
2
|
+
#
|
|
3
|
+
# DO NOT EDIT THIS FILE - EDIT EXAMPLES IN THE SOURCE INSTEAD!
|
|
4
|
+
#
|
|
5
|
+
# This file has been generated by AutoDoc. It contains examples extracted from
|
|
6
|
+
# the package documentation. Each example is preceded by a comment which gives
|
|
7
|
+
# the name of a GAPDoc XML file and a line range from which the example were
|
|
8
|
+
# taken. Note that the XML file in turn may have been generated by AutoDoc
|
|
9
|
+
# from some other input.
|
|
10
|
+
#
|
|
11
|
+
gap> START_TEST( "cddinterface05.tst");
|
|
12
|
+
|
|
13
|
+
# doc/_Chunks.xml:230-256
|
|
14
|
+
gap> A := Cdd_PolyhedronByInequalities( [ [ 10, -1, 1, 0 ],
|
|
15
|
+
> [ -24, 9, 2, 0 ], [ 1, 1, -1, 0 ], [ -23, -12, 1, 11 ] ], [ 4 ] );
|
|
16
|
+
<Polyhedron given by its H-representation>
|
|
17
|
+
gap> B := Cdd_PolyhedronByInequalities( [ [ 1, 0, 0, 0 ],
|
|
18
|
+
> [ -4, 1, 0, 0 ], [ 10, -1, 1, 0 ], [ -3, -1, 0, 1 ] ], [ 3, 4 ] );
|
|
19
|
+
<Polyhedron given by its H-representation>
|
|
20
|
+
gap> Cdd_IsContained( B, A );
|
|
21
|
+
true
|
|
22
|
+
gap> Display( Cdd_V_Rep( A ) );
|
|
23
|
+
V-representation
|
|
24
|
+
begin
|
|
25
|
+
3 X 4 rational
|
|
26
|
+
|
|
27
|
+
1 2 3 4
|
|
28
|
+
1 4 -6 7
|
|
29
|
+
0 1 1 1
|
|
30
|
+
end
|
|
31
|
+
gap> Display( Cdd_V_Rep( B ) );
|
|
32
|
+
V-representation
|
|
33
|
+
begin
|
|
34
|
+
2 X 4 rational
|
|
35
|
+
|
|
36
|
+
1 4 -6 7
|
|
37
|
+
0 1 1 1
|
|
38
|
+
end
|
|
39
|
+
|
|
40
|
+
#
|
|
41
|
+
gap> STOP_TEST("cddinterface05.tst", 1 );
|
|
@@ -0,0 +1,44 @@
|
|
|
1
|
+
# CddInterface, single 6
|
|
2
|
+
#
|
|
3
|
+
# DO NOT EDIT THIS FILE - EDIT EXAMPLES IN THE SOURCE INSTEAD!
|
|
4
|
+
#
|
|
5
|
+
# This file has been generated by AutoDoc. It contains examples extracted from
|
|
6
|
+
# the package documentation. Each example is preceded by a comment which gives
|
|
7
|
+
# the name of a GAPDoc XML file and a line range from which the example were
|
|
8
|
+
# taken. Note that the XML file in turn may have been generated by AutoDoc
|
|
9
|
+
# from some other input.
|
|
10
|
+
#
|
|
11
|
+
gap> START_TEST( "cddinterface06.tst");
|
|
12
|
+
|
|
13
|
+
# doc/_Chunks.xml:2-31
|
|
14
|
+
gap> A := Cdd_PolyhedronByInequalities( [ [ 3, 4, 5 ] ], [ 1 ] );;
|
|
15
|
+
gap> B := Cdd_PolyhedronByInequalities( [ [ 9, 7, 2 ] ], [ 1 ] );;
|
|
16
|
+
gap> C := Cdd_Intersection( A, B );;
|
|
17
|
+
gap> Display( Cdd_V_Rep( A ) );
|
|
18
|
+
V-representation
|
|
19
|
+
linearity 1, [ 2 ]
|
|
20
|
+
begin
|
|
21
|
+
2 X 3 rational
|
|
22
|
+
|
|
23
|
+
1 -3/4 0
|
|
24
|
+
0 -5 4
|
|
25
|
+
end
|
|
26
|
+
gap> Display( Cdd_V_Rep( B ) );
|
|
27
|
+
V-representation
|
|
28
|
+
linearity 1, [ 2 ]
|
|
29
|
+
begin
|
|
30
|
+
2 X 3 rational
|
|
31
|
+
|
|
32
|
+
1 -9/7 0
|
|
33
|
+
0 -2 7
|
|
34
|
+
end
|
|
35
|
+
gap> Display( Cdd_V_Rep( C ) );
|
|
36
|
+
V-representation
|
|
37
|
+
begin
|
|
38
|
+
1 X 3 rational
|
|
39
|
+
|
|
40
|
+
1 -13/9 5/9
|
|
41
|
+
end
|
|
42
|
+
|
|
43
|
+
#
|
|
44
|
+
gap> STOP_TEST("cddinterface06.tst", 1 );
|
|
@@ -0,0 +1,46 @@
|
|
|
1
|
+
# CddInterface, single 7
|
|
2
|
+
#
|
|
3
|
+
# DO NOT EDIT THIS FILE - EDIT EXAMPLES IN THE SOURCE INSTEAD!
|
|
4
|
+
#
|
|
5
|
+
# This file has been generated by AutoDoc. It contains examples extracted from
|
|
6
|
+
# the package documentation. Each example is preceded by a comment which gives
|
|
7
|
+
# the name of a GAPDoc XML file and a line range from which the example were
|
|
8
|
+
# taken. Note that the XML file in turn may have been generated by AutoDoc
|
|
9
|
+
# from some other input.
|
|
10
|
+
#
|
|
11
|
+
gap> START_TEST( "cddinterface07.tst");
|
|
12
|
+
|
|
13
|
+
# doc/_Chunks.xml:262-293
|
|
14
|
+
gap> P := Cdd_PolyhedronByGenerators( [ [ 1, 2, 5 ], [ 0, 1, 2 ] ] );
|
|
15
|
+
< Polyhedron given by its V-representation >
|
|
16
|
+
gap> Q := Cdd_PolyhedronByGenerators( [ [ 1, 4, 6 ], [ 1, 3, 7 ], [ 0, 3, 1 ] ] );
|
|
17
|
+
< Polyhedron given by its V-representation >
|
|
18
|
+
gap> S := P+Q;
|
|
19
|
+
< Polyhedron given by its H-representation >
|
|
20
|
+
gap> V := Cdd_V_Rep( S );
|
|
21
|
+
< Polyhedron given by its V-representation >
|
|
22
|
+
gap> Display( V );
|
|
23
|
+
V-representation
|
|
24
|
+
begin
|
|
25
|
+
4 X 3 rational
|
|
26
|
+
|
|
27
|
+
0 3 1
|
|
28
|
+
1 6 11
|
|
29
|
+
1 5 12
|
|
30
|
+
0 1 2
|
|
31
|
+
end
|
|
32
|
+
gap> Cdd_GeneratingVertices( P );
|
|
33
|
+
[ [ 2, 5 ] ]
|
|
34
|
+
gap> Cdd_GeneratingVertices( Q );
|
|
35
|
+
[ [ 3, 7 ], [ 4, 6 ] ]
|
|
36
|
+
gap> Cdd_GeneratingVertices( S );
|
|
37
|
+
[ [ 5, 12 ], [ 6, 11 ] ]
|
|
38
|
+
gap> Cdd_GeneratingRays( P );
|
|
39
|
+
[ [ 1, 2 ] ]
|
|
40
|
+
gap> Cdd_GeneratingRays( Q );
|
|
41
|
+
[ [ 3, 1 ] ]
|
|
42
|
+
gap> Cdd_GeneratingRays( S );
|
|
43
|
+
[ [ 1, 2 ], [ 3, 1 ] ]
|
|
44
|
+
|
|
45
|
+
#
|
|
46
|
+
gap> STOP_TEST("cddinterface07.tst", 1 );
|
|
@@ -0,0 +1,66 @@
|
|
|
1
|
+
# CddInterface, single 8
|
|
2
|
+
#
|
|
3
|
+
# DO NOT EDIT THIS FILE - EDIT EXAMPLES IN THE SOURCE INSTEAD!
|
|
4
|
+
#
|
|
5
|
+
# This file has been generated by AutoDoc. It contains examples extracted from
|
|
6
|
+
# the package documentation. Each example is preceded by a comment which gives
|
|
7
|
+
# the name of a GAPDoc XML file and a line range from which the example were
|
|
8
|
+
# taken. Note that the XML file in turn may have been generated by AutoDoc
|
|
9
|
+
# from some other input.
|
|
10
|
+
#
|
|
11
|
+
gap> START_TEST( "cddinterface08.tst");
|
|
12
|
+
|
|
13
|
+
# doc/_Chunks.xml:304-355
|
|
14
|
+
gap> A:= Cdd_PolyhedronByInequalities( [ [ -100, 1, 0 ], [ 200, -1, 0 ],
|
|
15
|
+
> [ -80, 0, 1 ], [ 170, 0, -1 ], [ -200, 1, 1 ] ] );
|
|
16
|
+
<Polyhedron given by its H-representation>
|
|
17
|
+
gap> lp1:= Cdd_LinearProgram( A, "max", [1, -2, 5 ] );
|
|
18
|
+
<Linear program>
|
|
19
|
+
gap> Display( lp1 );
|
|
20
|
+
Linear program given by:
|
|
21
|
+
H-representation
|
|
22
|
+
begin
|
|
23
|
+
5 X 3 rational
|
|
24
|
+
|
|
25
|
+
-100 1 0
|
|
26
|
+
200 -1 0
|
|
27
|
+
-80 0 1
|
|
28
|
+
170 0 -1
|
|
29
|
+
-200 1 1
|
|
30
|
+
end
|
|
31
|
+
max [ 1, -2, 5 ]
|
|
32
|
+
gap> Cdd_SolveLinearProgram( lp1 );
|
|
33
|
+
[ [ 100, 170 ], 651 ]
|
|
34
|
+
gap> lp2:= Cdd_LinearProgram( A, "min", [ 1, -2, 5 ] );
|
|
35
|
+
<Linear program>
|
|
36
|
+
gap> Display( lp2 );
|
|
37
|
+
Linear program given by:
|
|
38
|
+
H-representation
|
|
39
|
+
begin
|
|
40
|
+
5 X 3 rational
|
|
41
|
+
|
|
42
|
+
-100 1 0
|
|
43
|
+
200 -1 0
|
|
44
|
+
-80 0 1
|
|
45
|
+
170 0 -1
|
|
46
|
+
-200 1 1
|
|
47
|
+
end
|
|
48
|
+
min [ 1, -2, 5 ]
|
|
49
|
+
gap> Cdd_SolveLinearProgram( lp2 );
|
|
50
|
+
[ [ 200, 80 ], 1 ]
|
|
51
|
+
gap> B:= Cdd_V_Rep( A );
|
|
52
|
+
<Polyhedron given by its V-representation>
|
|
53
|
+
gap> Display( B );
|
|
54
|
+
V-representation
|
|
55
|
+
begin
|
|
56
|
+
5 X 3 rational
|
|
57
|
+
|
|
58
|
+
1 100 170
|
|
59
|
+
1 100 100
|
|
60
|
+
1 120 80
|
|
61
|
+
1 200 80
|
|
62
|
+
1 200 170
|
|
63
|
+
end
|
|
64
|
+
|
|
65
|
+
#
|
|
66
|
+
gap> STOP_TEST("cddinterface08.tst", 1 );
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
# CddInterface, single 9
|
|
2
|
+
#
|
|
3
|
+
# DO NOT EDIT THIS FILE - EDIT EXAMPLES IN THE SOURCE INSTEAD!
|
|
4
|
+
#
|
|
5
|
+
# This file has been generated by AutoDoc. It contains examples extracted from
|
|
6
|
+
# the package documentation. Each example is preceded by a comment which gives
|
|
7
|
+
# the name of a GAPDoc XML file and a line range from which the example were
|
|
8
|
+
# taken. Note that the XML file in turn may have been generated by AutoDoc
|
|
9
|
+
# from some other input.
|
|
10
|
+
#
|
|
11
|
+
gap> START_TEST( "cddinterface09.tst");
|
|
12
|
+
|
|
13
|
+
# doc/_Chunks.xml:363-376
|
|
14
|
+
gap> A:= Cdd_PolyhedronByInequalities( [ [ 0, 2, 6 ], [ 0, 1, 3 ], [1, 4, 10 ] ] );
|
|
15
|
+
<Polyhedron given by its H-representation>
|
|
16
|
+
gap> B:= Cdd_Canonicalize( A );
|
|
17
|
+
<Polyhedron given by its H-representation>
|
|
18
|
+
gap> Display( B );
|
|
19
|
+
H-representation
|
|
20
|
+
begin
|
|
21
|
+
2 X 3 rational
|
|
22
|
+
|
|
23
|
+
0 1 3
|
|
24
|
+
1 4 10
|
|
25
|
+
end
|
|
26
|
+
|
|
27
|
+
#
|
|
28
|
+
gap> STOP_TEST("cddinterface09.tst", 1 );
|
|
@@ -0,0 +1,56 @@
|
|
|
1
|
+
# CddInterface, single 10
|
|
2
|
+
#
|
|
3
|
+
# DO NOT EDIT THIS FILE - EDIT EXAMPLES IN THE SOURCE INSTEAD!
|
|
4
|
+
#
|
|
5
|
+
# This file has been generated by AutoDoc. It contains examples extracted from
|
|
6
|
+
# the package documentation. Each example is preceded by a comment which gives
|
|
7
|
+
# the name of a GAPDoc XML file and a line range from which the example were
|
|
8
|
+
# taken. Note that the XML file in turn may have been generated by AutoDoc
|
|
9
|
+
# from some other input.
|
|
10
|
+
#
|
|
11
|
+
gap> START_TEST( "cddinterface10.tst");
|
|
12
|
+
|
|
13
|
+
# doc/_Chunks.xml:382-423
|
|
14
|
+
gap> A:= Cdd_PolyhedronByInequalities( [ [ 0, 1, 1 ], [ 0, 5, 5 ] ] );
|
|
15
|
+
<Polyhedron given by its H-representation>
|
|
16
|
+
gap> B:= Cdd_V_Rep( A );
|
|
17
|
+
<Polyhedron given by its V-representation>
|
|
18
|
+
gap> Display( B );
|
|
19
|
+
V-representation
|
|
20
|
+
linearity 1, [ 2 ]
|
|
21
|
+
begin
|
|
22
|
+
2 X 3 rational
|
|
23
|
+
|
|
24
|
+
0 1 0
|
|
25
|
+
0 -1 1
|
|
26
|
+
end
|
|
27
|
+
gap> C:= Cdd_H_Rep( B );
|
|
28
|
+
<Polyhedron given by its H-representation>
|
|
29
|
+
gap> Display( C );
|
|
30
|
+
H-representation
|
|
31
|
+
begin
|
|
32
|
+
1 X 3 rational
|
|
33
|
+
|
|
34
|
+
0 1 1
|
|
35
|
+
end
|
|
36
|
+
gap> D:= Cdd_PolyhedronByInequalities( [ [ 0, 1, 1, 34, 22, 43 ],
|
|
37
|
+
> [ 11, 2, 2, 54, 53, 221 ], [33, 23, 45, 2, 40, 11 ] ] );
|
|
38
|
+
<Polyhedron given by its H-representation>
|
|
39
|
+
gap> Cdd_V_Rep( D );
|
|
40
|
+
<Polyhedron given by its V-representation>
|
|
41
|
+
gap> Display( last );
|
|
42
|
+
V-representation
|
|
43
|
+
linearity 2, [ 5, 6 ]
|
|
44
|
+
begin
|
|
45
|
+
6 X 6 rational
|
|
46
|
+
|
|
47
|
+
1 -743/14 369/14 11/14 0 0
|
|
48
|
+
0 -1213 619 22 0 0
|
|
49
|
+
0 -1 1 0 0 0
|
|
50
|
+
0 764 -390 -11 0 0
|
|
51
|
+
0 -13526 6772 99 154 0
|
|
52
|
+
0 -116608 59496 1485 0 154
|
|
53
|
+
end
|
|
54
|
+
|
|
55
|
+
#
|
|
56
|
+
gap> STOP_TEST("cddinterface10.tst", 1 );
|
|
@@ -0,0 +1,70 @@
|
|
|
1
|
+
# CddInterface, single 11
|
|
2
|
+
#
|
|
3
|
+
# DO NOT EDIT THIS FILE - EDIT EXAMPLES IN THE SOURCE INSTEAD!
|
|
4
|
+
#
|
|
5
|
+
# This file has been generated by AutoDoc. It contains examples extracted from
|
|
6
|
+
# the package documentation. Each example is preceded by a comment which gives
|
|
7
|
+
# the name of a GAPDoc XML file and a line range from which the example were
|
|
8
|
+
# taken. Note that the XML file in turn may have been generated by AutoDoc
|
|
9
|
+
# from some other input.
|
|
10
|
+
#
|
|
11
|
+
gap> START_TEST( "cddinterface11.tst");
|
|
12
|
+
|
|
13
|
+
# doc/_Chunks.xml:429-484
|
|
14
|
+
gap> poly:= Cdd_PolyhedronByInequalities( [ [ 1, 3, 4, 5, 7 ], [ 1, 3, 5, 12, 34 ],
|
|
15
|
+
> [ 9, 3, 0, 2, 13 ] ], [ 1 ] );
|
|
16
|
+
<Polyhedron given by its H-representation>
|
|
17
|
+
gap> Cdd_InteriorPoint( poly );
|
|
18
|
+
[ -194/75, 46/25, -3/25, 0 ]
|
|
19
|
+
gap> Cdd_FacesWithInteriorPoints( poly );
|
|
20
|
+
[ [ 3, [ 1 ], [ -194/75, 46/25, -3/25, 0 ] ], [ 2, [ 1, 2 ],
|
|
21
|
+
[ -62/25, 49/25, -7/25, 0 ] ], [ 1, [ 1, 2, 3 ],
|
|
22
|
+
[ -209/75, 56/25, -8/25, 0 ] ], [ 2, [ 1, 3 ], [ -217/75, 53/25, -4/25, 0 ] ] ]
|
|
23
|
+
gap> Cdd_Dimension( poly );
|
|
24
|
+
3
|
|
25
|
+
gap> Cdd_IsPointed( poly );
|
|
26
|
+
false
|
|
27
|
+
gap> Cdd_IsEmpty( poly );
|
|
28
|
+
false
|
|
29
|
+
gap> Cdd_Faces( poly );
|
|
30
|
+
[ [ 3, [ 1 ] ], [ 2, [ 1, 2 ] ], [ 1, [ 1, 2, 3 ] ], [ 2, [ 1, 3 ] ] ]
|
|
31
|
+
gap> poly1 := Cdd_ExtendLinearity( poly, [ 1, 2, 3 ] );
|
|
32
|
+
<Polyhedron given by its H-representation>
|
|
33
|
+
gap> Display( poly1 );
|
|
34
|
+
H-representation
|
|
35
|
+
linearity 3, [ 1, 2, 3 ]
|
|
36
|
+
begin
|
|
37
|
+
3 X 5 rational
|
|
38
|
+
|
|
39
|
+
1 3 4 5 7
|
|
40
|
+
1 3 5 12 34
|
|
41
|
+
9 3 0 2 13
|
|
42
|
+
end
|
|
43
|
+
gap> Cdd_Dimension( poly1 );
|
|
44
|
+
1
|
|
45
|
+
gap> Cdd_Facets( poly );
|
|
46
|
+
[ [ 1, 2 ], [ 1, 3 ] ]
|
|
47
|
+
gap> Cdd_GeneratingVertices( poly );
|
|
48
|
+
[ [ -209/75, 56/25, -8/25, 0 ] ]
|
|
49
|
+
gap> Cdd_GeneratingRays( poly );
|
|
50
|
+
[ [ -97, 369, -342, 75 ], [ -8, -9, 12, 0 ],
|
|
51
|
+
[ 23, -21, 3, 0 ], [ 97, -369, 342, -75 ] ]
|
|
52
|
+
gap> Cdd_Inequalities( poly );
|
|
53
|
+
[ [ 1, 3, 5, 12, 34 ], [ 9, 3, 0, 2, 13 ] ]
|
|
54
|
+
gap> Cdd_Equalities( poly );
|
|
55
|
+
[ [ 1, 3, 4, 5, 7 ] ]
|
|
56
|
+
gap> P := Cdd_FourierProjection( poly, 2);
|
|
57
|
+
<Polyhedron given by its H-representation>
|
|
58
|
+
gap> Display( P );
|
|
59
|
+
H-representation
|
|
60
|
+
linearity 1, [ 3 ]
|
|
61
|
+
begin
|
|
62
|
+
3 X 5 rational
|
|
63
|
+
|
|
64
|
+
9 3 0 2 13
|
|
65
|
+
-1 -3 0 23 101
|
|
66
|
+
0 0 1 0 0
|
|
67
|
+
end
|
|
68
|
+
|
|
69
|
+
#
|
|
70
|
+
gap> STOP_TEST("cddinterface11.tst", 1 );
|
|
@@ -0,0 +1,6 @@
|
|
|
1
|
+
gap> inequalities := [ [ -12161335039290869319572858042364783623509104285436155, 10301051460877537453973547267843, 1 ], [ -50046646252225799669024107132291046291965254437457, 42391158275216203514294433201, -1 ] ];;
|
|
2
|
+
gap> vertices_and_rays := [ [ 1, 2^70-1, 2^75-2 ], [ 0, 1, 3^60 ], [ 0, 1, -3^65 ] ];;
|
|
3
|
+
gap> P := Cdd_PolyhedronByGenerators( vertices_and_rays );;
|
|
4
|
+
gap> Q := Cdd_PolyhedronByInequalities( inequalities );;
|
|
5
|
+
gap> P = Q;
|
|
6
|
+
true
|
|
@@ -0,0 +1,33 @@
|
|
|
1
|
+
##
|
|
2
|
+
## Some corner cases for a polyhedron that is defined by generators.
|
|
3
|
+
##
|
|
4
|
+
gap> C := Cdd_PolyhedronByGenerators( [ [ 0, 2 ], [ 0, -2 ] ] );;
|
|
5
|
+
gap> Display( Cdd_H_Rep( C ) );
|
|
6
|
+
H-representation
|
|
7
|
+
begin
|
|
8
|
+
1 X 2 rational
|
|
9
|
+
|
|
10
|
+
1 0
|
|
11
|
+
end
|
|
12
|
+
gap> C := Cdd_PolyhedronByGenerators( [ [ 1, 2 ], [ 1, -2 ] ] );;
|
|
13
|
+
gap> Display( Cdd_H_Rep( C ) );
|
|
14
|
+
H-representation
|
|
15
|
+
begin
|
|
16
|
+
2 X 2 rational
|
|
17
|
+
|
|
18
|
+
2 -1
|
|
19
|
+
2 1
|
|
20
|
+
end
|
|
21
|
+
gap> C := Cdd_PolyhedronByGenerators( [ [ 1, 0 ] ] );;
|
|
22
|
+
gap> Display( Cdd_H_Rep( C ) );
|
|
23
|
+
H-representation
|
|
24
|
+
linearity 1, [ 2 ]
|
|
25
|
+
begin
|
|
26
|
+
2 X 2 rational
|
|
27
|
+
|
|
28
|
+
1 0
|
|
29
|
+
0 1
|
|
30
|
+
end
|
|
31
|
+
gap> C := Cdd_PolyhedronByInequalities( [ [ -2 , 1 ], [ 1, -1 ] ] );;
|
|
32
|
+
gap> Display( Cdd_V_Rep( C ) );
|
|
33
|
+
The empty polyhedron
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
#
|
|
2
|
+
# CddInterface: Gap interface to Cdd package
|
|
3
|
+
#
|
|
4
|
+
# This file runs package tests. It is also referenced in the package
|
|
5
|
+
# metadata in PackageInfo.g.
|
|
6
|
+
#
|
|
7
|
+
LoadPackage( "CddInterface" );
|
|
8
|
+
dirs := DirectoriesPackageLibrary( "CddInterface", "tst" );
|
|
9
|
+
TestDirectory( dirs, rec( exitGAP := true, testOptions:= rec(compareFunction:="uptowhitespace" )) );
|
|
10
|
+
FORCE_QUIT_GAP(1);
|
|
Binary file
|
|
Binary file
|
|
@@ -0,0 +1,93 @@
|
|
|
1
|
+
Metadata-Version: 2.4
|
|
2
|
+
Name: passagemath-gap-pkg-cddinterface
|
|
3
|
+
Version: 10.6.40
|
|
4
|
+
Summary: passagemath: Computational Group Theory with GAP: cddinterface package
|
|
5
|
+
Author-email: The Sage Developers <sage-support@googlegroups.com>
|
|
6
|
+
Maintainer: Matthias Köppe, passagemath contributors
|
|
7
|
+
License-Expression: GPL-2.0-or-later
|
|
8
|
+
Project-URL: release notes, https://github.com/passagemath/passagemath/releases
|
|
9
|
+
Project-URL: repo (upstream), https://github.com/sagemath/sage
|
|
10
|
+
Project-URL: repo, https://github.com/passagemath/passagemath
|
|
11
|
+
Project-URL: documentation, https://passagemath.org/docs/latest
|
|
12
|
+
Project-URL: homepage (upstream), https://www.sagemath.org
|
|
13
|
+
Project-URL: discourse, https://passagemath.discourse.group
|
|
14
|
+
Project-URL: tracker (upstream), https://github.com/sagemath/sage/issues
|
|
15
|
+
Project-URL: tracker, https://github.com/passagemath/passagemath/issues
|
|
16
|
+
Classifier: Development Status :: 6 - Mature
|
|
17
|
+
Classifier: Intended Audience :: Education
|
|
18
|
+
Classifier: Intended Audience :: Science/Research
|
|
19
|
+
Classifier: Operating System :: POSIX
|
|
20
|
+
Classifier: Operating System :: POSIX :: Linux
|
|
21
|
+
Classifier: Operating System :: MacOS :: MacOS X
|
|
22
|
+
Classifier: Programming Language :: Python :: 3 :: Only
|
|
23
|
+
Classifier: Programming Language :: Python :: 3.10
|
|
24
|
+
Classifier: Programming Language :: Python :: 3.11
|
|
25
|
+
Classifier: Programming Language :: Python :: 3.12
|
|
26
|
+
Classifier: Programming Language :: Python :: 3.13
|
|
27
|
+
Classifier: Programming Language :: Python :: 3.14
|
|
28
|
+
Classifier: Programming Language :: Python :: Implementation :: CPython
|
|
29
|
+
Classifier: Topic :: Scientific/Engineering :: Mathematics
|
|
30
|
+
Requires-Python: <3.15,>=3.10
|
|
31
|
+
Description-Content-Type: text/x-rst
|
|
32
|
+
Requires-Dist: passagemath-environment~=10.6.40.0
|
|
33
|
+
|
|
34
|
+
=========================================================================
|
|
35
|
+
passagemath: Computational Group Theory with GAP: cddinterface package
|
|
36
|
+
=========================================================================
|
|
37
|
+
|
|
38
|
+
`passagemath <https://github.com/passagemath/passagemath>`__ is open
|
|
39
|
+
source mathematical software in Python, released under the GNU General
|
|
40
|
+
Public Licence GPLv2+.
|
|
41
|
+
|
|
42
|
+
It is a fork of `SageMath <https://www.sagemath.org/>`__, which has been
|
|
43
|
+
developed 2005-2025 under the motto “Creating a Viable Open Source
|
|
44
|
+
Alternative to Magma, Maple, Mathematica, and MATLAB”.
|
|
45
|
+
|
|
46
|
+
The passagemath fork uses the motto "Creating a Free Passage Between the
|
|
47
|
+
Scientific Python Ecosystem and Mathematical Software Communities."
|
|
48
|
+
It was created in October 2024 with the following goals:
|
|
49
|
+
|
|
50
|
+
- providing modularized installation with pip,
|
|
51
|
+
- establishing first-class membership in the scientific Python
|
|
52
|
+
ecosystem,
|
|
53
|
+
- giving `clear attribution of upstream
|
|
54
|
+
projects <https://groups.google.com/g/sage-devel/c/6HO1HEtL1Fs/m/G002rPGpAAAJ>`__,
|
|
55
|
+
- providing independently usable Python interfaces to upstream
|
|
56
|
+
libraries,
|
|
57
|
+
- offering `platform portability and integration testing
|
|
58
|
+
services <https://github.com/passagemath/passagemath/issues/704>`__
|
|
59
|
+
to upstream projects,
|
|
60
|
+
- inviting collaborations with upstream projects,
|
|
61
|
+
- `building a professional, respectful, inclusive
|
|
62
|
+
community <https://groups.google.com/g/sage-devel/c/xBzaINHWwUQ>`__,
|
|
63
|
+
- `empowering Sage users to participate in the scientific Python ecosystem
|
|
64
|
+
<https://github.com/passagemath/passagemath/issues/248>`__ by publishing packages,
|
|
65
|
+
- developing a port to `Pyodide <https://pyodide.org/en/stable/>`__ for
|
|
66
|
+
serverless deployment with Javascript,
|
|
67
|
+
- developing a native Windows port.
|
|
68
|
+
|
|
69
|
+
`Full documentation <https://passagemath.org/docs/latest/html/en/index.html>`__ is
|
|
70
|
+
available online.
|
|
71
|
+
|
|
72
|
+
passagemath attempts to support and provides binary wheels suitable for
|
|
73
|
+
all major Linux distributions and recent versions of macOS.
|
|
74
|
+
|
|
75
|
+
Binary wheels for native Windows (x86_64) are are available for a subset of
|
|
76
|
+
the passagemath distributions. Use of the full functionality of passagemath
|
|
77
|
+
on Windows currently requires the use of Windows Subsystem for Linux (WSL)
|
|
78
|
+
or virtualization.
|
|
79
|
+
|
|
80
|
+
The supported Python versions in the passagemath 10.6.x series are 3.10.x-3.13.x.
|
|
81
|
+
|
|
82
|
+
|
|
83
|
+
About this pip-installable distribution package
|
|
84
|
+
-----------------------------------------------
|
|
85
|
+
|
|
86
|
+
This pip-installable distribution ``passagemath-gap-pkg-cddinterface`` is a
|
|
87
|
+
distribution of the GAP package ``cddinterface`` for use with ``passagemath-gap``.
|
|
88
|
+
|
|
89
|
+
|
|
90
|
+
What is included
|
|
91
|
+
----------------
|
|
92
|
+
|
|
93
|
+
- Wheels on PyPI include the GAP package ``cddinterface``
|
|
@@ -0,0 +1,94 @@
|
|
|
1
|
+
Metadata-Version: 2.4
|
|
2
|
+
Name: passagemath-gap-pkg-cddinterface
|
|
3
|
+
Version: 10.6.40
|
|
4
|
+
Summary: passagemath: Computational Group Theory with GAP: cddinterface package
|
|
5
|
+
Author-email: The Sage Developers <sage-support@googlegroups.com>
|
|
6
|
+
Maintainer: Matthias Köppe, passagemath contributors
|
|
7
|
+
License-Expression: GPL-2.0-or-later
|
|
8
|
+
Project-URL: release notes, https://github.com/passagemath/passagemath/releases
|
|
9
|
+
Project-URL: repo (upstream), https://github.com/sagemath/sage
|
|
10
|
+
Project-URL: repo, https://github.com/passagemath/passagemath
|
|
11
|
+
Project-URL: documentation, https://passagemath.org/docs/latest
|
|
12
|
+
Project-URL: homepage (upstream), https://www.sagemath.org
|
|
13
|
+
Project-URL: discourse, https://passagemath.discourse.group
|
|
14
|
+
Project-URL: tracker (upstream), https://github.com/sagemath/sage/issues
|
|
15
|
+
Project-URL: tracker, https://github.com/passagemath/passagemath/issues
|
|
16
|
+
Classifier: Development Status :: 6 - Mature
|
|
17
|
+
Classifier: Intended Audience :: Education
|
|
18
|
+
Classifier: Intended Audience :: Science/Research
|
|
19
|
+
Classifier: Operating System :: POSIX
|
|
20
|
+
Classifier: Operating System :: POSIX :: Linux
|
|
21
|
+
Classifier: Operating System :: MacOS :: MacOS X
|
|
22
|
+
Classifier: Programming Language :: Python :: 3 :: Only
|
|
23
|
+
Classifier: Programming Language :: Python :: 3.10
|
|
24
|
+
Classifier: Programming Language :: Python :: 3.11
|
|
25
|
+
Classifier: Programming Language :: Python :: 3.12
|
|
26
|
+
Classifier: Programming Language :: Python :: 3.13
|
|
27
|
+
Classifier: Programming Language :: Python :: 3.14
|
|
28
|
+
Classifier: Programming Language :: Python :: Implementation :: CPython
|
|
29
|
+
Classifier: Topic :: Scientific/Engineering :: Mathematics
|
|
30
|
+
Requires-Python: <3.15,>=3.10
|
|
31
|
+
Description-Content-Type: text/x-rst
|
|
32
|
+
Requires-Dist: passagemath-conf~=10.6.40.0; sys_platform != "win32"
|
|
33
|
+
Requires-Dist: passagemath-environment~=10.6.40.0
|
|
34
|
+
|
|
35
|
+
=========================================================================
|
|
36
|
+
passagemath: Computational Group Theory with GAP: cddinterface package
|
|
37
|
+
=========================================================================
|
|
38
|
+
|
|
39
|
+
`passagemath <https://github.com/passagemath/passagemath>`__ is open
|
|
40
|
+
source mathematical software in Python, released under the GNU General
|
|
41
|
+
Public Licence GPLv2+.
|
|
42
|
+
|
|
43
|
+
It is a fork of `SageMath <https://www.sagemath.org/>`__, which has been
|
|
44
|
+
developed 2005-2025 under the motto “Creating a Viable Open Source
|
|
45
|
+
Alternative to Magma, Maple, Mathematica, and MATLAB”.
|
|
46
|
+
|
|
47
|
+
The passagemath fork uses the motto "Creating a Free Passage Between the
|
|
48
|
+
Scientific Python Ecosystem and Mathematical Software Communities."
|
|
49
|
+
It was created in October 2024 with the following goals:
|
|
50
|
+
|
|
51
|
+
- providing modularized installation with pip,
|
|
52
|
+
- establishing first-class membership in the scientific Python
|
|
53
|
+
ecosystem,
|
|
54
|
+
- giving `clear attribution of upstream
|
|
55
|
+
projects <https://groups.google.com/g/sage-devel/c/6HO1HEtL1Fs/m/G002rPGpAAAJ>`__,
|
|
56
|
+
- providing independently usable Python interfaces to upstream
|
|
57
|
+
libraries,
|
|
58
|
+
- offering `platform portability and integration testing
|
|
59
|
+
services <https://github.com/passagemath/passagemath/issues/704>`__
|
|
60
|
+
to upstream projects,
|
|
61
|
+
- inviting collaborations with upstream projects,
|
|
62
|
+
- `building a professional, respectful, inclusive
|
|
63
|
+
community <https://groups.google.com/g/sage-devel/c/xBzaINHWwUQ>`__,
|
|
64
|
+
- `empowering Sage users to participate in the scientific Python ecosystem
|
|
65
|
+
<https://github.com/passagemath/passagemath/issues/248>`__ by publishing packages,
|
|
66
|
+
- developing a port to `Pyodide <https://pyodide.org/en/stable/>`__ for
|
|
67
|
+
serverless deployment with Javascript,
|
|
68
|
+
- developing a native Windows port.
|
|
69
|
+
|
|
70
|
+
`Full documentation <https://passagemath.org/docs/latest/html/en/index.html>`__ is
|
|
71
|
+
available online.
|
|
72
|
+
|
|
73
|
+
passagemath attempts to support and provides binary wheels suitable for
|
|
74
|
+
all major Linux distributions and recent versions of macOS.
|
|
75
|
+
|
|
76
|
+
Binary wheels for native Windows (x86_64) are are available for a subset of
|
|
77
|
+
the passagemath distributions. Use of the full functionality of passagemath
|
|
78
|
+
on Windows currently requires the use of Windows Subsystem for Linux (WSL)
|
|
79
|
+
or virtualization.
|
|
80
|
+
|
|
81
|
+
The supported Python versions in the passagemath 10.6.x series are 3.10.x-3.13.x.
|
|
82
|
+
|
|
83
|
+
|
|
84
|
+
About this pip-installable distribution package
|
|
85
|
+
-----------------------------------------------
|
|
86
|
+
|
|
87
|
+
This pip-installable distribution ``passagemath-gap-pkg-cddinterface`` is a
|
|
88
|
+
distribution of the GAP package ``cddinterface`` for use with ``passagemath-gap``.
|
|
89
|
+
|
|
90
|
+
|
|
91
|
+
What is included
|
|
92
|
+
----------------
|
|
93
|
+
|
|
94
|
+
- Wheels on PyPI include the GAP package ``cddinterface``
|