1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192
| #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define NBFILM 50000
struct Movie {
char* real;
char* name;
int time;
char* type;
int id;
};
typedef struct Movie Movie;
struct LMovie{
Movie * movie;
struct LMovie * next;
};
typedef struct LMovie LMovie;
typedef struct TrieNode {
char character;
struct TrieNode* children[26];
int isEndOfWord;
int isReal;
int isName;
LMovie* LMovie;
} TrieNode;
TrieNode* createNode(char character, int isReal,int isName) {
TrieNode* newNode = malloc(sizeof(TrieNode));
newNode->character = character;
newNode->isEndOfWord = 0;
newNode->LMovie = NULL;
newNode->isReal = isReal;
newNode->isName = isName;
for (int i = 0; i < 26; i++) {
newNode->children[i] = NULL;
}
return newNode;
}
Movie* createMovie(char real[100], char name[100], int time, char type[100], int id) {
Movie* movie = malloc(sizeof(Movie));
movie->real = malloc(strlen(real) + 1);
movie->name = malloc(strlen(name) + 1);
movie->type = malloc(strlen(type) + 1);
movie->time = time;
strcpy(movie->real, real);
strcpy(movie->name, name);
strcpy(movie->type, type);
movie->id=id;
return movie;
}
LMovie * createLMovie(Movie * movie){
LMovie* lmovie = malloc(sizeof(LMovie));
lmovie->next=NULL;
lmovie->movie=movie;
return lmovie;
}
void addNext(LMovie ** lmovie, Movie* movie) {
if (*lmovie == NULL) {
*lmovie = createLMovie(movie);
} else {
LMovie* temp = *lmovie;
while (temp->next != NULL) {
temp = temp->next;
}
temp->next = createLMovie(movie);
}
}
TrieNode* insertTrieRealName(TrieNode* root, char name[100],int isReal,int isName) {
int i = 0;
int len = strlen(name);
TrieNode* currNode = root;
while(name[i]!='\0') {
while (name[i] < 'a' && name[i] > 'z') {
if (name[i] >= 'A' && name[i] <= 'Z') {
name[i] = name[i] + 32;
} else {
i += 1;
}
}
int index = name[i] - 'a';
if (currNode->children[index] == NULL) {
currNode->children[index] = createNode(name[i],isReal,isName);
}
currNode = currNode->children[index];
i+=1;
}
return currNode;
}
TrieNode* insertTrieMovie(TrieNode* root, Movie * movie, int isReal) {
TrieNode* currNode;
if(isReal){
currNode=insertTrieRealName(root,movie->real,1,0);
}else{
currNode=insertTrieRealName(root,movie->name,0,0);
}
if (currNode->isEndOfWord) {
addNext(&(currNode->LMovie),movie);
} else {
currNode->isEndOfWord = 1;
currNode->LMovie = createLMovie(movie);
}
return root;
}
TrieNode* insertTrie(TrieNode* root, Movie * movie) {
root=insertTrieMovie(root,movie,1);
root=insertTrieMovie(root,movie,0);
return root;
}
void printMovie(Movie* movie) {
printf("Realisateur: %s\n", movie->real);
printf("Nom: %s\n", movie->name);
printf("Durée: %d\n", movie->time);
printf("Type: %s\n", movie->type);
printf("\n");
}
TrieNode* createTrie(const char* filename) {
TrieNode* root = createNode('\0',0,0);
Movie * movie;
char real[100];
char name[100];
int time;
char type[100];
int id=0;
FILE* file;
file = fopen(filename, "r");
if (file == NULL) {
printf("Error opening the file: %s\n", filename);
exit(1);
}
while (fscanf(file, "%255[^;];%255[^;];%d;%255[^\n]\n", real, name, &time, type) == 4) {
movie=createMovie(real, name, time, type,id);
root=insertTrie(root,movie);
id+=1;
}
fclose(file);
return root;
}
void printTrie(TrieNode* node) {
int i = 0;
if (node->isEndOfWord) {
LMovie * temp=node->LMovie;
while(temp!=NULL){
printMovie(temp->movie);
temp=temp->next;
}
}
for (i = 0; i < 26; i++) {
if (node->children[i] != NULL) {
printTrie(node->children[i]);
}
}
}
void Search(TrieNode* root, char name[100]) {
TrieNode* currNode = root;
int i = 0;
int len = strlen(name);
for (i = 0; i < len; i++) {
while (name[i] < 97 && name[i] > 122) {
if (name[i] >= 65 && name[i] <= 90) {
name[i] = name[i] + 32;
} else {
i += 1;
}
len += 1;
}
int index = name[i] - 'a';
if (index < 0 || index >= 26) {
return;
}
currNode = currNode->children[index];
}
printTrie(currNode);
}
int main() {
char search[100] = "ab";
TrieNode* root = createNode('\0',0,0);
root=createTrie("data.txt");
return 0;
} |
Partager