|
|
Power 6/32 Unix version 1.2b
.TH INSQUE 3 "18 July 1983"
.UC 4
.SH NAME
insque, remque \- insert/remove element from a queue
.SH SYNOPSIS
.nf
.DT
.ft B
struct qelem {
struct qelem *q_forw;
struct qelem *q_back;
char q_data[];
};
.PP
.ft B
insque(elem, pred)
struct qelem *elem, *pred;
.PP
.ft B
remque(elem)
struct qelem *elem;
.ft R
.SH DESCRIPTION
.I Insque
and
.I remque
manipulate queues built from doubly linked lists. Each
element in the queue must in the form of ``struct qelem''.
.I Insque
inserts
.I elem
in a queue imediately after
.IR pred ;
.I remque
removes an entry
.I elem
from a queue.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.