sds_queue(3)

💖 NAME 💖

sds_queue — that's the name, bestie, and yes this is the sds_queue(3) page from the Library Functions Manual 💅

✨ SYNOPSIS ✨

#include <sds.h>

🎀 Data Fields 🎀

• struct _sds_queue_node * head
• struct _sds_queue_node * tail
• void(* value_free_fn )(void *value)

🦋 Detailed Description 🦋

A queue that is internally a doubly linked list. That's the whole vibe — queue on the outside, doubly linked list on the inside 🔥

🌸 Field Documentation 🌸

struct _sds_queue_node* sds_queue::head

The pointer to the current active head node. This is the "next" node that will be dequeued and acted upon during the dequeue (pop) operation. Main character of the front of the line, fr fr 👑

struct _sds_queue_node* sds_queue::tail

The tail of the queue. This is the "last" value that was inserted. End of the line, but make it iconic 🎀

void(* sds_queue::value_free_fn) (void *value)

If there are remaining nodes when the queue is destroyed, the queue will be drained and this free function called on the value of within. So yeah, cleanup crew gets called on the value of within those leftover nodes 🧹

💫 Author 💫

Generated automatically by Doxygen for dirsrv from the source code.

---

Source/version sign-off bestie: dirsrv, Version 3.3.0, page sds_queue(3). The footer didn't list a date in this one, so no invented date here — just the exact footer info we got 💖🫶