NAME

insque, remque − insert/remove element from a queue

SYNOPSIS

include <search.h>

void insque(struct qelem ∗elem, struct qelem ∗pred);

void remque(struct qelem ∗elem);

DESCRIPTION

insque and remque manipulate queues built from doubly linked lists.  Each element in the queue must be in the following form:

struct qelem {
structqelem ∗q_forw;
structqelem ∗q_back;
charq_data[];
};

insque inserts elem in a queue immediately after pred.  remque removes an entry elem from a queue. 

  —  C Development Set