-
Notifications
You must be signed in to change notification settings - Fork 2
/
PackageInfo.g
147 lines (133 loc) · 4.69 KB
/
PackageInfo.g
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
# Vole: Backtrack search in permutation groups with graphs
# A GAP package by Mun See Chang, Christopher Jefferson, and Wilf A. Wilson.
#
# SPDX-License-Identifier: MPL-2.0
_STANDREWSCS := Concatenation("School of Computer Science, ",
"University of St Andrews, ",
"St Andrews, Fife, KY16 9SX, Scotland");
SetPackageInfo( rec(
PackageName := "Vole",
Subtitle := "Vole organises lengthy explorations: Backtrack search in permutation groups with graphs",
Version := "0.5.3",
Date := "21/12/2021", # dd/mm/yyyy format
License := "MPL-2.0",
Persons := [
rec(
FirstNames := "Mun See",
LastName := "Chang",
Email := "[email protected]",
GitHubUsername := "Munsee",
IsAuthor := true,
IsMaintainer := false,
Institution := "University of St Andrews",
Place := "St Andrews",
PostalAddress := _STANDREWSCS,
),
rec(
FirstNames := "Christopher",
LastName := "Jefferson",
WWWHome := "https://caj.host.cs.st-andrews.ac.uk",
Email := "[email protected]",
GitHubUsername := "ChrisJefferson",
IsAuthor := true,
IsMaintainer := true,
Institution := "University of St Andrews",
Place := "St Andrews",
PostalAddress := _STANDREWSCS,
),
rec(
FirstNames := "Wilf A.",
LastName := "Wilson",
WWWHome := "https://wilf.me",
GitHubUsername := "wilfwilson",
Email := "[email protected]",
IsAuthor := true,
IsMaintainer := true,
Institution := "University of St Andrews",
Place := "St Andrews",
PostalAddress := _STANDREWSCS,
),
],
SourceRepository := rec(
Type := "git",
URL := "https://github.com/peal/vole",
),
IssueTrackerURL := Concatenation( ~.SourceRepository.URL, "/issues" ),
PackageWWWHome := "https://peal.github.io/vole",
PackageInfoURL := Concatenation( ~.PackageWWWHome, "/PackageInfo.g" ),
README_URL := Concatenation( ~.PackageWWWHome, "/README.md" ),
ArchiveURL := Concatenation( ~.SourceRepository.URL,
"/releases/download/v", ~.Version,
"/", LowercaseString(~.PackageName), "-", ~.Version ),
ArchiveFormats := ".tar.gz",
Status := "dev",
AbstractHTML := """
<B>Vole</B> is a <B>GAP</B> package that implements algorithms in
finite permutation groups, such as canonical images, stabilisers, and
subgroup intersection. These are all implemented as part of the general
'graph backtracking' framework.""",
PackageDoc := rec(
BookName := ~.PackageName,
ArchiveURLSubset := ["doc"],
HTMLStart := "doc/chap0_mj.html",
PDFFile := "doc/manual.pdf",
SixFile := "doc/manual.six",
LongTitle := ~.Subtitle,
),
Dependencies := rec(
GAP := ">= 4.13.0",
NeededOtherPackages := [
[ "Digraphs", ">= 1.1.1" ],
# to enable GAP and rust to talk to each other
[ "IO", ">= 4.7.0" ],
[ "json", ">= 2.0.1" ],
# required by BacktrackKit and Digraphs... so we may as well include it?
[ "datastructures", ">= 0.2.6" ],
["images", ">=1.3.0"], # For MinimalImagePerm
["primgrp", ">=3.4.0" ],
], # For the tests ],
SuggestedOtherPackages := [
[ "AutoDoc", ">= 2019.09.04" ], # to compile documentation
[ "ferret", ">= 1.0.2" ], # used in tests
[ "QuickCheck", ">= 0.1" ], # used in tests
[ "OrbitalGraphs", ">= 0.1" ], # for Vole.TwoClosure
],
ExternalConditions := [
"To compile Vole, Rust needs to be installed and available.",
],
),
AvailabilityTest := function()
local dirs;
dirs := DirectoriesPackageLibrary("vole", "rust/target/release");
if not (Length(dirs) >= 1 and ForAny(["vole", "vole.exe"], f -> f in DirectoryContents(dirs[1])) ) then
LogPackageLoadingMessage(PACKAGE_WARNING,
"Vole package is not compiled; please run `make` in the Vole directory");
return fail;
fi;
return true;
end,
TestFile := "tst/testall.g",
Keywords := [
"permutation group", "backtrack", "search", "backtracking", "graph",
"digraph", "normaliser", "normalizer", "stabiliser", "stabilizer",
"group", "subgroup", "intersection", "conjugacy", "coset", "transporter",
],
AutoDoc := rec(
TitlePage := rec(
Copyright := Concatenation(
"©right; &VoleYear; by Christopher Jefferson, Mun See Chang, ",
"and Wilf A. Wilson.",
"<P/>",
"&Vole; is licensed under the Mozilla Public License, version 2.0."
),
Abstract := ~.AbstractHTML,
Acknowledgements := Concatenation(
"The authors would like to thank the ",
"<URL><LinkText>Royal Society</LinkText>",
"<Link>https://royalsociety.org</Link></URL> ",
"(grant codes <B>RGF\\EA\\181005</B> and <B>URF\\R\\180015</B>) ",
"for their financial support at the time that &Vole; was created."
)
)
),
));