florian/enumerate-balanced-ideals
1
0
Fork 0
Code Issues Pull Requests Releases Activity

some cleanup -> sent to david dumas

Browse Source
This commit is contained in:
Florian Stecker
2016-10-14 18:49:20 +02:00
parent 76783124e2
commit 5bcb30b5c1
6 changed files with 41 additions and 182 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
thickenings.h
View File

@@ -5,7 +5,7 @@
#define DEBUG(msg, ...) do{fprintf(stderr, msg, ##__VA_ARGS__); }while(0)
#define MAX_THICKENINGS 10000000
#define MAX_THICKENINGS 0 // 0 means infinite
#define HEAD_MARKER 127
typedef struct _edgelist {
@@ -13,6 +13,7 @@ typedef struct _edgelist {
struct _edgelist *next;
} edgelist_t;
// describes an element of the Coxeter group; only "opposite" and "bruhat_lower" are being used for enumerating thickenings; everything else is just needed for initialization or output
typedef struct {
int *word;
int wordlength;
@@ -25,10 +26,9 @@ typedef struct {
} node_t;
char *alphabetize(int *word, int len, const char *alphabet, char *buffer);
void print_balanced_thickening(int rank, int order, const signed char *thickening, const int *left_invariant, const int *right_invariant, const char *alphabet, FILE *f);
void print_thickening(int rank, int order, const signed char *thickening, int fat, int slim, int conflict, const char *alphabet, FILE *f);
void print_thickening(int rank, int order, const signed char *thickening, int level, const char *alphabet, FILE *f);
static int compare_wordlength(const void *a, const void *b, void *gr);
void prepare_graph(semisimple_type_t type, node_t *graph, edgelist_t **edgelists_pointer, int **words_pointer);
void enumerate_balanced_thickenings(semisimple_type_t type, node_t *graph, const char *alphabet, FILE *outfile);
long enumerate_balanced_thickenings(semisimple_type_t type, node_t *graph, const char *alphabet, FILE *outfile);
#endif