Hash :
1ae6ad0e
Author :
Thomas de Grivel
Date :
2024-07-15T19:59:52
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73
/* kc3
* Copyright 2022,2023,2024 kmx.io <contact@kmx.io>
*
* Permission is hereby granted to use this software granted the above
* copyright notice and this permission paragraph are included in all
* copies and substantial portions of this software.
*
* THIS SOFTWARE IS PROVIDED "AS-IS" WITHOUT ANY GUARANTEE OF
* PURPOSE AND PERFORMANCE. IN NO EVENT WHATSOEVER SHALL THE
* AUTHOR BE CONSIDERED LIABLE FOR THE USE AND PERFORMANCE OF
* THIS SOFTWARE.
*/
#include "assert.h"
#include "queue.h"
#include "list.h"
void queue_clean (s_queue *queue)
{
assert(queue);
list_delete_all(queue->head);
}
void queue_dequeue (s_queue *queue)
{
assert(queue);
if (! queue->count)
return;
queue->head = list_delete(queue->head);
queue->count--;
if (! queue->count)
queue->tail = NULL;
}
s_tag * queue_enqueue (s_queue *queue)
{
s_list *list;
assert(queue);
if (! (list = list_new(NULL)))
return NULL;
if (! queue->count) {
queue->head = list;
queue->tail = list;
}
else {
queue->tail->next.data.list = list;
queue->tail = queue->tail->next.data.list;
}
queue->count++;
return &queue->tail->tag;
}
s_tag * queue_first (s_queue *queue)
{
assert(queue);
if (! queue->count)
return NULL;
return &queue->head->tag;
}
s_queue * queue_init (s_queue *queue)
{
s_queue tmp = {0};
*queue = tmp;
return queue;
}
s_tag * queue_last (s_queue *queue)
{
assert(queue);
if (! queue->count)
return NULL;
return &queue->tail->tag;
}