-
Notifications
You must be signed in to change notification settings - Fork 6
/
order.c
88 lines (66 loc) · 1.79 KB
/
order.c
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
#include <typedef.h>
#include <getput.h>
#include <matrix.h>
#include <base.h>
#include <datei.h>
int main(int argc,char **argv){
bravais_TYP *G;
matrix_TYP **base;
bahn **strong;
int i,
siz;
read_header(argc,argv);
if ((is_option('h') && optionnumber('h')==0) || (FILEANZ < 1)){
printf("Usage: %s 'file' [-o]\n",argv[0]);
printf("\n");
printf("file: bravais_TYP containing a finite matrix group G.\n");
printf("\n");
printf("Calculates the order of G via an Algorithm by Schreier and Sims.\n");
printf("Options:\n");
printf("\n");
printf("-O : writes the group to stdout again, including the order and\n");
printf(" a factorisation of it.\n");
printf("-o : write a factorisation and the order to stdout. This can\n");
printf(" be used to append it to a bravais_TYP.\n");
printf("\n");
printf("WARNING: THE PROGRAM WILL TERMINATE IFF THE GROUP IS FINITE.\n");
printf("\n");
printf("Cf. Is_finite\n");
if (is_option('h')){
exit(0);
}
else{
exit(31);
}
}
INFO_LEVEL = optionnumber('h');
G = get_bravais(FILENAMES[0]);
base = get_base(G);
strong = strong_generators(base,G,FALSE);
siz = G->order = size(strong);
memset(G->divisors,0,100*sizeof(int));
for (i=2;i<100;i++){
if ((siz % i) == 0){
siz /= i;
G->divisors[i]++;
i--;
}
}
if (is_option('o')){
fput_order(stdout,G->divisors,G->order);
}
if (is_option('O')){
put_bravais(G,NULL,NULL);
}
fprintf(stderr,"The order of the group is %d\n",G->order);
int dim = G->dim;
free_bravais(G);
for (i=0;i<dim;i++){
free_mat(base[i]);
free_bahn(strong[i]);
free(strong[i]);
}
free(strong);
free(base);
exit(0);
} /* main */