diff options
Diffstat (limited to 'man3/queue.3')
| -rw-r--r-- | man3/queue.3 | 32 |
1 files changed, 16 insertions, 16 deletions
diff --git a/man3/queue.3 b/man3/queue.3 index 8cb42d0231..cbe72e29df 100644 --- a/man3/queue.3 +++ b/man3/queue.3 @@ -38,15 +38,15 @@ The header file provides a set of macros that define and operate on the following data structures: .IP * 3 -singly-linked lists (SLIST) +singly linked lists (SLIST) .IP * -doubly-linked lists (LIST) +doubly linked lists (LIST) .IP * -singly-linked tail queues (STAILQ) +singly linked tail queues (STAILQ) .IP * -doubly-linked tail queues (TAILQ) +doubly linked tail queues (TAILQ) .IP * -doubly-linked circular queues (CIRCLEQ) +doubly linked circular queues (CIRCLEQ) .PP All structures support the following functionality: .IP * 3 @@ -63,17 +63,17 @@ Forward traversal through the list. Code size and execution time depend on the complexity of the data structure being used, so programmers should take care to choose the appropriate one. -.SS Singly-linked lists (SLIST) -Singly-linked lists are the simplest +.SS Singly linked lists (SLIST) +Singly linked lists are the simplest and support only the above functionality. -Singly-linked lists are ideal for applications with +Singly linked lists are ideal for applications with large datasets and few or no removals, or for implementing a LIFO queue. -Singly-linked lists add the following functionality: +Singly linked lists add the following functionality: .IP * 3 O(n) removal of any entry in the list. -.SS Singly-linked tail queues (STAILQ) -Singly-linked tail queues add the following functionality: +.SS Singly linked tail queues (STAILQ) +Singly linked tail queues add the following functionality: .IP * 3 Entries can be added at the end of a list. .IP * @@ -87,10 +87,10 @@ All list insertions must specify the head of the list. .IP * Each head entry requires two pointers rather than one. .PP -Singly-linked tail queues are ideal for applications with +Singly linked tail queues are ideal for applications with large datasets and few or no removals, or for implementing a FIFO queue. -.SS Doubly-linked data structures +.SS Doubly linked data structures All doubly linked types of data structures (lists and tail queues) additionally allow: .IP * 3 @@ -101,7 +101,7 @@ O(1) removal of any entry in the list. However: .IP * 3 Each element requires two pointers rather than one. -.SS Doubly-linked lists (LIST) +.SS Doubly linked lists (LIST) Linked lists are the simplest of the doubly linked data structures. They add the following functionality over the above: .IP * 3 @@ -111,7 +111,7 @@ However: .IP * 3 To traverse backwards, an entry to begin the traversal and the list in which it is contained must be specified. -.SS Doubly-linked tail queues (TAILQ) +.SS Doubly linked tail queues (TAILQ) Tail queues add the following functionality: .IP * 3 Entries can be added at the end of a list. @@ -125,7 +125,7 @@ However: All list insertions and removals must specify the head of the list. .IP * Each head entry requires two pointers rather than one. -.SS Doubly-linked circular queues (CIRCLEQ) +.SS Doubly linked circular queues (CIRCLEQ) Circular queues add the following functionality over the above: .IP * 3 The first and last entries are connected. |