|
|
1.1 root 1: .\" Copyright (c) 1983 Regents of the University of California.
2: .\" All rights reserved. The Berkeley software License Agreement
3: .\" specifies the terms and conditions for redistribution.
4: .\"
5: .\" @(#)insque.3 6.2 (Berkeley) 5/20/86
6: .\"
7: .TH INSQUE 3 "May 20, 1986"
8: .UC 5
9: .SH NAME
10: insque, remque \- insert/remove element from a queue
11: .SH SYNOPSIS
12: .nf
13: .DT
14: .ft B
15: struct qelem {
16: struct qelem *q_forw;
17: struct qelem *q_back;
18: char q_data[];
19: };
20: .PP
21: .ft B
22: insque(elem, pred)
23: struct qelem *elem, *pred;
24: .PP
25: .ft B
26: remque(elem)
27: struct qelem *elem;
28: .ft R
29: .SH DESCRIPTION
30: .I Insque
31: and
32: .I remque
33: manipulate queues built from doubly linked lists. Each
34: element in the queue must in the form of ``struct qelem''.
35: .I Insque
36: inserts
37: .I elem
38: in a queue immediately after
39: .IR pred ;
40: .I remque
41: removes an entry
42: .I elem
43: from a queue.
44: .SH "SEE ALSO
45: ``VAX Architecture Handbook'', pp. 228-235.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.