|
|
1.1 root 1: .TH INSQUE 3 "18 July 1983"
2: .UC 4
3: .SH NAME
4: insque, remque \- insert/remove element from a queue
5: .SH SYNOPSIS
6: .nf
7: .DT
8: .ft B
9: struct qelem {
10: struct qelem *q_forw;
11: struct qelem *q_back;
12: char q_data[];
13: };
14: .PP
15: .ft B
16: insque(elem, pred)
17: struct qelem *elem, *pred;
18: .PP
19: .ft B
20: remque(elem)
21: struct qelem *elem;
22: .ft R
23: .SH DESCRIPTION
24: .I Insque
25: and
26: .I remque
27: manipulate queues built from doubly linked lists. Each
28: element in the queue must in the form of ``struct qelem''.
29: .I Insque
30: inserts
31: .I elem
32: in a queue imediately after
33: .IR pred ;
34: .I remque
35: removes an entry
36: .I elem
37: from a queue.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.