spieleprogrammierer.de - Forum und Wiki zur Spieleprogrammierung und Spieleentwicklung

C-/C++-Quelltext

#ifndef US_QUEUE_H
#define US_QUEUE_H

typedef struct Queue Queue_t;

Queue_t*    createQueue();
void        destroyQueue(Queue_t* pQueue);

void        enque(Queue_t*  pQueue, void* pData);
void*       deque(Queue_t*  pQueue);

#endif  // US_QUEUE_H

C-/C++-Quelltext

#include <Queue.h>
#include <assert.h>
#include <stdlib.h>

//---------------------------------------------------------------------------------
//  IMPLEMENTATION DETAILS
//---------------------------------------------------------------------------------

typedef struct Node Node_t;
struct Node{
  Node_t*   pNextNode;
  void*     pData;  
};

Node_t*     createNode(void* pData){
    Node_t* pNode       = (Node_t*) malloc(sizeof(Node_t));
    pNode->pNextNode    = 0;
    pNode->pData        = pData;
    return  pNode;
}

void        appendNode(Node_t* pParent, Node_t* pNodeToAppend){
    assert(0 != pParent);
    if(0 != pParent->pNextNode)
        appendNode(pParent->pNextNode, pNodeToAppend);
    else
        pParent->pNextNode  = pNodeToAppend;
}

void        deleteLine(Node_t*  pNode){
    if(0 != pNode->pNextNode)
        deleteLine(pNode->pNextNode);
    free(pNode);
}

//---------------------------------------------------------------------------------
//  ACTUAL IMPLEMENTATION
//---------------------------------------------------------------------------------

struct Queue{
    Node_t* pFirstNode;
    Node_t* pLastNode;  
};

Queue_t*    createQueue(){
    Queue_t* pQueue     = (Queue_t*) malloc(sizeof(Queue_t));
    pQueue->pFirstNode  = 0;
    pQueue->pLastNode   = 0;
    return pQueue;
}

void        destroyQueue(Queue_t*   pQueue){
    assert(0 != pQueue);
    if(0 != pQueue->pFirstNode)
        deleteLine(pQueue->pFirstNode);
    free(pQueue);
}

void        enque(Queue_t*  pQueue, void* pData){
    assert(0 != pQueue);
    Node_t* pNode = createNode(pData);
    appendNode(pQueue->pLastNode, pNode);
    pQueue->pLastNode = pNode;
}

void*       deque(Queue_t*  pQueue){
    assert(0 != pQueue);
    
    if(0 == pQueue->pFirstNode)
        return 0;
    
    Node_t* pNode = pQueue->pFirstNode;
    void*   pData = pNode->pData;
    pQueue->pFirstNode = pQueue->pFirstNode->pNextNode;
    free(pNode);
    return pData;
}