16namespace layer1_foundations {
17namespace data_structures {
55 int nb_sets,
int verbose_level)
57 int f_v = (verbose_level >= 1);
61 cout <<
"set_of_sets_lint::init_simple nb_sets=" <<
nb_sets
75 int nb_sets,
long int **Pts,
int *Sz,
int verbose_level)
77 int f_v = (verbose_level >= 1);
81 cout <<
"set_of_sets_lint::init nb_sets=" <<
nb_sets
93 int nb_sets,
int *Sz,
int verbose_level)
95 int f_v = (verbose_level >= 1);
99 cout <<
"set_of_sets::init_basic nb_sets=" <<
nb_sets
106 for (i = 0; i <
nb_sets; i++) {
109 for (i = 0; i <
nb_sets; i++) {
112 cout <<
"set_of_sets::init_basic allocating set " << i
113 <<
" of size " << Sz[i] << endl;
121 long int *set,
int sz,
int verbose_level)
124 int f_v = (verbose_level >= 1);
128 cout <<
"set_of_sets_lint::init_set" << endl;
130 if (
Sets[idx_of_set]) {
131 cout <<
"set_of_sets_lint::init_set Sets[idx_of_set] "
132 "is allocated" << endl;
137 for (j = 0; j < sz; j++) {
138 Sets[idx_of_set][j] = set[j];
142 cout <<
"set_of_sets_lint::init_set done" << endl;
void init(long int underlying_set_size, int nb_sets, long int **Pts, int *Sz, int verbose_level)
void init_simple(long int underlying_set_size, int nb_sets, int verbose_level)
long int underlying_set_size
void init_basic(long int underlying_set_size, int nb_sets, int *Sz, int verbose_level)
void init_set(int idx_of_set, long int *set, int sz, int verbose_level)
#define Lint_vec_copy(A, B, C)
#define Int_vec_zero(A, B)
the orbiter library for the classification of combinatorial objects