-
Notifications
You must be signed in to change notification settings - Fork 6
/
normalizer_in_n.c
68 lines (53 loc) · 1.62 KB
/
normalizer_in_n.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
#include <typedef.h>
#include <getput.h>
#include <matrix.h>
#include <base.h>
#include <datei.h>
int main(int argc,char **argv){
bravais_TYP *G,
*N;
matrix_TYP **normal;
int i,
anz,
finite;
read_header(argc,argv);
if ((is_option('h') && optionnumber('h')==0) || (FILEANZ < 2)){
printf("Usage: \n");
printf(" Normalizer_in_N 'file1' 'file2' [-f] \n");
printf("\n");
printf("Where file1 and file2 contain a bravais_TYP. Calculates the\n");
printf("normalizer of the group in file1 in the group generated by\n");
printf("the matrices of file2->gen, file2->cen and file2->normal.\n");
printf("\n");
printf("Options:\n");
printf("\n");
printf("-f : The program assumes that the calculated normalizer\n");
printf(" is finite, and performs an base/strong generator\n");
printf(" algorithm on it. In effect you will get less\n");
printf(" generators for it. IT WILL WORK IF AND ONLY IF\n");
printf(" THE CALCULATED NORMALIZER IS INDEED FINITE.\n");
printf("\n");
if (is_option('h')){
exit(0);
}
else{
exit(31);
}
}
INFO_LEVEL = optionnumber('h');
finite = FALSE;
if (is_option('f')) finite = TRUE;
G = get_bravais(FILENAMES[0]);
N = get_bravais(FILENAMES[1]);
normal = normalizer_in_N(G,N,&anz,finite);
printf("#%d\n",anz);
for (i=0;i<anz;i++){
put_mat(normal[i],NULL,NULL,2);
}
free_bravais(G);
free_bravais(N);
for (i=0;i<anz;i++) free_mat(normal[i]);
free(normal);
printf("end of Normalizer_in_N\n");
exit(0);
} /* main */