17namespace layer1_foundations {
18namespace data_structures {
36 for (i = 0; i < len; i++) {
37 to[i] = through[from[i]];
42 long int *take_away,
int nb_take_away)
48 for (i = 0; i < nb_take_away; i++) {
52 for (j = idx; j < len; j++) {
65 for (p = v, i = 0; i < len; p++, i++) {
75 for (p = v, i = 0; i < len; p++, i++) {
85 for (p = from, q = to, i = 0; i < len; p++, q++, i++) {
96 for (p = from, q = to, i = 0; i < len; p++, q++, i++) {
108 for (i = 0; i < n; i++) {
109 if (j1 < k && v[j1] == i) {
117 cout <<
"lint_vec::complement j2 != n - k" << endl;
129 cout <<
"lint_vec::minimum len == 0" << endl;
133 for (i = 1; i < len; i++) {
146 cout <<
"lint_vec::maximum len == 0" << endl;
150 for (i = 1; i < len; i++) {
160 long int *p,
int m,
int n,
int dim_n,
int w)
164 for (i = 0; i < m; i++) {
165 for (j = 0; j < n; j++) {
166 ost << setw((
int) w) << p[i * dim_n + j];
182 for (i = 0; i < m; i++) {
183 for (j = 0; j < n; j++) {
215 for (i = 0; i < m; i++) {
216 for (j = 0; j < n; j++) {
217 cout << setw((
int) w) << p[i * n + j];
237 for (i = 0; i < len; i++) {
252 for (i = 0; i < 50; i++) {
259 for (i = len - 3; i < len; i++) {
279 for (i = 0; i < 50; i++) {
286 for (i = len - 3; i < len; i++) {
303 for (i = 0; i < len; i++) {
308 if (((i + 1) % 10) == 0) {
320 for (i = 0; i < len; i++) {
334 for (i = 0; i < len; i++) {
349 for (i = 0; i < len; i++) {
361 istringstream ins(s);
368 istringstream ins(s);
374 int verbose_level = 0;
375 int f_v = (verbose_level >= 1);
381 cout <<
"lint_vec::scan_from_stream" << endl;
392 cout <<
"lint_vec::scan_from_stream done" << endl;
407 cout <<
"lint_vec::scan_from_stream done" << endl;
420 cout <<
"lint_vec::scan_from_stream skipping space" << endl;
434 else if (c >=
'0' && c <=
'9') {
436 cout <<
"c='" << c <<
"'" << endl;
458 cout <<
"lint_vec::scan_from_stream reading " << s << endl;
462 cout <<
"digit as string: " << s
463 <<
", numeric: " << a << endl;
494 cout <<
"lint_vec::scan_from_stream done" << endl;
508 for (i = 0; i < len; i++) {
510 sprintf(str + strlen(str),
"%ld", a);
523 for (i = 0; i < len; i++) {
525 sprintf(str + strlen(str),
"%ld", a);
539 for (i = 0; i < len; i++) {
void copy_to_int(long int *from, int *to, long int len)
void matrix_print_width(std::ostream &ost, long int *p, int m, int n, int dim_n, int w)
void print_to_str(char *str, long int *data, int len)
void complement(long int *v, long int *w, int n, int k)
void scan(std::string &s, long int *&v, int &len)
void apply(long int *from, long int *through, long int *to, int len)
void print_bare_fully(std::ostream &ost, long int *v, int len)
void zero(long int *v, long int len)
long int maximum(long int *v, int len)
void mone(long int *v, long int len)
void set_print(long int *v, int len)
void take_away(long int *v, int &len, long int *take_away, int nb_take_away)
long int minimum(long int *v, int len)
int matrix_max_log_of_entries(long int *p, int m, int n)
void print_as_table(std::ostream &ost, long int *v, int len, int width)
void copy(long int *from, long int *to, long int len)
void scan_from_stream(std::istream &is, long int *&v, int &len)
void create_string_with_quotes(std::string &str, long int *v, int len)
void print_to_str_naked(char *str, long int *data, int len)
void print(std::ostream &ost, long int *v, int len)
void matrix_print(long int *p, int m, int n)
void print_fully(std::ostream &ost, long int *v, int len)
a collection of functions related to sorted vectors
int lint_vec_search(long int *v, int len, long int a, int &idx, int verbose_level)
basic number theoretic functions
int lint_log10(long int n)
the orbiter library for the classification of combinatorial objects