t_map ft_read(char *filename)
{
int fd;
char *line;
char **tab;
t_index index;
t_map grid;
index.j = 0;
grid.nb_lines = count_lines(filename);
grid.tab = (int **)ft_memalloc(sizeof(int *) * count_lines(filename));
fd = open(filename, O_RDONLY);
while (get_next_line(fd, &line) > 0)
{
grid.nb_col = count_col(line); //attention ne fonctionne que pour les maps rectangle (prend la valeur de la derniere line)
grid.tab[index.j] = (int *)ft_memalloc(sizeof(int) * count_col(line));
tab = ft_strsplit(line, ' ');
index.i = 0;
while (tab[index.i])
{
grid.tab[index.j][index.i] = ft_atoi(tab[index.i]);
index.i++;
}
index.j++;
}
return (grid);
}
/** execute_db_operator takes as input the db_operator and executes the query.
* It should return the result (currently as a char*, although I'm not clear
* on what the return type should be, maybe a result struct, and then have
* a serialization into a string message).
**/
char* execute_db_operator(db_operator* query) {
status s;
if (query->type == INSERT) {
table* tbl1 = query->tables[0];
for(size_t i = 0; i < tbl1->col_count; i++) {
s = col_insert(query->columns[i], query->value1[i]);
if (s.code != OK) {
return s.error_message;
}
}
return "Rows successfully inserted.";
} else if (query->type == SELECT) {
result* r = malloc(sizeof(struct result));
if (query->columns) {
s = select_data(query, &r);
} else if (query->result1 && query->result2) {
s = vec_scan(query, &r);
} else {
return "Cannot perform select\n";
}
if (s.code != OK) {
return s.error_message;
}
int idx = catalogs[0]->var_count;
catalogs[0]->names[idx] = query->name1;
catalogs[0]->results[idx] = r;
catalogs[0]->var_count++;
} else if (query->type == PROJECT) {
result* r = malloc(sizeof(struct result));
status s = fetch(*(query->columns), query->result1->payload, query->result1->num_tuples, &r);
if (s.code != OK) {
return s.error_message;
}
int idx = catalogs[0]->var_count;
catalogs[0]->names[idx] = query->name1;
catalogs[0]->results[idx] = r;
catalogs[0]->var_count++;
} else if (query->type == ADD) {
result* r = malloc(sizeof(struct result));
s = add_col((int*)query->result1->payload, (int*)query->result2->payload, query->result1->num_tuples, &r);
if (s.code != OK) {
return s.error_message;
}
int idx = catalogs[0]->var_count;
catalogs[0]->names[idx] = query->name1;
catalogs[0]->results[idx] = r;
// for (size_t i = 0; i < r->num_tuples; ++i)
// {
// printf("%ld\n", ((long*)r->payload)[i]);
// }
catalogs[0]->var_count++;
} else if (query->type == SUB) {
result* r = malloc(sizeof(struct result));
s = sub_col((int*)query->result1->payload, (int*)query->result2->payload, query->result1->num_tuples, &r);
if (s.code != OK) {
return s.error_message;
}
int idx = catalogs[0]->var_count;
catalogs[0]->names[idx] = query->name1;
catalogs[0]->results[idx] = r;
catalogs[0]->var_count++;
} else if (query->type == AGGREGATE) {
result* r = malloc(sizeof(struct result));
if (query->agg == MIN) {
s = min_col(query->result1, &r);
} else if (query->agg == MAX) {
s = max_col(query->result1, &r);
} else if (query->agg == AVG) {
s = avg_col(query->result1, &r);
} else if (query->agg == CNT) {
s = count_col(query->result1->num_tuples, &r);
} else {
return "Failed aggregation";
}
if (s.code != OK) {
return s.error_message;
}
int idx = catalogs[0]->var_count;
catalogs[0]->names[idx] = query->name1;
catalogs[0]->results[idx] = r;
catalogs[0]->var_count++;
}
return "Success";
}
