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

Callbacks

Browse Source
This commit is contained in:
Florian Stecker
2016-11-19 11:16:45 +01:00
parent 882695c15e
commit 3bd8ff019d
5 changed files with 62 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
thickenings.h
View File

@@ -1,6 +1,9 @@
#ifndef THICKENINGS_H
#define THICKENINGS_H
#define BV_QWORD_RANK 10
#include "bitvec.h"
#include "coxeter.h"
#define DEBUG(msg, ...) do{fprintf(stderr, msg, ##__VA_ARGS__); }while(0)
@@ -30,13 +33,13 @@ char *alphabetize(int *word, int len, const char *alphabet, char *buffer);
void print_thickening(int rank, int order, const signed char *thickening, int level, const char *alphabet, FILE *f);
// generating the graph of the bruhat order
node_t *graph_alloc(semisimple_type_t type);
void graph_free(semisimple_type_t type, node_t *graph);
void prepare_graph(semisimple_type_t type, node_t *graph);
int prepare_simplified_graph(semisimple_type_t type, unsigned long left, unsigned long right, node_t *simplified_graph);
// enumerate balanced thickenings
long enumerate_balanced_thickenings(semisimple_type_t type, node_t *graph, int size, const char *alphabet, FILE *outfile);
node_t *graph_alloc(semisimple_type_t type);
void graph_free(semisimple_type_t type, node_t *graph);
// enumerating balanced thickenings
long enumerate_balanced_thickenings(node_t *graph, int size, void (*callback) (const bitvec_t *, int, void*), void *callback_data);
// various helper functions
static int compare_wordlength(const void *a, const void *b, void *gr);