MCPcopy Create free account
hub / github.com/algorithm-archivists/algorithm-archive / dequeue

Function dequeue

contents/flood_fill/code/c/flood_fill.c:138–143  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

136}
137
138struct point dequeue(struct queue *q) {
139 struct point ret = q->data[q->front];
140 q->front = (q->front + 1) % q->capacity;
141
142 return ret;
143}
144
145void free_queue(struct queue q) {
146 free(q.data);

Callers 1

queue_fillFunction · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected