2024-11-04 12:54:55 +00:00
|
|
|
#include "a_station.h"
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
struct station* create_station(){
|
|
|
|
struct station* station = (struct station*)calloc(1,sizeof(struct station));
|
|
|
|
station->tracks = (struct car**)calloc(STATION_SIZE, sizeof(struct car*));
|
|
|
|
station->track_count = STATION_SIZE;
|
|
|
|
return station;
|
|
|
|
}
|
|
|
|
|
|
|
|
void destroy_station(struct station* station){
|
|
|
|
}
|
|
|
|
|
|
|
|
int select_track(struct station* station, const char* target){
|
2024-11-04 13:00:46 +00:00
|
|
|
unsigned long hash = 5381;
|
|
|
|
int c;
|
|
|
|
while ((c = *target++)) {
|
|
|
|
hash = ((hash << 5) + hash) + c; // hash * 33 + c
|
|
|
|
}
|
|
|
|
return hash % station->track_count;
|
2024-11-04 12:54:55 +00:00
|
|
|
}
|
|
|
|
|
2024-11-04 13:00:46 +00:00
|
|
|
|
2024-11-04 12:54:55 +00:00
|
|
|
void add_target_capacity(struct station* station,const char* target, int capacity){
|
2024-11-04 13:01:58 +00:00
|
|
|
int index = select_track(station, target);
|
|
|
|
struct car* current = station->tracks[index];
|
|
|
|
|
|
|
|
while (current) {
|
|
|
|
if (strcmp(current->value, target) == 0) {
|
|
|
|
current->capacity += capacity; // Pridá kapacitu
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
current = current->next;
|
|
|
|
}
|
|
|
|
|
2024-11-04 13:05:18 +00:00
|
|
|
|
2024-11-04 13:01:58 +00:00
|
|
|
struct car* new_car = (struct car*)malloc(sizeof(struct car));
|
|
|
|
strncpy(new_car->value, target, TARGET_SIZE - 1);
|
|
|
|
new_car->value[TARGET_SIZE - 1] = '\0';
|
|
|
|
new_car->capacity = capacity;
|
|
|
|
new_car->next = station->tracks[index];
|
|
|
|
station->tracks[index] = new_car;
|
2024-11-04 12:54:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int get_target_capacity(struct station* station,const char* target){
|
2024-11-04 13:05:18 +00:00
|
|
|
int index = select_track(station, target);
|
|
|
|
struct car* current = station->tracks[index];
|
|
|
|
|
|
|
|
while (current) {
|
|
|
|
if (strcmp(current->value, target) == 0) {
|
|
|
|
return current->capacity;
|
|
|
|
}
|
|
|
|
current = current->next;
|
|
|
|
}
|
|
|
|
return 0;
|
2024-11-04 12:54:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int count_targets(struct station* station){
|
2024-11-04 13:10:40 +00:00
|
|
|
int count = 0;
|
|
|
|
for (int i = 0; i < station->track_count; ++i) {
|
|
|
|
struct car* current = station->tracks[i];
|
|
|
|
while (current) {
|
|
|
|
++count;
|
|
|
|
current = current->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return count;
|
2024-11-04 12:54:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int count_capacity(struct station* station){
|
2024-11-04 13:09:52 +00:00
|
|
|
int total_capacity = 0;
|
|
|
|
for (int i = 0; i < station->track_count; ++i) {
|
|
|
|
struct car* current = station->tracks[i];
|
|
|
|
while (current) {
|
|
|
|
total_capacity += current->capacity;
|
|
|
|
current = current->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return total_capacity;
|
2024-11-04 12:54:55 +00:00
|
|
|
}
|