111 lines
2.7 KiB
C
111 lines
2.7 KiB
C
#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;
|
|
}
|
|
/*unsigned long hash(char *key, size_t len){
|
|
unsigned long hash;
|
|
int i;
|
|
for(hash = i = 0; i < len; ++i)
|
|
{ hash += key[i];
|
|
hash += (hash << 10);
|
|
hash ^= (hash >> 6);
|
|
}
|
|
hash += (hash << 3);
|
|
hash ^= (hash >> 11);
|
|
hash += (hash << 15);
|
|
return hash;
|
|
}*/
|
|
|
|
void destroy_station(struct station* station){
|
|
//struct car* del =prev;
|
|
for(int i=0;i>station->track_count;i++){
|
|
struct car* prev = station->tracks[i];
|
|
while (prev!=NULL)
|
|
{
|
|
struct car* del =prev;
|
|
prev=del->next;
|
|
free(del);
|
|
}
|
|
|
|
}
|
|
|
|
free(station->tracks);
|
|
free(station);
|
|
}
|
|
|
|
int select_track(struct station* station, const char* target){
|
|
unsigned long hash=0;
|
|
for(int i=0;target[i]!='\0';i++){
|
|
hash = ((hash << 5) + hash) + target[i]; /* hash * 33 + c */
|
|
}
|
|
hash = hash%station->track_count;
|
|
return hash;
|
|
}
|
|
|
|
void add_target_capacity(struct station* station,const char* target, int capacity){
|
|
int i = select_track(station,target);
|
|
struct car* slot = station->tracks[i];
|
|
if(station->tracks[i]==NULL){
|
|
struct car* newCar = malloc(sizeof(struct car));
|
|
strcpy(newCar->value,target);
|
|
newCar->capacity=capacity;
|
|
newCar->next=slot;
|
|
station->tracks[i]=newCar;
|
|
}
|
|
while (slot!=NULL)
|
|
{
|
|
if(strcmp(slot->value,target)==0){
|
|
slot->capacity +=capacity;
|
|
}
|
|
slot=slot->next;
|
|
}
|
|
}
|
|
|
|
int get_target_capacity(struct station* station,const char* target){
|
|
for(int i=0;i<station->track_count;i++){
|
|
struct car* newCar= station->tracks[i];
|
|
while (newCar->value!=NULL)
|
|
{
|
|
if(strcmp(newCar->value,target)==0){
|
|
return newCar->capacity;
|
|
}
|
|
newCar=newCar->next;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int count_targets(struct station* station){
|
|
int counter=0;
|
|
for(int i=0;i<station->track_count;i++){
|
|
struct car* newCar= station->tracks[i];
|
|
while (newCar->value!=NULL)
|
|
{
|
|
counter+=1;
|
|
newCar=newCar->next;
|
|
}
|
|
}
|
|
return counter;
|
|
}
|
|
|
|
int count_capacity(struct station* station){
|
|
int counter=0;
|
|
for(int i=0;i<station->track_count;i++){
|
|
struct car* newCar= station->tracks[i];
|
|
while (newCar->value!=NULL)
|
|
{
|
|
counter+=1;
|
|
newCar=newCar->next;
|
|
}
|
|
}
|
|
return counter;
|
|
}
|
|
|