Traitement-signal-plantes/Code-C/queue.c

218 lines
4.7 KiB
C
Raw Normal View History

2022-06-10 10:15:14 +02:00
#include <assert.h>
2022-06-10 15:05:04 +02:00
#include <stdio.h>
2022-06-10 10:47:17 +02:00
#include <stdlib.h>
2022-06-13 15:03:51 +02:00
#include <string.h>
2022-06-10 10:47:17 +02:00
#include "queue.h"
2022-06-10 10:15:14 +02:00
/**
2022-06-10 10:47:17 +02:00
* @brief struct queue struct used for queueing string name
2022-06-10 10:15:14 +02:00
*
* @param charLen lenght of tabChar pointeur
* @param tabChar char array pointer
* @param pNextE point next element
*/
struct queue {
int charLen;
2022-06-13 15:03:51 +02:00
char* tabChar;
2022-06-10 10:15:14 +02:00
Pqueue pNextE;
2022-06-10 10:47:17 +02:00
};
2022-06-10 10:15:14 +02:00
2022-06-10 10:47:17 +02:00
typedef struct queue *Pqueue;
2022-06-10 10:15:14 +02:00
/**
* @brief create an empty element of queue
2022-06-10 10:15:14 +02:00
*
* @return Pqueue
2022-06-10 10:15:14 +02:00
*/
Pqueue queueCreateEmpty(){
2022-06-10 10:47:17 +02:00
Pqueue new = (Pqueue) malloc(sizeof(struct queue));
2022-06-10 10:15:14 +02:00
assert(new);
new->charLen = 0;
new->tabChar = NULL;
2022-06-10 10:47:17 +02:00
new->pNextE = NULL;
2022-06-10 10:15:14 +02:00
return new;
}
/************ SETTER ************/
/**
* @brief set char size array
*
* @param elem targeted element
* @param _charLen size of char array
*/
2022-06-13 15:03:51 +02:00
void queueSetCharLen(Pqueue elem, int _charLen){
assert(elem);
elem->charLen = _charLen;
}
/**
* @brief set the char array in the element
*
* @param elem targeted element
* @param _charLen char array size
* @param _tabChar pointer to static char array
*/
2022-06-13 15:03:51 +02:00
void queueSetTabChar(Pqueue elem, int _charLen, const char *_tabChar){
assert(elem);
assert(_tabChar);
elem->charLen = _charLen;
2022-06-13 15:03:51 +02:00
elem->tabChar = calloc(_charLen , sizeof(char));
for(int i = 0; i < _charLen; i++){
2022-06-13 15:03:51 +02:00
elem->tabChar[i] = _tabChar[i];
}
}
2022-06-13 15:03:51 +02:00
/**
* @brief set next pqueue element
*
* @param elem target element
* @param next next element
*/
void queueSetNextE(Pqueue elem , Pqueue next){
assert(elem);
assert(next);
elem -> pNextE = next;
}
/************ GETTER ************/
2022-06-10 10:15:14 +02:00
/**
* @brief switch to the next element
*
* @param elem current element
* @return Pqueue next element
*/
Pqueue queueGetNextE(Pqueue elem){
2022-06-10 10:15:14 +02:00
assert(elem);
2022-06-10 10:47:17 +02:00
return elem->pNextE;
2022-06-10 10:15:14 +02:00
}
/**
* @brief get the size char array
*
* @param elem targeted element
* @return int
*/
int queueGetCharLen(Pqueue elem){
2022-06-10 15:05:04 +02:00
assert(elem);
return elem->charLen;
}
/**
* @brief get the pointer of char array
*
* @param elem targeted elemnt
* @return char*
*/
char * queueGetTabChar(Pqueue elem){
2022-06-10 15:05:04 +02:00
assert(elem);
return elem->tabChar;
}
/************ ************/
2022-06-10 15:05:04 +02:00
/**
* @brief Create Element of queue
*
* @param lenChar size of char array that will be created
* @return Pqueue new element created
*/
Pqueue queueCreateE(int lenChar, const char* _tabChar){
Pqueue new = (Pqueue) malloc(sizeof(struct queue));
assert(new);
queueSetTabChar(new, lenChar, _tabChar);
new->pNextE = NULL;
return new;
2022-06-10 15:05:04 +02:00
}
2022-06-10 10:15:14 +02:00
/**
* @brief remove and free the last element of queue
*
* @param elem current element
* @return Pqueue current element
*/
Pqueue queueRmLastE(Pqueue elem){
2022-06-10 10:15:14 +02:00
assert(elem);
Pqueue tmp = elem, previous = NULL;
2022-06-10 10:47:17 +02:00
while(elem->pNextE != NULL){
2022-06-10 10:15:14 +02:00
previous = tmp;
tmp = queueGetNextE(tmp);
2022-06-10 10:15:14 +02:00
}
2022-06-10 10:47:17 +02:00
free(tmp->tabChar);
2022-06-10 10:15:14 +02:00
free(tmp);
2022-06-10 10:47:17 +02:00
previous->pNextE = NULL;
2022-06-10 10:15:14 +02:00
return elem;
}
/**
* @brief remove and free the first element of queue
*
* @param elem target to remove (the element need to be the first)
* @return Pqueue the second element after remove first
*/
2022-06-13 17:35:00 +02:00
void queueRmFrstE(Pqueue elem){
2022-06-10 10:15:14 +02:00
assert(elem);
2022-06-10 10:47:17 +02:00
free(elem->tabChar);
2022-06-10 10:15:14 +02:00
free(elem);
}
/**
* @brief delete the first value and return the next value
*
* @param elem
* @return Pqueue
*/
Pqueue queueNextDelFrst(Pqueue elem){
2022-06-10 10:15:14 +02:00
assert(elem);
2022-06-10 10:47:17 +02:00
Pqueue tmp = elem->pNextE;
queueRmFrstE(elem);
2022-06-10 10:15:14 +02:00
return tmp;
}
/**
* @brief add in the end of queue element with string parameter
*
* @param elem Pqueue will be added at the end of queue
* @param str the string will be bind at the element
* @param len the lenght of char array
* @return Pqueue pointer to the last element
*/
2022-06-13 15:03:51 +02:00
void queueAddLastQ(Pqueue elem, const char* str, int len){
2022-06-10 10:15:14 +02:00
assert(elem);
assert(str);
2022-06-13 15:03:51 +02:00
Pqueue next = elem, previous = NULL;
while(next->pNextE != NULL){
previous = next;
next = queueGetNextE(next);
2022-06-10 10:15:14 +02:00
}
2022-06-13 15:03:51 +02:00
previous = next;
next = queueCreateE(len,str);
queueSetNextE(previous,next);
2022-06-10 10:15:14 +02:00
}
/**
* @brief Print targeted element
*
* @param elem targeted element
*/
void queuePrintE(Pqueue elem){
Pqueue next = queueGetNextE(elem);
2022-06-13 15:03:51 +02:00
printf("\nFile Name : %s \n(size of the file name : %d)\n",elem -> tabChar , elem -> charLen );
2022-06-10 15:05:04 +02:00
if(next != NULL){
printf("Next File : %s\n", next ->tabChar);
}
else{
2022-06-13 15:03:51 +02:00
printf("No nextFile existing (null)\n");
}
}
void queuePrintWholeQ(Pqueue firstE){
queuePrintE(firstE);
Pqueue elem = firstE;
while(queueGetNextE(elem) != NULL){
elem = queueGetNextE(elem);
queuePrintE(elem);
2022-06-10 15:05:04 +02:00
}
}