Attachment #49472 for bug #75545

View | Details | Raw Unified | Return to bug 75545
Collapse All | Expand All

Lines 102-108 Link Here

(-)./form_field_opts.3 (-1 lines)
102	The field is the current field.	102	The field is the current field.
103	.SH SEE ALSO	103	.SH SEE ALSO
104	\fBcurses\fR(3X), \fBform\fR(3X).	104	\fBcurses\fR(3X), \fBform\fR(3X).
105	.TP 5
106	.SH NOTES	105	.SH NOTES
107	The header file \fB<form.h>\fR automatically includes the header file	106	The header file \fB<form.h>\fR automatically includes the header file
108	\fB<curses.h>\fR.	107	\fB<curses.h>\fR.

Lines 69-75 Link Here

(-)./form_hook.3 (-1 / +1 lines)
69	current form init hook, if any (\fBNULL\fR if there is no such hook).	69	current form init hook, if any (\fBNULL\fR if there is no such hook).
70		70
71	The function \fBset_form_term\fR sets a hook to be called at form-unpost time	71	The function \fBset_form_term\fR sets a hook to be called at form-unpost time
72	and just before a page change once it is posted. \fBform_init\fR	72	and just before a page change once it is posted. \fBform_term\fR
73	returns the current form term hook, if any (\fBNULL\fR if there is no such	73	returns the current form term hook, if any (\fBNULL\fR if there is no such
74	hook).	74	hook).
75	.SH RETURN VALUE	75	.SH RETURN VALUE

Lines 45-51 Link Here

(-)./form_page.3 (-1 / +1 lines)
45	int field_index(const FIELD *field);	45	int field_index(const FIELD *field);
46	.br	46	.br
47	.SH DESCRIPTION	47	.SH DESCRIPTION
48	The function \fBset_current field\fR sets the current field of the given	48	The function \fBset_current\fR sets the current field of the given
49	form; \fBcurrent_field\fR returns the current field of the given form.	49	form; \fBcurrent_field\fR returns the current field of the given form.
50	.PP	50	.PP
51	The function \fBset_form_page\fR sets the form's page number (goes to page	51	The function \fBset_form_page\fR sets the form's page number (goes to page

Lines 342-348 Link Here

(-)./getaddrinfo.3 (-2 / +3 lines)
342	The	342	The
343	.Fa addrinfo	343	.Fa addrinfo
344	structure pointed to by the	344	structure pointed to by the
345	.Fa ai argument	345	.Fa ai
		346	argument
346	is freed, along with any dynamic storage pointed to by the structure.	347	is freed, along with any dynamic storage pointed to by the structure.
347	This operation is repeated until a	348	This operation is repeated until a
348	.Dv NULL	349	.Dv NULL
Lines 398-404 Link Here
398	The following code tries to connect to	399	The following code tries to connect to
399	.Dq Li www.kame.net	400	.Dq Li www.kame.net
400	service	401	service
401	.Dq Li http .	402	.Dq Li http
402	via stream socket.	403	via stream socket.
403	It loops through all the addresses available, regardless of the address family.	404	It loops through all the addresses available, regardless of the address family.
404	If the destination resolves to an IPv4 address, it will use an	405	If the destination resolves to an IPv4 address, it will use an

Lines 93-99 Link Here

(-)./getenv.3 (-1 / +2 lines)
93	If the variable does exist, the argument	93	If the variable does exist, the argument
94	.Ar overwrite	94	.Ar overwrite
95	is tested; if	95	is tested; if
96	.Ar overwrite is	96	.Ar overwrite
		97	is
97	zero, the	98	zero, the
98	variable is not reset, otherwise it is reset	99	variable is not reset, otherwise it is reset
99	to the given	100	to the given

Lines 112-118 Link Here

(-)./getobjformat.3 (-1 / +2 lines)
112	If the environment variable	112	If the environment variable
113	.Ev OBJFORMAT	113	.Ev OBJFORMAT
114	is set, it overrides the default object file format.	114	is set, it overrides the default object file format.
115	.Ev OBJFORMAT takes precedence over	115	.Ev OBJFORMAT
		116	takes precedence over
116	.Pa /etc/objformat .	117	.Pa /etc/objformat .
117	.El	118	.El
118	.Sh FILES	119	.Sh FILES




.Nm heap_increased ,
.Nm heap_decreased ,
.Nm heap_element ,
.Nm heap_for_each
.Nd heap implementation of priority queues
.Sh SYNOPSIS
.Fd #include <isc/heap.h>
.Ft heap_context
.Fn heap_new "heap_higher_priority_func higher_priority" \
"heap_index_func index" "int array_size_increment"
.Ft int

.Fn heap_decreased "heap_context ctx" "int i"
.Ft void *
.Fn heap_element "heap_context ctx" "int i"
.Ft int
.Fn heap_for_each "heap_context ctx" "heap_for_each_func action" "void *uap"
.Sh DESCRIPTION
These functions implement heap\-based priority queues.  The user defines a

Each of the functions depends upon the
.Ft heap_context
type, which is a pointer to a
.Ft struct heap_context
.Pq see Pa heap.h No for more information .
.Pp
The

.Ed
.Pp
These are pointers to user-defined functions.
The
.Ft heap_higher_priority_func
type is a pointer to a function which compares two
different heap (queue) elements and returns an
.Ft int
which answers the question, "Does the first queue element
have a higher priority than the second?"  In other words,
a function pointer of this type
.Em must
return a number greater than zero
if the element indicated by the first argument is of a higher priority than
that indicated by the second element, and zero otherwise.
.Pp
The other two function pointers are documented in the descriptions
of
.Fn heap_new
.Pq Va heap_index_func
and

.Pp
The function
.Fn heap_new
initializes a
.Ft struct heap_context
and returns a pointer to it.  The
.Fa higher_priority
function pointer
.Em must
be
.No non\- Ns Dv NULL .
As explained above, this refers to a
function supplied by the user which compares the priority of two different
queue or heap elements; see above for more information.
The second argument,
.Fa index ,
is a pointer to a user-defined function whose arguments are
a heap element and its index in the heap.
.Fa Index
is intended to provide the user a means of knowing the internal index
of an element in the heap while maintaining the opacity of the implementation;
since the user has to know the actual indexes of heap elements in order to use,
e.g.,
.Fn heap_delete
or
.Fn heap_element ,
the user
.Fa index
function could store the index in the heap element, itself.  If
.Fa index
is
.No non\- Ns Dv NULL ,
then it is called
.Em whenever
the index of an element changes, allowing the user to stay up\-to\-date
with index changes.
The last argument,
.Fa array_size_increment
will be used, as its name suggests, by
.Xr malloc 3
or
.Xr realloc 3
to increment the array which implements the heap; if zero, a default value
will be used.
.Pp
The
.Fn heap_free
function frees the given
.Ft heap_context
argument
.Pq Fa ctx ,
which also frees the entire
.Nm heap ,

should be
.No non\- Ns Dv NULL .
.Pp
The
.Fn heap_insert
function is used to insert the new heap element
.Fa elt
into the appropriate place (priority\-wise) in the
.Ft heap
indicated by
.Fa ctx
(a pointer to a
.Ft heap_context ) .
If
.No non\- Ns Dv NULL ,
the user-defined
.Ft higher_priority
function pointer associated with the indicated
.Nm heap
is used to determine that
.Dq appropriate place ;
the highest\-priority elements are at the front of the queue (top of
the heap).
(See the description of
.Fn heap_new ,
above, for more information.)
.Pp
The function
.Fn heap_delete
is used to delete the
.Fa i\- Ns th
element of the queue (heap), and fixing up the queue (heap) from that
element onward via the priority as determined by the user function
pointed to by
.Ft higher_priority
function pointer
(see description of
.Fn heap_new ,

.Pp
.Fn heap_decreased
.Pp
The
.Fn heap_element
function returns the
.Fa i\- Ns th

.Fn heap_for_each
function provides a mechanism for the user to increment through the entire
queue (heap) and perform some
.Fa action
upon each of the queue elements.  This
.Fa action
is pointer to a user\-defined function with two arguments, the first of
which should be interpreted by the user's function as a heap element.  The
second value passed to the user function is just the
.Fa uap
argument to
.Fn heap_for_each ;
this allows the user to specify additional arguments, if necessary, to
the function pointed to by
.Fa action .
.\" The following requests should be uncommented and
.\" used where appropriate.  This next request is

.Bl -tag -width "heap_decreased()"
.It Fn heap_new
.Dv NULL
if unable to
.Xr malloc 3
a
.Ft struct heap_context
or if the
.Fa higher_priority
function pointer is
.Dv NULL ;
otherwise, a valid
.Ft heap_context .
.Ns .
.It Fn heap_free
-1 if
.Fa ctx
is
.Dv NULL
(with
.Va errno
set to
.Dv EINVAL ) ;
otherwise, 0.
.It Fn heap_insert
-1
if either
.Fa ctx
or
.Fa elt
is
.Dv NULL ,
or if an attempt to
.Xr malloc 3
or
.Xr realloc 3
the heap array fails (with
.Va errno
set to
.Dv EINVAL
or
.Dv ENOMEM ,
respectively).
Otherwise, 0.
.It Fn heap_delete
-1 if
.Fa ctx
is
.Dv NULL
or
.Fa i
is out\-of\-range (with
.Va errno
set to

As for
.Fn heap_delete .
.It Fn heap_element
NULL if
.Fa ctx
is
.Dv NULL
or
.Fa i

.It Fn heap_for_each
-1 if either
.Fa ctx
or
.Fa action
is
.Dv NULL
(with
.Va errno
set to
.Dv EINVAL ) ;

The variable
.Va errno
is set by
.Fn heap_free ,
.Fn heap_insert ,
.Fn heap_delete ,
.Fn heap_increased ,
and
.Fn heap_decreased
under the conditions of invalid input
.Pq Dv EINVAL
or lack of memory

.Sh AUTHORS
The
.Nm heap
library was implemented by Bob Halley (halley@vix.com) of Vixie Enterprises,
Inc., for the Internet Software consortium, and was adapted from
the two books listed in the
.Sx SEE ALSO
section, above.
.\" .Sh BUGS

Lines 88-93 Link Here

(-)./hosts_access.3 (-2 / +2 lines)
88	Wietse Venema (wietse@wzv.win.tue.nl)	88	Wietse Venema (wietse@wzv.win.tue.nl)
89	Department of Mathematics and Computing Science	89	Department of Mathematics and Computing Science
90	Eindhoven University of Technology	90	Eindhoven University of Technology
91	Den Dolech 2, P.O. Box 513,	91	Den Dolech 2, P.O. Box 513,
92	5600 MB Eindhoven, The Netherlands	92	5600 MB Eindhoven, The Netherlands
93	\" @(#) hosts_access.3 1.8 96/02/11 17:01:26	93	.\" @(#) hosts_access.3 1.8 96/02/11 17:01:26

Return to bug 75545

Lines 27-37 Link Here

(-)./heap.3 (-76 / +75 lines)
27	.Nm heap_increased ,	27	.Nm heap_increased ,
28	.Nm heap_decreased ,	28	.Nm heap_decreased ,
29	.Nm heap_element ,	29	.Nm heap_element ,
30	.Nm heap_for_each	30	.Nm heap_for_each
31	.Nd heap implementation of priority queues	31	.Nd heap implementation of priority queues
32	.Sh SYNOPSIS	32	.Sh SYNOPSIS
33	.Fd #include <isc/heap.h>	33	.Fd #include <isc/heap.h>
34	.Ft heap_context	34	.Ft heap_context
35	.Fn heap_new "heap_higher_priority_func higher_priority" \	35	.Fn heap_new "heap_higher_priority_func higher_priority" \
36	"heap_index_func index" "int array_size_increment"	36	"heap_index_func index" "int array_size_increment"
37	.Ft int	37	.Ft int
Lines 46-52 Link Here
46	.Fn heap_decreased "heap_context ctx" "int i"	46	.Fn heap_decreased "heap_context ctx" "int i"
47	.Ft void *	47	.Ft void *
48	.Fn heap_element "heap_context ctx" "int i"	48	.Fn heap_element "heap_context ctx" "int i"
49	.Ft int	49	.Ft int
50	.Fn heap_for_each "heap_context ctx" "heap_for_each_func action" "void *uap"	50	.Fn heap_for_each "heap_context ctx" "heap_for_each_func action" "void *uap"
51	.Sh DESCRIPTION	51	.Sh DESCRIPTION
52	These functions implement heap\-based priority queues. The user defines a	52	These functions implement heap\-based priority queues. The user defines a
Lines 59-65 Link Here
59	Each of the functions depends upon the	59	Each of the functions depends upon the
60	.Ft heap_context	60	.Ft heap_context
61	type, which is a pointer to a	61	type, which is a pointer to a
62	.Ft struct heap_context	62	.Ft struct heap_context
63	.Pq see Pa heap.h No for more information .	63	.Pq see Pa heap.h No for more information .
64	.Pp	64	.Pp
65	The	65	The
Lines 73-93 Link Here
73	.Ed	73	.Ed
74	.Pp	74	.Pp
75	These are pointers to user-defined functions.	75	These are pointers to user-defined functions.
76	The	76	The
77	.Ft heap_higher_priority_func	77	.Ft heap_higher_priority_func
78	type is a pointer to a function which compares two	78	type is a pointer to a function which compares two
79	different heap (queue) elements and returns an	79	different heap (queue) elements and returns an
80	.Ft int	80	.Ft int
81	which answers the question, "Does the first queue element	81	which answers the question, "Does the first queue element
82	have a higher priority than the second?" In other words,	82	have a higher priority than the second?" In other words,
83	a function pointer of this type	83	a function pointer of this type
84	.Em must	84	.Em must
85	return a number greater than zero	85	return a number greater than zero
86	if the element indicated by the first argument is of a higher priority than	86	if the element indicated by the first argument is of a higher priority than
87	that indicated by the second element, and zero otherwise.	87	that indicated by the second element, and zero otherwise.
88	.Pp	88	.Pp
89	The other two function pointers are documented in the descriptions	89	The other two function pointers are documented in the descriptions
90	of	90	of
91	.Fn heap_new	91	.Fn heap_new
92	.Pq Va heap_index_func	92	.Pq Va heap_index_func
93	and	93	and
Lines 97-149 Link Here
97	.Pp	97	.Pp
98	The function	98	The function
99	.Fn heap_new	99	.Fn heap_new
100	initializes a	100	initializes a
101	.Ft struct heap_context	101	.Ft struct heap_context
102	and returns a pointer to it. The	102	and returns a pointer to it. The
103	.Fa higher_priority	103	.Fa higher_priority
104	function pointer	104	function pointer
105	.Em must	105	.Em must
106	be	106	be
107	.No non\- Ns Dv NULL .	107	.No non\- Ns Dv NULL .
108	As explained above, this refers to a	108	As explained above, this refers to a
109	function supplied by the user which compares the priority of two different	109	function supplied by the user which compares the priority of two different
110	queue or heap elements; see above for more information.	110	queue or heap elements; see above for more information.
111	The second argument,	111	The second argument,
112	.Fa index ,	112	.Fa index ,
113	is a pointer to a user-defined function whose arguments are	113	is a pointer to a user-defined function whose arguments are
114	a heap element and its index in the heap.	114	a heap element and its index in the heap.
115	.Fa Index	115	.Fa Index
116	is intended to provide the user a means of knowing the internal index	116	is intended to provide the user a means of knowing the internal index
117	of an element in the heap while maintaining the opacity of the implementation;	117	of an element in the heap while maintaining the opacity of the implementation;
118	since the user has to know the actual indexes of heap elements in order to use,	118	since the user has to know the actual indexes of heap elements in order to use,
119	e.g.,	119	e.g.,
120	.Fn heap_delete	120	.Fn heap_delete
121	or	121	or
122	.Fn heap_element ,	122	.Fn heap_element ,
123	the user	123	the user
124	.Fa index	124	.Fa index
125	function could store the index in the heap element, itself. If	125	function could store the index in the heap element, itself. If
126	.Fa index	126	.Fa index
127	is	127	is
128	.No non\- Ns Dv NULL ,	128	.No non\- Ns Dv NULL ,
129	then it is called	129	then it is called
130	.Em whenever	130	.Em whenever
131	the index of an element changes, allowing the user to stay up\-to\-date	131	the index of an element changes, allowing the user to stay up\-to\-date
132	with index changes.	132	with index changes.
133	The last argument,	133	The last argument,
134	.Fa array_size_increment	134	.Fa array_size_increment
135	will be used, as its name suggests, by	135	will be used, as its name suggests, by
136	.Xr malloc 3	136	.Xr malloc 3
137	or	137	or
138	.Xr realloc 3	138	.Xr realloc 3
139	to increment the array which implements the heap; if zero, a default value	139	to increment the array which implements the heap; if zero, a default value
140	will be used.	140	will be used.
141	.Pp	141	.Pp
142	The	142	The
143	.Fn heap_free	143	.Fn heap_free
144	function frees the given	144	function frees the given
145	.Ft heap_context	145	.Ft heap_context
146	argument	146	argument
147	.Pq Fa ctx ,	147	.Pq Fa ctx ,
148	which also frees the entire	148	which also frees the entire
149	.Nm heap ,	149	.Nm heap ,
Lines 154-191 Link Here
154	should be	154	should be
155	.No non\- Ns Dv NULL .	155	.No non\- Ns Dv NULL .
156	.Pp	156	.Pp
157	The	157	The
158	.Fn heap_insert	158	.Fn heap_insert
159	function is used to insert the new heap element	159	function is used to insert the new heap element
160	.Fa elt	160	.Fa elt
161	into the appropriate place (priority\-wise) in the	161	into the appropriate place (priority\-wise) in the
162	.Ft heap	162	.Ft heap
163	indicated by	163	indicated by
164	.Fa ctx	164	.Fa ctx
165	(a pointer to a	165	(a pointer to a
166	.Ft heap_context ) .	166	.Ft heap_context ) .
167	If	167	If
168	.No non\- Ns Dv NULL ,	168	.No non\- Ns Dv NULL ,
169	the user-defined	169	the user-defined
170	.Ft higher_priority	170	.Ft higher_priority
171	function pointer associated with the indicated	171	function pointer associated with the indicated
172	.Nm heap	172	.Nm heap
173	is used to determine that	173	is used to determine that
174	.Dq appropriate place ;	174	.Dq appropriate place ;
175	the highest\-priority elements are at the front of the queue (top of	175	the highest\-priority elements are at the front of the queue (top of
176	the heap).	176	the heap).
177	(See the description of	177	(See the description of
178	.Fn heap_new ,	178	.Fn heap_new ,
179	above, for more information.)	179	above, for more information.)
180	.Pp	180	.Pp
181	The function	181	The function
182	.Fn heap_delete	182	.Fn heap_delete
183	is used to delete the	183	is used to delete the
184	.Fa i\- Ns th	184	.Fa i\- Ns th
185	element of the queue (heap), and fixing up the queue (heap) from that	185	element of the queue (heap), and fixing up the queue (heap) from that
186	element onward via the priority as determined by the user function	186	element onward via the priority as determined by the user function
187	pointed to by	187	pointed to by
188	.Ft higher_priority	188	.Ft higher_priority
189	function pointer	189	function pointer
190	(see description of	190	(see description of
191	.Fn heap_new ,	191	.Fn heap_new ,
Lines 195-201 Link Here
195	.Pp	195	.Pp
196	.Fn heap_decreased	196	.Fn heap_decreased
197	.Pp	197	.Pp
198	The	198	The
199	.Fn heap_element	199	.Fn heap_element
200	function returns the	200	function returns the
201	.Fa i\- Ns th	201	.Fa i\- Ns th
Lines 207-223 Link Here
207	.Fn heap_for_each	207	.Fn heap_for_each
208	function provides a mechanism for the user to increment through the entire	208	function provides a mechanism for the user to increment through the entire
209	queue (heap) and perform some	209	queue (heap) and perform some
210	.Fa action	210	.Fa action
211	upon each of the queue elements. This	211	upon each of the queue elements. This
212	.Fa action	212	.Fa action
213	is pointer to a user\-defined function with two arguments, the first of	213	is pointer to a user\-defined function with two arguments, the first of
214	which should be interpreted by the user's function as a heap element. The	214	which should be interpreted by the user's function as a heap element. The
215	second value passed to the user function is just the	215	second value passed to the user function is just the
216	.Fa uap	216	.Fa uap
217	argument to	217	argument to
218	.Fn heap_for_each ;	218	.Fn heap_for_each ;
219	this allows the user to specify additional arguments, if necessary, to	219	this allows the user to specify additional arguments, if necessary, to
220	the function pointed to by	220	the function pointed to by
221	.Fa action .	221	.Fa action .
222	.\" The following requests should be uncommented and	222	.\" The following requests should be uncommented and
223	.\" used where appropriate. This next request is	223	.\" used where appropriate. This next request is
Lines 226-279 Link Here
226	.Bl -tag -width "heap_decreased()"	226	.Bl -tag -width "heap_decreased()"
227	.It Fn heap_new	227	.It Fn heap_new
228	.Dv NULL	228	.Dv NULL
229	if unable to	229	if unable to
230	.Xr malloc 3	230	.Xr malloc 3
231	a	231	a
232	.Ft struct heap_context	232	.Ft struct heap_context
233	or if the	233	or if the
234	.Fa higher_priority	234	.Fa higher_priority
235	function pointer is	235	function pointer is
236	.Dv NULL ;	236	.Dv NULL ;
237	otherwise, a valid	237	otherwise, a valid
238	.Ft heap_context	238	.Ft heap_context .
239	.Ns .
240	.It Fn heap_free	239	.It Fn heap_free
241	-1 if	240	-1 if
242	.Fa ctx	241	.Fa ctx
243	is	242	is
244	.Dv NULL	243	.Dv NULL
245	(with	244	(with
246	.Va errno	245	.Va errno
247	set to	246	set to
248	.Dv EINVAL ) ;	247	.Dv EINVAL ) ;
249	otherwise, 0.	248	otherwise, 0.
250	.It Fn heap_insert	249	.It Fn heap_insert
251	-1	250	-1
252	if either	251	if either
253	.Fa ctx	252	.Fa ctx
254	or	253	or
255	.Fa elt	254	.Fa elt
256	is	255	is
257	.Dv NULL ,	256	.Dv NULL ,
258	or if an attempt to	257	or if an attempt to
259	.Xr malloc 3	258	.Xr malloc 3
260	or	259	or
261	.Xr realloc 3	260	.Xr realloc 3
262	the heap array fails (with	261	the heap array fails (with
263	.Va errno	262	.Va errno
264	set to	263	set to
265	.Dv EINVAL	264	.Dv EINVAL
266	or	265	or
267	.Dv ENOMEM ,	266	.Dv ENOMEM ,
268	respectively).	267	respectively).
269	Otherwise, 0.	268	Otherwise, 0.
270	.It Fn heap_delete	269	.It Fn heap_delete
271	-1 if	270	-1 if
272	.Fa ctx	271	.Fa ctx
273	is	272	is
274	.Dv NULL	273	.Dv NULL
275	or	274	or
276	.Fa i	275	.Fa i
277	is out\-of\-range (with	276	is out\-of\-range (with
278	.Va errno	277	.Va errno
279	set to	278	set to
Lines 286-294 Link Here
286	As for	285	As for
287	.Fn heap_delete .	286	.Fn heap_delete .
288	.It Fn heap_element	287	.It Fn heap_element
289	NULL if	288	NULL if
290	.Fa ctx	289	.Fa ctx
291	is	290	is
292	.Dv NULL	291	.Dv NULL
293	or	292	or
294	.Fa i	293	.Fa i
Lines 302-312 Link Here
302	.It Fn heap_for_each	301	.It Fn heap_for_each
303	-1 if either	302	-1 if either
304	.Fa ctx	303	.Fa ctx
305	or	304	or
306	.Fa action	305	.Fa action
307	is	306	is
308	.Dv NULL	307	.Dv NULL
309	(with	308	(with
310	.Va errno	309	.Va errno
311	set to	310	set to
312	.Dv EINVAL ) ;	311	.Dv EINVAL ) ;
Lines 332-343 Link Here
332	The variable	331	The variable
333	.Va errno	332	.Va errno
334	is set by	333	is set by
335	.Fn heap_free ,	334	.Fn heap_free ,
336	.Fn heap_insert ,	335	.Fn heap_insert ,
337	.Fn heap_delete ,	336	.Fn heap_delete ,
338	.Fn heap_increased ,	337	.Fn heap_increased ,
339	and	338	and
340	.Fn heap_decreased	339	.Fn heap_decreased
341	under the conditions of invalid input	340	under the conditions of invalid input
342	.Pq Dv EINVAL	341	.Pq Dv EINVAL
343	or lack of memory	342	or lack of memory
Lines 370-378 Link Here
370	.Sh AUTHORS	369	.Sh AUTHORS
371	The	370	The
372	.Nm heap	371	.Nm heap
373	library was implemented by Bob Halley (halley@vix.com) of Vixie Enterprises,	372	library was implemented by Bob Halley (halley@vix.com) of Vixie Enterprises,
374	Inc., for the Internet Software consortium, and was adapted from	373	Inc., for the Internet Software consortium, and was adapted from
375	the two books listed in the	374	the two books listed in the
376	.Sx SEE ALSO	375	.Sx SEE ALSO
377	section, above.	376	section, above.
378	.\" .Sh BUGS	377	.\" .Sh BUGS