diff options
| author | rse <rse@FreeBSD.org> | 2011-09-02 18:13:46 +0000 |
|---|---|---|
| committer | rse <rse@FreeBSD.org> | 2011-09-02 18:13:46 +0000 |
| commit | 3eabc3bd6730579948f9d6ae7f8e0c3b21e4de26 (patch) | |
| tree | e3bf592589072b186c38ade58e5ebef7555be4a6 /share/man/man3 | |
| parent | 3c6157dcec8563160d0e3361149672558f3eee89 (diff) | |
| download | FreeBSD-src-3eabc3bd6730579948f9d6ae7f8e0c3b21e4de26.zip FreeBSD-src-3eabc3bd6730579948f9d6ae7f8e0c3b21e4de26.tar.gz | |
Fix a little typo and get rid of a cryptic description by aligning the
text to the remaining description.
Approved by: re
Diffstat (limited to 'share/man/man3')
| -rw-r--r-- | share/man/man3/queue.3 | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/share/man/man3/queue.3 b/share/man/man3/queue.3 index 007ca5c..76f9464 100644 --- a/share/man/man3/queue.3 +++ b/share/man/man3/queue.3 @@ -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 |
