-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathposts.c
More file actions
690 lines (624 loc) · 18.8 KB
/
Copy pathposts.c
File metadata and controls
690 lines (624 loc) · 18.8 KB
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
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "users.h"
#include "posts.h"
#include "queue.h"
static linked_list_t *posts;
static unsigned int current_post_id = 1;
void handle_input_posts(char *input)
{
char *commands = strdup(input);
char *cmd = strtok(commands, "\n ");
if (!cmd)
return;
if (!strcmp(cmd, "create")) {
char *name = strtok(NULL, "\n ");
char *title = strtok(NULL, "\n");
if (title[0] == '"') {
title++;
title = strtok(title, "\"");
}
add_post(name, title);
} else if (!strcmp(cmd, "repost")) {
char *name = strtok(NULL, "\n ");
unsigned int post_id = atoi(strtok(NULL, "\n "));
unsigned int repost_id = 0;
char *auxiliar = strtok(NULL, "\n ");
if (auxiliar)
repost_id = atoi(auxiliar);
unsigned int new_repost_id = add_repost(name, post_id, repost_id);
if (new_repost_id)
printf("Created repost #%d for %s\n", new_repost_id, name);
} else if (!strcmp(cmd, "common-repost")) {
unsigned int post = atoi(strtok(NULL, "\n "));
unsigned int fst_repost = atoi(strtok(NULL, "\n "));
unsigned int second_repost = atoi(strtok(NULL, "\n "));
int ancestor = find_common_repost(post, fst_repost, second_repost);
print_common_repost(ancestor, fst_repost, second_repost);
} else if (!strcmp(cmd, "like")) {
char *name = strtok(NULL, "\n ");
unsigned int post_id = atoi(strtok(NULL, "\n "));
unsigned int repost_id = 0;
char *auxiliar = strtok(NULL, "\n ");
if (auxiliar)
repost_id = atoi(auxiliar);
unsigned int liked = update_post_likes(name, post_id, repost_id);
if (liked)
print_liked_posts(name, repost_id, post_id);
else
print_unliked_posts(name, repost_id, post_id);
} else if (!strcmp(cmd, "ratio")) {
unsigned int post = atoi(strtok(NULL, "\n "));
unsigned int maximum_likes_post_id = get_maximum_likes_repost_id(post);
if (maximum_likes_post_id != post)
printf("Post %u got ratio'd by repost %u\n", post,
maximum_likes_post_id);
else
printf("The original post is the highest rated\n");
} else if (!strcmp(cmd, "delete")) {
unsigned int post_id = atoi(strtok(NULL, "\n "));
unsigned int repost_id = 0;
char *auxiliar = strtok(NULL, "\n ");
if (auxiliar)
repost_id = atoi(auxiliar);
delete_repost(post_id, repost_id);
printf("Deleted repost #%d of post \"%s\"\n", repost_id,
get_post_title_by_id(post_id));
} else if (!strcmp(cmd, "get-likes")) {
unsigned int post_id = atoi(strtok(NULL, "\n "));
unsigned int repost_id = 0;
char *auxiliar = strtok(NULL, "\n ");
if (auxiliar)
repost_id = atoi(auxiliar);
unsigned int likes = get_post_likes(post_id, repost_id);
if (repost_id)
printf("Repost #%u has %u likes\n", repost_id, likes);
else
printf("Post \"%s\" has %u likes\n", get_post_title_by_id(post_id),
likes);
} else if (!strcmp(cmd, "get-reposts")) {
unsigned int post_id = atoi(strtok(NULL, "\n "));
unsigned int repost_id = 0;
char *auxiliar = strtok(NULL, "\n ");
if (auxiliar)
repost_id = atoi(auxiliar);
print_reposts(post_id, repost_id);
}
free(commands);
}
linked_list_t *get_all_posts(void) {
return posts;
}
char *get_post_title_by_id(unsigned int post_id) {
post_t *post = get_post_by_id(post_id);
return post->title;
}
void print_liked_posts(char *name, int rep_id, int post_id)
{
if (rep_id)
printf("User %s liked repost \"%s\"\n", name,
get_post_title_by_id(post_id));
else
printf("User %s liked post \"%s\"\n", name,
get_post_title_by_id(post_id));
}
void print_unliked_posts(char *name, int rep_id, int post_id)
{
if (rep_id)
printf("User %s unliked repost \"%s\"\n", name,
get_post_title_by_id(post_id));
else
printf("User %s unliked post \"%s\"\n", name,
get_post_title_by_id(post_id));
}
profile_post_t *create_profile_post(post_t *post, char *original_post_title) {
profile_post_t *profile_post = malloc(sizeof(profile_post_t));
profile_post->post = post;
profile_post->original_post_title = original_post_title;
return profile_post;
}
void free_profile_post(profile_post_t *profile_post) {
free(profile_post);
}
static int
compare_user_profile_posts_by_creation_order(const void *a, const void *b)
{
const profile_post_t *first = *((profile_post_t **)a);
const profile_post_t *second = *((profile_post_t **)b);
if (!first->original_post_title &&
second->original_post_title) {
return -1;
} else if (first->original_post_title &&
!second->original_post_title) {
return 1;
}
return first->post->id - second->post->id;
}
profile_post_t
**get_user_profile_posts(unsigned int user_id, unsigned int *no_posts) {
ll_node_t *post_node = posts->head;
profile_post_t **u_pr_pos = NULL;
unsigned int nr_p = 0;
while (post_node) {
post_t *post = get_post_from_node(post_node);
if (post->user_id == user_id) {
if (!nr_p) {
nr_p++;
u_pr_pos = malloc(nr_p * sizeof(profile_post_t *));
u_pr_pos[nr_p - 1] = create_profile_post(post, NULL);
} else {
nr_p++;
unsigned int dim = sizeof(profile_post_t *);
u_pr_pos = realloc(u_pr_pos, nr_p * dim);
u_pr_pos[nr_p - 1] = create_profile_post(post, NULL);
}
}
unsigned int node = 0;
queue_t *queue = init_queue(sizeof(int));
push_queue(queue, &node);
while (!is_empty_queue(queue)) {
int node = *((int *)peek_queue(queue));
ll_node_t *rm_node = pop_queue(queue);
free(rm_node->data);
free(rm_node);
linked_list_t *list = lg_get_neighbours(post->events, node);
ll_node_t *repost_node = list->head;
while (repost_node) {
int next = *((int *)repost_node->data);
post_t *repost = get_repost_by_index(post, next);
if (repost->user_id == user_id) {
if (!nr_p) {
nr_p++;
u_pr_pos = malloc(nr_p * sizeof(profile_post_t *));
u_pr_pos[nr_p - 1] = create_profile_post(post,
post->title);
} else {
nr_p++;
unsigned int sz = sizeof(profile_post_t *);
u_pr_pos = realloc(u_pr_pos,
nr_p * sz);
u_pr_pos[nr_p - 1] = create_profile_post(post,
post->title);
}
}
push_queue(queue, &next);
repost_node = repost_node->next;
}
}
destroy_queue(&queue);
post_node = post_node->next;
}
if (u_pr_pos)
qsort(u_pr_pos, nr_p, sizeof(profile_post_t *),
compare_user_profile_posts_by_creation_order);
if (no_posts)
*no_posts = nr_p;
return u_pr_pos;
}
unsigned int add_post(char *username, char *title) {
if (!posts)
posts = ll_create(sizeof(post_t));
post_t *post = create_post(current_post_id, title,
get_user_id(username), 0);
unsigned int sz_int = sizeof(int);
lg_add_node(post->events, ¤t_post_id, sz_int);
current_post_id++;
ll_add_nth_node(posts, 0, post);
unsigned int new_post_id = post->id;
free(post);
printf("Created \"%s\" for %s\n", title, username);
return new_post_id;
}
post_t
*create_post(unsigned int id, char *title, unsigned int user_id,
unsigned int is_repost) {
post_t *post = malloc(sizeof(post_t));
if (!is_repost) {
post->events = lg_create();
post->title = strdup(title);
} else {
post->events = NULL;
post->title = NULL;
}
post->user_id = user_id;
post->likes = dll_create(sizeof(unsigned int));
post->id = id;
return post;
}
int find_common_repost(unsigned int post_id, unsigned int first_repost,
unsigned int second_repost) {
post_t *root_post = get_post_by_id(post_id);
unsigned int fst_rep = first_repost;
unsigned int sec_rep = second_repost;
unsigned int ancestor;
ancestor = lg_lowest_common_ancestor(root_post->events,
get_repost_index(root_post, fst_rep),
get_repost_index(root_post, sec_rep));
if (ancestor != (unsigned int)-1 && ancestor != 0)
return (*((post_t **)root_post->events->data[ancestor]))->id;
else if (ancestor == 0)
return root_post->id;
else
return -1;
}
void print_common_repost(int anc, unsigned int fst, unsigned int sec)
{
if (anc == -1)
printf("No common reposts for %u and %u\n", fst, sec);
else
printf("The first common repost of %u and %u is %u\n", fst, sec, anc);
}
post_t *get_post_by_id(unsigned int post_id) {
ll_node_t *post_node = posts->head;
while (post_node) {
post_t *post = get_post_from_node(post_node);
if (post->id == post_id)
return post;
post_node = post_node->next;
}
return NULL;
}
unsigned int get_number_reposts(post_t *post) {
return post->events->nodes;
}
unsigned int
add_repost(char *name, unsigned int post_id, unsigned int repost_id) {
post_t *repost = create_post(current_post_id, NULL, get_user_id(name), 1);
post_t *reposted_post = get_post_by_id(post_id);
if (reposted_post) {
lg_add_node(reposted_post->events, &repost, sizeof(post_t *));
if (repost_id == 0) {
lg_add_edge(reposted_post->events, 0,
get_number_reposts(reposted_post) - 1);
} else {
unsigned int repost_index = get_repost_index(reposted_post,
repost_id);
lg_add_edge(reposted_post->events, repost_index,
get_number_reposts(reposted_post) - 1);
}
current_post_id++;
return repost->id;
}
return 0;
}
post_t *get_post_from_node(ll_node_t *node) {
return node->data;
}
unsigned int get_repost_index(post_t *post, unsigned int repost_id) {
queue_t *queue = init_queue(sizeof(unsigned int));
list_graph_t *graph = post->events;
unsigned int repost_index = -1;
unsigned int current_node = 0;
push_queue(queue, ¤t_node);
while (!is_empty_queue(queue)) {
current_node = *((unsigned int *)peek_queue(queue));
ll_node_t *rm_node = pop_queue(queue);
free(rm_node->data);
free(rm_node);
linked_list_t *list = lg_get_neighbours(graph, current_node);
ll_node_t *node = list->head;
int done = 0;
while (node) {
unsigned int next = *((unsigned int *)node->data);
push_queue(queue, &next);
if ((*((post_t **)graph->data[next]))->id == repost_id) {
repost_index = next;
done = 1;
break;
}
node = node->next;
}
if (done)
break;
}
destroy_queue(&queue);
return repost_index;
}
post_t *get_repost_by_index(post_t *post, unsigned int index) {
if (index == 0)
return post;
return *((post_t **)post->events->data[index]);
}
void print_posts(void) {
if (posts) {
printf("\n--------POSTS--------\n");
ll_node_t *node = posts->head;
while (node) {
print_post(node->data);
node = node->next;
}
printf("\n--------END POSTS--------\n");
}
}
void print_post(post_t *post) {
printf("\n--------POST--------\n");
printf("--------ID - %u--------\n", post->id);
printf("--------TITLE - %s--------\n", post->title);
printf("--------USER ID - %u--------\n", post->user_id);
lg_print_post(post->events);
for (unsigned int i = 0; i < get_number_reposts(post); i++) {
post_t *liked_post = NULL;
if (i == 0)
liked_post = post;
else
liked_post = get_repost_by_index(post, i);
dll_node_t *like_node = liked_post->likes->head;
printf("--------LIKES - %u - ID - %u--------\n",
dll_get_size(liked_post->likes), liked_post->id);
while (like_node) {
printf("%s\n", get_user_name(*((int *)like_node->data)));
like_node = dll_get_next_node(liked_post->likes, like_node);
}
}
}
void free_posts(void) {
if (posts) {
ll_node_t *node = posts->head;
while (node) {
ll_node_t *next = node->next;
node = ll_remove_nth_node(posts, 0);
post_t *post = node->data;
free(post->title);
dll_free(&post->likes);
for (unsigned int i = 1; i < get_number_reposts(post); i++) {
post_t *graph_post = (*((post_t **)post->events->data[i]));
dll_free(&graph_post->likes);
free(graph_post);
}
lg_free(post->events);
free(node->data);
free(node);
node = next;
}
ll_free(&posts);
}
}
void remove_post(unsigned int post_id) {
unsigned int i = 0;
ll_node_t *node = posts->head;
while (node) {
ll_node_t *next = node->next;
if (((post_t *)node->data)->id == post_id) {
node = ll_remove_nth_node(posts, i);
post_t *post = node->data;
free(post->title);
dll_free(&post->likes);
for (unsigned int i = 1; i < get_number_reposts(post); i++) {
post_t *graph_post = (*((post_t **)post->events->data[i]));
dll_free(&graph_post->likes);
free(graph_post);
}
lg_free(post->events);
free(node->data);
free(node);
break;
}
node = next;
i++;
}
}
void lg_print_post(list_graph_t *graph)
{
printf("\n--------GRAPH - index - 0--------\n");
for (int i = 0; i < graph->nodes; i++) {
if (i == 0)
printf("No. node: %d - info. node: %d :\n", i,
*((int *)graph->data[i]));
else
printf("No. node: %d - info. node: %d :\n", i,
(*((post_t **)graph->data[i]))->id);
ll_node_t *node = graph->neighbors[i]->head;
while (node) {
printf("%d, ", *((int *)node->data));
node = node->next;
}
printf("\n");
}
}
unsigned int
update_post_likes(char *name, unsigned int post_id, unsigned int repost_id)
{
unsigned int rep_id = repost_id;
unsigned int user_id = get_user_id(name);
post_t *post = get_post_by_id(post_id);
if (repost_id == 0) {
dll_node_t *liked_node = get_user_like_node(post, user_id);
if (!liked_node) {
dll_add_tail(post->likes, &user_id);
return 1;
}
dll_node_t *rm_node = dll_remove_node(post->likes, liked_node);
free(rm_node->data);
free(rm_node);
return 0;
}
post_t *repost = get_repost_by_index(post,
get_repost_index(post, rep_id));
dll_node_t *liked_node = get_user_like_node(repost, user_id);
if (!liked_node) {
dll_add_tail(repost->likes, &user_id);
return 1;
}
dll_node_t *rm_node = dll_remove_node(repost->likes, liked_node);
free(rm_node->data);
free(rm_node);
return 0;
}
dll_node_t *get_user_like_node(post_t *post, unsigned int user_id)
{
dll_node_t *node = post->likes->head;
while (node) {
unsigned int node_user_id = *((int *)node->data);
if (node_user_id == user_id)
return node;
node = dll_get_next_node(post->likes, node);
}
return NULL;
}
unsigned int get_post_likes(unsigned int post_id, unsigned int repost_id)
{
unsigned int rep_id = repost_id;
post_t *post = get_post_by_id(post_id);
if (repost_id == 0)
return dll_get_size(post->likes);
post_t *repost = get_repost_by_index(post,
get_repost_index(post, rep_id));
return dll_get_size(repost->likes);
}
unsigned int get_maximum_likes_repost_id(unsigned int post_id)
{
post_t *post = get_post_by_id(post_id);
unsigned int maximum_likes = dll_get_size(post->likes);
unsigned int maximum_likes_id = post_id;
for (unsigned int i = 1; i < get_number_reposts(post); i++) {
post_t *repost = (*((post_t **)post->events->data[i]));
unsigned int likes = dll_get_size(repost->likes);
if (likes > maximum_likes) {
maximum_likes = likes;
maximum_likes_id = repost->id;
}
}
return maximum_likes_id;
}
post_t *get_repost_by_id(unsigned int repost_id, unsigned int *index) {
ll_node_t *post_node = posts->head;
while (post_node) {
post_t *post = get_post_from_node(post_node);
if (post->id == repost_id) {
if (index)
*index = 0;
return post;
}
for (unsigned int i = 1; i < get_number_reposts(post); i++) {
post_t *repost = get_repost_by_index(post, i);
if (repost->id == repost_id) {
if (index)
*index = i;
return post;
}
}
post_node = post_node->next;
}
return NULL;
}
static void __print_reposts(post_t *post, unsigned int current_node)
{
list_graph_t *repost_graph = post->events;
linked_list_t *list = lg_get_neighbours(repost_graph, current_node);
ll_node_t *node = list->head;
post_t *repost = get_repost_by_index(post, current_node);
if (current_node != 0)
printf("Repost #%u by %s\n", repost->id,
get_user_name(repost->user_id));
else
printf("\"%s\" - Post by %s\n", repost->title,
get_user_name(repost->user_id));
while (node) {
unsigned int next = *((int *)node->data);
__print_reposts(post, next);
node = node->next;
}
}
void print_reposts(unsigned int post_id, unsigned int repost_id) {
post_t *post = get_post_by_id(post_id);
unsigned int index = 0;
if (repost_id)
index = get_repost_index(post, repost_id);
if (post) {
__print_reposts(post, index);
} else {
post = get_repost_by_id(post_id, &index);
__print_reposts(post, index);
}
}
void delete_repost(unsigned int post_id, unsigned int repost_id) {
if (repost_id == 0) {
remove_post(post_id);
} else {
unsigned int current_node = 0;
post_t *post = get_post_by_id(post_id);
queue_t *queue = init_queue(sizeof(int));
unsigned int repost_node = get_repost_index(post, repost_id);
push_queue(queue, ¤t_node);
unsigned int repost_parent_found = 0;
while (!is_empty_queue(queue) && !repost_parent_found) {
current_node = *((int *)peek_queue(queue));
ll_node_t *rm_node = pop_queue(queue);
free(rm_node->data);
free(rm_node);
linked_list_t *list = lg_get_neighbours(post->events, current_node);
ll_node_t *node = list->head;
while (node && !repost_parent_found) {
unsigned int next = *((int *)node->data);
if (next == repost_node) {
repost_parent_found = 1;
lg_remove_edge(post->events, current_node, next);
break;
}
push_queue(queue, &next);
node = node->next;
}
}
destroy_queue(&queue);
delete_reposts_with_parent_repost(post, repost_node);
}
}
void delete_reposts_with_parent_repost(post_t *og_post,
unsigned int repost_index) {
unsigned int current_node = repost_index;
queue_t *queue = init_queue(sizeof(int));
push_queue(queue, ¤t_node);
unsigned int removed_nodes[get_number_reposts(og_post)];
unsigned int removed_counter = 0;
while (!is_empty_queue(queue)) {
current_node = *((int *)peek_queue(queue));
ll_node_t *rm_node = pop_queue(queue);
free(rm_node->data);
free(rm_node);
linked_list_t *list = lg_get_neighbours(og_post->events, current_node);
ll_node_t *node = list->head;
while (node) {
ll_node_t *next_node = node->next;
unsigned int next = *((int *)node->data);
push_queue(queue, &next);
lg_remove_edge(og_post->events, current_node, next);
node = next_node;
}
post_t *rm_repost = (*((post_t **)og_post->events->data[current_node]));
free(rm_repost->title);
dll_free(&rm_repost->likes);
free(rm_repost);
ll_free(&list);
free(og_post->events->data[current_node]);
og_post->events->data[current_node] = NULL;
removed_nodes[removed_counter++] = current_node;
}
while (removed_counter) {
unsigned int removed_node = removed_nodes[removed_counter - 1];
for (unsigned int i = removed_node;
i < get_number_reposts(og_post) - 1; i++) {
og_post->events->data[i] = og_post->events->data[i + 1];
og_post->events->neighbors[i] = og_post->events->neighbors[i + 1];
}
og_post->events->nodes--;
unsigned int size = sizeof(void *);
og_post->events->data = realloc(og_post->events->data,
size * og_post->events->nodes);
for (unsigned int i = 0; i < get_number_reposts(og_post) - 1; i++) {
if (og_post->events->data[i]) {
linked_list_t *list = lg_get_neighbours(og_post->events,
i);
ll_node_t *node = list->head;
while (node) {
unsigned int *next = node->data;
if (*next > removed_node)
(*next)--;
node = node->next;
}
}
}
removed_counter--;
}
destroy_queue(&queue);
}