Initializacia
This commit is contained in:
parent
5bc345edef
commit
4130c22960
167
cv6/a_station.c
167
cv6/a_station.c
@ -1,143 +1,72 @@
|
|||||||
|
#include "a_train.h"
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#include "a_station.h"
|
|
||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
|
|
||||||
struct station* create_station(){
|
struct car* add_car(struct car* first, const char* target) {
|
||||||
struct station* station = (struct station*)calloc(1,sizeof(struct station));
|
struct car* last = first;
|
||||||
station->tracks = (struct car**)calloc(STATION_SIZE, sizeof(struct car*));
|
struct car* newcar = calloc(1, sizeof(struct car));
|
||||||
station->track_count = STATION_SIZE;
|
strcpy(newcar->value, target);
|
||||||
return station;
|
|
||||||
}
|
|
||||||
|
|
||||||
void destroy_station(struct station* station){
|
if (last != NULL) {
|
||||||
<<<<<<< HEAD
|
struct car* current = last;
|
||||||
if (!station) return;
|
while (current->next != NULL) {
|
||||||
|
|
||||||
for (int i = 0; i < station->track_count; ++i) {
|
|
||||||
=======
|
|
||||||
for (int i = 0; i < station->track_count; i++) {
|
|
||||||
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
|
|
||||||
struct car* current = station->tracks[i];
|
|
||||||
while (current) {
|
|
||||||
struct car* temp = current;
|
|
||||||
current = current->next;
|
current = current->next;
|
||||||
free(temp);
|
|
||||||
}
|
}
|
||||||
|
current->next = newcar;
|
||||||
|
} else {
|
||||||
|
last = newcar;
|
||||||
|
return last;
|
||||||
}
|
}
|
||||||
free(station->tracks);
|
|
||||||
free(station);
|
return first;
|
||||||
}
|
}
|
||||||
|
|
||||||
int select_track(struct station* station, const char* target){
|
void print_train(struct car* first) {
|
||||||
<<<<<<< HEAD
|
if(first != NULL){
|
||||||
int sum = 0;
|
struct car* current = first;
|
||||||
while (*target) {
|
while(current->next != NULL){
|
||||||
sum += *target++;
|
printf("%s\n", current->value);
|
||||||
=======
|
current = current->next;
|
||||||
size_t length = strlen(target);
|
}
|
||||||
int sum = 0;
|
|
||||||
for (size_t i = 0; i < length; i++) {
|
|
||||||
sum += target[i];
|
|
||||||
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
|
|
||||||
}
|
}
|
||||||
return sum % station->track_count;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
void add_target_capacity(struct station* station,const char* target, int capacity){
|
void cancel_train(struct car* first) {
|
||||||
<<<<<<< HEAD
|
struct car* current = first;
|
||||||
int index = select_track(station, target);
|
while(first != NULL){
|
||||||
struct car* current = station->tracks[index];
|
|
||||||
=======
|
|
||||||
int track = select_track(station, target);
|
|
||||||
struct car* current = station->tracks[track];
|
|
||||||
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
|
|
||||||
|
|
||||||
while (current) {
|
|
||||||
if (strcmp(current->value, target) == 0) {
|
|
||||||
current->capacity += capacity;
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
current = current->next;
|
current = current->next;
|
||||||
|
free(first);
|
||||||
|
first = current;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
struct car* clear_train(struct car* first, const char* target) {
|
||||||
|
if (first == NULL) {
|
||||||
|
return NULL;
|
||||||
}
|
}
|
||||||
|
|
||||||
<<<<<<< HEAD
|
struct car* current = first;
|
||||||
struct car* new_car = (struct car*)malloc(sizeof(struct car));
|
struct car* previous = NULL;
|
||||||
if (!new_car) return;
|
|
||||||
|
|
||||||
strncpy(new_car->value, target, TARGET_SIZE - 1);
|
while (current != NULL && strcmp(current->value, target) == 0) {
|
||||||
new_car->value[TARGET_SIZE - 1] = '\0'; // Ensure null termination
|
struct car* temp = current;
|
||||||
new_car->capacity = capacity;
|
first = current->next;
|
||||||
new_car->next = station->tracks[index];
|
current = first;
|
||||||
station->tracks[index] = new_car;
|
free(temp);
|
||||||
}
|
}
|
||||||
|
|
||||||
int get_target_capacity(struct station* station,const char* target){
|
while (current != NULL) {
|
||||||
int index = select_track(station, target);
|
|
||||||
struct car* current = station->tracks[index];
|
|
||||||
=======
|
|
||||||
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;
|
|
||||||
}
|
|
||||||
|
|
||||||
int get_target_capacity(struct station* station, const char* target) {
|
|
||||||
int track = select_track(station, target);
|
|
||||||
struct car* current = station->tracks[track];
|
|
||||||
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
|
|
||||||
|
|
||||||
while (current) {
|
|
||||||
if (strcmp(current->value, target) == 0) {
|
if (strcmp(current->value, target) == 0) {
|
||||||
return current->capacity;
|
previous->next = current->next;
|
||||||
}
|
free(current);
|
||||||
current = current->next;
|
current = previous->next;
|
||||||
}
|
} else {
|
||||||
<<<<<<< HEAD
|
previous = current;
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
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;
|
|
||||||
=======
|
|
||||||
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
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++;
|
|
||||||
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
|
|
||||||
current = current->next;
|
current = current->next;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return count;
|
|
||||||
}
|
|
||||||
|
|
||||||
<<<<<<< HEAD
|
return first;
|
||||||
int count_capacity(struct station* station){
|
|
||||||
int total_capacity = 0;
|
|
||||||
for (int i = 0; i < station->track_count; ++i) {
|
|
||||||
=======
|
|
||||||
int count_capacity(struct station* station) {
|
|
||||||
int total_capacity = 0;
|
|
||||||
for (int i = 0; i < station->track_count; i++) {
|
|
||||||
>>>>>>> 2f4bf820c1657cb30626d282fd1907d4428dd2e7
|
|
||||||
struct car* current = station->tracks[i];
|
|
||||||
while (current) {
|
|
||||||
total_capacity += current->capacity;
|
|
||||||
current = current->next;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return total_capacity;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user