feat(utilities): split utilities single header into header and c file

This commit is contained in:
lisk77 2025-08-25 23:13:31 +02:00
parent b7710d02a9
commit 02df919575
2 changed files with 105 additions and 98 deletions

View file

@ -26,103 +26,9 @@ typedef enum {
PT_ERROR
} PathType;
PathType get_path_type(const char* path) {
struct stat st;
int rc = stat(path, &st);
if (rc != 0) {
return (errno == ENOENT) ? PT_NOEXIST : PT_ERROR;
}
if (S_ISREG(st.st_mode)) return PT_FILE;
if (S_ISDIR(st.st_mode)) return PT_DIR;
return PT_OTHER;
}
void visualize_diff(File* old_version, File* new_version, ActionList* actions) {
int* deleted_lines = calloc(old_version->lines, sizeof(int));
int* inserted_lines = calloc(new_version->lines, sizeof(int));
if (!deleted_lines || !inserted_lines) {
free(deleted_lines);
free(inserted_lines);
return;
}
for (uint64_t i = 0; i < actions->len; i++) {
if (actions->actions[i].type == DELETE) {
deleted_lines[actions->actions[i].line_original] = 1;
} else if (actions->actions[i].type == INSERT) {
inserted_lines[actions->actions[i].line_changed] = 1;
}
}
uint64_t old_idx = 0, new_idx = 0;
while (old_idx < old_version->lines || new_idx < new_version->lines) {
// DELETE
if (old_idx < old_version->lines && deleted_lines[old_idx]) {
printf("%s%s%4ld | %s%s\n", RED_BG, BLACK_FG, old_idx+1, old_version->content[old_idx], RESET);
old_idx++;
}
// INSERT
else if (new_idx < new_version->lines && inserted_lines[new_idx]) {
printf("%s%s %4ld | %s%s\n", GREEN_BG, BLACK_FG, new_idx+1, new_version->content[new_idx], RESET);
new_idx++;
}
// STAYS
else if (old_idx < old_version->lines && new_idx < new_version->lines) {
printf("%4ld %4ld | %s\n", old_idx+1, new_idx+1, old_version->content[old_idx]);
old_idx++;
new_idx++;
}
// DELETE
else if (old_idx < old_version->lines) {
printf("%s%s%4ld | %s%s\n", RED_BG, BLACK_FG, old_idx+1, old_version->content[old_idx], RESET);
old_idx++;
}
// INSERT
else if (new_idx < new_version->lines) {
printf("%s%s %4ld | %s%s\n", GREEN_BG, BLACK_FG, new_idx+1, new_version->content[new_idx], RESET);
new_idx++;
}
}
free(deleted_lines);
free(inserted_lines);
}
// In this function we assume that base is a prefix of path
// Thus we just need the length of the base to jump ahead in the path
void cut_path(char* base, char* path) {
size_t base_len = strlen(base);
if (strlen(path) < base_len) perror("ERROR: the provided path is smaller than the base path!");
int add = strlen(path) != base_len ? 1 : 0;
printf("base: %li\n", base_len);
strcpy(path, path+base_len+add);
if (add) {
char tmp[PATH_MAX];
snprintf(tmp, sizeof(tmp), "%s/", path);
strcpy(path, tmp);
}
}
// In this function we assume that the end of the base and the beginning of the
// path are the same so we can concat them together at that part
// The path gets mutated in place
void combine_path(char* base, char* path) {
size_t base_len = 0;
for (size_t idx = strlen(base); idx > 0; idx--) {
if (base[idx] == '/') {
base_len = idx;
break;
}
}
char tmp[PATH_MAX];
snprintf(tmp, sizeof(tmp), "%*s/%s", base_len, base, path);
strcpy(path, tmp);
}
PathType get_path_type(const char*);
void visualize_diff(File*, File*, ActionList*);
void cut_path(char* base, char* path);
void combine_path(char* base, char* path);
#endif // UTILITIES_H

101
src/utilities.c Normal file
View file

@ -0,0 +1,101 @@
#include "utilities.h"
PathType get_path_type(const char* path) {
struct stat st;
int rc = stat(path, &st);
if (rc != 0) {
return (errno == ENOENT) ? PT_NOEXIST : PT_ERROR;
}
if (S_ISREG(st.st_mode)) return PT_FILE;
if (S_ISDIR(st.st_mode)) return PT_DIR;
return PT_OTHER;
}
void visualize_diff(File* old_version, File* new_version, ActionList* actions) {
int* deleted_lines = calloc(old_version->lines, sizeof(int));
int* inserted_lines = calloc(new_version->lines, sizeof(int));
if (!deleted_lines || !inserted_lines) {
free(deleted_lines);
free(inserted_lines);
return;
}
for (uint64_t i = 0; i < actions->len; i++) {
if (actions->actions[i].type == DELETE) {
deleted_lines[actions->actions[i].line_original] = 1;
} else if (actions->actions[i].type == INSERT) {
inserted_lines[actions->actions[i].line_changed] = 1;
}
}
uint64_t old_idx = 0, new_idx = 0;
while (old_idx < old_version->lines || new_idx < new_version->lines) {
// DELETE
if (old_idx < old_version->lines && deleted_lines[old_idx]) {
printf("%s%s%4ld | %s%s\n", RED_BG, BLACK_FG, old_idx+1, old_version->content[old_idx], RESET);
old_idx++;
}
// INSERT
else if (new_idx < new_version->lines && inserted_lines[new_idx]) {
printf("%s%s %4ld | %s%s\n", GREEN_BG, BLACK_FG, new_idx+1, new_version->content[new_idx], RESET);
new_idx++;
}
// STAYS
else if (old_idx < old_version->lines && new_idx < new_version->lines) {
printf("%4ld %4ld | %s\n", old_idx+1, new_idx+1, old_version->content[old_idx]);
old_idx++;
new_idx++;
}
// DELETE
else if (old_idx < old_version->lines) {
printf("%s%s%4ld | %s%s\n", RED_BG, BLACK_FG, old_idx+1, old_version->content[old_idx], RESET);
old_idx++;
}
// INSERT
else if (new_idx < new_version->lines) {
printf("%s%s %4ld | %s%s\n", GREEN_BG, BLACK_FG, new_idx+1, new_version->content[new_idx], RESET);
new_idx++;
}
}
free(deleted_lines);
free(inserted_lines);
}
// In this function we assume that base is a prefix of path
// Thus we just need the length of the base to jump ahead in the path
void cut_path(char* base, char* path) {
size_t base_len = strlen(base);
if (strlen(path) < base_len) perror("ERROR: the provided path is smaller than the base path!");
int add = strlen(path) != base_len ? 1 : 0;
strcpy(path, path+base_len+add);
if (add) {
char tmp[PATH_MAX];
snprintf(tmp, sizeof(tmp), "%s/", path);
strcpy(path, tmp);
}
}
// In this function we assume that the end of the base and the beginning of the
// path are the same so we can concat them together at that part
// The path gets mutated in place
void combine_path(char* base, char* path) {
size_t base_len = 0;
for (size_t idx = strlen(base); idx > 0; idx--) {
if (base[idx] == '/') {
base_len = idx;
break;
}
}
char tmp[PATH_MAX];
snprintf(tmp, sizeof(tmp), "%*s/%s", base_len, base, path);
strcpy(path, tmp);
}