d/freebsd-skq
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix a little typo and get rid of a cryptic description by aligning the

Browse Source 
text to the remaining description.

Approved by: re
This commit is contained in:
rse 2011-09-02 18:13:46 +00:00
parent 3c6157dcec
commit 3eabc3bd67
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
share/man/man3/queue.3
View File

@ -193,7 +193,7 @@ O(1) removal of an entry from the head of the list.
.It
Forward traversal through the list.
.It
Swawpping the contents of two lists.
Swapping the contents of two lists.
.El
.Pp
Singly-linked lists are the simplest of the four data structures
@ -227,7 +227,7 @@ Code size is about 15% greater and operations run about 20% slower
than singly-linked lists.
.El
.Pp
Singly-linked tailqs are ideal for applications with large datasets and
Singly-linked tail queues are ideal for applications with large datasets and
few or no removals,
or for implementing a FIFO queue.
.Pp