usaa24/cv6/a_station.c

144 lines
4.0 KiB
C
Raw Normal View History

2024-11-08 13:24:45 +00:00
#include <stdio.h>
2024-11-01 10:00:40 +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){
2024-11-09 21:46:18 +00:00
<<<<<<< HEAD
2024-11-09 21:41:39 +00:00
if (!station) return;
for (int i = 0; i < station->track_count; ++i) {
2024-11-09 21:46:18 +00:00
=======
2024-11-08 13:23:35 +00:00
for (int i = 0; i < station->track_count; i++) {
2024-11-09 21:46:18 +00:00
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
2024-11-09 21:41:39 +00:00
struct car* current = station->tracks[i];
while (current) {
struct car* temp = current;
current = current->next;
free(temp);
}
}
free(station->tracks);
free(station);
2024-11-01 10:00:40 +00:00
}
int select_track(struct station* station, const char* target){
2024-11-09 21:46:18 +00:00
<<<<<<< HEAD
2024-11-09 21:41:39 +00:00
int sum = 0;
while (*target) {
sum += *target++;
2024-11-09 21:46:18 +00:00
=======
2024-11-08 13:24:45 +00:00
size_t length = strlen(target);
int sum = 0;
for (size_t i = 0; i < length; i++) {
sum += target[i];
2024-11-09 21:46:18 +00:00
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
2024-11-09 21:41:39 +00:00
}
return sum % station->track_count;
2024-11-01 10:00:40 +00:00
}
void add_target_capacity(struct station* station,const char* target, int capacity){
2024-11-09 21:46:18 +00:00
<<<<<<< HEAD
2024-11-09 21:41:39 +00:00
int index = select_track(station, target);
struct car* current = station->tracks[index];
2024-11-09 21:46:18 +00:00
=======
2024-11-08 13:28:50 +00:00
int track = select_track(station, target);
struct car* current = station->tracks[track];
2024-11-09 21:46:18 +00:00
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
2024-11-09 21:41:39 +00:00
while (current) {
if (strcmp(current->value, target) == 0) {
current->capacity += capacity;
return;
}
current = current->next;
}
2024-11-09 21:46:18 +00:00
<<<<<<< HEAD
2024-11-09 21:41:39 +00:00
struct car* new_car = (struct car*)malloc(sizeof(struct car));
if (!new_car) return;
strncpy(new_car->value, target, TARGET_SIZE - 1);
new_car->value[TARGET_SIZE - 1] = '\0'; // Ensure null termination
new_car->capacity = capacity;
new_car->next = station->tracks[index];
station->tracks[index] = new_car;
2024-11-01 10:00:40 +00:00
}
int get_target_capacity(struct station* station,const char* target){
2024-11-09 21:41:39 +00:00
int index = select_track(station, target);
struct car* current = station->tracks[index];
2024-11-09 21:46:18 +00:00
=======
2024-11-08 13:28:50 +00:00
struct car* new_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[track];
station->tracks[track] = new_car;
2024-11-01 10:00:40 +00:00
}
2024-11-08 13:58:56 +00:00
int get_target_capacity(struct station* station, const char* target) {
int track = select_track(station, target);
struct car* current = station->tracks[track];
2024-11-09 21:46:18 +00:00
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
2024-11-09 21:41:39 +00:00
while (current) {
if (strcmp(current->value, target) == 0) {
return current->capacity;
}
current = current->next;
}
2024-11-09 21:46:18 +00:00
<<<<<<< HEAD
2024-11-01 10:00:40 +00:00
return 0;
}
int count_targets(struct station* station){
2024-11-09 21:41:39 +00:00
int count = 0;
for (int i = 0; i < station->track_count; ++i) {
struct car* current = station->tracks[i];
while (current) {
++count;
2024-11-09 21:46:18 +00:00
=======
2024-11-08 13:58:56 +00:00
2024-11-01 10:00:40 +00:00
return 0;
}
2024-11-08 13:58:56 +00:00
int count_targets(struct station* station) {
int count = 0;
for (int i = 0; i < station->track_count; i++) {
struct car* current = station->tracks[i];
while (current) {
count++;
2024-11-09 21:46:18 +00:00
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
2024-11-09 21:41:39 +00:00
current = current->next;
}
}
return count;
2024-11-01 10:00:40 +00:00
}
2024-11-09 21:46:18 +00:00
<<<<<<< HEAD
2024-11-01 10:00:40 +00:00
int count_capacity(struct station* station){
2024-11-09 21:41:39 +00:00
int total_capacity = 0;
for (int i = 0; i < station->track_count; ++i) {
2024-11-09 21:46:18 +00:00
=======
2024-11-08 13:58:56 +00:00
int count_capacity(struct station* station) {
int total_capacity = 0;
for (int i = 0; i < station->track_count; i++) {
2024-11-09 21:46:18 +00:00
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
2024-11-09 21:41:39 +00:00
struct car* current = station->tracks[i];
while (current) {
total_capacity += current->capacity;
current = current->next;
}
}
return total_capacity;
2024-11-01 10:00:40 +00:00
}