-
Notifications
You must be signed in to change notification settings - Fork 6
/
qtoz.c
113 lines (94 loc) · 2.9 KB
/
qtoz.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
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
#include <ZZ.h>
#include <typedef.h>
#include <bravais.h>
#include <base.h>
int main(int argc,char **argv){
bravais_TYP *G,
**Classes;
bahn **ST;
int i,
no,
adnumber = 0,
second_number = 0;
char comment[1000],
file[1000];
matrix_TYP **basis;
read_header(argc,argv);
if ((is_option('h') && optionnumber('h')==0) || (FILEANZ < 1)){
printf("Usage: %s 'file' [-D] [-a] [-f]\n",argv[0]);
printf("\n");
printf("file: bravais_TYP containing a group. The order of the group\n");
printf(" must be specified.\n");
printf("\n");
printf("Splits the Q-class of the group in 'file' into Z-classes and\n");
printf("gives a representative for each Z-class.\n");
printf("\n");
printf("Options:\n");
printf("-a : Only calculates representatives of the homogeneously \n");
printf(" decomposable Z-classes and basis transformations \n");
printf(" to the remaining Z-classes (as centerings).\n");
printf(" This option is faster.\n");
printf("-D : (For debugging:) Output is split into different\n");
printf(" files 'file'.1, 'file'.2, ... matching the\n");
printf(" representative groups.\n");
printf("-f : recalculate the formspace even if it is given.\n");
printf("-q : quiet mode.\n");
printf("\n");
printf("WARNING: This program might be very time consuming, especially\n");
printf(" if the group has many Z-classes. \n");
printf("\n");
printf("Cf. Order, Is_finite.\n");
if (is_option('h')){
exit(0);
}
else{
exit(31);
}
}
INFO_LEVEL = optionnumber('h');
G = get_bravais(FILENAMES[0]);
if (G->form == NULL ||
G->form_no == 0 ||
is_option('f')){
G->form = formspace(G->gen,G->gen_no,1,&G->form_no);
}
if (G->order == 0){
basis = get_base(G);
ST = strong_generators(basis,G,FALSE);
G->order = 1;
for (i=0;i<G->dim;i++){
G->order *= ST[i]->length;
free_mat(basis[i]);
free_bahn(ST[i]);
free(ST[i]);
}
factorize_new(G->order,G->divisors);
free(ST);
free(basis);
}
Classes = q2z(G,&no,is_option('a'), NULL, is_option('q'), FALSE);
fprintf(stderr, "####### There are %d classes of groups\n", no);
for (i=0;i<no;i++){
if (is_option('a') || Classes[i + no]){
adnumber++;
second_number = 0;
}
second_number++;
sprintf(comment,"%d-th homogenously dec. group, %d zclass",
adnumber,second_number);
if (is_option('D')){
sprintf(file,"%s.%d.%d",FILENAMES[0],adnumber,second_number);
put_bravais(Classes[i],file,comment);
}
else{
put_bravais(Classes[i],NULL,comment);
}
}
free_bravais(G);
for (i=0;i<no;i++){
free_bravais(Classes[i]);
}
free(Classes);
cleanup_prime();
exit(0);
} /* main */